Researchers Launch Math Challenge to Shrink STARK Proofs

The initiative invites human and AI participation to optimize proof verification efficiency for blockchain rollups.

Updated on Oct. 28, 2026 in Mathematics

Isometric editorial illustration of a complex crystalline lattice structure, representing the structure of optimized mathematical proofs.
Researchers have launched a global mathematics challenge to optimize STARK cryptographic proofs, aiming to reduce blockchain verification costs and network overhead. AI Illustration. Upload story photo >

Live Poll

Do you trust AI agents to contribute meaningful, accurate results to complex scientific research?

Organizers have launched an open mathematics challenge seeking to improve the efficiency of STARK proofs by reducing the number of bad challenges in Reed-Solomon proximity tests. The project invites both human researchers and AI agents to submit contributions using the Lean formal verification language.

Why it matters

Smaller STARK proofs are vital for blockchain rollups because they significantly reduce verification costs and operational overhead. Improving these mathematical bounds allows networks to run fewer security checks without compromising protocol integrity.

The challenge seeks an O(n) bound for bad challenges with a target ceiling of 16n when agreement is at least 5/8. Current efforts aim to shift proof strategies from 200 queries down to 148, with a theoretical floor of 100 for 100-bit security.

The players

Lean

This is a functional programming language and interactive theorem prover used for formal verification of mathematical proofs.

The details

Participants are tasked with proving bounds on bad challenges, which have been observed at approximately 7.125n in certified counterexamples. The project documentation tracks contributions in a research graph, rewarding both human and AI solvers for their formal verification work in the Lean language.

Timeline

  1. The mathematics challenge was launched on October 28, 2026.

The Big Picture

This effort follows the pattern set by the development of STARK-based blockchain rollups. It attempts to overcome current verification bottlenecks by formalizing proof bounds through a rigorous, community-driven mathematical framework.

Future breakthroughs in STARK efficiency could lead to lower transaction fees and faster settlement times for users on networks like Ethereum. Successful optimization means that digital assets and smart contracts will eventually require significantly less computational power to verify.

The takeaway

Optimizing mathematical proofs is a critical step in making decentralized networks more scalable and cost-effective. Researchers and developers can improve system performance by applying formal verification to reduce the complexity of cryptographic check processes.

Further reading

Learn more about the latest developments in the field of Mathematics.

More information

Review the technical requirements and contribute to the math challenge participation and documentation.

Live Poll

Do you trust AI agents to contribute meaningful, accurate results to complex scientific research?