mthiim

5 ms·

1.
by mthiim 1y ago
Seems quite advanced for a '88 educational toy. For comparison, I got a VTech SmartStart for xmas in the early '90s and it had just a short 14-segment display line and could mainly be used together with accompanying paper books :-
2.
by mthiim 1y ago
I imagine G.H. Hardy might be like: e is the unique base of a logarithm function, ln(n), so so that the average distance between prime numbers less than n, converges proportionally towards ln(n) - the ratio between ln(n) and the actual ave
3.
by mthiim 1y ago
To me it was only when we got to radioactive decay in physics it clicked to me why the particular "e" was special and useful. Background: exp(x) was introduced as the inverse to log(x), defined as the area under 1/x etc. It w
4.
by mthiim 3y ago
Thanks a lot! :)
5.
by mthiim 3y ago
This conversion O(2^n) -> O(2^n/2) only applies to Grover's algorithm which can be used to break symmetric crypto (AES etc.). This is not the usual concern in the context of quantum computers because it just corresponds to halv
6.
by mthiim 3y ago
Yes absolutely: If both security elements fail (quantum computers that break classical crypto appear, and the supposed post-quantum element turns out to be insecure as well) then you're screwed. By combining you get a chain is as stron
7.
by mthiim 3y ago
Agreed. While manufacturers do show an impressive increase in the number of noisy qubits, we still have yet to see a demonstration of quantum error correction at anywhere near the levels needed to pull of a QC that breaks e.g. RSA.
8.
by mthiim 3y ago
Many-worlds etc. does not have such a limit. There are interpretations that posit that collapse is triggered by the system reaching a certain size (also GRW theory etc.). Such interpretations would preclude big quantum computers. Note that
9.
by mthiim 3y ago
True - on the other hand, that fear/principle could be applied to all algorithms that could theoretically be broke in the future. There's a lot of uncertainty concerning the scalability of quantum computers and quantum error corre
10.
by mthiim 3y ago
I'm not aware of any production-grade libs of these algorithms, but they might exist. While NIST did pick Dilthium as among the winners in summer 2022, it still hasn't been fully standardized yet. The mathematical principles are f
11.
by mthiim 3y ago
That algorithm was never chosen as a final candidate, unlike Dilithium and Kyber. Nevertheless, it remains intriguing because it advanced significantly in the competition until this vulnerability was identified, which allows for it to be cr
12.
by mthiim 3y ago
Hello everyone! I'm thrilled to see my project trending here on Hacker News. It's a pure toy implementation inspired by the paper and its reference. While it aligns with all the provided test cases, I wrote it primarily for fun an