Show HN: New world record – verified Goldbach Conjecture up to 4*10^18+7*10^13

Re:Show HN: New world record – verified Goldbach Conjecture ... by Sesse__ on Saturday April 19, 2025 @05:29AM (#43735268)

For demonstrating verification of a conjecture, surely you can do much simpler things than a zero-knowledge proof: Send one of the primes.

[ Parent | on HN ]

Re:Show HN: New world record – verified Goldbach Conjecture ... by sebzim4500 on Saturday April 19, 2025 @08:42AM (#43736025)

It would still take a nontrivial amount of computation to do all the verification afterwards. Back of the envelope calculations suggest it should less than 100x longer to find the two primes than to verify them.

[ Parent | on HN ]

Re:Show HN: New world record – verified Goldbach Conjecture ... by yujzgzc on Saturday April 19, 2025 @01:45PM (#43738032)

It'd be neat to do the verification in the same manner by redistributing one client's results to another, therefore obtaining a proof modulo client collusion.

[ Parent | on HN ]

Re:Show HN: New world record – verified Goldbach Conjecture ... by johnisgood on Saturday April 19, 2025 @10:46AM (#43736763)

I am curious about alternatives or solutions in such a setting / context.

[ Parent | on HN ]

Re:Show HN: New world record – verified Goldbach Conjecture ... by looofooo0 on Saturday April 19, 2025 @11:37AM (#43737135)

Say smaller prime is less then 10,000. Then this one or two Byte per Nummer. E.g. 100 Mio number is already 100mb or

[ Parent | on HN ]