{"name":"busy-beaver","repo":"jeff87654/busy-beaver","url":"https://midorreal.com/project/jeff87654-busy-beaver","repository":"https://github.com/jeff87654/busy-beaver","description":"Busy beaver machines with axiom-free Coq proofs: BB(7) σ > 3↑²⁰3, BB(8) > f_ω³(12), BB(9) > f_ω⁷(12), BB(10) f_(ω+1), BB(12) f_(ω+1)², BB(13)/BB(14) f_(ω+2), BB(4,3). Plus Turing machines that halt iff ZF/ZFC (253 states), ZFC + universes (296) or PA (238) is inconsistent, and one (449) that halts iff PA proves Goldbach's conjecture.","facts":{"language":{"value":"Rocq Prover","source":"https://github.com/jeff87654/busy-beaver","checked":"22 Nov 2026"},"releases":{"value":"0","source":"https://github.com/jeff87654/busy-beaver/releases","checked":"19 Nov 2026"},"contributors":{"value":"4","source":"https://github.com/jeff87654/busy-beaver/graphs/contributors","checked":"19 Nov 2026"},"archived":{"value":"no","source":"https://github.com/jeff87654/busy-beaver","checked":"22 Nov 2026"}},"stars":16.0,"writeup":{"what_it_is":"A collection of busy beaver Turing machines, each paired with a machine-checked Coq proof of a stated bound on its halting behaviour. The proofs are said to use no axioms. The repository also includes Turing machines that halt depending on whether ZF, ZFC, or PA is inconsistent, and one that halts iff PA proves Goldbach's conjecture.","audience":"Researchers and enthusiasts interested in busy beaver machines and formal verification in Coq","claims":[{"kind":"specific","claim":"Bounds on busy beaver values are proved in Coq with no axioms","excerpt":"Every bound in the tables below is a Coq theorem, checked with no","status":"not_checked"},{"kind":"specific","claim":"Some proofs are checked by continuous integration","excerpt":"[![Coq proofs](https://github.com/jeff87654/busy-beaver/actions/workflows/coq.yml/badge.svg?branch=main)]","status":"not_checked"},{"kind":"specific","claim":"A working notes companion repository exists, described as an unverified lab notebook","excerpt":"It is an unverified lab notebook: only what is proved here counts.","status":"not_checked"}],"alternatives":[],"written_by":"AI, from the project's README","date":"2026-11-17"},"why_now":null,"owner_supplied":null,"score":{"verdict":"sleeper","hype":3,"reality":76,"gap":-73,"momentum":0.0,"confidence":60,"version":"score-2.0","rule":"verdict-2.0","calculated_at":"2026-11-22T07:00:00+00:00","verdict_source":"rule"},"early_read":null,"changes":[{"date":"2026-10-04T21:09:48+00:00","text":"Repository created","source":"https://github.com/jeff87654/busy-beaver"}],"cite":"busy-beaver is a GitHub project at https://github.com/jeff87654/busy-beaver written mainly in Rocq Prover, described there as \"Busy beaver machines with axiom-free Coq proofs: BB(7) σ > 3↑²⁰3, BB(8) > f_ω³(12), BB(9) > f_ω⁷(12), BB(10) f_(ω+1), BB(12) f_(ω+1)², BB(13)/BB(14) f_(ω+2), BB(4,3). Plus Turing machines that halt iff ZF/ZFC (253 states), ZFC + universes (296) or PA (238) is inconsistent, and one (449) that halts iff PA proves Goldbach's conjecture\".","attribution":"Data from Mid or Real, https://midorreal.com/project/jeff87654-busy-beaver, checked 22 November 2026. Attribution with a link is required.","still_real":null}