News for hackers. Stuff that matters.
Re:Computer Scientists Combine Two 'Beautiful' Proof Methods by firejake308 on Friday October 04, 2024 @10:57PM (#41747406)
Okay, but I wouldn't be convinced until I've counted up to 756,912 myself and seen that there are no more leaves left after that. Isn't it supposed to be less computationally intensive to verify the proof than to complete the original calculation?

I tried learning about zero knowledge proofs during the crypto craze, but I never understood the basic idea of how it was supposed to work, much less the math involved. I'd appreciate an ELI5 from anyone who has one.

Re:Computer Scientists Combine Two 'Beautiful' Proof Methods by jonjonsonjr on Friday October 04, 2024 @11:36PM (#41747531)
The proof is that they can tell you the number of leaves (again) after you have secretly removed some. Since only you know the number you removed, if the difference between their counts matches your number, it is likely that they can indeed count the leaves on the tree. It is possible they have correctly guessed, which is why you repeat the challenge until you are convinced.
Re:Computer Scientists Combine Two 'Beautiful' Proof Methods by zmgsabst on Saturday October 05, 2024 @01:40AM (#41747960)
Or they have a way to measure your removal, eg, they don’t count leaves but branches without leaves (in the hypothetical tree example).