TMBR: March 2026

Prev: February 2026

This Month in Beaver Research

Next: April 2026

Spacetime Diagram for Fenrir using Katelyn Doucette's FractranVisualizer.

This Month in Beaver Research for March 2026. We celebrated bbchallenge's fourth birthday on 8 March.^[1] This month was quite a substantial month in Beaver research, as after more than 200 days, the last 3 informally solved BB(3,3) holdouts were formalised by mxdys in Rocq. Following the now-tradition, 3 new BB(2,5) machines were proven to not halt! This leaves us with 60 informal holdouts. There has been a 4.37% reduction in BB(6), and quite a lot of results in Fractran: With the help of AI Agent Claude Opus 4.6, it was proven tentatively that BBf(21) = 31,957,632 and a Cryptid (Fenrir) was found in BBf(22), which means that BBf(22) Is Hard.

Champions

• Discord user 50_ft_lock found a new BB(13) champion on 13 Mar which surpasses Graham's number, reducing the size by one state from the previous Graham beating TM.

General

• 1RB0RB_1LC1RE_1LF0LD_1RA1LD_1RC1RB_---1LC (bbch) was shown to be a probviously non-halting Cryptid similar to Space Needle by DrDisentangle.
• mxdys made a new Turing Machine Visualizer using longitudinal acceleration (for shift-overflow mixed-digit non-unary counters)^[1] which is available at https://ccz181078.github.io/TM/LongAcc/index.html.
• Roi H. Clem shared a visualization for Antihydra in Scratch on 17 Mar.^[2]

BB Adjacent

Fractran:

• Jason Yuen used Claude Opus 4.6 to prove all remaining 140 holdouts of BBf(21) do not halt on 22 Mar.^[3] This tentatively proves that BBf(21) = 31,957,632.
• Jason Yuen shared a BBf(22) Cryptid named Fenrir also discovered by Claude on 22 Mar.^[4] It was named after Fenrir, a wolf from Nordic mythology.
• Katelyn Doucette shared a fractran spacetime visualizer.^[5] Examples: Frankenstein's Monster, BBf(20) champion, Hydra and Space Needle.

CounterScript:

• Discord user azertyordinal introduced an esolang called CounterScript and its Busy Beaver function BBCS on 19 Mar.^[6]
• Discord user realsheepthe made a cryptid of length 23 that computes a variation of Hydra function and a length 92 program that may surpass Graham's number.

Meta

• RobinCodes and Autumn Pan were added as Discord admins.
• Famous math Youtuber 2swap made a couple of videos about Turing Machines arranged into grids and colored based on their halting status for BB(2,2), BB(3,2), BB(2,3), BB(4,2) and BB(5,2) respectively, then made a two-hour long Youtube video about the same topic on their second channel.

Holdouts

BB Holdout Reduction by Domain

Domain	Previous Holdout Count	New Holdout Count	Holdout Reduction	% Reduction
BB(6)	1214	1161	53	4.37%
BB(7)	18,195,192	18,036,852	158,340	0.87%
BB(2,5)	72	69	3	4.17%
BB(2,6)	548,993	545,005	3,988	0.73%

• BB(6): 1e14 machines: 170. 1e15 machines: 237. 53 solved machines.
  • Holdouts lists for machines not simulated to 1e14 and 1e15 steps were created. The holdouts list counts were 178 and 252 respectively. See Spreadsheet for BB6.
  • Later, prurq found 10 more machines in the holdouts list that had previously been simulated to 1e15: thus the new 1e15 holdout count was 242.
  • Andrew Ducharme solved two machines using FAR.
  • prurq found two machines^[2][3] to be Translated Cyclers. Shawn Ligocki verified one of them and discovered its preperiod to be over $10^{12}$ steps. mxdys verified the other. Both were 1e14 and 1e15 holdouts, thus reducing those holdout counts by 2.
  • mxdys found four more^[4][5] Translated Cyclers in the remaining holdouts and solved one more TM using FAR.
  • Andrew Ducharme solved a machine using FAR. This machine was a 1e14 and 1e15 holdout, thus reducing those holdout counts by 1.
  • prurq found 3 more machines previously simulated so far in the 1e14 list, and 2 more in the 1e15 list (both were also 1e14). This means 1e14 holdout count was reduced by 3, and 1e15 holdout count was reduced by 2.
  • Discord user mammillaria simulated a 1e14 holdout thus far, and then another 9 days later, therefore reducing that holdout count by 2.
  • prurq found a machine to be a Translated Cycler.
  • mxdys decided a machine using FAR.
  • mxdys released a new holdout list of 1161 machines. The new informal holdout count is 1159, and the Rocq-verified holdout count is 1187.
• BB(7):
  • Andrew Ducharme reduced the number of holdouts from 18,195,192 to 18,036,852 (a 0.87% reduction) via the mxdys FAR decider.
• BB(2,5):
  • Peacemaker II solved a machine using FAR and mxdys confirmed two^[6][7] machines to be non-halting. Thus, the new holdout count is 69, or 60 considering informal proofs.
• BB(2,6):
  • A new filtering run by Andrew Ducharme has reduced to number of holdouts from 548,993 to 545,005.^[8]
• BB(3,3):
  • mxdys formalised three remaining informal results (650, 412, 279) into Rocq.