nk_kolja

5 ms·

1.
by nk_kolja 25d ago
Reminds me of the windows fold phone. ‘‘Twas the best of phones, but out of my price range at the time. Now I have nostalgia of windows phone, the best phone os that never was. Even though I like the form factor I doubt I’d cash out 2k for
2.
by nk_kolja 29d ago
Of course years. Typo.
3.
by nk_kolja 1mo ago
So RSA 260 is about 2-3 times harder than RSA 250, which was solved in 2700 core hours in 2020, so it’s probably no algorithmic improvements, just a tweak here and there plus faster hardware.
4.
by nk_kolja 1mo ago
Impressive. I wonder the methodology. Algorithmic improvements? More probably just an implementational optimisation. Last RSA record was due to special q sieving methods if I recall well, some 3k core hours. I hope there’s a theoretical im
5.
by nk_kolja 1mo ago
Reducing the problem to a quadratic form is pretty natural, and the paper from 2009 (though i see 2015) is quite an overkill. The result is a fairly standard consequence of the theory of representation by quadratic forms, and follows from L
6.
by nk_kolja 1mo ago
Impressive. Wonder if we'll get something earth-shattering, like factoring, or maybe it is already solved just not public yet.
7.
by nk_kolja 1mo ago
What a nice comment. Indeed, it feels like it was just waiting for you to find it. That is a rather nice ritual, I think I will use it now to motivate myself to learn Scala.
8.
by nk_kolja 2mo ago
Nice! And what a beautiful website! Below the surface it's all the division with constant trick.
9.
by nk_kolja 2mo ago
I doubt it would have unlooped itself from re-counting the steps in Program D and calculating the complexity of the algorithm. I couldn't get it to do it with a weeks worth of Claude pro, and in my experience once it's stuck it&#x
10.
by nk_kolja 2mo ago
I'm happy to see someone commenting on Knuth's note. Don't worry, you probably won't need to correct anything unless you have a computer with an odd radix :)
11.
by nk_kolja 2mo ago
It probably wouldn't help, and TAOCP from the beginning is too many pages. It would help to read the division algorithm chapter. I introduce my own notation from medium->small division onwards. If it's any help u'', v
12.
by nk_kolja 2mo ago
You are absolutely right. My mistake, the MIX computed the trial quotient in step 043 in a saturated way (which was enough to control the bug, thus my comment). It does indeed loop at step 62-64 (third edition book labels). I nevertheless s
13.
by nk_kolja 2mo ago
What a lovely story
14.
by nk_kolja 2mo ago
Thank you!
15.
by nk_kolja 2mo ago
Thank you, i'm flattered!
16.
by nk_kolja 2mo ago
Thank you! Honestly, while waiting for the check I wondered what it would be, and 0x$1.00 feels just right. The name in the book came unexpectedly, it's really a reward on its own. No bug in MIX, and there is no MMIX implementation yet
17.
by nk_kolja 2mo ago
Thank you! Indeed it's the infamous Step D3. In my opinion, with the new changes and the new Theorem B, this step will feel more natural, because it's essentially extending the 2/1 division into a 3/2 division.
18.
by nk_kolja 2mo ago
I beg to differ. A loop would also call for additional run-time analysis. And Knuth changed Step D3, if it were a loop he wouldn't have had to. Additionally, there is no loop in Program D, his implementation of Algorithm D in MIX. If y
19.
by nk_kolja 2mo ago
Thank you for letting me now, but I cannot replicate the issue on Firefox. There are some issues with math and the animations not breaking on mobile, which I am working on repairing. (fixed) EDIT: I have added a different fallback font so
20.
by nk_kolja 2mo ago
It can still be cashed in, though not in any bank, you need to contact Knuth beforehand. For me it will stay framed on the wall.
21.
by nk_kolja 2mo ago
I was looking forward to uninstalling that forsaken app.
22.
A decades-old bug in Knuth's long division (TAOCP Vol II, Algorithm 4.3.1D)(kolja.rs)
228 points by nk_kolja 2mo ago|52 comments
23.
by nk_kolja 2mo ago
I found a bug in Algorithm D, the long division algorithm in Knuth's "The Art of Computer Programming". It was discussed on HN a couple of times https://news.ycombinator.com/item?id=26562819 as well as on oth
24.
by nk_kolja 4y ago
How are we going to encrypt that?
25.
by nk_kolja 4y ago
The linked article mentions the Riemann hypothesis, but the author claims to have proven the Landau-Siegel conjecture https://www.nature.com/articles/d41586-022-03689-2 , which is weaker than the Riemann hypothesis. An
26.
by nk_kolja 4y ago
What's Figma?
27.
by nk_kolja 5y ago
I'm surprised that people consider this worthy of begin published on a semi-serious blog post https://www.poshenloh.com/quadratic/ .
28.
by nk_kolja 5y ago
right click > copy image > paste somewhere Works for me :) (I pasted in Telegram FYI)