Agent Hunt: Bounty Based Collaborative Autoformalization With LLM Agents

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Brown, Chad E., Kaliszyk, Cezary, Urban, Josef
Natura: Preprint
Pubblicazione: 2026
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866908870804242432
author Brown, Chad E.
Kaliszyk, Cezary
Urban, Josef
author_facet Brown, Chad E.
Kaliszyk, Cezary
Urban, Josef
contents We describe an experiment in large-scale autoformalization of algebraic topology in an Interactive Theorem Proving (ITP) environment, where the workload is distributed among multiple LLM-based coding agents. Rather than relying on static central planning, we implement a simulated bounty-based marketplace in which agents dynamically propose new lemmas (formal statements), attach bounties to them, and compete to discharge these proof obligations and claim the bounties. The agents interact directly with the interactive proof system: they can invoke tactics, inspect proof states and goals, analyze tactic successes and failures, and iteratively refine their proof scripts. In addition to constructing proofs, agents may introduce new formal definitions and intermediate lemmas to structure the development. All accepted proofs are ultimately checked and verified by the underlying proof assistant. This setting explores collaborative, decentralized proof search and theory building, and the use of market-inspired mechanisms to scale autoformalization in ITP.
format Preprint
id arxiv_https___arxiv_org_abs_2603_06737
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Agent Hunt: Bounty Based Collaborative Autoformalization With LLM Agents
Brown, Chad E.
Kaliszyk, Cezary
Urban, Josef
Logic in Computer Science
Artificial Intelligence
Symbolic Computation
We describe an experiment in large-scale autoformalization of algebraic topology in an Interactive Theorem Proving (ITP) environment, where the workload is distributed among multiple LLM-based coding agents. Rather than relying on static central planning, we implement a simulated bounty-based marketplace in which agents dynamically propose new lemmas (formal statements), attach bounties to them, and compete to discharge these proof obligations and claim the bounties. The agents interact directly with the interactive proof system: they can invoke tactics, inspect proof states and goals, analyze tactic successes and failures, and iteratively refine their proof scripts. In addition to constructing proofs, agents may introduce new formal definitions and intermediate lemmas to structure the development. All accepted proofs are ultimately checked and verified by the underlying proof assistant. This setting explores collaborative, decentralized proof search and theory building, and the use of market-inspired mechanisms to scale autoformalization in ITP.
title Agent Hunt: Bounty Based Collaborative Autoformalization With LLM Agents
topic Logic in Computer Science
Artificial Intelligence
Symbolic Computation
url https://arxiv.org/abs/2603.06737