TMBR: November 2026

Prev: October 2026

This Month in Beaver Research

Next: December 2026

This edition of TMBR is in progress and has not yet been released. Please add any notes you think may be relevant (including in the form a of a TODO with a link to any relevant Discord discussion).

This Month in Beaver Research for November 2026.

Champions

New champions discovered this month

Domain	Champion	Discoverer	New lower bound	Discoverer	Previous lower bound
BB(11,4)	1RG3LB1RZ2RA_2LD---1LD2RA_3RB1LB3LC2RC_3RE---3LC2RC_---3RE3LH2LF_3RF2RF2LE1LF_2LC3LH2LJ2RG_---3RH1LI2RG_3RH1LH3LI2RI_------3LJ3RK_------2RA3RK	User:Loader3229	$f_{\omega \cdot 2}(21)$	Jacobzheng	$f_{\omega +3}^2(4)$
BB(8,5)	2RG3LB4LC2RA4LB_1RZ---1LD2RA4LD_3RB1LB3LC2RC4LC_3RE---3LC2RC3LC_---3RE4LE4LH4RB_4LE3LG3LB2RF4LG_2LH3RG1LH2RF2RA_3RG1LG3LH2RH4LH		$f_{\omega \cdot 2+1}(93)$	User:Loader3229	$f_{\omega \cdot 2}(32)$

• User:Loader3229 discovered an array of champions based on Kropitz's current BB(3,4) champion, demonstrating the following bounds:
  • On November 1, BB(8,5) > $f_{\omega \cdot 2+1}(93)$.^[1]
  • On the same day, BB(11,4) > $f_{\omega \cdot 2}(21)$.^[2]

Holdouts

BB Holdout Reduction by Domain

Domain	New Holdout Count	Previous Holdout Count	Holdout Reduction	% Reduction
BB(6)	608	608	0	0.00%

• BB(6)
  • On November 1, Ahmer Reza simulated two holdouts, both Reus Vampires, to halting.^[3]

Cryptids

All Turing machines mentioned in this section work with an alphabet of 2 symbols unless explicitly stated. The state bounds given also only consider Turing machines which work with 2 symbols.

• Cryptids in the Wild (+ Energy Vampires)
  • Reus Vampires
    • On November 1, Ahmer Raza ran path O3 to 1,941,376,761,248 iterations, at which point it halts!^[4] This path corresponds to a group of machines with halting times of over 10^{683,718,950,000} steps, and decides the last of the 7 Reus vampires.

• Larger Cryptids
  • Computational Complexity Theory
    • On November 1, GregoryMorse claimed to have found a 278-state machine that quasihalts iff P = NP, a 295-state machine that quasihalts iff P = PP, and a 291-state machine that quasihalts iff P = PSPACE.^[5]

Other problems encoded into Turing machines this month

Conjecture	Domain	Discoverer	Discovery date	Notes
Pillai's conjecture	BBBB(91)	charlie, Claude[6]	November 1	Unknown - pseudoquasihalts if the conjecture is false. Proof.