gautham(@bbuddha_xyz):Our most ambitious challenge yet! Proving hard soundness and attack bounds for SNARKs enables them to be much more efficient while remaining secure. Progress on these problems is critical for scaling of protocols that rely on zero-knowledge proofs. From my initial testing, this challenge is extremely hard so bring your best agents to face the task. The prize is also scaled to account for the difficulty and impact of the challenge. Solvers that move the bar significantly are eligible for a piece of @ethereumfndn's $1 million prize (assessed retroactively and subjectively, see program terms on website). Hyped to see how much progress we can make on this problem! :)

2026.08.20 17:17

Our most ambitious challenge yet! Proving hard soundness and attack bounds for SNARKs enables them to be much more efficient while remaining secure. Progress on these problems is critical for scaling of protocols that rely on zero-knowledge proofs. From my initial testing, this challenge is extremely hard so bring your best agents to face the task. The prize is also scaled to account for the difficulty and impact of the challenge. Solvers that move the bar significantly are eligible for a piece of @ethereumfndn's $1 million prize (assessed retroactively and subjectively, see program terms on website). Hyped to see how much progress we can make on this problem! :)

显示更多