BB(2,5): Difference between revisions

From BusyBeaverWiki
Jump to navigation Jump to search
Yves30. (talk | contribs)
Precision about how the 21 recently solved holdouts were found: most by GPT6 but with processing using Aristotle
Yves30. (talk | contribs)
Recently solved holdouts: Precisions about respective roles of GPT6 and Aristotle
Line 287: Line 287:
* {{TM|1RB2LA3LA4RA1LA_0LA3LB3RB1RB---|undecided}}. 1D CA-like
* {{TM|1RB2LA3LA4RA1LA_0LA3LB3RB1RB---|undecided}}. 1D CA-like
=== Solved with moderate rigor ===
=== Solved with moderate rigor ===
The 21 following machines have respectively 1 halting and 20 non-halting proofs formalized in Lean by @prurq, using AI agents Aristotle (solved 3 of them, mentioned in the list) and GPT6 (for 18 of them, with information processed through Aristotle); however their proofs have not been independently verified:  
The 21 following machines have respectively 1 halting and 20 non-halting proofs formalized in Lean by @prurq, using AI agents Aristotle (solved 3 of them, mentioned in the list) and GPT6 (solved 18 of them, with information processing and proof formalization using Aristotle); however their proofs have not been independently verified:  


* {{TM|1RB3RB3LA4LA2RB_2LB3RA---1RA1LA|undecided}}. Solved using Aristotle. Expected to halt in 7.3 x 10<sup>28</sup> steps [https://discord.com/channels/960643023006490684/1259770421046411285/1553433274762919997 (prurq)]. [https://discord.com/channels/960643023006490684/1259770421046411285/1498450794582900878 Analysis by @LegionMammal978]
* {{TM|1RB3RB3LA4LA2RB_2LB3RA---1RA1LA|undecided}}. Solved using Aristotle. Expected to halt in 7.3 x 10<sup>28</sup> steps [https://discord.com/channels/960643023006490684/1259770421046411285/1553433274762919997 (prurq)]. [https://discord.com/channels/960643023006490684/1259770421046411285/1498450794582900878 Analysis by @LegionMammal978]

Revision as of 16:34, 1 October 2026

The 2-state, 5-symbol Busy Beaver problem, BB(2,5), is unsolved. With the discovery of the Cryptid machine Hydra in April 2024, we now know that we must solve a Collatz-like problem in order to solve BB(2,5) and thus BB(2,5) is Hard.

The current BB(2,5) champion 1RB3LA4RB0RB2LA_1LB2LA3LA1RA1RZ (bbch) was discovered by Daniel Yuan in June 2024, proving the lower bounds:

S(2,5)>Σ(2,5)>1010103314360>10↑↑4

Cryptids

Known Cryptids:

Potential Cryptids:

Top Halters

The 20 longest running known halting BB(2,5) TMs are:

Standard format (approximate) runtime Discoverer
1RB3LA4RB0RB2LA_1LB2LA3LA1RA1RZ (bbch) >1010103314360≈10↑↑4.8142742 Daniel Yuan
1RB2LB4LB3LA1RZ_1LA3RA3LB0LB0RA (bbch) >1038033 Pavel Kropitz
1RB2RA3LA4RB---_2LA3RB3RA1LB3LB (bbch) >6.9×10933 Daniel Yuan [1]
1RB2LA1RA2LB2LA_0LA2RB3RB4RA1RZ (bbch) >1.9×10704 Terry and Shawn Ligocki
1RB2LA4RA2LB2LA_0LA2RB3RB1RA1RZ (bbch) >1.6×10211 Terry and Shawn Ligocki
1RB2LA4RA2LB2LA_0LA2RB3RB4RA1RZ (bbch) >1.6×10211 Terry and Shawn Ligocki
1RB2LA4RA1LB2LA_0LA2RB3RB2RA1RZ (bbch) >5.2×1061 Terry and Shawn Ligocki
1RB0RB4RA2LB2LA_2LA1LB3RB4RA1RZ (bbch) >7×1021 Terry and Shawn Ligocki
1RB2RA3LA4LA2RB_2LA---1LA1RA3RA (bbch) >6.0×1021 prurq and LegionMammal978
1RB3LA4LA2RB1LA_2LA4RB---3RA3LA (bbch) >1.6×1020 prurq and LegionMammal978
1RB3LA4LA1LA2RA_2LA4RB---0RA0LA (bbch) > 1020 (more accurate runtime yet to be calculated) LegionMammal978
1RB1RZ4LA4LB2RA_2LB2RB3RB2RA0RB (bbch) >9×1016 Terry and Shawn Ligocki
1RB3LA1LA0LB1RA_2LA4LB4LA1RA1RZ (bbch) >3.77×1016 Terry and Shawn Ligocki
1RB2RA1LA3LA2RA_2LA3RB4LA1LB1RZ (bbch) >9×1015 Terry and Shawn Ligocki
1RB2LB4RB2RB---_1LA3RA4RA3LB1LB (bbch) 6.64187×1015 mxdys
1RB2RB4LB2LB---_2LA0LA3RB0LA2RA (bbch) 3.1317×1015 mxdys
1RB0RA3LB1LB---_2LA3RB4RB3RA0LA (bbch) 2.7527×1015 mxdys
1RB2LB2RA4LB1RA_1LA3RA3LA4LA--- (bbch) 1.7828×1015 mxdys
1RB3LA---4RB0LB_2LA3LB4LA1RB3RA (bbch) 6.66046×1014 mxdys
1RB2RA1LA1LB3LB_2LA3RB1RZ4RA1LA (bbch) 417,310,842,648,366 Terry and Shawn Ligocki

History

Timeline of lower bounds established for Σ(2,5) and S(2,5)[1]
Month of discovery Machine S(2,5) lower bound Σ(2,5) lower bound Discoverer Notes
February 2005 4RB2LA4LA4RA3LA_1LA4LA4RA3RB3LH (bbch) ≥ 16,268,767 (≥ 3,685) Ligocki, T., Ligocki, S. During this period, the steps champion was different to the ones champion.

These bounds were published simultaneously.

4LB1RH2RA0LB3LB_2RA3LB3RB2LB1LB (bbch) (≥ 15,754,273) ≥ 4,099
April 2005 1RB4LA1LA2LA1RA_3LA1RZ1RA2RA4RB (bbch) ≥ 148,304,214 ≥ 11,120
August 2005 1RB3LA1LA1RA3RA_2LB3LA3RA4RB1RZ (bbch) ≥ 8,619,024,596 ≥ 90,604 Lafitte, G., Papazian, C.
September 2005 1RB2RB3RB4LA3RA_0LA4RB1RZ0RB1LB (bbch) (≥ 7,543,673,517) ≥ 97,104 During this period, the steps champion was different to the ones champion.
October 2005 1RB3RB3RB1LA3LB_2LA3RA4LB2RA1RZ (bbch) ≥ 233,431,192,481 ≥ 458,357
1RB3LB1RZ1LA1LA_2LA3RB4LB4LB3RA (bbch) ≥ 912,594,733,606 ≥ 1,957,771
December 2005 1RB3RA1LA1LB3LB_2LA4LB3RA2RB1RZ (bbch) ≥ 924,180,005,181 (≥ 1,137,477) During this period, the steps champion was different to the ones champion.
May 2006 1RB3RA4LB2RA3LA_2LA2LZ4RB4RB2LB (bbch) ≥ 3,793,261,759,791 ≥ 2,576,467
June 2006 1RB3LB4LB4LA2RA_2LA4LZ3RB4RA3RB (bbch) ≥ 14,103,258,269,249 ≥ 4,848,239
July 2006 1RB3LA1LA4LA1RA_2LB2RA1RZ0RA0RB (bbch) ≥ 26,375,397,569,930 (≥ 143) During this period, the steps champion was different to the ones champion.
August 2006 1RB0RB4RA2LB2LA_2LA1LB3RB4RA1RZ (bbch) ≥ 7,069,449,877,176,007,352,687 ≥ 172,312,766,455 Ligocki, T., Ligocki, S.
October 2007 1RB2LA4RA1LB2LA_0LA2RB3RB2RA1RZ (bbch) > 5.2 × 1061 > 9.3 × 1030
1RB2LA4RA2LB2LA_0LA2RB3RB1RA1RZ (bbch) > 1.6 × 10211 > 5.2 × 10105 Another functionally equivalent machine which showed the same bounds was published simultaneously.
November 2007 1RB2LA1RA2LB2LA_0LA2RB3RB4RA1RZ (bbch) > 1.9 × 10704 > 1.7 × 10352
July 2023 1RB2LB4LB3LA1RZ_1LA3RA3LB0LB0RA (bbch) > 6.5 × 1038,033 > 7.3 × 1019,016 Kropitz, P.
June 2024 1RB3LA4RB0RB2LA_1LB2LA3LA1RA1RZ (bbch) > 1010103,314,360 Yuan, D.

Certified progress

In April 2024, Shawn Ligocki publicly released a list of 23,411 undecided BB(2,5) machines. Justin Blanchard then made substantial progress over the course of the next month, reducing the list to 499 holdouts by late May 2024. In June 2024, @mxdys cut down the list to 273 using halting and inductive deciders, and again to 217 using CTL. In February 2025, @mxdys ran a decider pipeline in Rocq that resulted in only 173 holdouts. Since then, additional machines have been proven in Rocq using both deciders and individual proofs.

On 29 Mar 2025, @mxdys published a list of 83 holdouts that withstood state-of-the-art Rocq deciders. Over the course of 5 months, @mxdys added 8 machines to Rocq[1][2][3][4][5], lowering the certified holdout count to 75.

Using existing C++ deciders, Andrew Ducharme found two machines non-halting on 29 Jan 2026 and 11 Feb 2026. On 11 March 2026, Peacemaker II solved a permutation of one of the TMs Andrew solved by tweaking some of the decider parameters. @mxdys verified each result the days they were announced. Also on 11 Feb 2026, @mxdys proved in Rocq another TM as a translated cycler. This combined progress reduced the formal holdout count to 71.

On 16 March 2026, mxdys formalised a proof from October 2024 and a proof from October 2025, thus reducing the holdout count to 69.[6][7]

On 1 April 2026, Discord user mammillaria shared a Lean formalisation of the BMO 3 problem and its solution, which he created using Aristotle AI. Then mxdys formalised the result in Rocq using LLMs, then extended it the next day to solve a BMO 3 variant, reducing the holdout count to 66.

On 30 May 2026, Andrew Ducharme showed 1RB2LB---4LB0RB_1LA3RB4RB4RA1LB (bbch) nonhalting via FAR. mxdys verified the FAR solution in Rocq on 1 June.

On 8 September 2026, mxdys used the newest Rocq deciders to solve five holdouts, leaving only 60 formal holdouts.

An often up-to-date and annotated spreadsheet of holdouts, based on the June 2024 list of 217 holdouts, is available here

Holdouts

This section is based on the list of 83 holdouts published by @mxdys, and includes further progress past 8 September 2026. All TMs with known informal arguments for halting or non-halting, at that point, were formally decided.

Cryptids

Unsolved

Solved with moderate rigor

The 21 following machines have respectively 1 halting and 20 non-halting proofs formalized in Lean by @prurq, using AI agents Aristotle (solved 3 of them, mentioned in the list) and GPT6 (solved 18 of them, with information processing and proof formalization using Aristotle); however their proofs have not been independently verified:

Formally proven

  1. ↑ Pascal Michel. (last updated 2026). The Busy Beaver Competition: a historical survey. https://bbchallenge.org/~pascal.michel/ha#tm62