seccode

6 ms·

1.
by seccode 2y ago
There is a well-known paper related to a statistical zero-knowledge proof about Kolmogorov complexity, but this proof introduced is considered a perfect ZKP
2.
Tell HN: Perfect – not statistical – ZKP for Kolmogorov complexity
1 points by seccode 2y ago|2 comments
3.
by seccode 2y ago
I think I heard that 77 was factored as well
4.
by seccode 2y ago
Maybe truth here, but also Microsoft didn't lead their latest round, which isn't a great sign for their moat
5.
by seccode 2y ago
Contract law research
6.
by seccode 2y ago
Methodology for comparison: train zstd dictionary on enwik9. Then build my dictionary as most common words in enwik9. Mine does 13% better because of the way I discovered how you can generate dictionary replacement symbols
7.
by seccode 2y ago
This is a direct comparison to zstd with a dictionary actually
8.
by seccode 2y ago
Syracuse airport. You're telling me just because there's 2 feet of snow on the runway that you can't fly?
9.
Compressor "firn" improves ZSTD by 13%(github.com)
3 points by seccode 2y ago|3 comments
10.
by seccode 2y ago
Getting higher z-scores now. But you could always just try running the code yourself
11.
by seccode 2y ago
I used the z-score. How can you claim that the digits of pi are random, yet a random forest classifier predicted better than the distribution probability. Your claim implicitly means "there is no structure." The hard thing to unde
12.
by seccode 2y ago
Better to use statistical significance tests to talk about what is "far more likely"
13.
by seccode 2y ago
It doesn't predict better than even, it predicts better than the distribution probability
14.
by seccode 2y ago
This doesn't _break_ sha256, just opens the door to breaking sha256 with machine learning
15.
by seccode 2y ago
Old people not listening to young people
16.
by seccode 2y ago
Would greatly appreciate any peer review for this work
17.
by seccode 2y ago
My dad didn't use it for a long time but has used it now and then recently and has found it to be very impressive
18.
by seccode 2y ago
Thanks this is a good point, I'll change proof to evidence
19.
by seccode 2y ago
I'm not predicting the number I'm predicting number%2==0. The model predicted better than the distribution probability
20.
by seccode 2y ago
Thanks for teaching me some important statistics!
21.
by seccode 2y ago
Also, I am testing different ranges of digits other than first 10,000, but the problem with other ranges is that the distribution of digits is highly imbalanced and the model is not showing statistical significance, but models have a harder
22.
by seccode 2y ago
The issue is not with getting the digits, the issue is with running a large model for larger digit ranges. I tried running with 10,000,000 digits and haven't gotten a prediction yet.
23.
by seccode 2y ago
I don't think you're correct that the z-score is not being interpreted correctly. I haven't been able to find research demonstrating any non-randomness in pi, so without that we have nothing to compare it to.
24.
by seccode 2y ago
I don't have the resources to try this unfortunately. I highly encourage somebody to try. But with more digits you may have to change the model.
25.
by seccode 2y ago
Worth noting that I showed _statistical significance_, not _proof_
26.
The digits of pi are not random(github.com)
10 points by seccode 2y ago|24 comments
27.
by seccode 2y ago
Agree that IQ is a bad test for intelligence, speaking as someone with a very high IQ. I am interested to know your thoughts about the test for AI that I came up with (check my most recent post). Let me know what you think!
28.
by seccode 2y ago
I tested on the dickens dataset (Charles Dickens novels). This algorithm works well on English text. I do not expect it to be any better than zstd at binary data. I haven't tried code. It does used zstd. My algorithm is a preprocessing
29.
Show HN: New compression algorithm beats ZSTD by 14%(github.com)
1 points by seccode 2y ago|3 comments
30.
Show HN: KeyPush: Mix of Bing/ChatGPT(keypush.ai)
1 points by seccode 2y ago|1 comments

More ›