New Mathematics Challenge Targets Shorter STARK Proofs
The initiative seeks to reduce query requirements, aiming to lower costs for verifying blockchain rollup transactions.
Updated on Oct. 28, 2026 in Mathematics
Live Poll
Do you trust AI agents to contribute meaningful, accurate results to complex scientific research?
Organizers have launched a new mathematics challenge hosted at starks.provably.fast, tasking both human researchers and AI agents with optimizing STARK proof sizes. This research-stage effort aims to lower query counts, which could significantly decrease verification costs for blockchain rollups.
Why it matters
Smaller STARK proofs reduce the computational burden of verifying blockchain transactions, directly improving the efficiency of decentralized scaling solutions. Improving these mathematical bounds is critical for deploying high-throughput, low-latency rollups at scale.
Current proof strategies utilize 200 queries, while the challenge targets a reduction to 148, with a theoretical floor of 100 for 100-bit security in domains of size n=2^20. Researchers are investigating a target bound of 16n for bad challenges when agreement is at least 5/8.
The players
Lean
A formal verification language used to mathematically certify the correctness of computer-based proofs.
The details
The challenge focuses on Reed-Solomon proximity tests, which verify that a dataset conforms to a specific polynomial structure. Participants submit formal proofs in the Lean verification language to establish tighter bounds on bad challenges, which currently occur at a rate of 7.125n in known counterexamples. By capping these bad challenges, developers can minimize the number of queries required to reach cryptographic security thresholds, thereby shrinking the overall data footprint of the proof.
Timeline
October 28, 2026: Official launch of the open mathematics challenge.
The Tech Race
This effort builds upon existing recursive proof experiments that previously shrunk proof sizes from 1.3 MB to 77 KB. It directly competes against current heuristic-based proof generation to establish a mathematically rigorous, O(n) efficiency ceiling.
While currently a research-level challenge, successful outcomes will manifest as reduced gas fees and faster finality for users interacting with Ethereum rollups. No hardware or specific software is required for the public to benefit, as these improvements will be implemented by protocol developers.
The takeaway
This initiative represents a pivotal step toward making cryptographic proof generation computationally inexpensive. Developers and researchers should track the starks.provably.fast portal for updates on new O(n) bounds that will set the next industry benchmark for rollup efficiency.
Further reading
Learn more about the latest research in the field of Mathematics.
More information
Access the math challenge participation and documentation to review proof requirements and current submissions.
Source note: This article includes information reported by Crypto Briefing.
Live Poll
Do you trust AI agents to contribute meaningful, accurate results to complex scientific research?
