BB(2,5)

From BusyBeaverWiki
Revision as of 17:44, 24 April 2026 by Polygon (talk | contribs) (Undo revision 7264 by Polygon (talk) link went to a relevant channel, so not wrong)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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>104

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) 104.8142742 Daniel Yuan
1RB2LB4LB3LA1RZ_1LA3RA3LB0LB0RA (bbch) >1038033 Pavel Kropitz
1RB2LA1RA2LB2LA_0LA2RB3RB4RA1RZ (bbch) >1.9×10704 Terry and Shawn Ligocki
1RB2RA3LA4RB---_2LA3RB3RA1LB3LB (bbch) >8.3×10466 (lower bound given by score) Daniel Yuan
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.04×1021 prurq and LegionMammal978
1RB3LA4LA2RB1LA_2LA4RB---3RA3LA (bbch) >1.589×1020 prurq and 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
1RB3LA1LA2LA1RA_2LB3RA2RB4RB--- (bbch) 1.61577×1014 mxdys

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. There are 11 informal arguments, lowering the informal holdout count to 64.

Then, on 29 Jan 2026, Andrew Ducharme found a machine nonhalting. This was verified by @mxdys the same day. Hence the certified holdout count is 74, and there are still 11 informal arguments, with the informal holdout count being 63.

Later, on 11 Feb 2026, Andrew Ducharme found another machine nonhalting, again verified by @mxdys the same day. @mxdys also announced another TM as a translated cycler, thus reducing the holdout count to 72, with 61 informal holdouts.

On 11 March 2026, Peacemaker II solved a permutation of one of the TMs Andrew solved by tweaking some of the decider parameters. This result was verified by @mxdys the same day, reducing the holdout count to 71, with 60 informal holdouts.

On 16 March 2026, mxdys formalised a proof from October 2024 and a proof from October 2025, thus reducing the holdout count to 69, with 60 informal holdouts.[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, reducing the holdout count to 67, with 60 informal holdouts.

On 2 April 2026, mxdys formalised BMO 3 variant 1RB0RA3LA4LA2RA_2LB3LA---4RA3RB (bbch) using an LLM, reducing the formal holdout count to 66. The proofs for BMO 3 and its variant are available at https://github.com/ccz181078/busycoq/blob/BB6/verify/BMO3.v.

Holdouts

This section is based on the list of 83 holdouts published by @mxdys, and includes further progress as of 10 April 2026. There are 66 Rocq-holdouts, or 60 when considering informal proofs.

Cryptids

Unsolved

14 grandchildren of 1RB2LA0RB1LB_1LA3RA1RA--- (bbch)

  • 1RB2LA0RB1LB---_1LA3RA1RA4RB0LB (bbch).

and the family 1RB2LA0RB1LB---_1LA3RA1RA4LB---. See this thread for more details.

  • 1RB2LA0RB1LB---_1LA3RA1RA4LB2RB (bbch). Simulated for 9*101167 steps by @hipparcos, hasn't halted yet
  • 1RB2LA0RB1LB---_1LA3RA1RA4LB2LB (bbch). Simulated for 1.3*101094 steps by @hipparcos, hasn't halted yet
  • 1RB2LA0RB1LB---_1LA3RA1RA4LB1RB (bbch). Simulated for 9.8*101226 steps by @hipparcos, hasn't halted yet
  • 1RB2LA0RB1LB---_1LA3RA1RA4LB1LB (bbch). Simulated for 3*101140 steps by @hipparcos, hasn't halted yet
  • 1RB2LA0RB1LB---_1LA3RA1RA4LB0LB (bbch). Simulated for 2.6*10889 steps by @hipparcos, hasn't halted yet
  • 1RB2LA0RB1LB---_1LA3RA1RA4LB0RB (bbch).
  • 1RB2LA0RB1LB---_1LA3RA1RA4LB3RA (bbch).
  • 1RB2LA0RB1LB---_1LA3RA1RA4LB2RA (bbch).
  • 1RB2LA0RB1LB---_1LA3RA1RA4LB2LA (bbch).
  • 1RB2LA0RB1LB---_1LA3RA1RA4LB1RA (bbch).
  • 1RB2LA0RB1LB---_1LA3RA1RA4LB1LA (bbch).
  • 1RB2LA0RB1LB---_1LA3RA1RA4LB0RA (bbch).
  • 1RB2LA0RB1LB---_1LA3RA1RA4LB0LA (bbch).

Solved with moderate rigor

Formally proven