Hacker Newsnew | past | comments | ask | show | jobs | submit | seccode's commentslogin

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


I think I heard that 77 was factored as well


Maybe truth here, but also Microsoft didn't lead their latest round, which isn't a great sign for their moat


Contract law research


This is a direct comparison to zstd with a dictionary actually


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


Syracuse airport. You're telling me just because there's 2 feet of snow on the runway that you can't fly?


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 understand is that the classifier didn't see the test set, so what structure did it learn? At the very least this is an interesting question


This doesn't _break_ sha256, just opens the door to breaking sha256 with machine learning


Just is did NSA and friends already slip through the door


Old people not listening to young people


Young people who think they already know everything better than their seniors :)


Would greatly appreciate any peer review for this work


I hv starred the repo will come back to you in few hours


Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: