Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs
The cost of producing code is rapidly diminishing with increasingly capable AI agents, while quality assurance of generated programs has not kept pace. Formal verification provides the strongest possible guarantees, but the ability of AI models to work with verification-aware languages is hindered by the scarcity of human-written examples of programs in those languages. To tackle this prevalent data scarcity issue, we propose Formal Disco: a distributed system for coordination of LLM-based workers that can be easily applied to open-ended synthetic data generation at scale. We use Formal Disco
Lineage graph
Paper → model → repo connections mined from source citations (Tier-1 exact match).
Why these links exist
Every edge carries a method, confidence, and the source snippet that justified it — so bad links are debuggable.
- PossiblePossibly related (embedding) · 55%sileod/reasoning-core →
- PossiblePossibly related (embedding) · 53%langfuse/langfuse →
- PossiblePossibly related (embedding) · 53%Hypothetically speaking... →
- PossiblePossibly related (embedding) · 52%rasinmuhammed/misata →
- PossiblePossibly related (embedding) · 52%potpie-ai/potpie →
- LinkedLinked via arxiv author · 85%Gabriel Poesia →
“Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs”
- LinkedLinked via arxiv author · 85%Simon Henniger →
“Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs”
- LinkedLinked via arxiv author · 85%Tzu-Han Hsu →
“Formal Disco: Scalable Open-Ended Generation of Formally Verified Programs”