LogFAQs > #981472963

LurkerFAQs, Active Database ( 12.01.2023-present ), DB1, DB2, DB3, DB4, DB5, DB6, DB7, DB8, DB9, DB10, DB11, DB12, Clear
Topic List
Page List: 1
TopicHere's a really difficult math/cryptography question
Yellow
07/26/24 10:54:15 PM
#2:


Solution below, don't read, figure it out!

Anyway, the solution I had come up would be to keep Knuth hashes of each segment of the data, some manageable amount. That way I can update a Knuth hash for one segment, and then Knuth hash those together to get the final hash. I was honestly hoping for a more fancy solution.

I have an unfair advantage because I work with these things all the time.

Fun fact

03074457345618258791 is the largest prime number that will fit in the long max value
18446744073709551615

I found an old list replacement class I wrote 3 years ago that I can upgrade with this functionality
https://github.com/jamieyello/NoDb/blob/master/SlothSerializer/Internal/LowMemList.cs

I knew it would be useful one day. ( 0:50 )
https://youtu.be/mGGFBycv2Hs?si=6e63EP4ZjbjZTH7N&t=50

---
https://www.youtube.com/watch?v=5C_Wrt6pNSw
... Copied to Clipboard!
Topic List
Page List: 1