Cryptids: Difference between revisions

From BusyBeaverWiki
Jump to navigation Jump to search
Loader3229 (talk | contribs)
Loader3229 (talk | contribs)
 
(7 intermediate revisions by the same user not shown)
Line 179: Line 179:
! Name !! Behaviour !! [[Busy Beaver Functions|BB Domain]] !! [[Instruction-Limited Busy Beaver|Instructions]] !! Machine !! Source !! Date !! Discoverer !! Note
! Name !! Behaviour !! [[Busy Beaver Functions|BB Domain]] !! [[Instruction-Limited Busy Beaver|Instructions]] !! Machine !! Source !! Date !! Discoverer !! Note
|-
|-
|rowspan="4"| '''[[Logical independence|ZF/ZFC consistency]]'''
| rowspan="2" | '''[[Logical independence#Zermelo–Fraenkel_set_theory_(ZF)|ZF/ZFC consistency]]'''
|rowspan="4"| Halts iff [[wikipedia:Zermelo–Fraenkel_set_theory|Zermelo–Fraenkel set theory]], with or without the Axiom of Choice is inconsistent.
| rowspan="2" | Halts iff [[wikipedia:Zermelo–Fraenkel_set_theory|Zermelo–Fraenkel set theory]], with or without the Axiom of Choice is inconsistent. For historical machines, please refer to [[Logical independence#Zermelo–Fraenkel_set_theory_(ZF)|Logical independence]] page.
|BB(432)
|'''BB(209)'''
|
|BBi(418)
|[https://codeberg.org/ajwade/turing_machine_explorer/src/branch/main/zf2.tm Wade's machine]
|[https://github.com/jamesyc/BusyBeaver/blob/main/ZF209/data/zf209.tm Machine table]
|[https://codeberg.org/ajwade/turing_machine_explorer ajwade on codeberg.org]
|[https://github.com/jamesyc/BusyBeaver/tree/main/ZF209 jamesyc GitHub]
|style="white-space: nowrap; text-align: right;"|Aug 2025
|Wade, based on work by CatIsFluffy and O'Rear
|
|-
|BB(215)
|BBi(430)
|[https://github.com/VladimirReshetnikov/ProveIt/blob/main/Computability/BusyBeaver/Research/ZFC/k225-formal/lean215/k215_k230labels.tm Machine code]
|[https://github.com/VladimirReshetnikov/ProveIt/tree/main/Computability/BusyBeaver/Research/ZFC/k225-formal/verification/k215 VladimirReshetnikov on GitHub]
|style="white-space: nowrap; text-align: right;"|Oct 2026
|[[wikipedia:Cleo (mathematician)|Vladimir Reshetnikov]]
|Machine-checked in Peano-Arithmetic by [https://github.com/elliotglazer/k215-pa Elliot Glazer].
|-
|'''BB(211)'''
|BBi(422)
|[[Media:K211-review-by-email.zip|Machine table and Lean proof]]
|[[Media:K211-paper.pdf|Paper]]
|style="white-space: nowrap; text-align: right;"|Nov 2026
|style="white-space: nowrap; text-align: right;"|Nov 2026
|Shivam Patel
|James Chang
|422 defined transitions in the published table.
|[https://discord.com/channels/960643023006490684/960643023530762341/1570618968060858439 Discord message] Has a Lean proof. Not independently verified.
|-
|-
|'''BB(152,9)'''
|'''BB(152,9)'''
Line 215: Line 199:
|Not independently verified.
|Not independently verified.
|-
|-
|'''NF/MAC consistency'''
|'''[[Logical independence#New Foundations (NF)|NF/MAC consistency]]'''
|Halts iff [https://en.wikipedia.org/new_foundations New Foundations] is inconsistent, which is equivalent to Mac Lane set theory being inconsistent
|Halts iff [https://en.wikipedia.org/new_foundations New Foundations] is inconsistent, which is equivalent to Mac Lane set theory being inconsistent
|'''BB(192)'''
|'''BB(192)'''
Line 225: Line 209:
|Verified using Lean
|Verified using Lean
|-
|-
|rowspan="2"||'''Peano Arithmetic consistency'''
|rowspan="2"|'''[[Logical independence#Peano Arithmetic (PA)|Peano Arithmetic consistency]]'''
|rowspan="2"|Halts iff [[wikipedia:Peano arithmetic|Peano arithmetic]] is inconsistent.
|rowspan="2"|Halts iff [[wikipedia:Peano arithmetic|Peano arithmetic]] is inconsistent.
|BB(372)
|BB(372)
Line 235: Line 219:
|[https://discord.com/channels/960643023006490684/1466652214247559198/1471186212743155856 Discord announcement]
|[https://discord.com/channels/960643023006490684/1466652214247559198/1471186212743155856 Discord announcement]
|-
|-
|BB(196)
|'''BB(196)'''
|
|BBi(392)
|
|[https://github.com/jamesyc/BusyBeaver/blob/main/PA196/data/pa196.tm Machine table]
|[https://github.com/jamesyc/BusyBeaver/tree/main/PA196 jamesyc GitHub]
|[https://github.com/jamesyc/BusyBeaver/tree/main/PA196 jamesyc GitHub]
|style="white-space: nowrap; text-align: right;"|Nov 2026
|style="white-space: nowrap; text-align: right;"|Nov 2026
|James Chang
|James Chang
|
|[https://discord.com/channels/960643023006490684/960643023530762341/1570618899974721577 Discord message] Has a Lean proof. Not independently verified.
|-
|-
| rowspan="3" | '''Riemann Hypothesis'''
| rowspan="3" | '''Riemann Hypothesis'''
Line 297: Line 281:
| '''Fermat prime'''
| '''Fermat prime'''
| Halts if and only if there is a Fermat prime greater than 65537.
| Halts if and only if there is a Fermat prime greater than 65537.
| '''BB(25)'''
| BB(25)
| '''BBi(44)'''
| '''BBi(44)'''
|{{WrapTM|Machine code|1LB---_1LC---_1LD---_1LE---_1LF---_1LG0LO_0LY0RM_0LF0LI_0LJ1LI_1RK1LJ_0LL0RM_0RG1LL_0RN1RM_1RH1RN_1LP1LO_1RY0LQ_0LR0LQ_0RS1RT_1RS1LY_1RT1RU_0RV0RH_0RV0RW_0LZ1LX_0LX1LY_1LT1LY|undecided}}
|{{WrapTM|Machine code|1LB---_1LC---_1LD---_1LE---_1LF---_1LG0LO_0LY0RM_0LF0LI_0LJ1LI_1RK1LJ_0LL0RM_0RG1LL_0RN1RM_1RH1RN_1LP1LO_1RY0LQ_0LR0LQ_0RS1RT_1RS1LY_1RT1RU_0RV0RH_0RV0RW_0LZ1LX_0LX1LY_1LT1LY|undecided}}

Latest revision as of 02:07, 19 November 2026

A monstrous beaver in the style of HP Lovecraft with pink tentacles coming out of its mouth, 5 red spider eyes, horns on its head, elbows and tail, moss colored fur, sharp purple claws and webbed feet.
Lovecraftian Beaver fan art made by Lauren

Cryptids are Turing Machines whose behavior (when started on a blank tape) can be described completely by a relatively simple mathematical rule, but where that rule falls into a class of unsolved (and presumed hard) mathematical problems. This definition is somewhat subjective (What counts as a simple rule? What counts as a hard problem?). In practice, most currently known small Cryptids have Collatz-like behavior. In other words, the halting problem from blank tape of Cryptids is mathematically-hard.

If there exists a Cryptid with n states and m symbols, then BB(n, m) cannot be solved without solving this hard math problem.

The name Cryptid was proposed by Shawn Ligocki in an Oct 2023 blog post announcing the discovery of Bigfoot.

Cryptids at the Edge

This is a list of notable Minimal Cryptids (Cryptids in a domain with no strictly smaller known Cryptid). All of these Cryptids were "discovered in the wild" rather than "constructed".

Name BB/BBi domain Machine Date Discoverer Note
Bigfoot BB(3,3) BB(7) BBi(8) 1RB2RA1LC_2LC1RB2RB_---2LA1LA (bbch)

0RB1RB_1LC0RA_1RE1LF_1LF1RE_0RD1RD_1LG0LG_---1LB (bbch)

Nov 2023 Shawn Ligocki Probviously non-halting. The BB(7) machine is compiled by @Iijil1 at June 2024. Bigfoot comment
Hydra BB(2,5) BB(9) BBi(9) 1RB3RB---3LA1RA_2LA3RA4LB0LB0LA (bbch) and all BB(9) machines in File:Hydra 9 states.txt May 2024 Daniel Yuan Probviously non-halting. The BB(9) machines are compiled by @Iijil1 at June 2024, all confirmed by Shawn Ligocki.
Bonus cryptid BB(2,5) BBi(9) 1RB3RB---3LA1RA_2LA3RA4LB0LB1LB (bbch) May 2024 Daniel Yuan Probviously non-halting.
Antihydra BB(6) 1RB1RA_0LC1LE_1LD1LC_1LA0LB_1LF1RE_---0RA (bbch) Jun 2024 mxdys, shown to be a Cryptid by Racheline. Same as Hydra but starting iteration from 8 instead of 3 and with termination condition O > 2E instead of E > 2O, hence the name Antihydra.
Lucy's Moonlight BB(6) 1RB0RD_0RC1RE_1RD0LA_1LE1LC_1RF0LD_---0RA (bbch) Mar 2025 Racheline Probviously halting.
BB(6) 1RB1RC_1LC1LE_1RA1RD_0RF0RE_1LA0LB_---1RA (bbch) Jul 2024 mxdys Variant of Hydra and Antihydra. Probviously non-halting.
BB(6) 1RB1LD_1RC1RE_0LA1LB_0LD1LC_1RF0RA_---0RC (bbch) Aug 2024 mxdys Similar random walk mechanism to Hydra, Antihydra. Probviously non-halting.
BB(6) 1RB0LD_1RC1RF_1LA0RA_0LA0LE_1LD1LA_0RB--- (bbch) Sep 2024 Daniel Yuan Similar random walk mechanism to Hydra, Antihydra. Probviously non-halting.
BB(6) 1RB0LB_1LC0RE_1LA1LD_0LC---_0RB0RF_1RE1RB (bbch) Nov 2024 Racheline Similar random walk mechanism to Hydra, Antihydra. Probviously non-halting.
Space Needle BB(6) 1RB1LA_1LC0RE_1LF1LD_0RB0LA_1RC1RE_---0LD (bbch) Jan 2025 mxdys Probviously non-halting.
BB(6) 1RB1RA_0RC1RC_1LD0LF_0LE1LE_1RA0LB_---0LC (bbch) Jul 2024 mxdys Has near-identical behavior to 16 related BB(6) holdouts. Probviously halting.
BB(6) 1RB1RE_1LC1LD_---1LA_1LB1LE_0RF0RA_1LD1RF (bbch) Jul 2024 Racheline Probviously halting.
BB(6) 1RB0RE_1LC1LD_0RA0LD_1LB0LA_1RF1RA_---1LB (bbch) Jul 2024 Racheline Probviously halting.
BB(6) 1RB0LC_0LC0RF_1RD1LC_0RA1LE_---0LD_1LF1LA (bbch) Jul 2024 Racheline Probviously halting.
BB(6) 1RB0LC_1LC0RD_1LF1LA_1LB1RE_1RB1LE_---0LE (bbch) Nov 2024 Racheline Probviously halting.
BB(6) 1RB---_0RC0RE_1RD1RF_1LE0LB_1RC0LD_1RC1RA (bbch) Nov 2024 Racheline Probviously halting.
BB(6) 1RB0LD_1RC1RA_1LD0RB_1LE1LA_1RF0RC_---1RE (bbch) Jul 2025 mxdys Probviously halting.
BB(6) 1RB1LE_0LC0LB_1RD1LC_1RD1RA_1RF0LA_---1RE (bbch) Jul 2024 Racheline Probviously decidable. Estimated to have a 3/5 chance of becoming a translated cycler and a 2/5 chance of halting.
BB(6) 1RB0RB_1LC1RE_1LF0LD_1RA1LD_1RC1RB_---1LC (bbch) Aug 2024 mxdys, shown to be a Cryptid by DrDisentangle Similar to Space Needle, probviously non-halting.
BB(6) 1RB1LA_0LC0RC_1LE1RD_1RE1RC_1LF0LA_---1LE (bbch) Apr 2026 sheep, shown to be a Cryptid by Daniel Yuan Similar to Space Needle, probviously non-halting.
BB(6) 1RB1LD_1RC0LE_1LA1RE_0LF1LA_1RB0RB_---0LB (bbch) Feb 2025 Racheline Probviously halting.

The following machines have chaotic behavior, but have not been classified as Cryptids due to seemingly lacking a connection to any known open mathematical problems, such as Collatz-like problems.

Larger Cryptids

A more complete list of notable known Cryptids over a wider range of states and symbols. These Cryptids were all "constructed" rather than "discovered". The best known bounds for each problem (with respect to BB(...), BB(..., n), and BBi(...)) are shown in bold.

Name Behaviour BB Domain Instructions Machine Source Date Discoverer Note
ZF/ZFC consistency Halts iff Zermelo–Fraenkel set theory, with or without the Axiom of Choice is inconsistent. For historical machines, please refer to Logical independence page. BB(209) BBi(418) Machine table jamesyc GitHub Nov 2026 James Chang Discord message Has a Lean proof. Not independently verified.
BB(152,9)

BB(143,11) BB(117,12)

BBi(376) calr3 GitHub Nov 2026 Charlie Reams Not independently verified.
NF/MAC consistency Halts iff New Foundations is inconsistent, which is equivalent to Mac Lane set theory being inconsistent BB(192) BBi(383) Machine table and Lean proof wlad-svennik on Github Nov 2026 svennik-alt-account Verified using Lean
Peano Arithmetic consistency Halts iff Peano arithmetic is inconsistent. BB(372) BBi(742) LegionMammal978 GitHub 2026 LegionMammal Discord announcement
BB(196) BBi(392) Machine table jamesyc GitHub Nov 2026 James Chang Discord message Has a Lean proof. Not independently verified.
Riemann Hypothesis Halts iff the Riemann hypothesis is false. BB(744) Machine code metamath-turing-machines GitHub 2016 Matiyasevich and O’Rear
BB(120) BBi(238) Machine code arxiv Sep 2026 Joseph M. Shunia
BB(95) BBi(189) Machine code DeepMind GitHub Oct 2026 Google DeepMind Not independently verified.
Goldbach Halts iff Goldbach's conjecture is false BB(25) BBi(49)
Machine code
1RB1RD_1LC1RB_0RA1LC_0LQ1RE_0LF1RG_0LC1LF_0LF0LH_1LQ1LI_0RJ0LI_1RK0LJ_0RL0RS_1RL0RM_1RN1RM_0LO0LU_0LP1LO_1RH1LX_1LR1LQ_0RK0LT_1LR1RS_---1RC_1LV1LU_0LW0LJ_0RK0LW_1RY1LX_1RE1RY (bbch)
GitHub May 2016 anonymous Its behavior has been verified in Lean.[1]
BB(21) BBi(41)
Machine code
1LJ0RF_0RJ1RD_1RP1LC_---1RE_0LO1RG_1LQ1RF_0RH0LH_0LM1LU_1RB0LI_1RJ0RK_1RL1RK_0LM0LS_1LN1LM_1LO0LC_1LQ1LO_1RD1RP_0RA0LR_0RB1LR_1LT1LS_0LU0LI_0RB0LU (bbch)
DeepMind GitHub Oct 2026 Google DeepMind Not independently verified.
BB(10,6) BBi(34)
Machine code
1RD3LB---------5RF_0RD2RC2LB3LB---5RD_0LE2LB2RC3RC2LB5LE_1LD1LI1RD3LB------_0RH1RE1LE4LE1RA1LI_---1RG------------_---1RA------------_---1RH------1RH1LI_1RF5LJ------------_0RF1LJ---------1LJ (bbch)
calr3 GitHub Oct 2026 Charlie Reams Not independently verified.
Fermat prime Halts if and only if there is a Fermat prime greater than 65537. BB(25) BBi(44)
Machine code
1LB---_1LC---_1LD---_1LE---_1LF---_1LG0LO_0LY0RM_0LF0LI_0LJ1LI_1RK1LJ_0LL0RM_0RG1LL_0RN1RM_1RH1RN_1LP1LO_1RY0LQ_0LR0LQ_0RS1RT_1RS1LY_1RT1RU_0RV0RH_0RV0RW_0LZ1LX_0LX1LY_1LT1LY (bbch)
calr3 GitHub Oct 2026 Charlie Reams Includes Lean formalization. Not independently verified.
Erdős Ternary Conjecture Halts iff Erdős Problem 406 is false. BB(15)
BB(5,4)
BBi(19)
BB(15) machine
1RB1RO_0RC0RC_0RD1RJ_0LE1RC_0LF1LK_0LG1LE_0LH1LF_1RI0LL_0RB1LK_1RC0RA_0LI1LN_1RM---_0RI0RO_0LK1LK_1LM1RA (bbch)
BB(5,4) and BBi(19) machine
1RB3RA2RA1RB_0LC2RB1RA3RB_0LD1LC2LE3LC_3RE2RE---1RE_0RB1LE2LE3LE (bbch)
bbchallenge, bbchallenge Jul 2021 Tristan Stérin (@cosmo) and Damien Woods Erdős #406 is the conjecture that "For all n > 8, there is at least one 2 in the base-3 representation of 2^n." arxiv preprint. The BB(15) machine's behavior has been verified in Lean.[2]
BB(14) BBi(27)
Machine code
1LB1RA_1LC1LB_0RD0RA_1LM0RE_1LF1RE_0LJ1LG_1RK0LH_1RI1LH_0LJ0RE_0RD1LJ_0LL1RK_1RN0LC_0LN---_0RK0LM (bbch)
Announced on Discord Oct 2026 Tristan Stérin Its behavior has been verified in Lean.[3]
Erdős Ternary Conjecture variant Halts iff the following conjecture (a variant of #406) is false: "For all n > 0, there is at least one 1 in the base-3 representation of 2^n - 1." BB(4,4) BBi(15)
Machine code
1RB2RA1RB3RA_0LC3RB2RB1RA_1RZ1LD2LC3LC_0RA1LD2LD3LD (bbch)
Announced on Discord Oct 2026 roromachine14 Not independently verified.
Sloane Ternary Conjecture Halts if and only if the following conjecture by N. J. A. Sloane is false: "For all n > 15, there is at least one 0 in the base-3 representation of 2^n." BB(6,4) BBi(21)
Machine code
2RB2RB1RA3RA_0LC1RB3RB2RA_0LE1LD2LC3LC_0RB1LD2LD3LD_1RD2RD3RD0LF_1RE2RZ------ (bbch)
Oct 2026 User:Loader3229 Not independently verified.
Ternary Conjecture variant Halts if and only if a n such that 17*2^n has no digit 2 in base-3 exists. BB(15) BBi(29)
Machine code
1RB1LB_1LA1RN_0RE1RD_0RC1RC_0LH1RC_0LG1LH_---1LF_1LF0LL_0LJ1LK_0RD1LI_1LI0LL_1LM1LN_0LI0LI_0RO1LL_1LL0LO (bbch)
Oct 2026 Jacobzheng
Weak Collatz Halts iff the weak Collatz conjecture is false. BB(124)
BB(43,4)
BBi(121) bbchallenge, bbchallenge Jul 2021 Tristan Stérin The weak Collatz conjecture states that the iterated Collatz map (3x+1) has only one cycle on the positive integers (4 -> 2 -> 1 -> 4). This is a weakened version of the usual Collatz conjecture, since it does not exclude the possibility of integers that are not part of any cycle at all. Not independently verified.
BB(14)
BB(10,3)
BBi(26)
BB(10,3) and BBi(26) machine code
2RG0RB---_1LC1RB2LC_0LI0LD2LD_1RE1LD1LF_2RC0RB---_0RJ2RG---_1RH1RG1RH_2LI1RC1RH_0RA1LI1LI_0LI1RJ1RZ (bbch)
calr3 on GitHub Oct 2026 Charlie Reams Includes Lean formalization. BB(14) verified by Shawn Ligocki.
Odd multiply perfect Halts iff an odd multiply perfect greater than 1 exists. BB(23,3) BBi(63)
Machine code
1RO0RB2RF_1LL1RB2RC_0RC0LD2LI_0LD1LD2LE_1RA1LE0RA_0RF1LG2LM_0LG1LG2LH_0RA1LH0RA_1LI---2LJ_1LK1LJ1LK_1LL1LK---_2RA1LS---_1LM---2LN_0RO1LN2RR_2LW0RP2LJ_1LQ1RP2RP_1RO1LQ2LQ_2LG1RR2RR_0RT0LS0LS_0RT1RT2RU_0LV0RU0RU_0LV---2LW_2LB1LW--- (bbch)
Discord Jul 2024 kg583 Not independently verified.
Odd perfect Halts iff an odd perfect exists. BB(37) BBi(71) Machine code calr3 GitHub Oct 2026 Charlie Reams Includes Lean formalization. Not independently verified.
Brocard Halts iff Brocard's problem n! + 1 = m2 has a solution with n > 7, i.e. beyond the known solutions n = 4, 5, 7. BB(28) BBi(55) Machine code DeepMind GitHub (PR to google-deepmind/cryptids) Nov 2026 Daniel Veljjanoski Tests n!/8 for triangularity. Includes a Lean formalization.[4] Earlier, with Lean proofs: 51 states by Jabbour and Razzouk (GitHub) and 61 states by Charlie Reams (GitHub); a 43-state table without proof is in arXiv:2605.20215.
BB(27) BBi(53) Machine code GitHub (PR to google-deepmind/cryptids) Nov 2026 Daniel Veljjanoski The 28-state machine without its start state. Includes a Lean formalization.[5] Not independently verified.
Kurepa Halts if and only if Kurepa's conjecture is false. BB(38) BBi(65) Machine code calr3 GitHub Oct 2026 Charlie Reams Includes Lean formalization. Not independently verified.
BB(19) BBi(37)
Machine code
1LL1RJ_0RC1RB_0RD1RC_0LE0RB_1LF1LH_0LG1LF_1RD1LG_0LI1LH_0RJ1LF_0RK1LJ_1RA1RL_0LJ0RM_0RN1RM_1LO1RN_0LR0LP_0LQ1LP_1RL1LQ_---1LS_1LB1LS (bbch)
GitHub (PR to google-deepmind/cryptids) Nov 2026 Daniel Veljjanoski Same scheme as the 38-state machine, with half factorials. Includes a Lean formalization.[6] Not independently verified.
Legendre Halts iff Legendre's conjecture is false. BB(21) BBi(41)
Machine code
1LK1LA_0RH1LN_0LL1RD_0LL1RE_0RR0LF_1RS1LN_1RB0LG_1RH0RI_1RJ1RI_0LA0LM_1LQ0LO_1RC1LL_1LG1LM_0RB0LN_1RP1LO_1RC1RP_0RE1RQ_1LS1RR_1LU0LT_0LC1LT_---0RR (bbch)
GitHub (PR to google-deepmind/cryptids) Nov 2026 Daniel Veljjanoski Uses the primality test of the Goldbach machines. Includes a Lean formalization.[7] Not independently verified. Earlier, with Lean proofs: 26 states by Jabbour and Razzouk (GitHub) and 44 states by Charlie Reams (GitHub).
Oppermann Halts iff Oppermann's conjecture is false. BB(22) BBi(43)
Machine code
1RJ1RA_1RD1LB_0RI1LN_0LB1RE_0LB1RF_0RR0LG_0LE1LN_1RC0LH_1RI0RA_0LK0LM_1LL1LK_1LQ0LO_1LH1LM_0RC0LN_1RP1LO_1RD1RP_0RF1RQ_1LS1RR_0LV1LT_0RT0LU_0LD1LU_---1RF (bbch)
GitHub (PR to google-deepmind/cryptids) Nov 2026 Daniel Veljjanoski The Legendre machine with one more state. Includes a Lean formalization.[8] Not independently verified. Earlier, with Lean proofs: 28 states by Jabbour and Razzouk (GitHub) and 45 states by Charlie Reams (GitHub).
Sierpiński Halts iff 78,557 is the smallest Sierpiński number. BB(60) BBi(104) Machine code calr3 GitHub Oct 2026 Charlie Reams Includes Lean formalization. Not independently verified.
Riesel Halts iff 509,203 is the smallest Riesel number. BB(68) BBi(112) Machine code loader3229 GitHub Oct 2026 User:Loader3229 and DeepSeek Includes Lean formalization. Not independently verified.
Fermat's Last Theorem Does not halt. BB(400) Not provided. Studies in Turing Machines (1965), pp. 81--82 1965 James Randels From Randels' doctoral dissertation Studies in Turing Machines (1965). The machine was a cryptid until Wiles resolved Fermat's Last Theorem in 1994; it is now known that it cannot halt. The machine is not explicitly given, but there is a flowchart to construct the machine, and the state count is claimed to be less than 400.
BB(90) BBi(160) Machine code calr3 GitHub Oct 2026 Charlie Reams Includes Lean formalization. Not independently verified.

Cryptids for other BB-style functions

Beeping Busy Beaver

Cryptids were actually noticed in the Beeping Busy Beaver problem before they were in the classic Busy Beaver. See Mother of Giants describing a "family" of Turing machines which "probviously" quasihalt, but requires solving a Collatz-like problem in order to actually prove it. Mother of Giants are all TMs formed by filling in the missing transition in 1RB1LE_0LC0LB_0LD1LC_1RD1RA_---0LA with different values.

For uniform families, ordinary halting is Σ1-complete, while finite beeping is Σ2-complete. Many Π2 conjectures are therefore naturally encoded by infinitely many beeps, with quasihalting corresponding to their falsity. The quantifier form alone does not establish independence of a particular conjecture from PA or ZFC.

Name Behaviour BBB domain Machine Source Date Discoverer Note
Mother of Giants Probviously quasihalting. BBB(5) and 3 others Found "in the wild". Apr 2022 Shawn Ligocki
Erdős Problem 406 Quasihalts if and only if the full Erdős Problem 406 is true. Equivalently, quasihalts if and only if there are only finitely many powers of 2 which have only the digits 0 and 1 when written in base 3. BBB(4,4) (beep transition); BBB(5,4) (beep state)
Machine code (beep transition: C reading 0)
1RB3RA2RA1RB_0LC2RB1RA3RB_0RB1LC2LD3LC_0RB1LD2LD3LD (bbch)
Machine code (beep state: D)
1RB3RA2RA1RB_0LC2RB1RA3RB_0LD1LC2LE3LC_0RE---------_0RB1LE2LE3LE (bbch)
Based on the BB(5,4) Erdős Ternary Conjecture machine. Nov 2026 User:Loader3229
Fermat Primes Quasihalts iff there are only finitely many Fermat primes. BBB(16)
Machine code (beep state: P)
1LO1LA_0LI0LC_0LD1LC_1RE1LD_0LF0RG_0RE1LF_0RH1RG_1RB1RH_---0LJ_1LK1LJ_1RA0LL_0LM0LL_0RN1RO_1RN1LA_1RO1RP_0LA0RB (bbch)
calr3 GitHub Oct 2026 Charlie Reams Not independently verified.
Twin prime conjecture Quasihalts iff Twin Prime conjecture is false. BBB(18)
Machine code (beep transition: N reading 0)
1LB1RA_0LH0LC_0LD1LC_1RE1LD_0LF0RG_0RE1LF_0RA1RG_1RP1LI_1RL1LJ_1RP1LK_1RL1LK_0RM1RL_---0RN_0LB1RO_0LB1RO_1LQ1RP_1RR1LQ_---0RM (bbch)
calr3 GitHub Oct 2026 Charlie Reams Not independently verified.
Collatz Quasihalts iff the Collatz conjecture is false. BBB(17)
Machine code (beep state: O)
1RL0RB_1LC1RB_0LK0LD_1RE1LD_0RF0RB_0LG0LG_1LH1LG_0RA0RI_1RJ1RI_1RF1RF_0RA1LK_0LM0LM_0LN1LM_1RO1LN_0RA0RP_0RQ1RP_1RL1RQ (bbch)
Mira-Cult GitHub Oct 2026 Mira-Cult Not independently verified.
P = NP Quasihalts iff P = NP. BBB(285) (beep transition); BBB(286) (beep-state companion) Marked table; companion Lean proof Nov 2026 Mira-Cult 286-state companion also Lean-formalized.
NP = coNP Quasihalts iff NP = coNP. BBB(284) (beep transition); BBB(285) (state-exit companion) Machine package Lean proof Nov 2026 Mira-Cult 285-state state-exit companion documented.
NP = coNP Quasihalts iff NP = coNP. BBB(266) (beep transition); BBB(267) (state-exit companion) Machine package Conventional proof Nov 2026 Mira-Cult 267-state state-exit companion documented.
P = NP Quasihalts iff P = NP. BBB(278) Machine code (beep state: 10) Lean proof; NP-completeness proof Nov 2026 GregoryMorse, Claude 8 fewer states than Mira-Cult's beep-state companion.
P = PSPACE Quasihalts iff the specified alternating-quantifier language belongs to P. BBB(291) Machine code (beep state: 10) Lean proof Nov 2026 GregoryMorse, Claude
P = PP Quasihalts iff the specified majority-acceptance language belongs to P. BBB(295) Machine code (beep state: 15) Lean proof Nov 2026 GregoryMorse, Claude
NP = coNP Quasihalts iff a polynomially clocked nondeterministic guest recognizes the reference language's complement. BBB(317) Machine code (beep state: 7) Lean proof; definitions Nov 2026 GregoryMorse, Claude
Integer factorization in P Quasihalts iff the bounded-divisor decision language belongs to P. BBB(324) Machine code (beep state: 5) Lean proof Nov 2026 GregoryMorse, Claude
Discrete logarithms modulo primes in P Quasihalts iff the bounded-exponent decision language belongs to P. BBB(400) Machine code (beep state: 4) Lean proof Nov 2026 GregoryMorse, Claude
Linear-time multiplication Quasihalts iff a linear-time multiplier exists in the queue-of-stacks model. BBB(403) Machine code (beep state: 30) Lean proof; guest model Nov 2026 GregoryMorse, Claude
Graph isomorphism in P Quasihalts iff the graph-isomorphism decision language belongs to P. BBB(415) Machine code (beep state: 4) Lean proof Nov 2026 GregoryMorse, Claude
Linear-size NTT circuits Quasihalts iff the specified NTT chain-circuit condition holds. BBB(469) Machine code (beep state: 12) Lean proof; definitions Nov 2026 GregoryMorse, Claude
Twin prime conjecture Quasihalts iff the twin prime conjecture is false. BBB(19) Machine code (beep state: F) Lean proof; design Nov 2026 GregoryMorse, Claude 18-state beep-transition variant described; Lean proof covers the 19-state table.
NP ⊆ P/poly Quasihalts iff polynomial-size advice programs decide the reference language at each input length in polynomial time. BBB(325) Machine code (beep state: 6) Lean proof Nov 2026 GregoryMorse, Claude
promise-P = promise-BPP Quasihalts iff a polynomial-time guest correctly decides the specified acceptance-probability promise problem. BBB(333) Machine code (beep state: 15) Lean proof Nov 2026 GregoryMorse, Claude
L = P Quasihalts iff a fixed multihead read-only guest decides the specified P reference language within its clock. BBB(373) Machine code (beep state: 6) Lean proof Nov 2026 GregoryMorse, Claude
L = NL Quasihalts iff a fixed multihead read-only guest decides the specified NL reference language within its clock. BBB(415) Machine code (beep state: 6) Lean proof Nov 2026 GregoryMorse, Claude
Linear-time GF(2) matrix multiplication Quasihalts iff a linear-time GF(2) matrix multiplier exists in the queue-of-stacks guest model. BBB(494) Machine code (beep state: 30) Lean proof Nov 2026 GregoryMorse, Claude Linear in input size.

BitChanger

Name Domain Machine Date Discoverer Note
Size 23 BitChanger programs }}}<[}<}[}<<<]}}<[<<]}}]* Apr 2025 mxdys Similar random walk mechanism to Bigfoot. Probviously non-halting. Found "in the wild".

Boolfuck

Name Domain Machine Date Discoverer Note
BB_boolf(24) *>*>*[>[*<<]*>*[<<]*>*>] Oct 2026 sheep Similar random walk mechanism to Bigfoot. Probviously non-halting. Translation of the smallest known BitChanger cryptid.

CounterScript

Name Domain Machine Date Discoverer Note
BBCS(23) A++; B++; while B {while A {A--; C++; E++; while D {D--; E--;} while E {C++; D++; E--;}} C>>A; D>>B*3; B--;} Jun 2026 sheep Similar random walk mechanism to Hydra, Antihydra. Probviously non-halting.

Fractran

Name Domain Machine Date Discoverer Note
Fenrir BBf(22) [1/15, 27/77, 49/3, 10/49, 33/2] and 2 others Mar 2026 Jason Yuen (@-d) and Claude Opus 4.6 Similar random walk mechanism to Hydra, Antihydra. Probviously non-halting. Found "in the wild".
Frankenstein's Monster BBf(23) [1/12, 9/10, 14/3, 121/2, 5/7, 3/11] Dec 2025 Shawn Ligocki Similar random walk mechanism to Hydra, Antihydra. Probviously non-halting.
Antihydra-like Cryptid BBf(23) [9/10, 1/6, 1331/2, 14/3, 5/7, 3/11] Dec 2025 maksandchael Similar random walk mechanism to Hydra, Antihydra. Probviously non-halting.
11 Hydra-like Cryptids BBf(23) too many to display - see page Aug 2026 Jason Yuen (@-d) and Claude Opus 4.6 Similar random walk mechanism to Hydra, Antihydra. Probviously non-halting. Found "in the wild".
Hydra - compiled BBf(25) [363/14, 125/2, 22/21, 1/3, 7/11, 14/5] Dec 2025 maksandchael Compilation of Hydra.
BMO 1 - compiled BBf(36) [153/55, 2/11, 26/35, 3/7, 11/17, 7/13, 25/6, 55/2, 14/3] Nov 2025 maksandchael Compilation of BMO 1.
BBf(48) [77/2, 2/99, 17/33, 13/11, 285/119, 17/19, 1375/51, 1/17, 3/5, 243/7, 10/13] Nov 2025 maksandchael Similar to Space Needle, probviously non-halting.

Lambda Calculus

Name Domain Machine Date Discoverer Note
BBλ(74) (λ1111(λ1)1(λ2))(λλλ1(322222)) Apr 2025 50_ft_lock Similar random walk mechanism to Hydra, Antihydra. Probviously non-halting.

Pebble Automaton

Name Domain Machine Date Discoverer Note
peBBle(12) 00_00_00_40_10_00_00_08_41_11_00_a1 Oct 2026 User:AlephSquirrel Similar to BMO 1.
peBBle(86) https://discord.com/channels/960643023006490684/1535695107448381591/1554751839721750569 Sep 2026 sheep Similar random walk mechanism to Hydra, Antihydra. Probviously non-halting.

Post Tag System

Name Domain Machine Date Discoverer Note
BB_PT(11) 11111_20_1 Jul 2026 sheep, Shawn Ligocki This machine halts iff 5 eventually converges to 1 under the 5n+3 map.

Register machine

Name Domain Machine Date Discoverer Note
MBB(8) 0+B_1-FC_2-GD_0-EF_1+C_2+A_2-EH_1-B* Oct 2026 Shawn Ligocki Similar to Space Needle, probviously non-halting. An equivalent machine was analyzed. Found "in the wild".
Needle 1 MBB(8) 0+B_1+C_2-AD_1-EH_2+F_1-DG_0-EB_2-C* Oct 2026 sheep Similar to Space Needle, probviously non-halting. Found "in the wild".
Hydra - compiled MBB(10) 0-BF_1+C_1+D_0-EH_1+A_2+G_2+I_2-I*_0+J_1-IA Jun 2025 Shawn Ligocki Compilation of Hydra.
5n+1 MBB(12,2) 0+B_0+C_0+D_0+E_1-IF_1+G_0-HE_0-FJ_0+A_1-KL_0+J_0-H* Oct 2026 sheep This machine halts iff 7 eventually converges to 1 under the 5n+1 map.
Erdős Ternary Conjecture MBB(19) 4+B_4+C_0+D_0+E_2-CF_0-GI_2+H_1+F_1-JN_1-KN_1-LM_3+I_0+N_3-OQ_1+P_3-OI_0-RS_0-RE_4-E* Sep 2026 mineralli The machine halts if and only if the following conjecture by Erdős is false: "For all n > 8, there is at least one 2 in the base-3 representation of 2^n."
RH MBB(130) https://www.sciencedirect.com/science/article/pii/S0304397519304633 Feb 2020 Yuri Matiyasevich The machine halts if and only if the Riemann hypothesis is false.

Wang Tiles

Name Domain Machine Date Discoverer Note
ZFC BBWT(11487) https://github.com/jconorgrogan/k230-wang-tiles-lean Oct 2026 jconorgrogan These Wang tiles tile the whole integer plane if and only if Zermelo–Fraenkel set theory with the Axiom of Choice is consistent. Not independently verified.

References