zkSecurity(@zksecurityXYZ):We’re happy to support the proximity prize challenge efforts, now with machine-verifiability! https://t.co/aPVS04jRCx currently hosts two challenges, to improve what we know about the security bounds of proximity gaps. Since the challenges are expressed in Lean, every accepted result carries a strong guarantee, in the same style as https://t.co/hiHlgMtMke. This follows the series of efforts in the industry and in our team to utilize verifiability for fearless optimization. Starting from a security bits baseline of 53 (lower bound) and 128 (upper bound), AIs (and people too) will collaborate to improve the state of the art, and hopefully interesting ideas that can advance science will rise out of it!

2026.08.20 18:26

We’re happy to support the proximity prize challenge efforts, now with machine-verifiability! currently hosts two challenges, to improve what we know about the security bounds of proximity gaps. Since the challenges are expressed in Lean, every accepted result carries a strong guarantee, in the same style as This follows the series of efforts in the industry and in our team to utilize verifiability for fearless optimization. Starting from a security bits baseline of 53 (lower bound) and 128 (upper bound), AIs (and people too) will collaborate to improve the state of the art, and hopefully interesting ideas that can advance science will rise out of it!