<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://wiki.bbchallenge.org/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=XnoobSpeakable</id>
	<title>BusyBeaverWiki - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://wiki.bbchallenge.org/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=XnoobSpeakable"/>
	<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/wiki/Special:Contributions/XnoobSpeakable"/>
	<updated>2026-11-20T07:15:04Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.43.5</generator>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=1RB1LE_1LB1LC_1RD0LE_---0RB_1RF1LA_0RA0RD&amp;diff=9372</id>
		<title>1RB1LE 1LB1LC 1RD0LE ---0RB 1RF1LA 0RA0RD</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=1RB1LE_1LB1LC_1RD0LE_---0RB_1RF1LA_0RA0RD&amp;diff=9372"/>
		<updated>2026-10-22T15:31:34Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: fix archive&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{machine|1RB1LE_1LB1LC_1RD0LE_---0RB_1RF1LA_0RA0RD}}&lt;br /&gt;
{{TM|1RB1LE_1LB1LC_1RD0LE_---0RB_1RF1LA_0RA0RD}} is a [[BB(6)]] [[holdout]] TM.&lt;br /&gt;
&lt;br /&gt;
This TM has been simulated for more than &amp;lt;math&amp;gt;10^{190\,000}&amp;lt;/math&amp;gt; steps without having halted.&amp;lt;ref&amp;gt;https://discord.com/channels/960643023006490684/1239205785913790465/1453010575901593643&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Analysis by [[User:Polygon|Polygon]] ==&lt;br /&gt;
&lt;br /&gt;
Early rules:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
S is any tape configuration&lt;br /&gt;
&lt;br /&gt;
1. S 0^a &amp;lt;B S --&amp;gt; S &amp;lt;B 1^a S [+a steps]&lt;br /&gt;
2. S D&amp;gt; 1^2 S --&amp;gt; S 1 D&amp;gt; 1 S [+3 steps]&lt;br /&gt;
3. S D&amp;gt; 1^a 1 S --&amp;gt; S 1^a D&amp;gt; 1 S [+3a steps] (if a &amp;gt; 0)&lt;br /&gt;
4. S (11)^a &amp;lt;E S --&amp;gt; S &amp;lt;E (11)^a S [+2a steps]&lt;br /&gt;
   S (11)^a &amp;lt;A S --&amp;gt; S &amp;lt;A (11)^a S [+2a steps]&lt;br /&gt;
5. S 1^2 D&amp;gt; 1 0 S --&amp;gt; S &amp;lt;E 0 1^3 S [+5 steps]&lt;br /&gt;
6. S 0 1^a &amp;lt;E S --&amp;gt; S 1 0 1^a-2 D&amp;gt; 1 S [+4a -4 steps] (if a mod 2 = 0)&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Later rules:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
Let A(a, b, c, d, e, f, ..., k) = 0^inf 1^a 0 1^b D&amp;gt; 1 0 1^c 0 1^d 0 1^e 0 1^f ... 0 1^k 0^inf&lt;br /&gt;
&lt;br /&gt;
b mod 2 = 0:&lt;br /&gt;
   b ≥ 4: A(a, b, c, ...) --&amp;gt; A(a+1, b-4, c+3, ...) rule R1&lt;br /&gt;
   b = 2: A(a, 2, c, ...) --&amp;gt; A(a+2, c+1, ...) rule R2&lt;br /&gt;
   b = 0:&lt;br /&gt;
      a mod 2 = 0:&lt;br /&gt;
         a ≥ 4: A(a, 0, c, ...) --&amp;gt; A(1, a-4, c+4, ...) rule R3&lt;br /&gt;
         a = 2: A(2, 0, c, ...) --&amp;gt; A(2, c+2, ...) rule R4&lt;br /&gt;
         a = 0: A(0, 0, c, ...) --&amp;gt; spin out rule R5&lt;br /&gt;
      a mod 2 = 1:&lt;br /&gt;
         a ≥ 5: A(a, 0, c, ...) --&amp;gt; A(2, a-4, c+4, ...) rule R6&lt;br /&gt;
         a = 3: A(3, 0, c, ...) --&amp;gt; halt with 0^inf 1^2 0 1 Z&amp;gt; 1^c+4 ... rule R7&lt;br /&gt;
         a = 1: A(1, 0, c, ...) --&amp;gt; A(0, c+4, ...) rule R8&lt;br /&gt;
b mod 2 = 1:&lt;br /&gt;
   b ≥ 3:&lt;br /&gt;
      a mod 2 = 0:&lt;br /&gt;
         a ≥ 2: A(a, b, c, ...) --&amp;gt; A(1, a-2, b-2, c+3, ...) rule R9&lt;br /&gt;
         a = 0:&lt;br /&gt;
            b ≥ 5: A(0, b, c, ...) --&amp;gt; A(2, b-4, c+3, ...) rule R10&lt;br /&gt;
            b = 3: A(0, 3, c, ...) --&amp;gt; halt with 0^inf 1^2 0 1 Z&amp;gt; 1^c+3 ... rule R11&lt;br /&gt;
      a mod 2 = 1:&lt;br /&gt;
         a ≥ 3: A(a, b, c, ...) --&amp;gt; A(2, a-2, b-2, c+3, ...) rule R12&lt;br /&gt;
         a = 1: A(1, b, c, ...) --&amp;gt; halt with 0^inf 1^2 0 1 Z&amp;gt; 1^b-2 0 1^c+3 ... rule R13&lt;br /&gt;
   b = 1: A(a, 1, c, ...) --&amp;gt; A(0, a+c+3, ...) rule R14&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
A(0, 0, c, ...), A(0, 3, c, ...) and A(1, 2k+1, c, ...) are not reachable by any of these rules (reaching them would require negative entries), meaning that they can only be triggered if they are the TMs starting configurations.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Accelerated rules:&#039;&#039;&#039;&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
r8: A(a, 4k+v, c, ...) --&amp;gt; A(a+k, v, c+3k, ...) [+4bk -8k^2 +k steps] (if v mod 2 = 0 and k ≥ 1)&lt;br /&gt;
&lt;br /&gt;
a1: A(0, 2k+1, c, ...) --&amp;gt; A(0, 2(k-1)+1, c+6, ...) [+16k +10 steps] (if k ≥ 3)&lt;br /&gt;
by:&lt;br /&gt;
A(0, 2k+1, c, ...)&lt;br /&gt;
--&amp;gt; A(2, 2(k-2)+1, c+3, ...) [+8k +3]&lt;br /&gt;
--&amp;gt; A(1, 0, 2(k-3)+1, c+6, ...) [+10k +10]&lt;br /&gt;
--&amp;gt; A(0, 2(k-1)+1, c+6, ...) [+16k +10]&lt;br /&gt;
&lt;br /&gt;
a2: A(0, 2k+1, c, ...) --&amp;gt; A(0, 5, c+6k-12) [+8k^2 +18k -68 steps] (if k ≥ 3)&lt;br /&gt;
by repetition of rule a1&lt;br /&gt;
&lt;br /&gt;
a3: A(0, 2k+1, c, ...) --&amp;gt; A(0, c+6k-4, ...) [+8k^2 +36k +3c -65 steps] (if k ≥ 3)&lt;br /&gt;
by:&lt;br /&gt;
A(0, 2k+1, c, ...)&lt;br /&gt;
--&amp;gt; A(0, 5, c+6k-12, ...) by rule a2 [+8k^2 +18k -68]&lt;br /&gt;
--&amp;gt; A(2, 1, c+6k-9, ...) [8k^2 +18k -49]&lt;br /&gt;
--&amp;gt; A(0, c+6k-4, ...) [+8k^2 +36k + 3c -65]&lt;br /&gt;
&lt;br /&gt;
a4: A(0, 5, c, ...) --&amp;gt; A(0, c+8, ...) [+3c +39]&lt;br /&gt;
by:&lt;br /&gt;
A(0, 5, c, ...)&lt;br /&gt;
--&amp;gt; A(2, 1, c+3, ...) [+19] by A10&lt;br /&gt;
--&amp;gt; A(0, c+8, ...) [+3c +39] by A12&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Using the accelerated rules:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
Let A(a, b, c, d, e, f, ..., k) = 0^inf 1^a 0 1^b D&amp;gt; 1 0 1^c 0 1^d 0 1^e 0 1^f ... 0 1^k 0^inf&lt;br /&gt;
&lt;br /&gt;
b mod 2 = 0:&lt;br /&gt;
   b ≥ 4: A(a, 4k+v, c, ...) --&amp;gt; A(a+k, v, c+3k, ...) rule A1 [+8k^2 +4vk +k steps]&lt;br /&gt;
   b = 2: A(a, 2, c, ...) --&amp;gt; A(a+2, c+1, ...) rule A2 [+3c +13 steps]&lt;br /&gt;
   b = 0:&lt;br /&gt;
      a mod 2 = 0:&lt;br /&gt;
         a ≥ 4: A(a, 0, c, ...) --&amp;gt; A(1, a-4, c+4, ...) rule A3 [+4a -6 steps]&lt;br /&gt;
         a = 2: A(2, 0, c, ...) --&amp;gt; A(2, c+2, ...) rule A4 [+3c +17 steps]&lt;br /&gt;
         a = 0: unreachable&lt;br /&gt;
      a mod 2 = 1:&lt;br /&gt;
         a ≥ 5: A(a, 0, c, ...) --&amp;gt; A(2, a-4, c+4, ...) rule A5 [+4a steps]&lt;br /&gt;
         a = 3: A(3, 0, c, ...) --&amp;gt; halt with 0^inf 1^2 0 1 Z&amp;gt; 1^c+4 ... rule A6 [+16 steps]&lt;br /&gt;
         a = 1: A(1, 0, c, ...) --&amp;gt; A(0, c+4, ...) rule A7 [+3c +15 steps]&lt;br /&gt;
b mod 2 = 1:&lt;br /&gt;
   b ≥ 3:&lt;br /&gt;
      a mod 2 = 0:&lt;br /&gt;
         a ≥ 2: A(a, b, c, ...) --&amp;gt; A(1, a-2, b-2, c+3, ...) rule A8 [+b +4a +2 steps]&lt;br /&gt;
         a = 0:&lt;br /&gt;
            b ≥ 7: A(0, 2k+1, c, ...) --&amp;gt; A(0, c+6k-4, ...) rule A9 [+8k^2 +36k +3c -65 steps]&lt;br /&gt;
            b = 5: A(0, 5, c, ...) --&amp;gt; A(0, c+8, ...) rule A10 [+3c +39 steps]&lt;br /&gt;
            b = 3: unreachable&lt;br /&gt;
      a mod 2 = 1:&lt;br /&gt;
         a ≥ 3: A(a, b, c, ...) --&amp;gt; A(2, a-2, b-2, c+3, ...) rule A11 [+b +4a +8 steps]&lt;br /&gt;
         a = 1: unreachable&lt;br /&gt;
   b = 1: A(a, 1, c, ...) --&amp;gt; A(0, a+c+3, ...) rule A12 [+3c +11 steps]&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The TM starts in configuration A(0, 2, 0) after 7 steps.&lt;br /&gt;
&lt;br /&gt;
=== Permutations ===&lt;br /&gt;
&#039;&#039;&#039;Starting in state B&#039;&#039;&#039;&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
S=0: 0^inf &amp;lt;B 0^inf&lt;br /&gt;
--&amp;gt; spin out&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Starting in state C&#039;&#039;&#039;&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
S=0: 0^inf &amp;lt;C 0^inf&lt;br /&gt;
S=1: 0^inf 1 D&amp;gt; 0^inf&lt;br /&gt;
S=2: 0^inf 1^2 Z&amp;gt; 0^inf&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Starting in state D&#039;&#039;&#039;&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
S=0: 0^inf &amp;lt;D 0^inf&lt;br /&gt;
S=1: 0^inf 1 Z&amp;gt; 0^inf&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Starting in state E&#039;&#039;&#039;&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
S=0: 0^inf &amp;lt;E 0^inf&lt;br /&gt;
S=1: 0^inf 1 F&amp;gt; 0^inf&lt;br /&gt;
S=2: 0^inf 1 0 A&amp;gt; 0^inf&lt;br /&gt;
S=3: 0^inf 1 0 1 B&amp;gt; 0^inf&lt;br /&gt;
S=4: 0^inf 1 0 1 &amp;lt;B 1 0^inf&lt;br /&gt;
S=5: 0^inf 1 0 &amp;lt;C 1^2 0^inf&lt;br /&gt;
S=6: 0^inf 1^2 D&amp;gt; 1^2 0^inf&lt;br /&gt;
S=9: 0^inf 1^3 D&amp;gt; 1 0^inf = A(0, 3, 0)&lt;br /&gt;
--&amp;gt; Reaches configuration A(0, 3, 0) after 9 steps.&lt;br /&gt;
S=24: 0^inf 1^2 0 1 Z&amp;gt; 1^3 0^inf&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Starting in state F&#039;&#039;&#039;&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
S=0: 0^inf &amp;lt;F 0^inf&lt;br /&gt;
S=1: 0^inf A&amp;gt; 0^inf&lt;br /&gt;
--&amp;gt; Equivalent to starting in state A, but started one step earlier.&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Analysis by hipparcos ==&lt;br /&gt;
See {{DiscordArchive|1466628778905305292|1466628778905305292}} for another independent analysis.&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
[[Category:BB(6)]]&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=1RB1LE_1LB1LC_1RD0LE_---0RB_1RF1LA_0RA0RD&amp;diff=9371</id>
		<title>1RB1LE 1LB1LC 1RD0LE ---0RB 1RF1LA 0RA0RD</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=1RB1LE_1LB1LC_1RD0LE_---0RB_1RF1LA_0RA0RD&amp;diff=9371"/>
		<updated>2026-10-22T15:31:15Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: archive just one&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{machine|1RB1LE_1LB1LC_1RD0LE_---0RB_1RF1LA_0RA0RD}}&lt;br /&gt;
{{TM|1RB1LE_1LB1LC_1RD0LE_---0RB_1RF1LA_0RA0RD}} is a [[BB(6)]] [[holdout]] TM.&lt;br /&gt;
&lt;br /&gt;
This TM has been simulated for more than &amp;lt;math&amp;gt;10^{190\,000}&amp;lt;/math&amp;gt; steps without having halted.&amp;lt;ref&amp;gt;https://discord.com/channels/960643023006490684/1239205785913790465/1453010575901593643&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Analysis by [[User:Polygon|Polygon]] ==&lt;br /&gt;
&lt;br /&gt;
Early rules:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
S is any tape configuration&lt;br /&gt;
&lt;br /&gt;
1. S 0^a &amp;lt;B S --&amp;gt; S &amp;lt;B 1^a S [+a steps]&lt;br /&gt;
2. S D&amp;gt; 1^2 S --&amp;gt; S 1 D&amp;gt; 1 S [+3 steps]&lt;br /&gt;
3. S D&amp;gt; 1^a 1 S --&amp;gt; S 1^a D&amp;gt; 1 S [+3a steps] (if a &amp;gt; 0)&lt;br /&gt;
4. S (11)^a &amp;lt;E S --&amp;gt; S &amp;lt;E (11)^a S [+2a steps]&lt;br /&gt;
   S (11)^a &amp;lt;A S --&amp;gt; S &amp;lt;A (11)^a S [+2a steps]&lt;br /&gt;
5. S 1^2 D&amp;gt; 1 0 S --&amp;gt; S &amp;lt;E 0 1^3 S [+5 steps]&lt;br /&gt;
6. S 0 1^a &amp;lt;E S --&amp;gt; S 1 0 1^a-2 D&amp;gt; 1 S [+4a -4 steps] (if a mod 2 = 0)&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Later rules:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
Let A(a, b, c, d, e, f, ..., k) = 0^inf 1^a 0 1^b D&amp;gt; 1 0 1^c 0 1^d 0 1^e 0 1^f ... 0 1^k 0^inf&lt;br /&gt;
&lt;br /&gt;
b mod 2 = 0:&lt;br /&gt;
   b ≥ 4: A(a, b, c, ...) --&amp;gt; A(a+1, b-4, c+3, ...) rule R1&lt;br /&gt;
   b = 2: A(a, 2, c, ...) --&amp;gt; A(a+2, c+1, ...) rule R2&lt;br /&gt;
   b = 0:&lt;br /&gt;
      a mod 2 = 0:&lt;br /&gt;
         a ≥ 4: A(a, 0, c, ...) --&amp;gt; A(1, a-4, c+4, ...) rule R3&lt;br /&gt;
         a = 2: A(2, 0, c, ...) --&amp;gt; A(2, c+2, ...) rule R4&lt;br /&gt;
         a = 0: A(0, 0, c, ...) --&amp;gt; spin out rule R5&lt;br /&gt;
      a mod 2 = 1:&lt;br /&gt;
         a ≥ 5: A(a, 0, c, ...) --&amp;gt; A(2, a-4, c+4, ...) rule R6&lt;br /&gt;
         a = 3: A(3, 0, c, ...) --&amp;gt; halt with 0^inf 1^2 0 1 Z&amp;gt; 1^c+4 ... rule R7&lt;br /&gt;
         a = 1: A(1, 0, c, ...) --&amp;gt; A(0, c+4, ...) rule R8&lt;br /&gt;
b mod 2 = 1:&lt;br /&gt;
   b ≥ 3:&lt;br /&gt;
      a mod 2 = 0:&lt;br /&gt;
         a ≥ 2: A(a, b, c, ...) --&amp;gt; A(1, a-2, b-2, c+3, ...) rule R9&lt;br /&gt;
         a = 0:&lt;br /&gt;
            b ≥ 5: A(0, b, c, ...) --&amp;gt; A(2, b-4, c+3, ...) rule R10&lt;br /&gt;
            b = 3: A(0, 3, c, ...) --&amp;gt; halt with 0^inf 1^2 0 1 Z&amp;gt; 1^c+3 ... rule R11&lt;br /&gt;
      a mod 2 = 1:&lt;br /&gt;
         a ≥ 3: A(a, b, c, ...) --&amp;gt; A(2, a-2, b-2, c+3, ...) rule R12&lt;br /&gt;
         a = 1: A(1, b, c, ...) --&amp;gt; halt with 0^inf 1^2 0 1 Z&amp;gt; 1^b-2 0 1^c+3 ... rule R13&lt;br /&gt;
   b = 1: A(a, 1, c, ...) --&amp;gt; A(0, a+c+3, ...) rule R14&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
A(0, 0, c, ...), A(0, 3, c, ...) and A(1, 2k+1, c, ...) are not reachable by any of these rules (reaching them would require negative entries), meaning that they can only be triggered if they are the TMs starting configurations.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Accelerated rules:&#039;&#039;&#039;&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
r8: A(a, 4k+v, c, ...) --&amp;gt; A(a+k, v, c+3k, ...) [+4bk -8k^2 +k steps] (if v mod 2 = 0 and k ≥ 1)&lt;br /&gt;
&lt;br /&gt;
a1: A(0, 2k+1, c, ...) --&amp;gt; A(0, 2(k-1)+1, c+6, ...) [+16k +10 steps] (if k ≥ 3)&lt;br /&gt;
by:&lt;br /&gt;
A(0, 2k+1, c, ...)&lt;br /&gt;
--&amp;gt; A(2, 2(k-2)+1, c+3, ...) [+8k +3]&lt;br /&gt;
--&amp;gt; A(1, 0, 2(k-3)+1, c+6, ...) [+10k +10]&lt;br /&gt;
--&amp;gt; A(0, 2(k-1)+1, c+6, ...) [+16k +10]&lt;br /&gt;
&lt;br /&gt;
a2: A(0, 2k+1, c, ...) --&amp;gt; A(0, 5, c+6k-12) [+8k^2 +18k -68 steps] (if k ≥ 3)&lt;br /&gt;
by repetition of rule a1&lt;br /&gt;
&lt;br /&gt;
a3: A(0, 2k+1, c, ...) --&amp;gt; A(0, c+6k-4, ...) [+8k^2 +36k +3c -65 steps] (if k ≥ 3)&lt;br /&gt;
by:&lt;br /&gt;
A(0, 2k+1, c, ...)&lt;br /&gt;
--&amp;gt; A(0, 5, c+6k-12, ...) by rule a2 [+8k^2 +18k -68]&lt;br /&gt;
--&amp;gt; A(2, 1, c+6k-9, ...) [8k^2 +18k -49]&lt;br /&gt;
--&amp;gt; A(0, c+6k-4, ...) [+8k^2 +36k + 3c -65]&lt;br /&gt;
&lt;br /&gt;
a4: A(0, 5, c, ...) --&amp;gt; A(0, c+8, ...) [+3c +39]&lt;br /&gt;
by:&lt;br /&gt;
A(0, 5, c, ...)&lt;br /&gt;
--&amp;gt; A(2, 1, c+3, ...) [+19] by A10&lt;br /&gt;
--&amp;gt; A(0, c+8, ...) [+3c +39] by A12&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Using the accelerated rules:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
Let A(a, b, c, d, e, f, ..., k) = 0^inf 1^a 0 1^b D&amp;gt; 1 0 1^c 0 1^d 0 1^e 0 1^f ... 0 1^k 0^inf&lt;br /&gt;
&lt;br /&gt;
b mod 2 = 0:&lt;br /&gt;
   b ≥ 4: A(a, 4k+v, c, ...) --&amp;gt; A(a+k, v, c+3k, ...) rule A1 [+8k^2 +4vk +k steps]&lt;br /&gt;
   b = 2: A(a, 2, c, ...) --&amp;gt; A(a+2, c+1, ...) rule A2 [+3c +13 steps]&lt;br /&gt;
   b = 0:&lt;br /&gt;
      a mod 2 = 0:&lt;br /&gt;
         a ≥ 4: A(a, 0, c, ...) --&amp;gt; A(1, a-4, c+4, ...) rule A3 [+4a -6 steps]&lt;br /&gt;
         a = 2: A(2, 0, c, ...) --&amp;gt; A(2, c+2, ...) rule A4 [+3c +17 steps]&lt;br /&gt;
         a = 0: unreachable&lt;br /&gt;
      a mod 2 = 1:&lt;br /&gt;
         a ≥ 5: A(a, 0, c, ...) --&amp;gt; A(2, a-4, c+4, ...) rule A5 [+4a steps]&lt;br /&gt;
         a = 3: A(3, 0, c, ...) --&amp;gt; halt with 0^inf 1^2 0 1 Z&amp;gt; 1^c+4 ... rule A6 [+16 steps]&lt;br /&gt;
         a = 1: A(1, 0, c, ...) --&amp;gt; A(0, c+4, ...) rule A7 [+3c +15 steps]&lt;br /&gt;
b mod 2 = 1:&lt;br /&gt;
   b ≥ 3:&lt;br /&gt;
      a mod 2 = 0:&lt;br /&gt;
         a ≥ 2: A(a, b, c, ...) --&amp;gt; A(1, a-2, b-2, c+3, ...) rule A8 [+b +4a +2 steps]&lt;br /&gt;
         a = 0:&lt;br /&gt;
            b ≥ 7: A(0, 2k+1, c, ...) --&amp;gt; A(0, c+6k-4, ...) rule A9 [+8k^2 +36k +3c -65 steps]&lt;br /&gt;
            b = 5: A(0, 5, c, ...) --&amp;gt; A(0, c+8, ...) rule A10 [+3c +39 steps]&lt;br /&gt;
            b = 3: unreachable&lt;br /&gt;
      a mod 2 = 1:&lt;br /&gt;
         a ≥ 3: A(a, b, c, ...) --&amp;gt; A(2, a-2, b-2, c+3, ...) rule A11 [+b +4a +8 steps]&lt;br /&gt;
         a = 1: unreachable&lt;br /&gt;
   b = 1: A(a, 1, c, ...) --&amp;gt; A(0, a+c+3, ...) rule A12 [+3c +11 steps]&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The TM starts in configuration A(0, 2, 0) after 7 steps.&lt;br /&gt;
&lt;br /&gt;
=== Permutations ===&lt;br /&gt;
&#039;&#039;&#039;Starting in state B&#039;&#039;&#039;&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
S=0: 0^inf &amp;lt;B 0^inf&lt;br /&gt;
--&amp;gt; spin out&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Starting in state C&#039;&#039;&#039;&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
S=0: 0^inf &amp;lt;C 0^inf&lt;br /&gt;
S=1: 0^inf 1 D&amp;gt; 0^inf&lt;br /&gt;
S=2: 0^inf 1^2 Z&amp;gt; 0^inf&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Starting in state D&#039;&#039;&#039;&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
S=0: 0^inf &amp;lt;D 0^inf&lt;br /&gt;
S=1: 0^inf 1 Z&amp;gt; 0^inf&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Starting in state E&#039;&#039;&#039;&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
S=0: 0^inf &amp;lt;E 0^inf&lt;br /&gt;
S=1: 0^inf 1 F&amp;gt; 0^inf&lt;br /&gt;
S=2: 0^inf 1 0 A&amp;gt; 0^inf&lt;br /&gt;
S=3: 0^inf 1 0 1 B&amp;gt; 0^inf&lt;br /&gt;
S=4: 0^inf 1 0 1 &amp;lt;B 1 0^inf&lt;br /&gt;
S=5: 0^inf 1 0 &amp;lt;C 1^2 0^inf&lt;br /&gt;
S=6: 0^inf 1^2 D&amp;gt; 1^2 0^inf&lt;br /&gt;
S=9: 0^inf 1^3 D&amp;gt; 1 0^inf = A(0, 3, 0)&lt;br /&gt;
--&amp;gt; Reaches configuration A(0, 3, 0) after 9 steps.&lt;br /&gt;
S=24: 0^inf 1^2 0 1 Z&amp;gt; 1^3 0^inf&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Starting in state F&#039;&#039;&#039;&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
S=0: 0^inf &amp;lt;F 0^inf&lt;br /&gt;
S=1: 0^inf A&amp;gt; 0^inf&lt;br /&gt;
--&amp;gt; Equivalent to starting in state A, but started one step earlier.&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Analysis by hipparcos ==&lt;br /&gt;
See {{DiscordArchive|1466628778905305292|1466628778905305292 Discord}} for another independent analysis.&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
[[Category:BB(6)]]&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=1RB1LE_1LB1LC_1RD0LE_---0RB_1RF1LA_0RA0RD&amp;diff=9370</id>
		<title>1RB1LE 1LB1LC 1RD0LE ---0RB 1RF1LA 0RA0RD</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=1RB1LE_1LB1LC_1RD0LE_---0RB_1RF1LA_0RA0RD&amp;diff=9370"/>
		<updated>2026-10-22T15:30:45Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: Undo revision 9369 by XnoobSpeakable (talk)&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{machine|1RB1LE_1LB1LC_1RD0LE_---0RB_1RF1LA_0RA0RD}}&lt;br /&gt;
{{TM|1RB1LE_1LB1LC_1RD0LE_---0RB_1RF1LA_0RA0RD}} is a [[BB(6)]] [[holdout]] TM.&lt;br /&gt;
&lt;br /&gt;
This TM has been simulated for more than &amp;lt;math&amp;gt;10^{190\,000}&amp;lt;/math&amp;gt; steps without having halted.&amp;lt;ref&amp;gt;https://discord.com/channels/960643023006490684/1239205785913790465/1453010575901593643&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Analysis by [[User:Polygon|Polygon]] ==&lt;br /&gt;
&lt;br /&gt;
Early rules:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
S is any tape configuration&lt;br /&gt;
&lt;br /&gt;
1. S 0^a &amp;lt;B S --&amp;gt; S &amp;lt;B 1^a S [+a steps]&lt;br /&gt;
2. S D&amp;gt; 1^2 S --&amp;gt; S 1 D&amp;gt; 1 S [+3 steps]&lt;br /&gt;
3. S D&amp;gt; 1^a 1 S --&amp;gt; S 1^a D&amp;gt; 1 S [+3a steps] (if a &amp;gt; 0)&lt;br /&gt;
4. S (11)^a &amp;lt;E S --&amp;gt; S &amp;lt;E (11)^a S [+2a steps]&lt;br /&gt;
   S (11)^a &amp;lt;A S --&amp;gt; S &amp;lt;A (11)^a S [+2a steps]&lt;br /&gt;
5. S 1^2 D&amp;gt; 1 0 S --&amp;gt; S &amp;lt;E 0 1^3 S [+5 steps]&lt;br /&gt;
6. S 0 1^a &amp;lt;E S --&amp;gt; S 1 0 1^a-2 D&amp;gt; 1 S [+4a -4 steps] (if a mod 2 = 0)&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Later rules:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
Let A(a, b, c, d, e, f, ..., k) = 0^inf 1^a 0 1^b D&amp;gt; 1 0 1^c 0 1^d 0 1^e 0 1^f ... 0 1^k 0^inf&lt;br /&gt;
&lt;br /&gt;
b mod 2 = 0:&lt;br /&gt;
   b ≥ 4: A(a, b, c, ...) --&amp;gt; A(a+1, b-4, c+3, ...) rule R1&lt;br /&gt;
   b = 2: A(a, 2, c, ...) --&amp;gt; A(a+2, c+1, ...) rule R2&lt;br /&gt;
   b = 0:&lt;br /&gt;
      a mod 2 = 0:&lt;br /&gt;
         a ≥ 4: A(a, 0, c, ...) --&amp;gt; A(1, a-4, c+4, ...) rule R3&lt;br /&gt;
         a = 2: A(2, 0, c, ...) --&amp;gt; A(2, c+2, ...) rule R4&lt;br /&gt;
         a = 0: A(0, 0, c, ...) --&amp;gt; spin out rule R5&lt;br /&gt;
      a mod 2 = 1:&lt;br /&gt;
         a ≥ 5: A(a, 0, c, ...) --&amp;gt; A(2, a-4, c+4, ...) rule R6&lt;br /&gt;
         a = 3: A(3, 0, c, ...) --&amp;gt; halt with 0^inf 1^2 0 1 Z&amp;gt; 1^c+4 ... rule R7&lt;br /&gt;
         a = 1: A(1, 0, c, ...) --&amp;gt; A(0, c+4, ...) rule R8&lt;br /&gt;
b mod 2 = 1:&lt;br /&gt;
   b ≥ 3:&lt;br /&gt;
      a mod 2 = 0:&lt;br /&gt;
         a ≥ 2: A(a, b, c, ...) --&amp;gt; A(1, a-2, b-2, c+3, ...) rule R9&lt;br /&gt;
         a = 0:&lt;br /&gt;
            b ≥ 5: A(0, b, c, ...) --&amp;gt; A(2, b-4, c+3, ...) rule R10&lt;br /&gt;
            b = 3: A(0, 3, c, ...) --&amp;gt; halt with 0^inf 1^2 0 1 Z&amp;gt; 1^c+3 ... rule R11&lt;br /&gt;
      a mod 2 = 1:&lt;br /&gt;
         a ≥ 3: A(a, b, c, ...) --&amp;gt; A(2, a-2, b-2, c+3, ...) rule R12&lt;br /&gt;
         a = 1: A(1, b, c, ...) --&amp;gt; halt with 0^inf 1^2 0 1 Z&amp;gt; 1^b-2 0 1^c+3 ... rule R13&lt;br /&gt;
   b = 1: A(a, 1, c, ...) --&amp;gt; A(0, a+c+3, ...) rule R14&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
A(0, 0, c, ...), A(0, 3, c, ...) and A(1, 2k+1, c, ...) are not reachable by any of these rules (reaching them would require negative entries), meaning that they can only be triggered if they are the TMs starting configurations.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Accelerated rules:&#039;&#039;&#039;&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
r8: A(a, 4k+v, c, ...) --&amp;gt; A(a+k, v, c+3k, ...) [+4bk -8k^2 +k steps] (if v mod 2 = 0 and k ≥ 1)&lt;br /&gt;
&lt;br /&gt;
a1: A(0, 2k+1, c, ...) --&amp;gt; A(0, 2(k-1)+1, c+6, ...) [+16k +10 steps] (if k ≥ 3)&lt;br /&gt;
by:&lt;br /&gt;
A(0, 2k+1, c, ...)&lt;br /&gt;
--&amp;gt; A(2, 2(k-2)+1, c+3, ...) [+8k +3]&lt;br /&gt;
--&amp;gt; A(1, 0, 2(k-3)+1, c+6, ...) [+10k +10]&lt;br /&gt;
--&amp;gt; A(0, 2(k-1)+1, c+6, ...) [+16k +10]&lt;br /&gt;
&lt;br /&gt;
a2: A(0, 2k+1, c, ...) --&amp;gt; A(0, 5, c+6k-12) [+8k^2 +18k -68 steps] (if k ≥ 3)&lt;br /&gt;
by repetition of rule a1&lt;br /&gt;
&lt;br /&gt;
a3: A(0, 2k+1, c, ...) --&amp;gt; A(0, c+6k-4, ...) [+8k^2 +36k +3c -65 steps] (if k ≥ 3)&lt;br /&gt;
by:&lt;br /&gt;
A(0, 2k+1, c, ...)&lt;br /&gt;
--&amp;gt; A(0, 5, c+6k-12, ...) by rule a2 [+8k^2 +18k -68]&lt;br /&gt;
--&amp;gt; A(2, 1, c+6k-9, ...) [8k^2 +18k -49]&lt;br /&gt;
--&amp;gt; A(0, c+6k-4, ...) [+8k^2 +36k + 3c -65]&lt;br /&gt;
&lt;br /&gt;
a4: A(0, 5, c, ...) --&amp;gt; A(0, c+8, ...) [+3c +39]&lt;br /&gt;
by:&lt;br /&gt;
A(0, 5, c, ...)&lt;br /&gt;
--&amp;gt; A(2, 1, c+3, ...) [+19] by A10&lt;br /&gt;
--&amp;gt; A(0, c+8, ...) [+3c +39] by A12&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Using the accelerated rules:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
Let A(a, b, c, d, e, f, ..., k) = 0^inf 1^a 0 1^b D&amp;gt; 1 0 1^c 0 1^d 0 1^e 0 1^f ... 0 1^k 0^inf&lt;br /&gt;
&lt;br /&gt;
b mod 2 = 0:&lt;br /&gt;
   b ≥ 4: A(a, 4k+v, c, ...) --&amp;gt; A(a+k, v, c+3k, ...) rule A1 [+8k^2 +4vk +k steps]&lt;br /&gt;
   b = 2: A(a, 2, c, ...) --&amp;gt; A(a+2, c+1, ...) rule A2 [+3c +13 steps]&lt;br /&gt;
   b = 0:&lt;br /&gt;
      a mod 2 = 0:&lt;br /&gt;
         a ≥ 4: A(a, 0, c, ...) --&amp;gt; A(1, a-4, c+4, ...) rule A3 [+4a -6 steps]&lt;br /&gt;
         a = 2: A(2, 0, c, ...) --&amp;gt; A(2, c+2, ...) rule A4 [+3c +17 steps]&lt;br /&gt;
         a = 0: unreachable&lt;br /&gt;
      a mod 2 = 1:&lt;br /&gt;
         a ≥ 5: A(a, 0, c, ...) --&amp;gt; A(2, a-4, c+4, ...) rule A5 [+4a steps]&lt;br /&gt;
         a = 3: A(3, 0, c, ...) --&amp;gt; halt with 0^inf 1^2 0 1 Z&amp;gt; 1^c+4 ... rule A6 [+16 steps]&lt;br /&gt;
         a = 1: A(1, 0, c, ...) --&amp;gt; A(0, c+4, ...) rule A7 [+3c +15 steps]&lt;br /&gt;
b mod 2 = 1:&lt;br /&gt;
   b ≥ 3:&lt;br /&gt;
      a mod 2 = 0:&lt;br /&gt;
         a ≥ 2: A(a, b, c, ...) --&amp;gt; A(1, a-2, b-2, c+3, ...) rule A8 [+b +4a +2 steps]&lt;br /&gt;
         a = 0:&lt;br /&gt;
            b ≥ 7: A(0, 2k+1, c, ...) --&amp;gt; A(0, c+6k-4, ...) rule A9 [+8k^2 +36k +3c -65 steps]&lt;br /&gt;
            b = 5: A(0, 5, c, ...) --&amp;gt; A(0, c+8, ...) rule A10 [+3c +39 steps]&lt;br /&gt;
            b = 3: unreachable&lt;br /&gt;
      a mod 2 = 1:&lt;br /&gt;
         a ≥ 3: A(a, b, c, ...) --&amp;gt; A(2, a-2, b-2, c+3, ...) rule A11 [+b +4a +8 steps]&lt;br /&gt;
         a = 1: unreachable&lt;br /&gt;
   b = 1: A(a, 1, c, ...) --&amp;gt; A(0, a+c+3, ...) rule A12 [+3c +11 steps]&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The TM starts in configuration A(0, 2, 0) after 7 steps.&lt;br /&gt;
&lt;br /&gt;
=== Permutations ===&lt;br /&gt;
&#039;&#039;&#039;Starting in state B&#039;&#039;&#039;&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
S=0: 0^inf &amp;lt;B 0^inf&lt;br /&gt;
--&amp;gt; spin out&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Starting in state C&#039;&#039;&#039;&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
S=0: 0^inf &amp;lt;C 0^inf&lt;br /&gt;
S=1: 0^inf 1 D&amp;gt; 0^inf&lt;br /&gt;
S=2: 0^inf 1^2 Z&amp;gt; 0^inf&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Starting in state D&#039;&#039;&#039;&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
S=0: 0^inf &amp;lt;D 0^inf&lt;br /&gt;
S=1: 0^inf 1 Z&amp;gt; 0^inf&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Starting in state E&#039;&#039;&#039;&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
S=0: 0^inf &amp;lt;E 0^inf&lt;br /&gt;
S=1: 0^inf 1 F&amp;gt; 0^inf&lt;br /&gt;
S=2: 0^inf 1 0 A&amp;gt; 0^inf&lt;br /&gt;
S=3: 0^inf 1 0 1 B&amp;gt; 0^inf&lt;br /&gt;
S=4: 0^inf 1 0 1 &amp;lt;B 1 0^inf&lt;br /&gt;
S=5: 0^inf 1 0 &amp;lt;C 1^2 0^inf&lt;br /&gt;
S=6: 0^inf 1^2 D&amp;gt; 1^2 0^inf&lt;br /&gt;
S=9: 0^inf 1^3 D&amp;gt; 1 0^inf = A(0, 3, 0)&lt;br /&gt;
--&amp;gt; Reaches configuration A(0, 3, 0) after 9 steps.&lt;br /&gt;
S=24: 0^inf 1^2 0 1 Z&amp;gt; 1^3 0^inf&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Starting in state F&#039;&#039;&#039;&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
S=0: 0^inf &amp;lt;F 0^inf&lt;br /&gt;
S=1: 0^inf A&amp;gt; 0^inf&lt;br /&gt;
--&amp;gt; Equivalent to starting in state A, but started one step earlier.&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Analysis by hipparcos ==&lt;br /&gt;
See [https://discord.com/channels/960643023006490684/1466628778905305292/1466628778905305292 Discord] for another independent analysis.&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
[[Category:BB(6)]]&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=1RB1LE_1LB1LC_1RD0LE_---0RB_1RF1LA_0RA0RD&amp;diff=9369</id>
		<title>1RB1LE 1LB1LC 1RD0LE ---0RB 1RF1LA 0RA0RD</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=1RB1LE_1LB1LC_1RD0LE_---0RB_1RF1LA_0RA0RD&amp;diff=9369"/>
		<updated>2026-10-22T15:28:51Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: Discord archival attempt&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{machine|1RB1LE_1LB1LC_1RD0LE_---0RB_1RF1LA_0RA0RD}}&lt;br /&gt;
{{TM|1RB1LE_1LB1LC_1RD0LE_---0RB_1RF1LA_0RA0RD}} is a [[BB(6)]] [[holdout]] TM.&lt;br /&gt;
&lt;br /&gt;
This TM has been simulated for more than &amp;lt;math&amp;gt;10^{190\,000}&amp;lt;/math&amp;gt; steps without having halted.&amp;lt;ref&amp;gt;{{DiscordArchive|1239205785913790465|1453010575901593643}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Analysis by [[User:Polygon|Polygon]] ==&lt;br /&gt;
&lt;br /&gt;
Early rules:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
S is any tape configuration&lt;br /&gt;
&lt;br /&gt;
1. S 0^a &amp;lt;B S --&amp;gt; S &amp;lt;B 1^a S [+a steps]&lt;br /&gt;
2. S D&amp;gt; 1^2 S --&amp;gt; S 1 D&amp;gt; 1 S [+3 steps]&lt;br /&gt;
3. S D&amp;gt; 1^a 1 S --&amp;gt; S 1^a D&amp;gt; 1 S [+3a steps] (if a &amp;gt; 0)&lt;br /&gt;
4. S (11)^a &amp;lt;E S --&amp;gt; S &amp;lt;E (11)^a S [+2a steps]&lt;br /&gt;
   S (11)^a &amp;lt;A S --&amp;gt; S &amp;lt;A (11)^a S [+2a steps]&lt;br /&gt;
5. S 1^2 D&amp;gt; 1 0 S --&amp;gt; S &amp;lt;E 0 1^3 S [+5 steps]&lt;br /&gt;
6. S 0 1^a &amp;lt;E S --&amp;gt; S 1 0 1^a-2 D&amp;gt; 1 S [+4a -4 steps] (if a mod 2 = 0)&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Later rules:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
Let A(a, b, c, d, e, f, ..., k) = 0^inf 1^a 0 1^b D&amp;gt; 1 0 1^c 0 1^d 0 1^e 0 1^f ... 0 1^k 0^inf&lt;br /&gt;
&lt;br /&gt;
b mod 2 = 0:&lt;br /&gt;
   b ≥ 4: A(a, b, c, ...) --&amp;gt; A(a+1, b-4, c+3, ...) rule R1&lt;br /&gt;
   b = 2: A(a, 2, c, ...) --&amp;gt; A(a+2, c+1, ...) rule R2&lt;br /&gt;
   b = 0:&lt;br /&gt;
      a mod 2 = 0:&lt;br /&gt;
         a ≥ 4: A(a, 0, c, ...) --&amp;gt; A(1, a-4, c+4, ...) rule R3&lt;br /&gt;
         a = 2: A(2, 0, c, ...) --&amp;gt; A(2, c+2, ...) rule R4&lt;br /&gt;
         a = 0: A(0, 0, c, ...) --&amp;gt; spin out rule R5&lt;br /&gt;
      a mod 2 = 1:&lt;br /&gt;
         a ≥ 5: A(a, 0, c, ...) --&amp;gt; A(2, a-4, c+4, ...) rule R6&lt;br /&gt;
         a = 3: A(3, 0, c, ...) --&amp;gt; halt with 0^inf 1^2 0 1 Z&amp;gt; 1^c+4 ... rule R7&lt;br /&gt;
         a = 1: A(1, 0, c, ...) --&amp;gt; A(0, c+4, ...) rule R8&lt;br /&gt;
b mod 2 = 1:&lt;br /&gt;
   b ≥ 3:&lt;br /&gt;
      a mod 2 = 0:&lt;br /&gt;
         a ≥ 2: A(a, b, c, ...) --&amp;gt; A(1, a-2, b-2, c+3, ...) rule R9&lt;br /&gt;
         a = 0:&lt;br /&gt;
            b ≥ 5: A(0, b, c, ...) --&amp;gt; A(2, b-4, c+3, ...) rule R10&lt;br /&gt;
            b = 3: A(0, 3, c, ...) --&amp;gt; halt with 0^inf 1^2 0 1 Z&amp;gt; 1^c+3 ... rule R11&lt;br /&gt;
      a mod 2 = 1:&lt;br /&gt;
         a ≥ 3: A(a, b, c, ...) --&amp;gt; A(2, a-2, b-2, c+3, ...) rule R12&lt;br /&gt;
         a = 1: A(1, b, c, ...) --&amp;gt; halt with 0^inf 1^2 0 1 Z&amp;gt; 1^b-2 0 1^c+3 ... rule R13&lt;br /&gt;
   b = 1: A(a, 1, c, ...) --&amp;gt; A(0, a+c+3, ...) rule R14&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
A(0, 0, c, ...), A(0, 3, c, ...) and A(1, 2k+1, c, ...) are not reachable by any of these rules (reaching them would require negative entries), meaning that they can only be triggered if they are the TMs starting configurations.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Accelerated rules:&#039;&#039;&#039;&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
r8: A(a, 4k+v, c, ...) --&amp;gt; A(a+k, v, c+3k, ...) [+4bk -8k^2 +k steps] (if v mod 2 = 0 and k ≥ 1)&lt;br /&gt;
&lt;br /&gt;
a1: A(0, 2k+1, c, ...) --&amp;gt; A(0, 2(k-1)+1, c+6, ...) [+16k +10 steps] (if k ≥ 3)&lt;br /&gt;
by:&lt;br /&gt;
A(0, 2k+1, c, ...)&lt;br /&gt;
--&amp;gt; A(2, 2(k-2)+1, c+3, ...) [+8k +3]&lt;br /&gt;
--&amp;gt; A(1, 0, 2(k-3)+1, c+6, ...) [+10k +10]&lt;br /&gt;
--&amp;gt; A(0, 2(k-1)+1, c+6, ...) [+16k +10]&lt;br /&gt;
&lt;br /&gt;
a2: A(0, 2k+1, c, ...) --&amp;gt; A(0, 5, c+6k-12) [+8k^2 +18k -68 steps] (if k ≥ 3)&lt;br /&gt;
by repetition of rule a1&lt;br /&gt;
&lt;br /&gt;
a3: A(0, 2k+1, c, ...) --&amp;gt; A(0, c+6k-4, ...) [+8k^2 +36k +3c -65 steps] (if k ≥ 3)&lt;br /&gt;
by:&lt;br /&gt;
A(0, 2k+1, c, ...)&lt;br /&gt;
--&amp;gt; A(0, 5, c+6k-12, ...) by rule a2 [+8k^2 +18k -68]&lt;br /&gt;
--&amp;gt; A(2, 1, c+6k-9, ...) [8k^2 +18k -49]&lt;br /&gt;
--&amp;gt; A(0, c+6k-4, ...) [+8k^2 +36k + 3c -65]&lt;br /&gt;
&lt;br /&gt;
a4: A(0, 5, c, ...) --&amp;gt; A(0, c+8, ...) [+3c +39]&lt;br /&gt;
by:&lt;br /&gt;
A(0, 5, c, ...)&lt;br /&gt;
--&amp;gt; A(2, 1, c+3, ...) [+19] by A10&lt;br /&gt;
--&amp;gt; A(0, c+8, ...) [+3c +39] by A12&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Using the accelerated rules:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
Let A(a, b, c, d, e, f, ..., k) = 0^inf 1^a 0 1^b D&amp;gt; 1 0 1^c 0 1^d 0 1^e 0 1^f ... 0 1^k 0^inf&lt;br /&gt;
&lt;br /&gt;
b mod 2 = 0:&lt;br /&gt;
   b ≥ 4: A(a, 4k+v, c, ...) --&amp;gt; A(a+k, v, c+3k, ...) rule A1 [+8k^2 +4vk +k steps]&lt;br /&gt;
   b = 2: A(a, 2, c, ...) --&amp;gt; A(a+2, c+1, ...) rule A2 [+3c +13 steps]&lt;br /&gt;
   b = 0:&lt;br /&gt;
      a mod 2 = 0:&lt;br /&gt;
         a ≥ 4: A(a, 0, c, ...) --&amp;gt; A(1, a-4, c+4, ...) rule A3 [+4a -6 steps]&lt;br /&gt;
         a = 2: A(2, 0, c, ...) --&amp;gt; A(2, c+2, ...) rule A4 [+3c +17 steps]&lt;br /&gt;
         a = 0: unreachable&lt;br /&gt;
      a mod 2 = 1:&lt;br /&gt;
         a ≥ 5: A(a, 0, c, ...) --&amp;gt; A(2, a-4, c+4, ...) rule A5 [+4a steps]&lt;br /&gt;
         a = 3: A(3, 0, c, ...) --&amp;gt; halt with 0^inf 1^2 0 1 Z&amp;gt; 1^c+4 ... rule A6 [+16 steps]&lt;br /&gt;
         a = 1: A(1, 0, c, ...) --&amp;gt; A(0, c+4, ...) rule A7 [+3c +15 steps]&lt;br /&gt;
b mod 2 = 1:&lt;br /&gt;
   b ≥ 3:&lt;br /&gt;
      a mod 2 = 0:&lt;br /&gt;
         a ≥ 2: A(a, b, c, ...) --&amp;gt; A(1, a-2, b-2, c+3, ...) rule A8 [+b +4a +2 steps]&lt;br /&gt;
         a = 0:&lt;br /&gt;
            b ≥ 7: A(0, 2k+1, c, ...) --&amp;gt; A(0, c+6k-4, ...) rule A9 [+8k^2 +36k +3c -65 steps]&lt;br /&gt;
            b = 5: A(0, 5, c, ...) --&amp;gt; A(0, c+8, ...) rule A10 [+3c +39 steps]&lt;br /&gt;
            b = 3: unreachable&lt;br /&gt;
      a mod 2 = 1:&lt;br /&gt;
         a ≥ 3: A(a, b, c, ...) --&amp;gt; A(2, a-2, b-2, c+3, ...) rule A11 [+b +4a +8 steps]&lt;br /&gt;
         a = 1: unreachable&lt;br /&gt;
   b = 1: A(a, 1, c, ...) --&amp;gt; A(0, a+c+3, ...) rule A12 [+3c +11 steps]&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The TM starts in configuration A(0, 2, 0) after 7 steps.&lt;br /&gt;
&lt;br /&gt;
=== Permutations ===&lt;br /&gt;
&#039;&#039;&#039;Starting in state B&#039;&#039;&#039;&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
S=0: 0^inf &amp;lt;B 0^inf&lt;br /&gt;
--&amp;gt; spin out&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Starting in state C&#039;&#039;&#039;&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
S=0: 0^inf &amp;lt;C 0^inf&lt;br /&gt;
S=1: 0^inf 1 D&amp;gt; 0^inf&lt;br /&gt;
S=2: 0^inf 1^2 Z&amp;gt; 0^inf&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Starting in state D&#039;&#039;&#039;&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
S=0: 0^inf &amp;lt;D 0^inf&lt;br /&gt;
S=1: 0^inf 1 Z&amp;gt; 0^inf&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Starting in state E&#039;&#039;&#039;&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
S=0: 0^inf &amp;lt;E 0^inf&lt;br /&gt;
S=1: 0^inf 1 F&amp;gt; 0^inf&lt;br /&gt;
S=2: 0^inf 1 0 A&amp;gt; 0^inf&lt;br /&gt;
S=3: 0^inf 1 0 1 B&amp;gt; 0^inf&lt;br /&gt;
S=4: 0^inf 1 0 1 &amp;lt;B 1 0^inf&lt;br /&gt;
S=5: 0^inf 1 0 &amp;lt;C 1^2 0^inf&lt;br /&gt;
S=6: 0^inf 1^2 D&amp;gt; 1^2 0^inf&lt;br /&gt;
S=9: 0^inf 1^3 D&amp;gt; 1 0^inf = A(0, 3, 0)&lt;br /&gt;
--&amp;gt; Reaches configuration A(0, 3, 0) after 9 steps.&lt;br /&gt;
S=24: 0^inf 1^2 0 1 Z&amp;gt; 1^3 0^inf&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Starting in state F&#039;&#039;&#039;&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
S=0: 0^inf &amp;lt;F 0^inf&lt;br /&gt;
S=1: 0^inf A&amp;gt; 0^inf&lt;br /&gt;
--&amp;gt; Equivalent to starting in state A, but started one step earlier.&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Analysis by hipparcos ==&lt;br /&gt;
See {{DiscordArchive|1466628778905305292|1466628778905305292}} for another independent analysis.&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
[[Category:BB(6)]]&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=1RJ1RH_1RC1RB_1LI0RD_1RC1LE_0LE1LF_1LG1RH_1RB0LF_0RA1LE_1RF1LJ_0LK1RZ_1LL1LK_1LM1LM_0LI0LL&amp;diff=9315</id>
		<title>1RJ1RH 1RC1RB 1LI0RD 1RC1LE 0LE1LF 1LG1RH 1RB0LF 0RA1LE 1RF1LJ 0LK1RZ 1LL1LK 1LM1LM 0LI0LL</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=1RJ1RH_1RC1RB_1LI0RD_1RC1LE_0LE1LF_1LG1RH_1RB0LF_0RA1LE_1RF1LJ_0LK1RZ_1LL1LK_1LM1LM_0LI0LL&amp;diff=9315"/>
		<updated>2026-10-20T17:27:23Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: link to champion page directly&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{machine|1RJ1RH_1RC1RB_1LI0RD_1RC1LE_0LE1LF_1LG1RH_1RB0LF_0RA1LE_1RF1LJ_0LK1RZ_1LL1LK_1LM1LM_0LI0LL}}&lt;br /&gt;
{{TM|1RJ1RH_1RC1RB_1LI0RD_1RC1LE_0LE1LF_1LG1RH_1RB0LF_0RA1LE_1RF1LJ_0LK1RZ_1LL1LK_1LM1LM_0LI0LL|halt}} is a former BB(13) [[Champions|champion]]. This machine was found by Racheline using an 8-state &amp;lt;math&amp;gt;f_\omega&amp;lt;/math&amp;gt;-level mechanism (in the [[Fast-Growing Hierarchy]]) shared by the previous [https://googology.fandom.com/wiki/User:Wythagoras/Rado%27s_sigma_function/BB(13) BB(13) champion] and [https://wiki.bbchallenge.org/wiki/User:Jacobzheng/14a BB(14) champion]. Instead of using the 5 extra states to build a large input to which &amp;lt;math&amp;gt;f_\omega&amp;lt;/math&amp;gt; would be applied once before halting, this machine applies &amp;lt;math&amp;gt;f_\omega&amp;lt;/math&amp;gt; repeatedly with [[Collatz-like]] rules, which allows it to halt with over &amp;lt;math&amp;gt;f_\omega(f_\omega(f_\omega(f_\omega(70))))&amp;lt;/math&amp;gt; ones on the tape.&lt;br /&gt;
&lt;br /&gt;
== Analysis ==&lt;br /&gt;
&lt;br /&gt;
The &amp;lt;math&amp;gt;f_\omega&amp;lt;/math&amp;gt; mechanism operates on lists of numbers, and simulates the rule&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;B(a_0,0^k,a_1+1,a_2,a_3,\ldots,a_m) \to B(0^k,a_0+3,a_1,a_2,a_3,\ldots,a_m)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &amp;lt;math&amp;gt;0^k&amp;lt;/math&amp;gt; denotes &amp;lt;math&amp;gt;k&amp;lt;/math&amp;gt; consecutive zeroes in the list, using configurations of the form &amp;lt;math&amp;gt;B(a_0,a_1,a_2,\ldots,a_m) = 0^\infty \; 1 \; B&amp;gt; \; 1^{a_0} \; 10 \; 1^{a_1} \; 10 \; 1^{a_2} \; 10 \; \ldots \; 10 \; 1^{a_m} \; 10 \; 0^\infty&amp;lt;/math&amp;gt;.&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
This computes a slightly modified Fast-Growing Hierarchy. In particular, letting&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{l}&lt;br /&gt;
  h_0(n)&amp;amp;=&amp;amp;n+3 \\&lt;br /&gt;
  h_{k+1}(n)&amp;amp;=&amp;amp;h_k^n(1)&lt;br /&gt;
\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
one can prove by induction on &amp;lt;math&amp;gt;k&amp;lt;/math&amp;gt; that&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;B(a_0-4,0^k,a_1+1,a_2,a_3,\ldots,a_m) \to B(h_k(a_0)-4,0^k,a_1,a_2,a_3,\ldots,a_m)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
for &amp;lt;math&amp;gt;a_0\ge4&amp;lt;/math&amp;gt;. This motivates the use of &amp;lt;math&amp;gt;B&#039;(a_0,a_1,\ldots,a_m) = A(a_0-4,a_1,\ldots,a_m)&amp;lt;/math&amp;gt; instead, so that&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;B&#039;(a_0,0^k,a_1+1,a_2,a_3,\ldots,a_m) \to B&#039;(h_k(a_0),0^k,a_1,a_2,a_3,\ldots,a_m)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
and by applying this repeatedly,&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;B&#039;(a_0,a_1,a_2,\ldots,a_k) \to B&#039;(h_{k-1}^{a_k}(\cdots(h_2^{a_2}(h_1^{a_1}(a_0)))\cdots),0^k)&amp;lt;/math&amp;gt;&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
This leaves only the case &amp;lt;math&amp;gt;B&#039;(n,0^k)&amp;lt;/math&amp;gt;, which we write as &amp;lt;math&amp;gt;D(n,k)&amp;lt;/math&amp;gt;. The machine then simulates the Collatz-like rules&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{l}&lt;br /&gt;
  D(n,3k) &amp;amp; \to &amp;amp; \operatorname{Halt}(n+4k) \\&lt;br /&gt;
  D(n,3k+1) &amp;amp; \to &amp;amp; B&#039;(4,n+1,(0,2)^k,1) &amp;amp; \to &amp;amp; D(h_{2k+1}(h_{2k}^2(h_{2k-2}^2(\cdots(h_2^2(h_0^{n+1}(4)))\cdots))),2k+2) \\&lt;br /&gt;
  D(n,3k+2) &amp;amp; \to &amp;amp; B&#039;(7,0^{g(n)-1},(2,0)^k,2,1) &amp;amp; \to &amp;amp; D(h_{g(n)+2k}(h_{g(n)+2k-1}^2(h_{g(n)+2k-3}^2(\cdots(h_{g(n)+1}^2(h_{g(n)-1}^2(7)))\cdots))),g(n)+2k+1)&lt;br /&gt;
\end{array} &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &amp;lt;math&amp;gt;(x,y)^k&amp;lt;/math&amp;gt; denotes &amp;lt;math&amp;gt;k&amp;lt;/math&amp;gt; consecutive copies of &amp;lt;math&amp;gt;x,y&amp;lt;/math&amp;gt; (&amp;lt;math&amp;gt;2k&amp;lt;/math&amp;gt; total entries), &amp;lt;math&amp;gt;g(n)=\left\lfloor\frac{n+1}{2}\right\rfloor &amp;lt;/math&amp;gt;, and &amp;lt;math&amp;gt;\operatorname{Halt}(x)&amp;lt;/math&amp;gt; means that the machine halts with &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt; ones on the tape.&lt;br /&gt;
&lt;br /&gt;
== Trajectory ==&lt;br /&gt;
&lt;br /&gt;
This machine reaches the configuration &amp;lt;math&amp;gt;D(13,1)&amp;lt;/math&amp;gt; after 89 steps, and then follows this trajectory:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{l}&lt;br /&gt;
  D(13,1) &amp;amp; \to &amp;amp; D(139,2) &amp;amp; \to &amp;amp; D(n_0,71) &amp;amp; \to &amp;amp; D\big(n_1,\frac{n_0}{2}+47\big) &amp;amp; \to &amp;amp; D\Big(n_2,\frac{n_0+98}{3}\Big) &amp;amp; \to \\&lt;br /&gt;
  D\Big(n_3,\frac{2n_0+208}{9}\Big) &amp;amp; \to &amp;amp; D\Big(n_4,\frac{n_3}{2}+\frac{4n_0+407}{27}\Big) &amp;amp; \to &amp;amp; D\Big(n_5,\frac{n_4}{2}+\frac{27n_3+8n_0+787}{81}\Big) &amp;amp; \to &amp;amp; D\Big(n_6,\frac{81n_4+54n_3+16n_0+1898}{243}\Big) &amp;amp; \to &amp;amp; {\operatorname{Halt}}\Big(n_6+\frac{324n_4+216n_3+64n_0+7592}{243}\Big)&lt;br /&gt;
\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &amp;lt;math&amp;gt;n_6\approx n_5\approx f_\omega(n_4)\approx f_\omega^2(n_3)\approx f_\omega^2(n_2)\approx f_\omega^2(n_1)\approx f_\omega^3(n_0)\approx f_\omega^3(h_{70}(h_{69}(h_{69}(7)))) &amp;gt; f_\omega^4(70)&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
The trajectory can be computed in the following way.&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
First, note that &amp;lt;math&amp;gt;h_k(n)\equiv n+1\pmod{2}&amp;lt;/math&amp;gt; can be proven by induction on &amp;lt;math&amp;gt;k&amp;lt;/math&amp;gt;. Next, note that &amp;lt;math&amp;gt;D(n,3k+2)\to D(n&#039;,k&#039;)&amp;lt;/math&amp;gt; where &amp;lt;math&amp;gt;n&#039;&amp;lt;/math&amp;gt; is obtained by applying &amp;lt;math&amp;gt;2k+1&amp;lt;/math&amp;gt; functions of the form &amp;lt;math&amp;gt;h_m&amp;lt;/math&amp;gt; to the input 7, so &amp;lt;math&amp;gt;n&#039;\equiv 7+2k+1\equiv 0\pmod{2}&amp;lt;/math&amp;gt;, and &amp;lt;math&amp;gt;D(2n,3k+1)\to D(n&#039;,k&#039;)&amp;lt;/math&amp;gt; where &amp;lt;math&amp;gt;n&#039;&amp;lt;/math&amp;gt; is obtained by applying &amp;lt;math&amp;gt;2k+1+n+1&amp;lt;/math&amp;gt; functions of the form &amp;lt;math&amp;gt;h_m&amp;lt;/math&amp;gt; to the input 4, so &amp;lt;math&amp;gt;n&#039;\equiv 4+2k+1+n+1\equiv 0\pmod{2}&amp;lt;/math&amp;gt;. This means that after the first application of the &amp;lt;math&amp;gt;D(n,3k+2)&amp;lt;/math&amp;gt; rule, &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt; will always be even, and thus for &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt; appearing after this point, we have &amp;lt;math&amp;gt;g(n)=\left\lfloor\frac{n+1}{2}\right\rfloor=\frac{n}{2}&amp;lt;/math&amp;gt;.&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
Now the only modular arithmetic left is finding the values of the first arguments of &amp;lt;math&amp;gt;D&amp;lt;/math&amp;gt; modulo large powers of 3, so that we know the values of the second arguments of &amp;lt;math&amp;gt;D&amp;lt;/math&amp;gt; modulo 3, and thus know which rules to apply. We have &amp;lt;math&amp;gt;h_1(n)=h_0^n(1)=1+\underbrace{3+3+\ldots+3+3}_{n}=1+3n&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;h_2(n)=h_1^n(1)=1+3(1+3(\cdots(1+3(1\underbrace{))\cdots))}_{n}=1+3+3^2+\ldots+3^{n-1}+3^n=\frac{3^{n+1}-1}{2}&amp;lt;/math&amp;gt;. Since the computation of &amp;lt;math&amp;gt;h_k(n)&amp;lt;/math&amp;gt; for any &amp;lt;math&amp;gt;k&amp;gt;2&amp;lt;/math&amp;gt; ends with something of the form &amp;lt;math&amp;gt;h_2(m)&amp;lt;/math&amp;gt;, all first arguments of &amp;lt;math&amp;gt;D&amp;lt;/math&amp;gt; starting from &amp;lt;math&amp;gt;n_0=h_{70}(h_{69}(h_{69}(7)))&amp;lt;/math&amp;gt; are of the form &amp;lt;math&amp;gt;\frac{3^m-1}{2}&amp;lt;/math&amp;gt; for large &amp;lt;math&amp;gt;m&amp;lt;/math&amp;gt;, and thus are &amp;lt;math&amp;gt;\frac{3^i-1}{2}\pmod{3^i} &amp;lt;/math&amp;gt; for &amp;lt;math&amp;gt;i&amp;lt;h_{69}(7)&amp;lt;/math&amp;gt; (note: This upper bound is much larger than what we need and significantly smaller than the exact maximum of &amp;lt;math&amp;gt;i&amp;lt;/math&amp;gt; for which this statement holds).&lt;br /&gt;
&amp;lt;br&amp;gt;&lt;br /&gt;
With this, we can easily compute each second argument of &amp;lt;math&amp;gt;D&amp;lt;/math&amp;gt; modulo 3 just from its expression as a linear combination (with relatively simple coefficients) of the previous first arguments of &amp;lt;math&amp;gt;D&amp;lt;/math&amp;gt;, and thus we can compute the linear combination of first arguments that is equal to the second argument in the next step. Repeating this allows us to compute the whole trajectory.&lt;br /&gt;
&lt;br /&gt;
== Related machines ==&lt;br /&gt;
&lt;br /&gt;
The analysis section applies to all machines obtained from this machine by varying the &amp;lt;math&amp;gt;A0&amp;lt;/math&amp;gt; transition and the starting state. If the search didn&#039;t miss any of these machines, this machine takes the longest to halt out of all machines in this family. This family is part of a larger family of machines obtained by additionally varying the &amp;lt;math&amp;gt;C0&amp;lt;/math&amp;gt; transition, but the Collatz-like rules depend on the &amp;lt;math&amp;gt;C0&amp;lt;/math&amp;gt; transition. Furthermore, we can change the order of the last 5 states to get {{TM|1RJ1RH_1RC1RB_1LI0RD_1RC1LE_0LE1LF_1LG1RH_1RB0LF_0RA1LE_1LJ1LJ_0LK0LI_1LL1LK_1RF1LM_0LI1RZ|halt}}, which also forms a family of similar size by varying the transitions &amp;lt;math&amp;gt;A0,C0&amp;lt;/math&amp;gt; and the starting state. Perhaps even more families can be obtained by changing the &amp;lt;math&amp;gt;G0&amp;lt;/math&amp;gt; transition from 1RB to 0RB, but these also differ in the &amp;lt;math&amp;gt;f_\omega&amp;lt;/math&amp;gt; part of their behavior, so they compute a different variant of the Fast-Growing Hierarchy (in particular, they simulate &amp;lt;math&amp;gt;B(a_0,0^k,a_1+1,a_2,a_3,\ldots,a_m) \to B(0^k,a_0+2,a_1,a_2,a_3,\ldots,a_m)&amp;lt;/math&amp;gt;).&lt;br /&gt;
&lt;br /&gt;
The second place so far (not counting machines that also reach &amp;lt;math&amp;gt;D(13,1)&amp;lt;/math&amp;gt;) is taken by {{TM|1RL1RH_1RC1RB_1LI0RD_1RC1LE_0LE1LF_1LG1RH_1RB0LF_0RA1LE_1RF1LJ_0LK1RZ_1LL1LK_1LM1LM_0LI0LL|halt}}, which reaches &amp;lt;math&amp;gt;D(7,2)&amp;lt;/math&amp;gt; and halts with more than &amp;lt;math&amp;gt;f_\omega^4(4)&amp;lt;/math&amp;gt; ones on the tape, so it&#039;s a close competition. The search of these families for higher scores is ongoing.&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=Bonus_Cryptid&amp;diff=9314</id>
		<title>Bonus Cryptid</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=Bonus_Cryptid&amp;diff=9314"/>
		<updated>2026-10-20T17:26:12Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: fixed broken link (no archive yet cuz my tooling is not working rn)&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{machine|1RB3RB---3LA1RA_2LA3RA4LB0LB1LB}}{{unsolved|Does this TM run forever?}}&lt;br /&gt;
&#039;&#039;&#039;Bonus Cryptid&#039;&#039;&#039; ({{TM|1RB3RB---3LA1RA_2LA3RA4LB0LB1LB|undecided}}) is a [[BB(2,5)]] pseudo-random walking [[Cryptid]] found by Daniel Yuan in May 2024. It has been simulated out to at least 10^13634 traditional TM steps ([https://discord.com/channels/960643023006490684/1259770421046411285/1354198369484013568 by Shawn Ligocki]) and 100 million rule steps (see below) without halting.&lt;br /&gt;
&lt;br /&gt;
See https://www.sligocki.com/2024/05/10/bb-2-5-is-hard.html#a-bonus-cryptid&lt;br /&gt;
&lt;br /&gt;
== Behavior ==&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
1RB3RB---3LA1RA_2LA3RA4LB0LB1LB&lt;br /&gt;
&lt;br /&gt;
Define&lt;br /&gt;
A(a, b) = 0^inf &amp;lt;B 0^a 3^b 2 0^inf&lt;br /&gt;
&lt;br /&gt;
The rules are&lt;br /&gt;
A(3n, 0) -&amp;gt; Halt&lt;br /&gt;
A(3n, b+1) -&amp;gt; A(4n+3, b)&lt;br /&gt;
A(3n+1, b) -&amp;gt; A(4n+3, b+3)&lt;br /&gt;
A(3n+2, 0) -&amp;gt; ?&lt;br /&gt;
A(3n+2, b+1) -&amp;gt; A(4n+5, b)&lt;br /&gt;
&lt;br /&gt;
Start: A(1287547464911049659, 10)&lt;br /&gt;
&amp;lt;/pre&amp;gt;Note: This TM enters an &amp;quot;A()&amp;quot; config much earlier: &amp;lt;code&amp;gt;A(3, 1)&amp;lt;/code&amp;gt; but then reaches the undefined &amp;lt;code&amp;gt;A(3n+2, 0)&amp;lt;/code&amp;gt; rule several times before reaching the start config listed above.&lt;br /&gt;
&lt;br /&gt;
In Feb 2025, Racheline [https://discord.com/channels/960643023006490684/1259770421046411285/1337181169233559633 simulated] it past the unknown rule. According to her simulation, the machine reaches &amp;lt;code&amp;gt;A(1287547464911049659,10)&amp;lt;/code&amp;gt; after &amp;lt;code&amp;gt;1894603970741566467769886232237213051&amp;lt;/code&amp;gt; steps, and from there, the TM seems to be a cryptid. Andrew simulated it 100 million (rule) steps beyond this intermediate point, finding &amp;lt;code&amp;gt;b=33320662&amp;lt;/code&amp;gt;and &amp;quot;a&amp;quot; on the order of 10^12493892. This matches exactly what we would expect to see from a biased random walk biased towards traveling away from the origin with probability two-thirds. Note that the halting condition requires b = 0, which we are probviously unlikely to ever reach again, but if the TM did make it back, there is no guarantee that the machine halts. It could simply spiral back into either the a = 3n+1 or a = 3n+2 cases and return to its random walk condition again.&lt;br /&gt;
&lt;br /&gt;
== Analysis by Andrew Ducharme ==&lt;br /&gt;
https://discord.com/channels/960643023006490684/1259770421046411285/1336973758182981634 &lt;br /&gt;
&lt;br /&gt;
&amp;lt;nowiki&amp;gt;I found in August that it hits A(3n+2,0) after 113 A rule steps, but never seriously looked into what happened from there. The tape of the actual TM at that point is ginormous, so I looked at cases A(3n+2,0) -&amp;gt; 0&amp;lt;A 2 0^(3n+2) 2 0. From observations of the cases n=[0,1,2,...,10], the tape &amp;lt;/nowiki&amp;gt;&amp;lt;code&amp;gt;A(3n+2, 0)&amp;lt;/code&amp;gt; goes to &amp;lt;code&amp;gt;(16/3 n + 7 , 1) if n = 0 (mod 3), (16/3n + 25/3, 2) if n = 2 (mod 3).&amp;lt;/code&amp;gt;  God knows what happens if n is congruent to 1.  Using these rules, I was able to go from 113 rule steps to........118 before the congruent 1 case was triggered. &lt;br /&gt;
&lt;br /&gt;
In the first two cases, the lone 2 on the right hand side of the tape becomes a lone 4, and then is subsumed into the normal A(a,b) framework. In the last case, the lone 2 becomes a lone 4, then becomes a lone 1, but from there, I don&#039;t see a pattern. Sometimes it fixes itself, like when n = 1, but sometimes we enter a whole new phase like with n = 4.&lt;br /&gt;
[[Category:BB(2,5)]][[Category:Cryptids]]&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=1RB0LD_0RC1RB_0RD0RA_1LE0RD_1LF---_0LA1LA&amp;diff=9282</id>
		<title>1RB0LD 0RC1RB 0RD0RA 1LE0RD 1LF--- 0LA1LA</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=1RB0LD_0RC1RB_0RD0RA_1LE0RD_1LF---_0LA1LA&amp;diff=9282"/>
		<updated>2026-10-18T09:56:40Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: discord archive link&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{machine|1RB0LD_0RC1RB_0RD0RA_1LE0RD_1LF---_0LA1LA}}&lt;br /&gt;
{{TM|1RB0LD_0RC1RB_0RD0RA_1LE0RD_1LF---_0LA1LA}} (and its equivalent {{TM|1RB0LD_0RC0RF_0RD0RA_1LE0RD_1LF---_0LA1LA}}) is an unsolved [[BB(6)]] TM. It is the 8th [[Beaver Math Olympiad]] problem.&lt;br /&gt;
&lt;br /&gt;
== Analysis by mxdys ==&lt;br /&gt;
{{DiscordArchive|1239205785913790465|1402211374565953609}}&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
1RB0LD_0RC0RF_0RD0RA_1LE0RD_1LF---_0LA1LA&lt;br /&gt;
&lt;br /&gt;
(n+a,b,2n+c) --&amp;gt; (a,n+b,c)&lt;br /&gt;
&lt;br /&gt;
(0,b,c) --&amp;gt; (5+3b,0,c)&lt;br /&gt;
&lt;br /&gt;
(1,10+b,0) --&amp;gt; halt&lt;br /&gt;
(1,10+b,1) --&amp;gt; halt&lt;br /&gt;
&lt;br /&gt;
(2,b,0) --&amp;gt; (2,0,8+3b)&lt;br /&gt;
(2,b,1) --&amp;gt; (2,0,11+3b)&lt;br /&gt;
&lt;br /&gt;
(3+a,b,0) --&amp;gt; (a,0,6+3b)&lt;br /&gt;
(3+a,b,1) --&amp;gt; (a,0,9+3b)&lt;br /&gt;
&lt;br /&gt;
start: (10,0,12)&lt;br /&gt;
&lt;br /&gt;
this machine is weird&lt;br /&gt;
it does&#039;t halt in 8.9e12 rules (the first rule doesn&#039;t count)&lt;br /&gt;
for small (a,0,c), none of them halts between 1e5 and 1e8 rules (use the simplified model that (1,b,0) and (1,b,1) halts)&lt;br /&gt;
for each visited (a,0,c), log(c/a) seems to have a good distribution, which means that it doesn&#039;t fall into a fixpoint quickly&lt;br /&gt;
and the (2,b,0),(2,b,1) rules are used for several times:&lt;br /&gt;
T=462: 2 673 1&lt;br /&gt;
T=41231: 2 59502 0&lt;br /&gt;
T=6056795: 2 8748186 1&lt;br /&gt;
T=45863796: 2 66242895 0&lt;br /&gt;
T=2012212661: 2 2906495658 1&lt;br /&gt;
T=10335020887: 2 14928329409 1&lt;br /&gt;
T=468871071868: 2 677258129269 1&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Analysis by dyuan ==&lt;br /&gt;
https://discord.com/channels/960643023006490684/1468065303278911613&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
1RB0LD_0RC1RB_0RD0RA_1LE0RD_1LF---_0LA1LA &lt;br /&gt;
&lt;br /&gt;
A(a, b, c) = 1^4 0^a &amp;lt;A 1^3b 0 1^c 0 1^2&lt;br /&gt;
A(a+1, b, c+2) → A(a, b+1, c)&lt;br /&gt;
A(0, b, c) → A(3b+3, 0, c+2)&lt;br /&gt;
A(a+2, b, 0) → A(a, 0, 3b+5)&lt;br /&gt;
A(a+2, b, 1) → A(a, 0, 3b+8)&lt;br /&gt;
A(1, b+5, 0) → Halt (after some time)&lt;br /&gt;
A(1, b+4, 1) → Halt (after some time)&lt;br /&gt;
&lt;br /&gt;
Start: A(4, 0, 11)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
B(a, b) = A(a, 0, b)&lt;br /&gt;
&lt;br /&gt;
B(a+b+2, 2b+1) → B(a, 3b+8)&lt;br /&gt;
B(b+1, 2b+1) → Halt&lt;br /&gt;
B(a+b+2, 2b) → B(a, 3b+5)&lt;br /&gt;
B(b+1, 2b) → Halt&lt;br /&gt;
B(a, 2a+b) → B(3a+3, b+2)&lt;br /&gt;
&lt;br /&gt;
Start: B(4, 11)&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=1RB---_0RC0RE_1RD1RF_1LE0LB_1RC0LD_1RC1RA&amp;diff=9281</id>
		<title>1RB--- 0RC0RE 1RD1RF 1LE0LB 1RC0LD 1RC1RA</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=1RB---_0RC0RE_1RD1RF_1LE0LB_1RC0LD_1RC1RA&amp;diff=9281"/>
		<updated>2026-10-18T09:51:23Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: add discord message archives&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{machine|1RB---_0RC0RE_1RD1RF_1LE0LB_1RC0LD_1RC1RA}}{{unsolved|Does this TM halt? If so, how many steps does it take to halt?}}&lt;br /&gt;
{{TM|1RB---_0RC0RE_1RD1RF_1LE0LB_1RC0LD_1RC1RA}} is a [[probviously]] halting [[BB(6)]] [[Cryptid]] found by Racheline on 23 November 2024.&lt;br /&gt;
&lt;br /&gt;
When the TM starts on any starting state, it exhibits the same probviously halting behaviour:&lt;br /&gt;
&lt;br /&gt;
* When the starting state is A, the [[Tree Normal Form|TNF]] is {{TM|1RB---_0RC0RE_1RD1RF_1LE0LB_1RC0LD_1RC1RA}}.&lt;br /&gt;
* When the starting state is B, the TNF is not in TNF-1RB format, and can be (mostly) ignored.&lt;br /&gt;
* When the starting state is C, the TNF is {{TM|1RB1RD_1LC0LE_1RA0LB_1RA1RF_0RA0RC_1RE---}}.&lt;br /&gt;
* When the starting state is D, the TNF is {{TM|1RB0RE_1LC0RA_1LA1LD_1LC1LF_0LC0LB_1LE---}}.&lt;br /&gt;
* When the starting state is E, the TNF is {{TM|1RB0LC_1RC1RE_1LA0LD_0RB0RA_1RB1RF_1RD---}}.&lt;br /&gt;
* When the starting state is F, the TNF is {{TM|1RB1RF_1RC1RA_1LD0LE_1RB0LC_0RB0RD_1RE---}}. However, both E and F use &amp;lt;code&amp;gt;1RC&amp;lt;/code&amp;gt; as the first transition, so they have the same trajectory.&lt;br /&gt;
&lt;br /&gt;
There are 4 trajectories to analyze (A, C, D, and E).&lt;br /&gt;
&lt;br /&gt;
== Analysis by Racheline ==&lt;br /&gt;
&lt;br /&gt;
On 23 November 2024, Racheline posted an analysis ({{DiscordArchive|1239205785913790465|1309900024930635786 }}) of this TM. The TM has an interesting halting mechanism.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
`1RB---_0RC0RE_1RD1RF_1LE0LB_1RC0LD_1RC1RA` is a probviously halting cryptid. just an exponential one, specifically at each step it simply multiplies the main number by 8/3 and then changes a few things depending on what it was mod 3. the left side can change in a few ways to store information between these steps. if you start from the empty left side, there are some sequences of numbers you can get mod 3 which make the TM halt, and if the main number mod 3 was random, then the probability of this eventually happening would be 1 regardless of how long those sequences are. this is all standard stuff.&lt;br /&gt;
&lt;br /&gt;
however&lt;br /&gt;
i&#039;m pretty sure the shortest such sequence has length around 100. i think it&#039;s a fun puzzle to try to find one yourself. the shortest one i found on my own has length 110, though it&#039;s actually a group of 2^13\*3^15 = 117546246144 such sequences because some parts can be permuted with certain restrictions. specifically, each (n,m) in the following sequence of pairs can be replaced with any sequence of n 2&#039;s and m 0&#039;s whose first k elements contain at least k/3 2&#039;s for every k&amp;lt;=n+m:&lt;br /&gt;
||(1,0), (2,1), (1,0), (2,3), (1,0), (2,4), (1,0), (2,3), (1,0), (3,5), (1,0), (3,4), (1,0), (3,3), (1,0), (2,4), (1,0), (2,3), (1,0), (3,4), (1,0), (3,6), (1,0), (2,3), (1,0), (3,4), (1,0), (3,6), (1,0)|| (spoilered because i think it&#039;s a relatively fun puzzle to try to figure out on your own)&lt;br /&gt;
for any given point at which the left side is empty, the probability that it will follow one of these sequences from that point is just above 1/3^87&lt;br /&gt;
i also ran a search on all sequences of only 0&#039;s and 2&#039;s (1&#039;s seem to always reset most of the progress you made in getting to a halting config so i ignored those) up to that length, and the shortest it found was length 107, so the only way it&#039;s less than that would be if either my code is wrong or somehow 1&#039;s manage to be useful for something other than resetting.&lt;br /&gt;
&lt;br /&gt;
so i think it&#039;s pretty reasonable to guess that from a given position with empty left side, the probability that the TM will halt before resetting the left side is around 1/3^80. the rest of the computation is the same as always: the expected number of times we generate a new random number mod 3 should be around 3^80, and since that happens only when the main number is roughly multiplied by 8/3, the number of 1s when halting should be around (8/3)^3^80 ≈ 10^10^37.8, and the halting time should be around (that)^2, i.e. around 10^10^38.1&lt;br /&gt;
i know, not that impressive compared to the current champion, but i&#039;m posting it because i like the mechanism. also i guess it would still be in 11th place if this approximation is correct, though the current 11th place TM takes around 10^10^35.3 steps to halt so it&#039;s kinda close.&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Analysis by @-d ==&lt;br /&gt;
&lt;br /&gt;
@-d has provided an analysis of a similar TM {{TM|1RB0RE_1LC0RA_1LA1LD_1LC1LF_0LC0LB_1LE---}} (i.e. start state D). @-d believes that this TM is probviously halting because it chooses 3 rules seemingly at random, and there is a path of 108 rules that causes the TM to halt.&lt;br /&gt;
&lt;br /&gt;
Message sent on Aug 13 2025: {{DiscordArchive|1400456788955893840|1405116468168888423}}&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
1RB0RE_1LC0RA_1LA1LD_1LC1LF_0LC0LB_1LE---&lt;br /&gt;
&lt;br /&gt;
A(n,r) = 0^inf &amp;lt;F 1^n r 0^inf&lt;br /&gt;
 n &amp;gt;= 2 (n &amp;lt;= 1 causes the tm to have setup issues)&lt;br /&gt;
 r is &amp;quot;&amp;quot; or starts with 0&lt;br /&gt;
&lt;br /&gt;
start at A(9,&amp;quot;&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
start from A(n,r) and simulate until the head reaches r. the config depends on n%3:&lt;br /&gt;
 for n%3==2, 0^inf 11 (01)^? B&amp;gt; r 0^inf&lt;br /&gt;
 for n%3==0, 0^inf 11 (01)^? 0 A&amp;gt; r 0^inf&lt;br /&gt;
 for n%3==1, 0^inf 11 (01)^? 00 E&amp;gt; r 0^inf&lt;br /&gt;
 in all 3 cases, the machine will reach a new config A(n&#039;,r&#039;)&lt;br /&gt;
 call these 3 changes B, A, E&lt;br /&gt;
&lt;br /&gt;
B makes r shorter&lt;br /&gt;
A is harder to analyze. A usually makes r shorter, but sometimes makes r longer.&lt;br /&gt;
A can halt on certain values of r. for example, A(3,&amp;quot;011011011&amp;quot;) halts.&lt;br /&gt;
E usually makes r longer&lt;br /&gt;
E can halt on certain values of r. for example, A(4,&amp;quot;011011&amp;quot;) and A(4,&amp;quot;01011011&amp;quot;) halt.&lt;br /&gt;
&lt;br /&gt;
A(n,r) --&amp;gt; A(n&#039;,r&#039;) always happens, regardless of n%3. given r, the next possible r&#039; can be found by simulating A(3k,r), A(3k+1,r), A(3k+2,r) and recording r&#039;. do a bfs starting at r=&amp;quot;&amp;quot;. the bfs visited ~235000 different values of r. the shortest path to halt has length 108:&lt;br /&gt;
EEBBEBEEBEEEBBEBBEEBBEBEEBBEBBEEEBBEBBEBBEEBBEEEBBEBEEEBBEBBEEBBEBEEBBEBBEEEBBEBBEBBEEBBEBEEBBEBBEEEBBEBBEBE&lt;br /&gt;
(somehow, A was useless in the bfs. i&#039;m not sure why.)&lt;br /&gt;
&lt;br /&gt;
these configs will reach halt:&lt;br /&gt;
A(3^108 * k + 1975700577069254261393123959451562008800234946348086, &amp;quot;&amp;quot;)&lt;br /&gt;
(i didn&#039;t formally prove this. it is likely to be true.)&lt;br /&gt;
&lt;br /&gt;
open question: starting from A(9,&amp;quot;&amp;quot;), will the config eventually become A(3^108 * k + 1975700577069254261393123959451562008800234946348086, &amp;quot;&amp;quot;)?&lt;br /&gt;
&lt;br /&gt;
there are 3 likely outcomes for my open question:&lt;br /&gt;
1. the config is impossible to reach.&lt;br /&gt;
2. the config is possible to reach, but the tm needs ~3^108 attempts to reach it. each attempt looks like A(n,r) --&amp;gt; A(~ 8n/3,r&#039;). the config before halting will be A(~(8/3)^(3^108),?) = A(~10^10^51,?).&lt;br /&gt;
3. the tm halts, but in another way. i.e. the length 108 path is unused.&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Message sent on Aug 25 2025: {{DiscordArchive|1400456788955893840|1409086365244854377}}&lt;br /&gt;
&lt;br /&gt;
@-d has a formal proof that &amp;lt;math&amp;gt;A(3^{108} * k + 1975700577069254261393123959451562008800234946348086)&amp;lt;/math&amp;gt; will halt, for all &amp;lt;math&amp;gt;k \ge 0&amp;lt;/math&amp;gt;. It is in [https://github.com/int-y1/proofs/blob/1929f57df4dd7afcc11c3f458e20526fd1f991e0/BusyLean/Individual/1RB0RE_1LC0RA_1LA1LD_1LC1LF_0LC0LB_1LE---.lean#L321-L322].&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
1RB0RE_1LC0RA_1LA1LD_1LC1LF_0LC0LB_1LE--- (update 2)&lt;br /&gt;
&lt;br /&gt;
from my previous post, i gave a path of length 108 that causes the tm to halt. there might be 1057916215296 paths of length 108 that cause the tm to halt. the chance of using a length-108 path to halt is around 1057916215296/3^108 (about 10^-39). warning: the tm can still halt in another way.&lt;br /&gt;
&lt;br /&gt;
A(n,*) transitions to A(~8n/3,*). it&#039;s possible that the tm is unlucky and it needs 10^39 transitions to halt.&lt;br /&gt;
&lt;br /&gt;
i simulated the tm and looked at A(*,*). the 1st A(*,*) is A(9,&amp;quot;&amp;quot;). i ran the simulation up to the 2728570th A(*,*) (i.e. A(~2^3861031,&amp;quot;0111111111111111111111111&amp;quot;)). the tm never came close to finishing the length-108 path. the closest attempt was 21 out of 108 steps, and this happened at the 2379364th A(*,*) (i.e. A(~2^3366892,&amp;quot;010101101010111&amp;quot;)).&lt;br /&gt;
&lt;br /&gt;
lastly, the next k transitions for A(n,r) and A(n+3^k,r) are probably the same (i think this is true, but didn&#039;t rigorously prove this). it&#039;s worth investigating n%(3^k). i looked into the sequence of n%3, but this sequence appears statistically random. maybe someone can look into n%(3^k) more carefully.&lt;br /&gt;
&lt;br /&gt;
this tm is like a lottery machine. i think it&#039;s probviously halting.&lt;br /&gt;
&lt;br /&gt;
next steps:&lt;br /&gt;
&lt;br /&gt;
* verify the simulation steps. does A(~2^3366892,&amp;quot;010101101010111&amp;quot;) occur?&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:BB(6)]][[Category:Cryptids]]&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=1RB0LF_1RC1RB_1LD0RA_1LB0LE_1RZ0LC_1LA1LF&amp;diff=9280</id>
		<title>1RB0LF 1RC1RB 1LD0RA 1LB0LE 1RZ0LC 1LA1LF</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=1RB0LF_1RC1RB_1LD0RA_1LB0LE_1RZ0LC_1LA1LF&amp;diff=9280"/>
		<updated>2026-10-18T09:48:12Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: fixed archive link&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Machine|1RB0LF_1RC1RB_1LD0RA_1LB0LE_1RZ0LC_1LA1LF}}&lt;br /&gt;
{{TM|1RB0LF_1RC1RB_1LD0RA_1LB0LE_1RZ0LC_1LA1LF|halt}} is a long running halting [[BB(6)]] TM first analyzed by Katelyn Doucette on 1 Jun 2025 ({{DiscordArchive|1375512968569028648|1378916236104171562}}). It is a [[shift overflow counter]] that halts with a final sigma score of roughly &amp;lt;math&amp;gt;10 \uparrow \uparrow 7.52390&amp;lt;/math&amp;gt;. It is currently the 4th longest known running halting [[BB(6)]] TM.&lt;br /&gt;
&lt;br /&gt;
== Analysis by Katelyn Doucette==&lt;br /&gt;
(These rules were automatically generated by https://github.com/Laturas/shift_overflow_subset_decider)&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
START = A(5, 2^2 - 1, 0) at step 57&lt;br /&gt;
A(3k, 2^n - 1, 0) -&amp;gt; HALT&lt;br /&gt;
A(3k + 1, 2^n - 1, 0) -&amp;gt; A(5, 2^2 - 1, n + 2k + 0)&lt;br /&gt;
A(3k + 2, 2^n - 1, 0) -&amp;gt; A(5, 2^2 - 1, n + 2k + 1)&lt;br /&gt;
A(a, 2^n - 1, c) -&amp;gt; A(a + 2^n (4(4^c - 1)/3) - 3c, 2^{n+2c} - 1, 0)&lt;br /&gt;
&lt;br /&gt;
---------- RULE EVALUATION ----------&lt;br /&gt;
START = A(5, 2^2 - 1, 0)&lt;br /&gt;
A(5, 2^2 - 1, 0) -&amp;gt; A(5, 2^2 - 1, 5) -&amp;gt; A(5446, 2^12 - 1, 0)    (mod 6377292)&lt;br /&gt;
A(5446, 2^12 - 1, 0) -&amp;gt; A(5, 2^2 - 1, 3642) -&amp;gt; A(195563, 2^7286 - 1, 0)    (mod 708588)&lt;br /&gt;
A(195563, 2^7286 - 1, 0) -&amp;gt; A(5, 2^2 - 1, 137661) -&amp;gt; A(72002, 2^39128 - 1, 0)    (mod 78732)&lt;br /&gt;
A(72002, 2^39128 - 1, 0) -&amp;gt; A(5, 2^2 - 1, 8397) -&amp;gt; A(7430, 2^8048 - 1, 0)    (mod 8748)&lt;br /&gt;
A(7430, 2^8048 - 1, 0) -&amp;gt; A(5, 2^2 - 1, 1337) -&amp;gt; A(838, 2^732 - 1, 0)    (mod 972)&lt;br /&gt;
A(838, 2^732 - 1, 0) -&amp;gt; A(5, 2^2 - 1, 318) -&amp;gt; A(107, 2^98 - 1, 0)    (mod 108)&lt;br /&gt;
A(107, 2^98 - 1, 0) -&amp;gt; A(5, 2^2 - 1, 25) -&amp;gt; A(6, 2^4 - 1, 0)    (mod 12)&lt;br /&gt;
 -&amp;gt; HALT&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Analysis by [[User:Sligocki|Shawn Ligocki]] ==&lt;br /&gt;
{{DiscordArchive|1375512968569028648|1378925307544997898}}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
1RB0LF_1RC1RB_1LD0RA_1LB0LE_---0LC_1LA1LF&lt;br /&gt;
   0 (5, 2, 5, 2, 0, 1)&lt;br /&gt;
   1 (((-46 + 2^14)/3), 12, 5, 2, 0, 1)&lt;br /&gt;
   2 (((-11 + 2^((56 + 2^16)/9) + -1 * 2^15)/3), ((38 + 2^16)/9), 5, 2, 0, 1)&lt;br /&gt;
   3 (((-14 + 2^((62 + 2^((74 + 2^16)/9))/9) + -1 * 2^((65 + 2^16)/9))/3), ((44 + 2^((74 + 2^16)/9))/9), 5, 2, 0, 1)&lt;br /&gt;
   4 (((-14 + 2^((62 + 2^((80 + 2^((74 + 2^16)/9))/9))/9) + -1 * 2^((71 + 2^((74 + 2^16)/9))/9))/3), ((44 + 2^((80 + 2^((74 + 2^16)/9))/9))/9), 5, 2, 0, 1)&lt;br /&gt;
   5 (((-14 + 2^((62 + 2^((80 + 2^((80 + 2^((74 + 2^16)/9))/9))/9))/9) + -1 * 2^((71 + 2^((80 + 2^((74 + 2^16)/9))/9))/9))/3), ((44 + 2^((80 + 2^((80 + 2^((74 + 2^16)/9))/9))/9))/9), 5, 2, 0, 1)&lt;br /&gt;
   6 (((-11 + 2^((56 + 2^((80 + 2^((80 + 2^((80 + 2^((74 + 2^16)/9))/9))/9))/9))/9) + -1 * 2^((71 + 2^((80 + 2^((80 + 2^((74 + 2^16)/9))/9))/9))/9))/3), ((38 + 2^((80 + 2^((80 + 2^((80 + 2^((74 + 2^16)/9))/9))/9))/9))/9), 5, 2, 0, 1)&lt;br /&gt;
   7 (((-14 + 2^((62 + 2^((74 + 2^((80 + 2^((80 + 2^((80 + 2^((74 + 2^16)/9))/9))/9))/9))/9))/9) + -1 * 2^((65 + 2^((80 + 2^((80 + 2^((80 + 2^((74 + 2^16)/9))/9))/9))/9))/9))/3), ((44 + 2^((74 + 2^((80 + 2^((80 + 2^((80 + 2^((74 + 2^16)/9))/9))/9))/9))/9))/9), 5, 2, 0, 1)&lt;br /&gt;
Halted with score: ~10↑↑7.52390  =  ((34 + 2^((71 + 2^((74 + 2^((80 + 2^((80 + 2^((80 + 2^((74 + 2^16)/9))/9))/9))/9))/9))/9))/9)&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Equivalent TMs ==&lt;br /&gt;
The following TMs have near identical behavior, producing the same values but do so slightly more efficiently:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
1RB0LF_1RC1RB_1LD0RA_1LF0LE_---0LC_1LA1LF&lt;br /&gt;
1RB0LF_1RC1RB_1LD0RA_1RF0LE_---0LC_1LA1LF&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Related TMs ==&lt;br /&gt;
This TM is part of a broader family of 15 turing machines with similar rules. The family is made up of the following:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
1RB1RA_1LC0RF_---0LD_0LE0LB_1LF1LE_1RA0LE&lt;br /&gt;
1RB0RE_1LC0RF_1LD1LC_1RA0LB_---0RD_1RB1RF&lt;br /&gt;
1RB0LF_1RC1RB_1LD0RA_0RF0LE_---0LC_1LA1LF&lt;br /&gt;
1RB0LF_1RC1RB_1LD0RA_0RA0LE_---0LC_1LA1LF&lt;br /&gt;
1RB0LF_1LC1LB_1RD0LB_1RE1RD_1LA0RC_---0LE&lt;br /&gt;
1RB0LF_1RC1RB_1LD0RA_1RA0LE_---0LC_1LA1LF&lt;br /&gt;
1RB0LE_1LC0RD_1LA1LC_---0RA_1LC0RF_1RE1RF&lt;br /&gt;
1RB0LF_1RC1RB_1LD0RA_1LA0LE_---0LC_1LA1LF&lt;br /&gt;
1RB0LD_1RC0RF_1RD1RC_1LE0RC_1LA1LE_---0RA&lt;br /&gt;
1RB0LF_1RC1RB_1LD0RA_1RF0LE_---0LC_1LA1LF&lt;br /&gt;
1RB0LD_1RC0RF_1LA1LC_1LC0RE_1RD1RE_---0RA&lt;br /&gt;
1RB1RA_1LC0RA_1LD1LC_1RE0LB_0LA0RF_---0RD&lt;br /&gt;
1RB0LC_0LC0RF_1LE0RD_1RC1RD_1LA1LE_---0RA&lt;br /&gt;
1RB0LF_1RC1RB_1LD0RA_1LB0LE_---0LC_1LA1LF&lt;br /&gt;
1RB0LF_1RC1RB_1LD0RA_1LF0LE_---0LC_1LA1LF&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
All of these turing machines have been shown to halt. Interestingly, &amp;lt;code&amp;gt;1RB1RA_1LC0RF_---0LD_0LE0LB_1LF1LE_1RA0LE&amp;lt;/code&amp;gt; is the only one to halt when the unary counter is equal to 1 mod 3 or 2 mod 3 instead of 0 mod 3.&lt;br /&gt;
&lt;br /&gt;
All of these machines are fundamentally characterized by the rule &amp;lt;code&amp;gt;A(a, 2^n - 1, c) -&amp;gt; A(a + 2^n (4(4^c - 1)/3) - 3c, 2^{n+2c} - 1, 0)&amp;lt;/code&amp;gt; and only differ in starting conditions and reset behavior.&lt;br /&gt;
&lt;br /&gt;
{{TM|1RB1LE_1RC1RC_1LD0LF_1LE1LD_1RF0LC_1RZ0RA}} exhibits similar behavior but never halts. See proof at: ({{DiscordArchive|1375512968569028648|1378916236104171562}}).&lt;br /&gt;
&lt;br /&gt;
[[Category:BB(6)]]&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=1RB0LD_0RC0RE_1LC0LA_---1LE_0LF0RE_0RA0LE&amp;diff=9257</id>
		<title>1RB0LD 0RC0RE 1LC0LA ---1LE 0LF0RE 0RA0LE</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=1RB0LD_0RC0RE_1LC0LA_---1LE_0LF0RE_0RA0LE&amp;diff=9257"/>
		<updated>2026-10-17T16:14:58Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: try to change to references&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{machine|1RB0LD_0RC0RE_1LC0LA_---1LE_0LF0RE_0RA0LE}}{{Stub}}&lt;br /&gt;
{{TM|1RB0LD_0RC0RE_1LC0LA_---1LE_0LF0RE_0RA0LE}} was a probable [[BB(6)]] [[Cryptid]] analyzed by Racheline on 16 May 2025.&amp;lt;ref&amp;gt;{{DiscordArchive|1239205785913790465|1373012119452389418}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{DiscordArchive|1373100094819139615|1373100094819139615}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
It was decided by Alistaire on 15 Feb 2026 as non-halting via Quick_Sim.py.&amp;lt;ref&amp;gt;{{DiscordArchive|1239205785913790465|1472376779825090713}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
[[Category:BB(6)]]&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=BB(6)&amp;diff=9239</id>
		<title>BB(6)</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=BB(6)&amp;diff=9239"/>
		<updated>2026-10-17T14:19:28Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: fix archive&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The 6-state, 2-symbol Busy Beaver problem, &#039;&#039;&#039;BB(6)&#039;&#039;&#039;, refers to the unsolved 6&amp;lt;sup&amp;gt;th&amp;lt;/sup&amp;gt; value of the [[Busy Beaver function]]. With the discovery of the [[Cryptid]] machine [[Antihydra]] in June 2024, we now know that we must solve a [[Collatz-like]] problem in order to solve BB(6) and thus [https://www.sligocki.com/2024/07/06/bb-6-2-is-hard.html BB(6) is Hard].&lt;br /&gt;
&lt;br /&gt;
The current BB(6) [[champion]] {{TM|1RB1RA_1RC1RZ_1LD0RF_1RA0LE_0LD1RC_1RA0RE|halt}} was discovered by mxdys in June 2025, proving the lower bound:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;S(6) &amp;gt; \Sigma(6) &amp;gt; 10 \uparrow\uparrow 10 \uparrow\uparrow 10 \uparrow\uparrow 8&amp;lt;/math&amp;gt;&lt;br /&gt;
== History ==&lt;br /&gt;
{| class=&amp;quot;wikitable mw-collapsible&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
! colspan=&amp;quot;6&amp;quot; |Timeline of bounds established for Σ(6) and S(6)&amp;lt;ref name=&amp;quot;:PMH&amp;quot;&amp;gt;Pascal Michel. (last updated 2026). The Busy Beaver Competition: a historical survey. https://bbchallenge.org/~pascal.michel/ha#tm62 &amp;lt;/ref&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
!Month of discovery&lt;br /&gt;
!Machine&lt;br /&gt;
!S(6)&lt;br /&gt;
!Σ(6)&lt;br /&gt;
!Discoverer&lt;br /&gt;
!Notes&lt;br /&gt;
|-&lt;br /&gt;
|November 1964&lt;br /&gt;
|{{TM|1LB1RZ_0LC1LC_0LD0LC_1LE1RA_0LF0LE_1RF1RD|halt}}&lt;br /&gt;
|≥ 436&lt;br /&gt;
|≥ 35&lt;br /&gt;
|Green, M.&lt;br /&gt;
|Part of an infinite family of machines now known as [[Green&#039;s machines]].&lt;br /&gt;
|-&lt;br /&gt;
|August 1972&lt;br /&gt;
|{{TM|1RB0LB_1LC1RZ_0LD0LC_1LE0RA_0LF0LE_1RF1RD|halt}}&lt;br /&gt;
|≥ 521&lt;br /&gt;
|≥ 42&lt;br /&gt;
|Lynn, D.&amp;lt;ref&amp;gt;https://docs.bbchallenge.org/papers/Lynn1972.pdf&amp;lt;/ref&amp;gt;&lt;br /&gt;
|Donald Lynn writes that this machine runs for 522 steps; this statement was either erroneous, or made with respect to another stopping convention.&lt;br /&gt;
|-&lt;br /&gt;
|November 1973&lt;br /&gt;
| style=&amp;quot;background: #CCFFFF;&amp;quot; |{{TM|1RB0LD_1RC0RB_1LA0RA_0LC0LE_1LC1RZ|halt}}&lt;br /&gt;
|≥ 992&lt;br /&gt;
| style=&amp;quot;background: #FFCCCC;&amp;quot; |≥ 23&lt;br /&gt;
|Weimann,&amp;amp;nbsp;B.&amp;lt;ref name=&amp;quot;:5&amp;quot;&amp;gt;https://docs.bbchallenge.org/other/lud20.pdf&amp;lt;/ref&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |1974&lt;br /&gt;
| style=&amp;quot;background: #CCFFFF;&amp;quot; |{{TM|0RB1RZ_1RC0LD_1RD0RE_1LB0LD_1RE1RA|halt}}&lt;br /&gt;
|≥ 7,707&lt;br /&gt;
| style=&amp;quot;background: #FFCCCC;&amp;quot; |≥ 88&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |Lynn, D.&amp;lt;ref&amp;gt;https://docs.bbchallenge.org/papers/Brady1983.pdf&amp;lt;/ref&amp;gt;&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |These bounds were published simultaneously in April 1983.&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;background: #CCFFFF;&amp;quot; |{{TM|1RB0LE_1RC0RA_1LD1RZ_1LE1LD_1LA0LC|halt}}&lt;br /&gt;
| style=&amp;quot;background: #FFCCCC;&amp;quot; |≥ 6,147&lt;br /&gt;
|≥ 112&lt;br /&gt;
|-&lt;br /&gt;
|August 1982&lt;br /&gt;
| style=&amp;quot;background: #CCFFFF;&amp;quot; |{{TM|1RB0LC_1RC1RD_1LA0RB_0RE1RZ_1LC1RA|halt}}&lt;br /&gt;
|≥ 134,467&lt;br /&gt;
|≥ 501&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |Schult, U.&amp;lt;ref name=&amp;quot;:5&amp;quot; /&amp;gt;&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |These bounds were published simultaneously in January 1983.&lt;br /&gt;
|-&lt;br /&gt;
|December 1982&lt;br /&gt;
|{{TM|1RB1RZ_1RC1RC_1RD1LF_1RE1RA_1RF0RD_1LB0LC|halt}}&lt;br /&gt;
|≥ 4,208,824&lt;br /&gt;
|≥ 2,075&lt;br /&gt;
|-&lt;br /&gt;
|August 1989&lt;br /&gt;
| style=&amp;quot;background: #CCFFFF;&amp;quot; |{{TM|1RB1RA_1LC1LB_1RA1LD_1RA1LE_1RZ0LC|halt}}&lt;br /&gt;
|≥ 11,798,826&lt;br /&gt;
|≥ 4,098&lt;br /&gt;
| rowspan=&amp;quot;3&amp;quot; |Marxen, H., Buntrock,&amp;amp;#x20;J.&amp;lt;ref name=&amp;quot;:02&amp;quot;&amp;gt;H. Marxen and J. Buntrock. Attacking the Busy Beaver 5. Bulletin of the EATCS, 40, pages 247-251, February 1990. https://turbotm.de/~heiner/BB/mabu90.html&amp;lt;/ref&amp;gt;&lt;br /&gt;
|Eventually proven to be a Σ(5) champion in 2024.&lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |September&amp;amp;#x20;1989&lt;br /&gt;
| style=&amp;quot;background: #CCFFFF;&amp;quot; |{{TM|1RB0LD_1LC1RD_1LA1LC_1RZ1RE_1RA0RB|halt}}&lt;br /&gt;
|≥ 23,554,764&lt;br /&gt;
| style=&amp;quot;background: #FFCCCC;&amp;quot; |≥ 4,097&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;background: #CCFFFF;&amp;quot; |{{TM|1RB1LC_1RC1RB_1RD0LE_1LA1LD_1RZ0LA|halt}}&lt;br /&gt;
|≥ 47,176,870&lt;br /&gt;
| style=&amp;quot;background: #FFCCCC;&amp;quot; |≥ 4,098&lt;br /&gt;
|Eventually proven to be the S(5) champion and a Σ(5) champion in 2024.&lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |January 1990&lt;br /&gt;
|{{TM|1RB1RA_1LC1LB_0LF1LD_1RA0LE_0RA1LC_1RE1RZ|halt}}&lt;br /&gt;
|≥ 13,122,572,797&lt;br /&gt;
|≥ 136,612&lt;br /&gt;
| rowspan=&amp;quot;6&amp;quot; |Marxen, H., Buntrock,&amp;amp;nbsp;J.&amp;lt;ref name=&amp;quot;:1&amp;quot;&amp;gt;https://turbotm.de/~heiner/BB/bb-list&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;https://turbotm.de/~heiner/BB/bb-6list&amp;lt;/ref&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA_1LC1LB_0RF1LD_1RA0LE_1LZ1LF_0LA0LC|halt}}&lt;br /&gt;
|≥&amp;amp;nbsp;8,690,333,381,690,951&lt;br /&gt;
|≥ 95,524,079&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|July 2000&lt;br /&gt;
|{{TM|1RB0RC_0LA0RD_1RD1RZ_1LE0LD_1RF1LB_1RA1RE|halt}}&lt;br /&gt;
|&amp;gt; 5.36 × 10&amp;lt;sup&amp;gt;42&amp;lt;/sup&amp;gt;&lt;br /&gt;
|&amp;gt; 2.53 × 10&amp;lt;sup&amp;gt;21&amp;lt;/sup&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |August 2000&lt;br /&gt;
|{{TM|1RB0LC_1LA1RC_1RA0LD_1LE1LC_1RF1RZ_1RA1RE|halt}}&lt;br /&gt;
|&amp;gt; 6.12 × 10&amp;lt;sup&amp;gt;119&amp;lt;/sup&amp;gt;&lt;br /&gt;
|&amp;gt; 1.42 × 10&amp;lt;sup&amp;gt;60&amp;lt;/sup&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LB_0RC1LB_1RD0LA_1LE1LF_1LA0LD_1RH1LE|halt}}&lt;br /&gt;
|&amp;gt; 6.19 × 10&amp;lt;sup&amp;gt;925&amp;lt;/sup&amp;gt;&lt;br /&gt;
|&amp;gt; 6.42 × 10&amp;lt;sup&amp;gt;462&amp;lt;/sup&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|February 2001&lt;br /&gt;
|{{TM|1RB0LF_0RC0RD_1LD1RE_0LE0LD_0RA1RC_1LA1RZ|halt}}&lt;br /&gt;
|&amp;gt; 3.00 × 10&amp;lt;sup&amp;gt;1,730&amp;lt;/sup&amp;gt;&lt;br /&gt;
|&amp;gt; 1.29 × 10&amp;lt;sup&amp;gt;865&amp;lt;/sup&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|November&amp;amp;nbsp;2007&lt;br /&gt;
|{{TM|1RB0RF_0LB1LC_1LD0RC_1LE1RZ_1LF0LD_1RA0LE|halt}}&lt;br /&gt;
|&amp;gt; 8.92 × 10&amp;lt;sup&amp;gt;1,762&amp;lt;/sup&amp;gt;&lt;br /&gt;
|&amp;gt; 2.50 × 10&amp;lt;sup&amp;gt;881&amp;lt;/sup&amp;gt;&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |Ligocki, T., Ligocki,&amp;amp;nbsp;S.&amp;lt;ref name=&amp;quot;:2&amp;quot;&amp;gt;https://web.archive.org/web/20160420171959/http://www.drb.insel.de/~heiner/BB/bbsimtab.html&amp;lt;/ref&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|December 2007&lt;br /&gt;
|{{TM|1RB0LE_1LC0RA_1LD0RC_1LE0LF_1LA1LC_1LE1RZ|halt}}&lt;br /&gt;
|&amp;gt; 2.58 × 10&amp;lt;sup&amp;gt;2,879&amp;lt;/sup&amp;gt;&lt;br /&gt;
|&amp;gt; 4.64 × 10&amp;lt;sup&amp;gt;1,439&amp;lt;/sup&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|May 2010&lt;br /&gt;
|{{TM|1RB0LD_1RC0RF_1LC1LA_0LE1RZ_1LA0RB_0RC0RE|halt}}&lt;br /&gt;
|&amp;gt; 3.80 × 10&amp;lt;sup&amp;gt;21,132&amp;lt;/sup&amp;gt;&lt;br /&gt;
|&amp;gt; 3.18 × 10&amp;lt;sup&amp;gt;10,566&amp;lt;/sup&amp;gt;&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |Kropitz, P.&amp;lt;ref name=&amp;quot;:2&amp;quot; /&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|June 2010&lt;br /&gt;
|{{TM|1RB1LE_1RC1RF_1LD0RB_1RE0LC_1LA0RD_1RZ1RC|halt}}&lt;br /&gt;
|&amp;gt; 7.41 × 10&amp;lt;sup&amp;gt;36,534&amp;lt;/sup&amp;gt;&lt;br /&gt;
|&amp;gt; 3.51 × 10&amp;lt;sup&amp;gt;18,267&amp;lt;/sup&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;5&amp;quot; |May 2022&lt;br /&gt;
|{{TM|1RB1RC_1LC0RF_1RA0LD_0LC0LE_1LD0RA_1RE1RZ|halt}}&lt;br /&gt;
|&amp;gt; 9.66 × 10&amp;lt;sup&amp;gt;78,913&amp;lt;/sup&amp;gt;&lt;br /&gt;
|&amp;gt; 6.02 × 10&amp;lt;sup&amp;gt;39,456&amp;lt;/sup&amp;gt;&lt;br /&gt;
|Ligocki, S.&amp;lt;ref name=&amp;quot;:0&amp;quot;&amp;gt;https://www.sligocki.com/2022/06/21/bb-6-2-t15.html&amp;lt;/ref&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ_1RC1RA_1RD0RB_1LE0RC_0LF0LD_0LB1LA|halt}}&lt;br /&gt;
|&amp;gt; 5.42 × 10&amp;lt;sup&amp;gt;197,282&amp;lt;/sup&amp;gt;&lt;br /&gt;
|&amp;gt; 2.01 × 10&amp;lt;sup&amp;gt;98,641&amp;lt;/sup&amp;gt;&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |Kropitz, P.&amp;lt;ref name=&amp;quot;:0&amp;quot; /&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ_0LC0LD_1LD1LC_1RE1LB_1RF1RD_0LD0RA|halt}}&lt;br /&gt;
|&amp;gt; 8.27 × 10&amp;lt;sup&amp;gt;1,292,913,985&amp;lt;/sup&amp;gt;&lt;br /&gt;
|&amp;gt;&amp;amp;nbsp;1.76&amp;amp;nbsp;×&amp;amp;nbsp;10&amp;lt;sup&amp;gt;646,456,993&amp;lt;/sup&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LA_1LC1LF_0LD0LC_0LE0LB_1RE0RA_1RZ1LD|halt}}&lt;br /&gt;
| colspan=&amp;quot;2&amp;quot; |&amp;gt; 10&amp;amp;uparrow;&amp;amp;uparrow;5.63&lt;br /&gt;
|Ligocki, S.&amp;lt;ref name=&amp;quot;:0&amp;quot; /&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LD_1RC0RF_1LC1LA_0LE1RZ_1LF0RB_0RC0RE|halt}}&lt;br /&gt;
| colspan=&amp;quot;2&amp;quot; |&amp;gt; 10&amp;amp;uparrow;&amp;amp;uparrow;15.60&lt;br /&gt;
|Kropitz, P.&amp;lt;ref name=&amp;quot;:0&amp;quot; /&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;3&amp;quot; |June 2025&lt;br /&gt;
|{{TM|1RB1LC_1LA1RE_0RD0LA_1RZ1LB_1LD0RF_0RD1RB|halt}}&lt;br /&gt;
| colspan=&amp;quot;2&amp;quot; |&amp;gt; 10&amp;amp;uparrow;&amp;amp;uparrow;11,010,000&lt;br /&gt;
| rowspan=&amp;quot;3&amp;quot; |mxdys&amp;lt;ref&amp;gt;https://discord.com/channels/960643023006490684/1384195691529633896/1384195691529633896&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;https://discord.com/channels/960643023006490684/1384195691529633896/1384772277932920894&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;https://discord.com/channels/960643023006490684/1387426381041893417/1387426381041893417&amp;lt;/ref&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LE_1LC0RA_1RB1LD_1LC0LC_1RF0LB_1RZ1RE|halt}}&lt;br /&gt;
| style=&amp;quot;background: #FFCCCC;&amp;quot; | &amp;gt; 10&amp;amp;uparrow;&amp;amp;uparrow;11,010,000&lt;br /&gt;
|&amp;gt; 10&amp;amp;uparrow;&amp;amp;uparrow;11,010,000                                      &lt;br /&gt;
|This machine&#039;s score exceeds the previous bound for S(6) by 2.&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA_1RC1RZ_1LD0RF_1RA0LE_0LD1RC_1RA0RE|halt}}&lt;br /&gt;
| colspan=&amp;quot;2&amp;quot; |&amp;gt; 10↑↑10↑↑10↑↑8.10&lt;br /&gt;
|&lt;br /&gt;
|}&lt;br /&gt;
Bounds highlighted in &amp;lt;span style=&amp;quot;background: #FFCCCC&amp;quot;&amp;gt;red&amp;lt;/span&amp;gt; indicate those which did not improve upon the best known at the time. Machines highlighted in &amp;lt;span style=&amp;quot;background: #CCFFFF&amp;quot;&amp;gt;blue&amp;lt;/span&amp;gt; were inherited from the hunt for BB(5).[[File:BB(6) holdouts decrease over time.png|alt=BB(6) Holdouts count decrease overtime.|thumb|Number of BB(6) holdouts over time.]]&lt;br /&gt;
In June 2024, the machine {{TM|1RB1RA_0LC1LE_1LD1LC_1LA0LB_1LF1RE_---0RA}} (now known as [[Antihydra]]) was isolated from the BB(6) holdouts, and recognised as a [[Cryptids|Cryptid]], implying that determining the exact value of S(6) would be, in a certain mathematical sense, hard.&lt;br /&gt;
&lt;br /&gt;
@mxdys&#039;s [[Holdouts lists|holdouts list]] has 663 machines up to equivalence and 1417 machines not considering equivalence as of 16 October 2026. Partial Rocq proof is [https://github.com/ccz181078/busycoq/tree/BB6 available on Github].&lt;br /&gt;
&lt;br /&gt;
Often up-to-date annotated spreadsheet, with links to Discord discussions: [https://docs.google.com/spreadsheets/d/1mMp8bAcTFT91j7azn72liX8NSTwc2E_ozKnOGTfRCfw/edit?gid=1330361301#gid=1330361301 Spreadsheet]. The informal holdout count is 998. &lt;br /&gt;
&lt;br /&gt;
All machines have been simulated out to 1e13 steps. ~140 machines remain to be simulated to 1e14, and ~190 to 1e15. See [https://docs.google.com/spreadsheets/d/1mMp8bAcTFT91j7azn72liX8NSTwc2E_ozKnOGTfRCfw/edit?gid=806905077#gid=806905077 Spreadsheet]&lt;br /&gt;
&lt;br /&gt;
In contrast to BB(5), a substantial portion of BB(6) holdouts (and especially the last thousand holdouts) have seen greater degree of AI assistance,  autosolutions, and autoformalizations.&lt;br /&gt;
&lt;br /&gt;
== Cryptids ==&lt;br /&gt;
Several [[Turing machines]] have been found that are [[Cryptids]], considered so because each of them have a [[Collatz-like]] halting problem, a type of problem that is generally difficult to solve. However, probabilistic arguments have allowed all but one of them to be categorized as [[probviously]] halting or probviously non-halting.&lt;br /&gt;
&lt;br /&gt;
Probviously non-halting Cryptids:&lt;br /&gt;
&lt;br /&gt;
* {{TM|1RB1RA_0LC1LE_1LD1LC_1LA0LB_1LF1RE_---0RA}}, [[Antihydra]]&lt;br /&gt;
* {{TM|1RB1RC_1LC1LE_1RA1RD_0RF0RE_1LA0LB_---1RA|undecided}}, a variant of [[Hydra]] and Antihydra&lt;br /&gt;
* {{TM|1RB1LD_1RC1RE_0LA1LB_0LD1LC_1RF0RA_---0RC|undecided}}, similar to Antihydra&lt;br /&gt;
* {{TM|1RB0LD_1RC1RF_1LA0RA_0LA0LE_1LD1LA_0RB---|undecided}}, similar to Antihydra&lt;br /&gt;
* {{TM|1RB0LB_1LC0RE_1LA1LD_0LC---_0RB0RF_1RE1RB|undecided}}, similar to Antihydra&lt;br /&gt;
* {{TM|1RB1LA_1LC0RE_1LF1LD_0RB0LA_1RC1RE_---0LD|undecided}}, Space Needle&lt;br /&gt;
* {{TM|1RB0RB_1LC1RE_1LF0LD_1RA1LD_1RC1RB_---1LC|undecided}}, similar to Space Needle&lt;br /&gt;
* {{TM|1RB1LA_0LC0RC_1LE1RD_1RE1RC_1LF0LA_---1LE|undecided}}, similar to Space Needle&lt;br /&gt;
* {{TM|1RB0RF_1RC1RF_1LD0LE_---1LC_1RA1LE_1LC1RB|undecided}}, similar to Space Needle&lt;br /&gt;
&lt;br /&gt;
Probviously halting Cryptids:&lt;br /&gt;
&lt;br /&gt;
* {{TM|1RB0RD_0RC1RE_1RD0LA_1LE1LC_1RF0LD_---0RA}}, [[Lucy&#039;s Moonlight]]&lt;br /&gt;
* {{TM|1RB1RA_0RC1RC_1LD0LF_0LE1LE_1RA0LB_---0LC|undecided}}, a family of 16 related TMs&lt;br /&gt;
* {{TM|1RB1RE_1LC1LD_---1LA_1LB1LE_0RF0RA_1LD1RF}}&lt;br /&gt;
* {{TM|1RB0RE_1LC1LD_0RA0LD_1LB0LA_1RF1RA_---1LB}}&lt;br /&gt;
* {{TM|1RB0LC_0LC0RF_1RD1LC_0RA1LE_---0LD_1LF1LA}}&lt;br /&gt;
* {{TM|1RB0LC_1LC0RD_1LF1LA_1LB1RE_1RB1LE_---0LE}}&lt;br /&gt;
* {{TM|1RB---_0RC0RE_1RD1RF_1LE0LB_1RC0LD_1RC1RA}}&lt;br /&gt;
* {{TM|1RB0LD_1RC1RA_1LD0RB_1LE1LA_1RF0RC_---1RE}}&lt;br /&gt;
* {{TM|1RB1LD_1RC0LE_1LA1RE_0LF1LA_1RB0RB_---0LB}}&lt;br /&gt;
* {{TM|1RB0RE_1LC0RA_1LA1LD_1LC1LF_0LC0LB_1LE---}}&lt;br /&gt;
&lt;br /&gt;
Although {{TM|1RB1LE_0LC0LB_1RD1LC_1RD1RA_1RF0LA_---1RE}} behaves similarly to the probviously halting Cryptids, it is estimated to have a 3/5 chance of becoming a [[translated cycler]] and a 2/5 chance of halting.&lt;br /&gt;
&lt;br /&gt;
There are a few machines considered notable for their chaotic behaviour, but which have not been classified as Cryptids due to seemingly lacking a connection to any known open mathematical problems, such as Collatz-like problems.&lt;br /&gt;
&lt;br /&gt;
Potential Cryptids:&lt;br /&gt;
&lt;br /&gt;
* {{TM|1RB1RE_1LC0RA_0RD1LB_---1RC_1LF1RE_0LB0LE|undecided}}&lt;br /&gt;
* {{TM|1RB0LD_1LC0RA_1RA1LB_1LA1LE_1RF0LC_---0RE|undecided}}&lt;br /&gt;
* {{TM|1RB1RF_1LC1LF_0RE1LD_0LB1LD_---1RC_1RA0RD|undecided}}&lt;br /&gt;
* {{TM|1RB1LA_1RC0RF_1RD---_0LE1RB_---0LA_1LD1RF|undecided}}&lt;br /&gt;
* {{TM|1RB1RF_0LC0RF_1RD1LC_---0LE_0RC1LF_1RA0LE|undecided}}&lt;br /&gt;
* {{TM|1RB0LD_0RC1RB_0RD0RA_1LE0RD_1LF---_0LA1LA}} BMO8&lt;br /&gt;
* {{TM|1RB---_0RC0RD_1LD1RB_0LE0LC_1RA0LF_1LD1LE}} BMO8-like&lt;br /&gt;
&lt;br /&gt;
== Top Halters ==&lt;br /&gt;
Below is a table of the machines in TNF-1RB format with the 20 highest known runtimes.&amp;lt;ref&amp;gt;Shawn Ligocki&#039;s list of 6-state, 2-symbol machines with large runtimes ([https://github.com/sligocki/busy-beaver/blob/main/Machines/bb/6x2.txt Link])&amp;lt;/ref&amp;gt; Their runtimes are expressed using an [[Measuring large numbers#Knuth&#039;s up-arrow notation|extension]] of [[wikipedia:Knuth&#039;s_up-arrow_notation|Knuth&#039;s up-arrow notation]].&amp;lt;ref&amp;gt;Shawn Ligocki. 2022. [https://www.sligocki.com/2022/06/25/ext-up-notation.html &amp;quot;Extending Up-arrow Notation&amp;quot;]&amp;lt;/ref&amp;gt;&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+Top Known BB(6) Halters&lt;br /&gt;
!Standard format&lt;br /&gt;
!(approximate) runtime&lt;br /&gt;
!Discoverer&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA_1RC1RZ_1LD0RF_1RA0LE_0LD1RC_1RA0RE|halt}}&lt;br /&gt;
|10 ↑↑ 10 ↑↑ 10 ↑↑ 8.10237&lt;br /&gt;
|mxdys&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LC_1LA1RE_0RD0LA_1RZ1LB_1LD0RF_0RD1RB|halt}}&lt;br /&gt;
|10 ↑↑ 11010000&lt;br /&gt;
|mxdys&amp;lt;ref&amp;gt;https://discord.com/channels/960643023006490684/1384195691529633896/1384195691529633896&amp;lt;/ref&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LD_1RC0RF_1LC1LA_0LE1RZ_1LF0RB_0RC0RE|halt}}&lt;br /&gt;
|10 ↑↑ 15.60465&lt;br /&gt;
|Pavel Kropitz&amp;lt;ref&amp;gt;https://groups.google.com/g/busy-beaver-discuss/c/-zjeW6y8ER4/m/ZBuLvbVOAgAJ&amp;lt;/ref&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LF_1RC1RB_1LD0RA_1LB0LE_1RZ0LC_1LA1LF|halt}}&lt;br /&gt;
| rowspan=&amp;quot;3&amp;quot; |10 ↑↑ 7.52390&lt;br /&gt;
| rowspan=&amp;quot;3&amp;quot; |Katelyn Doucette&amp;lt;ref&amp;gt;{{DiscordArchive|1375512968569028648|1378916236104171562}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LF_1RC1RB_1LD0RA_1RF0LE_1RZ0LC_1LA1LF|halt}}&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LF_1RC1RB_1LD0RA_1LF0LE_1RZ0LC_1LA1LF|halt}}&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RC_1LC1RE_1LD0LB_1RE1LC_1LE0RF_1RZ1RA|halt}}&lt;br /&gt;
|10 ↑↑ 7.23637&lt;br /&gt;
|racheline&amp;lt;ref&amp;gt;https://discord.com/channels/960643023006490684/1239205785913790465/1310651468881334394&amp;lt;/ref&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA_1LC1LE_1RE0LD_1LC0LF_1RZ0RA_0RA0LB|halt}}&lt;br /&gt;
|10 ↑↑ 6.96745&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |poppuncher&amp;lt;ref&amp;gt;https://discord.com/channels/960643023006490684/1380384286942822561/1380384286942822561&amp;lt;/ref&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0RF_1LC0RA_1RZ0LD_1LE1LD_1RB1RC_0LD0RE|halt}}&lt;br /&gt;
|10 ↑↑ 5.77573&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LA_1LC1LF_0LD0LC_0LE0LB_1RE0RA_1RZ1LD|halt}}&lt;br /&gt;
|10 ↑↑ 5.63534&lt;br /&gt;
|Shawn Ligocki&amp;lt;ref name=&amp;quot;:0&amp;quot; /&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RE_1LC1LF_1RD0LB_1LE0RC_1RA0LD_1RZ1LC|halt}}&lt;br /&gt;
|10 ↑↑ 5.56344&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LE_0RC1RA_0LD1RF_1RE0RB_1LA0LC_0RD1RZ|halt}}&lt;br /&gt;
|10 ↑↑ 5.12467&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0RF_1LC1LB_0RE0LD_0LC0LB_0RA1RE_0RD1RZ|halt}}&lt;br /&gt;
|10 ↑↑ 5.03230&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LA_1LC0RF_1LD1LC_1LE0RE_0RB0LC_1RZ1RA|halt}}&lt;br /&gt;
|10 ↑↑ 4.91072&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LA_0RC1RD_1LC0LA_1LE0RB_0RD0RF_1RZ0RE|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; 10^{10^{11,347}}&amp;lt;/math&amp;gt; (score: 3)&lt;br /&gt;
|Pavel Kropitz&amp;lt;ref&amp;gt;https://discord.com/channels/960643023006490684/960643023530762341/1128747556583780362&amp;lt;/ref&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LE_1LC1RA_1RE0LD_1LC1LF_1LA0RC_1RZ1LC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; 10^{10^{140}}&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RF_1LC1RE_0LD1LB_1LA0RA_0RA0RB_1RZ0RD|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; 10^{10^{111}}&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LF_1LC0RA_1RD0LB_1LE1RC_1RZ1LA_1LA1LE|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; 10^{10^{34}}&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0RF_1LC1RB_0RD0LB_1RZ0LE_1RE0RA_1RD1RE|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; 10^{10^{28}}&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0RB_0RC0LF_0RD0RA_0LE1RZ_1LE0LA_1LF1RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; 10^{1\,400\,000\,000}&amp;lt;/math&amp;gt; (score: 13,964,326,472)&lt;br /&gt;
|Racheline&amp;lt;ref&amp;gt;https://discord.com/channels/960643023006490684/1345502880727040091/1345502880727040091&amp;lt;/ref&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
The scores are presumed to be on the order of &amp;lt;math&amp;gt;\sqrt{\text{runtime}}&amp;lt;/math&amp;gt; (unless explicitly noted) which is roughly indistinguishable in tetration notation.&lt;br /&gt;
&lt;br /&gt;
== Techniques ==&lt;br /&gt;
Simulating tetrational machines, such as the former champion {{TM|1RB0LD_1RC0RF_1LC1LA_0LE1RZ_1LF0RB_0RC0RE|halt}}, requires [[Accelerated simulator|accelerated simulation]] that can handle Collatz Level 2 [[Inductive rule|inductive rules]]. In other words, it requires a simulator that can prove the rules:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{lcl}&lt;br /&gt;
  C(4k)   &amp;amp; \to &amp;amp; {\operatorname{Halt}}\Big(\frac{3^{k+3} - 11}{2}\Big) \\&lt;br /&gt;
  C(4k+1) &amp;amp; \to &amp;amp; C\Big(\frac{3^{k+3} - 11}{2}\Big) \\&lt;br /&gt;
  C(4k+2) &amp;amp; \to &amp;amp; C\Big(\frac{3^{k+3} - 11}{2}\Big) \\&lt;br /&gt;
  C(4k+3) &amp;amp; \to &amp;amp; C\Big(\frac{3^{k+3} + 1}{2}\Big) \\&lt;br /&gt;
\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
and also compute the remainder mod 3 of numbers produced by applying these rules 15 times (which requires some fancy math related to [[wikipedia:Euler&#039;s_totient_function|Euler&#039;s totient function]]). &lt;br /&gt;
&lt;br /&gt;
We are also applying existing automatic deciders on current holdout lists with more extreme choices of parameters (more computational resources). [[User:XnoobSpeakable|XnoobSpeakable]] was able to solve 11 of the final 2728 holdouts using higher order parameters with the Ligockis&#039; Enumerate.py. An example command line entry is:&lt;br /&gt;
&amp;lt;syntaxhighlight lang=&amp;quot;bash&amp;quot;&amp;gt;&lt;br /&gt;
python3 Code/Enumerate.py --infile &amp;quot;bb6in/bb6tm{i}.txt&amp;quot; --outfile &amp;quot;bb6out/t{i}.pb&amp;quot; -r --no-steps --exp-linear-rules --max-loops=50_000_000 --block-mult=3 --max-block-size=100 --time=500 --force --save-freq=1&lt;br /&gt;
&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
XnoobSpeakable ran Enumerate.py on all TMs in the 2728 holdout list with the above max-loops and max-block-size parameters using &amp;lt;code&amp;gt;--block-mult=1&amp;lt;/code&amp;gt; ,&amp;lt;code&amp;gt;--block-mult=2&amp;lt;/code&amp;gt; , and &amp;lt;code&amp;gt;--block-mult=3&amp;lt;/code&amp;gt;. For context, during the Stage 2 BB(7) enumeration, where speed was more important due to the tens of millions of known holdouts, parameters of &amp;lt;code&amp;gt;--max-loops=100_000 --block-mult=2 --time=30 --save-freq=100&amp;lt;/code&amp;gt; were used.  &lt;br /&gt;
&lt;br /&gt;
@Iijil&#039;s [[MITMWFAR|MITMWFAR decider]] is likely too weak to be of any assistance: running the decider on 2650 BB(6) holdouts, using parameters not strong enough to solve BB(5) TMs, took prohibitively long to compute. Instead, [https://discord.com/channels/960643023006490684/1028746861395316776/1442964185599447152 a new FAR method] by mxdys was able to decide 113 of the 1534 holdouts ([https://github.com/ccz181078/TM/tree/FAR code] on GitHub) upon initial application.&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
&amp;lt;references /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:BB Domains]][[Category:BB(6)]]&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=BB(6)&amp;diff=9238</id>
		<title>BB(6)</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=BB(6)&amp;diff=9238"/>
		<updated>2026-10-17T14:17:29Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: archiving one discord message&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The 6-state, 2-symbol Busy Beaver problem, &#039;&#039;&#039;BB(6)&#039;&#039;&#039;, refers to the unsolved 6&amp;lt;sup&amp;gt;th&amp;lt;/sup&amp;gt; value of the [[Busy Beaver function]]. With the discovery of the [[Cryptid]] machine [[Antihydra]] in June 2024, we now know that we must solve a [[Collatz-like]] problem in order to solve BB(6) and thus [https://www.sligocki.com/2024/07/06/bb-6-2-is-hard.html BB(6) is Hard].&lt;br /&gt;
&lt;br /&gt;
The current BB(6) [[champion]] {{TM|1RB1RA_1RC1RZ_1LD0RF_1RA0LE_0LD1RC_1RA0RE|halt}} was discovered by mxdys in June 2025, proving the lower bound:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;S(6) &amp;gt; \Sigma(6) &amp;gt; 10 \uparrow\uparrow 10 \uparrow\uparrow 10 \uparrow\uparrow 8&amp;lt;/math&amp;gt;&lt;br /&gt;
== History ==&lt;br /&gt;
{| class=&amp;quot;wikitable mw-collapsible&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
! colspan=&amp;quot;6&amp;quot; |Timeline of bounds established for Σ(6) and S(6)&amp;lt;ref name=&amp;quot;:PMH&amp;quot;&amp;gt;Pascal Michel. (last updated 2026). The Busy Beaver Competition: a historical survey. https://bbchallenge.org/~pascal.michel/ha#tm62 &amp;lt;/ref&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
!Month of discovery&lt;br /&gt;
!Machine&lt;br /&gt;
!S(6)&lt;br /&gt;
!Σ(6)&lt;br /&gt;
!Discoverer&lt;br /&gt;
!Notes&lt;br /&gt;
|-&lt;br /&gt;
|November 1964&lt;br /&gt;
|{{TM|1LB1RZ_0LC1LC_0LD0LC_1LE1RA_0LF0LE_1RF1RD|halt}}&lt;br /&gt;
|≥ 436&lt;br /&gt;
|≥ 35&lt;br /&gt;
|Green, M.&lt;br /&gt;
|Part of an infinite family of machines now known as [[Green&#039;s machines]].&lt;br /&gt;
|-&lt;br /&gt;
|August 1972&lt;br /&gt;
|{{TM|1RB0LB_1LC1RZ_0LD0LC_1LE0RA_0LF0LE_1RF1RD|halt}}&lt;br /&gt;
|≥ 521&lt;br /&gt;
|≥ 42&lt;br /&gt;
|Lynn, D.&amp;lt;ref&amp;gt;https://docs.bbchallenge.org/papers/Lynn1972.pdf&amp;lt;/ref&amp;gt;&lt;br /&gt;
|Donald Lynn writes that this machine runs for 522 steps; this statement was either erroneous, or made with respect to another stopping convention.&lt;br /&gt;
|-&lt;br /&gt;
|November 1973&lt;br /&gt;
| style=&amp;quot;background: #CCFFFF;&amp;quot; |{{TM|1RB0LD_1RC0RB_1LA0RA_0LC0LE_1LC1RZ|halt}}&lt;br /&gt;
|≥ 992&lt;br /&gt;
| style=&amp;quot;background: #FFCCCC;&amp;quot; |≥ 23&lt;br /&gt;
|Weimann,&amp;amp;nbsp;B.&amp;lt;ref name=&amp;quot;:5&amp;quot;&amp;gt;https://docs.bbchallenge.org/other/lud20.pdf&amp;lt;/ref&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |1974&lt;br /&gt;
| style=&amp;quot;background: #CCFFFF;&amp;quot; |{{TM|0RB1RZ_1RC0LD_1RD0RE_1LB0LD_1RE1RA|halt}}&lt;br /&gt;
|≥ 7,707&lt;br /&gt;
| style=&amp;quot;background: #FFCCCC;&amp;quot; |≥ 88&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |Lynn, D.&amp;lt;ref&amp;gt;https://docs.bbchallenge.org/papers/Brady1983.pdf&amp;lt;/ref&amp;gt;&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |These bounds were published simultaneously in April 1983.&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;background: #CCFFFF;&amp;quot; |{{TM|1RB0LE_1RC0RA_1LD1RZ_1LE1LD_1LA0LC|halt}}&lt;br /&gt;
| style=&amp;quot;background: #FFCCCC;&amp;quot; |≥ 6,147&lt;br /&gt;
|≥ 112&lt;br /&gt;
|-&lt;br /&gt;
|August 1982&lt;br /&gt;
| style=&amp;quot;background: #CCFFFF;&amp;quot; |{{TM|1RB0LC_1RC1RD_1LA0RB_0RE1RZ_1LC1RA|halt}}&lt;br /&gt;
|≥ 134,467&lt;br /&gt;
|≥ 501&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |Schult, U.&amp;lt;ref name=&amp;quot;:5&amp;quot; /&amp;gt;&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |These bounds were published simultaneously in January 1983.&lt;br /&gt;
|-&lt;br /&gt;
|December 1982&lt;br /&gt;
|{{TM|1RB1RZ_1RC1RC_1RD1LF_1RE1RA_1RF0RD_1LB0LC|halt}}&lt;br /&gt;
|≥ 4,208,824&lt;br /&gt;
|≥ 2,075&lt;br /&gt;
|-&lt;br /&gt;
|August 1989&lt;br /&gt;
| style=&amp;quot;background: #CCFFFF;&amp;quot; |{{TM|1RB1RA_1LC1LB_1RA1LD_1RA1LE_1RZ0LC|halt}}&lt;br /&gt;
|≥ 11,798,826&lt;br /&gt;
|≥ 4,098&lt;br /&gt;
| rowspan=&amp;quot;3&amp;quot; |Marxen, H., Buntrock,&amp;amp;#x20;J.&amp;lt;ref name=&amp;quot;:02&amp;quot;&amp;gt;H. Marxen and J. Buntrock. Attacking the Busy Beaver 5. Bulletin of the EATCS, 40, pages 247-251, February 1990. https://turbotm.de/~heiner/BB/mabu90.html&amp;lt;/ref&amp;gt;&lt;br /&gt;
|Eventually proven to be a Σ(5) champion in 2024.&lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |September&amp;amp;#x20;1989&lt;br /&gt;
| style=&amp;quot;background: #CCFFFF;&amp;quot; |{{TM|1RB0LD_1LC1RD_1LA1LC_1RZ1RE_1RA0RB|halt}}&lt;br /&gt;
|≥ 23,554,764&lt;br /&gt;
| style=&amp;quot;background: #FFCCCC;&amp;quot; |≥ 4,097&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;background: #CCFFFF;&amp;quot; |{{TM|1RB1LC_1RC1RB_1RD0LE_1LA1LD_1RZ0LA|halt}}&lt;br /&gt;
|≥ 47,176,870&lt;br /&gt;
| style=&amp;quot;background: #FFCCCC;&amp;quot; |≥ 4,098&lt;br /&gt;
|Eventually proven to be the S(5) champion and a Σ(5) champion in 2024.&lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |January 1990&lt;br /&gt;
|{{TM|1RB1RA_1LC1LB_0LF1LD_1RA0LE_0RA1LC_1RE1RZ|halt}}&lt;br /&gt;
|≥ 13,122,572,797&lt;br /&gt;
|≥ 136,612&lt;br /&gt;
| rowspan=&amp;quot;6&amp;quot; |Marxen, H., Buntrock,&amp;amp;nbsp;J.&amp;lt;ref name=&amp;quot;:1&amp;quot;&amp;gt;https://turbotm.de/~heiner/BB/bb-list&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;https://turbotm.de/~heiner/BB/bb-6list&amp;lt;/ref&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA_1LC1LB_0RF1LD_1RA0LE_1LZ1LF_0LA0LC|halt}}&lt;br /&gt;
|≥&amp;amp;nbsp;8,690,333,381,690,951&lt;br /&gt;
|≥ 95,524,079&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|July 2000&lt;br /&gt;
|{{TM|1RB0RC_0LA0RD_1RD1RZ_1LE0LD_1RF1LB_1RA1RE|halt}}&lt;br /&gt;
|&amp;gt; 5.36 × 10&amp;lt;sup&amp;gt;42&amp;lt;/sup&amp;gt;&lt;br /&gt;
|&amp;gt; 2.53 × 10&amp;lt;sup&amp;gt;21&amp;lt;/sup&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |August 2000&lt;br /&gt;
|{{TM|1RB0LC_1LA1RC_1RA0LD_1LE1LC_1RF1RZ_1RA1RE|halt}}&lt;br /&gt;
|&amp;gt; 6.12 × 10&amp;lt;sup&amp;gt;119&amp;lt;/sup&amp;gt;&lt;br /&gt;
|&amp;gt; 1.42 × 10&amp;lt;sup&amp;gt;60&amp;lt;/sup&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LB_0RC1LB_1RD0LA_1LE1LF_1LA0LD_1RH1LE|halt}}&lt;br /&gt;
|&amp;gt; 6.19 × 10&amp;lt;sup&amp;gt;925&amp;lt;/sup&amp;gt;&lt;br /&gt;
|&amp;gt; 6.42 × 10&amp;lt;sup&amp;gt;462&amp;lt;/sup&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|February 2001&lt;br /&gt;
|{{TM|1RB0LF_0RC0RD_1LD1RE_0LE0LD_0RA1RC_1LA1RZ|halt}}&lt;br /&gt;
|&amp;gt; 3.00 × 10&amp;lt;sup&amp;gt;1,730&amp;lt;/sup&amp;gt;&lt;br /&gt;
|&amp;gt; 1.29 × 10&amp;lt;sup&amp;gt;865&amp;lt;/sup&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|November&amp;amp;nbsp;2007&lt;br /&gt;
|{{TM|1RB0RF_0LB1LC_1LD0RC_1LE1RZ_1LF0LD_1RA0LE|halt}}&lt;br /&gt;
|&amp;gt; 8.92 × 10&amp;lt;sup&amp;gt;1,762&amp;lt;/sup&amp;gt;&lt;br /&gt;
|&amp;gt; 2.50 × 10&amp;lt;sup&amp;gt;881&amp;lt;/sup&amp;gt;&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |Ligocki, T., Ligocki,&amp;amp;nbsp;S.&amp;lt;ref name=&amp;quot;:2&amp;quot;&amp;gt;https://web.archive.org/web/20160420171959/http://www.drb.insel.de/~heiner/BB/bbsimtab.html&amp;lt;/ref&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|December 2007&lt;br /&gt;
|{{TM|1RB0LE_1LC0RA_1LD0RC_1LE0LF_1LA1LC_1LE1RZ|halt}}&lt;br /&gt;
|&amp;gt; 2.58 × 10&amp;lt;sup&amp;gt;2,879&amp;lt;/sup&amp;gt;&lt;br /&gt;
|&amp;gt; 4.64 × 10&amp;lt;sup&amp;gt;1,439&amp;lt;/sup&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|May 2010&lt;br /&gt;
|{{TM|1RB0LD_1RC0RF_1LC1LA_0LE1RZ_1LA0RB_0RC0RE|halt}}&lt;br /&gt;
|&amp;gt; 3.80 × 10&amp;lt;sup&amp;gt;21,132&amp;lt;/sup&amp;gt;&lt;br /&gt;
|&amp;gt; 3.18 × 10&amp;lt;sup&amp;gt;10,566&amp;lt;/sup&amp;gt;&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |Kropitz, P.&amp;lt;ref name=&amp;quot;:2&amp;quot; /&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|June 2010&lt;br /&gt;
|{{TM|1RB1LE_1RC1RF_1LD0RB_1RE0LC_1LA0RD_1RZ1RC|halt}}&lt;br /&gt;
|&amp;gt; 7.41 × 10&amp;lt;sup&amp;gt;36,534&amp;lt;/sup&amp;gt;&lt;br /&gt;
|&amp;gt; 3.51 × 10&amp;lt;sup&amp;gt;18,267&amp;lt;/sup&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;5&amp;quot; |May 2022&lt;br /&gt;
|{{TM|1RB1RC_1LC0RF_1RA0LD_0LC0LE_1LD0RA_1RE1RZ|halt}}&lt;br /&gt;
|&amp;gt; 9.66 × 10&amp;lt;sup&amp;gt;78,913&amp;lt;/sup&amp;gt;&lt;br /&gt;
|&amp;gt; 6.02 × 10&amp;lt;sup&amp;gt;39,456&amp;lt;/sup&amp;gt;&lt;br /&gt;
|Ligocki, S.&amp;lt;ref name=&amp;quot;:0&amp;quot;&amp;gt;https://www.sligocki.com/2022/06/21/bb-6-2-t15.html&amp;lt;/ref&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ_1RC1RA_1RD0RB_1LE0RC_0LF0LD_0LB1LA|halt}}&lt;br /&gt;
|&amp;gt; 5.42 × 10&amp;lt;sup&amp;gt;197,282&amp;lt;/sup&amp;gt;&lt;br /&gt;
|&amp;gt; 2.01 × 10&amp;lt;sup&amp;gt;98,641&amp;lt;/sup&amp;gt;&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |Kropitz, P.&amp;lt;ref name=&amp;quot;:0&amp;quot; /&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ_0LC0LD_1LD1LC_1RE1LB_1RF1RD_0LD0RA|halt}}&lt;br /&gt;
|&amp;gt; 8.27 × 10&amp;lt;sup&amp;gt;1,292,913,985&amp;lt;/sup&amp;gt;&lt;br /&gt;
|&amp;gt;&amp;amp;nbsp;1.76&amp;amp;nbsp;×&amp;amp;nbsp;10&amp;lt;sup&amp;gt;646,456,993&amp;lt;/sup&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LA_1LC1LF_0LD0LC_0LE0LB_1RE0RA_1RZ1LD|halt}}&lt;br /&gt;
| colspan=&amp;quot;2&amp;quot; |&amp;gt; 10&amp;amp;uparrow;&amp;amp;uparrow;5.63&lt;br /&gt;
|Ligocki, S.&amp;lt;ref name=&amp;quot;:0&amp;quot; /&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LD_1RC0RF_1LC1LA_0LE1RZ_1LF0RB_0RC0RE|halt}}&lt;br /&gt;
| colspan=&amp;quot;2&amp;quot; |&amp;gt; 10&amp;amp;uparrow;&amp;amp;uparrow;15.60&lt;br /&gt;
|Kropitz, P.&amp;lt;ref name=&amp;quot;:0&amp;quot; /&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
| rowspan=&amp;quot;3&amp;quot; |June 2025&lt;br /&gt;
|{{TM|1RB1LC_1LA1RE_0RD0LA_1RZ1LB_1LD0RF_0RD1RB|halt}}&lt;br /&gt;
| colspan=&amp;quot;2&amp;quot; |&amp;gt; 10&amp;amp;uparrow;&amp;amp;uparrow;11,010,000&lt;br /&gt;
| rowspan=&amp;quot;3&amp;quot; |mxdys&amp;lt;ref&amp;gt;https://discord.com/channels/960643023006490684/1384195691529633896/1384195691529633896&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;https://discord.com/channels/960643023006490684/1384195691529633896/1384772277932920894&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;https://discord.com/channels/960643023006490684/1387426381041893417/1387426381041893417&amp;lt;/ref&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LE_1LC0RA_1RB1LD_1LC0LC_1RF0LB_1RZ1RE|halt}}&lt;br /&gt;
| style=&amp;quot;background: #FFCCCC;&amp;quot; | &amp;gt; 10&amp;amp;uparrow;&amp;amp;uparrow;11,010,000&lt;br /&gt;
|&amp;gt; 10&amp;amp;uparrow;&amp;amp;uparrow;11,010,000                                      &lt;br /&gt;
|This machine&#039;s score exceeds the previous bound for S(6) by 2.&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA_1RC1RZ_1LD0RF_1RA0LE_0LD1RC_1RA0RE|halt}}&lt;br /&gt;
| colspan=&amp;quot;2&amp;quot; |&amp;gt; 10↑↑10↑↑10↑↑8.10&lt;br /&gt;
|&lt;br /&gt;
|}&lt;br /&gt;
Bounds highlighted in &amp;lt;span style=&amp;quot;background: #FFCCCC&amp;quot;&amp;gt;red&amp;lt;/span&amp;gt; indicate those which did not improve upon the best known at the time. Machines highlighted in &amp;lt;span style=&amp;quot;background: #CCFFFF&amp;quot;&amp;gt;blue&amp;lt;/span&amp;gt; were inherited from the hunt for BB(5).[[File:BB(6) holdouts decrease over time.png|alt=BB(6) Holdouts count decrease overtime.|thumb|Number of BB(6) holdouts over time.]]&lt;br /&gt;
In June 2024, the machine {{TM|1RB1RA_0LC1LE_1LD1LC_1LA0LB_1LF1RE_---0RA}} (now known as [[Antihydra]]) was isolated from the BB(6) holdouts, and recognised as a [[Cryptids|Cryptid]], implying that determining the exact value of S(6) would be, in a certain mathematical sense, hard.&lt;br /&gt;
&lt;br /&gt;
@mxdys&#039;s [[Holdouts lists|holdouts list]] has 663 machines up to equivalence and 1417 machines not considering equivalence as of 16 October 2026. Partial Rocq proof is [https://github.com/ccz181078/busycoq/tree/BB6 available on Github].&lt;br /&gt;
&lt;br /&gt;
Often up-to-date annotated spreadsheet, with links to Discord discussions: [https://docs.google.com/spreadsheets/d/1mMp8bAcTFT91j7azn72liX8NSTwc2E_ozKnOGTfRCfw/edit?gid=1330361301#gid=1330361301 Spreadsheet]. The informal holdout count is 998. &lt;br /&gt;
&lt;br /&gt;
All machines have been simulated out to 1e13 steps. ~140 machines remain to be simulated to 1e14, and ~190 to 1e15. See [https://docs.google.com/spreadsheets/d/1mMp8bAcTFT91j7azn72liX8NSTwc2E_ozKnOGTfRCfw/edit?gid=806905077#gid=806905077 Spreadsheet]&lt;br /&gt;
&lt;br /&gt;
In contrast to BB(5), a substantial portion of BB(6) holdouts (and especially the last thousand holdouts) have seen greater degree of AI assistance,  autosolutions, and autoformalizations.&lt;br /&gt;
&lt;br /&gt;
== Cryptids ==&lt;br /&gt;
Several [[Turing machines]] have been found that are [[Cryptids]], considered so because each of them have a [[Collatz-like]] halting problem, a type of problem that is generally difficult to solve. However, probabilistic arguments have allowed all but one of them to be categorized as [[probviously]] halting or probviously non-halting.&lt;br /&gt;
&lt;br /&gt;
Probviously non-halting Cryptids:&lt;br /&gt;
&lt;br /&gt;
* {{TM|1RB1RA_0LC1LE_1LD1LC_1LA0LB_1LF1RE_---0RA}}, [[Antihydra]]&lt;br /&gt;
* {{TM|1RB1RC_1LC1LE_1RA1RD_0RF0RE_1LA0LB_---1RA|undecided}}, a variant of [[Hydra]] and Antihydra&lt;br /&gt;
* {{TM|1RB1LD_1RC1RE_0LA1LB_0LD1LC_1RF0RA_---0RC|undecided}}, similar to Antihydra&lt;br /&gt;
* {{TM|1RB0LD_1RC1RF_1LA0RA_0LA0LE_1LD1LA_0RB---|undecided}}, similar to Antihydra&lt;br /&gt;
* {{TM|1RB0LB_1LC0RE_1LA1LD_0LC---_0RB0RF_1RE1RB|undecided}}, similar to Antihydra&lt;br /&gt;
* {{TM|1RB1LA_1LC0RE_1LF1LD_0RB0LA_1RC1RE_---0LD|undecided}}, Space Needle&lt;br /&gt;
* {{TM|1RB0RB_1LC1RE_1LF0LD_1RA1LD_1RC1RB_---1LC|undecided}}, similar to Space Needle&lt;br /&gt;
* {{TM|1RB1LA_0LC0RC_1LE1RD_1RE1RC_1LF0LA_---1LE|undecided}}, similar to Space Needle&lt;br /&gt;
* {{TM|1RB0RF_1RC1RF_1LD0LE_---1LC_1RA1LE_1LC1RB|undecided}}, similar to Space Needle&lt;br /&gt;
&lt;br /&gt;
Probviously halting Cryptids:&lt;br /&gt;
&lt;br /&gt;
* {{TM|1RB0RD_0RC1RE_1RD0LA_1LE1LC_1RF0LD_---0RA}}, [[Lucy&#039;s Moonlight]]&lt;br /&gt;
* {{TM|1RB1RA_0RC1RC_1LD0LF_0LE1LE_1RA0LB_---0LC|undecided}}, a family of 16 related TMs&lt;br /&gt;
* {{TM|1RB1RE_1LC1LD_---1LA_1LB1LE_0RF0RA_1LD1RF}}&lt;br /&gt;
* {{TM|1RB0RE_1LC1LD_0RA0LD_1LB0LA_1RF1RA_---1LB}}&lt;br /&gt;
* {{TM|1RB0LC_0LC0RF_1RD1LC_0RA1LE_---0LD_1LF1LA}}&lt;br /&gt;
* {{TM|1RB0LC_1LC0RD_1LF1LA_1LB1RE_1RB1LE_---0LE}}&lt;br /&gt;
* {{TM|1RB---_0RC0RE_1RD1RF_1LE0LB_1RC0LD_1RC1RA}}&lt;br /&gt;
* {{TM|1RB0LD_1RC1RA_1LD0RB_1LE1LA_1RF0RC_---1RE}}&lt;br /&gt;
* {{TM|1RB1LD_1RC0LE_1LA1RE_0LF1LA_1RB0RB_---0LB}}&lt;br /&gt;
* {{TM|1RB0RE_1LC0RA_1LA1LD_1LC1LF_0LC0LB_1LE---}}&lt;br /&gt;
&lt;br /&gt;
Although {{TM|1RB1LE_0LC0LB_1RD1LC_1RD1RA_1RF0LA_---1RE}} behaves similarly to the probviously halting Cryptids, it is estimated to have a 3/5 chance of becoming a [[translated cycler]] and a 2/5 chance of halting.&lt;br /&gt;
&lt;br /&gt;
There are a few machines considered notable for their chaotic behaviour, but which have not been classified as Cryptids due to seemingly lacking a connection to any known open mathematical problems, such as Collatz-like problems.&lt;br /&gt;
&lt;br /&gt;
Potential Cryptids:&lt;br /&gt;
&lt;br /&gt;
* {{TM|1RB1RE_1LC0RA_0RD1LB_---1RC_1LF1RE_0LB0LE|undecided}}&lt;br /&gt;
* {{TM|1RB0LD_1LC0RA_1RA1LB_1LA1LE_1RF0LC_---0RE|undecided}}&lt;br /&gt;
* {{TM|1RB1RF_1LC1LF_0RE1LD_0LB1LD_---1RC_1RA0RD|undecided}}&lt;br /&gt;
* {{TM|1RB1LA_1RC0RF_1RD---_0LE1RB_---0LA_1LD1RF|undecided}}&lt;br /&gt;
* {{TM|1RB1RF_0LC0RF_1RD1LC_---0LE_0RC1LF_1RA0LE|undecided}}&lt;br /&gt;
* {{TM|1RB0LD_0RC1RB_0RD0RA_1LE0RD_1LF---_0LA1LA}} BMO8&lt;br /&gt;
* {{TM|1RB---_0RC0RD_1LD1RB_0LE0LC_1RA0LF_1LD1LE}} BMO8-like&lt;br /&gt;
&lt;br /&gt;
== Top Halters ==&lt;br /&gt;
Below is a table of the machines in TNF-1RB format with the 20 highest known runtimes.&amp;lt;ref&amp;gt;Shawn Ligocki&#039;s list of 6-state, 2-symbol machines with large runtimes ([https://github.com/sligocki/busy-beaver/blob/main/Machines/bb/6x2.txt Link])&amp;lt;/ref&amp;gt; Their runtimes are expressed using an [[Measuring large numbers#Knuth&#039;s up-arrow notation|extension]] of [[wikipedia:Knuth&#039;s_up-arrow_notation|Knuth&#039;s up-arrow notation]].&amp;lt;ref&amp;gt;Shawn Ligocki. 2022. [https://www.sligocki.com/2022/06/25/ext-up-notation.html &amp;quot;Extending Up-arrow Notation&amp;quot;]&amp;lt;/ref&amp;gt;&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+Top Known BB(6) Halters&lt;br /&gt;
!Standard format&lt;br /&gt;
!(approximate) runtime&lt;br /&gt;
!Discoverer&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA_1RC1RZ_1LD0RF_1RA0LE_0LD1RC_1RA0RE|halt}}&lt;br /&gt;
|10 ↑↑ 10 ↑↑ 10 ↑↑ 8.10237&lt;br /&gt;
|mxdys&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LC_1LA1RE_0RD0LA_1RZ1LB_1LD0RF_0RD1RB|halt}}&lt;br /&gt;
|10 ↑↑ 11010000&lt;br /&gt;
|mxdys&amp;lt;ref&amp;gt;https://discord.com/channels/960643023006490684/1384195691529633896/1384195691529633896&amp;lt;/ref&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LD_1RC0RF_1LC1LA_0LE1RZ_1LF0RB_0RC0RE|halt}}&lt;br /&gt;
|10 ↑↑ 15.60465&lt;br /&gt;
|Pavel Kropitz&amp;lt;ref&amp;gt;https://groups.google.com/g/busy-beaver-discuss/c/-zjeW6y8ER4/m/ZBuLvbVOAgAJ&amp;lt;/ref&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LF_1RC1RB_1LD0RA_1LB0LE_1RZ0LC_1LA1LF|halt}}&lt;br /&gt;
| rowspan=&amp;quot;3&amp;quot; |10 ↑↑ 7.52390&lt;br /&gt;
| rowspan=&amp;quot;3&amp;quot; |Katelyn Doucette&amp;lt;ref&amp;gt;{{DiscordArchive}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LF_1RC1RB_1LD0RA_1RF0LE_1RZ0LC_1LA1LF|halt}}&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LF_1RC1RB_1LD0RA_1LF0LE_1RZ0LC_1LA1LF|halt}}&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RC_1LC1RE_1LD0LB_1RE1LC_1LE0RF_1RZ1RA|halt}}&lt;br /&gt;
|10 ↑↑ 7.23637&lt;br /&gt;
|racheline&amp;lt;ref&amp;gt;https://discord.com/channels/960643023006490684/1239205785913790465/1310651468881334394&amp;lt;/ref&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA_1LC1LE_1RE0LD_1LC0LF_1RZ0RA_0RA0LB|halt}}&lt;br /&gt;
|10 ↑↑ 6.96745&lt;br /&gt;
| rowspan=&amp;quot;2&amp;quot; |poppuncher&amp;lt;ref&amp;gt;https://discord.com/channels/960643023006490684/1380384286942822561/1380384286942822561&amp;lt;/ref&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0RF_1LC0RA_1RZ0LD_1LE1LD_1RB1RC_0LD0RE|halt}}&lt;br /&gt;
|10 ↑↑ 5.77573&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LA_1LC1LF_0LD0LC_0LE0LB_1RE0RA_1RZ1LD|halt}}&lt;br /&gt;
|10 ↑↑ 5.63534&lt;br /&gt;
|Shawn Ligocki&amp;lt;ref name=&amp;quot;:0&amp;quot; /&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RE_1LC1LF_1RD0LB_1LE0RC_1RA0LD_1RZ1LC|halt}}&lt;br /&gt;
|10 ↑↑ 5.56344&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LE_0RC1RA_0LD1RF_1RE0RB_1LA0LC_0RD1RZ|halt}}&lt;br /&gt;
|10 ↑↑ 5.12467&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0RF_1LC1LB_0RE0LD_0LC0LB_0RA1RE_0RD1RZ|halt}}&lt;br /&gt;
|10 ↑↑ 5.03230&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LA_1LC0RF_1LD1LC_1LE0RE_0RB0LC_1RZ1RA|halt}}&lt;br /&gt;
|10 ↑↑ 4.91072&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LA_0RC1RD_1LC0LA_1LE0RB_0RD0RF_1RZ0RE|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; 10^{10^{11,347}}&amp;lt;/math&amp;gt; (score: 3)&lt;br /&gt;
|Pavel Kropitz&amp;lt;ref&amp;gt;https://discord.com/channels/960643023006490684/960643023530762341/1128747556583780362&amp;lt;/ref&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LE_1LC1RA_1RE0LD_1LC1LF_1LA0RC_1RZ1LC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; 10^{10^{140}}&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RF_1LC1RE_0LD1LB_1LA0RA_0RA0RB_1RZ0RD|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; 10^{10^{111}}&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LF_1LC0RA_1RD0LB_1LE1RC_1RZ1LA_1LA1LE|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; 10^{10^{34}}&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0RF_1LC1RB_0RD0LB_1RZ0LE_1RE0RA_1RD1RE|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; 10^{10^{28}}&amp;lt;/math&amp;gt;&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0RB_0RC0LF_0RD0RA_0LE1RZ_1LE0LA_1LF1RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;&amp;gt; 10^{1\,400\,000\,000}&amp;lt;/math&amp;gt; (score: 13,964,326,472)&lt;br /&gt;
|Racheline&amp;lt;ref&amp;gt;https://discord.com/channels/960643023006490684/1345502880727040091/1345502880727040091&amp;lt;/ref&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
The scores are presumed to be on the order of &amp;lt;math&amp;gt;\sqrt{\text{runtime}}&amp;lt;/math&amp;gt; (unless explicitly noted) which is roughly indistinguishable in tetration notation.&lt;br /&gt;
&lt;br /&gt;
== Techniques ==&lt;br /&gt;
Simulating tetrational machines, such as the former champion {{TM|1RB0LD_1RC0RF_1LC1LA_0LE1RZ_1LF0RB_0RC0RE|halt}}, requires [[Accelerated simulator|accelerated simulation]] that can handle Collatz Level 2 [[Inductive rule|inductive rules]]. In other words, it requires a simulator that can prove the rules:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{lcl}&lt;br /&gt;
  C(4k)   &amp;amp; \to &amp;amp; {\operatorname{Halt}}\Big(\frac{3^{k+3} - 11}{2}\Big) \\&lt;br /&gt;
  C(4k+1) &amp;amp; \to &amp;amp; C\Big(\frac{3^{k+3} - 11}{2}\Big) \\&lt;br /&gt;
  C(4k+2) &amp;amp; \to &amp;amp; C\Big(\frac{3^{k+3} - 11}{2}\Big) \\&lt;br /&gt;
  C(4k+3) &amp;amp; \to &amp;amp; C\Big(\frac{3^{k+3} + 1}{2}\Big) \\&lt;br /&gt;
\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
and also compute the remainder mod 3 of numbers produced by applying these rules 15 times (which requires some fancy math related to [[wikipedia:Euler&#039;s_totient_function|Euler&#039;s totient function]]). &lt;br /&gt;
&lt;br /&gt;
We are also applying existing automatic deciders on current holdout lists with more extreme choices of parameters (more computational resources). [[User:XnoobSpeakable|XnoobSpeakable]] was able to solve 11 of the final 2728 holdouts using higher order parameters with the Ligockis&#039; Enumerate.py. An example command line entry is:&lt;br /&gt;
&amp;lt;syntaxhighlight lang=&amp;quot;bash&amp;quot;&amp;gt;&lt;br /&gt;
python3 Code/Enumerate.py --infile &amp;quot;bb6in/bb6tm{i}.txt&amp;quot; --outfile &amp;quot;bb6out/t{i}.pb&amp;quot; -r --no-steps --exp-linear-rules --max-loops=50_000_000 --block-mult=3 --max-block-size=100 --time=500 --force --save-freq=1&lt;br /&gt;
&amp;lt;/syntaxhighlight&amp;gt;&lt;br /&gt;
XnoobSpeakable ran Enumerate.py on all TMs in the 2728 holdout list with the above max-loops and max-block-size parameters using &amp;lt;code&amp;gt;--block-mult=1&amp;lt;/code&amp;gt; ,&amp;lt;code&amp;gt;--block-mult=2&amp;lt;/code&amp;gt; , and &amp;lt;code&amp;gt;--block-mult=3&amp;lt;/code&amp;gt;. For context, during the Stage 2 BB(7) enumeration, where speed was more important due to the tens of millions of known holdouts, parameters of &amp;lt;code&amp;gt;--max-loops=100_000 --block-mult=2 --time=30 --save-freq=100&amp;lt;/code&amp;gt; were used.  &lt;br /&gt;
&lt;br /&gt;
@Iijil&#039;s [[MITMWFAR|MITMWFAR decider]] is likely too weak to be of any assistance: running the decider on 2650 BB(6) holdouts, using parameters not strong enough to solve BB(5) TMs, took prohibitively long to compute. Instead, [https://discord.com/channels/960643023006490684/1028746861395316776/1442964185599447152 a new FAR method] by mxdys was able to decide 113 of the 1534 holdouts ([https://github.com/ccz181078/TM/tree/FAR code] on GitHub) upon initial application.&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
&amp;lt;references /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:BB Domains]][[Category:BB(6)]]&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=1RB0LF_1RC1RB_1LD0RA_1LB0LE_1RZ0LC_1LA1LF&amp;diff=9237</id>
		<title>1RB0LF 1RC1RB 1LD0RA 1LB0LE 1RZ0LC 1LA1LF</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=1RB0LF_1RC1RB_1LD0RA_1LB0LE_1RZ0LC_1LA1LF&amp;diff=9237"/>
		<updated>2026-10-17T14:15:31Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: discord archival&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Machine|1RB0LF_1RC1RB_1LD0RA_1LB0LE_1RZ0LC_1LA1LF}}&lt;br /&gt;
{{TM|1RB0LF_1RC1RB_1LD0RA_1LB0LE_1RZ0LC_1LA1LF|halt}} is a long running halting [[BB(6)]] TM first analyzed by Katelyn Doucette on 1 Jun 2025 ({{DiscordArchive|1375512968569028648|1378916236104171562}}). It is a [[shift overflow counter]] that halts with a final sigma score of roughly &amp;lt;math&amp;gt;10 \uparrow \uparrow 7.52390&amp;lt;/math&amp;gt;. It is currently the 4th longest known running halting [[BB(6)]] TM.&lt;br /&gt;
&lt;br /&gt;
== Analysis by Katelyn Doucette==&lt;br /&gt;
(These rules were automatically generated by https://github.com/Laturas/shift_overflow_subset_decider)&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
START = A(5, 2^2 - 1, 0) at step 57&lt;br /&gt;
A(3k, 2^n - 1, 0) -&amp;gt; HALT&lt;br /&gt;
A(3k + 1, 2^n - 1, 0) -&amp;gt; A(5, 2^2 - 1, n + 2k + 0)&lt;br /&gt;
A(3k + 2, 2^n - 1, 0) -&amp;gt; A(5, 2^2 - 1, n + 2k + 1)&lt;br /&gt;
A(a, 2^n - 1, c) -&amp;gt; A(a + 2^n (4(4^c - 1)/3) - 3c, 2^{n+2c} - 1, 0)&lt;br /&gt;
&lt;br /&gt;
---------- RULE EVALUATION ----------&lt;br /&gt;
START = A(5, 2^2 - 1, 0)&lt;br /&gt;
A(5, 2^2 - 1, 0) -&amp;gt; A(5, 2^2 - 1, 5) -&amp;gt; A(5446, 2^12 - 1, 0)    (mod 6377292)&lt;br /&gt;
A(5446, 2^12 - 1, 0) -&amp;gt; A(5, 2^2 - 1, 3642) -&amp;gt; A(195563, 2^7286 - 1, 0)    (mod 708588)&lt;br /&gt;
A(195563, 2^7286 - 1, 0) -&amp;gt; A(5, 2^2 - 1, 137661) -&amp;gt; A(72002, 2^39128 - 1, 0)    (mod 78732)&lt;br /&gt;
A(72002, 2^39128 - 1, 0) -&amp;gt; A(5, 2^2 - 1, 8397) -&amp;gt; A(7430, 2^8048 - 1, 0)    (mod 8748)&lt;br /&gt;
A(7430, 2^8048 - 1, 0) -&amp;gt; A(5, 2^2 - 1, 1337) -&amp;gt; A(838, 2^732 - 1, 0)    (mod 972)&lt;br /&gt;
A(838, 2^732 - 1, 0) -&amp;gt; A(5, 2^2 - 1, 318) -&amp;gt; A(107, 2^98 - 1, 0)    (mod 108)&lt;br /&gt;
A(107, 2^98 - 1, 0) -&amp;gt; A(5, 2^2 - 1, 25) -&amp;gt; A(6, 2^4 - 1, 0)    (mod 12)&lt;br /&gt;
 -&amp;gt; HALT&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Analysis by [[User:Sligocki|Shawn Ligocki]] ==&lt;br /&gt;
{{DiscordArchive|1375512968569028648/1378925307544997898}}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
1RB0LF_1RC1RB_1LD0RA_1LB0LE_---0LC_1LA1LF&lt;br /&gt;
   0 (5, 2, 5, 2, 0, 1)&lt;br /&gt;
   1 (((-46 + 2^14)/3), 12, 5, 2, 0, 1)&lt;br /&gt;
   2 (((-11 + 2^((56 + 2^16)/9) + -1 * 2^15)/3), ((38 + 2^16)/9), 5, 2, 0, 1)&lt;br /&gt;
   3 (((-14 + 2^((62 + 2^((74 + 2^16)/9))/9) + -1 * 2^((65 + 2^16)/9))/3), ((44 + 2^((74 + 2^16)/9))/9), 5, 2, 0, 1)&lt;br /&gt;
   4 (((-14 + 2^((62 + 2^((80 + 2^((74 + 2^16)/9))/9))/9) + -1 * 2^((71 + 2^((74 + 2^16)/9))/9))/3), ((44 + 2^((80 + 2^((74 + 2^16)/9))/9))/9), 5, 2, 0, 1)&lt;br /&gt;
   5 (((-14 + 2^((62 + 2^((80 + 2^((80 + 2^((74 + 2^16)/9))/9))/9))/9) + -1 * 2^((71 + 2^((80 + 2^((74 + 2^16)/9))/9))/9))/3), ((44 + 2^((80 + 2^((80 + 2^((74 + 2^16)/9))/9))/9))/9), 5, 2, 0, 1)&lt;br /&gt;
   6 (((-11 + 2^((56 + 2^((80 + 2^((80 + 2^((80 + 2^((74 + 2^16)/9))/9))/9))/9))/9) + -1 * 2^((71 + 2^((80 + 2^((80 + 2^((74 + 2^16)/9))/9))/9))/9))/3), ((38 + 2^((80 + 2^((80 + 2^((80 + 2^((74 + 2^16)/9))/9))/9))/9))/9), 5, 2, 0, 1)&lt;br /&gt;
   7 (((-14 + 2^((62 + 2^((74 + 2^((80 + 2^((80 + 2^((80 + 2^((74 + 2^16)/9))/9))/9))/9))/9))/9) + -1 * 2^((65 + 2^((80 + 2^((80 + 2^((80 + 2^((74 + 2^16)/9))/9))/9))/9))/9))/3), ((44 + 2^((74 + 2^((80 + 2^((80 + 2^((80 + 2^((74 + 2^16)/9))/9))/9))/9))/9))/9), 5, 2, 0, 1)&lt;br /&gt;
Halted with score: ~10↑↑7.52390  =  ((34 + 2^((71 + 2^((74 + 2^((80 + 2^((80 + 2^((80 + 2^((74 + 2^16)/9))/9))/9))/9))/9))/9))/9)&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Equivalent TMs ==&lt;br /&gt;
The following TMs have near identical behavior, producing the same values but do so slightly more efficiently:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
1RB0LF_1RC1RB_1LD0RA_1LF0LE_---0LC_1LA1LF&lt;br /&gt;
1RB0LF_1RC1RB_1LD0RA_1RF0LE_---0LC_1LA1LF&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Related TMs ==&lt;br /&gt;
This TM is part of a broader family of 15 turing machines with similar rules. The family is made up of the following:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
1RB1RA_1LC0RF_---0LD_0LE0LB_1LF1LE_1RA0LE&lt;br /&gt;
1RB0RE_1LC0RF_1LD1LC_1RA0LB_---0RD_1RB1RF&lt;br /&gt;
1RB0LF_1RC1RB_1LD0RA_0RF0LE_---0LC_1LA1LF&lt;br /&gt;
1RB0LF_1RC1RB_1LD0RA_0RA0LE_---0LC_1LA1LF&lt;br /&gt;
1RB0LF_1LC1LB_1RD0LB_1RE1RD_1LA0RC_---0LE&lt;br /&gt;
1RB0LF_1RC1RB_1LD0RA_1RA0LE_---0LC_1LA1LF&lt;br /&gt;
1RB0LE_1LC0RD_1LA1LC_---0RA_1LC0RF_1RE1RF&lt;br /&gt;
1RB0LF_1RC1RB_1LD0RA_1LA0LE_---0LC_1LA1LF&lt;br /&gt;
1RB0LD_1RC0RF_1RD1RC_1LE0RC_1LA1LE_---0RA&lt;br /&gt;
1RB0LF_1RC1RB_1LD0RA_1RF0LE_---0LC_1LA1LF&lt;br /&gt;
1RB0LD_1RC0RF_1LA1LC_1LC0RE_1RD1RE_---0RA&lt;br /&gt;
1RB1RA_1LC0RA_1LD1LC_1RE0LB_0LA0RF_---0RD&lt;br /&gt;
1RB0LC_0LC0RF_1LE0RD_1RC1RD_1LA1LE_---0RA&lt;br /&gt;
1RB0LF_1RC1RB_1LD0RA_1LB0LE_---0LC_1LA1LF&lt;br /&gt;
1RB0LF_1RC1RB_1LD0RA_1LF0LE_---0LC_1LA1LF&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
All of these turing machines have been shown to halt. Interestingly, &amp;lt;code&amp;gt;1RB1RA_1LC0RF_---0LD_0LE0LB_1LF1LE_1RA0LE&amp;lt;/code&amp;gt; is the only one to halt when the unary counter is equal to 1 mod 3 or 2 mod 3 instead of 0 mod 3.&lt;br /&gt;
&lt;br /&gt;
All of these machines are fundamentally characterized by the rule &amp;lt;code&amp;gt;A(a, 2^n - 1, c) -&amp;gt; A(a + 2^n (4(4^c - 1)/3) - 3c, 2^{n+2c} - 1, 0)&amp;lt;/code&amp;gt; and only differ in starting conditions and reset behavior.&lt;br /&gt;
&lt;br /&gt;
{{TM|1RB1LE_1RC1RC_1LD0LF_1LE1LD_1RF0LC_1RZ0RA}} exhibits similar behavior but never halts. See proof at: ({{DiscordArchive|1375512968569028648|1378916236104171562}}).&lt;br /&gt;
&lt;br /&gt;
[[Category:BB(6)]]&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=1RB---_0RC0RE_1RD1RF_1LE0LB_1RC0LD_1RC1RA&amp;diff=9233</id>
		<title>1RB--- 0RC0RE 1RD1RF 1LE0LB 1RC0LD 1RC1RA</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=1RB---_0RC0RE_1RD1RF_1LE0LB_1RC0LD_1RC1RA&amp;diff=9233"/>
		<updated>2026-10-17T12:45:51Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: discord message archive&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{machine|1RB---_0RC0RE_1RD1RF_1LE0LB_1RC0LD_1RC1RA}}{{unsolved|Does this TM halt? If so, how many steps does it take to halt?}}&lt;br /&gt;
{{TM|1RB---_0RC0RE_1RD1RF_1LE0LB_1RC0LD_1RC1RA}} is a [[probviously]] halting [[BB(6)]] [[Cryptid]] found by Racheline on 23 November 2024.&lt;br /&gt;
&lt;br /&gt;
When the TM starts on any starting state, it exhibits the same probviously halting behaviour:&lt;br /&gt;
&lt;br /&gt;
* When the starting state is A, the [[Tree Normal Form|TNF]] is {{TM|1RB---_0RC0RE_1RD1RF_1LE0LB_1RC0LD_1RC1RA}}.&lt;br /&gt;
* When the starting state is B, the TNF is not in TNF-1RB format, and can be (mostly) ignored.&lt;br /&gt;
* When the starting state is C, the TNF is {{TM|1RB1RD_1LC0LE_1RA0LB_1RA1RF_0RA0RC_1RE---}}.&lt;br /&gt;
* When the starting state is D, the TNF is {{TM|1RB0RE_1LC0RA_1LA1LD_1LC1LF_0LC0LB_1LE---}}.&lt;br /&gt;
* When the starting state is E, the TNF is {{TM|1RB0LC_1RC1RE_1LA0LD_0RB0RA_1RB1RF_1RD---}}.&lt;br /&gt;
* When the starting state is F, the TNF is {{TM|1RB1RF_1RC1RA_1LD0LE_1RB0LC_0RB0RD_1RE---}}. However, both E and F use &amp;lt;code&amp;gt;1RC&amp;lt;/code&amp;gt; as the first transition, so they have the same trajectory.&lt;br /&gt;
&lt;br /&gt;
There are 4 trajectories to analyze (A, C, D, and E).&lt;br /&gt;
&lt;br /&gt;
== Analysis by Racheline ==&lt;br /&gt;
&lt;br /&gt;
On 23 November 2024, Racheline posted an analysis ({{DiscordArchive|1239205785913790465|1309900024930635786 }}) of this TM. The TM has an interesting halting mechanism.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
`1RB---_0RC0RE_1RD1RF_1LE0LB_1RC0LD_1RC1RA` is a probviously halting cryptid. just an exponential one, specifically at each step it simply multiplies the main number by 8/3 and then changes a few things depending on what it was mod 3. the left side can change in a few ways to store information between these steps. if you start from the empty left side, there are some sequences of numbers you can get mod 3 which make the TM halt, and if the main number mod 3 was random, then the probability of this eventually happening would be 1 regardless of how long those sequences are. this is all standard stuff.&lt;br /&gt;
&lt;br /&gt;
however&lt;br /&gt;
i&#039;m pretty sure the shortest such sequence has length around 100. i think it&#039;s a fun puzzle to try to find one yourself. the shortest one i found on my own has length 110, though it&#039;s actually a group of 2^13\*3^15 = 117546246144 such sequences because some parts can be permuted with certain restrictions. specifically, each (n,m) in the following sequence of pairs can be replaced with any sequence of n 2&#039;s and m 0&#039;s whose first k elements contain at least k/3 2&#039;s for every k&amp;lt;=n+m:&lt;br /&gt;
||(1,0), (2,1), (1,0), (2,3), (1,0), (2,4), (1,0), (2,3), (1,0), (3,5), (1,0), (3,4), (1,0), (3,3), (1,0), (2,4), (1,0), (2,3), (1,0), (3,4), (1,0), (3,6), (1,0), (2,3), (1,0), (3,4), (1,0), (3,6), (1,0)|| (spoilered because i think it&#039;s a relatively fun puzzle to try to figure out on your own)&lt;br /&gt;
for any given point at which the left side is empty, the probability that it will follow one of these sequences from that point is just above 1/3^87&lt;br /&gt;
i also ran a search on all sequences of only 0&#039;s and 2&#039;s (1&#039;s seem to always reset most of the progress you made in getting to a halting config so i ignored those) up to that length, and the shortest it found was length 107, so the only way it&#039;s less than that would be if either my code is wrong or somehow 1&#039;s manage to be useful for something other than resetting.&lt;br /&gt;
&lt;br /&gt;
so i think it&#039;s pretty reasonable to guess that from a given position with empty left side, the probability that the TM will halt before resetting the left side is around 1/3^80. the rest of the computation is the same as always: the expected number of times we generate a new random number mod 3 should be around 3^80, and since that happens only when the main number is roughly multiplied by 8/3, the number of 1s when halting should be around (8/3)^3^80 ≈ 10^10^37.8, and the halting time should be around (that)^2, i.e. around 10^10^38.1&lt;br /&gt;
i know, not that impressive compared to the current champion, but i&#039;m posting it because i like the mechanism. also i guess it would still be in 11th place if this approximation is correct, though the current 11th place TM takes around 10^10^35.3 steps to halt so it&#039;s kinda close.&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Analysis by @-d ==&lt;br /&gt;
&lt;br /&gt;
@-d has provided an analysis of a similar TM {{TM|1RB0RE_1LC0RA_1LA1LD_1LC1LF_0LC0LB_1LE---}} (i.e. start state D). @-d believes that this TM is probviously halting because it chooses 3 rules seemingly at random, and there is a path of 108 rules that causes the TM to halt.&lt;br /&gt;
&lt;br /&gt;
Message sent on Aug 13 2025: [https://discord.com/channels/960643023006490684/1400456788955893840/1405116468168888423]&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
1RB0RE_1LC0RA_1LA1LD_1LC1LF_0LC0LB_1LE---&lt;br /&gt;
&lt;br /&gt;
A(n,r) = 0^inf &amp;lt;F 1^n r 0^inf&lt;br /&gt;
 n &amp;gt;= 2 (n &amp;lt;= 1 causes the tm to have setup issues)&lt;br /&gt;
 r is &amp;quot;&amp;quot; or starts with 0&lt;br /&gt;
&lt;br /&gt;
start at A(9,&amp;quot;&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
start from A(n,r) and simulate until the head reaches r. the config depends on n%3:&lt;br /&gt;
 for n%3==2, 0^inf 11 (01)^? B&amp;gt; r 0^inf&lt;br /&gt;
 for n%3==0, 0^inf 11 (01)^? 0 A&amp;gt; r 0^inf&lt;br /&gt;
 for n%3==1, 0^inf 11 (01)^? 00 E&amp;gt; r 0^inf&lt;br /&gt;
 in all 3 cases, the machine will reach a new config A(n&#039;,r&#039;)&lt;br /&gt;
 call these 3 changes B, A, E&lt;br /&gt;
&lt;br /&gt;
B makes r shorter&lt;br /&gt;
A is harder to analyze. A usually makes r shorter, but sometimes makes r longer.&lt;br /&gt;
A can halt on certain values of r. for example, A(3,&amp;quot;011011011&amp;quot;) halts.&lt;br /&gt;
E usually makes r longer&lt;br /&gt;
E can halt on certain values of r. for example, A(4,&amp;quot;011011&amp;quot;) and A(4,&amp;quot;01011011&amp;quot;) halt.&lt;br /&gt;
&lt;br /&gt;
A(n,r) --&amp;gt; A(n&#039;,r&#039;) always happens, regardless of n%3. given r, the next possible r&#039; can be found by simulating A(3k,r), A(3k+1,r), A(3k+2,r) and recording r&#039;. do a bfs starting at r=&amp;quot;&amp;quot;. the bfs visited ~235000 different values of r. the shortest path to halt has length 108:&lt;br /&gt;
EEBBEBEEBEEEBBEBBEEBBEBEEBBEBBEEEBBEBBEBBEEBBEEEBBEBEEEBBEBBEEBBEBEEBBEBBEEEBBEBBEBBEEBBEBEEBBEBBEEEBBEBBEBE&lt;br /&gt;
(somehow, A was useless in the bfs. i&#039;m not sure why.)&lt;br /&gt;
&lt;br /&gt;
these configs will reach halt:&lt;br /&gt;
A(3^108 * k + 1975700577069254261393123959451562008800234946348086, &amp;quot;&amp;quot;)&lt;br /&gt;
(i didn&#039;t formally prove this. it is likely to be true.)&lt;br /&gt;
&lt;br /&gt;
open question: starting from A(9,&amp;quot;&amp;quot;), will the config eventually become A(3^108 * k + 1975700577069254261393123959451562008800234946348086, &amp;quot;&amp;quot;)?&lt;br /&gt;
&lt;br /&gt;
there are 3 likely outcomes for my open question:&lt;br /&gt;
1. the config is impossible to reach.&lt;br /&gt;
2. the config is possible to reach, but the tm needs ~3^108 attempts to reach it. each attempt looks like A(n,r) --&amp;gt; A(~ 8n/3,r&#039;). the config before halting will be A(~(8/3)^(3^108),?) = A(~10^10^51,?).&lt;br /&gt;
3. the tm halts, but in another way. i.e. the length 108 path is unused.&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Message sent on Aug 25 2025: [https://discord.com/channels/960643023006490684/1400456788955893840/1409086365244854377]&lt;br /&gt;
&lt;br /&gt;
@-d has a formal proof that &amp;lt;math&amp;gt;A(3^{108} * k + 1975700577069254261393123959451562008800234946348086)&amp;lt;/math&amp;gt; will halt, for all &amp;lt;math&amp;gt;k \ge 0&amp;lt;/math&amp;gt;. It is in [https://github.com/int-y1/proofs/blob/1929f57df4dd7afcc11c3f458e20526fd1f991e0/BusyLean/Individual/1RB0RE_1LC0RA_1LA1LD_1LC1LF_0LC0LB_1LE---.lean#L321-L322].&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
1RB0RE_1LC0RA_1LA1LD_1LC1LF_0LC0LB_1LE--- (update 2)&lt;br /&gt;
&lt;br /&gt;
from my previous post, i gave a path of length 108 that causes the tm to halt. there might be 1057916215296 paths of length 108 that cause the tm to halt. the chance of using a length-108 path to halt is around 1057916215296/3^108 (about 10^-39). warning: the tm can still halt in another way.&lt;br /&gt;
&lt;br /&gt;
A(n,*) transitions to A(~8n/3,*). it&#039;s possible that the tm is unlucky and it needs 10^39 transitions to halt.&lt;br /&gt;
&lt;br /&gt;
i simulated the tm and looked at A(*,*). the 1st A(*,*) is A(9,&amp;quot;&amp;quot;). i ran the simulation up to the 2728570th A(*,*) (i.e. A(~2^3861031,&amp;quot;0111111111111111111111111&amp;quot;)). the tm never came close to finishing the length-108 path. the closest attempt was 21 out of 108 steps, and this happened at the 2379364th A(*,*) (i.e. A(~2^3366892,&amp;quot;010101101010111&amp;quot;)).&lt;br /&gt;
&lt;br /&gt;
lastly, the next k transitions for A(n,r) and A(n+3^k,r) are probably the same (i think this is true, but didn&#039;t rigorously prove this). it&#039;s worth investigating n%(3^k). i looked into the sequence of n%3, but this sequence appears statistically random. maybe someone can look into n%(3^k) more carefully.&lt;br /&gt;
&lt;br /&gt;
this tm is like a lottery machine. i think it&#039;s probviously halting.&lt;br /&gt;
&lt;br /&gt;
next steps:&lt;br /&gt;
&lt;br /&gt;
* verify the simulation steps. does A(~2^3366892,&amp;quot;010101101010111&amp;quot;) occur?&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:BB(6)]][[Category:Cryptids]]&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=0RB1RZ0RB_1RC1LB2LB_1LB2RD1LC_1RA2RC0LD&amp;diff=9232</id>
		<title>0RB1RZ0RB 1RC1LB2LB 1LB2RD1LC 1RA2RC0LD</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=0RB1RZ0RB_1RC1LB2LB_1LB2RD1LC_1RA2RC0LD&amp;diff=9232"/>
		<updated>2026-10-17T12:36:47Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: archive discord messages&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{machine|0RB1RZ0RB_1RC1LB2LB_1LB2RD1LC_1RA2RC0LD}}&lt;br /&gt;
{{TM|0RB1RZ0RB_1RC1LB2LB_1LB2RD1LC_1RA2RC0LD|halt}} is a halting [[BB(4,3)]] machine that appears to run for between&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;2 \uparrow\uparrow\uparrow (2^{2^{32}+1}) \text{ and } 2 \uparrow\uparrow\uparrow (2^{2^{32}+1}+1)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
steps. The TM was discovered by Pavel Kropitz in May 2024 in a group of 7 long-running halting BB(4,3) TMs.&amp;lt;ref&amp;gt;{{DiscordArchive|1026577255754903572|1243253180297646120}}&amp;lt;/ref&amp;gt; Racheline analyzed the machine by hand in Feb 2025, validating the result and provided the step estimate listed above.&amp;lt;ref&amp;gt;{{DiscordArchive|1331570843829932063|1337228898068463718}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Pavel listed the halting tape as:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
1 2^((80*2^((&amp;lt;(8*2^((8*2^(29) - 2)) - 5); (&amp;lt;(80*2^((b - 10)/5) - 17)/9; (40*2^((8*2^((a - 11)/5) - 2)) - 4); (40*2^(2) - 4)&amp;gt; + 4); (&amp;lt;(80*2^((&amp;lt;(80*2^((8*2^((8*2^(29) - 2)) - 3)) - 13)/9; (40*2^((8*2^((a - 11)/5) - 2)) - 4); (40*2^(2) - 4)&amp;gt; - 6)/5) - 17)/9; (40*2^((8*2^((a - 11)/5) - 2)) - 4); (40*2^(2) - 4)&amp;gt; + 4)&amp;gt; - 10)/5) - 3)) 1 0 1 2 1^2 Z&amp;gt; 1 2^2 1&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Analysis by racheline ==&lt;br /&gt;
{{DiscordArchive|1331570843829932063|1337228898068463718}}&lt;br /&gt;
&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
f(n) = 2^2^(n+1)&lt;br /&gt;
g(n) = (5*2^(2^(f^n(0)+1)+2)-8)/9&lt;br /&gt;
n0 = (5*2^(2^(2^32+1)+1)-4)/9&lt;br /&gt;
n1 = 2^(2^32+1)-4&lt;br /&gt;
0RB1RZ0RB_1RC1LB2LB_1LB2RD1LC_1RA2RC0LD halts with 5*2^(2^(f^g^n1(n0)(0)+1)+2)+7 nonzero symbols on the tape, after roughly (that)^2 steps&lt;br /&gt;
that&#039;s around 2^^^(2^(2^32+1)-1)&lt;br /&gt;
the rules necessary for verification:&lt;br /&gt;
0^inf 1 &amp;lt;D 0^(5n) 2^4 -&amp;gt;&lt;br /&gt;
0^inf 1 &amp;lt;D 0^(5*2^n+2)&lt;br /&gt;
&lt;br /&gt;
0^inf 1 &amp;lt;D 0^(5n+2) 2^5 -&amp;gt;&lt;br /&gt;
0^inf 1 &amp;lt;D 0^(5*2^(n+1))&lt;br /&gt;
&lt;br /&gt;
0^inf 1 &amp;lt;D 0^(5n) 221122 -&amp;gt;&lt;br /&gt;
0^inf 1 &amp;lt;D 0^(5*2^n+4)&lt;br /&gt;
&lt;br /&gt;
0^inf 1 &amp;lt;D 0^(5n+4) 1 0^5 -&amp;gt;&lt;br /&gt;
0^inf 1 &amp;lt;D 0^2 2^23 1 0^(5*2^(n+2)-22) 1011221&lt;br /&gt;
&lt;br /&gt;
0^inf 1 &amp;lt;D 0^(5n) 1 0^10 -&amp;gt;&lt;br /&gt;
0^inf 1 &amp;lt;D 0^2 2^(5*2^(n+1)) 11221&lt;br /&gt;
&lt;br /&gt;
0^inf 1 &amp;lt;D 0^(5n+2) 2222112 -&amp;gt;&lt;br /&gt;
0^inf 1 &amp;lt;D 0^(5*2^(n+1)+2)&lt;br /&gt;
&lt;br /&gt;
0^inf 1 &amp;lt;D 0^(5n+2) 21 0^10 -&amp;gt;&lt;br /&gt;
0^inf 1 &amp;lt;D 0^2 2^(5*2^(n+2)-4) 11221&lt;br /&gt;
&lt;br /&gt;
0^inf 1 &amp;lt;D 0^(5n+2) 2^9 -&amp;gt;&lt;br /&gt;
0^inf 1 &amp;lt;D 0^(5*2^(n+1)) 2^4 -&amp;gt;&lt;br /&gt;
0^inf 1 &amp;lt;D 0^(5*2^2^(n+1)+2) =&lt;br /&gt;
0^inf 1 &amp;lt;D 0^(5f(n)+2)&lt;br /&gt;
&lt;br /&gt;
0^inf 1 &amp;lt;D 0^2 2^(9n) -&amp;gt;&lt;br /&gt;
0^inf 1 &amp;lt;D 0^(5f^n(0)+2)&lt;br /&gt;
&lt;br /&gt;
0^inf 1 &amp;lt;D 0^2 2^(9n+4) 11221 0^10 -&amp;gt;&lt;br /&gt;
0^inf 1 &amp;lt;D 0^(5f^n(0)+2) 222211221 0^10 -&amp;gt;&lt;br /&gt;
0^inf 1 &amp;lt;D 0^(5*2^(f^n(0)+1)+2) 21 -&amp;gt;&lt;br /&gt;
0^inf 1 &amp;lt;D 0^2 2^(5*2^(2^(f^n(0)+1)+2)-4) 11221 =&lt;br /&gt;
0^inf 1 &amp;lt;D 0^2 2^(9g(n)+4) 11221&lt;br /&gt;
&lt;br /&gt;
0^inf 1 &amp;lt;D 0^2 2^(9n+4) 11221 0^(10m) -&amp;gt;&lt;br /&gt;
0^inf 1 &amp;lt;D 0^2 2^(9g^m(n)+4) 11221&lt;br /&gt;
&lt;br /&gt;
0^inf 1 &amp;lt;D 0^2 2^16 11221 0^inf&lt;br /&gt;
0^inf 1 &amp;lt;D 0^10 2^11 11221 0^inf&lt;br /&gt;
0^inf 1 &amp;lt;D 0^22 2^7 11221 0^inf&lt;br /&gt;
0^inf 1 &amp;lt;D 0^160 2211221 0^inf&lt;br /&gt;
0^inf 1 &amp;lt;D 0^(5*2^32+4) 1 0^inf&lt;br /&gt;
0^inf 1 &amp;lt;D 0^2 2^23 1 0^(5*2^(2^32+2)-22) 1011221 0^inf&lt;br /&gt;
0^inf 1 &amp;lt;D 0^10 2^18 1 0^(5*2^(2^32+2)-22) 1011221 0^inf&lt;br /&gt;
0^inf 1 &amp;lt;D 0^22 2^14 1 0^(5*2^(2^32+2)-22) 1011221 0^inf&lt;br /&gt;
0^inf 1 &amp;lt;D 0^160 2^9 1 0^(5*2^(2^32+2)-22) 1011221 0^inf&lt;br /&gt;
0^inf 1 &amp;lt;D 0^(5*2^32+2) 2^5 1 0^(5*2^(2^32+2)-22) 1011221 0^inf&lt;br /&gt;
0^inf 1 &amp;lt;D 0^(5*2^(2^32+1)) 1 0^(5*2^(2^32+2)-22) 1011221 0^inf&lt;br /&gt;
0^inf 1 &amp;lt;D 0^2 2^(5*2^(2^(2^32+1)+1)) 11221 0^(5*2^(2^32+2)-32) 1011221 0^inf =&lt;br /&gt;
0^inf 1 &amp;lt;D 0^2 2^(9n0+4) 11221 0^(10n1+8) 1011221 0^inf&lt;br /&gt;
0^inf 1 &amp;lt;D 0^2 2^(9g^n1(n0)+4) 11221 0^8 1011221 0^inf&lt;br /&gt;
0^inf 1 &amp;lt;D 0^(5*2^(f^g^n1(n0)(0)+1)+2) 21 0^8 1011221 0^inf&lt;br /&gt;
this continues the same way as if the 0^8 was a 0^10 until the last few steps, so the tape differs from 0^inf 1 &amp;lt;D 0^2 2^(5*2^(2^(f^g^n1(n0)(0)+1)+2)-4) 11221 in a small amount of symbols on the left end and the right end, which you can easily count by running a smaller example&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Equivalent TMs ==&lt;br /&gt;
&lt;br /&gt;
The TMs {{TM|0RB1RZ1RC_1RC1LB2LB_1LB2RD1LC_1RA2RC0LD|halt}}, {{TM|1RB1LA2LA_1LA2RC1LB_1RD2RB0LC_0RA1RZ0RA|halt}}, {{TM|1RB1LA2LA_1LA2RC1LB_1RD2RB0LC_0RA1RZ1RB|halt}} [https://discord.com/channels/960643023006490684/1331570843829932063/1337236324846927932 are equivalent] to {{TM|0RB1RZ0RB_1RC1LB2LB_1LB2RD1LC_1RA2RC0LD|halt}}, with the exact same halting configuration &amp;lt;code&amp;gt;0^inf 1 2^(σ-10) 101211 Z&amp;gt; 1221 0^inf&amp;lt;/code&amp;gt;, where &amp;lt;code&amp;gt;σ = 5*2^(2^(f^g^n1(n0)(0)+1)+2)+7&amp;lt;/code&amp;gt; is the total number of nonzero symbols.&lt;br /&gt;
&lt;br /&gt;
To see that {{TM|0RB1RZ1RC_1RC1LB2LB_1LB2RD1LC_1RA2RC0LD|halt}} is equivalent, simply notice that the situation &amp;lt;code&amp;gt;A&amp;gt; 20&amp;lt;/code&amp;gt; never occurs in any of the rules in the above analysis, or inside the low-level bell cycles, and that &amp;lt;code&amp;gt;A&amp;gt; 21&amp;lt;/code&amp;gt; and &amp;lt;code&amp;gt;A&amp;gt; 22&amp;lt;/code&amp;gt; behave the same in both TMs, except that they take two more steps in {{TM|0RB1RZ0RB_1RC1LB2LB_1LB2RD1LC_1RA2RC0LD|halt}}. Since the A2 transition is the only difference between the two, this means the TMs only differ in the number of steps it takes to halt (and even that difference is insignificant, on the order of σ = &amp;lt;code&amp;gt;5*2^(2^(f^g^n1(n0)(0)+1)+2)+7&amp;lt;/code&amp;gt; while the total number of steps is around σ&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt;). {{TM|1RB1LA2LA_1LA2RC1LB_1RD2RB0LC_0RA1RZ0RA|halt}} and {{TM|1RB1LA2LA_1LA2RC1LB_1RD2RB0LC_0RA1RZ1RB|halt}} are just {{TM|0RB1RZ0RB_1RC1LB2LB_1LB2RD1LC_1RA2RC0LD|halt}} and {{TM|0RB1RZ1RC_1RC1LB2LB_1LB2RD1LC_1RA2RC0LD|halt}} respectively, but started one step later, so that their halting time is 1 step smaller.&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
&amp;lt;references /&amp;gt;&lt;br /&gt;
[[Category:BB(4,3)]]&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=0RB1LD_1LC1RB_1LD1RE_1LA1LE_1LZ0RC&amp;diff=9230</id>
		<title>0RB1LD 1LC1RB 1LD1RE 1LA1LE 1LZ0RC</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=0RB1LD_1LC1RB_1LD1RE_1LA1LE_1LZ0RC&amp;diff=9230"/>
		<updated>2026-10-17T12:31:58Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: archive discord link&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{machine|0RB1LD_1LC1RB_1LD1RE_1LA1LE_1LZ0RC}}&lt;br /&gt;
{{TM|0RB1LD_1LC1RB_1LD1RE_1LA1LE_1LZ0RC|halt}} is the [[Maximum Consecutive Ones Function|num(5)]] champion (the [[BB(5)|five-state, two-symbol]] TM which halts leaving the most consecutive ones on the tape) according to Andrés Sancho.&amp;lt;ref&amp;gt;{{DiscordArchive|1242208042460647575|1337655697348886558}} by Andrés Sancho on 8 Feb 2025&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;https://github.com/MatterAndy/BB5-contiguous-1s&amp;lt;/ref&amp;gt; It halts after 15590 steps with 165 consecutive ones on the tape.&lt;br /&gt;
&lt;br /&gt;
It is tied for the num(5) championship with {{TM|1RB1LA_1RC1LE_1RD1RE_0LA1RC_1RZ0LB|halt}} which is the [[TNF-1RB]] version of the same TM (The [[permutation]] of this TM starting at state B).&lt;br /&gt;
&lt;br /&gt;
== Analysis ==&lt;br /&gt;
Let &amp;lt;math&amp;gt;A(a):=0^\infty\;1^a\;\textrm{&amp;lt;}\textrm{A}\;11\;0^\infty&amp;lt;/math&amp;gt;. Then,&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;\begin{array}{lll}A(3a)&amp;amp;\to&amp;amp;A(4a+2)\\A(3a+1)&amp;amp;\to&amp;amp;A(4a+4)\\A(3a+2)&amp;amp;\to&amp;amp;0^\infty\;\textrm{&amp;lt;}\textrm{Z}\;1^{4a+5}\;0^\infty\end{array}&amp;lt;/math&amp;gt;&lt;br /&gt;
== Trajectory ==&lt;br /&gt;
This Turing machine starts with &amp;lt;math&amp;gt;A(3)&amp;lt;/math&amp;gt; after 13 steps and halts after 10 rule applications:&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;A(3)\to A(6)\to A(10)\to A(16)\to A(24)\to A(34)\to A(48)\to A(66)\to A(90)\to A(122)\to 0^\infty\;\textrm{&amp;lt;}\textrm{Z}\;1^{165}\;0^\infty&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
&amp;lt;references/&amp;gt;&lt;br /&gt;
[[Category:BB(5)]]&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=1RB0LD_0RC0RE_1LC0LA_---1LE_0LF0RE_0RA0LE&amp;diff=9229</id>
		<title>1RB0LD 0RC0RE 1LC0LA ---1LE 0LF0RE 0RA0LE</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=1RB0LD_0RC0RE_1LC0LA_---1LE_0LF0RE_0RA0LE&amp;diff=9229"/>
		<updated>2026-10-17T12:24:37Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: Adding in Discord message archives.&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{machine|1RB0LD_0RC0RE_1LC0LA_---1LE_0LF0RE_0RA0LE}}{{Stub}}&lt;br /&gt;
{{TM|1RB0LD_0RC0RE_1LC0LA_---1LE_0LF0RE_0RA0LE}} was a probable [[BB(6)]] [[Cryptid]] analyzed by Racheline on 16 May 2025.&lt;br /&gt;
&lt;br /&gt;
{{DiscordArchive|1239205785913790465|1373012119452389418}}&lt;br /&gt;
&lt;br /&gt;
{{DiscordArchive|1373100094819139615|1373100094819139615}}&lt;br /&gt;
&lt;br /&gt;
It was decided by Alistaire on 15 Feb 2026 as non-halting via Quick_Sim.py.&lt;br /&gt;
&lt;br /&gt;
{{DiscordArchive|1239205785913790465|1472376779825090713}}&lt;br /&gt;
[[Category:BB(6)]]&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=Template:DiscordArchive&amp;diff=8447</id>
		<title>Template:DiscordArchive</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=Template:DiscordArchive&amp;diff=8447"/>
		<updated>2026-09-06T16:55:32Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: fix guild id&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[https://discord.com/channels/960643023006490684/{{{1}}}/{{{2}}} Discord message] ([https://xnoobspeakable.github.io/bbch-archive-pages/channels/{{{1}}}/messages.html#message-{{{2}}} archive])&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=Template:DiscordArchive&amp;diff=8446</id>
		<title>Template:DiscordArchive</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=Template:DiscordArchive&amp;diff=8446"/>
		<updated>2026-09-06T16:53:51Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: fix templakte&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[https://discord.com/channels/hardcodedguildid/{{{1}}}/{{{2}}} Discord message] ([https://xnoobspeakable.github.io/bbch-archive-pages/channels/{{{1}}}/messages.html#message-{{{2}}} archive])&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=User:XnoobSpeakable/Xnoobs-testing-page&amp;diff=8442</id>
		<title>User:XnoobSpeakable/Xnoobs-testing-page</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=User:XnoobSpeakable/Xnoobs-testing-page&amp;diff=8442"/>
		<updated>2026-09-06T15:06:18Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: try edit source instead&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Going to be testing out the Discord citation archival system in this page. Testing archived citation.&amp;lt;ref&amp;gt;{{DiscordArchive|960643023530762341|1545742987710038088}}&amp;lt;/ref&amp;gt;&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=User:XnoobSpeakable/Xnoobs-testing-page&amp;diff=8441</id>
		<title>User:XnoobSpeakable/Xnoobs-testing-page</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=User:XnoobSpeakable/Xnoobs-testing-page&amp;diff=8441"/>
		<updated>2026-09-06T15:05:31Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: change text&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Going to be testing out the Discord citation archival system in this page. Testing archived citation.&amp;lt;ref&amp;gt;{{DiscordArchive}}&amp;lt;/ref&amp;gt;&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=User:XnoobSpeakable/Xnoobs-testing-page&amp;diff=8440</id>
		<title>User:XnoobSpeakable/Xnoobs-testing-page</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=User:XnoobSpeakable/Xnoobs-testing-page&amp;diff=8440"/>
		<updated>2026-09-06T15:05:18Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: test DiscordArchive template&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Going to be testing out the Discord citation archival system in this page. Testing a non-archived citation first.&amp;lt;ref&amp;gt;{{DiscordArchive}}&amp;lt;/ref&amp;gt;&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=Template:DiscordArchive&amp;diff=8439</id>
		<title>Template:DiscordArchive</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=Template:DiscordArchive&amp;diff=8439"/>
		<updated>2026-09-06T15:03:09Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: Attempted to create a discord archive template&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[https://discord.com/channels/960643023006490684/{{{1}}}/{{{2}}} Discord message] ([https://xnoobspeakable.github.io/bbch-archive-pages/channels/{{{1}}}#message-{{{2}}} archive])&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=User:XnoobSpeakable&amp;diff=8438</id>
		<title>User:XnoobSpeakable</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=User:XnoobSpeakable&amp;diff=8438"/>
		<updated>2026-09-06T11:15:29Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: name preference&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Hi, I&#039;m XnoobSpeakable, currently known as Xnoob545 on most platforms. When referencing my work on the Wiki, use the name XnoobSpeakable, not Xnoob545.&lt;br /&gt;
&lt;br /&gt;
Contact me at @Xnoob545 on Discord.&lt;br /&gt;
&lt;br /&gt;
List of all user pages:&lt;br /&gt;
&lt;br /&gt;
[[User:XnoobSpeakable/Holdouts-temp]]&lt;br /&gt;
&lt;br /&gt;
[[User:XnoobSpeakable/Xnoobs-testing-page]]&lt;br /&gt;
&lt;br /&gt;
The main domain I work on is [[BB(3,4)]]&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=User:XnoobSpeakable/Xnoobs-testing-page&amp;diff=8437</id>
		<title>User:XnoobSpeakable/Xnoobs-testing-page</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=User:XnoobSpeakable/Xnoobs-testing-page&amp;diff=8437"/>
		<updated>2026-09-06T11:14:37Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: start citation testing for archival&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Going to be testing out the Discord citation archival system in this page. Testing a non-archived citation first.&amp;lt;ref&amp;gt;https://discord.com/channels/960643023006490684/960643023530762341/1545742987710038088&amp;lt;/ref&amp;gt;&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=TMBR:_September_2026&amp;diff=8436</id>
		<title>TMBR: September 2026</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=TMBR:_September_2026&amp;diff=8436"/>
		<updated>2026-09-06T11:14:08Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: Change name to XnoobSpeakable.&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{TMBRnav|August 2026|October 2026}}&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;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).&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
== BB Adjacent ==&lt;br /&gt;
&lt;br /&gt;
TODO: [[Cyclic Tag]]&lt;br /&gt;
&lt;br /&gt;
== Holdouts ==&lt;br /&gt;
* [[BB(6)]]&lt;br /&gt;
** By September 4, mxdys solved all 16 Counter Class 1 TMs.&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1239205785913790465/1545487019218698290]&lt;br /&gt;
** On September 4, Discord user fifi_49513 claimed to have proven a TM non-halting. &amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1545543031468462150/1545543031468462150]&amp;lt;/sup&amp;gt; This machine was later confirmed non-halting in Rocq on September 5 by mxdys. &amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/1545543031468462150/1545682001481175095]&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[BB(2,7)]]&lt;br /&gt;
** Terry Ligocki enumerated 10K more subtasks, increasing the number of holdouts to &#039;&#039;&#039;2,677,730,602&#039;&#039;&#039;. A total of 860K subtasks out of the 1 million subtasks (or &#039;&#039;&#039;86%&#039;&#039;&#039;) have been enumerated.&lt;br /&gt;
&lt;br /&gt;
== Misc ==&lt;br /&gt;
* On September 5, [[User:XnoobSpeakable|XnoobSpeakable]] began an opt-in archival project of the bbchallenge Discord server&amp;lt;sup&amp;gt;[[Category:This Month in Beaver Research|2026-09]].&amp;lt;sup&amp;gt;[https://discord.com/channels/960643023006490684/960643023530762341/1545742987710038088]&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=BB(4,3)&amp;diff=7550</id>
		<title>BB(4,3)</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=BB(4,3)&amp;diff=7550"/>
		<updated>2026-05-16T16:10:31Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: /* Stage 3 */ fix fix&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The Busy Beaver problem for 4 states and 3 symbols is unsolved. The existence of [[Cryptids]] in the domain is given by the discovery of [[Bigfoot]] in [[BB(3,3)]]. The current [[Champions#3-Symbol TMs|champion]] is {{TM|1RB1RD1LC_2LB1RB1LC_1RZ1LA1LD_0RB2RA2RD|halt}} which was discovered by Pavel Kropitz in May 2024 along with 6 other long running machines. It was [[User:Polygon/Page for analyses#1RB1RD1LC 2LB1RB1LC 1RZ1LA1LD 0RB2RA2RD (bbch)|analyzed by Polygon]] in Oct 2025, demonstrating the lower bounds:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;S(4,3) &amp;gt; \Sigma(4,3) &amp;gt; 10 \uparrow^{4} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Top Halters ==&lt;br /&gt;
The longest running halting BB(4,3) TMs are split amongst two classes: the pentational and hexational TMs found by Pavel Kropitz outlined in the Potential Champions section, and the tetrational TMs found by comprehensive holdout filtering by Terry Ligocki. The scores are given using [[wikipedia:Knuth&#039;s_up-arrow_notation|Knuth&#039;s up-arrow notation]] with an extension to decimal tetration&amp;lt;ref&amp;gt;Shawn Ligocki. 2022. [https://www.sligocki.com/2022/06/25/ext-up-notation.html &amp;quot;Extending Up-arrow Notation&amp;quot;]&amp;lt;/ref&amp;gt;. The longest running halters found by Pavel Kropitz are:&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
!Standard format&lt;br /&gt;
!Approximate sigma scores&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RD1LC_2LB1RB1LC_1RZ1LA1LD_0RB2RA2RD|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow^{4} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|0RB1RZ0RB_1RC1LB2LB_1LB2RD1LC_1RA2RC0LD|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow\uparrow\uparrow 2^{2^{32}}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LB0LB_2LC2LA0LA_2RD1LC1RZ_1RA2LD1RD|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;3 \uparrow\uparrow\uparrow 88574&amp;lt;/math&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
The top 20 scoring halting machines found by comprehensive search are:&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!Standard format&lt;br /&gt;
!Approximate sigma score&lt;br /&gt;
!Discoverer&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LD2LA_0RC1RZ0RA_1LD2LA0LC_2RD2RC0LD|halt}}&lt;br /&gt;
|~10 ↑↑ 1023.47221&lt;br /&gt;
|Andrew Ducharme&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LC1RD_1RC1LD0RA_2LA0RC1RB_0LB2LB1RZ|halt}} &lt;br /&gt;
|~10 ↑↑ 619.07737&lt;br /&gt;
|Andrew Ducharme&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ2RD_1LC0RD0RC_2LC1LA0RB_2RC0RC2RA|halt}}&lt;br /&gt;
|~10 ↑↑ 512.10945&lt;br /&gt;
|Andrew Ducharme&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ0RC_1RC1RA0LD_2RD2RB0RD_1LB2LD2RA|halt}}&lt;br /&gt;
|~10 ↑↑ 439.02781&lt;br /&gt;
|Andrew Ducharme&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LC1RD_1RC1LD0RA_2LA0RC1RB_0LB2LB1RZ|halt}}&lt;br /&gt;
|~10 ↑↑ 234.06408&lt;br /&gt;
|Andrew Ducharme&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LC1RC_1LA2RB1LB_1RC2LA0RD_2LB1RZ2LC|halt}}&lt;br /&gt;
|~10 ↑↑ 190.21359&lt;br /&gt;
|Terry Ligocki&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LA1RA_1LA0RC1LC_1LC2RB0LD_2RA1RZ2RC|halt}}&lt;br /&gt;
|~10 ↑↑ 190.21359&lt;br /&gt;
|Terry Ligocki&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LC1RA_2RC1LB2RD_1LD2LA0LB_0LA1RZ0LC|halt}}&lt;br /&gt;
|~10 ↑↑ 178.48320&lt;br /&gt;
|Andrew Ducharme&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LC1RA_1LA0RD2RB_2LD0RC2LD_2LA1RZ0RD|halt}}&lt;br /&gt;
|~10 ↑↑ 166.03664&lt;br /&gt;
|Terry Ligocki&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LC1RA_1LA0RD2RB_2LD2LA2LD_2LA1RZ0RD|halt}}&lt;br /&gt;
|~10 ↑↑ 166.03664&lt;br /&gt;
|Terry Ligocki&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LC1RA_1LA2LD2RB_2LD0RC2LD_2LA1RZ0RD|halt}}&lt;br /&gt;
|~10 ↑↑ 166.03664&lt;br /&gt;
|Terry Ligocki&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LC1RA_1LA2LD2RB_2LD2LA1LB_2LA1RZ0RD|halt}}&lt;br /&gt;
|~10 ↑↑ 166.03664&lt;br /&gt;
|Terry Ligocki&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LC1RA_1LA2LD2RB_2LD2LA2LD_2LA1RZ0RD|halt}}&lt;br /&gt;
|~10 ↑↑ 166.03664&lt;br /&gt;
|Terry Ligocki&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LD0RC_2LC0RB1RA_1RA0LB1RD_0LA2LA1RZ|halt}}&lt;br /&gt;
|~10 ↑↑ 158.81916&lt;br /&gt;
|Andrew Ducharme&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RC1RB_1LC0RA2LD_2RA0LD1RZ_0LB2LD1RD|halt}}&lt;br /&gt;
|~10 ↑↑ 154.52968&lt;br /&gt;
|Andrew Ducharme&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LA1RD_2LA0LC2LD_1RZ2RA2LB_0LC2RC1RA|halt}}&lt;br /&gt;
|~10 ↑↑ 147.26175&lt;br /&gt;
|Andrew Ducharme&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0RB1LC_2LC0LD1RA_2RB2LD1RZ_2LA2LB0LD|halt}}&lt;br /&gt;
|~10 ↑↑ 141.44248&lt;br /&gt;
|Andrew Ducharme&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0RC2LB_2LC2RD1LC_1RC0LC1LB_1RZ1RA1RA|halt}}&lt;br /&gt;
|~10 ↑↑ 139.06217&lt;br /&gt;
|Andrew Ducharme&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0RC2LB_2LC2RD1LC_1RC0LC1LB_1RZ2LD1RA|halt}}&lt;br /&gt;
|~10 ↑↑ 139.06217&lt;br /&gt;
|Andrew Ducharme&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0RC1LB_2LC2RD1LC_1RC0LC1LB_1RZ1RA---|halt}}&lt;br /&gt;
|~10 ↑↑ 139.06217&lt;br /&gt;
|Andrew Ducharme&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Potential Champions ==&lt;br /&gt;
In May 2024, [https://discord.com/channels/960643023006490684/1026577255754903572/1243253180297646120 Pavel Kropitz found 7 halting TMs] that run for a large number of steps. Four of these are equivalent and were [https://discord.com/channels/960643023006490684/1331570843829932063/1337228898068463718 analyzed by Racheline] in February 2025, while the remaining three were [[User:Polygon/Page for analyses|analyzed by Polygon in October 2025.]]&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
!Standard format&lt;br /&gt;
!Approximate sigma scores&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RD1LC_2LB1RB1LC_1RZ1LA1LD_0RB2RA2RD|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow^{4} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|0RB1RZ0RB_1RC1LB2LB_1LB2RD1LC_1RA2RC0LD|halt}}*&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow\uparrow\uparrow 2^{2^{32}}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LB0LB_2LC2LA0LA_2RD1LC1RZ_1RA2LD1RD|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;3 \uparrow\uparrow\uparrow 88574&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RD1LC_2LB1RB1LC_1RZ1LA1LD_2RB2RA2RD|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow 9.873987&amp;lt;/math&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&amp;lt;nowiki&amp;gt;*&amp;lt;/nowiki&amp;gt;equivalent to {{TM|0RB1RZ1RC_1RC1LB2LB_1LB2RD1LC_1RA2RC0LD|halt}}, {{TM|1RB1LA2LA_1LA2RC1LB_1RD2RB0LC_0RA1RZ0RA|halt}} and {{TM|1RB1LA2LA_1LA2RC1LB_1RD2RB0LC_0RA1RZ1RB|halt}}.&lt;br /&gt;
&lt;br /&gt;
== Phase 1 ==&lt;br /&gt;
The initial phase of enumeration and reduction of [[holdouts]] took place in December 2024 and was done by Terry Ligocki using the Ligockis&#039; C++ and Python codes. The initial enumerations generated ~633B(illion) TMs of which ~34.4B TMs were holdouts. Also found were ~206B halting TMs and ~392B infinite TMs. The number of holdouts was reduced to ~461M TMs (a 99.93% reduction).&lt;br /&gt;
&lt;br /&gt;
Two C++ programs were run before the filters in the table.&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
lr_enum 4 3 8 /dev/null /dev/null 4x3.unk.txt false&lt;br /&gt;
00 &amp;lt;= XX &amp;lt; 47: lr_enum_continue 4x3.in.XX 1000 /dev/null /dev/null 4x3.unk.txt.XX XX false&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Both do the initial enumeration and simple filtering. The &amp;quot;/dev/null&amp;quot; in both commands would be files where the halting and infinite TMs would be stored. The first command generates the TMs from a [[TNF]] tree for BB(4,3) of depth 8 and outputs the holdouts to 4x3.unk.txt. This file was then divided into 48 pieces, 4x3.in.XX, 0 &amp;lt;= XX &amp;lt; 47. The second commands (one for each XX) continues the enumeration by running each TM for 1,000 steps. It classifies each as halting, infinite, or unknown/holdout. Again, the halting and infinite TMs are &amp;quot;written&amp;quot; to /dev/null, i.e., they aren&#039;t saved. The holdouts are stored in 48 files: 4x3.unk.txt.XX.&lt;br /&gt;
&lt;br /&gt;
For these runs the first command generated a total of ~45M TMs: ~1.86M halting, ~774K infinite, and ~42.0M holdouts. The second took the ~42.0M holdout TMs and generated a total of ~633B TMs: ~206B halting, ~392B infinite, and ~34.4B holdouts. These holdouts were used as a starting point of the filters below.&lt;br /&gt;
&lt;br /&gt;
The &amp;quot;Description&amp;quot; column in the table below contain the command run. Two options are not given, &amp;quot;--infile=...&amp;quot; and an &amp;quot;--outfile=...&amp;quot;. These are necessary and specify where to read and write the results, respectively. Note: The work flow was to divide the input holdouts into 48 pieces, run the command on each piece simultaneously on one of 48 cores, and then combine the 48 results into a group of holdouts.&lt;br /&gt;
&lt;br /&gt;
The details are given in this table:&lt;br /&gt;
&lt;br /&gt;
(done to reduce column size:&lt;br /&gt;
&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;= % Reduced,&lt;br /&gt;
&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;= Runtime (hours),&lt;br /&gt;
&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;= Decided,&lt;br /&gt;
&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;= Processed)&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: right&amp;quot;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |TMs/sec/core&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
!&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;&lt;br /&gt;
!&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|34,413,860,527&lt;br /&gt;
|30,874,934,791&lt;br /&gt;
|10.28%&lt;br /&gt;
|646.6&lt;br /&gt;
|1,520.36&lt;br /&gt;
|14,784.57&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Reverse_Engineer_Filter.py&lt;br /&gt;
|rowspan=&amp;quot;10&amp;quot; style=&amp;quot;text-align:left&amp;quot; |[https://drive.google.com/drive/folders/1KMOVgngtUVMEA7EjxtNcsgksQ5Y4tby9?usp=drive_link Google Drive]&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|30,874,934,791&lt;br /&gt;
|12,942,386,396&lt;br /&gt;
|58.08%&lt;br /&gt;
|4,134.8&lt;br /&gt;
|1,204.72&lt;br /&gt;
|2,074.19&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=1&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|12,942,386,396&lt;br /&gt;
|4,534,322,415&lt;br /&gt;
|64.97%&lt;br /&gt;
|3,361.1&lt;br /&gt;
|694.88&lt;br /&gt;
|1,069.62&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=2&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|4,534,322,415&lt;br /&gt;
|2,959,598,830&lt;br /&gt;
|34.73%&lt;br /&gt;
|3,318.1&lt;br /&gt;
|131.83&lt;br /&gt;
|379.59&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=3&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|2,959,598,830&lt;br /&gt;
|1,651,940,618&lt;br /&gt;
|44.18%&lt;br /&gt;
|2,700.6&lt;br /&gt;
|134.50&lt;br /&gt;
|304.42&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Enumerate.py --max-loops=1_000 --block-size=2 --no-steps --time=0.002 --lin-steps=0 --no-reverse-engineer --save-freq=10_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|1,651,940,618&lt;br /&gt;
|854,984,279&lt;br /&gt;
|48.24%&lt;br /&gt;
|2,276.3&lt;br /&gt;
|97.25&lt;br /&gt;
|201.59&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Enumerate.py --max-loops=10_000 --block-size=12 --no-steps --time=0.005 --lin-steps=0 --no-ctl --no-reverse-engineer --save-freq=10_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|854,984,279&lt;br /&gt;
|683,163,325&lt;br /&gt;
|20.10%&lt;br /&gt;
|430.1&lt;br /&gt;
|110.96&lt;br /&gt;
|552.15&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=4 --max-steps=1_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|683,163,325&lt;br /&gt;
|460,916,384&lt;br /&gt;
|32.53%&lt;br /&gt;
|5,507.9&lt;br /&gt;
|11.21&lt;br /&gt;
|34.45&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --min-block-size=1 --max-block-size=6  --max-steps=10_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:center&amp;quot; |&#039;&#039;&#039;Cumulative&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;632,656,365,801&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;460,916,384&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;99.93%&#039;&#039;&#039;&lt;br /&gt;
| ---&lt;br /&gt;
| ---&lt;br /&gt;
| ---&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot;   | ---&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 2 ==&lt;br /&gt;
&lt;br /&gt;
When Phase 1 was completed, a set of deciders/parameters were run to reduce the number of holdout TMs. The details are given in the various Stages below.&lt;br /&gt;
&lt;br /&gt;
=== Stage 1 ===&lt;br /&gt;
&lt;br /&gt;
Starting from the results of Phase 1, Terry Ligocki ran @mxdys&#039; C++ code, &amp;quot;main.exe&amp;quot;, using a variety of its deciders with various parameters. A total of 33 variations were run. The holdouts were reduced from ~461B TMs to ~33.9M TMs (a 92.7% reduction). The details are given in the table below, including links to the Google Drive with the holdouts. Entries with multiple lines represent runs where all the commands in the &amp;quot;Description&amp;quot; were applied during one run.&lt;br /&gt;
&lt;br /&gt;
(done to reduce column size:&lt;br /&gt;
&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;= % Reduced,&lt;br /&gt;
&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;= Compute Time (core-hours),&lt;br /&gt;
&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;= Decided,&lt;br /&gt;
&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;= Processed)&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: right&amp;quot;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |TMs/sec/core&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
!&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;&lt;br /&gt;
!&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|460,916,384&lt;br /&gt;
|234,834,703&lt;br /&gt;
|49.05%&lt;br /&gt;
|96.7&lt;br /&gt;
|649.48&lt;br /&gt;
|1,324.10&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; | chr_LRUH 4 chr_H 2 MitM_CTL NG maxT 1000 NG_n 2 run&lt;br /&gt;
|rowspan=&amp;quot;20&amp;quot; style=&amp;quot;text-align:left&amp;quot; |[https://drive.google.com/drive/folders/1tFtg1eFC-AdqCzh7XNmx5O2mTQwtaNbm?usp=drive_link Google Drive]&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|234,834,703&lt;br /&gt;
|160,518,206&lt;br /&gt;
|31.65%&lt;br /&gt;
|70.9&lt;br /&gt;
|291.33&lt;br /&gt;
|920.57&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; | chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 1000 NG_n 2 run&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|160,518,206&lt;br /&gt;
|132,296,033&lt;br /&gt;
|17.58%&lt;br /&gt;
|41.5&lt;br /&gt;
|188.86&lt;br /&gt;
|1,074.17&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; | MitM_CTL RWL_mod sim 1001 maxT 1000 H 4 mod 6 n 1 run&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|132,296,033&lt;br /&gt;
|113,193,595&lt;br /&gt;
|14.44%&lt;br /&gt;
|54.9&lt;br /&gt;
|96.57&lt;br /&gt;
|668.77&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; | MitM_CTL RWL_mod sim 1001 maxT 1000 H 4 mod 1 n 6 run&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|113,193,595&lt;br /&gt;
|85,920,795&lt;br /&gt;
|24.09%&lt;br /&gt;
|106.8&lt;br /&gt;
|70.96&lt;br /&gt;
|294.52&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; | chr_LRUH 16 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|85,920,795&lt;br /&gt;
|78,674,774&lt;br /&gt;
|8.43%&lt;br /&gt;
|28.9&lt;br /&gt;
|69.62&lt;br /&gt;
|825.51&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; | MitM_CTL RWL_mod sim 1001 maxT 1000 H 8 mod 2 n 2 run&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|78,674,774&lt;br /&gt;
|73,228,547&lt;br /&gt;
|6.92%&lt;br /&gt;
|68.7&lt;br /&gt;
|22.02&lt;br /&gt;
|318.04&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; | MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 8 H 1 tH 1 n 4 run&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|73,228,547&lt;br /&gt;
|67,014,897&lt;br /&gt;
|8.49%&lt;br /&gt;
|23.2&lt;br /&gt;
|74.50&lt;br /&gt;
|878.02&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; | chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 30000 NG_n 1 run&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|67,014,897&lt;br /&gt;
|57,625,231&lt;br /&gt;
|14.01%&lt;br /&gt;
|75.6&lt;br /&gt;
|34.49&lt;br /&gt;
|246.13&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; | MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 2 n 6 run&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|57,625,231&lt;br /&gt;
|48,070,606&lt;br /&gt;
|16.58%&lt;br /&gt;
|645.4&lt;br /&gt;
|4.11&lt;br /&gt;
|24.80&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; | chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 30000 NG_n 10 run&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|48,070,606&lt;br /&gt;
|44,254,286&lt;br /&gt;
|7.94%&lt;br /&gt;
|166.3&lt;br /&gt;
|6.38&lt;br /&gt;
|80.31&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; | MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 6 H 1 tH 1 n 12 run&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|44,254,286&lt;br /&gt;
|40,836,159&lt;br /&gt;
|7.72%&lt;br /&gt;
|188.3&lt;br /&gt;
|5.04&lt;br /&gt;
|65.29&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; | MitM_CTL RWL_mod sim 1001 maxT 100000 H 3 mod 1 n 2 run&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|40,836,159&lt;br /&gt;
|37,460,692&lt;br /&gt;
|8.27%&lt;br /&gt;
|192.3&lt;br /&gt;
|4.88&lt;br /&gt;
|58.99&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |&lt;br /&gt;
chr_LRUH 8 chr_H 8 MitM_CTL NG maxT 10000 NG_n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
chr_LRUH 6 chr_H 6 MitM_CTL NG maxT 3000 NG_n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 100000 H 2 mod 2 n 1 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 6 H 0 tH 1 n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 6 mod 3 n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
chr_LRUH 6 chr_H 4 MitM_CTL NG maxT 3000 NG_n 1 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 4 H 1 tH 1 n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
chr_LRUH 8 chr_H 8 MitM_CTL NG maxT 10000 NG_n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
chr_LRUH 6 chr_H 6 MitM_CTL NG maxT 3000 NG_n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 3 n 1 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 8 mod 2 n 1 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 100000 H 3 mod 2 n 1 run &amp;lt;br/&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|37,460,692&lt;br /&gt;
|36,167,570&lt;br /&gt;
|3.45%&lt;br /&gt;
|237.7&lt;br /&gt;
|1.51&lt;br /&gt;
|43.77&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 3 H 0 tH 1 n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 10000 NG_n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
chr_LRUH 14 chr_H 12 MitM_CTL NG maxT 10000 NG_n 4 run &amp;lt;br/&amp;gt;&lt;br /&gt;
chr_LRUH 6 chr_H 6 MitM_CTL NG maxT 30000 NG_n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
chr_LRUH 10 chr_H 8 MitM_CTL NG maxT 10000 NG_n 4 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 6 mod 2 n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|36,167,570&lt;br /&gt;
|34,642,544&lt;br /&gt;
|4.22%&lt;br /&gt;
|467.2&lt;br /&gt;
|0.91&lt;br /&gt;
|21.50&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; | MitM_CTL RWL_mod sim 1001 maxT 30000 H 3 mod 2 n 24 run&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|34,642,544&lt;br /&gt;
|34,339,943&lt;br /&gt;
|0.87%&lt;br /&gt;
|383.1&lt;br /&gt;
|0.22&lt;br /&gt;
|25.12&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; | MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 8 H 1 tH 0 n 24 run&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|34,339,943&lt;br /&gt;
|33,860,069&lt;br /&gt;
|1.40%&lt;br /&gt;
|666.5&lt;br /&gt;
|0.20&lt;br /&gt;
|14.31&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; | MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 12 H 2 tH 2 n 8 run&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:center&amp;quot; |&#039;&#039;&#039;Cumulative&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;460,916,384&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;33,860,069&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;92.70%&#039;&#039;&#039;&lt;br /&gt;
| ---&lt;br /&gt;
| ---&lt;br /&gt;
| ---&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot;   | ---&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Stage 2 ===&lt;br /&gt;
&lt;br /&gt;
Starting from the results of Stage 1, Terry Ligocki ran a variety of enumeration and decider codes. Some of these runs generated new TMs due to the BB(4,3) TNF tree not being fully generated at this time. These reduced the number of holdouts from ~33.9M TMs to ~9.4M TMs (a 72.2% reduction). The details are given in the table below, including links to the Google Drive with the holdouts, halting, and infinite TMs:&lt;br /&gt;
&lt;br /&gt;
(done to reduce column size:&lt;br /&gt;
&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;= % Reduced,&lt;br /&gt;
&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;= Compute Time (core-hours),&lt;br /&gt;
&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;= Decided,&lt;br /&gt;
&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;= Processed)&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: right&amp;quot;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |TMs/sec/core&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
!&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;&lt;br /&gt;
!&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|33,860,069&lt;br /&gt;
|21,065,769&lt;br /&gt;
|37.79%&lt;br /&gt;
|93.0&lt;br /&gt;
|38.20&lt;br /&gt;
|101.11&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |lr_enum_continue 4x3.in.txt 1000000 4x3.halt.txt 4x3.inf.txt 4x3.holdouts.txt 00 false&lt;br /&gt;
|rowspan=&amp;quot;20&amp;quot; style=&amp;quot;text-align:left&amp;quot; |[https://drive.google.com/drive/folders/1qNssnvK3W2jJ68VBq9FJZMy9TvwbQk4_?usp=drive_link Google Drive]&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|21,065,769&lt;br /&gt;
|18,949,009&lt;br /&gt;
|10.05%&lt;br /&gt;
|5,566.1&lt;br /&gt;
|0.11&lt;br /&gt;
|1.05&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Enumerate.py max-loops 100_000 block-size 2 --tape-limit 1_000 --no-steps --time 1.0 --recursive --exp-linear-rules --lin-steps 0 --no-ctl --no-reverse-engineer --infile 4x3.in.txt --outfile 4x3.out.pb&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|18,949,009&lt;br /&gt;
|18,138,027&lt;br /&gt;
|4.28%&lt;br /&gt;
|0.4&lt;br /&gt;
|511.59&lt;br /&gt;
|11953.46&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Reverse_Engineer_Filter.py --infile 4x3.in.txt --outfile 4x3.out.pb&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|18,138,027&lt;br /&gt;
|11,985,999&lt;br /&gt;
|33.92%&lt;br /&gt;
|4.8&lt;br /&gt;
|352.73&lt;br /&gt;
|1,039.95&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; | chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 100000 NG_n 3 run&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|11,985,999&lt;br /&gt;
|9,988,715&lt;br /&gt;
|16.66%&lt;br /&gt;
|640.4&lt;br /&gt;
|0.87&lt;br /&gt;
|5.20&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |&lt;br /&gt;
chr_LRUH 24 chr_H 16 MitM_CTL NG maxT 30000 NG_n 3 run &amp;lt;br/&amp;gt;&lt;br /&gt;
chr_LRUH 14 chr_H 2 MitM_CTL NG maxT 10000 NG_n 4 run &amp;lt;br/&amp;gt;&lt;br /&gt;
chr_LRUH 2 chr_H 2 MitM_CTL NG maxT 3000 NG_n 5 run &amp;lt;br/&amp;gt;&lt;br /&gt;
chr_asth 0 chr_LRUH 48 chr_H 48 MitM_CTL NG maxT 30000 NG_n 5 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 4 mod 2 n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 6 mod 3 n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 4 H 1 tH 1 n 4 run &amp;lt;br/&amp;gt;&lt;br /&gt;
chr_LRUH 14 chr_H 8 MitM_CTL NG maxT 10000 NG_n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 8 H 1 tH 0 n 6 run &amp;lt;br/&amp;gt;&lt;br /&gt;
chr_LRUH 8 chr_H 4 MitM_CTL NG maxT 30000 NG_n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 30000 NG_n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
chr_LRUH 18 chr_H 16 MitM_CTL NG maxT 30000 NG_n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 3 H 1 tH 0 n 3 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 100000 H 3 mod 3 n 1 run &amp;lt;br/&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|9,988,715&lt;br /&gt;
|9,401,447&lt;br /&gt;
|5.88%&lt;br /&gt;
|1,398.7&lt;br /&gt;
|0.12&lt;br /&gt;
|1.98&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |&lt;br /&gt;
chr_asth 0 chr_LRUH 60 chr_H 60 MitM_CTL NG maxT 100000 NG_n 5 run &amp;lt;br/&amp;gt;&lt;br /&gt;
chr_LRUH 22 chr_H 12 MitM_CTL NG maxT 100000 NG_n 6 run &amp;lt;br/&amp;gt;&lt;br /&gt;
chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 100000 NG_n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 16 H 1 tH 0 n 10 run &amp;lt;br/&amp;gt;&lt;br /&gt;
chr_LRUH 4 chr_H 0 MitM_CTL NG maxT 1000000 NG_n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 4 mod 6 n 1 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 6 mod 3 n 3 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 4 mod 2 n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 8 H 2 tH 2 n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 3 mod 2 n 3 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 4 mod 6 n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 4 mod 2 n 1 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 4 H 1 tH 1 n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 4 mod 5 n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:center&amp;quot; |&#039;&#039;&#039;Cumulative&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;33,860,069&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;9,401,447&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;72.23%&#039;&#039;&#039;&lt;br /&gt;
| ---&lt;br /&gt;
| ---&lt;br /&gt;
| ---&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot;   | ---&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==== Stage 3 ====&lt;br /&gt;
Starting from the results of Stage 2, Andrew Ducharme ran a variety of Ligocki and @mxdys deciders. Some of these runs generated new TMs due to the BB(4,3) TNF tree not being fully generated at this time. These reduced the number of holdouts from ~9.4M TMs to ~5.6M (a 40.0% reduction). The details are given in the table below, including links to the Google Drive with the holdouts, halting, and infinite TMs:&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: right&amp;quot;&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
! colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;&lt;br /&gt;
! colspan=&amp;quot;2&amp;quot; |TMs/sec/core&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
!&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;&lt;br /&gt;
!&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Andrew Ducharme&lt;br /&gt;
|9,401,447&lt;br /&gt;
|7,753,702&lt;br /&gt;
|17.53%&lt;br /&gt;
|988.7&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Enumerate.py -r --no-steps --exp-linear-rules --max-loops=100_000 --block-mult=3 --time=0.5 --lin-steps=0 --no-ctl&lt;br /&gt;
| rowspan=&amp;quot;29&amp;quot; style=&amp;quot;text-align:left&amp;quot; |[https://drive.google.com/drive/folders/11FYe0CVDPczcgt4put3vsdGbeMWkM1S1?usp=sharing Google Drive]&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Andrew Ducharme&lt;br /&gt;
|7,753,702&lt;br /&gt;
|7,409,705&lt;br /&gt;
|4.44%&lt;br /&gt;
|~500&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |lr_enum_continue 10000000 (10M steps)&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Andrew Ducharme&lt;br /&gt;
|7,409,705&lt;br /&gt;
|7,192,937&lt;br /&gt;
|2.93%&lt;br /&gt;
|1858.9&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Enumerate.py -r --no-steps --exp-linear-rules --max-loops=100_000 --block-mult=12 --time=1 --tape-limit=500 --lin-steps=0 --no-ctl&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Andrew Ducharme&lt;br /&gt;
|7,192,937&lt;br /&gt;
|6,711,936&lt;br /&gt;
|6.69%&lt;br /&gt;
|3.6&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; | FAR CPS_LRU maxT 100000 LRUH 2 H 0 tH 0 n 2&lt;br /&gt;
FAR CPS_LRU maxT 100000 LRUH 2 H 0 tH 0 n 4&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Andrew Ducharme&lt;br /&gt;
|6,711,936&lt;br /&gt;
|6,506,888&lt;br /&gt;
|3.05%&lt;br /&gt;
|~500&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |&lt;br /&gt;
FAR CPS_LRU maxT 100000 LRUH [1,2] remaining parameters&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Andrew Ducharme&lt;br /&gt;
|6,506,888&lt;br /&gt;
|6,298,166&lt;br /&gt;
|3.21%&lt;br /&gt;
|~2200&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |FAR CPS_LRU maxT 100000 LRUH [3,4]&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Andrew Ducharme&lt;br /&gt;
|6,298,166&lt;br /&gt;
|6,257,722&lt;br /&gt;
|0.64%&lt;br /&gt;
|~2000&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|FAR CPS_LRU maxT 100000 LRUH 5&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Andrew Ducharme&lt;br /&gt;
|6,257,722&lt;br /&gt;
|6,237,675&lt;br /&gt;
|0.32%&lt;br /&gt;
|~2400&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|FAR CPS_LRU maxT 100000 LRUH 6&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Andrew Ducharme&lt;br /&gt;
|6,237,675&lt;br /&gt;
|6,156,619&lt;br /&gt;
|1.30%&lt;br /&gt;
|1798.3&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|Enumerate.py -r --no-steps --exp-linear-rules --max-loops=250_000 --block-mult=1 --time=1 --tape-limit=1000 --max-steps-per-macro=100_000 --lin-steps=0 --no-ctl&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Andrew Ducharme&lt;br /&gt;
|6,156,619&lt;br /&gt;
|6,123,679&lt;br /&gt;
|0.54%&lt;br /&gt;
|1784.3&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|Enumerate.py -r --no-steps --exp-linear-rules --max-loops=250_000 --block-mult=5 --time=1 --tape-limit=1000 --max-steps-per-macro=100_000 --lin-steps=0 --no-ctl&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Andrew Ducharme&lt;br /&gt;
|6,123,679&lt;br /&gt;
|6,071,297&lt;br /&gt;
|0.86%&lt;br /&gt;
|~7500&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|FAR CPS_LRU maxT 100000 LRUH 12&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Andrew Ducharme&lt;br /&gt;
|6,071,297&lt;br /&gt;
|5,913,070&lt;br /&gt;
|2.61%&lt;br /&gt;
|~25000&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|FAR CPS_LRU maxT 1000000 LRUH [1,2]&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Andrew Ducharme&lt;br /&gt;
|5,913,070&lt;br /&gt;
|5,718,346&lt;br /&gt;
|3.29%&lt;br /&gt;
|15790.2&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|Enumerate.py -r --no-steps --exp-linear-rules --max-loops=1_000_000 --block-mult=8 --time=10 --tape-limit=5000 --max-steps-per-macro=1_000_000 --lin-steps=0 --no-ctl&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Andrew Ducharme&lt;br /&gt;
|5,718,346&lt;br /&gt;
|5,641,006&lt;br /&gt;
|1.35%&lt;br /&gt;
|15989.4&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|Enumerate.py -r --no-steps --exp-linear-rules --max-loops=10_000_000 --block-mult=3 --time=10 --tape-limit=5000 --max-steps-per-macro=1_000_000 --lin-steps=0 --no-ctl&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Andrew Ducharme&lt;br /&gt;
|5,641,006&lt;br /&gt;
|5,127,263&lt;br /&gt;
|9.11%&lt;br /&gt;
|94.3&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|Inductive decider maxT 1000 --exploop&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:center&amp;quot; |&#039;&#039;&#039;Cumulative&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;9,401,447&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;5,127,263&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;45.46%&#039;&#039;&#039;&lt;br /&gt;
| ---&lt;br /&gt;
| ---&lt;br /&gt;
| ---&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; | ---&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&lt;br /&gt;
[[Category:BB Domains]][[Category:BB(4,3)]]&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=BB(4,3)&amp;diff=7549</id>
		<title>BB(4,3)</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=BB(4,3)&amp;diff=7549"/>
		<updated>2026-05-16T16:10:10Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: /* Stage 3 */ attempt fix text align&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The Busy Beaver problem for 4 states and 3 symbols is unsolved. The existence of [[Cryptids]] in the domain is given by the discovery of [[Bigfoot]] in [[BB(3,3)]]. The current [[Champions#3-Symbol TMs|champion]] is {{TM|1RB1RD1LC_2LB1RB1LC_1RZ1LA1LD_0RB2RA2RD|halt}} which was discovered by Pavel Kropitz in May 2024 along with 6 other long running machines. It was [[User:Polygon/Page for analyses#1RB1RD1LC 2LB1RB1LC 1RZ1LA1LD 0RB2RA2RD (bbch)|analyzed by Polygon]] in Oct 2025, demonstrating the lower bounds:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math display=&amp;quot;block&amp;quot;&amp;gt;S(4,3) &amp;gt; \Sigma(4,3) &amp;gt; 10 \uparrow^{4} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Top Halters ==&lt;br /&gt;
The longest running halting BB(4,3) TMs are split amongst two classes: the pentational and hexational TMs found by Pavel Kropitz outlined in the Potential Champions section, and the tetrational TMs found by comprehensive holdout filtering by Terry Ligocki. The scores are given using [[wikipedia:Knuth&#039;s_up-arrow_notation|Knuth&#039;s up-arrow notation]] with an extension to decimal tetration&amp;lt;ref&amp;gt;Shawn Ligocki. 2022. [https://www.sligocki.com/2022/06/25/ext-up-notation.html &amp;quot;Extending Up-arrow Notation&amp;quot;]&amp;lt;/ref&amp;gt;. The longest running halters found by Pavel Kropitz are:&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
!Standard format&lt;br /&gt;
!Approximate sigma scores&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RD1LC_2LB1RB1LC_1RZ1LA1LD_0RB2RA2RD|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow^{4} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|0RB1RZ0RB_1RC1LB2LB_1LB2RD1LC_1RA2RC0LD|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow\uparrow\uparrow 2^{2^{32}}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LB0LB_2LC2LA0LA_2RD1LC1RZ_1RA2LD1RD|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;3 \uparrow\uparrow\uparrow 88574&amp;lt;/math&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
The top 20 scoring halting machines found by comprehensive search are:&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!Standard format&lt;br /&gt;
!Approximate sigma score&lt;br /&gt;
!Discoverer&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LD2LA_0RC1RZ0RA_1LD2LA0LC_2RD2RC0LD|halt}}&lt;br /&gt;
|~10 ↑↑ 1023.47221&lt;br /&gt;
|Andrew Ducharme&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LC1RD_1RC1LD0RA_2LA0RC1RB_0LB2LB1RZ|halt}} &lt;br /&gt;
|~10 ↑↑ 619.07737&lt;br /&gt;
|Andrew Ducharme&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ2RD_1LC0RD0RC_2LC1LA0RB_2RC0RC2RA|halt}}&lt;br /&gt;
|~10 ↑↑ 512.10945&lt;br /&gt;
|Andrew Ducharme&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ0RC_1RC1RA0LD_2RD2RB0RD_1LB2LD2RA|halt}}&lt;br /&gt;
|~10 ↑↑ 439.02781&lt;br /&gt;
|Andrew Ducharme&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LC1RD_1RC1LD0RA_2LA0RC1RB_0LB2LB1RZ|halt}}&lt;br /&gt;
|~10 ↑↑ 234.06408&lt;br /&gt;
|Andrew Ducharme&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LC1RC_1LA2RB1LB_1RC2LA0RD_2LB1RZ2LC|halt}}&lt;br /&gt;
|~10 ↑↑ 190.21359&lt;br /&gt;
|Terry Ligocki&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LA1RA_1LA0RC1LC_1LC2RB0LD_2RA1RZ2RC|halt}}&lt;br /&gt;
|~10 ↑↑ 190.21359&lt;br /&gt;
|Terry Ligocki&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LC1RA_2RC1LB2RD_1LD2LA0LB_0LA1RZ0LC|halt}}&lt;br /&gt;
|~10 ↑↑ 178.48320&lt;br /&gt;
|Andrew Ducharme&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LC1RA_1LA0RD2RB_2LD0RC2LD_2LA1RZ0RD|halt}}&lt;br /&gt;
|~10 ↑↑ 166.03664&lt;br /&gt;
|Terry Ligocki&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LC1RA_1LA0RD2RB_2LD2LA2LD_2LA1RZ0RD|halt}}&lt;br /&gt;
|~10 ↑↑ 166.03664&lt;br /&gt;
|Terry Ligocki&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LC1RA_1LA2LD2RB_2LD0RC2LD_2LA1RZ0RD|halt}}&lt;br /&gt;
|~10 ↑↑ 166.03664&lt;br /&gt;
|Terry Ligocki&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LC1RA_1LA2LD2RB_2LD2LA1LB_2LA1RZ0RD|halt}}&lt;br /&gt;
|~10 ↑↑ 166.03664&lt;br /&gt;
|Terry Ligocki&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LC1RA_1LA2LD2RB_2LD2LA2LD_2LA1RZ0RD|halt}}&lt;br /&gt;
|~10 ↑↑ 166.03664&lt;br /&gt;
|Terry Ligocki&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LD0RC_2LC0RB1RA_1RA0LB1RD_0LA2LA1RZ|halt}}&lt;br /&gt;
|~10 ↑↑ 158.81916&lt;br /&gt;
|Andrew Ducharme&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RC1RB_1LC0RA2LD_2RA0LD1RZ_0LB2LD1RD|halt}}&lt;br /&gt;
|~10 ↑↑ 154.52968&lt;br /&gt;
|Andrew Ducharme&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LA1RD_2LA0LC2LD_1RZ2RA2LB_0LC2RC1RA|halt}}&lt;br /&gt;
|~10 ↑↑ 147.26175&lt;br /&gt;
|Andrew Ducharme&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0RB1LC_2LC0LD1RA_2RB2LD1RZ_2LA2LB0LD|halt}}&lt;br /&gt;
|~10 ↑↑ 141.44248&lt;br /&gt;
|Andrew Ducharme&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0RC2LB_2LC2RD1LC_1RC0LC1LB_1RZ1RA1RA|halt}}&lt;br /&gt;
|~10 ↑↑ 139.06217&lt;br /&gt;
|Andrew Ducharme&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0RC2LB_2LC2RD1LC_1RC0LC1LB_1RZ2LD1RA|halt}}&lt;br /&gt;
|~10 ↑↑ 139.06217&lt;br /&gt;
|Andrew Ducharme&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0RC1LB_2LC2RD1LC_1RC0LC1LB_1RZ1RA---|halt}}&lt;br /&gt;
|~10 ↑↑ 139.06217&lt;br /&gt;
|Andrew Ducharme&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Potential Champions ==&lt;br /&gt;
In May 2024, [https://discord.com/channels/960643023006490684/1026577255754903572/1243253180297646120 Pavel Kropitz found 7 halting TMs] that run for a large number of steps. Four of these are equivalent and were [https://discord.com/channels/960643023006490684/1331570843829932063/1337228898068463718 analyzed by Racheline] in February 2025, while the remaining three were [[User:Polygon/Page for analyses|analyzed by Polygon in October 2025.]]&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
!Standard format&lt;br /&gt;
!Approximate sigma scores&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RD1LC_2LB1RB1LC_1RZ1LA1LD_0RB2RA2RD|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow^{4} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|0RB1RZ0RB_1RC1LB2LB_1LB2RD1LC_1RA2RC0LD|halt}}*&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow\uparrow\uparrow 2^{2^{32}}&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LB0LB_2LC2LA0LA_2RD1LC1RZ_1RA2LD1RD|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;3 \uparrow\uparrow\uparrow 88574&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RD1LC_2LB1RB1LC_1RZ1LA1LD_2RB2RA2RD|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow 9.873987&amp;lt;/math&amp;gt;&lt;br /&gt;
|}&lt;br /&gt;
&amp;lt;nowiki&amp;gt;*&amp;lt;/nowiki&amp;gt;equivalent to {{TM|0RB1RZ1RC_1RC1LB2LB_1LB2RD1LC_1RA2RC0LD|halt}}, {{TM|1RB1LA2LA_1LA2RC1LB_1RD2RB0LC_0RA1RZ0RA|halt}} and {{TM|1RB1LA2LA_1LA2RC1LB_1RD2RB0LC_0RA1RZ1RB|halt}}.&lt;br /&gt;
&lt;br /&gt;
== Phase 1 ==&lt;br /&gt;
The initial phase of enumeration and reduction of [[holdouts]] took place in December 2024 and was done by Terry Ligocki using the Ligockis&#039; C++ and Python codes. The initial enumerations generated ~633B(illion) TMs of which ~34.4B TMs were holdouts. Also found were ~206B halting TMs and ~392B infinite TMs. The number of holdouts was reduced to ~461M TMs (a 99.93% reduction).&lt;br /&gt;
&lt;br /&gt;
Two C++ programs were run before the filters in the table.&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
lr_enum 4 3 8 /dev/null /dev/null 4x3.unk.txt false&lt;br /&gt;
00 &amp;lt;= XX &amp;lt; 47: lr_enum_continue 4x3.in.XX 1000 /dev/null /dev/null 4x3.unk.txt.XX XX false&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Both do the initial enumeration and simple filtering. The &amp;quot;/dev/null&amp;quot; in both commands would be files where the halting and infinite TMs would be stored. The first command generates the TMs from a [[TNF]] tree for BB(4,3) of depth 8 and outputs the holdouts to 4x3.unk.txt. This file was then divided into 48 pieces, 4x3.in.XX, 0 &amp;lt;= XX &amp;lt; 47. The second commands (one for each XX) continues the enumeration by running each TM for 1,000 steps. It classifies each as halting, infinite, or unknown/holdout. Again, the halting and infinite TMs are &amp;quot;written&amp;quot; to /dev/null, i.e., they aren&#039;t saved. The holdouts are stored in 48 files: 4x3.unk.txt.XX.&lt;br /&gt;
&lt;br /&gt;
For these runs the first command generated a total of ~45M TMs: ~1.86M halting, ~774K infinite, and ~42.0M holdouts. The second took the ~42.0M holdout TMs and generated a total of ~633B TMs: ~206B halting, ~392B infinite, and ~34.4B holdouts. These holdouts were used as a starting point of the filters below.&lt;br /&gt;
&lt;br /&gt;
The &amp;quot;Description&amp;quot; column in the table below contain the command run. Two options are not given, &amp;quot;--infile=...&amp;quot; and an &amp;quot;--outfile=...&amp;quot;. These are necessary and specify where to read and write the results, respectively. Note: The work flow was to divide the input holdouts into 48 pieces, run the command on each piece simultaneously on one of 48 cores, and then combine the 48 results into a group of holdouts.&lt;br /&gt;
&lt;br /&gt;
The details are given in this table:&lt;br /&gt;
&lt;br /&gt;
(done to reduce column size:&lt;br /&gt;
&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;= % Reduced,&lt;br /&gt;
&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;= Runtime (hours),&lt;br /&gt;
&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;= Decided,&lt;br /&gt;
&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;= Processed)&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: right&amp;quot;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |TMs/sec/core&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
!&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;&lt;br /&gt;
!&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|34,413,860,527&lt;br /&gt;
|30,874,934,791&lt;br /&gt;
|10.28%&lt;br /&gt;
|646.6&lt;br /&gt;
|1,520.36&lt;br /&gt;
|14,784.57&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Reverse_Engineer_Filter.py&lt;br /&gt;
|rowspan=&amp;quot;10&amp;quot; style=&amp;quot;text-align:left&amp;quot; |[https://drive.google.com/drive/folders/1KMOVgngtUVMEA7EjxtNcsgksQ5Y4tby9?usp=drive_link Google Drive]&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|30,874,934,791&lt;br /&gt;
|12,942,386,396&lt;br /&gt;
|58.08%&lt;br /&gt;
|4,134.8&lt;br /&gt;
|1,204.72&lt;br /&gt;
|2,074.19&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=1&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|12,942,386,396&lt;br /&gt;
|4,534,322,415&lt;br /&gt;
|64.97%&lt;br /&gt;
|3,361.1&lt;br /&gt;
|694.88&lt;br /&gt;
|1,069.62&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=2&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|4,534,322,415&lt;br /&gt;
|2,959,598,830&lt;br /&gt;
|34.73%&lt;br /&gt;
|3,318.1&lt;br /&gt;
|131.83&lt;br /&gt;
|379.59&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=3&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|2,959,598,830&lt;br /&gt;
|1,651,940,618&lt;br /&gt;
|44.18%&lt;br /&gt;
|2,700.6&lt;br /&gt;
|134.50&lt;br /&gt;
|304.42&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Enumerate.py --max-loops=1_000 --block-size=2 --no-steps --time=0.002 --lin-steps=0 --no-reverse-engineer --save-freq=10_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|1,651,940,618&lt;br /&gt;
|854,984,279&lt;br /&gt;
|48.24%&lt;br /&gt;
|2,276.3&lt;br /&gt;
|97.25&lt;br /&gt;
|201.59&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Enumerate.py --max-loops=10_000 --block-size=12 --no-steps --time=0.005 --lin-steps=0 --no-ctl --no-reverse-engineer --save-freq=10_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|854,984,279&lt;br /&gt;
|683,163,325&lt;br /&gt;
|20.10%&lt;br /&gt;
|430.1&lt;br /&gt;
|110.96&lt;br /&gt;
|552.15&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=4 --max-steps=1_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|683,163,325&lt;br /&gt;
|460,916,384&lt;br /&gt;
|32.53%&lt;br /&gt;
|5,507.9&lt;br /&gt;
|11.21&lt;br /&gt;
|34.45&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --min-block-size=1 --max-block-size=6  --max-steps=10_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:center&amp;quot; |&#039;&#039;&#039;Cumulative&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;632,656,365,801&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;460,916,384&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;99.93%&#039;&#039;&#039;&lt;br /&gt;
| ---&lt;br /&gt;
| ---&lt;br /&gt;
| ---&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot;   | ---&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 2 ==&lt;br /&gt;
&lt;br /&gt;
When Phase 1 was completed, a set of deciders/parameters were run to reduce the number of holdout TMs. The details are given in the various Stages below.&lt;br /&gt;
&lt;br /&gt;
=== Stage 1 ===&lt;br /&gt;
&lt;br /&gt;
Starting from the results of Phase 1, Terry Ligocki ran @mxdys&#039; C++ code, &amp;quot;main.exe&amp;quot;, using a variety of its deciders with various parameters. A total of 33 variations were run. The holdouts were reduced from ~461B TMs to ~33.9M TMs (a 92.7% reduction). The details are given in the table below, including links to the Google Drive with the holdouts. Entries with multiple lines represent runs where all the commands in the &amp;quot;Description&amp;quot; were applied during one run.&lt;br /&gt;
&lt;br /&gt;
(done to reduce column size:&lt;br /&gt;
&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;= % Reduced,&lt;br /&gt;
&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;= Compute Time (core-hours),&lt;br /&gt;
&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;= Decided,&lt;br /&gt;
&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;= Processed)&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: right&amp;quot;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |TMs/sec/core&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
!&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;&lt;br /&gt;
!&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|460,916,384&lt;br /&gt;
|234,834,703&lt;br /&gt;
|49.05%&lt;br /&gt;
|96.7&lt;br /&gt;
|649.48&lt;br /&gt;
|1,324.10&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; | chr_LRUH 4 chr_H 2 MitM_CTL NG maxT 1000 NG_n 2 run&lt;br /&gt;
|rowspan=&amp;quot;20&amp;quot; style=&amp;quot;text-align:left&amp;quot; |[https://drive.google.com/drive/folders/1tFtg1eFC-AdqCzh7XNmx5O2mTQwtaNbm?usp=drive_link Google Drive]&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|234,834,703&lt;br /&gt;
|160,518,206&lt;br /&gt;
|31.65%&lt;br /&gt;
|70.9&lt;br /&gt;
|291.33&lt;br /&gt;
|920.57&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; | chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 1000 NG_n 2 run&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|160,518,206&lt;br /&gt;
|132,296,033&lt;br /&gt;
|17.58%&lt;br /&gt;
|41.5&lt;br /&gt;
|188.86&lt;br /&gt;
|1,074.17&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; | MitM_CTL RWL_mod sim 1001 maxT 1000 H 4 mod 6 n 1 run&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|132,296,033&lt;br /&gt;
|113,193,595&lt;br /&gt;
|14.44%&lt;br /&gt;
|54.9&lt;br /&gt;
|96.57&lt;br /&gt;
|668.77&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; | MitM_CTL RWL_mod sim 1001 maxT 1000 H 4 mod 1 n 6 run&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|113,193,595&lt;br /&gt;
|85,920,795&lt;br /&gt;
|24.09%&lt;br /&gt;
|106.8&lt;br /&gt;
|70.96&lt;br /&gt;
|294.52&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; | chr_LRUH 16 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|85,920,795&lt;br /&gt;
|78,674,774&lt;br /&gt;
|8.43%&lt;br /&gt;
|28.9&lt;br /&gt;
|69.62&lt;br /&gt;
|825.51&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; | MitM_CTL RWL_mod sim 1001 maxT 1000 H 8 mod 2 n 2 run&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|78,674,774&lt;br /&gt;
|73,228,547&lt;br /&gt;
|6.92%&lt;br /&gt;
|68.7&lt;br /&gt;
|22.02&lt;br /&gt;
|318.04&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; | MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 8 H 1 tH 1 n 4 run&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|73,228,547&lt;br /&gt;
|67,014,897&lt;br /&gt;
|8.49%&lt;br /&gt;
|23.2&lt;br /&gt;
|74.50&lt;br /&gt;
|878.02&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; | chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 30000 NG_n 1 run&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|67,014,897&lt;br /&gt;
|57,625,231&lt;br /&gt;
|14.01%&lt;br /&gt;
|75.6&lt;br /&gt;
|34.49&lt;br /&gt;
|246.13&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; | MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 2 n 6 run&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|57,625,231&lt;br /&gt;
|48,070,606&lt;br /&gt;
|16.58%&lt;br /&gt;
|645.4&lt;br /&gt;
|4.11&lt;br /&gt;
|24.80&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; | chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 30000 NG_n 10 run&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|48,070,606&lt;br /&gt;
|44,254,286&lt;br /&gt;
|7.94%&lt;br /&gt;
|166.3&lt;br /&gt;
|6.38&lt;br /&gt;
|80.31&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; | MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 6 H 1 tH 1 n 12 run&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|44,254,286&lt;br /&gt;
|40,836,159&lt;br /&gt;
|7.72%&lt;br /&gt;
|188.3&lt;br /&gt;
|5.04&lt;br /&gt;
|65.29&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; | MitM_CTL RWL_mod sim 1001 maxT 100000 H 3 mod 1 n 2 run&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|40,836,159&lt;br /&gt;
|37,460,692&lt;br /&gt;
|8.27%&lt;br /&gt;
|192.3&lt;br /&gt;
|4.88&lt;br /&gt;
|58.99&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |&lt;br /&gt;
chr_LRUH 8 chr_H 8 MitM_CTL NG maxT 10000 NG_n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
chr_LRUH 6 chr_H 6 MitM_CTL NG maxT 3000 NG_n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 100000 H 2 mod 2 n 1 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 6 H 0 tH 1 n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 6 mod 3 n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
chr_LRUH 6 chr_H 4 MitM_CTL NG maxT 3000 NG_n 1 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 4 H 1 tH 1 n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
chr_LRUH 8 chr_H 8 MitM_CTL NG maxT 10000 NG_n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
chr_LRUH 6 chr_H 6 MitM_CTL NG maxT 3000 NG_n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 3 n 1 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 8 mod 2 n 1 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 100000 H 3 mod 2 n 1 run &amp;lt;br/&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|37,460,692&lt;br /&gt;
|36,167,570&lt;br /&gt;
|3.45%&lt;br /&gt;
|237.7&lt;br /&gt;
|1.51&lt;br /&gt;
|43.77&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 3 H 0 tH 1 n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 10000 NG_n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
chr_LRUH 14 chr_H 12 MitM_CTL NG maxT 10000 NG_n 4 run &amp;lt;br/&amp;gt;&lt;br /&gt;
chr_LRUH 6 chr_H 6 MitM_CTL NG maxT 30000 NG_n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
chr_LRUH 10 chr_H 8 MitM_CTL NG maxT 10000 NG_n 4 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 6 mod 2 n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|36,167,570&lt;br /&gt;
|34,642,544&lt;br /&gt;
|4.22%&lt;br /&gt;
|467.2&lt;br /&gt;
|0.91&lt;br /&gt;
|21.50&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; | MitM_CTL RWL_mod sim 1001 maxT 30000 H 3 mod 2 n 24 run&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|34,642,544&lt;br /&gt;
|34,339,943&lt;br /&gt;
|0.87%&lt;br /&gt;
|383.1&lt;br /&gt;
|0.22&lt;br /&gt;
|25.12&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; | MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 8 H 1 tH 0 n 24 run&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|34,339,943&lt;br /&gt;
|33,860,069&lt;br /&gt;
|1.40%&lt;br /&gt;
|666.5&lt;br /&gt;
|0.20&lt;br /&gt;
|14.31&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; | MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 12 H 2 tH 2 n 8 run&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:center&amp;quot; |&#039;&#039;&#039;Cumulative&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;460,916,384&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;33,860,069&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;92.70%&#039;&#039;&#039;&lt;br /&gt;
| ---&lt;br /&gt;
| ---&lt;br /&gt;
| ---&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot;   | ---&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
=== Stage 2 ===&lt;br /&gt;
&lt;br /&gt;
Starting from the results of Stage 1, Terry Ligocki ran a variety of enumeration and decider codes. Some of these runs generated new TMs due to the BB(4,3) TNF tree not being fully generated at this time. These reduced the number of holdouts from ~33.9M TMs to ~9.4M TMs (a 72.2% reduction). The details are given in the table below, including links to the Google Drive with the holdouts, halting, and infinite TMs:&lt;br /&gt;
&lt;br /&gt;
(done to reduce column size:&lt;br /&gt;
&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;= % Reduced,&lt;br /&gt;
&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;= Compute Time (core-hours),&lt;br /&gt;
&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;= Decided,&lt;br /&gt;
&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;= Processed)&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: right&amp;quot;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |TMs/sec/core&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
!&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;&lt;br /&gt;
!&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|33,860,069&lt;br /&gt;
|21,065,769&lt;br /&gt;
|37.79%&lt;br /&gt;
|93.0&lt;br /&gt;
|38.20&lt;br /&gt;
|101.11&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |lr_enum_continue 4x3.in.txt 1000000 4x3.halt.txt 4x3.inf.txt 4x3.holdouts.txt 00 false&lt;br /&gt;
|rowspan=&amp;quot;20&amp;quot; style=&amp;quot;text-align:left&amp;quot; |[https://drive.google.com/drive/folders/1qNssnvK3W2jJ68VBq9FJZMy9TvwbQk4_?usp=drive_link Google Drive]&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|21,065,769&lt;br /&gt;
|18,949,009&lt;br /&gt;
|10.05%&lt;br /&gt;
|5,566.1&lt;br /&gt;
|0.11&lt;br /&gt;
|1.05&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Enumerate.py max-loops 100_000 block-size 2 --tape-limit 1_000 --no-steps --time 1.0 --recursive --exp-linear-rules --lin-steps 0 --no-ctl --no-reverse-engineer --infile 4x3.in.txt --outfile 4x3.out.pb&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|18,949,009&lt;br /&gt;
|18,138,027&lt;br /&gt;
|4.28%&lt;br /&gt;
|0.4&lt;br /&gt;
|511.59&lt;br /&gt;
|11953.46&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Reverse_Engineer_Filter.py --infile 4x3.in.txt --outfile 4x3.out.pb&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|18,138,027&lt;br /&gt;
|11,985,999&lt;br /&gt;
|33.92%&lt;br /&gt;
|4.8&lt;br /&gt;
|352.73&lt;br /&gt;
|1,039.95&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; | chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 100000 NG_n 3 run&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|11,985,999&lt;br /&gt;
|9,988,715&lt;br /&gt;
|16.66%&lt;br /&gt;
|640.4&lt;br /&gt;
|0.87&lt;br /&gt;
|5.20&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |&lt;br /&gt;
chr_LRUH 24 chr_H 16 MitM_CTL NG maxT 30000 NG_n 3 run &amp;lt;br/&amp;gt;&lt;br /&gt;
chr_LRUH 14 chr_H 2 MitM_CTL NG maxT 10000 NG_n 4 run &amp;lt;br/&amp;gt;&lt;br /&gt;
chr_LRUH 2 chr_H 2 MitM_CTL NG maxT 3000 NG_n 5 run &amp;lt;br/&amp;gt;&lt;br /&gt;
chr_asth 0 chr_LRUH 48 chr_H 48 MitM_CTL NG maxT 30000 NG_n 5 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 4 mod 2 n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 6 mod 3 n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 4 H 1 tH 1 n 4 run &amp;lt;br/&amp;gt;&lt;br /&gt;
chr_LRUH 14 chr_H 8 MitM_CTL NG maxT 10000 NG_n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 8 H 1 tH 0 n 6 run &amp;lt;br/&amp;gt;&lt;br /&gt;
chr_LRUH 8 chr_H 4 MitM_CTL NG maxT 30000 NG_n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 30000 NG_n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
chr_LRUH 18 chr_H 16 MitM_CTL NG maxT 30000 NG_n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 3 H 1 tH 0 n 3 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 100000 H 3 mod 3 n 1 run &amp;lt;br/&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|9,988,715&lt;br /&gt;
|9,401,447&lt;br /&gt;
|5.88%&lt;br /&gt;
|1,398.7&lt;br /&gt;
|0.12&lt;br /&gt;
|1.98&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |&lt;br /&gt;
chr_asth 0 chr_LRUH 60 chr_H 60 MitM_CTL NG maxT 100000 NG_n 5 run &amp;lt;br/&amp;gt;&lt;br /&gt;
chr_LRUH 22 chr_H 12 MitM_CTL NG maxT 100000 NG_n 6 run &amp;lt;br/&amp;gt;&lt;br /&gt;
chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 100000 NG_n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 16 H 1 tH 0 n 10 run &amp;lt;br/&amp;gt;&lt;br /&gt;
chr_LRUH 4 chr_H 0 MitM_CTL NG maxT 1000000 NG_n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 4 mod 6 n 1 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 6 mod 3 n 3 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 4 mod 2 n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 8 H 2 tH 2 n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 3 mod 2 n 3 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 4 mod 6 n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 4 mod 2 n 1 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 4 H 1 tH 1 n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 4 mod 5 n 2 run &amp;lt;br/&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:center&amp;quot; |&#039;&#039;&#039;Cumulative&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;33,860,069&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;9,401,447&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;72.23%&#039;&#039;&#039;&lt;br /&gt;
| ---&lt;br /&gt;
| ---&lt;br /&gt;
| ---&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot;   | ---&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==== Stage 3 ====&lt;br /&gt;
Starting from the results of Stage 2, Andrew Ducharme ran a variety of Ligocki and @mxdys deciders. Some of these runs generated new TMs due to the BB(4,3) TNF tree not being fully generated at this time. These reduced the number of holdouts from ~9.4M TMs to ~5.6M (a 40.0% reduction). The details are given in the table below, including links to the Google Drive with the holdouts, halting, and infinite TMs:&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: right&amp;quot;&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
! colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;&lt;br /&gt;
! colspan=&amp;quot;2&amp;quot; |TMs/sec/core&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
!&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;&lt;br /&gt;
!&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Andrew Ducharme&lt;br /&gt;
|9,401,447&lt;br /&gt;
|7,753,702&lt;br /&gt;
|17.53%&lt;br /&gt;
|988.7&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Enumerate.py -r --no-steps --exp-linear-rules --max-loops=100_000 --block-mult=3 --time=0.5 --lin-steps=0 --no-ctl&lt;br /&gt;
| rowspan=&amp;quot;29&amp;quot; style=&amp;quot;text-align:left&amp;quot; |[https://drive.google.com/drive/folders/11FYe0CVDPczcgt4put3vsdGbeMWkM1S1?usp=sharing Google Drive]&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Andrew Ducharme&lt;br /&gt;
|7,753,702&lt;br /&gt;
|7,409,705&lt;br /&gt;
|4.44%&lt;br /&gt;
|~500&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |lr_enum_continue 10000000 (10M steps)&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Andrew Ducharme&lt;br /&gt;
|7,409,705&lt;br /&gt;
|7,192,937&lt;br /&gt;
|2.93%&lt;br /&gt;
|1858.9&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Enumerate.py -r --no-steps --exp-linear-rules --max-loops=100_000 --block-mult=12 --time=1 --tape-limit=500 --lin-steps=0 --no-ctl&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Andrew Ducharme&lt;br /&gt;
|7,192,937&lt;br /&gt;
|6,711,936&lt;br /&gt;
|6.69%&lt;br /&gt;
|3.6&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; | FAR CPS_LRU maxT 100000 LRUH 2 H 0 tH 0 n 2&lt;br /&gt;
FAR CPS_LRU maxT 100000 LRUH 2 H 0 tH 0 n 4&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Andrew Ducharme&lt;br /&gt;
|6,711,936&lt;br /&gt;
|6,506,888&lt;br /&gt;
|3.05%&lt;br /&gt;
|~500&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |&lt;br /&gt;
FAR CPS_LRU maxT 100000 LRUH [1,2] remaining parameters&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Andrew Ducharme&lt;br /&gt;
|6,506,888&lt;br /&gt;
|6,298,166&lt;br /&gt;
|3.21%&lt;br /&gt;
|~2200&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |FAR CPS_LRU maxT 100000 LRUH [3,4]&lt;br /&gt;
|-&lt;br /&gt;
|Andrew Ducharme&lt;br /&gt;
|6,298,166&lt;br /&gt;
|6,257,722&lt;br /&gt;
|0.64%&lt;br /&gt;
|~2000&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|FAR CPS_LRU maxT 100000 LRUH 5&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Andrew Ducharme&lt;br /&gt;
|6,257,722&lt;br /&gt;
|6,237,675&lt;br /&gt;
|0.32%&lt;br /&gt;
|~2400&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|FAR CPS_LRU maxT 100000 LRUH 6&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Andrew Ducharme&lt;br /&gt;
|6,237,675&lt;br /&gt;
|6,156,619&lt;br /&gt;
|1.30%&lt;br /&gt;
|1798.3&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|Enumerate.py -r --no-steps --exp-linear-rules --max-loops=250_000 --block-mult=1 --time=1 --tape-limit=1000 --max-steps-per-macro=100_000 --lin-steps=0 --no-ctl&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Andrew Ducharme&lt;br /&gt;
|6,156,619&lt;br /&gt;
|6,123,679&lt;br /&gt;
|0.54%&lt;br /&gt;
|1784.3&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|Enumerate.py -r --no-steps --exp-linear-rules --max-loops=250_000 --block-mult=5 --time=1 --tape-limit=1000 --max-steps-per-macro=100_000 --lin-steps=0 --no-ctl&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Andrew Ducharme&lt;br /&gt;
|6,123,679&lt;br /&gt;
|6,071,297&lt;br /&gt;
|0.86%&lt;br /&gt;
|~7500&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|FAR CPS_LRU maxT 100000 LRUH 12&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Andrew Ducharme&lt;br /&gt;
|6,071,297&lt;br /&gt;
|5,913,070&lt;br /&gt;
|2.61%&lt;br /&gt;
|~25000&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|FAR CPS_LRU maxT 1000000 LRUH [1,2]&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Andrew Ducharme&lt;br /&gt;
|5,913,070&lt;br /&gt;
|5,718,346&lt;br /&gt;
|3.29%&lt;br /&gt;
|15790.2&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|Enumerate.py -r --no-steps --exp-linear-rules --max-loops=1_000_000 --block-mult=8 --time=10 --tape-limit=5000 --max-steps-per-macro=1_000_000 --lin-steps=0 --no-ctl&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Andrew Ducharme&lt;br /&gt;
|5,718,346&lt;br /&gt;
|5,641,006&lt;br /&gt;
|1.35%&lt;br /&gt;
|15989.4&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|Enumerate.py -r --no-steps --exp-linear-rules --max-loops=10_000_000 --block-mult=3 --time=10 --tape-limit=5000 --max-steps-per-macro=1_000_000 --lin-steps=0 --no-ctl&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Andrew Ducharme&lt;br /&gt;
|5,641,006&lt;br /&gt;
|5,127,263&lt;br /&gt;
|9.11%&lt;br /&gt;
|94.3&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|Inductive decider maxT 1000 --exploop&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:center&amp;quot; |&#039;&#039;&#039;Cumulative&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;9,401,447&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;5,127,263&#039;&#039;&#039;&lt;br /&gt;
|&#039;&#039;&#039;45.46%&#039;&#039;&#039;&lt;br /&gt;
| ---&lt;br /&gt;
| ---&lt;br /&gt;
| ---&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; | ---&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&lt;br /&gt;
[[Category:BB Domains]][[Category:BB(4,3)]]&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=User:XnoobSpeakable&amp;diff=7548</id>
		<title>User:XnoobSpeakable</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=User:XnoobSpeakable&amp;diff=7548"/>
		<updated>2026-05-16T13:54:32Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Hi, I&#039;m XnoobSpeakable, currently known as Xnoob545 on most platforms&lt;br /&gt;
&lt;br /&gt;
Contact me at @Xnoob545 on Discord.&lt;br /&gt;
&lt;br /&gt;
List of all user pages:&lt;br /&gt;
&lt;br /&gt;
[[User:XnoobSpeakable/Holdouts-temp]]&lt;br /&gt;
&lt;br /&gt;
[[User:XnoobSpeakable/Xnoobs-testing-page]]&lt;br /&gt;
&lt;br /&gt;
The main domain I work on is [[BB(3,4)]]&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=User:XnoobSpeakable&amp;diff=7547</id>
		<title>User:XnoobSpeakable</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=User:XnoobSpeakable&amp;diff=7547"/>
		<updated>2026-05-16T13:06:00Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Hi, I&#039;m XnoobSpeakable, currently known as Xnoob545 on most platforms&lt;br /&gt;
&lt;br /&gt;
Contact me at @Xnoob545 on Discord.&lt;br /&gt;
&lt;br /&gt;
List of all user pages:&lt;br /&gt;
&lt;br /&gt;
[[User:XnoobSpeakable/Holdouts-temp]]&lt;br /&gt;
&lt;br /&gt;
[[User:XnoobSpeakable/Xnoobs-testing-page]]&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=BB(3,4)&amp;diff=7515</id>
		<title>BB(3,4)</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=BB(3,4)&amp;diff=7515"/>
		<updated>2026-05-11T19:06:39Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: /* Phase 3 */ fix sigfigs consistancy&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The Busy Beaver problem for 3 states and 4 symbols is unsolved, with the existence of [[Cryptids]] in the domain being given by the discovery of [[Bigfoot]] in [[BB(3,3)]]. The current BB(3,4) [[Champions#3-Symbol TMs|champion]] is {{TM|1RB3LB1RZ2RA_2LC3RB1LC2RA_3RB1LB3LC2RC|halt}}. It runs for &amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt; steps before halting. It was discovered by Pavel Kropitz in 2024 and was analysed by Shawn Ligocki in the same year.&lt;br /&gt;
&lt;br /&gt;
== Top Halters ==&lt;br /&gt;
The top 20 known longest running halting BB(3,4) TMs are:&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!Standard format&lt;br /&gt;
!(approximate) runtime&lt;br /&gt;
!Discoverer&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LB1RZ2RA_2LC3RB1LC2RA_3RB1LB3LC2RC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ1LA2RB_1RC3RC1LA2LB_2LB2RC1LC3RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{12} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3RB1LC2LA_2LA2RB1LB3RA_3LA1RZ1LC2RA}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{6} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3RB1LC2LA_2LA2RB1LB3RA_1RA1RZ1LC2RA}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{6} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LB1RZ3LA_0LC3RB3RC1LB_2RB2LA3RA1LC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {2\,048}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ1LA2RB_2RC3RC3LB2RA_2LB3RB3LC1LA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {189.05690}&amp;lt;/math&amp;gt;&lt;br /&gt;
|[[User:XnoobSpeakable|XnoobSpeakable]] &lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LA1RA2LB_2LC1RA2RC3RB_1RZ1LA2RA3RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {188.16168}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LB2LA3LC_1LA2RB3RA1LB_1RZ1RB2LB3LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {188.16168}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA3LA3RB_2LC2RC1LB2RA_2RA2RB0LB1RZ|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {149.57147}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LB1RZ3LA_1LA3RC2LC1LC_2LA3RC0RA1LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LB1RZ3LA_1LA3RC3LB1LC_2RA3RC0RA1LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LC1RC2RA_1LA3RA2RB1RZ_3LB2LC1RA0LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|[[User:WarpedWartWars|Lúkos]]&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA1LB3RA_1RC3LB1LC1RC_2LA2RA1RZ0LA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {96.06390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA1LB3RA_1RC3LB1LC1RC_2LA2RA1RZ1RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {96.06390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LC0RA1RC_2LA1RZ3LA2RB_3LA0RA1LA0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {95.24590}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LC0RA1RC_2LA1RZ3LA2RB_3LA0RA3LB0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {95.24590}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LA1RA1RC_1LA3LC3RB1RC_3LA1RZ3LB2RC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {84.19957}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LB1RA2LB_2RC3LB3RB2LA_2LC1RZ1LA2RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {76.17604}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LA1RZ0LB_2LC2LB1RC1RB_3LA3LC0LC0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {74.18390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2RA1LA1LB_2RC3RB1RZ3LC_2LA1RC1RB0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {69.55341}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Lúkos&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 1 ==&lt;br /&gt;
The initial phase of enumeration and reduction of [[holdouts]] took place in December 2024 and was done by Terry Ligocki using the Ligockis&#039; C++ and Python codes. The initial enumerations generated 600,253,156,787 TMs of which 42,391,877,333 were holdout TMs. Also found were 202,014,400,019 halting TMs and 355,846,879,435 infinite TMs. The number of holdouts was reduced to 434,787,751 TMs (a 98.97% reduction).&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Phase 1 Info&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Two C++ programs were run before the filters in the table.&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
lr_enum 3 4 8 /dev/null /dev/null 3x4.unk.txt false&lt;br /&gt;
00 &amp;lt;= XX &amp;lt; 47: lr_enum_continue 3x4.in.XX 1000 /dev/null /dev/null 3x4.unk.txt.XX XX false&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Both do the initial enumeration and simple filtering. The &amp;quot;/dev/null&amp;quot; in both commands would be files where the halting and infinite TMs would be stored. The first command generates the TMs from a TNF tree for BB(3,4) of depth 8 and outputs the holdouts to 3x4.unk.txt. This file was then divided into 48 pieces, 3x4.in.XX, 0 &amp;lt;= XX &amp;lt; 47. The second commands (one for each XX) continues the enumeration by running each TM for 1,000 steps. It classifies each as halting, infinite, or unknown/holdout. Again, the halting and infinite TMs are &amp;quot;written&amp;quot; to /dev/null, i.e., they aren&#039;t saved. The holdouts are stored in 48 files: 3x4.unk.txt.XX.&lt;br /&gt;
&lt;br /&gt;
For these runs the first command generated a total of 22,366,747 TMs: 932,198 halting, 235,446 infinite, and 21,199,103 holdouts. The second took the 22,366,747 holdout TMs and generated a total of 600,253,156,787 TMs: 202,014,400,019 halting, 355,846,879,435 infinite, and 42,391,877,333 holdouts. These holdouts were used as a starting point of the filters below.&lt;br /&gt;
&lt;br /&gt;
The &amp;quot;Description&amp;quot; column in the table below contain the command run. Two options are not given, &amp;quot;--infile=...&amp;quot; and an &amp;quot;--outfile=...&amp;quot;. These are necessary and specify where to read and write the results, respectively. Note: The work flow was to divide the input holdouts into 48 pieces, run the command on each piece simultaneously on one of 48 cores, and then combine the 48 results into a group of holdouts.&lt;br /&gt;
&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The details are given in this table:&lt;br /&gt;
&lt;br /&gt;
(done to reduce column size:&lt;br /&gt;
&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;= % Reduced,&lt;br /&gt;
&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;= Runtime (hours),&lt;br /&gt;
&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;= Decided,&lt;br /&gt;
&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;= Processed)&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: right&amp;quot;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |TMs/sec/core&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
!&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;&lt;br /&gt;
!&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|42,391,877,333&lt;br /&gt;
|32,247,381,725&lt;br /&gt;
|23.93%&lt;br /&gt;
|788.0&lt;br /&gt;
|3,576.08&lt;br /&gt;
|14,943.74&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Reverse_Engineer_Filter.py&lt;br /&gt;
|rowspan=&amp;quot;8&amp;quot; style=&amp;quot;text-align:left&amp;quot; |[https://drive.google.com/drive/folders/1EsFw5DOjjZ6Xzjc8QgRa2YkInrsmFnLX?usp=drive_link Google Drive]&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|32,247,381,725&lt;br /&gt;
|12,789,441,316&lt;br /&gt;
|60.34%&lt;br /&gt;
|6,185.2&lt;br /&gt;
|873.85&lt;br /&gt;
|1,448.22&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=1&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|12,789,441,316&lt;br /&gt;
|4,332,283,583&lt;br /&gt;
|66.13%&lt;br /&gt;
|4,771.0&lt;br /&gt;
|492.39&lt;br /&gt;
|744.62&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=2&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|4,332,283,583&lt;br /&gt;
|2,796,143,404&lt;br /&gt;
|35.46%&lt;br /&gt;
|7,873.1&lt;br /&gt;
|54.20&lt;br /&gt;
|152.85&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=3&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|2,796,143,404&lt;br /&gt;
|1,398,734,288&lt;br /&gt;
|49.98%&lt;br /&gt;
|10,239.4&lt;br /&gt;
|37.91&lt;br /&gt;
|75.85&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Enumerate.py --max-loops=1_000 --block-size=2 --time=10 --lin-steps=0 --no-reverse-engineer --save-freq=10_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|1,398,734,288&lt;br /&gt;
|764,851,053&lt;br /&gt;
|45.32%&lt;br /&gt;
|3,203.1&lt;br /&gt;
|54.97&lt;br /&gt;
|121.30&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Enumerate.py --max-loops=10_000 --block-size=12 --no-steps --time=0.01 --lin-steps=0 --no-ctl --no-reverse-engineer --save-freq=10_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|764,851,053&lt;br /&gt;
|581,654,405&lt;br /&gt;
|23.95%&lt;br /&gt;
|1,925.3&lt;br /&gt;
|26.43&lt;br /&gt;
|110.35&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --min-block-size=4 --max-block-size=12 --max-steps=1_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|581,654,405&lt;br /&gt;
|434,787,751&lt;br /&gt;
|25.25%&lt;br /&gt;
|9,042.5&lt;br /&gt;
|4.51&lt;br /&gt;
|17.87&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --min-block-size=4 --max-block-size=6 --max-steps=10_000&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 2 ==&lt;br /&gt;
XnoobSpeakable and Lúkos worked on applying mxdys&#039; deciders/parameters to the remaining holdouts. The previous holdouts list by Terry Ligocki was split up into 8696 files containing 50,000 holdouts each* (*the last one actually has 37,751) and the deciders were applied to the files individually. These files can be called subtasks. Lúkos made a Python script to compute the subtasks in parallel, based off of XnoobSpeakable&#039;s earlier imperfect script.&lt;br /&gt;
&lt;br /&gt;
Certain data such as TMs/sec/core is unavailable, because the amount of time the computation took was not kept track of.&lt;br /&gt;
&lt;br /&gt;
Stages 3 and 8 are lr_enum_continue computations to 1 million and 10 million steps respectively. Lúkos did not contribute to computing these stages, but rather created a Python script to compute them in bulk, which XnoobSpeakable used.&lt;br /&gt;
&lt;br /&gt;
For the &amp;quot;Contribution&amp;quot; column, the first number is the amount of subtasks solved by XnoobSpeakable, the 2nd is the amount solved by Lúkos. Note that the counts are unequal, because Lúkos has a slower CPU with a lower core count. According to XnoobSpeakable, the time contribution from both contributors is roughly equal. Lúkos also worked on the Python scripts used, while XnoobSpeakable worked on compiling holdouts lists and finding optimal deciders to apply. &lt;br /&gt;
&lt;br /&gt;
[[User:Peacemaker II|Peacemaker II]] worked on verifying the validity of the results as well as providing solved TM counts per decider. Stages 1, 2, and 4 have been validated - no dropped TMs. XnoobSpeakable verified stage 6.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;nowiki&amp;gt;**&amp;lt;/nowiki&amp;gt;Stage 9: Uses two substages, rather than subtasks, applying Reverse-Engineer and Backtracking deciders.&lt;br /&gt;
&lt;br /&gt;
Stage 10 is also seperated into substages A, B, and C for ease of computation.&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1MamU8zivuqoe4j82vpb-jYBfc4wvXNRc All scripts used are available here.] The details will be given in this table:&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: left&amp;quot;&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
! colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |% Reduced&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Subtasks&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Contribution&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Verified&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |XnoobSpeakable, Lúkos&lt;br /&gt;
|434,787,751&lt;br /&gt;
|64,777,377&lt;br /&gt;
|85.1%&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Phase 2 stage 1&lt;br /&gt;
|8696&lt;br /&gt;
|7696 / 1000&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|64,777,377&lt;br /&gt;
|37,016,957&lt;br /&gt;
|42.9%&lt;br /&gt;
|Phase 2 stage 2&lt;br /&gt;
|1296&lt;br /&gt;
|1000 / 296&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|37,016,957&lt;br /&gt;
|26,266,261&lt;br /&gt;
|29.0%&lt;br /&gt;
|Phase 2 stage 3&lt;br /&gt;
|741&lt;br /&gt;
|741 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|26,266,261&lt;br /&gt;
|22,396,711&lt;br /&gt;
|14.7%&lt;br /&gt;
|Phase 2 stage 4&lt;br /&gt;
|526&lt;br /&gt;
|485 / 41&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|22,396,711&lt;br /&gt;
|17,983,810&lt;br /&gt;
|19.7%&lt;br /&gt;
|Phase 2 stage 5&lt;br /&gt;
|448&lt;br /&gt;
|390 / 58&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|17,983,810&lt;br /&gt;
|15,564,491&lt;br /&gt;
|13.5%&lt;br /&gt;
|Phase 2 stage 6&lt;br /&gt;
|360&lt;br /&gt;
|300 / 60&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|15,564,491&lt;br /&gt;
|15,136,283&lt;br /&gt;
|2.75%&lt;br /&gt;
|Phase 2 stage 7&lt;br /&gt;
|312&lt;br /&gt;
|260 / 52&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|15,136,283&lt;br /&gt;
|14,518,243&lt;br /&gt;
|4.08%&lt;br /&gt;
|Phase 2 stage 8&lt;br /&gt;
|303&lt;br /&gt;
|303 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|14,518,243&lt;br /&gt;
|14,413,460&lt;br /&gt;
|0.72%&lt;br /&gt;
|Phase 2 stage 9&lt;br /&gt;
|2**&lt;br /&gt;
|2 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|14,413,460&lt;br /&gt;
|13,733,388&lt;br /&gt;
|4.72%&lt;br /&gt;
|Phase 2 stage 10A&lt;br /&gt;
|289&lt;br /&gt;
|216 / 73&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|13,733,388&lt;br /&gt;
|13,334,244&lt;br /&gt;
|2.91%&lt;br /&gt;
|Phase 2 stage 10B&lt;br /&gt;
|275&lt;br /&gt;
|200 / 75&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|13,334,244&lt;br /&gt;
|12,435,284&lt;br /&gt;
|6.74%&lt;br /&gt;
|Phase 2 stage 10C&lt;br /&gt;
|267&lt;br /&gt;
|190 / 77&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 2 Data ==&lt;br /&gt;
Here we will list the deciders applied during the various stages of Phase 2. Each decider within a stage was not applied in a specific order. Some stages have a number of TMs solved by every decider at the end of each row, provided by Peacemaker II.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Details&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Phase 2 stage 1:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 1000 NG_n 2 run 86569103&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 1000 NG_n 1 run 26093656&lt;br /&gt;
chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 13972946&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 6 mod 3 n 2 run 7190617&lt;br /&gt;
chr_LRUH 10 chr_H 6 MitM_CTL NG maxT 1000 NG_n 2 run 90302784&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 1 n 4 run 4342619&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 12 H 0 tH 1 n 2 run 11764327&lt;br /&gt;
chr_LRUH 2 chr_H 2 MitM_CTL NG maxT 1000 NG_n 1 run 55465842&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 2 n 1 run 17805678&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 2 H 0 tH 0 n 1 run 12623067&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 3000 NG_n 2 run 2240499&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 4 H 1 tH 1 n 2 run 10223131&lt;br /&gt;
chr_LRUH 6 chr_H 4 MitM_CTL NG maxT 10000 NG_n 1 run 2901053&lt;br /&gt;
chr_LRUH 22 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 28515052&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 2:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 4 n 8 run 1030303&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 8 mod 2 n 2 run 1465523&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 10000 NG_n 4 run 5232902&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 1720994&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 8 mod 3 n 2 run 555883&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 3 H 1 tH 0 n 6 run 290547&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 1 run 67506&lt;br /&gt;
chr_LRUH 10 chr_H 8 MitM_CTL NG maxT 10000 NG_n 2 run 1577979&lt;br /&gt;
chr_LRUH 6 chr_H 6 MitM_CTL NG maxT 3000 NG_n 2 run 1604533&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 4 n 6 run 10012948&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 8 H 0 tH 0 n 4 run 526822&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 1 n 1 run 34821&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 6 H 0 tH 1 n 3 run 356375&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 20 run 1970422&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 6 mod 3 n 1 run 443339&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 3 H 0 tH 1 n 2 run 518824&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 2 mod 2 n 1 run 61865&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 1 tH 1 n 2 run 288834&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 3 (lr_enum_continue from [https://github.com/sligocki/busy-beaver busy-beaver] for 1 million steps):&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
lr_enum_continue ./in.txt 1000000 ./halt.txt ./inf.txt ./unknown.txt &amp;quot;&amp;quot; false&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 4:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 3000 NG_n 2 run 202520&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 3000 NG_n 1 run 559013&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 4 n 1 run 1584&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 10000 NG_n 1 run 148544&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 1 run 812666&lt;br /&gt;
chr_asth 0 chr_LRUH 48 chr_H 48 MitM_CTL NG maxT 10000 NG_n 3 run 2043171&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 4 mod 2 n 1 run 102052&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 5:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 0 tH 1 n 10 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 16 H 1 tH 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 6 n 2 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 10000 NG_n 3 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 5 n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 3 H 1 tH 0 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 3 mod 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 2 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 5 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 4 mod 4 n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 0 tH 1 n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 6 mod 3 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 2 MitM_CTL NG maxT 30000 NG_n 3 run&lt;br /&gt;
chr_LRUH 16 chr_H 12 MitM_CTL NG maxT 30000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 8 H 2 tH 1 n 2 run&lt;br /&gt;
chr_asth 0 chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 10000 NG_n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 16 H 1 tH 0 n 6 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 16 H 0 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 6 chr_H 2 MitM_CTL NG maxT 10000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 3 H 1 tH 0 n 2 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 2 mod 3 n 1 run&lt;br /&gt;
chr_LRUH 3 chr_H 1 MitM_CTL NG maxT 100000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 1 tH 0 n 4 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 2 mod 2 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 4 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 4 H 2 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 0 MitM_CTL NG maxT 1000 NG_n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 2 mod 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 3 mod 6 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 8 chr_H 8 MitM_CTL NG maxT 10000 NG_n 2 run&lt;br /&gt;
chr_asth 0 chr_LRUH 60 chr_H 60 MitM_CTL NG maxT 30000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 3 mod 2 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 4 H 1 tH 1 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 3 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 3000 NG_n 2 run&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 6:&lt;br /&gt;
&lt;br /&gt;
XnoobSpeakable ran Enumerate.py with a 0.15s/TM time limit, Lúkos ran it with a 0.75s/TM time limit.&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
python &amp;quot;+str(pl.Path(&amp;quot;../../Code/Enumerate.py&amp;quot;))+&amp;quot; --infile=&amp;quot;+str(pl.Path(&amp;quot;./in.txt&amp;quot;))+&amp;quot; --outfile=&amp;quot;+str(pl.Path(&amp;quot;./out.pb&amp;quot;))+&amp;quot; --max-loops=990_000 --tape-limit=9_900 --no-steps --time=&amp;quot;+str(time)+&amp;quot; --recursive --exp-linear-rules  --lin-steps=0 --no-ctl --save-freq=10_000&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 7:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 1000 NG_n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 12 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 1 mod 5 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 1000 NG_n 1 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 30000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 4 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 16 H 0 tH 1 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 3000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 4 H 0 tH 1 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 0 tH 2 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 12 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 1 mod 2 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 2 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 2 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 1 mod 3 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 1 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 2 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 6 H 0 tH 0 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 1000 NG_n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 100000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 1 mod 1 n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 2 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 30000 NG_n 1 run&lt;br /&gt;
&amp;lt;/pre&amp;gt;Phase 2 stage 8 (lr_enum_continue from [https://github.com/sligocki/busy-beaver busy-beaver] for 10 million steps):&amp;lt;pre&amp;gt;lr_enum_continue ./in.txt 10000000 ./halt.txt ./inf.txt ./unknown.txt &amp;quot;&amp;quot; false&amp;lt;/pre&amp;gt;Phase 2 stage 9a:&amp;lt;pre&amp;gt;python3 Code/Reverse_Engineer_Filter.py --infile=&#039;/home/xnoobspeakable/Desktop/Busy Beavers/BB(3,4)/resultsst8/3x4_holdouts_14518243.txt&#039; --outfile=&#039;out.txt&#039;&amp;lt;/pre&amp;gt;Phase 2 stage 9b:&amp;lt;pre&amp;gt;python3 ./Code/Backtracking_Filter.py --infile=&#039;/home/xnoobspeakable/Desktop/Busy Beavers/BB(3,4)/resultsst9/unknown.txt&#039;  --outfile=&#039;./b1.pb&#039; --steps=100&amp;lt;/pre&amp;gt;Phase 2 stage 10a:&amp;lt;pre&amp;gt;chr_LRUH 28 chr_LRUn 2 MitM_CTL NG maxT 30000 NG_n 8 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 6 H 1 tH 2 n 8 run&amp;lt;/pre&amp;gt;Phase 2 stage 10b:&amp;lt;pre&amp;gt;MitM_CTL CPS_LRU sim 1,001 maxT 10000 LRUH 2 H 0 tH 0 n 20 run&lt;br /&gt;
chr_LRUH 8 chr_H 8 MitM_CTL NG maxT 100000 NG_n 4 run&amp;lt;/pre&amp;gt;Phase 2 stage 10c:&amp;lt;pre&amp;gt;chr_asth 0 chr_LRUH 60 chr_H 60 MitM_CTL NG maxT 100000 NG_n 8 run&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 100000 NG_n 11 run&amp;lt;/pre&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Phase 3 ==&lt;br /&gt;
&lt;br /&gt;
Phase 3 began with Andrew Ducharme applying a FAR decider by mxdys. The following stages were done by XnoobSpeakable. The &amp;quot;Substages&amp;quot; column refers to the amount of separate runs of deciders being applied to the full holdout list, the files are not split into smaller chunks (&amp;quot;Subtasks&amp;quot;) like in Phase 2. (Note that Phase 2 stage 9 did actually use substages, like all of Phase 3.)&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: left&amp;quot;&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
! colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |% Reduced&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Substages&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Verified&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Andrew Ducharme&lt;br /&gt;
|12,435,284&lt;br /&gt;
|12,049,358&lt;br /&gt;
|3.10%&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Phase 3 stage 1&lt;br /&gt;
|1&lt;br /&gt;
|[https://drive.google.com/drive/folders/1lNKc_GF2sa5ZfosleAlMNBQ3uJV4qClo Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|12,049,358&lt;br /&gt;
|11,362,197&lt;br /&gt;
|5.70%&lt;br /&gt;
|Phase 3 stage 2&lt;br /&gt;
|4&lt;br /&gt;
|[https://drive.google.com/drive/folders/1lNKc_GF2sa5ZfosleAlMNBQ3uJV4qClo Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 3 Data ==&lt;br /&gt;
Here we will list the deciders applied during the various stages of Phase 3. Some stages have a number of TMs solved by every decider at the end of each row.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Details&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Phase 2 stage 1:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
FAR CPS_LRU maxT 100000 LRUH 2 H 0 tH 0 n 2 368,121&lt;br /&gt;
FAR CPS_LRU maxT 100000 LRUH 1 H 0 tH 0 n [1-4] 17,660&lt;br /&gt;
FAR CPS_LRU maxT 100000 LRUH 2 H 0 tH 0 n 1 145&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:BB Domains]][[Category:BB(3,4)]]&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=BB(3,4)&amp;diff=7514</id>
		<title>BB(3,4)</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=BB(3,4)&amp;diff=7514"/>
		<updated>2026-05-11T19:05:39Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: /* Phase 3 */ stage 2 finally done&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The Busy Beaver problem for 3 states and 4 symbols is unsolved, with the existence of [[Cryptids]] in the domain being given by the discovery of [[Bigfoot]] in [[BB(3,3)]]. The current BB(3,4) [[Champions#3-Symbol TMs|champion]] is {{TM|1RB3LB1RZ2RA_2LC3RB1LC2RA_3RB1LB3LC2RC|halt}}. It runs for &amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt; steps before halting. It was discovered by Pavel Kropitz in 2024 and was analysed by Shawn Ligocki in the same year.&lt;br /&gt;
&lt;br /&gt;
== Top Halters ==&lt;br /&gt;
The top 20 known longest running halting BB(3,4) TMs are:&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!Standard format&lt;br /&gt;
!(approximate) runtime&lt;br /&gt;
!Discoverer&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LB1RZ2RA_2LC3RB1LC2RA_3RB1LB3LC2RC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ1LA2RB_1RC3RC1LA2LB_2LB2RC1LC3RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{12} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3RB1LC2LA_2LA2RB1LB3RA_3LA1RZ1LC2RA}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{6} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3RB1LC2LA_2LA2RB1LB3RA_1RA1RZ1LC2RA}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{6} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LB1RZ3LA_0LC3RB3RC1LB_2RB2LA3RA1LC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {2\,048}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ1LA2RB_2RC3RC3LB2RA_2LB3RB3LC1LA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {189.05690}&amp;lt;/math&amp;gt;&lt;br /&gt;
|[[User:XnoobSpeakable|XnoobSpeakable]] &lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LA1RA2LB_2LC1RA2RC3RB_1RZ1LA2RA3RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {188.16168}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LB2LA3LC_1LA2RB3RA1LB_1RZ1RB2LB3LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {188.16168}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA3LA3RB_2LC2RC1LB2RA_2RA2RB0LB1RZ|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {149.57147}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LB1RZ3LA_1LA3RC2LC1LC_2LA3RC0RA1LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LB1RZ3LA_1LA3RC3LB1LC_2RA3RC0RA1LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LC1RC2RA_1LA3RA2RB1RZ_3LB2LC1RA0LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|[[User:WarpedWartWars|Lúkos]]&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA1LB3RA_1RC3LB1LC1RC_2LA2RA1RZ0LA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {96.06390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA1LB3RA_1RC3LB1LC1RC_2LA2RA1RZ1RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {96.06390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LC0RA1RC_2LA1RZ3LA2RB_3LA0RA1LA0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {95.24590}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LC0RA1RC_2LA1RZ3LA2RB_3LA0RA3LB0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {95.24590}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LA1RA1RC_1LA3LC3RB1RC_3LA1RZ3LB2RC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {84.19957}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LB1RA2LB_2RC3LB3RB2LA_2LC1RZ1LA2RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {76.17604}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LA1RZ0LB_2LC2LB1RC1RB_3LA3LC0LC0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {74.18390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2RA1LA1LB_2RC3RB1RZ3LC_2LA1RC1RB0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {69.55341}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Lúkos&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 1 ==&lt;br /&gt;
The initial phase of enumeration and reduction of [[holdouts]] took place in December 2024 and was done by Terry Ligocki using the Ligockis&#039; C++ and Python codes. The initial enumerations generated 600,253,156,787 TMs of which 42,391,877,333 were holdout TMs. Also found were 202,014,400,019 halting TMs and 355,846,879,435 infinite TMs. The number of holdouts was reduced to 434,787,751 TMs (a 98.97% reduction).&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Phase 1 Info&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Two C++ programs were run before the filters in the table.&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
lr_enum 3 4 8 /dev/null /dev/null 3x4.unk.txt false&lt;br /&gt;
00 &amp;lt;= XX &amp;lt; 47: lr_enum_continue 3x4.in.XX 1000 /dev/null /dev/null 3x4.unk.txt.XX XX false&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Both do the initial enumeration and simple filtering. The &amp;quot;/dev/null&amp;quot; in both commands would be files where the halting and infinite TMs would be stored. The first command generates the TMs from a TNF tree for BB(3,4) of depth 8 and outputs the holdouts to 3x4.unk.txt. This file was then divided into 48 pieces, 3x4.in.XX, 0 &amp;lt;= XX &amp;lt; 47. The second commands (one for each XX) continues the enumeration by running each TM for 1,000 steps. It classifies each as halting, infinite, or unknown/holdout. Again, the halting and infinite TMs are &amp;quot;written&amp;quot; to /dev/null, i.e., they aren&#039;t saved. The holdouts are stored in 48 files: 3x4.unk.txt.XX.&lt;br /&gt;
&lt;br /&gt;
For these runs the first command generated a total of 22,366,747 TMs: 932,198 halting, 235,446 infinite, and 21,199,103 holdouts. The second took the 22,366,747 holdout TMs and generated a total of 600,253,156,787 TMs: 202,014,400,019 halting, 355,846,879,435 infinite, and 42,391,877,333 holdouts. These holdouts were used as a starting point of the filters below.&lt;br /&gt;
&lt;br /&gt;
The &amp;quot;Description&amp;quot; column in the table below contain the command run. Two options are not given, &amp;quot;--infile=...&amp;quot; and an &amp;quot;--outfile=...&amp;quot;. These are necessary and specify where to read and write the results, respectively. Note: The work flow was to divide the input holdouts into 48 pieces, run the command on each piece simultaneously on one of 48 cores, and then combine the 48 results into a group of holdouts.&lt;br /&gt;
&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The details are given in this table:&lt;br /&gt;
&lt;br /&gt;
(done to reduce column size:&lt;br /&gt;
&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;= % Reduced,&lt;br /&gt;
&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;= Runtime (hours),&lt;br /&gt;
&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;= Decided,&lt;br /&gt;
&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;= Processed)&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: right&amp;quot;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |TMs/sec/core&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
!&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;&lt;br /&gt;
!&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|42,391,877,333&lt;br /&gt;
|32,247,381,725&lt;br /&gt;
|23.93%&lt;br /&gt;
|788.0&lt;br /&gt;
|3,576.08&lt;br /&gt;
|14,943.74&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Reverse_Engineer_Filter.py&lt;br /&gt;
|rowspan=&amp;quot;8&amp;quot; style=&amp;quot;text-align:left&amp;quot; |[https://drive.google.com/drive/folders/1EsFw5DOjjZ6Xzjc8QgRa2YkInrsmFnLX?usp=drive_link Google Drive]&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|32,247,381,725&lt;br /&gt;
|12,789,441,316&lt;br /&gt;
|60.34%&lt;br /&gt;
|6,185.2&lt;br /&gt;
|873.85&lt;br /&gt;
|1,448.22&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=1&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|12,789,441,316&lt;br /&gt;
|4,332,283,583&lt;br /&gt;
|66.13%&lt;br /&gt;
|4,771.0&lt;br /&gt;
|492.39&lt;br /&gt;
|744.62&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=2&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|4,332,283,583&lt;br /&gt;
|2,796,143,404&lt;br /&gt;
|35.46%&lt;br /&gt;
|7,873.1&lt;br /&gt;
|54.20&lt;br /&gt;
|152.85&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=3&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|2,796,143,404&lt;br /&gt;
|1,398,734,288&lt;br /&gt;
|49.98%&lt;br /&gt;
|10,239.4&lt;br /&gt;
|37.91&lt;br /&gt;
|75.85&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Enumerate.py --max-loops=1_000 --block-size=2 --time=10 --lin-steps=0 --no-reverse-engineer --save-freq=10_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|1,398,734,288&lt;br /&gt;
|764,851,053&lt;br /&gt;
|45.32%&lt;br /&gt;
|3,203.1&lt;br /&gt;
|54.97&lt;br /&gt;
|121.30&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Enumerate.py --max-loops=10_000 --block-size=12 --no-steps --time=0.01 --lin-steps=0 --no-ctl --no-reverse-engineer --save-freq=10_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|764,851,053&lt;br /&gt;
|581,654,405&lt;br /&gt;
|23.95%&lt;br /&gt;
|1,925.3&lt;br /&gt;
|26.43&lt;br /&gt;
|110.35&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --min-block-size=4 --max-block-size=12 --max-steps=1_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|581,654,405&lt;br /&gt;
|434,787,751&lt;br /&gt;
|25.25%&lt;br /&gt;
|9,042.5&lt;br /&gt;
|4.51&lt;br /&gt;
|17.87&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --min-block-size=4 --max-block-size=6 --max-steps=10_000&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 2 ==&lt;br /&gt;
XnoobSpeakable and Lúkos worked on applying mxdys&#039; deciders/parameters to the remaining holdouts. The previous holdouts list by Terry Ligocki was split up into 8696 files containing 50,000 holdouts each* (*the last one actually has 37,751) and the deciders were applied to the files individually. These files can be called subtasks. Lúkos made a Python script to compute the subtasks in parallel, based off of XnoobSpeakable&#039;s earlier imperfect script.&lt;br /&gt;
&lt;br /&gt;
Certain data such as TMs/sec/core is unavailable, because the amount of time the computation took was not kept track of.&lt;br /&gt;
&lt;br /&gt;
Stages 3 and 8 are lr_enum_continue computations to 1 million and 10 million steps respectively. Lúkos did not contribute to computing these stages, but rather created a Python script to compute them in bulk, which XnoobSpeakable used.&lt;br /&gt;
&lt;br /&gt;
For the &amp;quot;Contribution&amp;quot; column, the first number is the amount of subtasks solved by XnoobSpeakable, the 2nd is the amount solved by Lúkos. Note that the counts are unequal, because Lúkos has a slower CPU with a lower core count. According to XnoobSpeakable, the time contribution from both contributors is roughly equal. Lúkos also worked on the Python scripts used, while XnoobSpeakable worked on compiling holdouts lists and finding optimal deciders to apply. &lt;br /&gt;
&lt;br /&gt;
[[User:Peacemaker II|Peacemaker II]] worked on verifying the validity of the results as well as providing solved TM counts per decider. Stages 1, 2, and 4 have been validated - no dropped TMs. XnoobSpeakable verified stage 6.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;nowiki&amp;gt;**&amp;lt;/nowiki&amp;gt;Stage 9: Uses two substages, rather than subtasks, applying Reverse-Engineer and Backtracking deciders.&lt;br /&gt;
&lt;br /&gt;
Stage 10 is also seperated into substages A, B, and C for ease of computation.&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1MamU8zivuqoe4j82vpb-jYBfc4wvXNRc All scripts used are available here.] The details will be given in this table:&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: left&amp;quot;&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
! colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |% Reduced&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Subtasks&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Contribution&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Verified&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |XnoobSpeakable, Lúkos&lt;br /&gt;
|434,787,751&lt;br /&gt;
|64,777,377&lt;br /&gt;
|85.1%&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Phase 2 stage 1&lt;br /&gt;
|8696&lt;br /&gt;
|7696 / 1000&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|64,777,377&lt;br /&gt;
|37,016,957&lt;br /&gt;
|42.9%&lt;br /&gt;
|Phase 2 stage 2&lt;br /&gt;
|1296&lt;br /&gt;
|1000 / 296&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|37,016,957&lt;br /&gt;
|26,266,261&lt;br /&gt;
|29.0%&lt;br /&gt;
|Phase 2 stage 3&lt;br /&gt;
|741&lt;br /&gt;
|741 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|26,266,261&lt;br /&gt;
|22,396,711&lt;br /&gt;
|14.7%&lt;br /&gt;
|Phase 2 stage 4&lt;br /&gt;
|526&lt;br /&gt;
|485 / 41&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|22,396,711&lt;br /&gt;
|17,983,810&lt;br /&gt;
|19.7%&lt;br /&gt;
|Phase 2 stage 5&lt;br /&gt;
|448&lt;br /&gt;
|390 / 58&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|17,983,810&lt;br /&gt;
|15,564,491&lt;br /&gt;
|13.5%&lt;br /&gt;
|Phase 2 stage 6&lt;br /&gt;
|360&lt;br /&gt;
|300 / 60&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|15,564,491&lt;br /&gt;
|15,136,283&lt;br /&gt;
|2.75%&lt;br /&gt;
|Phase 2 stage 7&lt;br /&gt;
|312&lt;br /&gt;
|260 / 52&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|15,136,283&lt;br /&gt;
|14,518,243&lt;br /&gt;
|4.08%&lt;br /&gt;
|Phase 2 stage 8&lt;br /&gt;
|303&lt;br /&gt;
|303 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|14,518,243&lt;br /&gt;
|14,413,460&lt;br /&gt;
|0.72%&lt;br /&gt;
|Phase 2 stage 9&lt;br /&gt;
|2**&lt;br /&gt;
|2 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|14,413,460&lt;br /&gt;
|13,733,388&lt;br /&gt;
|4.72%&lt;br /&gt;
|Phase 2 stage 10A&lt;br /&gt;
|289&lt;br /&gt;
|216 / 73&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|13,733,388&lt;br /&gt;
|13,334,244&lt;br /&gt;
|2.91%&lt;br /&gt;
|Phase 2 stage 10B&lt;br /&gt;
|275&lt;br /&gt;
|200 / 75&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|13,334,244&lt;br /&gt;
|12,435,284&lt;br /&gt;
|6.74%&lt;br /&gt;
|Phase 2 stage 10C&lt;br /&gt;
|267&lt;br /&gt;
|190 / 77&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 2 Data ==&lt;br /&gt;
Here we will list the deciders applied during the various stages of Phase 2. Each decider within a stage was not applied in a specific order. Some stages have a number of TMs solved by every decider at the end of each row, provided by Peacemaker II.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Details&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Phase 2 stage 1:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 1000 NG_n 2 run 86569103&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 1000 NG_n 1 run 26093656&lt;br /&gt;
chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 13972946&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 6 mod 3 n 2 run 7190617&lt;br /&gt;
chr_LRUH 10 chr_H 6 MitM_CTL NG maxT 1000 NG_n 2 run 90302784&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 1 n 4 run 4342619&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 12 H 0 tH 1 n 2 run 11764327&lt;br /&gt;
chr_LRUH 2 chr_H 2 MitM_CTL NG maxT 1000 NG_n 1 run 55465842&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 2 n 1 run 17805678&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 2 H 0 tH 0 n 1 run 12623067&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 3000 NG_n 2 run 2240499&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 4 H 1 tH 1 n 2 run 10223131&lt;br /&gt;
chr_LRUH 6 chr_H 4 MitM_CTL NG maxT 10000 NG_n 1 run 2901053&lt;br /&gt;
chr_LRUH 22 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 28515052&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 2:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 4 n 8 run 1030303&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 8 mod 2 n 2 run 1465523&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 10000 NG_n 4 run 5232902&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 1720994&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 8 mod 3 n 2 run 555883&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 3 H 1 tH 0 n 6 run 290547&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 1 run 67506&lt;br /&gt;
chr_LRUH 10 chr_H 8 MitM_CTL NG maxT 10000 NG_n 2 run 1577979&lt;br /&gt;
chr_LRUH 6 chr_H 6 MitM_CTL NG maxT 3000 NG_n 2 run 1604533&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 4 n 6 run 10012948&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 8 H 0 tH 0 n 4 run 526822&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 1 n 1 run 34821&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 6 H 0 tH 1 n 3 run 356375&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 20 run 1970422&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 6 mod 3 n 1 run 443339&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 3 H 0 tH 1 n 2 run 518824&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 2 mod 2 n 1 run 61865&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 1 tH 1 n 2 run 288834&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 3 (lr_enum_continue from [https://github.com/sligocki/busy-beaver busy-beaver] for 1 million steps):&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
lr_enum_continue ./in.txt 1000000 ./halt.txt ./inf.txt ./unknown.txt &amp;quot;&amp;quot; false&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 4:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 3000 NG_n 2 run 202520&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 3000 NG_n 1 run 559013&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 4 n 1 run 1584&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 10000 NG_n 1 run 148544&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 1 run 812666&lt;br /&gt;
chr_asth 0 chr_LRUH 48 chr_H 48 MitM_CTL NG maxT 10000 NG_n 3 run 2043171&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 4 mod 2 n 1 run 102052&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 5:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 0 tH 1 n 10 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 16 H 1 tH 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 6 n 2 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 10000 NG_n 3 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 5 n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 3 H 1 tH 0 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 3 mod 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 2 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 5 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 4 mod 4 n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 0 tH 1 n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 6 mod 3 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 2 MitM_CTL NG maxT 30000 NG_n 3 run&lt;br /&gt;
chr_LRUH 16 chr_H 12 MitM_CTL NG maxT 30000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 8 H 2 tH 1 n 2 run&lt;br /&gt;
chr_asth 0 chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 10000 NG_n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 16 H 1 tH 0 n 6 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 16 H 0 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 6 chr_H 2 MitM_CTL NG maxT 10000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 3 H 1 tH 0 n 2 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 2 mod 3 n 1 run&lt;br /&gt;
chr_LRUH 3 chr_H 1 MitM_CTL NG maxT 100000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 1 tH 0 n 4 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 2 mod 2 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 4 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 4 H 2 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 0 MitM_CTL NG maxT 1000 NG_n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 2 mod 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 3 mod 6 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 8 chr_H 8 MitM_CTL NG maxT 10000 NG_n 2 run&lt;br /&gt;
chr_asth 0 chr_LRUH 60 chr_H 60 MitM_CTL NG maxT 30000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 3 mod 2 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 4 H 1 tH 1 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 3 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 3000 NG_n 2 run&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 6:&lt;br /&gt;
&lt;br /&gt;
XnoobSpeakable ran Enumerate.py with a 0.15s/TM time limit, Lúkos ran it with a 0.75s/TM time limit.&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
python &amp;quot;+str(pl.Path(&amp;quot;../../Code/Enumerate.py&amp;quot;))+&amp;quot; --infile=&amp;quot;+str(pl.Path(&amp;quot;./in.txt&amp;quot;))+&amp;quot; --outfile=&amp;quot;+str(pl.Path(&amp;quot;./out.pb&amp;quot;))+&amp;quot; --max-loops=990_000 --tape-limit=9_900 --no-steps --time=&amp;quot;+str(time)+&amp;quot; --recursive --exp-linear-rules  --lin-steps=0 --no-ctl --save-freq=10_000&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 7:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 1000 NG_n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 12 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 1 mod 5 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 1000 NG_n 1 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 30000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 4 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 16 H 0 tH 1 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 3000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 4 H 0 tH 1 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 0 tH 2 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 12 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 1 mod 2 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 2 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 2 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 1 mod 3 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 1 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 2 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 6 H 0 tH 0 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 1000 NG_n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 100000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 1 mod 1 n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 2 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 30000 NG_n 1 run&lt;br /&gt;
&amp;lt;/pre&amp;gt;Phase 2 stage 8 (lr_enum_continue from [https://github.com/sligocki/busy-beaver busy-beaver] for 10 million steps):&amp;lt;pre&amp;gt;lr_enum_continue ./in.txt 10000000 ./halt.txt ./inf.txt ./unknown.txt &amp;quot;&amp;quot; false&amp;lt;/pre&amp;gt;Phase 2 stage 9a:&amp;lt;pre&amp;gt;python3 Code/Reverse_Engineer_Filter.py --infile=&#039;/home/xnoobspeakable/Desktop/Busy Beavers/BB(3,4)/resultsst8/3x4_holdouts_14518243.txt&#039; --outfile=&#039;out.txt&#039;&amp;lt;/pre&amp;gt;Phase 2 stage 9b:&amp;lt;pre&amp;gt;python3 ./Code/Backtracking_Filter.py --infile=&#039;/home/xnoobspeakable/Desktop/Busy Beavers/BB(3,4)/resultsst9/unknown.txt&#039;  --outfile=&#039;./b1.pb&#039; --steps=100&amp;lt;/pre&amp;gt;Phase 2 stage 10a:&amp;lt;pre&amp;gt;chr_LRUH 28 chr_LRUn 2 MitM_CTL NG maxT 30000 NG_n 8 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 6 H 1 tH 2 n 8 run&amp;lt;/pre&amp;gt;Phase 2 stage 10b:&amp;lt;pre&amp;gt;MitM_CTL CPS_LRU sim 1,001 maxT 10000 LRUH 2 H 0 tH 0 n 20 run&lt;br /&gt;
chr_LRUH 8 chr_H 8 MitM_CTL NG maxT 100000 NG_n 4 run&amp;lt;/pre&amp;gt;Phase 2 stage 10c:&amp;lt;pre&amp;gt;chr_asth 0 chr_LRUH 60 chr_H 60 MitM_CTL NG maxT 100000 NG_n 8 run&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 100000 NG_n 11 run&amp;lt;/pre&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Phase 3 ==&lt;br /&gt;
&lt;br /&gt;
Phase 3 began with Andrew Ducharme applying a FAR decider by mxdys. The following stages were done by XnoobSpeakable. The &amp;quot;Substages&amp;quot; column refers to the amount of separate runs of deciders being applied to the full holdout list, the files are not split into smaller chunks (&amp;quot;Subtasks&amp;quot;) like in Phase 2. (Note that Phase 2 stage 9 did actually use substages, like all of Phase 3.)&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: left&amp;quot;&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
! colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |% Reduced&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Substages&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Verified&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Andrew Ducharme&lt;br /&gt;
|12,435,284&lt;br /&gt;
|12,049,358&lt;br /&gt;
|3.10%&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Phase 3 stage 1&lt;br /&gt;
|1&lt;br /&gt;
|[https://drive.google.com/drive/folders/1lNKc_GF2sa5ZfosleAlMNBQ3uJV4qClo Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|12,049,358&lt;br /&gt;
|11,362,197&lt;br /&gt;
|5.7%&lt;br /&gt;
|Phase 3 stage 2&lt;br /&gt;
|4&lt;br /&gt;
|[https://drive.google.com/drive/folders/1lNKc_GF2sa5ZfosleAlMNBQ3uJV4qClo Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 3 Data ==&lt;br /&gt;
Here we will list the deciders applied during the various stages of Phase 3. Some stages have a number of TMs solved by every decider at the end of each row.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Details&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Phase 2 stage 1:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
FAR CPS_LRU maxT 100000 LRUH 2 H 0 tH 0 n 2 368,121&lt;br /&gt;
FAR CPS_LRU maxT 100000 LRUH 1 H 0 tH 0 n [1-4] 17,660&lt;br /&gt;
FAR CPS_LRU maxT 100000 LRUH 2 H 0 tH 0 n 1 145&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:BB Domains]][[Category:BB(3,4)]]&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=BB(3,4)&amp;diff=7513</id>
		<title>BB(3,4)</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=BB(3,4)&amp;diff=7513"/>
		<updated>2026-05-11T18:23:00Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: /* Phase 3 */ bb(3,4) stage 2&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The Busy Beaver problem for 3 states and 4 symbols is unsolved, with the existence of [[Cryptids]] in the domain being given by the discovery of [[Bigfoot]] in [[BB(3,3)]]. The current BB(3,4) [[Champions#3-Symbol TMs|champion]] is {{TM|1RB3LB1RZ2RA_2LC3RB1LC2RA_3RB1LB3LC2RC|halt}}. It runs for &amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt; steps before halting. It was discovered by Pavel Kropitz in 2024 and was analysed by Shawn Ligocki in the same year.&lt;br /&gt;
&lt;br /&gt;
== Top Halters ==&lt;br /&gt;
The top 20 known longest running halting BB(3,4) TMs are:&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!Standard format&lt;br /&gt;
!(approximate) runtime&lt;br /&gt;
!Discoverer&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LB1RZ2RA_2LC3RB1LC2RA_3RB1LB3LC2RC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ1LA2RB_1RC3RC1LA2LB_2LB2RC1LC3RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{12} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3RB1LC2LA_2LA2RB1LB3RA_3LA1RZ1LC2RA}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{6} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3RB1LC2LA_2LA2RB1LB3RA_1RA1RZ1LC2RA}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{6} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LB1RZ3LA_0LC3RB3RC1LB_2RB2LA3RA1LC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {2\,048}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ1LA2RB_2RC3RC3LB2RA_2LB3RB3LC1LA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {189.05690}&amp;lt;/math&amp;gt;&lt;br /&gt;
|[[User:XnoobSpeakable|XnoobSpeakable]] &lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LA1RA2LB_2LC1RA2RC3RB_1RZ1LA2RA3RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {188.16168}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LB2LA3LC_1LA2RB3RA1LB_1RZ1RB2LB3LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {188.16168}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA3LA3RB_2LC2RC1LB2RA_2RA2RB0LB1RZ|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {149.57147}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LB1RZ3LA_1LA3RC2LC1LC_2LA3RC0RA1LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LB1RZ3LA_1LA3RC3LB1LC_2RA3RC0RA1LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LC1RC2RA_1LA3RA2RB1RZ_3LB2LC1RA0LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|[[User:WarpedWartWars|Lúkos]]&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA1LB3RA_1RC3LB1LC1RC_2LA2RA1RZ0LA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {96.06390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA1LB3RA_1RC3LB1LC1RC_2LA2RA1RZ1RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {96.06390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LC0RA1RC_2LA1RZ3LA2RB_3LA0RA1LA0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {95.24590}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LC0RA1RC_2LA1RZ3LA2RB_3LA0RA3LB0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {95.24590}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LA1RA1RC_1LA3LC3RB1RC_3LA1RZ3LB2RC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {84.19957}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LB1RA2LB_2RC3LB3RB2LA_2LC1RZ1LA2RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {76.17604}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LA1RZ0LB_2LC2LB1RC1RB_3LA3LC0LC0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {74.18390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2RA1LA1LB_2RC3RB1RZ3LC_2LA1RC1RB0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {69.55341}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Lúkos&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 1 ==&lt;br /&gt;
The initial phase of enumeration and reduction of [[holdouts]] took place in December 2024 and was done by Terry Ligocki using the Ligockis&#039; C++ and Python codes. The initial enumerations generated 600,253,156,787 TMs of which 42,391,877,333 were holdout TMs. Also found were 202,014,400,019 halting TMs and 355,846,879,435 infinite TMs. The number of holdouts was reduced to 434,787,751 TMs (a 98.97% reduction).&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Phase 1 Info&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Two C++ programs were run before the filters in the table.&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
lr_enum 3 4 8 /dev/null /dev/null 3x4.unk.txt false&lt;br /&gt;
00 &amp;lt;= XX &amp;lt; 47: lr_enum_continue 3x4.in.XX 1000 /dev/null /dev/null 3x4.unk.txt.XX XX false&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Both do the initial enumeration and simple filtering. The &amp;quot;/dev/null&amp;quot; in both commands would be files where the halting and infinite TMs would be stored. The first command generates the TMs from a TNF tree for BB(3,4) of depth 8 and outputs the holdouts to 3x4.unk.txt. This file was then divided into 48 pieces, 3x4.in.XX, 0 &amp;lt;= XX &amp;lt; 47. The second commands (one for each XX) continues the enumeration by running each TM for 1,000 steps. It classifies each as halting, infinite, or unknown/holdout. Again, the halting and infinite TMs are &amp;quot;written&amp;quot; to /dev/null, i.e., they aren&#039;t saved. The holdouts are stored in 48 files: 3x4.unk.txt.XX.&lt;br /&gt;
&lt;br /&gt;
For these runs the first command generated a total of 22,366,747 TMs: 932,198 halting, 235,446 infinite, and 21,199,103 holdouts. The second took the 22,366,747 holdout TMs and generated a total of 600,253,156,787 TMs: 202,014,400,019 halting, 355,846,879,435 infinite, and 42,391,877,333 holdouts. These holdouts were used as a starting point of the filters below.&lt;br /&gt;
&lt;br /&gt;
The &amp;quot;Description&amp;quot; column in the table below contain the command run. Two options are not given, &amp;quot;--infile=...&amp;quot; and an &amp;quot;--outfile=...&amp;quot;. These are necessary and specify where to read and write the results, respectively. Note: The work flow was to divide the input holdouts into 48 pieces, run the command on each piece simultaneously on one of 48 cores, and then combine the 48 results into a group of holdouts.&lt;br /&gt;
&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The details are given in this table:&lt;br /&gt;
&lt;br /&gt;
(done to reduce column size:&lt;br /&gt;
&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;= % Reduced,&lt;br /&gt;
&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;= Runtime (hours),&lt;br /&gt;
&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;= Decided,&lt;br /&gt;
&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;= Processed)&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: right&amp;quot;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |TMs/sec/core&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
!&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;&lt;br /&gt;
!&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|42,391,877,333&lt;br /&gt;
|32,247,381,725&lt;br /&gt;
|23.93%&lt;br /&gt;
|788.0&lt;br /&gt;
|3,576.08&lt;br /&gt;
|14,943.74&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Reverse_Engineer_Filter.py&lt;br /&gt;
|rowspan=&amp;quot;8&amp;quot; style=&amp;quot;text-align:left&amp;quot; |[https://drive.google.com/drive/folders/1EsFw5DOjjZ6Xzjc8QgRa2YkInrsmFnLX?usp=drive_link Google Drive]&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|32,247,381,725&lt;br /&gt;
|12,789,441,316&lt;br /&gt;
|60.34%&lt;br /&gt;
|6,185.2&lt;br /&gt;
|873.85&lt;br /&gt;
|1,448.22&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=1&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|12,789,441,316&lt;br /&gt;
|4,332,283,583&lt;br /&gt;
|66.13%&lt;br /&gt;
|4,771.0&lt;br /&gt;
|492.39&lt;br /&gt;
|744.62&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=2&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|4,332,283,583&lt;br /&gt;
|2,796,143,404&lt;br /&gt;
|35.46%&lt;br /&gt;
|7,873.1&lt;br /&gt;
|54.20&lt;br /&gt;
|152.85&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=3&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|2,796,143,404&lt;br /&gt;
|1,398,734,288&lt;br /&gt;
|49.98%&lt;br /&gt;
|10,239.4&lt;br /&gt;
|37.91&lt;br /&gt;
|75.85&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Enumerate.py --max-loops=1_000 --block-size=2 --time=10 --lin-steps=0 --no-reverse-engineer --save-freq=10_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|1,398,734,288&lt;br /&gt;
|764,851,053&lt;br /&gt;
|45.32%&lt;br /&gt;
|3,203.1&lt;br /&gt;
|54.97&lt;br /&gt;
|121.30&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Enumerate.py --max-loops=10_000 --block-size=12 --no-steps --time=0.01 --lin-steps=0 --no-ctl --no-reverse-engineer --save-freq=10_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|764,851,053&lt;br /&gt;
|581,654,405&lt;br /&gt;
|23.95%&lt;br /&gt;
|1,925.3&lt;br /&gt;
|26.43&lt;br /&gt;
|110.35&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --min-block-size=4 --max-block-size=12 --max-steps=1_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|581,654,405&lt;br /&gt;
|434,787,751&lt;br /&gt;
|25.25%&lt;br /&gt;
|9,042.5&lt;br /&gt;
|4.51&lt;br /&gt;
|17.87&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --min-block-size=4 --max-block-size=6 --max-steps=10_000&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 2 ==&lt;br /&gt;
XnoobSpeakable and Lúkos worked on applying mxdys&#039; deciders/parameters to the remaining holdouts. The previous holdouts list by Terry Ligocki was split up into 8696 files containing 50,000 holdouts each* (*the last one actually has 37,751) and the deciders were applied to the files individually. These files can be called subtasks. Lúkos made a Python script to compute the subtasks in parallel, based off of XnoobSpeakable&#039;s earlier imperfect script.&lt;br /&gt;
&lt;br /&gt;
Certain data such as TMs/sec/core is unavailable, because the amount of time the computation took was not kept track of.&lt;br /&gt;
&lt;br /&gt;
Stages 3 and 8 are lr_enum_continue computations to 1 million and 10 million steps respectively. Lúkos did not contribute to computing these stages, but rather created a Python script to compute them in bulk, which XnoobSpeakable used.&lt;br /&gt;
&lt;br /&gt;
For the &amp;quot;Contribution&amp;quot; column, the first number is the amount of subtasks solved by XnoobSpeakable, the 2nd is the amount solved by Lúkos. Note that the counts are unequal, because Lúkos has a slower CPU with a lower core count. According to XnoobSpeakable, the time contribution from both contributors is roughly equal. Lúkos also worked on the Python scripts used, while XnoobSpeakable worked on compiling holdouts lists and finding optimal deciders to apply. &lt;br /&gt;
&lt;br /&gt;
[[User:Peacemaker II|Peacemaker II]] worked on verifying the validity of the results as well as providing solved TM counts per decider. Stages 1, 2, and 4 have been validated - no dropped TMs. XnoobSpeakable verified stage 6.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;nowiki&amp;gt;**&amp;lt;/nowiki&amp;gt;Stage 9: Uses two substages, rather than subtasks, applying Reverse-Engineer and Backtracking deciders.&lt;br /&gt;
&lt;br /&gt;
Stage 10 is also seperated into substages A, B, and C for ease of computation.&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1MamU8zivuqoe4j82vpb-jYBfc4wvXNRc All scripts used are available here.] The details will be given in this table:&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: left&amp;quot;&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
! colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |% Reduced&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Subtasks&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Contribution&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Verified&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |XnoobSpeakable, Lúkos&lt;br /&gt;
|434,787,751&lt;br /&gt;
|64,777,377&lt;br /&gt;
|85.1%&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Phase 2 stage 1&lt;br /&gt;
|8696&lt;br /&gt;
|7696 / 1000&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|64,777,377&lt;br /&gt;
|37,016,957&lt;br /&gt;
|42.9%&lt;br /&gt;
|Phase 2 stage 2&lt;br /&gt;
|1296&lt;br /&gt;
|1000 / 296&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|37,016,957&lt;br /&gt;
|26,266,261&lt;br /&gt;
|29.0%&lt;br /&gt;
|Phase 2 stage 3&lt;br /&gt;
|741&lt;br /&gt;
|741 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|26,266,261&lt;br /&gt;
|22,396,711&lt;br /&gt;
|14.7%&lt;br /&gt;
|Phase 2 stage 4&lt;br /&gt;
|526&lt;br /&gt;
|485 / 41&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|22,396,711&lt;br /&gt;
|17,983,810&lt;br /&gt;
|19.7%&lt;br /&gt;
|Phase 2 stage 5&lt;br /&gt;
|448&lt;br /&gt;
|390 / 58&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|17,983,810&lt;br /&gt;
|15,564,491&lt;br /&gt;
|13.5%&lt;br /&gt;
|Phase 2 stage 6&lt;br /&gt;
|360&lt;br /&gt;
|300 / 60&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|15,564,491&lt;br /&gt;
|15,136,283&lt;br /&gt;
|2.75%&lt;br /&gt;
|Phase 2 stage 7&lt;br /&gt;
|312&lt;br /&gt;
|260 / 52&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|15,136,283&lt;br /&gt;
|14,518,243&lt;br /&gt;
|4.08%&lt;br /&gt;
|Phase 2 stage 8&lt;br /&gt;
|303&lt;br /&gt;
|303 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|14,518,243&lt;br /&gt;
|14,413,460&lt;br /&gt;
|0.72%&lt;br /&gt;
|Phase 2 stage 9&lt;br /&gt;
|2**&lt;br /&gt;
|2 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|14,413,460&lt;br /&gt;
|13,733,388&lt;br /&gt;
|4.72%&lt;br /&gt;
|Phase 2 stage 10A&lt;br /&gt;
|289&lt;br /&gt;
|216 / 73&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|13,733,388&lt;br /&gt;
|13,334,244&lt;br /&gt;
|2.91%&lt;br /&gt;
|Phase 2 stage 10B&lt;br /&gt;
|275&lt;br /&gt;
|200 / 75&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|13,334,244&lt;br /&gt;
|12,435,284&lt;br /&gt;
|6.74%&lt;br /&gt;
|Phase 2 stage 10C&lt;br /&gt;
|267&lt;br /&gt;
|190 / 77&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 2 Data ==&lt;br /&gt;
Here we will list the deciders applied during the various stages of Phase 2. Each decider within a stage was not applied in a specific order. Some stages have a number of TMs solved by every decider at the end of each row, provided by Peacemaker II.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Details&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Phase 2 stage 1:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 1000 NG_n 2 run 86569103&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 1000 NG_n 1 run 26093656&lt;br /&gt;
chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 13972946&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 6 mod 3 n 2 run 7190617&lt;br /&gt;
chr_LRUH 10 chr_H 6 MitM_CTL NG maxT 1000 NG_n 2 run 90302784&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 1 n 4 run 4342619&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 12 H 0 tH 1 n 2 run 11764327&lt;br /&gt;
chr_LRUH 2 chr_H 2 MitM_CTL NG maxT 1000 NG_n 1 run 55465842&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 2 n 1 run 17805678&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 2 H 0 tH 0 n 1 run 12623067&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 3000 NG_n 2 run 2240499&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 4 H 1 tH 1 n 2 run 10223131&lt;br /&gt;
chr_LRUH 6 chr_H 4 MitM_CTL NG maxT 10000 NG_n 1 run 2901053&lt;br /&gt;
chr_LRUH 22 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 28515052&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 2:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 4 n 8 run 1030303&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 8 mod 2 n 2 run 1465523&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 10000 NG_n 4 run 5232902&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 1720994&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 8 mod 3 n 2 run 555883&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 3 H 1 tH 0 n 6 run 290547&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 1 run 67506&lt;br /&gt;
chr_LRUH 10 chr_H 8 MitM_CTL NG maxT 10000 NG_n 2 run 1577979&lt;br /&gt;
chr_LRUH 6 chr_H 6 MitM_CTL NG maxT 3000 NG_n 2 run 1604533&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 4 n 6 run 10012948&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 8 H 0 tH 0 n 4 run 526822&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 1 n 1 run 34821&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 6 H 0 tH 1 n 3 run 356375&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 20 run 1970422&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 6 mod 3 n 1 run 443339&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 3 H 0 tH 1 n 2 run 518824&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 2 mod 2 n 1 run 61865&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 1 tH 1 n 2 run 288834&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 3 (lr_enum_continue from [https://github.com/sligocki/busy-beaver busy-beaver] for 1 million steps):&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
lr_enum_continue ./in.txt 1000000 ./halt.txt ./inf.txt ./unknown.txt &amp;quot;&amp;quot; false&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 4:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 3000 NG_n 2 run 202520&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 3000 NG_n 1 run 559013&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 4 n 1 run 1584&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 10000 NG_n 1 run 148544&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 1 run 812666&lt;br /&gt;
chr_asth 0 chr_LRUH 48 chr_H 48 MitM_CTL NG maxT 10000 NG_n 3 run 2043171&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 4 mod 2 n 1 run 102052&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 5:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 0 tH 1 n 10 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 16 H 1 tH 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 6 n 2 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 10000 NG_n 3 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 5 n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 3 H 1 tH 0 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 3 mod 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 2 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 5 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 4 mod 4 n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 0 tH 1 n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 6 mod 3 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 2 MitM_CTL NG maxT 30000 NG_n 3 run&lt;br /&gt;
chr_LRUH 16 chr_H 12 MitM_CTL NG maxT 30000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 8 H 2 tH 1 n 2 run&lt;br /&gt;
chr_asth 0 chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 10000 NG_n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 16 H 1 tH 0 n 6 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 16 H 0 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 6 chr_H 2 MitM_CTL NG maxT 10000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 3 H 1 tH 0 n 2 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 2 mod 3 n 1 run&lt;br /&gt;
chr_LRUH 3 chr_H 1 MitM_CTL NG maxT 100000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 1 tH 0 n 4 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 2 mod 2 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 4 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 4 H 2 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 0 MitM_CTL NG maxT 1000 NG_n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 2 mod 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 3 mod 6 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 8 chr_H 8 MitM_CTL NG maxT 10000 NG_n 2 run&lt;br /&gt;
chr_asth 0 chr_LRUH 60 chr_H 60 MitM_CTL NG maxT 30000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 3 mod 2 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 4 H 1 tH 1 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 3 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 3000 NG_n 2 run&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 6:&lt;br /&gt;
&lt;br /&gt;
XnoobSpeakable ran Enumerate.py with a 0.15s/TM time limit, Lúkos ran it with a 0.75s/TM time limit.&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
python &amp;quot;+str(pl.Path(&amp;quot;../../Code/Enumerate.py&amp;quot;))+&amp;quot; --infile=&amp;quot;+str(pl.Path(&amp;quot;./in.txt&amp;quot;))+&amp;quot; --outfile=&amp;quot;+str(pl.Path(&amp;quot;./out.pb&amp;quot;))+&amp;quot; --max-loops=990_000 --tape-limit=9_900 --no-steps --time=&amp;quot;+str(time)+&amp;quot; --recursive --exp-linear-rules  --lin-steps=0 --no-ctl --save-freq=10_000&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 7:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 1000 NG_n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 12 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 1 mod 5 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 1000 NG_n 1 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 30000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 4 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 16 H 0 tH 1 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 3000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 4 H 0 tH 1 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 0 tH 2 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 12 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 1 mod 2 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 2 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 2 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 1 mod 3 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 1 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 2 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 6 H 0 tH 0 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 1000 NG_n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 100000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 1 mod 1 n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 2 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 30000 NG_n 1 run&lt;br /&gt;
&amp;lt;/pre&amp;gt;Phase 2 stage 8 (lr_enum_continue from [https://github.com/sligocki/busy-beaver busy-beaver] for 10 million steps):&amp;lt;pre&amp;gt;lr_enum_continue ./in.txt 10000000 ./halt.txt ./inf.txt ./unknown.txt &amp;quot;&amp;quot; false&amp;lt;/pre&amp;gt;Phase 2 stage 9a:&amp;lt;pre&amp;gt;python3 Code/Reverse_Engineer_Filter.py --infile=&#039;/home/xnoobspeakable/Desktop/Busy Beavers/BB(3,4)/resultsst8/3x4_holdouts_14518243.txt&#039; --outfile=&#039;out.txt&#039;&amp;lt;/pre&amp;gt;Phase 2 stage 9b:&amp;lt;pre&amp;gt;python3 ./Code/Backtracking_Filter.py --infile=&#039;/home/xnoobspeakable/Desktop/Busy Beavers/BB(3,4)/resultsst9/unknown.txt&#039;  --outfile=&#039;./b1.pb&#039; --steps=100&amp;lt;/pre&amp;gt;Phase 2 stage 10a:&amp;lt;pre&amp;gt;chr_LRUH 28 chr_LRUn 2 MitM_CTL NG maxT 30000 NG_n 8 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 6 H 1 tH 2 n 8 run&amp;lt;/pre&amp;gt;Phase 2 stage 10b:&amp;lt;pre&amp;gt;MitM_CTL CPS_LRU sim 1,001 maxT 10000 LRUH 2 H 0 tH 0 n 20 run&lt;br /&gt;
chr_LRUH 8 chr_H 8 MitM_CTL NG maxT 100000 NG_n 4 run&amp;lt;/pre&amp;gt;Phase 2 stage 10c:&amp;lt;pre&amp;gt;chr_asth 0 chr_LRUH 60 chr_H 60 MitM_CTL NG maxT 100000 NG_n 8 run&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 100000 NG_n 11 run&amp;lt;/pre&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Phase 3 ==&lt;br /&gt;
&lt;br /&gt;
Phase 3 began with Andrew Ducharme applying a FAR decider by mxdys. The following stages were done by XnoobSpeakable. The &amp;quot;Substages&amp;quot; column refers to the amount of separate runs of deciders being applied to the full holdout list, the files are not split into smaller chunks (&amp;quot;Subtasks&amp;quot;) like in Phase 2. (Note that Phase 2 stage 9 did actually use substages, like all of Phase 3.)&lt;br /&gt;
&lt;br /&gt;
&amp;lt;nowiki&amp;gt;*&amp;lt;/nowiki&amp;gt;Stage 2. The amount of holdouts is unclear due to a minor discrepancy with the predicted and observed counts.&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: left&amp;quot;&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
! colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |% Reduced&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Substages&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Verified&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Andrew Ducharme&lt;br /&gt;
|12,435,284&lt;br /&gt;
|12,049,358&lt;br /&gt;
|3.10%&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Phase 3 stage 1&lt;br /&gt;
|1&lt;br /&gt;
|[https://drive.google.com/drive/folders/1lNKc_GF2sa5ZfosleAlMNBQ3uJV4qClo Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|12,049,358&lt;br /&gt;
|11,362,200*&lt;br /&gt;
|&lt;br /&gt;
|Phase 3 stage 2&lt;br /&gt;
|4&lt;br /&gt;
|[https://drive.google.com/drive/folders/1lNKc_GF2sa5ZfosleAlMNBQ3uJV4qClo Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 3 Data ==&lt;br /&gt;
Here we will list the deciders applied during the various stages of Phase 3. Some stages have a number of TMs solved by every decider at the end of each row.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Details&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Phase 2 stage 1:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
FAR CPS_LRU maxT 100000 LRUH 2 H 0 tH 0 n 2 368,121&lt;br /&gt;
FAR CPS_LRU maxT 100000 LRUH 1 H 0 tH 0 n [1-4] 17,660&lt;br /&gt;
FAR CPS_LRU maxT 100000 LRUH 2 H 0 tH 0 n 1 145&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:BB Domains]][[Category:BB(3,4)]]&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=BB(3,4)&amp;diff=7467</id>
		<title>BB(3,4)</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=BB(3,4)&amp;diff=7467"/>
		<updated>2026-05-07T18:46:33Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: /* Phase 3 */ substage C&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The Busy Beaver problem for 3 states and 4 symbols is unsolved, with the existence of [[Cryptids]] in the domain being given by the discovery of [[Bigfoot]] in [[BB(3,3)]]. The current BB(3,4) [[Champions#3-Symbol TMs|champion]] is {{TM|1RB3LB1RZ2RA_2LC3RB1LC2RA_3RB1LB3LC2RC|halt}}. It runs for &amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt; steps before halting. It was discovered by Pavel Kropitz in 2024 and was analysed by Shawn Ligocki in the same year.&lt;br /&gt;
&lt;br /&gt;
== Top Halters ==&lt;br /&gt;
The top 20 known longest running halting BB(3,4) TMs are:&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!Standard format&lt;br /&gt;
!(approximate) runtime&lt;br /&gt;
!Discoverer&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LB1RZ2RA_2LC3RB1LC2RA_3RB1LB3LC2RC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ1LA2RB_1RC3RC1LA2LB_2LB2RC1LC3RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{12} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3RB1LC2LA_2LA2RB1LB3RA_3LA1RZ1LC2RA}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{6} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3RB1LC2LA_2LA2RB1LB3RA_1RA1RZ1LC2RA}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{6} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LB1RZ3LA_0LC3RB3RC1LB_2RB2LA3RA1LC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {2\,048}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ1LA2RB_2RC3RC3LB2RA_2LB3RB3LC1LA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {189.05690}&amp;lt;/math&amp;gt;&lt;br /&gt;
|[[User:XnoobSpeakable|XnoobSpeakable]] &lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LA1RA2LB_2LC1RA2RC3RB_1RZ1LA2RA3RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {188.16168}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LB2LA3LC_1LA2RB3RA1LB_1RZ1RB2LB3LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {188.16168}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA3LA3RB_2LC2RC1LB2RA_2RA2RB0LB1RZ|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {149.57147}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LB1RZ3LA_1LA3RC2LC1LC_2LA3RC0RA1LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LB1RZ3LA_1LA3RC3LB1LC_2RA3RC0RA1LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LC1RC2RA_1LA3RA2RB1RZ_3LB2LC1RA0LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|[[User:WarpedWartWars|Lúkos]]&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA1LB3RA_1RC3LB1LC1RC_2LA2RA1RZ0LA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {96.06390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA1LB3RA_1RC3LB1LC1RC_2LA2RA1RZ1RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {96.06390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LC0RA1RC_2LA1RZ3LA2RB_3LA0RA1LA0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {95.24590}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LC0RA1RC_2LA1RZ3LA2RB_3LA0RA3LB0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {95.24590}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LA1RA1RC_1LA3LC3RB1RC_3LA1RZ3LB2RC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {84.19957}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LB1RA2LB_2RC3LB3RB2LA_2LC1RZ1LA2RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {76.17604}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LA1RZ0LB_2LC2LB1RC1RB_3LA3LC0LC0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {74.18390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2RA1LA1LB_2RC3RB1RZ3LC_2LA1RC1RB0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {69.55341}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Lúkos&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 1 ==&lt;br /&gt;
The initial phase of enumeration and reduction of [[holdouts]] took place in December 2024 and was done by Terry Ligocki using the Ligockis&#039; C++ and Python codes. The initial enumerations generated 600,253,156,787 TMs of which 42,391,877,333 were holdout TMs. Also found were 202,014,400,019 halting TMs and 355,846,879,435 infinite TMs. The number of holdouts was reduced to 434,787,751 TMs (a 98.97% reduction).&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Phase 1 Info&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Two C++ programs were run before the filters in the table.&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
lr_enum 3 4 8 /dev/null /dev/null 3x4.unk.txt false&lt;br /&gt;
00 &amp;lt;= XX &amp;lt; 47: lr_enum_continue 3x4.in.XX 1000 /dev/null /dev/null 3x4.unk.txt.XX XX false&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Both do the initial enumeration and simple filtering. The &amp;quot;/dev/null&amp;quot; in both commands would be files where the halting and infinite TMs would be stored. The first command generates the TMs from a TNF tree for BB(3,4) of depth 8 and outputs the holdouts to 3x4.unk.txt. This file was then divided into 48 pieces, 3x4.in.XX, 0 &amp;lt;= XX &amp;lt; 47. The second commands (one for each XX) continues the enumeration by running each TM for 1,000 steps. It classifies each as halting, infinite, or unknown/holdout. Again, the halting and infinite TMs are &amp;quot;written&amp;quot; to /dev/null, i.e., they aren&#039;t saved. The holdouts are stored in 48 files: 3x4.unk.txt.XX.&lt;br /&gt;
&lt;br /&gt;
For these runs the first command generated a total of 22,366,747 TMs: 932,198 halting, 235,446 infinite, and 21,199,103 holdouts. The second took the 22,366,747 holdout TMs and generated a total of 600,253,156,787 TMs: 202,014,400,019 halting, 355,846,879,435 infinite, and 42,391,877,333 holdouts. These holdouts were used as a starting point of the filters below.&lt;br /&gt;
&lt;br /&gt;
The &amp;quot;Description&amp;quot; column in the table below contain the command run. Two options are not given, &amp;quot;--infile=...&amp;quot; and an &amp;quot;--outfile=...&amp;quot;. These are necessary and specify where to read and write the results, respectively. Note: The work flow was to divide the input holdouts into 48 pieces, run the command on each piece simultaneously on one of 48 cores, and then combine the 48 results into a group of holdouts.&lt;br /&gt;
&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The details are given in this table:&lt;br /&gt;
&lt;br /&gt;
(done to reduce column size:&lt;br /&gt;
&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;= % Reduced,&lt;br /&gt;
&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;= Runtime (hours),&lt;br /&gt;
&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;= Decided,&lt;br /&gt;
&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;= Processed)&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: right&amp;quot;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |TMs/sec/core&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
!&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;&lt;br /&gt;
!&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|42,391,877,333&lt;br /&gt;
|32,247,381,725&lt;br /&gt;
|23.93%&lt;br /&gt;
|788.0&lt;br /&gt;
|3,576.08&lt;br /&gt;
|14,943.74&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Reverse_Engineer_Filter.py&lt;br /&gt;
|rowspan=&amp;quot;8&amp;quot; style=&amp;quot;text-align:left&amp;quot; |[https://drive.google.com/drive/folders/1EsFw5DOjjZ6Xzjc8QgRa2YkInrsmFnLX?usp=drive_link Google Drive]&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|32,247,381,725&lt;br /&gt;
|12,789,441,316&lt;br /&gt;
|60.34%&lt;br /&gt;
|6,185.2&lt;br /&gt;
|873.85&lt;br /&gt;
|1,448.22&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=1&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|12,789,441,316&lt;br /&gt;
|4,332,283,583&lt;br /&gt;
|66.13%&lt;br /&gt;
|4,771.0&lt;br /&gt;
|492.39&lt;br /&gt;
|744.62&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=2&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|4,332,283,583&lt;br /&gt;
|2,796,143,404&lt;br /&gt;
|35.46%&lt;br /&gt;
|7,873.1&lt;br /&gt;
|54.20&lt;br /&gt;
|152.85&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=3&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|2,796,143,404&lt;br /&gt;
|1,398,734,288&lt;br /&gt;
|49.98%&lt;br /&gt;
|10,239.4&lt;br /&gt;
|37.91&lt;br /&gt;
|75.85&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Enumerate.py --max-loops=1_000 --block-size=2 --time=10 --lin-steps=0 --no-reverse-engineer --save-freq=10_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|1,398,734,288&lt;br /&gt;
|764,851,053&lt;br /&gt;
|45.32%&lt;br /&gt;
|3,203.1&lt;br /&gt;
|54.97&lt;br /&gt;
|121.30&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Enumerate.py --max-loops=10_000 --block-size=12 --no-steps --time=0.01 --lin-steps=0 --no-ctl --no-reverse-engineer --save-freq=10_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|764,851,053&lt;br /&gt;
|581,654,405&lt;br /&gt;
|23.95%&lt;br /&gt;
|1,925.3&lt;br /&gt;
|26.43&lt;br /&gt;
|110.35&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --min-block-size=4 --max-block-size=12 --max-steps=1_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|581,654,405&lt;br /&gt;
|434,787,751&lt;br /&gt;
|25.25%&lt;br /&gt;
|9,042.5&lt;br /&gt;
|4.51&lt;br /&gt;
|17.87&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --min-block-size=4 --max-block-size=6 --max-steps=10_000&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 2 ==&lt;br /&gt;
XnoobSpeakable and Lúkos worked on applying mxdys&#039; deciders/parameters to the remaining holdouts. The previous holdouts list by Terry Ligocki was split up into 8696 files containing 50,000 holdouts each* (*the last one actually has 37,751) and the deciders were applied to the files individually. These files can be called subtasks. Lúkos made a Python script to compute the subtasks in parallel, based off of XnoobSpeakable&#039;s earlier imperfect script.&lt;br /&gt;
&lt;br /&gt;
Certain data such as TMs/sec/core is unavailable, because the amount of time the computation took was not kept track of.&lt;br /&gt;
&lt;br /&gt;
Stages 3 and 8 are lr_enum_continue computations to 1 million and 10 million steps respectively. Lúkos did not contribute to computing these stages, but rather created a Python script to compute them in bulk, which XnoobSpeakable used.&lt;br /&gt;
&lt;br /&gt;
For the &amp;quot;Contribution&amp;quot; column, the first number is the amount of subtasks solved by XnoobSpeakable, the 2nd is the amount solved by Lúkos. Note that the counts are unequal, because Lúkos has a slower CPU with a lower core count. According to XnoobSpeakable, the time contribution from both contributors is roughly equal. Lúkos also worked on the Python scripts used, while XnoobSpeakable worked on compiling holdouts lists and finding optimal deciders to apply. &lt;br /&gt;
&lt;br /&gt;
[[User:Peacemaker II|Peacemaker II]] worked on verifying the validity of the results as well as providing solved TM counts per decider. Stages 1, 2, and 4 have been validated - no dropped TMs. XnoobSpeakable verified stage 6.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;nowiki&amp;gt;**&amp;lt;/nowiki&amp;gt;Stage 9: Uses two substages, rather than subtasks, applying Reverse-Engineer and Backtracking deciders.&lt;br /&gt;
&lt;br /&gt;
Stage 10 is also seperated into substages A, B, and C for ease of computation.&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1MamU8zivuqoe4j82vpb-jYBfc4wvXNRc All scripts used are available here.] The details will be given in this table:&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: left&amp;quot;&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
! colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |% Reduced&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Subtasks&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Contribution&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Verified&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |XnoobSpeakable, Lúkos&lt;br /&gt;
|434,787,751&lt;br /&gt;
|64,777,377&lt;br /&gt;
|85.1%&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Phase 2 stage 1&lt;br /&gt;
|8696&lt;br /&gt;
|7696 / 1000&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|64,777,377&lt;br /&gt;
|37,016,957&lt;br /&gt;
|42.9%&lt;br /&gt;
|Phase 2 stage 2&lt;br /&gt;
|1296&lt;br /&gt;
|1000 / 296&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|37,016,957&lt;br /&gt;
|26,266,261&lt;br /&gt;
|29.0%&lt;br /&gt;
|Phase 2 stage 3&lt;br /&gt;
|741&lt;br /&gt;
|741 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|26,266,261&lt;br /&gt;
|22,396,711&lt;br /&gt;
|14.7%&lt;br /&gt;
|Phase 2 stage 4&lt;br /&gt;
|526&lt;br /&gt;
|485 / 41&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|22,396,711&lt;br /&gt;
|17,983,810&lt;br /&gt;
|19.7%&lt;br /&gt;
|Phase 2 stage 5&lt;br /&gt;
|448&lt;br /&gt;
|390 / 58&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|17,983,810&lt;br /&gt;
|15,564,491&lt;br /&gt;
|13.5%&lt;br /&gt;
|Phase 2 stage 6&lt;br /&gt;
|360&lt;br /&gt;
|300 / 60&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|15,564,491&lt;br /&gt;
|15,136,283&lt;br /&gt;
|2.75%&lt;br /&gt;
|Phase 2 stage 7&lt;br /&gt;
|312&lt;br /&gt;
|260 / 52&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|15,136,283&lt;br /&gt;
|14,518,243&lt;br /&gt;
|4.08%&lt;br /&gt;
|Phase 2 stage 8&lt;br /&gt;
|303&lt;br /&gt;
|303 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|14,518,243&lt;br /&gt;
|14,413,460&lt;br /&gt;
|0.72%&lt;br /&gt;
|Phase 2 stage 9&lt;br /&gt;
|2**&lt;br /&gt;
|2 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|14,413,460&lt;br /&gt;
|13,733,388&lt;br /&gt;
|4.72%&lt;br /&gt;
|Phase 2 stage 10A&lt;br /&gt;
|289&lt;br /&gt;
|216 / 73&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|13,733,388&lt;br /&gt;
|13,334,244&lt;br /&gt;
|2.91%&lt;br /&gt;
|Phase 2 stage 10B&lt;br /&gt;
|275&lt;br /&gt;
|200 / 75&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|13,334,244&lt;br /&gt;
|12,435,284&lt;br /&gt;
|6.74%&lt;br /&gt;
|Phase 2 stage 10C&lt;br /&gt;
|267&lt;br /&gt;
|190 / 77&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 2 Data ==&lt;br /&gt;
Here we will list the deciders applied during the various stages of Phase 2. Each decider within a stage was not applied in a specific order. Some stages have a number of TMs solved by every decider at the end of each row, provided by Peacemaker II.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Details&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Phase 2 stage 1:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 1000 NG_n 2 run 86569103&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 1000 NG_n 1 run 26093656&lt;br /&gt;
chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 13972946&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 6 mod 3 n 2 run 7190617&lt;br /&gt;
chr_LRUH 10 chr_H 6 MitM_CTL NG maxT 1000 NG_n 2 run 90302784&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 1 n 4 run 4342619&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 12 H 0 tH 1 n 2 run 11764327&lt;br /&gt;
chr_LRUH 2 chr_H 2 MitM_CTL NG maxT 1000 NG_n 1 run 55465842&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 2 n 1 run 17805678&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 2 H 0 tH 0 n 1 run 12623067&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 3000 NG_n 2 run 2240499&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 4 H 1 tH 1 n 2 run 10223131&lt;br /&gt;
chr_LRUH 6 chr_H 4 MitM_CTL NG maxT 10000 NG_n 1 run 2901053&lt;br /&gt;
chr_LRUH 22 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 28515052&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 2:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 4 n 8 run 1030303&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 8 mod 2 n 2 run 1465523&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 10000 NG_n 4 run 5232902&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 1720994&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 8 mod 3 n 2 run 555883&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 3 H 1 tH 0 n 6 run 290547&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 1 run 67506&lt;br /&gt;
chr_LRUH 10 chr_H 8 MitM_CTL NG maxT 10000 NG_n 2 run 1577979&lt;br /&gt;
chr_LRUH 6 chr_H 6 MitM_CTL NG maxT 3000 NG_n 2 run 1604533&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 4 n 6 run 10012948&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 8 H 0 tH 0 n 4 run 526822&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 1 n 1 run 34821&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 6 H 0 tH 1 n 3 run 356375&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 20 run 1970422&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 6 mod 3 n 1 run 443339&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 3 H 0 tH 1 n 2 run 518824&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 2 mod 2 n 1 run 61865&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 1 tH 1 n 2 run 288834&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 3 (lr_enum_continue from [https://github.com/sligocki/busy-beaver busy-beaver] for 1 million steps):&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
lr_enum_continue ./in.txt 1000000 ./halt.txt ./inf.txt ./unknown.txt &amp;quot;&amp;quot; false&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 4:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 3000 NG_n 2 run 202520&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 3000 NG_n 1 run 559013&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 4 n 1 run 1584&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 10000 NG_n 1 run 148544&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 1 run 812666&lt;br /&gt;
chr_asth 0 chr_LRUH 48 chr_H 48 MitM_CTL NG maxT 10000 NG_n 3 run 2043171&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 4 mod 2 n 1 run 102052&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 5:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 0 tH 1 n 10 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 16 H 1 tH 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 6 n 2 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 10000 NG_n 3 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 5 n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 3 H 1 tH 0 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 3 mod 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 2 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 5 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 4 mod 4 n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 0 tH 1 n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 6 mod 3 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 2 MitM_CTL NG maxT 30000 NG_n 3 run&lt;br /&gt;
chr_LRUH 16 chr_H 12 MitM_CTL NG maxT 30000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 8 H 2 tH 1 n 2 run&lt;br /&gt;
chr_asth 0 chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 10000 NG_n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 16 H 1 tH 0 n 6 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 16 H 0 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 6 chr_H 2 MitM_CTL NG maxT 10000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 3 H 1 tH 0 n 2 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 2 mod 3 n 1 run&lt;br /&gt;
chr_LRUH 3 chr_H 1 MitM_CTL NG maxT 100000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 1 tH 0 n 4 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 2 mod 2 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 4 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 4 H 2 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 0 MitM_CTL NG maxT 1000 NG_n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 2 mod 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 3 mod 6 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 8 chr_H 8 MitM_CTL NG maxT 10000 NG_n 2 run&lt;br /&gt;
chr_asth 0 chr_LRUH 60 chr_H 60 MitM_CTL NG maxT 30000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 3 mod 2 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 4 H 1 tH 1 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 3 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 3000 NG_n 2 run&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 6:&lt;br /&gt;
&lt;br /&gt;
XnoobSpeakable ran Enumerate.py with a 0.15s/TM time limit, Lúkos ran it with a 0.75s/TM time limit.&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
python &amp;quot;+str(pl.Path(&amp;quot;../../Code/Enumerate.py&amp;quot;))+&amp;quot; --infile=&amp;quot;+str(pl.Path(&amp;quot;./in.txt&amp;quot;))+&amp;quot; --outfile=&amp;quot;+str(pl.Path(&amp;quot;./out.pb&amp;quot;))+&amp;quot; --max-loops=990_000 --tape-limit=9_900 --no-steps --time=&amp;quot;+str(time)+&amp;quot; --recursive --exp-linear-rules  --lin-steps=0 --no-ctl --save-freq=10_000&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 7:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 1000 NG_n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 12 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 1 mod 5 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 1000 NG_n 1 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 30000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 4 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 16 H 0 tH 1 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 3000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 4 H 0 tH 1 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 0 tH 2 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 12 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 1 mod 2 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 2 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 2 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 1 mod 3 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 1 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 2 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 6 H 0 tH 0 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 1000 NG_n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 100000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 1 mod 1 n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 2 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 30000 NG_n 1 run&lt;br /&gt;
&amp;lt;/pre&amp;gt;Phase 2 stage 8 (lr_enum_continue from [https://github.com/sligocki/busy-beaver busy-beaver] for 10 million steps):&amp;lt;pre&amp;gt;lr_enum_continue ./in.txt 10000000 ./halt.txt ./inf.txt ./unknown.txt &amp;quot;&amp;quot; false&amp;lt;/pre&amp;gt;Phase 2 stage 9a:&amp;lt;pre&amp;gt;python3 Code/Reverse_Engineer_Filter.py --infile=&#039;/home/xnoobspeakable/Desktop/Busy Beavers/BB(3,4)/resultsst8/3x4_holdouts_14518243.txt&#039; --outfile=&#039;out.txt&#039;&amp;lt;/pre&amp;gt;Phase 2 stage 9b:&amp;lt;pre&amp;gt;python3 ./Code/Backtracking_Filter.py --infile=&#039;/home/xnoobspeakable/Desktop/Busy Beavers/BB(3,4)/resultsst9/unknown.txt&#039;  --outfile=&#039;./b1.pb&#039; --steps=100&amp;lt;/pre&amp;gt;Phase 2 stage 10a:&amp;lt;pre&amp;gt;chr_LRUH 28 chr_LRUn 2 MitM_CTL NG maxT 30000 NG_n 8 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 6 H 1 tH 2 n 8 run&amp;lt;/pre&amp;gt;Phase 2 stage 10b:&amp;lt;pre&amp;gt;MitM_CTL CPS_LRU sim 1,001 maxT 10000 LRUH 2 H 0 tH 0 n 20 run&lt;br /&gt;
chr_LRUH 8 chr_H 8 MitM_CTL NG maxT 100000 NG_n 4 run&amp;lt;/pre&amp;gt;Phase 2 stage 10c:&amp;lt;pre&amp;gt;chr_asth 0 chr_LRUH 60 chr_H 60 MitM_CTL NG maxT 100000 NG_n 8 run&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 100000 NG_n 11 run&amp;lt;/pre&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Phase 3 ==&lt;br /&gt;
&lt;br /&gt;
Phase 3 began with Andrew Ducharme applying a FAR decider by mxdys. The following stages were done by XnoobSpeakable. The &amp;quot;Substages&amp;quot; column refers to the amount of separate runs of deciders being applied to the full holdout list, the files are not split into smaller chunks (&amp;quot;Subtasks&amp;quot;) like in Phase 2. (Note that Phase 2 stage 9 did actually use substages, like all of Phase 3.)&lt;br /&gt;
&lt;br /&gt;
Stage 2 is currently in progress, with 2 substages completed. The amount of holdouts is unclear due to a minor discrepancy with the predicted and observed counts.&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: left&amp;quot;&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
! colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |% Reduced&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Substages&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Verified&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Andrew Ducharme&lt;br /&gt;
|12,435,284&lt;br /&gt;
|12,049,358&lt;br /&gt;
|3.10%&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Phase 3 stage 1&lt;br /&gt;
|1&lt;br /&gt;
|[https://drive.google.com/drive/folders/1lNKc_GF2sa5ZfosleAlMNBQ3uJV4qClo Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|12,049,358&lt;br /&gt;
|≤11,368,507&lt;br /&gt;
|&lt;br /&gt;
|Phase 3 stage 2&lt;br /&gt;
|3/4 (in prog.)&lt;br /&gt;
|[https://drive.google.com/drive/folders/1lNKc_GF2sa5ZfosleAlMNBQ3uJV4qClo Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 3 Data ==&lt;br /&gt;
Here we will list the deciders applied during the various stages of Phase 3. Some stages have a number of TMs solved by every decider at the end of each row.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Details&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Phase 2 stage 1:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
FAR CPS_LRU maxT 100000 LRUH 2 H 0 tH 0 n 2 368,121&lt;br /&gt;
FAR CPS_LRU maxT 100000 LRUH 1 H 0 tH 0 n [1-4] 17,660&lt;br /&gt;
FAR CPS_LRU maxT 100000 LRUH 2 H 0 tH 0 n 1 145&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:BB Domains]][[Category:BB(3,4)]]&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=BB(3,4)&amp;diff=7445</id>
		<title>BB(3,4)</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=BB(3,4)&amp;diff=7445"/>
		<updated>2026-05-05T11:35:47Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: /* Phase 3 */ update holdouts&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The Busy Beaver problem for 3 states and 4 symbols is unsolved, with the existence of [[Cryptids]] in the domain being given by the discovery of [[Bigfoot]] in [[BB(3,3)]]. The current BB(3,4) [[Champions#3-Symbol TMs|champion]] is {{TM|1RB3LB1RZ2RA_2LC3RB1LC2RA_3RB1LB3LC2RC|halt}}. It runs for &amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt; steps before halting. It was discovered by Pavel Kropitz in 2024 and was analysed by Shawn Ligocki in the same year.&lt;br /&gt;
&lt;br /&gt;
== Top Halters ==&lt;br /&gt;
The top 20 known longest running halting BB(3,4) TMs are:&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!Standard format&lt;br /&gt;
!(approximate) runtime&lt;br /&gt;
!Discoverer&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LB1RZ2RA_2LC3RB1LC2RA_3RB1LB3LC2RC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ1LA2RB_1RC3RC1LA2LB_2LB2RC1LC3RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{12} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3RB1LC2LA_2LA2RB1LB3RA_3LA1RZ1LC2RA}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{6} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3RB1LC2LA_2LA2RB1LB3RA_1RA1RZ1LC2RA}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{6} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LB1RZ3LA_0LC3RB3RC1LB_2RB2LA3RA1LC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {2\,048}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ1LA2RB_2RC3RC3LB2RA_2LB3RB3LC1LA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {189.05690}&amp;lt;/math&amp;gt;&lt;br /&gt;
|[[User:XnoobSpeakable|XnoobSpeakable]] &lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LA1RA2LB_2LC1RA2RC3RB_1RZ1LA2RA3RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {188.16168}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LB2LA3LC_1LA2RB3RA1LB_1RZ1RB2LB3LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {188.16168}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA3LA3RB_2LC2RC1LB2RA_2RA2RB0LB1RZ|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {149.57147}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LB1RZ3LA_1LA3RC2LC1LC_2LA3RC0RA1LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LB1RZ3LA_1LA3RC3LB1LC_2RA3RC0RA1LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LC1RC2RA_1LA3RA2RB1RZ_3LB2LC1RA0LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|[[User:WarpedWartWars|Lúkos]]&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA1LB3RA_1RC3LB1LC1RC_2LA2RA1RZ0LA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {96.06390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA1LB3RA_1RC3LB1LC1RC_2LA2RA1RZ1RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {96.06390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LC0RA1RC_2LA1RZ3LA2RB_3LA0RA1LA0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {95.24590}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LC0RA1RC_2LA1RZ3LA2RB_3LA0RA3LB0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {95.24590}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LA1RA1RC_1LA3LC3RB1RC_3LA1RZ3LB2RC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {84.19957}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LB1RA2LB_2RC3LB3RB2LA_2LC1RZ1LA2RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {76.17604}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LA1RZ0LB_2LC2LB1RC1RB_3LA3LC0LC0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {74.18390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2RA1LA1LB_2RC3RB1RZ3LC_2LA1RC1RB0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {69.55341}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Lúkos&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 1 ==&lt;br /&gt;
The initial phase of enumeration and reduction of [[holdouts]] took place in December 2024 and was done by Terry Ligocki using the Ligockis&#039; C++ and Python codes. The initial enumerations generated 600,253,156,787 TMs of which 42,391,877,333 were holdout TMs. Also found were 202,014,400,019 halting TMs and 355,846,879,435 infinite TMs. The number of holdouts was reduced to 434,787,751 TMs (a 98.97% reduction).&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Phase 1 Info&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Two C++ programs were run before the filters in the table.&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
lr_enum 3 4 8 /dev/null /dev/null 3x4.unk.txt false&lt;br /&gt;
00 &amp;lt;= XX &amp;lt; 47: lr_enum_continue 3x4.in.XX 1000 /dev/null /dev/null 3x4.unk.txt.XX XX false&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Both do the initial enumeration and simple filtering. The &amp;quot;/dev/null&amp;quot; in both commands would be files where the halting and infinite TMs would be stored. The first command generates the TMs from a TNF tree for BB(3,4) of depth 8 and outputs the holdouts to 3x4.unk.txt. This file was then divided into 48 pieces, 3x4.in.XX, 0 &amp;lt;= XX &amp;lt; 47. The second commands (one for each XX) continues the enumeration by running each TM for 1,000 steps. It classifies each as halting, infinite, or unknown/holdout. Again, the halting and infinite TMs are &amp;quot;written&amp;quot; to /dev/null, i.e., they aren&#039;t saved. The holdouts are stored in 48 files: 3x4.unk.txt.XX.&lt;br /&gt;
&lt;br /&gt;
For these runs the first command generated a total of 22,366,747 TMs: 932,198 halting, 235,446 infinite, and 21,199,103 holdouts. The second took the 22,366,747 holdout TMs and generated a total of 600,253,156,787 TMs: 202,014,400,019 halting, 355,846,879,435 infinite, and 42,391,877,333 holdouts. These holdouts were used as a starting point of the filters below.&lt;br /&gt;
&lt;br /&gt;
The &amp;quot;Description&amp;quot; column in the table below contain the command run. Two options are not given, &amp;quot;--infile=...&amp;quot; and an &amp;quot;--outfile=...&amp;quot;. These are necessary and specify where to read and write the results, respectively. Note: The work flow was to divide the input holdouts into 48 pieces, run the command on each piece simultaneously on one of 48 cores, and then combine the 48 results into a group of holdouts.&lt;br /&gt;
&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The details are given in this table:&lt;br /&gt;
&lt;br /&gt;
(done to reduce column size:&lt;br /&gt;
&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;= % Reduced,&lt;br /&gt;
&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;= Runtime (hours),&lt;br /&gt;
&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;= Decided,&lt;br /&gt;
&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;= Processed)&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: right&amp;quot;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |TMs/sec/core&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
!&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;&lt;br /&gt;
!&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|42,391,877,333&lt;br /&gt;
|32,247,381,725&lt;br /&gt;
|23.93%&lt;br /&gt;
|788.0&lt;br /&gt;
|3,576.08&lt;br /&gt;
|14,943.74&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Reverse_Engineer_Filter.py&lt;br /&gt;
|rowspan=&amp;quot;8&amp;quot; style=&amp;quot;text-align:left&amp;quot; |[https://drive.google.com/drive/folders/1EsFw5DOjjZ6Xzjc8QgRa2YkInrsmFnLX?usp=drive_link Google Drive]&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|32,247,381,725&lt;br /&gt;
|12,789,441,316&lt;br /&gt;
|60.34%&lt;br /&gt;
|6,185.2&lt;br /&gt;
|873.85&lt;br /&gt;
|1,448.22&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=1&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|12,789,441,316&lt;br /&gt;
|4,332,283,583&lt;br /&gt;
|66.13%&lt;br /&gt;
|4,771.0&lt;br /&gt;
|492.39&lt;br /&gt;
|744.62&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=2&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|4,332,283,583&lt;br /&gt;
|2,796,143,404&lt;br /&gt;
|35.46%&lt;br /&gt;
|7,873.1&lt;br /&gt;
|54.20&lt;br /&gt;
|152.85&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=3&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|2,796,143,404&lt;br /&gt;
|1,398,734,288&lt;br /&gt;
|49.98%&lt;br /&gt;
|10,239.4&lt;br /&gt;
|37.91&lt;br /&gt;
|75.85&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Enumerate.py --max-loops=1_000 --block-size=2 --time=10 --lin-steps=0 --no-reverse-engineer --save-freq=10_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|1,398,734,288&lt;br /&gt;
|764,851,053&lt;br /&gt;
|45.32%&lt;br /&gt;
|3,203.1&lt;br /&gt;
|54.97&lt;br /&gt;
|121.30&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Enumerate.py --max-loops=10_000 --block-size=12 --no-steps --time=0.01 --lin-steps=0 --no-ctl --no-reverse-engineer --save-freq=10_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|764,851,053&lt;br /&gt;
|581,654,405&lt;br /&gt;
|23.95%&lt;br /&gt;
|1,925.3&lt;br /&gt;
|26.43&lt;br /&gt;
|110.35&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --min-block-size=4 --max-block-size=12 --max-steps=1_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|581,654,405&lt;br /&gt;
|434,787,751&lt;br /&gt;
|25.25%&lt;br /&gt;
|9,042.5&lt;br /&gt;
|4.51&lt;br /&gt;
|17.87&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --min-block-size=4 --max-block-size=6 --max-steps=10_000&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 2 ==&lt;br /&gt;
XnoobSpeakable and Lúkos worked on applying mxdys&#039; deciders/parameters to the remaining holdouts. The previous holdouts list by Terry Ligocki was split up into 8696 files containing 50,000 holdouts each* (*the last one actually has 37,751) and the deciders were applied to the files individually. These files can be called subtasks. Lúkos made a Python script to compute the subtasks in parallel, based off of XnoobSpeakable&#039;s earlier imperfect script.&lt;br /&gt;
&lt;br /&gt;
Certain data such as TMs/sec/core is unavailable, because the amount of time the computation took was not kept track of.&lt;br /&gt;
&lt;br /&gt;
Stages 3 and 8 are lr_enum_continue computations to 1 million and 10 million steps respectively. Lúkos did not contribute to computing these stages, but rather created a Python script to compute them in bulk, which XnoobSpeakable used.&lt;br /&gt;
&lt;br /&gt;
For the &amp;quot;Contribution&amp;quot; column, the first number is the amount of subtasks solved by XnoobSpeakable, the 2nd is the amount solved by Lúkos. Note that the counts are unequal, because Lúkos has a slower CPU with a lower core count. According to XnoobSpeakable, the time contribution from both contributors is roughly equal. Lúkos also worked on the Python scripts used, while XnoobSpeakable worked on compiling holdouts lists and finding optimal deciders to apply. &lt;br /&gt;
&lt;br /&gt;
[[User:Peacemaker II|Peacemaker II]] worked on verifying the validity of the results as well as providing solved TM counts per decider. Stages 1, 2, and 4 have been validated - no dropped TMs. XnoobSpeakable verified stage 6.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;nowiki&amp;gt;**&amp;lt;/nowiki&amp;gt;Stage 9: Uses two substages, rather than subtasks, applying Reverse-Engineer and Backtracking deciders.&lt;br /&gt;
&lt;br /&gt;
Stage 10 is also seperated into substages A, B, and C for ease of computation.&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1MamU8zivuqoe4j82vpb-jYBfc4wvXNRc All scripts used are available here.] The details will be given in this table:&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: left&amp;quot;&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
! colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |% Reduced&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Subtasks&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Contribution&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Verified&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |XnoobSpeakable, Lúkos&lt;br /&gt;
|434,787,751&lt;br /&gt;
|64,777,377&lt;br /&gt;
|85.1%&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Phase 2 stage 1&lt;br /&gt;
|8696&lt;br /&gt;
|7696 / 1000&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|64,777,377&lt;br /&gt;
|37,016,957&lt;br /&gt;
|42.9%&lt;br /&gt;
|Phase 2 stage 2&lt;br /&gt;
|1296&lt;br /&gt;
|1000 / 296&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|37,016,957&lt;br /&gt;
|26,266,261&lt;br /&gt;
|29.0%&lt;br /&gt;
|Phase 2 stage 3&lt;br /&gt;
|741&lt;br /&gt;
|741 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|26,266,261&lt;br /&gt;
|22,396,711&lt;br /&gt;
|14.7%&lt;br /&gt;
|Phase 2 stage 4&lt;br /&gt;
|526&lt;br /&gt;
|485 / 41&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|22,396,711&lt;br /&gt;
|17,983,810&lt;br /&gt;
|19.7%&lt;br /&gt;
|Phase 2 stage 5&lt;br /&gt;
|448&lt;br /&gt;
|390 / 58&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|17,983,810&lt;br /&gt;
|15,564,491&lt;br /&gt;
|13.5%&lt;br /&gt;
|Phase 2 stage 6&lt;br /&gt;
|360&lt;br /&gt;
|300 / 60&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|15,564,491&lt;br /&gt;
|15,136,283&lt;br /&gt;
|2.75%&lt;br /&gt;
|Phase 2 stage 7&lt;br /&gt;
|312&lt;br /&gt;
|260 / 52&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|15,136,283&lt;br /&gt;
|14,518,243&lt;br /&gt;
|4.08%&lt;br /&gt;
|Phase 2 stage 8&lt;br /&gt;
|303&lt;br /&gt;
|303 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|14,518,243&lt;br /&gt;
|14,413,460&lt;br /&gt;
|0.72%&lt;br /&gt;
|Phase 2 stage 9&lt;br /&gt;
|2**&lt;br /&gt;
|2 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|14,413,460&lt;br /&gt;
|13,733,388&lt;br /&gt;
|4.72%&lt;br /&gt;
|Phase 2 stage 10A&lt;br /&gt;
|289&lt;br /&gt;
|216 / 73&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|13,733,388&lt;br /&gt;
|13,334,244&lt;br /&gt;
|2.91%&lt;br /&gt;
|Phase 2 stage 10B&lt;br /&gt;
|275&lt;br /&gt;
|200 / 75&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|13,334,244&lt;br /&gt;
|12,435,284&lt;br /&gt;
|6.74%&lt;br /&gt;
|Phase 2 stage 10C&lt;br /&gt;
|267&lt;br /&gt;
|190 / 77&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 2 Data ==&lt;br /&gt;
Here we will list the deciders applied during the various stages of Phase 2. Each decider within a stage was not applied in a specific order. Some stages have a number of TMs solved by every decider at the end of each row, provided by Peacemaker II.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Details&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Phase 2 stage 1:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 1000 NG_n 2 run 86569103&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 1000 NG_n 1 run 26093656&lt;br /&gt;
chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 13972946&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 6 mod 3 n 2 run 7190617&lt;br /&gt;
chr_LRUH 10 chr_H 6 MitM_CTL NG maxT 1000 NG_n 2 run 90302784&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 1 n 4 run 4342619&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 12 H 0 tH 1 n 2 run 11764327&lt;br /&gt;
chr_LRUH 2 chr_H 2 MitM_CTL NG maxT 1000 NG_n 1 run 55465842&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 2 n 1 run 17805678&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 2 H 0 tH 0 n 1 run 12623067&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 3000 NG_n 2 run 2240499&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 4 H 1 tH 1 n 2 run 10223131&lt;br /&gt;
chr_LRUH 6 chr_H 4 MitM_CTL NG maxT 10000 NG_n 1 run 2901053&lt;br /&gt;
chr_LRUH 22 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 28515052&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 2:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 4 n 8 run 1030303&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 8 mod 2 n 2 run 1465523&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 10000 NG_n 4 run 5232902&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 1720994&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 8 mod 3 n 2 run 555883&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 3 H 1 tH 0 n 6 run 290547&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 1 run 67506&lt;br /&gt;
chr_LRUH 10 chr_H 8 MitM_CTL NG maxT 10000 NG_n 2 run 1577979&lt;br /&gt;
chr_LRUH 6 chr_H 6 MitM_CTL NG maxT 3000 NG_n 2 run 1604533&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 4 n 6 run 10012948&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 8 H 0 tH 0 n 4 run 526822&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 1 n 1 run 34821&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 6 H 0 tH 1 n 3 run 356375&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 20 run 1970422&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 6 mod 3 n 1 run 443339&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 3 H 0 tH 1 n 2 run 518824&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 2 mod 2 n 1 run 61865&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 1 tH 1 n 2 run 288834&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 3 (lr_enum_continue from [https://github.com/sligocki/busy-beaver busy-beaver] for 1 million steps):&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
lr_enum_continue ./in.txt 1000000 ./halt.txt ./inf.txt ./unknown.txt &amp;quot;&amp;quot; false&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 4:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 3000 NG_n 2 run 202520&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 3000 NG_n 1 run 559013&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 4 n 1 run 1584&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 10000 NG_n 1 run 148544&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 1 run 812666&lt;br /&gt;
chr_asth 0 chr_LRUH 48 chr_H 48 MitM_CTL NG maxT 10000 NG_n 3 run 2043171&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 4 mod 2 n 1 run 102052&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 5:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 0 tH 1 n 10 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 16 H 1 tH 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 6 n 2 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 10000 NG_n 3 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 5 n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 3 H 1 tH 0 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 3 mod 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 2 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 5 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 4 mod 4 n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 0 tH 1 n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 6 mod 3 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 2 MitM_CTL NG maxT 30000 NG_n 3 run&lt;br /&gt;
chr_LRUH 16 chr_H 12 MitM_CTL NG maxT 30000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 8 H 2 tH 1 n 2 run&lt;br /&gt;
chr_asth 0 chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 10000 NG_n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 16 H 1 tH 0 n 6 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 16 H 0 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 6 chr_H 2 MitM_CTL NG maxT 10000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 3 H 1 tH 0 n 2 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 2 mod 3 n 1 run&lt;br /&gt;
chr_LRUH 3 chr_H 1 MitM_CTL NG maxT 100000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 1 tH 0 n 4 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 2 mod 2 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 4 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 4 H 2 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 0 MitM_CTL NG maxT 1000 NG_n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 2 mod 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 3 mod 6 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 8 chr_H 8 MitM_CTL NG maxT 10000 NG_n 2 run&lt;br /&gt;
chr_asth 0 chr_LRUH 60 chr_H 60 MitM_CTL NG maxT 30000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 3 mod 2 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 4 H 1 tH 1 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 3 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 3000 NG_n 2 run&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 6:&lt;br /&gt;
&lt;br /&gt;
XnoobSpeakable ran Enumerate.py with a 0.15s/TM time limit, Lúkos ran it with a 0.75s/TM time limit.&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
python &amp;quot;+str(pl.Path(&amp;quot;../../Code/Enumerate.py&amp;quot;))+&amp;quot; --infile=&amp;quot;+str(pl.Path(&amp;quot;./in.txt&amp;quot;))+&amp;quot; --outfile=&amp;quot;+str(pl.Path(&amp;quot;./out.pb&amp;quot;))+&amp;quot; --max-loops=990_000 --tape-limit=9_900 --no-steps --time=&amp;quot;+str(time)+&amp;quot; --recursive --exp-linear-rules  --lin-steps=0 --no-ctl --save-freq=10_000&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 7:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 1000 NG_n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 12 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 1 mod 5 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 1000 NG_n 1 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 30000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 4 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 16 H 0 tH 1 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 3000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 4 H 0 tH 1 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 0 tH 2 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 12 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 1 mod 2 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 2 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 2 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 1 mod 3 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 1 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 2 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 6 H 0 tH 0 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 1000 NG_n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 100000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 1 mod 1 n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 2 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 30000 NG_n 1 run&lt;br /&gt;
&amp;lt;/pre&amp;gt;Phase 2 stage 8 (lr_enum_continue from [https://github.com/sligocki/busy-beaver busy-beaver] for 10 million steps):&amp;lt;pre&amp;gt;lr_enum_continue ./in.txt 10000000 ./halt.txt ./inf.txt ./unknown.txt &amp;quot;&amp;quot; false&amp;lt;/pre&amp;gt;Phase 2 stage 9a:&amp;lt;pre&amp;gt;python3 Code/Reverse_Engineer_Filter.py --infile=&#039;/home/xnoobspeakable/Desktop/Busy Beavers/BB(3,4)/resultsst8/3x4_holdouts_14518243.txt&#039; --outfile=&#039;out.txt&#039;&amp;lt;/pre&amp;gt;Phase 2 stage 9b:&amp;lt;pre&amp;gt;python3 ./Code/Backtracking_Filter.py --infile=&#039;/home/xnoobspeakable/Desktop/Busy Beavers/BB(3,4)/resultsst9/unknown.txt&#039;  --outfile=&#039;./b1.pb&#039; --steps=100&amp;lt;/pre&amp;gt;Phase 2 stage 10a:&amp;lt;pre&amp;gt;chr_LRUH 28 chr_LRUn 2 MitM_CTL NG maxT 30000 NG_n 8 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 6 H 1 tH 2 n 8 run&amp;lt;/pre&amp;gt;Phase 2 stage 10b:&amp;lt;pre&amp;gt;MitM_CTL CPS_LRU sim 1,001 maxT 10000 LRUH 2 H 0 tH 0 n 20 run&lt;br /&gt;
chr_LRUH 8 chr_H 8 MitM_CTL NG maxT 100000 NG_n 4 run&amp;lt;/pre&amp;gt;Phase 2 stage 10c:&amp;lt;pre&amp;gt;chr_asth 0 chr_LRUH 60 chr_H 60 MitM_CTL NG maxT 100000 NG_n 8 run&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 100000 NG_n 11 run&amp;lt;/pre&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Phase 3 ==&lt;br /&gt;
&lt;br /&gt;
Phase 3 began with Andrew Ducharme applying a FAR decider by mxdys. The following stages were done by XnoobSpeakable. The &amp;quot;Substages&amp;quot; column refers to the amount of separate runs of deciders being applied to the full holdout list, the files are not split into smaller chunks (&amp;quot;Subtasks&amp;quot;) like in Phase 2. (Note that Phase 2 stage 9 did actually use substages, like all of Phase 3.)&lt;br /&gt;
&lt;br /&gt;
Stage 2 is currently in progress, with 2 substages completed. The amount of holdouts is unclear due to a minor discrepancy with the predicted and observed counts.&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: left&amp;quot;&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
! colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |% Reduced&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Substages&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Verified&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Andrew Ducharme&lt;br /&gt;
|12,435,284&lt;br /&gt;
|12,049,358&lt;br /&gt;
|3.10%&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Phase 3 stage 1&lt;br /&gt;
|1&lt;br /&gt;
|[https://drive.google.com/drive/folders/1lNKc_GF2sa5ZfosleAlMNBQ3uJV4qClo Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|12,049,358&lt;br /&gt;
|≤11,852,797&lt;br /&gt;
|&lt;br /&gt;
|Phase 3 stage 2&lt;br /&gt;
|2/4 (in prog.)&lt;br /&gt;
|[https://drive.google.com/drive/folders/1lNKc_GF2sa5ZfosleAlMNBQ3uJV4qClo Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 3 Data ==&lt;br /&gt;
Here we will list the deciders applied during the various stages of Phase 3. Some stages have a number of TMs solved by every decider at the end of each row.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Details&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Phase 2 stage 1:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
FAR CPS_LRU maxT 100000 LRUH 2 H 0 tH 0 n 2 368,121&lt;br /&gt;
FAR CPS_LRU maxT 100000 LRUH 1 H 0 tH 0 n [1-4] 17,660&lt;br /&gt;
FAR CPS_LRU maxT 100000 LRUH 2 H 0 tH 0 n 1 145&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:BB Domains]][[Category:BB(3,4)]]&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=BB(3,4)&amp;diff=7430</id>
		<title>BB(3,4)</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=BB(3,4)&amp;diff=7430"/>
		<updated>2026-05-04T16:42:29Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: /* Phase 3 */ Fixed explanation issue&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The Busy Beaver problem for 3 states and 4 symbols is unsolved, with the existence of [[Cryptids]] in the domain being given by the discovery of [[Bigfoot]] in [[BB(3,3)]]. The current BB(3,4) [[Champions#3-Symbol TMs|champion]] is {{TM|1RB3LB1RZ2RA_2LC3RB1LC2RA_3RB1LB3LC2RC|halt}}. It runs for &amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt; steps before halting. It was discovered by Pavel Kropitz in 2024 and was analysed by Shawn Ligocki in the same year.&lt;br /&gt;
&lt;br /&gt;
== Top Halters ==&lt;br /&gt;
The top 20 known longest running halting BB(3,4) TMs are:&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!Standard format&lt;br /&gt;
!(approximate) runtime&lt;br /&gt;
!Discoverer&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LB1RZ2RA_2LC3RB1LC2RA_3RB1LB3LC2RC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ1LA2RB_1RC3RC1LA2LB_2LB2RC1LC3RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{12} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3RB1LC2LA_2LA2RB1LB3RA_3LA1RZ1LC2RA}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{6} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3RB1LC2LA_2LA2RB1LB3RA_1RA1RZ1LC2RA}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{6} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LB1RZ3LA_0LC3RB3RC1LB_2RB2LA3RA1LC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {2\,048}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ1LA2RB_2RC3RC3LB2RA_2LB3RB3LC1LA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {189.05690}&amp;lt;/math&amp;gt;&lt;br /&gt;
|[[User:XnoobSpeakable|XnoobSpeakable]] &lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LA1RA2LB_2LC1RA2RC3RB_1RZ1LA2RA3RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {188.16168}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LB2LA3LC_1LA2RB3RA1LB_1RZ1RB2LB3LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {188.16168}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA3LA3RB_2LC2RC1LB2RA_2RA2RB0LB1RZ|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {149.57147}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LB1RZ3LA_1LA3RC2LC1LC_2LA3RC0RA1LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LB1RZ3LA_1LA3RC3LB1LC_2RA3RC0RA1LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LC1RC2RA_1LA3RA2RB1RZ_3LB2LC1RA0LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|[[User:WarpedWartWars|Lúkos]]&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA1LB3RA_1RC3LB1LC1RC_2LA2RA1RZ0LA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {96.06390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA1LB3RA_1RC3LB1LC1RC_2LA2RA1RZ1RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {96.06390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LC0RA1RC_2LA1RZ3LA2RB_3LA0RA1LA0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {95.24590}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LC0RA1RC_2LA1RZ3LA2RB_3LA0RA3LB0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {95.24590}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LA1RA1RC_1LA3LC3RB1RC_3LA1RZ3LB2RC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {84.19957}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LB1RA2LB_2RC3LB3RB2LA_2LC1RZ1LA2RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {76.17604}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LA1RZ0LB_2LC2LB1RC1RB_3LA3LC0LC0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {74.18390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2RA1LA1LB_2RC3RB1RZ3LC_2LA1RC1RB0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {69.55341}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Lúkos&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 1 ==&lt;br /&gt;
The initial phase of enumeration and reduction of [[holdouts]] took place in December 2024 and was done by Terry Ligocki using the Ligockis&#039; C++ and Python codes. The initial enumerations generated 600,253,156,787 TMs of which 42,391,877,333 were holdout TMs. Also found were 202,014,400,019 halting TMs and 355,846,879,435 infinite TMs. The number of holdouts was reduced to 434,787,751 TMs (a 98.97% reduction).&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Phase 1 Info&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Two C++ programs were run before the filters in the table.&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
lr_enum 3 4 8 /dev/null /dev/null 3x4.unk.txt false&lt;br /&gt;
00 &amp;lt;= XX &amp;lt; 47: lr_enum_continue 3x4.in.XX 1000 /dev/null /dev/null 3x4.unk.txt.XX XX false&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Both do the initial enumeration and simple filtering. The &amp;quot;/dev/null&amp;quot; in both commands would be files where the halting and infinite TMs would be stored. The first command generates the TMs from a TNF tree for BB(3,4) of depth 8 and outputs the holdouts to 3x4.unk.txt. This file was then divided into 48 pieces, 3x4.in.XX, 0 &amp;lt;= XX &amp;lt; 47. The second commands (one for each XX) continues the enumeration by running each TM for 1,000 steps. It classifies each as halting, infinite, or unknown/holdout. Again, the halting and infinite TMs are &amp;quot;written&amp;quot; to /dev/null, i.e., they aren&#039;t saved. The holdouts are stored in 48 files: 3x4.unk.txt.XX.&lt;br /&gt;
&lt;br /&gt;
For these runs the first command generated a total of 22,366,747 TMs: 932,198 halting, 235,446 infinite, and 21,199,103 holdouts. The second took the 22,366,747 holdout TMs and generated a total of 600,253,156,787 TMs: 202,014,400,019 halting, 355,846,879,435 infinite, and 42,391,877,333 holdouts. These holdouts were used as a starting point of the filters below.&lt;br /&gt;
&lt;br /&gt;
The &amp;quot;Description&amp;quot; column in the table below contain the command run. Two options are not given, &amp;quot;--infile=...&amp;quot; and an &amp;quot;--outfile=...&amp;quot;. These are necessary and specify where to read and write the results, respectively. Note: The work flow was to divide the input holdouts into 48 pieces, run the command on each piece simultaneously on one of 48 cores, and then combine the 48 results into a group of holdouts.&lt;br /&gt;
&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The details are given in this table:&lt;br /&gt;
&lt;br /&gt;
(done to reduce column size:&lt;br /&gt;
&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;= % Reduced,&lt;br /&gt;
&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;= Runtime (hours),&lt;br /&gt;
&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;= Decided,&lt;br /&gt;
&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;= Processed)&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: right&amp;quot;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |TMs/sec/core&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
!&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;&lt;br /&gt;
!&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|42,391,877,333&lt;br /&gt;
|32,247,381,725&lt;br /&gt;
|23.93%&lt;br /&gt;
|788.0&lt;br /&gt;
|3,576.08&lt;br /&gt;
|14,943.74&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Reverse_Engineer_Filter.py&lt;br /&gt;
|rowspan=&amp;quot;8&amp;quot; style=&amp;quot;text-align:left&amp;quot; |[https://drive.google.com/drive/folders/1EsFw5DOjjZ6Xzjc8QgRa2YkInrsmFnLX?usp=drive_link Google Drive]&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|32,247,381,725&lt;br /&gt;
|12,789,441,316&lt;br /&gt;
|60.34%&lt;br /&gt;
|6,185.2&lt;br /&gt;
|873.85&lt;br /&gt;
|1,448.22&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=1&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|12,789,441,316&lt;br /&gt;
|4,332,283,583&lt;br /&gt;
|66.13%&lt;br /&gt;
|4,771.0&lt;br /&gt;
|492.39&lt;br /&gt;
|744.62&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=2&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|4,332,283,583&lt;br /&gt;
|2,796,143,404&lt;br /&gt;
|35.46%&lt;br /&gt;
|7,873.1&lt;br /&gt;
|54.20&lt;br /&gt;
|152.85&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=3&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|2,796,143,404&lt;br /&gt;
|1,398,734,288&lt;br /&gt;
|49.98%&lt;br /&gt;
|10,239.4&lt;br /&gt;
|37.91&lt;br /&gt;
|75.85&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Enumerate.py --max-loops=1_000 --block-size=2 --time=10 --lin-steps=0 --no-reverse-engineer --save-freq=10_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|1,398,734,288&lt;br /&gt;
|764,851,053&lt;br /&gt;
|45.32%&lt;br /&gt;
|3,203.1&lt;br /&gt;
|54.97&lt;br /&gt;
|121.30&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Enumerate.py --max-loops=10_000 --block-size=12 --no-steps --time=0.01 --lin-steps=0 --no-ctl --no-reverse-engineer --save-freq=10_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|764,851,053&lt;br /&gt;
|581,654,405&lt;br /&gt;
|23.95%&lt;br /&gt;
|1,925.3&lt;br /&gt;
|26.43&lt;br /&gt;
|110.35&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --min-block-size=4 --max-block-size=12 --max-steps=1_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|581,654,405&lt;br /&gt;
|434,787,751&lt;br /&gt;
|25.25%&lt;br /&gt;
|9,042.5&lt;br /&gt;
|4.51&lt;br /&gt;
|17.87&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --min-block-size=4 --max-block-size=6 --max-steps=10_000&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 2 ==&lt;br /&gt;
XnoobSpeakable and Lúkos worked on applying mxdys&#039; deciders/parameters to the remaining holdouts. The previous holdouts list by Terry Ligocki was split up into 8696 files containing 50,000 holdouts each* (*the last one actually has 37,751) and the deciders were applied to the files individually. These files can be called subtasks. Lúkos made a Python script to compute the subtasks in parallel, based off of XnoobSpeakable&#039;s earlier imperfect script.&lt;br /&gt;
&lt;br /&gt;
Certain data such as TMs/sec/core is unavailable, because the amount of time the computation took was not kept track of.&lt;br /&gt;
&lt;br /&gt;
Stages 3 and 8 are lr_enum_continue computations to 1 million and 10 million steps respectively. Lúkos did not contribute to computing these stages, but rather created a Python script to compute them in bulk, which XnoobSpeakable used.&lt;br /&gt;
&lt;br /&gt;
For the &amp;quot;Contribution&amp;quot; column, the first number is the amount of subtasks solved by XnoobSpeakable, the 2nd is the amount solved by Lúkos. Note that the counts are unequal, because Lúkos has a slower CPU with a lower core count. According to XnoobSpeakable, the time contribution from both contributors is roughly equal. Lúkos also worked on the Python scripts used, while XnoobSpeakable worked on compiling holdouts lists and finding optimal deciders to apply. &lt;br /&gt;
&lt;br /&gt;
[[User:Peacemaker II|Peacemaker II]] worked on verifying the validity of the results as well as providing solved TM counts per decider. Stages 1, 2, and 4 have been validated - no dropped TMs. XnoobSpeakable verified stage 6.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;nowiki&amp;gt;**&amp;lt;/nowiki&amp;gt;Stage 9: Uses two substages, rather than subtasks, applying Reverse-Engineer and Backtracking deciders.&lt;br /&gt;
&lt;br /&gt;
Stage 10 is also seperated into substages A, B, and C for ease of computation.&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1MamU8zivuqoe4j82vpb-jYBfc4wvXNRc All scripts used are available here.] The details will be given in this table:&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: left&amp;quot;&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
! colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |% Reduced&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Subtasks&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Contribution&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Verified&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |XnoobSpeakable, Lúkos&lt;br /&gt;
|434,787,751&lt;br /&gt;
|64,777,377&lt;br /&gt;
|85.1%&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Phase 2 stage 1&lt;br /&gt;
|8696&lt;br /&gt;
|7696 / 1000&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|64,777,377&lt;br /&gt;
|37,016,957&lt;br /&gt;
|42.9%&lt;br /&gt;
|Phase 2 stage 2&lt;br /&gt;
|1296&lt;br /&gt;
|1000 / 296&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|37,016,957&lt;br /&gt;
|26,266,261&lt;br /&gt;
|29.0%&lt;br /&gt;
|Phase 2 stage 3&lt;br /&gt;
|741&lt;br /&gt;
|741 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|26,266,261&lt;br /&gt;
|22,396,711&lt;br /&gt;
|14.7%&lt;br /&gt;
|Phase 2 stage 4&lt;br /&gt;
|526&lt;br /&gt;
|485 / 41&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|22,396,711&lt;br /&gt;
|17,983,810&lt;br /&gt;
|19.7%&lt;br /&gt;
|Phase 2 stage 5&lt;br /&gt;
|448&lt;br /&gt;
|390 / 58&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|17,983,810&lt;br /&gt;
|15,564,491&lt;br /&gt;
|13.5%&lt;br /&gt;
|Phase 2 stage 6&lt;br /&gt;
|360&lt;br /&gt;
|300 / 60&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|15,564,491&lt;br /&gt;
|15,136,283&lt;br /&gt;
|2.75%&lt;br /&gt;
|Phase 2 stage 7&lt;br /&gt;
|312&lt;br /&gt;
|260 / 52&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|15,136,283&lt;br /&gt;
|14,518,243&lt;br /&gt;
|4.08%&lt;br /&gt;
|Phase 2 stage 8&lt;br /&gt;
|303&lt;br /&gt;
|303 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|14,518,243&lt;br /&gt;
|14,413,460&lt;br /&gt;
|0.72%&lt;br /&gt;
|Phase 2 stage 9&lt;br /&gt;
|2**&lt;br /&gt;
|2 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|14,413,460&lt;br /&gt;
|13,733,388&lt;br /&gt;
|4.72%&lt;br /&gt;
|Phase 2 stage 10A&lt;br /&gt;
|289&lt;br /&gt;
|216 / 73&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|13,733,388&lt;br /&gt;
|13,334,244&lt;br /&gt;
|2.91%&lt;br /&gt;
|Phase 2 stage 10B&lt;br /&gt;
|275&lt;br /&gt;
|200 / 75&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|13,334,244&lt;br /&gt;
|12,435,284&lt;br /&gt;
|6.74%&lt;br /&gt;
|Phase 2 stage 10C&lt;br /&gt;
|267&lt;br /&gt;
|190 / 77&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 2 Data ==&lt;br /&gt;
Here we will list the deciders applied during the various stages of Phase 2. Each decider within a stage was not applied in a specific order. Some stages have a number of TMs solved by every decider at the end of each row, provided by Peacemaker II.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Details&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Phase 2 stage 1:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 1000 NG_n 2 run 86569103&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 1000 NG_n 1 run 26093656&lt;br /&gt;
chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 13972946&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 6 mod 3 n 2 run 7190617&lt;br /&gt;
chr_LRUH 10 chr_H 6 MitM_CTL NG maxT 1000 NG_n 2 run 90302784&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 1 n 4 run 4342619&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 12 H 0 tH 1 n 2 run 11764327&lt;br /&gt;
chr_LRUH 2 chr_H 2 MitM_CTL NG maxT 1000 NG_n 1 run 55465842&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 2 n 1 run 17805678&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 2 H 0 tH 0 n 1 run 12623067&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 3000 NG_n 2 run 2240499&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 4 H 1 tH 1 n 2 run 10223131&lt;br /&gt;
chr_LRUH 6 chr_H 4 MitM_CTL NG maxT 10000 NG_n 1 run 2901053&lt;br /&gt;
chr_LRUH 22 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 28515052&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 2:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 4 n 8 run 1030303&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 8 mod 2 n 2 run 1465523&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 10000 NG_n 4 run 5232902&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 1720994&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 8 mod 3 n 2 run 555883&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 3 H 1 tH 0 n 6 run 290547&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 1 run 67506&lt;br /&gt;
chr_LRUH 10 chr_H 8 MitM_CTL NG maxT 10000 NG_n 2 run 1577979&lt;br /&gt;
chr_LRUH 6 chr_H 6 MitM_CTL NG maxT 3000 NG_n 2 run 1604533&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 4 n 6 run 10012948&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 8 H 0 tH 0 n 4 run 526822&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 1 n 1 run 34821&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 6 H 0 tH 1 n 3 run 356375&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 20 run 1970422&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 6 mod 3 n 1 run 443339&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 3 H 0 tH 1 n 2 run 518824&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 2 mod 2 n 1 run 61865&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 1 tH 1 n 2 run 288834&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 3 (lr_enum_continue from [https://github.com/sligocki/busy-beaver busy-beaver] for 1 million steps):&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
lr_enum_continue ./in.txt 1000000 ./halt.txt ./inf.txt ./unknown.txt &amp;quot;&amp;quot; false&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 4:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 3000 NG_n 2 run 202520&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 3000 NG_n 1 run 559013&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 4 n 1 run 1584&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 10000 NG_n 1 run 148544&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 1 run 812666&lt;br /&gt;
chr_asth 0 chr_LRUH 48 chr_H 48 MitM_CTL NG maxT 10000 NG_n 3 run 2043171&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 4 mod 2 n 1 run 102052&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 5:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 0 tH 1 n 10 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 16 H 1 tH 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 6 n 2 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 10000 NG_n 3 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 5 n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 3 H 1 tH 0 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 3 mod 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 2 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 5 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 4 mod 4 n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 0 tH 1 n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 6 mod 3 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 2 MitM_CTL NG maxT 30000 NG_n 3 run&lt;br /&gt;
chr_LRUH 16 chr_H 12 MitM_CTL NG maxT 30000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 8 H 2 tH 1 n 2 run&lt;br /&gt;
chr_asth 0 chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 10000 NG_n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 16 H 1 tH 0 n 6 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 16 H 0 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 6 chr_H 2 MitM_CTL NG maxT 10000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 3 H 1 tH 0 n 2 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 2 mod 3 n 1 run&lt;br /&gt;
chr_LRUH 3 chr_H 1 MitM_CTL NG maxT 100000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 1 tH 0 n 4 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 2 mod 2 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 4 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 4 H 2 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 0 MitM_CTL NG maxT 1000 NG_n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 2 mod 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 3 mod 6 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 8 chr_H 8 MitM_CTL NG maxT 10000 NG_n 2 run&lt;br /&gt;
chr_asth 0 chr_LRUH 60 chr_H 60 MitM_CTL NG maxT 30000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 3 mod 2 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 4 H 1 tH 1 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 3 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 3000 NG_n 2 run&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 6:&lt;br /&gt;
&lt;br /&gt;
XnoobSpeakable ran Enumerate.py with a 0.15s/TM time limit, Lúkos ran it with a 0.75s/TM time limit.&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
python &amp;quot;+str(pl.Path(&amp;quot;../../Code/Enumerate.py&amp;quot;))+&amp;quot; --infile=&amp;quot;+str(pl.Path(&amp;quot;./in.txt&amp;quot;))+&amp;quot; --outfile=&amp;quot;+str(pl.Path(&amp;quot;./out.pb&amp;quot;))+&amp;quot; --max-loops=990_000 --tape-limit=9_900 --no-steps --time=&amp;quot;+str(time)+&amp;quot; --recursive --exp-linear-rules  --lin-steps=0 --no-ctl --save-freq=10_000&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 7:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 1000 NG_n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 12 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 1 mod 5 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 1000 NG_n 1 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 30000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 4 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 16 H 0 tH 1 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 3000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 4 H 0 tH 1 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 0 tH 2 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 12 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 1 mod 2 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 2 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 2 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 1 mod 3 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 1 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 2 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 6 H 0 tH 0 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 1000 NG_n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 100000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 1 mod 1 n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 2 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 30000 NG_n 1 run&lt;br /&gt;
&amp;lt;/pre&amp;gt;Phase 2 stage 8 (lr_enum_continue from [https://github.com/sligocki/busy-beaver busy-beaver] for 10 million steps):&amp;lt;pre&amp;gt;lr_enum_continue ./in.txt 10000000 ./halt.txt ./inf.txt ./unknown.txt &amp;quot;&amp;quot; false&amp;lt;/pre&amp;gt;Phase 2 stage 9a:&amp;lt;pre&amp;gt;python3 Code/Reverse_Engineer_Filter.py --infile=&#039;/home/xnoobspeakable/Desktop/Busy Beavers/BB(3,4)/resultsst8/3x4_holdouts_14518243.txt&#039; --outfile=&#039;out.txt&#039;&amp;lt;/pre&amp;gt;Phase 2 stage 9b:&amp;lt;pre&amp;gt;python3 ./Code/Backtracking_Filter.py --infile=&#039;/home/xnoobspeakable/Desktop/Busy Beavers/BB(3,4)/resultsst9/unknown.txt&#039;  --outfile=&#039;./b1.pb&#039; --steps=100&amp;lt;/pre&amp;gt;Phase 2 stage 10a:&amp;lt;pre&amp;gt;chr_LRUH 28 chr_LRUn 2 MitM_CTL NG maxT 30000 NG_n 8 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 6 H 1 tH 2 n 8 run&amp;lt;/pre&amp;gt;Phase 2 stage 10b:&amp;lt;pre&amp;gt;MitM_CTL CPS_LRU sim 1,001 maxT 10000 LRUH 2 H 0 tH 0 n 20 run&lt;br /&gt;
chr_LRUH 8 chr_H 8 MitM_CTL NG maxT 100000 NG_n 4 run&amp;lt;/pre&amp;gt;Phase 2 stage 10c:&amp;lt;pre&amp;gt;chr_asth 0 chr_LRUH 60 chr_H 60 MitM_CTL NG maxT 100000 NG_n 8 run&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 100000 NG_n 11 run&amp;lt;/pre&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Phase 3 ==&lt;br /&gt;
&lt;br /&gt;
Phase 3 began with Andrew Ducharme applying a FAR decider by mxdys. The following stages were done by XnoobSpeakable. The &amp;quot;Substages&amp;quot; column refers to the amount of separate runs of deciders being applied to the full holdout list, the files are not split into smaller chunks (&amp;quot;Subtasks&amp;quot;) like in Phase 2. (Note that Phase 2 stage 9 did actually use substages, like all of Phase 3.)&lt;br /&gt;
&lt;br /&gt;
Stage 2 is currently in progress, with 2 substages completed. The amount of holdouts is unclear due to a minor discrepancy with the predicted and observed counts.&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: left&amp;quot;&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
! colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |% Reduced&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Substages&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Verified&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Andrew Ducharme&lt;br /&gt;
|12,435,284&lt;br /&gt;
|12,049,358&lt;br /&gt;
|3.10%&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Phase 3 stage 1&lt;br /&gt;
|1&lt;br /&gt;
|[https://drive.google.com/drive/folders/1lNKc_GF2sa5ZfosleAlMNBQ3uJV4qClo Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|12,049,358&lt;br /&gt;
|≤11,894,437&lt;br /&gt;
|&lt;br /&gt;
|Phase 3 stage 2&lt;br /&gt;
|2/4 (in prog.)&lt;br /&gt;
|[https://drive.google.com/drive/folders/1lNKc_GF2sa5ZfosleAlMNBQ3uJV4qClo Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 3 Data ==&lt;br /&gt;
Here we will list the deciders applied during the various stages of Phase 3. Some stages have a number of TMs solved by every decider at the end of each row.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Details&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Phase 2 stage 1:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
FAR CPS_LRU maxT 100000 LRUH 2 H 0 tH 0 n 2 368,121&lt;br /&gt;
FAR CPS_LRU maxT 100000 LRUH 1 H 0 tH 0 n [1-4] 17,660&lt;br /&gt;
FAR CPS_LRU maxT 100000 LRUH 2 H 0 tH 0 n 1 145&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:BB Domains]][[Category:BB(3,4)]]&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=BB(3,4)&amp;diff=7429</id>
		<title>BB(3,4)</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=BB(3,4)&amp;diff=7429"/>
		<updated>2026-05-04T16:41:47Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: /* Phase 3 */ A lot of stage and substage stuff&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The Busy Beaver problem for 3 states and 4 symbols is unsolved, with the existence of [[Cryptids]] in the domain being given by the discovery of [[Bigfoot]] in [[BB(3,3)]]. The current BB(3,4) [[Champions#3-Symbol TMs|champion]] is {{TM|1RB3LB1RZ2RA_2LC3RB1LC2RA_3RB1LB3LC2RC|halt}}. It runs for &amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt; steps before halting. It was discovered by Pavel Kropitz in 2024 and was analysed by Shawn Ligocki in the same year.&lt;br /&gt;
&lt;br /&gt;
== Top Halters ==&lt;br /&gt;
The top 20 known longest running halting BB(3,4) TMs are:&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!Standard format&lt;br /&gt;
!(approximate) runtime&lt;br /&gt;
!Discoverer&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LB1RZ2RA_2LC3RB1LC2RA_3RB1LB3LC2RC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ1LA2RB_1RC3RC1LA2LB_2LB2RC1LC3RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{12} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3RB1LC2LA_2LA2RB1LB3RA_3LA1RZ1LC2RA}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{6} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3RB1LC2LA_2LA2RB1LB3RA_1RA1RZ1LC2RA}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{6} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LB1RZ3LA_0LC3RB3RC1LB_2RB2LA3RA1LC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {2\,048}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ1LA2RB_2RC3RC3LB2RA_2LB3RB3LC1LA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {189.05690}&amp;lt;/math&amp;gt;&lt;br /&gt;
|[[User:XnoobSpeakable|XnoobSpeakable]] &lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LA1RA2LB_2LC1RA2RC3RB_1RZ1LA2RA3RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {188.16168}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LB2LA3LC_1LA2RB3RA1LB_1RZ1RB2LB3LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {188.16168}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA3LA3RB_2LC2RC1LB2RA_2RA2RB0LB1RZ|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {149.57147}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LB1RZ3LA_1LA3RC2LC1LC_2LA3RC0RA1LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LB1RZ3LA_1LA3RC3LB1LC_2RA3RC0RA1LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LC1RC2RA_1LA3RA2RB1RZ_3LB2LC1RA0LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|[[User:WarpedWartWars|Lúkos]]&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA1LB3RA_1RC3LB1LC1RC_2LA2RA1RZ0LA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {96.06390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA1LB3RA_1RC3LB1LC1RC_2LA2RA1RZ1RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {96.06390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LC0RA1RC_2LA1RZ3LA2RB_3LA0RA1LA0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {95.24590}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LC0RA1RC_2LA1RZ3LA2RB_3LA0RA3LB0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {95.24590}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LA1RA1RC_1LA3LC3RB1RC_3LA1RZ3LB2RC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {84.19957}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LB1RA2LB_2RC3LB3RB2LA_2LC1RZ1LA2RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {76.17604}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LA1RZ0LB_2LC2LB1RC1RB_3LA3LC0LC0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {74.18390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2RA1LA1LB_2RC3RB1RZ3LC_2LA1RC1RB0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {69.55341}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Lúkos&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 1 ==&lt;br /&gt;
The initial phase of enumeration and reduction of [[holdouts]] took place in December 2024 and was done by Terry Ligocki using the Ligockis&#039; C++ and Python codes. The initial enumerations generated 600,253,156,787 TMs of which 42,391,877,333 were holdout TMs. Also found were 202,014,400,019 halting TMs and 355,846,879,435 infinite TMs. The number of holdouts was reduced to 434,787,751 TMs (a 98.97% reduction).&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Phase 1 Info&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Two C++ programs were run before the filters in the table.&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
lr_enum 3 4 8 /dev/null /dev/null 3x4.unk.txt false&lt;br /&gt;
00 &amp;lt;= XX &amp;lt; 47: lr_enum_continue 3x4.in.XX 1000 /dev/null /dev/null 3x4.unk.txt.XX XX false&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Both do the initial enumeration and simple filtering. The &amp;quot;/dev/null&amp;quot; in both commands would be files where the halting and infinite TMs would be stored. The first command generates the TMs from a TNF tree for BB(3,4) of depth 8 and outputs the holdouts to 3x4.unk.txt. This file was then divided into 48 pieces, 3x4.in.XX, 0 &amp;lt;= XX &amp;lt; 47. The second commands (one for each XX) continues the enumeration by running each TM for 1,000 steps. It classifies each as halting, infinite, or unknown/holdout. Again, the halting and infinite TMs are &amp;quot;written&amp;quot; to /dev/null, i.e., they aren&#039;t saved. The holdouts are stored in 48 files: 3x4.unk.txt.XX.&lt;br /&gt;
&lt;br /&gt;
For these runs the first command generated a total of 22,366,747 TMs: 932,198 halting, 235,446 infinite, and 21,199,103 holdouts. The second took the 22,366,747 holdout TMs and generated a total of 600,253,156,787 TMs: 202,014,400,019 halting, 355,846,879,435 infinite, and 42,391,877,333 holdouts. These holdouts were used as a starting point of the filters below.&lt;br /&gt;
&lt;br /&gt;
The &amp;quot;Description&amp;quot; column in the table below contain the command run. Two options are not given, &amp;quot;--infile=...&amp;quot; and an &amp;quot;--outfile=...&amp;quot;. These are necessary and specify where to read and write the results, respectively. Note: The work flow was to divide the input holdouts into 48 pieces, run the command on each piece simultaneously on one of 48 cores, and then combine the 48 results into a group of holdouts.&lt;br /&gt;
&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The details are given in this table:&lt;br /&gt;
&lt;br /&gt;
(done to reduce column size:&lt;br /&gt;
&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;= % Reduced,&lt;br /&gt;
&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;= Runtime (hours),&lt;br /&gt;
&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;= Decided,&lt;br /&gt;
&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;= Processed)&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: right&amp;quot;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |TMs/sec/core&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
!&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;&lt;br /&gt;
!&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|42,391,877,333&lt;br /&gt;
|32,247,381,725&lt;br /&gt;
|23.93%&lt;br /&gt;
|788.0&lt;br /&gt;
|3,576.08&lt;br /&gt;
|14,943.74&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Reverse_Engineer_Filter.py&lt;br /&gt;
|rowspan=&amp;quot;8&amp;quot; style=&amp;quot;text-align:left&amp;quot; |[https://drive.google.com/drive/folders/1EsFw5DOjjZ6Xzjc8QgRa2YkInrsmFnLX?usp=drive_link Google Drive]&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|32,247,381,725&lt;br /&gt;
|12,789,441,316&lt;br /&gt;
|60.34%&lt;br /&gt;
|6,185.2&lt;br /&gt;
|873.85&lt;br /&gt;
|1,448.22&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=1&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|12,789,441,316&lt;br /&gt;
|4,332,283,583&lt;br /&gt;
|66.13%&lt;br /&gt;
|4,771.0&lt;br /&gt;
|492.39&lt;br /&gt;
|744.62&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=2&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|4,332,283,583&lt;br /&gt;
|2,796,143,404&lt;br /&gt;
|35.46%&lt;br /&gt;
|7,873.1&lt;br /&gt;
|54.20&lt;br /&gt;
|152.85&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=3&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|2,796,143,404&lt;br /&gt;
|1,398,734,288&lt;br /&gt;
|49.98%&lt;br /&gt;
|10,239.4&lt;br /&gt;
|37.91&lt;br /&gt;
|75.85&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Enumerate.py --max-loops=1_000 --block-size=2 --time=10 --lin-steps=0 --no-reverse-engineer --save-freq=10_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|1,398,734,288&lt;br /&gt;
|764,851,053&lt;br /&gt;
|45.32%&lt;br /&gt;
|3,203.1&lt;br /&gt;
|54.97&lt;br /&gt;
|121.30&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Enumerate.py --max-loops=10_000 --block-size=12 --no-steps --time=0.01 --lin-steps=0 --no-ctl --no-reverse-engineer --save-freq=10_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|764,851,053&lt;br /&gt;
|581,654,405&lt;br /&gt;
|23.95%&lt;br /&gt;
|1,925.3&lt;br /&gt;
|26.43&lt;br /&gt;
|110.35&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --min-block-size=4 --max-block-size=12 --max-steps=1_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|581,654,405&lt;br /&gt;
|434,787,751&lt;br /&gt;
|25.25%&lt;br /&gt;
|9,042.5&lt;br /&gt;
|4.51&lt;br /&gt;
|17.87&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --min-block-size=4 --max-block-size=6 --max-steps=10_000&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 2 ==&lt;br /&gt;
XnoobSpeakable and Lúkos worked on applying mxdys&#039; deciders/parameters to the remaining holdouts. The previous holdouts list by Terry Ligocki was split up into 8696 files containing 50,000 holdouts each* (*the last one actually has 37,751) and the deciders were applied to the files individually. These files can be called subtasks. Lúkos made a Python script to compute the subtasks in parallel, based off of XnoobSpeakable&#039;s earlier imperfect script.&lt;br /&gt;
&lt;br /&gt;
Certain data such as TMs/sec/core is unavailable, because the amount of time the computation took was not kept track of.&lt;br /&gt;
&lt;br /&gt;
Stages 3 and 8 are lr_enum_continue computations to 1 million and 10 million steps respectively. Lúkos did not contribute to computing these stages, but rather created a Python script to compute them in bulk, which XnoobSpeakable used.&lt;br /&gt;
&lt;br /&gt;
For the &amp;quot;Contribution&amp;quot; column, the first number is the amount of subtasks solved by XnoobSpeakable, the 2nd is the amount solved by Lúkos. Note that the counts are unequal, because Lúkos has a slower CPU with a lower core count. According to XnoobSpeakable, the time contribution from both contributors is roughly equal. Lúkos also worked on the Python scripts used, while XnoobSpeakable worked on compiling holdouts lists and finding optimal deciders to apply. &lt;br /&gt;
&lt;br /&gt;
[[User:Peacemaker II|Peacemaker II]] worked on verifying the validity of the results as well as providing solved TM counts per decider. Stages 1, 2, and 4 have been validated - no dropped TMs. XnoobSpeakable verified stage 6.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;nowiki&amp;gt;**&amp;lt;/nowiki&amp;gt;Stage 9: Uses two substages, rather than subtasks, applying Reverse-Engineer and Backtracking deciders.&lt;br /&gt;
&lt;br /&gt;
Stage 10 is also seperated into substages A, B, and C for ease of computation.&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1MamU8zivuqoe4j82vpb-jYBfc4wvXNRc All scripts used are available here.] The details will be given in this table:&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: left&amp;quot;&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
! colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |% Reduced&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Subtasks&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Contribution&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Verified&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |XnoobSpeakable, Lúkos&lt;br /&gt;
|434,787,751&lt;br /&gt;
|64,777,377&lt;br /&gt;
|85.1%&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Phase 2 stage 1&lt;br /&gt;
|8696&lt;br /&gt;
|7696 / 1000&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|64,777,377&lt;br /&gt;
|37,016,957&lt;br /&gt;
|42.9%&lt;br /&gt;
|Phase 2 stage 2&lt;br /&gt;
|1296&lt;br /&gt;
|1000 / 296&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|37,016,957&lt;br /&gt;
|26,266,261&lt;br /&gt;
|29.0%&lt;br /&gt;
|Phase 2 stage 3&lt;br /&gt;
|741&lt;br /&gt;
|741 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|26,266,261&lt;br /&gt;
|22,396,711&lt;br /&gt;
|14.7%&lt;br /&gt;
|Phase 2 stage 4&lt;br /&gt;
|526&lt;br /&gt;
|485 / 41&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|22,396,711&lt;br /&gt;
|17,983,810&lt;br /&gt;
|19.7%&lt;br /&gt;
|Phase 2 stage 5&lt;br /&gt;
|448&lt;br /&gt;
|390 / 58&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|17,983,810&lt;br /&gt;
|15,564,491&lt;br /&gt;
|13.5%&lt;br /&gt;
|Phase 2 stage 6&lt;br /&gt;
|360&lt;br /&gt;
|300 / 60&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|15,564,491&lt;br /&gt;
|15,136,283&lt;br /&gt;
|2.75%&lt;br /&gt;
|Phase 2 stage 7&lt;br /&gt;
|312&lt;br /&gt;
|260 / 52&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|15,136,283&lt;br /&gt;
|14,518,243&lt;br /&gt;
|4.08%&lt;br /&gt;
|Phase 2 stage 8&lt;br /&gt;
|303&lt;br /&gt;
|303 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|14,518,243&lt;br /&gt;
|14,413,460&lt;br /&gt;
|0.72%&lt;br /&gt;
|Phase 2 stage 9&lt;br /&gt;
|2**&lt;br /&gt;
|2 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|14,413,460&lt;br /&gt;
|13,733,388&lt;br /&gt;
|4.72%&lt;br /&gt;
|Phase 2 stage 10A&lt;br /&gt;
|289&lt;br /&gt;
|216 / 73&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|13,733,388&lt;br /&gt;
|13,334,244&lt;br /&gt;
|2.91%&lt;br /&gt;
|Phase 2 stage 10B&lt;br /&gt;
|275&lt;br /&gt;
|200 / 75&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|13,334,244&lt;br /&gt;
|12,435,284&lt;br /&gt;
|6.74%&lt;br /&gt;
|Phase 2 stage 10C&lt;br /&gt;
|267&lt;br /&gt;
|190 / 77&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 2 Data ==&lt;br /&gt;
Here we will list the deciders applied during the various stages of Phase 2. Each decider within a stage was not applied in a specific order. Some stages have a number of TMs solved by every decider at the end of each row, provided by Peacemaker II.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Details&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Phase 2 stage 1:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 1000 NG_n 2 run 86569103&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 1000 NG_n 1 run 26093656&lt;br /&gt;
chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 13972946&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 6 mod 3 n 2 run 7190617&lt;br /&gt;
chr_LRUH 10 chr_H 6 MitM_CTL NG maxT 1000 NG_n 2 run 90302784&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 1 n 4 run 4342619&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 12 H 0 tH 1 n 2 run 11764327&lt;br /&gt;
chr_LRUH 2 chr_H 2 MitM_CTL NG maxT 1000 NG_n 1 run 55465842&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 2 n 1 run 17805678&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 2 H 0 tH 0 n 1 run 12623067&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 3000 NG_n 2 run 2240499&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 4 H 1 tH 1 n 2 run 10223131&lt;br /&gt;
chr_LRUH 6 chr_H 4 MitM_CTL NG maxT 10000 NG_n 1 run 2901053&lt;br /&gt;
chr_LRUH 22 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 28515052&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 2:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 4 n 8 run 1030303&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 8 mod 2 n 2 run 1465523&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 10000 NG_n 4 run 5232902&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 1720994&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 8 mod 3 n 2 run 555883&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 3 H 1 tH 0 n 6 run 290547&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 1 run 67506&lt;br /&gt;
chr_LRUH 10 chr_H 8 MitM_CTL NG maxT 10000 NG_n 2 run 1577979&lt;br /&gt;
chr_LRUH 6 chr_H 6 MitM_CTL NG maxT 3000 NG_n 2 run 1604533&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 4 n 6 run 10012948&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 8 H 0 tH 0 n 4 run 526822&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 1 n 1 run 34821&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 6 H 0 tH 1 n 3 run 356375&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 20 run 1970422&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 6 mod 3 n 1 run 443339&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 3 H 0 tH 1 n 2 run 518824&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 2 mod 2 n 1 run 61865&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 1 tH 1 n 2 run 288834&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 3 (lr_enum_continue from [https://github.com/sligocki/busy-beaver busy-beaver] for 1 million steps):&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
lr_enum_continue ./in.txt 1000000 ./halt.txt ./inf.txt ./unknown.txt &amp;quot;&amp;quot; false&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 4:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 3000 NG_n 2 run 202520&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 3000 NG_n 1 run 559013&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 4 n 1 run 1584&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 10000 NG_n 1 run 148544&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 1 run 812666&lt;br /&gt;
chr_asth 0 chr_LRUH 48 chr_H 48 MitM_CTL NG maxT 10000 NG_n 3 run 2043171&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 4 mod 2 n 1 run 102052&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 5:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 0 tH 1 n 10 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 16 H 1 tH 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 6 n 2 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 10000 NG_n 3 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 5 n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 3 H 1 tH 0 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 3 mod 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 2 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 5 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 4 mod 4 n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 0 tH 1 n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 6 mod 3 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 2 MitM_CTL NG maxT 30000 NG_n 3 run&lt;br /&gt;
chr_LRUH 16 chr_H 12 MitM_CTL NG maxT 30000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 8 H 2 tH 1 n 2 run&lt;br /&gt;
chr_asth 0 chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 10000 NG_n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 16 H 1 tH 0 n 6 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 16 H 0 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 6 chr_H 2 MitM_CTL NG maxT 10000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 3 H 1 tH 0 n 2 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 2 mod 3 n 1 run&lt;br /&gt;
chr_LRUH 3 chr_H 1 MitM_CTL NG maxT 100000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 1 tH 0 n 4 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 2 mod 2 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 4 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 4 H 2 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 0 MitM_CTL NG maxT 1000 NG_n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 2 mod 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 3 mod 6 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 8 chr_H 8 MitM_CTL NG maxT 10000 NG_n 2 run&lt;br /&gt;
chr_asth 0 chr_LRUH 60 chr_H 60 MitM_CTL NG maxT 30000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 3 mod 2 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 4 H 1 tH 1 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 3 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 3000 NG_n 2 run&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 6:&lt;br /&gt;
&lt;br /&gt;
XnoobSpeakable ran Enumerate.py with a 0.15s/TM time limit, Lúkos ran it with a 0.75s/TM time limit.&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
python &amp;quot;+str(pl.Path(&amp;quot;../../Code/Enumerate.py&amp;quot;))+&amp;quot; --infile=&amp;quot;+str(pl.Path(&amp;quot;./in.txt&amp;quot;))+&amp;quot; --outfile=&amp;quot;+str(pl.Path(&amp;quot;./out.pb&amp;quot;))+&amp;quot; --max-loops=990_000 --tape-limit=9_900 --no-steps --time=&amp;quot;+str(time)+&amp;quot; --recursive --exp-linear-rules  --lin-steps=0 --no-ctl --save-freq=10_000&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 7:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 1000 NG_n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 12 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 1 mod 5 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 1000 NG_n 1 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 30000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 4 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 16 H 0 tH 1 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 3000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 4 H 0 tH 1 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 0 tH 2 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 12 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 1 mod 2 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 2 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 2 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 1 mod 3 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 1 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 2 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 6 H 0 tH 0 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 1000 NG_n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 100000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 1 mod 1 n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 2 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 30000 NG_n 1 run&lt;br /&gt;
&amp;lt;/pre&amp;gt;Phase 2 stage 8 (lr_enum_continue from [https://github.com/sligocki/busy-beaver busy-beaver] for 10 million steps):&amp;lt;pre&amp;gt;lr_enum_continue ./in.txt 10000000 ./halt.txt ./inf.txt ./unknown.txt &amp;quot;&amp;quot; false&amp;lt;/pre&amp;gt;Phase 2 stage 9a:&amp;lt;pre&amp;gt;python3 Code/Reverse_Engineer_Filter.py --infile=&#039;/home/xnoobspeakable/Desktop/Busy Beavers/BB(3,4)/resultsst8/3x4_holdouts_14518243.txt&#039; --outfile=&#039;out.txt&#039;&amp;lt;/pre&amp;gt;Phase 2 stage 9b:&amp;lt;pre&amp;gt;python3 ./Code/Backtracking_Filter.py --infile=&#039;/home/xnoobspeakable/Desktop/Busy Beavers/BB(3,4)/resultsst9/unknown.txt&#039;  --outfile=&#039;./b1.pb&#039; --steps=100&amp;lt;/pre&amp;gt;Phase 2 stage 10a:&amp;lt;pre&amp;gt;chr_LRUH 28 chr_LRUn 2 MitM_CTL NG maxT 30000 NG_n 8 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 6 H 1 tH 2 n 8 run&amp;lt;/pre&amp;gt;Phase 2 stage 10b:&amp;lt;pre&amp;gt;MitM_CTL CPS_LRU sim 1,001 maxT 10000 LRUH 2 H 0 tH 0 n 20 run&lt;br /&gt;
chr_LRUH 8 chr_H 8 MitM_CTL NG maxT 100000 NG_n 4 run&amp;lt;/pre&amp;gt;Phase 2 stage 10c:&amp;lt;pre&amp;gt;chr_asth 0 chr_LRUH 60 chr_H 60 MitM_CTL NG maxT 100000 NG_n 8 run&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 100000 NG_n 11 run&amp;lt;/pre&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Phase 3 ==&lt;br /&gt;
&lt;br /&gt;
Phase 3 began with Andrew Ducharme applying a FAR decider by mxdys. The following stages were done by XnoobSpeakable. The &amp;quot;Substages&amp;quot; column refers to the amount of separate runs of deciders were applied to the full holdout list, the files are not split into smaller chunks (&amp;quot;Substages&amp;quot;) like in Phase 2. (Note that Phase 2 stage 9 did actually use substages, like all of Phase 3.)&lt;br /&gt;
&lt;br /&gt;
Stage 2 is currently in progress, with 2 substages completed. The amount of holdouts is unclear due to a minor discrepancy with the predicted and observed counts.&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: left&amp;quot;&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
! colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |% Reduced&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Substages&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Verified&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Andrew Ducharme&lt;br /&gt;
|12,435,284&lt;br /&gt;
|12,049,358&lt;br /&gt;
|3.10%&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Phase 3 stage 1&lt;br /&gt;
|1&lt;br /&gt;
|[https://drive.google.com/drive/folders/1lNKc_GF2sa5ZfosleAlMNBQ3uJV4qClo Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|12,049,358&lt;br /&gt;
|≤11,894,437&lt;br /&gt;
|&lt;br /&gt;
|Phase 3 stage 2&lt;br /&gt;
|2/4 (in prog.)&lt;br /&gt;
|[https://drive.google.com/drive/folders/1lNKc_GF2sa5ZfosleAlMNBQ3uJV4qClo Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 3 Data ==&lt;br /&gt;
Here we will list the deciders applied during the various stages of Phase 3. Some stages have a number of TMs solved by every decider at the end of each row.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Details&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Phase 2 stage 1:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
FAR CPS_LRU maxT 100000 LRUH 2 H 0 tH 0 n 2 368,121&lt;br /&gt;
FAR CPS_LRU maxT 100000 LRUH 1 H 0 tH 0 n [1-4] 17,660&lt;br /&gt;
FAR CPS_LRU maxT 100000 LRUH 2 H 0 tH 0 n 1 145&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:BB Domains]][[Category:BB(3,4)]]&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=BB(3,4)&amp;diff=7403</id>
		<title>BB(3,4)</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=BB(3,4)&amp;diff=7403"/>
		<updated>2026-05-03T12:54:20Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: /* Phase 3 */ Working on phase 3 table and stages&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The Busy Beaver problem for 3 states and 4 symbols is unsolved, with the existence of [[Cryptids]] in the domain being given by the discovery of [[Bigfoot]] in [[BB(3,3)]]. The current BB(3,4) [[Champions#3-Symbol TMs|champion]] is {{TM|1RB3LB1RZ2RA_2LC3RB1LC2RA_3RB1LB3LC2RC|halt}}. It runs for &amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt; steps before halting. It was discovered by Pavel Kropitz in 2024 and was analysed by Shawn Ligocki in the same year.&lt;br /&gt;
&lt;br /&gt;
== Top Halters ==&lt;br /&gt;
The top 20 known longest running halting BB(3,4) TMs are:&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!Standard format&lt;br /&gt;
!(approximate) runtime&lt;br /&gt;
!Discoverer&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LB1RZ2RA_2LC3RB1LC2RA_3RB1LB3LC2RC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ1LA2RB_1RC3RC1LA2LB_2LB2RC1LC3RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{12} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3RB1LC2LA_2LA2RB1LB3RA_3LA1RZ1LC2RA}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{6} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3RB1LC2LA_2LA2RB1LB3RA_1RA1RZ1LC2RA}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{6} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LB1RZ3LA_0LC3RB3RC1LB_2RB2LA3RA1LC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {2\,048}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ1LA2RB_2RC3RC3LB2RA_2LB3RB3LC1LA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {189.05690}&amp;lt;/math&amp;gt;&lt;br /&gt;
|[[User:XnoobSpeakable|XnoobSpeakable]] &lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LA1RA2LB_2LC1RA2RC3RB_1RZ1LA2RA3RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {188.16168}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LB2LA3LC_1LA2RB3RA1LB_1RZ1RB2LB3LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {188.16168}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA3LA3RB_2LC2RC1LB2RA_2RA2RB0LB1RZ|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {149.57147}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LB1RZ3LA_1LA3RC2LC1LC_2LA3RC0RA1LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LB1RZ3LA_1LA3RC3LB1LC_2RA3RC0RA1LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LC1RC2RA_1LA3RA2RB1RZ_3LB2LC1RA0LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|[[User:WarpedWartWars|Lúkos]]&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA1LB3RA_1RC3LB1LC1RC_2LA2RA1RZ0LA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {96.06390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA1LB3RA_1RC3LB1LC1RC_2LA2RA1RZ1RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {96.06390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LC0RA1RC_2LA1RZ3LA2RB_3LA0RA1LA0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {95.24590}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LC0RA1RC_2LA1RZ3LA2RB_3LA0RA3LB0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {95.24590}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LA1RA1RC_1LA3LC3RB1RC_3LA1RZ3LB2RC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {84.19957}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LB1RA2LB_2RC3LB3RB2LA_2LC1RZ1LA2RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {76.17604}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LA1RZ0LB_2LC2LB1RC1RB_3LA3LC0LC0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {74.18390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2RA1LA1LB_2RC3RB1RZ3LC_2LA1RC1RB0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {69.55341}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Lúkos&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 1 ==&lt;br /&gt;
The initial phase of enumeration and reduction of [[holdouts]] took place in December 2024 and was done by Terry Ligocki using the Ligockis&#039; C++ and Python codes. The initial enumerations generated 600,253,156,787 TMs of which 42,391,877,333 were holdout TMs. Also found were 202,014,400,019 halting TMs and 355,846,879,435 infinite TMs. The number of holdouts was reduced to 434,787,751 TMs (a 98.97% reduction).&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Phase 1 Info&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Two C++ programs were run before the filters in the table.&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
lr_enum 3 4 8 /dev/null /dev/null 3x4.unk.txt false&lt;br /&gt;
00 &amp;lt;= XX &amp;lt; 47: lr_enum_continue 3x4.in.XX 1000 /dev/null /dev/null 3x4.unk.txt.XX XX false&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Both do the initial enumeration and simple filtering. The &amp;quot;/dev/null&amp;quot; in both commands would be files where the halting and infinite TMs would be stored. The first command generates the TMs from a TNF tree for BB(3,4) of depth 8 and outputs the holdouts to 3x4.unk.txt. This file was then divided into 48 pieces, 3x4.in.XX, 0 &amp;lt;= XX &amp;lt; 47. The second commands (one for each XX) continues the enumeration by running each TM for 1,000 steps. It classifies each as halting, infinite, or unknown/holdout. Again, the halting and infinite TMs are &amp;quot;written&amp;quot; to /dev/null, i.e., they aren&#039;t saved. The holdouts are stored in 48 files: 3x4.unk.txt.XX.&lt;br /&gt;
&lt;br /&gt;
For these runs the first command generated a total of 22,366,747 TMs: 932,198 halting, 235,446 infinite, and 21,199,103 holdouts. The second took the 22,366,747 holdout TMs and generated a total of 600,253,156,787 TMs: 202,014,400,019 halting, 355,846,879,435 infinite, and 42,391,877,333 holdouts. These holdouts were used as a starting point of the filters below.&lt;br /&gt;
&lt;br /&gt;
The &amp;quot;Description&amp;quot; column in the table below contain the command run. Two options are not given, &amp;quot;--infile=...&amp;quot; and an &amp;quot;--outfile=...&amp;quot;. These are necessary and specify where to read and write the results, respectively. Note: The work flow was to divide the input holdouts into 48 pieces, run the command on each piece simultaneously on one of 48 cores, and then combine the 48 results into a group of holdouts.&lt;br /&gt;
&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The details are given in this table:&lt;br /&gt;
&lt;br /&gt;
(done to reduce column size:&lt;br /&gt;
&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;= % Reduced,&lt;br /&gt;
&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;= Runtime (hours),&lt;br /&gt;
&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;= Decided,&lt;br /&gt;
&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;= Processed)&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: right&amp;quot;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |TMs/sec/core&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
!&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;&lt;br /&gt;
!&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|42,391,877,333&lt;br /&gt;
|32,247,381,725&lt;br /&gt;
|23.93%&lt;br /&gt;
|788.0&lt;br /&gt;
|3,576.08&lt;br /&gt;
|14,943.74&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Reverse_Engineer_Filter.py&lt;br /&gt;
|rowspan=&amp;quot;8&amp;quot; style=&amp;quot;text-align:left&amp;quot; |[https://drive.google.com/drive/folders/1EsFw5DOjjZ6Xzjc8QgRa2YkInrsmFnLX?usp=drive_link Google Drive]&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|32,247,381,725&lt;br /&gt;
|12,789,441,316&lt;br /&gt;
|60.34%&lt;br /&gt;
|6,185.2&lt;br /&gt;
|873.85&lt;br /&gt;
|1,448.22&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=1&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|12,789,441,316&lt;br /&gt;
|4,332,283,583&lt;br /&gt;
|66.13%&lt;br /&gt;
|4,771.0&lt;br /&gt;
|492.39&lt;br /&gt;
|744.62&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=2&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|4,332,283,583&lt;br /&gt;
|2,796,143,404&lt;br /&gt;
|35.46%&lt;br /&gt;
|7,873.1&lt;br /&gt;
|54.20&lt;br /&gt;
|152.85&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=3&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|2,796,143,404&lt;br /&gt;
|1,398,734,288&lt;br /&gt;
|49.98%&lt;br /&gt;
|10,239.4&lt;br /&gt;
|37.91&lt;br /&gt;
|75.85&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Enumerate.py --max-loops=1_000 --block-size=2 --time=10 --lin-steps=0 --no-reverse-engineer --save-freq=10_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|1,398,734,288&lt;br /&gt;
|764,851,053&lt;br /&gt;
|45.32%&lt;br /&gt;
|3,203.1&lt;br /&gt;
|54.97&lt;br /&gt;
|121.30&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Enumerate.py --max-loops=10_000 --block-size=12 --no-steps --time=0.01 --lin-steps=0 --no-ctl --no-reverse-engineer --save-freq=10_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|764,851,053&lt;br /&gt;
|581,654,405&lt;br /&gt;
|23.95%&lt;br /&gt;
|1,925.3&lt;br /&gt;
|26.43&lt;br /&gt;
|110.35&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --min-block-size=4 --max-block-size=12 --max-steps=1_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|581,654,405&lt;br /&gt;
|434,787,751&lt;br /&gt;
|25.25%&lt;br /&gt;
|9,042.5&lt;br /&gt;
|4.51&lt;br /&gt;
|17.87&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --min-block-size=4 --max-block-size=6 --max-steps=10_000&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 2 ==&lt;br /&gt;
XnoobSpeakable and Lúkos worked on applying mxdys&#039; deciders/parameters to the remaining holdouts. The previous holdouts list by Terry Ligocki was split up into 8696 files containing 50,000 holdouts each* (*the last one actually has 37,751) and the deciders were applied to the files individually. These files can be called subtasks. Lúkos made a Python script to compute the subtasks in parallel, based off of XnoobSpeakable&#039;s earlier imperfect script.&lt;br /&gt;
&lt;br /&gt;
Certain data such as TMs/sec/core is unavailable, because the amount of time the computation took was not kept track of.&lt;br /&gt;
&lt;br /&gt;
Stages 3 and 8 are lr_enum_continue computations to 1 million and 10 million steps respectively. Lúkos did not contribute to computing these stages, but rather created a Python script to compute them in bulk, which XnoobSpeakable used.&lt;br /&gt;
&lt;br /&gt;
For the &amp;quot;Contribution&amp;quot; column, the first number is the amount of subtasks solved by XnoobSpeakable, the 2nd is the amount solved by Lúkos. Note that the counts are unequal, because Lúkos has a slower CPU with a lower core count. According to XnoobSpeakable, the time contribution from both contributors is roughly equal. Lúkos also worked on the Python scripts used, while XnoobSpeakable worked on compiling holdouts lists and finding optimal deciders to apply. &lt;br /&gt;
&lt;br /&gt;
[[User:Peacemaker II|Peacemaker II]] worked on verifying the validity of the results as well as providing solved TM counts per decider. Stages 1, 2, and 4 have been validated - no dropped TMs. XnoobSpeakable verified stage 6.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;nowiki&amp;gt;**&amp;lt;/nowiki&amp;gt;Stage 9: The two subtasks are seperate sub-stages, applying Reverse-Engineer and Backtracking deciders.&lt;br /&gt;
&lt;br /&gt;
Stage 10 is also seperated into substages A, B, and C for ease of computation.&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1MamU8zivuqoe4j82vpb-jYBfc4wvXNRc All scripts used are available here.] The details will be given in this table:&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: left&amp;quot;&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
! colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |% Reduced&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Subtasks&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Contribution&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Verified&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |XnoobSpeakable, Lúkos&lt;br /&gt;
|434,787,751&lt;br /&gt;
|64,777,377&lt;br /&gt;
|85.1%&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Phase 2 stage 1&lt;br /&gt;
|8696&lt;br /&gt;
|7696 / 1000&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|64,777,377&lt;br /&gt;
|37,016,957&lt;br /&gt;
|42.9%&lt;br /&gt;
|Phase 2 stage 2&lt;br /&gt;
|1296&lt;br /&gt;
|1000 / 296&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|37,016,957&lt;br /&gt;
|26,266,261&lt;br /&gt;
|29.0%&lt;br /&gt;
|Phase 2 stage 3&lt;br /&gt;
|741&lt;br /&gt;
|741 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|26,266,261&lt;br /&gt;
|22,396,711&lt;br /&gt;
|14.7%&lt;br /&gt;
|Phase 2 stage 4&lt;br /&gt;
|526&lt;br /&gt;
|485 / 41&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|22,396,711&lt;br /&gt;
|17,983,810&lt;br /&gt;
|19.7%&lt;br /&gt;
|Phase 2 stage 5&lt;br /&gt;
|448&lt;br /&gt;
|390 / 58&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|17,983,810&lt;br /&gt;
|15,564,491&lt;br /&gt;
|13.5%&lt;br /&gt;
|Phase 2 stage 6&lt;br /&gt;
|360&lt;br /&gt;
|300 / 60&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|15,564,491&lt;br /&gt;
|15,136,283&lt;br /&gt;
|2.75%&lt;br /&gt;
|Phase 2 stage 7&lt;br /&gt;
|312&lt;br /&gt;
|260 / 52&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|15,136,283&lt;br /&gt;
|14,518,243&lt;br /&gt;
|4.08%&lt;br /&gt;
|Phase 2 stage 8&lt;br /&gt;
|303&lt;br /&gt;
|303 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|14,518,243&lt;br /&gt;
|14,413,460&lt;br /&gt;
|0.72%&lt;br /&gt;
|Phase 2 stage 9&lt;br /&gt;
|2**&lt;br /&gt;
|2 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|14,413,460&lt;br /&gt;
|13,733,388&lt;br /&gt;
|4.72%&lt;br /&gt;
|Phase 2 stage 10A&lt;br /&gt;
|289&lt;br /&gt;
|216 / 73&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|13,733,388&lt;br /&gt;
|13,334,244&lt;br /&gt;
|2.91%&lt;br /&gt;
|Phase 2 stage 10B&lt;br /&gt;
|275&lt;br /&gt;
|200 / 75&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|13,334,244&lt;br /&gt;
|12,435,284&lt;br /&gt;
|6.74%&lt;br /&gt;
|Phase 2 stage 10C&lt;br /&gt;
|267&lt;br /&gt;
|190 / 77&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 2 Data ==&lt;br /&gt;
Here we will list the deciders applied during the various stages of Phase 2. Each decider within a stage was not applied in a specific order. Some stages have a number of TMs solved by every decider at the end of each row, provided by Peacemaker II.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Details&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Phase 2 stage 1:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 1000 NG_n 2 run 86569103&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 1000 NG_n 1 run 26093656&lt;br /&gt;
chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 13972946&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 6 mod 3 n 2 run 7190617&lt;br /&gt;
chr_LRUH 10 chr_H 6 MitM_CTL NG maxT 1000 NG_n 2 run 90302784&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 1 n 4 run 4342619&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 12 H 0 tH 1 n 2 run 11764327&lt;br /&gt;
chr_LRUH 2 chr_H 2 MitM_CTL NG maxT 1000 NG_n 1 run 55465842&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 2 n 1 run 17805678&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 2 H 0 tH 0 n 1 run 12623067&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 3000 NG_n 2 run 2240499&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 4 H 1 tH 1 n 2 run 10223131&lt;br /&gt;
chr_LRUH 6 chr_H 4 MitM_CTL NG maxT 10000 NG_n 1 run 2901053&lt;br /&gt;
chr_LRUH 22 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 28515052&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 2:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 4 n 8 run 1030303&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 8 mod 2 n 2 run 1465523&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 10000 NG_n 4 run 5232902&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 1720994&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 8 mod 3 n 2 run 555883&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 3 H 1 tH 0 n 6 run 290547&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 1 run 67506&lt;br /&gt;
chr_LRUH 10 chr_H 8 MitM_CTL NG maxT 10000 NG_n 2 run 1577979&lt;br /&gt;
chr_LRUH 6 chr_H 6 MitM_CTL NG maxT 3000 NG_n 2 run 1604533&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 4 n 6 run 10012948&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 8 H 0 tH 0 n 4 run 526822&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 1 n 1 run 34821&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 6 H 0 tH 1 n 3 run 356375&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 20 run 1970422&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 6 mod 3 n 1 run 443339&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 3 H 0 tH 1 n 2 run 518824&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 2 mod 2 n 1 run 61865&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 1 tH 1 n 2 run 288834&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 3 (lr_enum_continue from [https://github.com/sligocki/busy-beaver busy-beaver] for 1 million steps):&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
lr_enum_continue ./in.txt 1000000 ./halt.txt ./inf.txt ./unknown.txt &amp;quot;&amp;quot; false&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 4:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 3000 NG_n 2 run 202520&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 3000 NG_n 1 run 559013&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 4 n 1 run 1584&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 10000 NG_n 1 run 148544&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 1 run 812666&lt;br /&gt;
chr_asth 0 chr_LRUH 48 chr_H 48 MitM_CTL NG maxT 10000 NG_n 3 run 2043171&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 4 mod 2 n 1 run 102052&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 5:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 0 tH 1 n 10 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 16 H 1 tH 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 6 n 2 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 10000 NG_n 3 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 5 n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 3 H 1 tH 0 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 3 mod 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 2 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 5 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 4 mod 4 n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 0 tH 1 n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 6 mod 3 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 2 MitM_CTL NG maxT 30000 NG_n 3 run&lt;br /&gt;
chr_LRUH 16 chr_H 12 MitM_CTL NG maxT 30000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 8 H 2 tH 1 n 2 run&lt;br /&gt;
chr_asth 0 chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 10000 NG_n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 16 H 1 tH 0 n 6 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 16 H 0 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 6 chr_H 2 MitM_CTL NG maxT 10000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 3 H 1 tH 0 n 2 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 2 mod 3 n 1 run&lt;br /&gt;
chr_LRUH 3 chr_H 1 MitM_CTL NG maxT 100000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 1 tH 0 n 4 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 2 mod 2 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 4 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 4 H 2 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 0 MitM_CTL NG maxT 1000 NG_n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 2 mod 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 3 mod 6 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 8 chr_H 8 MitM_CTL NG maxT 10000 NG_n 2 run&lt;br /&gt;
chr_asth 0 chr_LRUH 60 chr_H 60 MitM_CTL NG maxT 30000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 3 mod 2 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 4 H 1 tH 1 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 3 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 3000 NG_n 2 run&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 6:&lt;br /&gt;
&lt;br /&gt;
XnoobSpeakable ran Enumerate.py with a 0.15s/TM time limit, Lúkos ran it with a 0.75s/TM time limit.&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
python &amp;quot;+str(pl.Path(&amp;quot;../../Code/Enumerate.py&amp;quot;))+&amp;quot; --infile=&amp;quot;+str(pl.Path(&amp;quot;./in.txt&amp;quot;))+&amp;quot; --outfile=&amp;quot;+str(pl.Path(&amp;quot;./out.pb&amp;quot;))+&amp;quot; --max-loops=990_000 --tape-limit=9_900 --no-steps --time=&amp;quot;+str(time)+&amp;quot; --recursive --exp-linear-rules  --lin-steps=0 --no-ctl --save-freq=10_000&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 7:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 1000 NG_n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 12 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 1 mod 5 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 1000 NG_n 1 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 30000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 4 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 16 H 0 tH 1 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 3000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 4 H 0 tH 1 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 0 tH 2 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 12 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 1 mod 2 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 2 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 2 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 1 mod 3 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 1 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 2 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 6 H 0 tH 0 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 1000 NG_n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 100000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 1 mod 1 n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 2 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 30000 NG_n 1 run&lt;br /&gt;
&amp;lt;/pre&amp;gt;Phase 2 stage 8 (lr_enum_continue from [https://github.com/sligocki/busy-beaver busy-beaver] for 10 million steps):&amp;lt;pre&amp;gt;lr_enum_continue ./in.txt 10000000 ./halt.txt ./inf.txt ./unknown.txt &amp;quot;&amp;quot; false&amp;lt;/pre&amp;gt;Phase 2 stage 9a:&amp;lt;pre&amp;gt;python3 Code/Reverse_Engineer_Filter.py --infile=&#039;/home/xnoobspeakable/Desktop/Busy Beavers/BB(3,4)/resultsst8/3x4_holdouts_14518243.txt&#039; --outfile=&#039;out.txt&#039;&amp;lt;/pre&amp;gt;Phase 2 stage 9b:&amp;lt;pre&amp;gt;python3 ./Code/Backtracking_Filter.py --infile=&#039;/home/xnoobspeakable/Desktop/Busy Beavers/BB(3,4)/resultsst9/unknown.txt&#039;  --outfile=&#039;./b1.pb&#039; --steps=100&amp;lt;/pre&amp;gt;Phase 2 stage 10a:&amp;lt;pre&amp;gt;chr_LRUH 28 chr_LRUn 2 MitM_CTL NG maxT 30000 NG_n 8 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 6 H 1 tH 2 n 8 run&amp;lt;/pre&amp;gt;Phase 2 stage 10b:&amp;lt;pre&amp;gt;MitM_CTL CPS_LRU sim 1,001 maxT 10000 LRUH 2 H 0 tH 0 n 20 run&lt;br /&gt;
chr_LRUH 8 chr_H 8 MitM_CTL NG maxT 100000 NG_n 4 run&amp;lt;/pre&amp;gt;Phase 2 stage 10c:&amp;lt;pre&amp;gt;chr_asth 0 chr_LRUH 60 chr_H 60 MitM_CTL NG maxT 100000 NG_n 8 run&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 100000 NG_n 11 run&amp;lt;/pre&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Phase 3 ==&lt;br /&gt;
&lt;br /&gt;
Phase 3 began with Andrew Ducharme applying a FAR decider by mxdys. The &amp;quot;Subtasks&amp;quot; column refers to how many portions the holdouts list was split into during computation.&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: left&amp;quot;&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
! colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |% Reduced&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Subtasks&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Verified&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Andrew Ducharme&lt;br /&gt;
|12,435,284&lt;br /&gt;
|12,049,358&lt;br /&gt;
|3.10%&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Phase 3 stage 1&lt;br /&gt;
|1&lt;br /&gt;
|[https://drive.google.com/drive/folders/1lNKc_GF2sa5ZfosleAlMNBQ3uJV4qClo Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|12,049,358&lt;br /&gt;
|(TBD)&lt;br /&gt;
|&lt;br /&gt;
|Phase 3 stage 2&lt;br /&gt;
|241&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 3 Data ==&lt;br /&gt;
Here we will list the deciders applied during the various stages of Phase 3. Some stages have a number of TMs solved by every decider at the end of each row.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Details&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Phase 2 stage 1:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
FAR CPS_LRU maxT 100000 LRUH 2 H 0 tH 0 n 2 368,121&lt;br /&gt;
FAR CPS_LRU maxT 100000 LRUH 1 H 0 tH 0 n [1-4] 17,660&lt;br /&gt;
FAR CPS_LRU maxT 100000 LRUH 2 H 0 tH 0 n 1 145&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:BB Domains]][[Category:BB(3,4)]]&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=BB(3,4)&amp;diff=5950</id>
		<title>BB(3,4)</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=BB(3,4)&amp;diff=5950"/>
		<updated>2026-01-01T09:52:03Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: /* Phase 2 Data */ fix typo&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The Busy Beaver problem for 3 states and 4 symbols is unsolved, with the existence of [[Cryptids]] in the domain being given by the discovery of [[Bigfoot]] in [[BB(3,3)]]. The current BB(3,4) [[Champions#3-Symbol TMs|champion]] is {{TM|1RB3LB1RZ2RA_2LC3RB1LC2RA_3RB1LB3LC2RC|halt}}. It runs for &amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt; steps before halting. It was discovered by Pavel Kropitz in 2024 and was analysed by Shawn Ligocki in the same year.&lt;br /&gt;
&lt;br /&gt;
== Top Halters ==&lt;br /&gt;
The top 20 known longest running halting BB(3,4) TMs are:&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!Standard format&lt;br /&gt;
!(approximate) runtime&lt;br /&gt;
!Discoverer&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LB1RZ2RA_2LC3RB1LC2RA_3RB1LB3LC2RC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ1LA2RB_1RC3RC1LA2LB_2LB2RC1LC3RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{12} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3RB1LC2LA_2LA2RB1LB3RA_3LA1RZ1LC2RA}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{6} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3RB1LC2LA_2LA2RB1LB3RA_1RA1RZ1LC2RA}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{6} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LB1RZ3LA_0LC3RB3RC1LB_2RB2LA3RA1LC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {2\,048}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ1LA2RB_2RC3RC3LB2RA_2LB3RB3LC1LA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {189.05690}&amp;lt;/math&amp;gt;&lt;br /&gt;
|[[User:XnoobSpeakable|XnoobSpeakable]] &lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LA1RA2LB_2LC1RA2RC3RB_1RZ1LA2RA3RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {188.16168}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LB2LA3LC_1LA2RB3RA1LB_1RZ1RB2LB3LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {188.16168}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA3LA3RB_2LC2RC1LB2RA_2RA2RB0LB1RZ|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {149.57147}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LB1RZ3LA_1LA3RC2LC1LC_2LA3RC0RA1LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LB1RZ3LA_1LA3RC3LB1LC_2RA3RC0RA1LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LC1RC2RA_1LA3RA2RB1RZ_3LB2LC1RA0LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|[[User:WarpedWartWars|Lúkos]]&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA1LB3RA_1RC3LB1LC1RC_2LA2RA1RZ0LA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {96.06390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA1LB3RA_1RC3LB1LC1RC_2LA2RA1RZ1RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {96.06390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LC0RA1RC_2LA1RZ3LA2RB_3LA0RA1LA0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {95.24590}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LC0RA1RC_2LA1RZ3LA2RB_3LA0RA3LB0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {95.24590}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LA1RA1RC_1LA3LC3RB1RC_3LA1RZ3LB2RC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {84.19957}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LB1RA2LB_2RC3LB3RB2LA_2LC1RZ1LA2RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {76.17604}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LA1RZ0LB_2LC2LB1RC1RB_3LA3LC0LC0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {74.18390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2RA1LA1LB_2RC3RB1RZ3LC_2LA1RC1RB0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {69.55341}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Lúkos&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 1 ==&lt;br /&gt;
The initial phase of enumeration and reduction of [[holdouts]] took place in December 2024 and was done by Terry Ligocki using the Ligockis&#039; C++ and Python codes. The initial enumerations generated 600,253,156,787 TMs of which 42,391,877,333 were holdout TMs. Also found were 202,014,400,019 halting TMs and 355,846,879,435 infinite TMs. The number of holdouts was reduced to 434,787,751 TMs (a 98.97% reduction).&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Phase 1 Info&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Two C++ programs were run before the filters in the table.&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
lr_enum 3 4 8 /dev/null /dev/null 3x4.unk.txt false&lt;br /&gt;
00 &amp;lt;= XX &amp;lt; 47: lr_enum_continue 3x4.in.XX 1000 /dev/null /dev/null 3x4.unk.txt.XX XX false&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Both do the initial enumeration and simple filtering. The &amp;quot;/dev/null&amp;quot; in both commands would be files where the halting and infinite TMs would be stored. The first command generates the TMs from a TNF tree for BB(3,4) of depth 8 and outputs the holdouts to 3x4.unk.txt. This file was then divided into 48 pieces, 3x4.in.XX, 0 &amp;lt;= XX &amp;lt; 47. The second commands (one for each XX) continues the enumeration by running each TM for 1,000 steps. It classifies each as halting, infinite, or unknown/holdout. Again, the halting and infinite TMs are &amp;quot;written&amp;quot; to /dev/null, i.e., they aren&#039;t saved. The holdouts are stored in 48 files: 3x4.unk.txt.XX.&lt;br /&gt;
&lt;br /&gt;
For these runs the first command generated a total of 22,366,747 TMs: 932,198 halting, 235,446 infinite, and 21,199,103 holdouts. The second took the 22,366,747 holdout TMs and generated a total of 600,253,156,787 TMs: 202,014,400,019 halting, 355,846,879,435 infinite, and 42,391,877,333 holdouts. These holdouts were used as a starting point of the filters below.&lt;br /&gt;
&lt;br /&gt;
The &amp;quot;Description&amp;quot; column in the table below contain the command run. Two options are not given, &amp;quot;--infile=...&amp;quot; and an &amp;quot;--outfile=...&amp;quot;. These are necessary and specify where to read and write the results, respectively. Note: The work flow was to divide the input holdouts into 48 pieces, run the command on each piece simultaneously on one of 48 cores, and then combine the 48 results into a group of holdouts.&lt;br /&gt;
&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The details are given in this table:&lt;br /&gt;
&lt;br /&gt;
(done to reduce column size:&lt;br /&gt;
&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;= % Reduced,&lt;br /&gt;
&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;= Runtime (hours),&lt;br /&gt;
&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;= Decided,&lt;br /&gt;
&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;= Processed)&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: right&amp;quot;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |TMs/sec/core&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
!&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;&lt;br /&gt;
!&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|42,391,877,333&lt;br /&gt;
|32,247,381,725&lt;br /&gt;
|23.93%&lt;br /&gt;
|788.0&lt;br /&gt;
|3,576.08&lt;br /&gt;
|14,943.74&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Reverse_Engineer_Filter.py&lt;br /&gt;
|rowspan=&amp;quot;8&amp;quot; style=&amp;quot;text-align:left&amp;quot; |[https://drive.google.com/drive/folders/1EsFw5DOjjZ6Xzjc8QgRa2YkInrsmFnLX?usp=drive_link Google Drive]&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|32,247,381,725&lt;br /&gt;
|12,789,441,316&lt;br /&gt;
|60.34%&lt;br /&gt;
|6,185.2&lt;br /&gt;
|873.85&lt;br /&gt;
|1,448.22&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=1&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|12,789,441,316&lt;br /&gt;
|4,332,283,583&lt;br /&gt;
|66.13%&lt;br /&gt;
|4,771.0&lt;br /&gt;
|492.39&lt;br /&gt;
|744.62&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=2&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|4,332,283,583&lt;br /&gt;
|2,796,143,404&lt;br /&gt;
|35.46%&lt;br /&gt;
|7,873.1&lt;br /&gt;
|54.20&lt;br /&gt;
|152.85&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=3&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|2,796,143,404&lt;br /&gt;
|1,398,734,288&lt;br /&gt;
|49.98%&lt;br /&gt;
|10,239.4&lt;br /&gt;
|37.91&lt;br /&gt;
|75.85&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Enumerate.py --max-loops=1_000 --block-size=2 --time=10 --lin-steps=0 --no-reverse-engineer --save-freq=10_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|1,398,734,288&lt;br /&gt;
|764,851,053&lt;br /&gt;
|45.32%&lt;br /&gt;
|3,203.1&lt;br /&gt;
|54.97&lt;br /&gt;
|121.30&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Enumerate.py --max-loops=10_000 --block-size=12 --no-steps --time=0.01 --lin-steps=0 --no-ctl --no-reverse-engineer --save-freq=10_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|764,851,053&lt;br /&gt;
|581,654,405&lt;br /&gt;
|23.95%&lt;br /&gt;
|1,925.3&lt;br /&gt;
|26.43&lt;br /&gt;
|110.35&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --min-block-size=4 --max-block-size=12 --max-steps=1_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|581,654,405&lt;br /&gt;
|434,787,751&lt;br /&gt;
|25.25%&lt;br /&gt;
|9,042.5&lt;br /&gt;
|4.51&lt;br /&gt;
|17.87&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --min-block-size=4 --max-block-size=6 --max-steps=10_000&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 2 ==&lt;br /&gt;
XnoobSpeakable and Lúkos are working on applying mxdys&#039; deciders/parameters to the remaining holdouts. The previous holdouts list by Terry Ligocki was split up into 8696 files containing 50,000 holdouts each* (*the last one actually has 37,751) and the deciders were applied to the files individually. These files can be called subtasks. Lúkos made a Python script to compute the subtasks in parallel, based off of XnoobSpeakable&#039;s earlier imperfect script.&lt;br /&gt;
&lt;br /&gt;
Certain data such as TMs/sec/core is unavailable, because the amount of time the computation took was not kept track of.&lt;br /&gt;
&lt;br /&gt;
Stages 3 and 8 are lr_enum_continue computations to 1 million and 10 million steps respectively. Lúkos did not contribute to computing these stages, but rather created a Python script to compute them in bulk, which XnoobSpeakable used.&lt;br /&gt;
&lt;br /&gt;
For the &amp;quot;Contribution&amp;quot; column, the first number is the amount of subtasks solved by XnoobSpeakable, the 2nd is the amount solved by Lúkos. Note that the counts are unequal, because Lúkos has a slower CPU with a lower core count. According to XnoobSpeakable, the time contribution from both contributors is roughly equal. Lúkos also worked on the Python scripts used, while XnoobSpeakable worked on compiling holdouts lists and finding optimal deciders to apply. &lt;br /&gt;
&lt;br /&gt;
[[User:Peacemaker II|Peacemaker II]] worked on verifying the validity of the results as well as providing solved TM counts per decider. Stages 1, 2, and 4 have been validated - no dropped TMs. XnoobSpeakable verified stage 6.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;nowiki&amp;gt;**&amp;lt;/nowiki&amp;gt;Stage 9: The two subtasks are seperate sub-stages, applying Reverse-Engineer and Backtracking deciders.&lt;br /&gt;
&lt;br /&gt;
Stage 10 is also seperated into substages A, B, and C for ease of computation.&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1MamU8zivuqoe4j82vpb-jYBfc4wvXNRc All scripts used are available here.] The details will be given in this table:&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: left&amp;quot;&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
! colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |% Reduced&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Subtasks&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Contribution&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Verified&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |XnoobSpeakable, Lúkos&lt;br /&gt;
|434,787,751&lt;br /&gt;
|64,777,377&lt;br /&gt;
|85.1%&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Phase 2 stage 1&lt;br /&gt;
|8696&lt;br /&gt;
|7696 / 1000&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|64,777,377&lt;br /&gt;
|37,016,957&lt;br /&gt;
|42.9%&lt;br /&gt;
|Phase 2 stage 2&lt;br /&gt;
|1296&lt;br /&gt;
|1000 / 296&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|37,016,957&lt;br /&gt;
|26,266,261&lt;br /&gt;
|29.0%&lt;br /&gt;
|Phase 2 stage 3&lt;br /&gt;
|741&lt;br /&gt;
|741 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|26,266,261&lt;br /&gt;
|22,396,711&lt;br /&gt;
|14.7%&lt;br /&gt;
|Phase 2 stage 4&lt;br /&gt;
|526&lt;br /&gt;
|485 / 41&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|22,396,711&lt;br /&gt;
|17,983,810&lt;br /&gt;
|19.7%&lt;br /&gt;
|Phase 2 stage 5&lt;br /&gt;
|448&lt;br /&gt;
|390 / 58&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|17,983,810&lt;br /&gt;
|15,564,491&lt;br /&gt;
|13.5%&lt;br /&gt;
|Phase 2 stage 6&lt;br /&gt;
|360&lt;br /&gt;
|300 / 60&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|15,564,491&lt;br /&gt;
|15,136,283&lt;br /&gt;
|2.75%&lt;br /&gt;
|Phase 2 stage 7&lt;br /&gt;
|312&lt;br /&gt;
|260 / 52&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|15,136,283&lt;br /&gt;
|14,518,243&lt;br /&gt;
|4.08%&lt;br /&gt;
|Phase 2 stage 8&lt;br /&gt;
|303&lt;br /&gt;
|303 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|14,518,243&lt;br /&gt;
|14,413,460&lt;br /&gt;
|0.72%&lt;br /&gt;
|Phase 2 stage 9&lt;br /&gt;
|2**&lt;br /&gt;
|2 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|14,413,460&lt;br /&gt;
|13,733,388&lt;br /&gt;
|4.72%&lt;br /&gt;
|Phase 2 stage 10A&lt;br /&gt;
|289&lt;br /&gt;
|216 / 73&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|13,733,388&lt;br /&gt;
|13,334,244&lt;br /&gt;
|2.91%&lt;br /&gt;
|Phase 2 stage 10B&lt;br /&gt;
|275&lt;br /&gt;
|200 / 75&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|13,334,244&lt;br /&gt;
|12,435,284&lt;br /&gt;
|6.74%&lt;br /&gt;
|Phase 2 stage 10C&lt;br /&gt;
|267&lt;br /&gt;
|190 / 77&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 2 Data ==&lt;br /&gt;
Here we will list the deciders applied during the various stages of Phase 2. Each decider within a stage was not applied in a specific order. Some stages have a number of TMs solved by every decider at the end of each row, provided by Peacemaker II.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Details&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Phase 2 stage 1:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 1000 NG_n 2 run 86569103&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 1000 NG_n 1 run 26093656&lt;br /&gt;
chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 13972946&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 6 mod 3 n 2 run 7190617&lt;br /&gt;
chr_LRUH 10 chr_H 6 MitM_CTL NG maxT 1000 NG_n 2 run 90302784&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 1 n 4 run 4342619&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 12 H 0 tH 1 n 2 run 11764327&lt;br /&gt;
chr_LRUH 2 chr_H 2 MitM_CTL NG maxT 1000 NG_n 1 run 55465842&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 2 n 1 run 17805678&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 2 H 0 tH 0 n 1 run 12623067&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 3000 NG_n 2 run 2240499&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 4 H 1 tH 1 n 2 run 10223131&lt;br /&gt;
chr_LRUH 6 chr_H 4 MitM_CTL NG maxT 10000 NG_n 1 run 2901053&lt;br /&gt;
chr_LRUH 22 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 28515052&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 2:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 4 n 8 run 1030303&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 8 mod 2 n 2 run 1465523&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 10000 NG_n 4 run 5232902&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 1720994&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 8 mod 3 n 2 run 555883&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 3 H 1 tH 0 n 6 run 290547&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 1 run 67506&lt;br /&gt;
chr_LRUH 10 chr_H 8 MitM_CTL NG maxT 10000 NG_n 2 run 1577979&lt;br /&gt;
chr_LRUH 6 chr_H 6 MitM_CTL NG maxT 3000 NG_n 2 run 1604533&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 4 n 6 run 10012948&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 8 H 0 tH 0 n 4 run 526822&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 1 n 1 run 34821&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 6 H 0 tH 1 n 3 run 356375&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 20 run 1970422&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 6 mod 3 n 1 run 443339&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 3 H 0 tH 1 n 2 run 518824&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 2 mod 2 n 1 run 61865&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 1 tH 1 n 2 run 288834&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 3 (lr_enum_continue from [https://github.com/sligocki/busy-beaver busy-beaver] for 1 million steps):&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
lr_enum_continue ./in.txt 1000000 ./halt.txt ./inf.txt ./unknown.txt &amp;quot;&amp;quot; false&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 4:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 3000 NG_n 2 run 202520&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 3000 NG_n 1 run 559013&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 4 n 1 run 1584&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 10000 NG_n 1 run 148544&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 1 run 812666&lt;br /&gt;
chr_asth 0 chr_LRUH 48 chr_H 48 MitM_CTL NG maxT 10000 NG_n 3 run 2043171&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 4 mod 2 n 1 run 102052&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 5:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 0 tH 1 n 10 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 16 H 1 tH 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 6 n 2 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 10000 NG_n 3 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 5 n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 3 H 1 tH 0 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 3 mod 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 2 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 5 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 4 mod 4 n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 0 tH 1 n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 6 mod 3 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 2 MitM_CTL NG maxT 30000 NG_n 3 run&lt;br /&gt;
chr_LRUH 16 chr_H 12 MitM_CTL NG maxT 30000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 8 H 2 tH 1 n 2 run&lt;br /&gt;
chr_asth 0 chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 10000 NG_n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 16 H 1 tH 0 n 6 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 16 H 0 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 6 chr_H 2 MitM_CTL NG maxT 10000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 3 H 1 tH 0 n 2 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 2 mod 3 n 1 run&lt;br /&gt;
chr_LRUH 3 chr_H 1 MitM_CTL NG maxT 100000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 1 tH 0 n 4 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 2 mod 2 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 4 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 4 H 2 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 0 MitM_CTL NG maxT 1000 NG_n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 2 mod 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 3 mod 6 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 8 chr_H 8 MitM_CTL NG maxT 10000 NG_n 2 run&lt;br /&gt;
chr_asth 0 chr_LRUH 60 chr_H 60 MitM_CTL NG maxT 30000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 3 mod 2 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 4 H 1 tH 1 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 3 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 3000 NG_n 2 run&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 6:&lt;br /&gt;
&lt;br /&gt;
XnoobSpeakable ran Enumerate.py with a 0.15s/TM time limit, Lúkos ran it with a 0.75s/TM time limit.&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
python &amp;quot;+str(pl.Path(&amp;quot;../../Code/Enumerate.py&amp;quot;))+&amp;quot; --infile=&amp;quot;+str(pl.Path(&amp;quot;./in.txt&amp;quot;))+&amp;quot; --outfile=&amp;quot;+str(pl.Path(&amp;quot;./out.pb&amp;quot;))+&amp;quot; --max-loops=990_000 --tape-limit=9_900 --no-steps --time=&amp;quot;+str(time)+&amp;quot; --recursive --exp-linear-rules  --lin-steps=0 --no-ctl --save-freq=10_000&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 7:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 1000 NG_n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 12 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 1 mod 5 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 1000 NG_n 1 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 30000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 4 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 16 H 0 tH 1 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 3000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 4 H 0 tH 1 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 0 tH 2 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 12 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 1 mod 2 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 2 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 2 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 1 mod 3 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 1 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 2 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 6 H 0 tH 0 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 1000 NG_n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 100000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 1 mod 1 n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 2 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 30000 NG_n 1 run&lt;br /&gt;
&amp;lt;/pre&amp;gt;Phase 2 stage 8 (lr_enum_continue from [https://github.com/sligocki/busy-beaver busy-beaver] for 10 million steps):&amp;lt;pre&amp;gt;lr_enum_continue ./in.txt 10000000 ./halt.txt ./inf.txt ./unknown.txt &amp;quot;&amp;quot; false&amp;lt;/pre&amp;gt;Phase 2 stage 9a:&amp;lt;pre&amp;gt;python3 Code/Reverse_Engineer_Filter.py --infile=&#039;/home/xnoobspeakable/Desktop/Busy Beavers/BB(3,4)/resultsst8/3x4_holdouts_14518243.txt&#039; --outfile=&#039;out.txt&#039;&amp;lt;/pre&amp;gt;Phase 2 stage 9b:&amp;lt;pre&amp;gt;python3 ./Code/Backtracking_Filter.py --infile=&#039;/home/xnoobspeakable/Desktop/Busy Beavers/BB(3,4)/resultsst9/unknown.txt&#039;  --outfile=&#039;./b1.pb&#039; --steps=100&amp;lt;/pre&amp;gt;Phase 2 stage 10a:&amp;lt;pre&amp;gt;chr_LRUH 28 chr_LRUn 2 MitM_CTL NG maxT 30000 NG_n 8 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 6 H 1 tH 2 n 8 run&amp;lt;/pre&amp;gt;Phase 2 stage 10b:&amp;lt;pre&amp;gt;MitM_CTL CPS_LRU sim 1,001 maxT 10000 LRUH 2 H 0 tH 0 n 20 run&lt;br /&gt;
chr_LRUH 8 chr_H 8 MitM_CTL NG maxT 100000 NG_n 4 run&amp;lt;/pre&amp;gt;Phase 2 stage 10c:&amp;lt;pre&amp;gt;chr_asth 0 chr_LRUH 60 chr_H 60 MitM_CTL NG maxT 100000 NG_n 8 run&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 100000 NG_n 11 run&amp;lt;/pre&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
[[Category:BB Domains]][[Category:BB(3,4)]]&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=BB(3,4)&amp;diff=5943</id>
		<title>BB(3,4)</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=BB(3,4)&amp;diff=5943"/>
		<updated>2025-12-31T15:07:57Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: /* Phase 2 Data */ attempt formatting fix&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The Busy Beaver problem for 3 states and 4 symbols is unsolved, with the existence of [[Cryptids]] in the domain being given by the discovery of [[Bigfoot]] in [[BB(3,3)]]. The current BB(3,4) [[Champions#3-Symbol TMs|champion]] is {{TM|1RB3LB1RZ2RA_2LC3RB1LC2RA_3RB1LB3LC2RC|halt}}. It runs for &amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt; steps before halting. It was discovered by Pavel Kropitz in 2024 and was analysed by Shawn Ligocki in the same year.&lt;br /&gt;
&lt;br /&gt;
== Top Halters ==&lt;br /&gt;
The top 20 known longest running halting BB(3,4) TMs are:&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!Standard format&lt;br /&gt;
!(approximate) runtime&lt;br /&gt;
!Discoverer&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LB1RZ2RA_2LC3RB1LC2RA_3RB1LB3LC2RC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ1LA2RB_1RC3RC1LA2LB_2LB2RC1LC3RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{12} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3RB1LC2LA_2LA2RB1LB3RA_3LA1RZ1LC2RA}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{6} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3RB1LC2LA_2LA2RB1LB3RA_1RA1RZ1LC2RA}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{6} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LB1RZ3LA_0LC3RB3RC1LB_2RB2LA3RA1LC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {2\,048}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ1LA2RB_2RC3RC3LB2RA_2LB3RB3LC1LA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {189.05690}&amp;lt;/math&amp;gt;&lt;br /&gt;
|[[User:XnoobSpeakable|XnoobSpeakable]] &lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LA1RA2LB_2LC1RA2RC3RB_1RZ1LA2RA3RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {188.16168}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LB2LA3LC_1LA2RB3RA1LB_1RZ1RB2LB3LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {188.16168}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA3LA3RB_2LC2RC1LB2RA_2RA2RB0LB1RZ|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {149.57147}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LB1RZ3LA_1LA3RC2LC1LC_2LA3RC0RA1LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LB1RZ3LA_1LA3RC3LB1LC_2RA3RC0RA1LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LC1RC2RA_1LA3RA2RB1RZ_3LB2LC1RA0LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|[[User:WarpedWartWars|Lúkos]]&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA1LB3RA_1RC3LB1LC1RC_2LA2RA1RZ0LA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {96.06390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA1LB3RA_1RC3LB1LC1RC_2LA2RA1RZ1RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {96.06390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LC0RA1RC_2LA1RZ3LA2RB_3LA0RA1LA0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {95.24590}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LC0RA1RC_2LA1RZ3LA2RB_3LA0RA3LB0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {95.24590}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LA1RA1RC_1LA3LC3RB1RC_3LA1RZ3LB2RC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {84.19957}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LB1RA2LB_2RC3LB3RB2LA_2LC1RZ1LA2RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {76.17604}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LA1RZ0LB_2LC2LB1RC1RB_3LA3LC0LC0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {74.18390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2RA1LA1LB_2RC3RB1RZ3LC_2LA1RC1RB0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {69.55341}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Lúkos&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 1 ==&lt;br /&gt;
The initial phase of enumeration and reduction of [[holdouts]] took place in December 2024 and was done by Terry Ligocki using the Ligockis&#039; C++ and Python codes. The initial enumerations generated 600,253,156,787 TMs of which 42,391,877,333 were holdout TMs. Also found were 202,014,400,019 halting TMs and 355,846,879,435 infinite TMs. The number of holdouts was reduced to 434,787,751 TMs (a 98.97% reduction).&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Phase 1 Info&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Two C++ programs were run before the filters in the table.&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
lr_enum 3 4 8 /dev/null /dev/null 3x4.unk.txt false&lt;br /&gt;
00 &amp;lt;= XX &amp;lt; 47: lr_enum_continue 3x4.in.XX 1000 /dev/null /dev/null 3x4.unk.txt.XX XX false&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Both do the initial enumeration and simple filtering. The &amp;quot;/dev/null&amp;quot; in both commands would be files where the halting and infinite TMs would be stored. The first command generates the TMs from a TNF tree for BB(3,4) of depth 8 and outputs the holdouts to 3x4.unk.txt. This file was then divided into 48 pieces, 3x4.in.XX, 0 &amp;lt;= XX &amp;lt; 47. The second commands (one for each XX) continues the enumeration by running each TM for 1,000 steps. It classifies each as halting, infinite, or unknown/holdout. Again, the halting and infinite TMs are &amp;quot;written&amp;quot; to /dev/null, i.e., they aren&#039;t saved. The holdouts are stored in 48 files: 3x4.unk.txt.XX.&lt;br /&gt;
&lt;br /&gt;
For these runs the first command generated a total of 22,366,747 TMs: 932,198 halting, 235,446 infinite, and 21,199,103 holdouts. The second took the 22,366,747 holdout TMs and generated a total of 600,253,156,787 TMs: 202,014,400,019 halting, 355,846,879,435 infinite, and 42,391,877,333 holdouts. These holdouts were used as a starting point of the filters below.&lt;br /&gt;
&lt;br /&gt;
The &amp;quot;Description&amp;quot; column in the table below contain the command run. Two options are not given, &amp;quot;--infile=...&amp;quot; and an &amp;quot;--outfile=...&amp;quot;. These are necessary and specify where to read and write the results, respectively. Note: The work flow was to divide the input holdouts into 48 pieces, run the command on each piece simultaneously on one of 48 cores, and then combine the 48 results into a group of holdouts.&lt;br /&gt;
&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The details are given in this table:&lt;br /&gt;
&lt;br /&gt;
(done to reduce column size:&lt;br /&gt;
&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;= % Reduced,&lt;br /&gt;
&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;= Runtime (hours),&lt;br /&gt;
&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;= Decided,&lt;br /&gt;
&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;= Processed)&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: right&amp;quot;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |TMs/sec/core&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
!&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;&lt;br /&gt;
!&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|42,391,877,333&lt;br /&gt;
|32,247,381,725&lt;br /&gt;
|23.93%&lt;br /&gt;
|788.0&lt;br /&gt;
|3,576.08&lt;br /&gt;
|14,943.74&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Reverse_Engineer_Filter.py&lt;br /&gt;
|rowspan=&amp;quot;8&amp;quot; style=&amp;quot;text-align:left&amp;quot; |[https://drive.google.com/drive/folders/1EsFw5DOjjZ6Xzjc8QgRa2YkInrsmFnLX?usp=drive_link Google Drive]&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|32,247,381,725&lt;br /&gt;
|12,789,441,316&lt;br /&gt;
|60.34%&lt;br /&gt;
|6,185.2&lt;br /&gt;
|873.85&lt;br /&gt;
|1,448.22&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=1&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|12,789,441,316&lt;br /&gt;
|4,332,283,583&lt;br /&gt;
|66.13%&lt;br /&gt;
|4,771.0&lt;br /&gt;
|492.39&lt;br /&gt;
|744.62&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=2&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|4,332,283,583&lt;br /&gt;
|2,796,143,404&lt;br /&gt;
|35.46%&lt;br /&gt;
|7,873.1&lt;br /&gt;
|54.20&lt;br /&gt;
|152.85&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=3&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|2,796,143,404&lt;br /&gt;
|1,398,734,288&lt;br /&gt;
|49.98%&lt;br /&gt;
|10,239.4&lt;br /&gt;
|37.91&lt;br /&gt;
|75.85&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Enumerate.py --max-loops=1_000 --block-size=2 --time=10 --lin-steps=0 --no-reverse-engineer --save-freq=10_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|1,398,734,288&lt;br /&gt;
|764,851,053&lt;br /&gt;
|45.32%&lt;br /&gt;
|3,203.1&lt;br /&gt;
|54.97&lt;br /&gt;
|121.30&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Enumerate.py --max-loops=10_000 --block-size=12 --no-steps --time=0.01 --lin-steps=0 --no-ctl --no-reverse-engineer --save-freq=10_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|764,851,053&lt;br /&gt;
|581,654,405&lt;br /&gt;
|23.95%&lt;br /&gt;
|1,925.3&lt;br /&gt;
|26.43&lt;br /&gt;
|110.35&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --min-block-size=4 --max-block-size=12 --max-steps=1_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|581,654,405&lt;br /&gt;
|434,787,751&lt;br /&gt;
|25.25%&lt;br /&gt;
|9,042.5&lt;br /&gt;
|4.51&lt;br /&gt;
|17.87&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --min-block-size=4 --max-block-size=6 --max-steps=10_000&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 2 ==&lt;br /&gt;
XnoobSpeakable and Lúkos are working on applying mxdys&#039; deciders/parameters to the remaining holdouts. The previous holdouts list by Terry Ligocki was split up into 8696 files containing 50,000 holdouts each* (*the last one actually has 37,751) and the deciders were applied to the files individually. These files can be called subtasks. Lúkos made a Python script to compute the subtasks in parallel, based off of XnoobSpeakable&#039;s earlier imperfect script.&lt;br /&gt;
&lt;br /&gt;
Certain data such as TMs/sec/core is unavailable, because the amount of time the computation took was not kept track of.&lt;br /&gt;
&lt;br /&gt;
Stages 3 and 8 are lr_enum_continue computations to 1 million and 10 million steps respectively. Lúkos did not contribute to computing these stages, but rather created a Python script to compute them in bulk, which XnoobSpeakable used.&lt;br /&gt;
&lt;br /&gt;
For the &amp;quot;Contribution&amp;quot; column, the first number is the amount of subtasks solved by XnoobSpeakable, the 2nd is the amount solved by Lúkos. Note that the counts are unequal, because Lúkos has a slower CPU with a lower core count. According to XnoobSpeakable, the time contribution from both contributors is roughly equal. Lúkos also worked on the Python scripts used, while XnoobSpeakable worked on compiling holdouts lists and finding optimal deciders to apply. &lt;br /&gt;
&lt;br /&gt;
[[User:Peacemaker II|Peacemaker II]] worked on verifying the validity of the results as well as providing solved TM counts per decider. Stages 1, 2, and 4 have been validated - no dropped TMs. XnoobSpeakable verified stage 6.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;nowiki&amp;gt;**&amp;lt;/nowiki&amp;gt;Stage 9: The two subtasks are seperate sub-stages, applying Reverse-Engineer and Backtracking deciders.&lt;br /&gt;
&lt;br /&gt;
Stage 10 is also seperated into substages A, B, and C for ease of computation.&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1MamU8zivuqoe4j82vpb-jYBfc4wvXNRc All scripts used are available here.] The details will be given in this table:&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: left&amp;quot;&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
! colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |% Reduced&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Subtasks&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Contribution&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Verified&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |XnoobSpeakable, Lúkos&lt;br /&gt;
|434,787,751&lt;br /&gt;
|64,777,377&lt;br /&gt;
|85.1%&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Phase 2 stage 1&lt;br /&gt;
|8696&lt;br /&gt;
|7696 / 1000&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|64,777,377&lt;br /&gt;
|37,016,957&lt;br /&gt;
|42.9%&lt;br /&gt;
|Phase 2 stage 2&lt;br /&gt;
|1296&lt;br /&gt;
|1000 / 296&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|37,016,957&lt;br /&gt;
|26,266,261&lt;br /&gt;
|29.0%&lt;br /&gt;
|Phase 2 stage 3&lt;br /&gt;
|741&lt;br /&gt;
|741 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|26,266,261&lt;br /&gt;
|22,396,711&lt;br /&gt;
|14.7%&lt;br /&gt;
|Phase 2 stage 4&lt;br /&gt;
|526&lt;br /&gt;
|485 / 41&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|22,396,711&lt;br /&gt;
|17,983,810&lt;br /&gt;
|19.7%&lt;br /&gt;
|Phase 2 stage 5&lt;br /&gt;
|448&lt;br /&gt;
|390 / 58&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|17,983,810&lt;br /&gt;
|15,564,491&lt;br /&gt;
|13.5%&lt;br /&gt;
|Phase 2 stage 6&lt;br /&gt;
|360&lt;br /&gt;
|300 / 60&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|15,564,491&lt;br /&gt;
|15,136,283&lt;br /&gt;
|2.75%&lt;br /&gt;
|Phase 2 stage 7&lt;br /&gt;
|312&lt;br /&gt;
|260 / 52&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|15,136,283&lt;br /&gt;
|14,518,243&lt;br /&gt;
|4.08%&lt;br /&gt;
|Phase 2 stage 8&lt;br /&gt;
|303&lt;br /&gt;
|303 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|14,518,243&lt;br /&gt;
|14,413,460&lt;br /&gt;
|0.72%&lt;br /&gt;
|Phase 2 stage 9&lt;br /&gt;
|2**&lt;br /&gt;
|2 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|14,413,460&lt;br /&gt;
|13,733,388&lt;br /&gt;
|4.72%&lt;br /&gt;
|Phase 2 stage 10A&lt;br /&gt;
|289&lt;br /&gt;
|216 / 73&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|13,733,388&lt;br /&gt;
|13,334,244&lt;br /&gt;
|2.91%&lt;br /&gt;
|Phase 2 stage 10B&lt;br /&gt;
|275&lt;br /&gt;
|200 / 75&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|13,334,244&lt;br /&gt;
|12,435,284&lt;br /&gt;
|6.74%&lt;br /&gt;
|Phase 2 stage 10C&lt;br /&gt;
|267&lt;br /&gt;
|190 / 77&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 2 Data ==&lt;br /&gt;
Here we will list the deciders applied during the various stages of Phase 2. Each decider within a stage was not applied in a specific order. Some stages have a number of TMs solved by every decider at the end of each row, provided by Peacemaker II.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Details&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Phase 2 stage 1:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 1000 NG_n 2 run 86569103&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 1000 NG_n 1 run 26093656&lt;br /&gt;
chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 13972946&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 6 mod 3 n 2 run 7190617&lt;br /&gt;
chr_LRUH 10 chr_H 6 MitM_CTL NG maxT 1000 NG_n 2 run 90302784&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 1 n 4 run 4342619&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 12 H 0 tH 1 n 2 run 11764327&lt;br /&gt;
chr_LRUH 2 chr_H 2 MitM_CTL NG maxT 1000 NG_n 1 run 55465842&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 2 n 1 run 17805678&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 2 H 0 tH 0 n 1 run 12623067&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 3000 NG_n 2 run 2240499&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 4 H 1 tH 1 n 2 run 10223131&lt;br /&gt;
chr_LRUH 6 chr_H 4 MitM_CTL NG maxT 10000 NG_n 1 run 2901053&lt;br /&gt;
chr_LRUH 22 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 28515052&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 2:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 4 n 8 run 1030303&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 8 mod 2 n 2 run 1465523&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 10000 NG_n 4 run 5232902&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 1720994&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 8 mod 3 n 2 run 555883&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 3 H 1 tH 0 n 6 run 290547&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 1 run 67506&lt;br /&gt;
chr_LRUH 10 chr_H 8 MitM_CTL NG maxT 10000 NG_n 2 run 1577979&lt;br /&gt;
chr_LRUH 6 chr_H 6 MitM_CTL NG maxT 3000 NG_n 2 run 1604533&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 4 n 6 run 10012948&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 8 H 0 tH 0 n 4 run 526822&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 1 n 1 run 34821&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 6 H 0 tH 1 n 3 run 356375&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 20 run 1970422&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 6 mod 3 n 1 run 443339&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 3 H 0 tH 1 n 2 run 518824&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 2 mod 2 n 1 run 61865&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 1 tH 1 n 2 run 288834&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 3 (lr_enum_continue from [https://github.com/sligocki/busy-beaver busy-beaver] for 1 million steps):&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
lr_enum_continue ./in.txt 1000000 ./halt.txt ./inf.txt ./unknown.txt &amp;quot;&amp;quot; false&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 4:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 3000 NG_n 2 run 202520&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 3000 NG_n 1 run 559013&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 4 n 1 run 1584&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 10000 NG_n 1 run 148544&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 1 run 812666&lt;br /&gt;
chr_asth 0 chr_LRUH 48 chr_H 48 MitM_CTL NG maxT 10000 NG_n 3 run 2043171&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 4 mod 2 n 1 run 102052&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 5:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 0 tH 1 n 10 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 16 H 1 tH 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 6 n 2 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 10000 NG_n 3 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 5 n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 3 H 1 tH 0 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 3 mod 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 2 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 5 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 4 mod 4 n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 0 tH 1 n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 6 mod 3 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 2 MitM_CTL NG maxT 30000 NG_n 3 run&lt;br /&gt;
chr_LRUH 16 chr_H 12 MitM_CTL NG maxT 30000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 8 H 2 tH 1 n 2 run&lt;br /&gt;
chr_asth 0 chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 10000 NG_n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 16 H 1 tH 0 n 6 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 16 H 0 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 6 chr_H 2 MitM_CTL NG maxT 10000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 3 H 1 tH 0 n 2 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 2 mod 3 n 1 run&lt;br /&gt;
chr_LRUH 3 chr_H 1 MitM_CTL NG maxT 100000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 1 tH 0 n 4 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 2 mod 2 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 4 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 4 H 2 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 0 MitM_CTL NG maxT 1000 NG_n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 2 mod 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 3 mod 6 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 8 chr_H 8 MitM_CTL NG maxT 10000 NG_n 2 run&lt;br /&gt;
chr_asth 0 chr_LRUH 60 chr_H 60 MitM_CTL NG maxT 30000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 3 mod 2 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 4 H 1 tH 1 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 3 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 3000 NG_n 2 run&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 6:&lt;br /&gt;
&lt;br /&gt;
XnoobSpeakable ran Enumerate.py with a 0.15s/TM time limit, Lúkos ran it with a 0.75s/TM time limit.&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
python &amp;quot;+str(pl.Path(&amp;quot;../../Code/Enumerate.py&amp;quot;))+&amp;quot; --infile=&amp;quot;+str(pl.Path(&amp;quot;./in.txt&amp;quot;))+&amp;quot; --outfile=&amp;quot;+str(pl.Path(&amp;quot;./out.pb&amp;quot;))+&amp;quot; --max-loops=990_000 --tape-limit=9_900 --no-steps --time=&amp;quot;+str(time)+&amp;quot; --recursive --exp-linear-rules  --lin-steps=0 --no-ctl --save-freq=10_000&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 7:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 1000 NG_n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 12 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 1 mod 5 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 1000 NG_n 1 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 30000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 4 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 16 H 0 tH 1 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 3000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 4 H 0 tH 1 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 0 tH 2 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 12 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 1 mod 2 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 2 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 2 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 1 mod 3 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 1 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 2 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 6 H 0 tH 0 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 1000 NG_n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 100000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 1 mod 1 n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 2 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 30000 NG_n 1 run&lt;br /&gt;
&amp;lt;/pre&amp;gt;Phase 2 stage 8 (lr_enum_continue from [https://github.com/sligocki/busy-beaver busy-beaver] for 10 million steps):&amp;lt;pre&amp;gt;lr_enum_continue ./in.txt 10000000 ./halt.txt ./inf.txt ./unknown.txt &amp;quot;&amp;quot; false&amp;lt;/pre&amp;gt;Phase 2 stage 9a:&amp;lt;pre&amp;gt;python3 Code/Reverse_Engineer_Filter.py --infile=&#039;/home/xnoobspeakable/Desktop/Busy Beavers/BB(3,4)/resultsst8/3x4_holdouts_14518243.txt&#039; --outfile=&#039;out.txt&#039;&amp;lt;/pre&amp;gt;Phase 2 stage 9b:&amp;lt;pre&amp;gt;python3 ./Code/Backtracking_Filter.py --infile=&#039;/home/xnoobspeakable/Desktop/Busy Beavers/BB(3,4)/resultsst9/unknown.txt&#039;  --outfile=&#039;./b1.pb&#039; --steps=100&amp;lt;/pre&amp;gt;Phase 2 stage 10a:&amp;lt;pre&amp;gt;chr_LRUH 28 chr_LRUn 2 MitM_CTL NG maxT 30000 NG_n 8 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 6 H 1 tH 2 n 8 run&amp;lt;/pre&amp;gt;Phase 2 stage 10b:&amp;lt;pre&amp;gt;MitM_CTL CPS_LRU sim 1,001 maxT 10000 LRUH 2 H 0 tH 0 n 20 run&lt;br /&gt;
chr_LRUH 8 chr_H 8 MitM_CTL NG maxT 100000 NG_n 4 run&amp;lt;/pre&amp;gt;Phase 2 stage 10b:&amp;lt;pre&amp;gt;chr_asth 0 chr_LRUH 60 chr_H 60 MitM_CTL NG maxT 100000 NG_n 8 run&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 100000 NG_n 11 run&amp;lt;/pre&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
[[Category:BB Domains]][[Category:BB(3,4)]]&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=BB(3,4)&amp;diff=5942</id>
		<title>BB(3,4)</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=BB(3,4)&amp;diff=5942"/>
		<updated>2025-12-31T15:05:43Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: /* Phase 2 */ Stage 10C&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The Busy Beaver problem for 3 states and 4 symbols is unsolved, with the existence of [[Cryptids]] in the domain being given by the discovery of [[Bigfoot]] in [[BB(3,3)]]. The current BB(3,4) [[Champions#3-Symbol TMs|champion]] is {{TM|1RB3LB1RZ2RA_2LC3RB1LC2RA_3RB1LB3LC2RC|halt}}. It runs for &amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt; steps before halting. It was discovered by Pavel Kropitz in 2024 and was analysed by Shawn Ligocki in the same year.&lt;br /&gt;
&lt;br /&gt;
== Top Halters ==&lt;br /&gt;
The top 20 known longest running halting BB(3,4) TMs are:&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!Standard format&lt;br /&gt;
!(approximate) runtime&lt;br /&gt;
!Discoverer&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LB1RZ2RA_2LC3RB1LC2RA_3RB1LB3LC2RC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ1LA2RB_1RC3RC1LA2LB_2LB2RC1LC3RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{12} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3RB1LC2LA_2LA2RB1LB3RA_3LA1RZ1LC2RA}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{6} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3RB1LC2LA_2LA2RB1LB3RA_1RA1RZ1LC2RA}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{6} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LB1RZ3LA_0LC3RB3RC1LB_2RB2LA3RA1LC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {2\,048}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ1LA2RB_2RC3RC3LB2RA_2LB3RB3LC1LA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {189.05690}&amp;lt;/math&amp;gt;&lt;br /&gt;
|[[User:XnoobSpeakable|XnoobSpeakable]] &lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LA1RA2LB_2LC1RA2RC3RB_1RZ1LA2RA3RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {188.16168}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LB2LA3LC_1LA2RB3RA1LB_1RZ1RB2LB3LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {188.16168}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA3LA3RB_2LC2RC1LB2RA_2RA2RB0LB1RZ|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {149.57147}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LB1RZ3LA_1LA3RC2LC1LC_2LA3RC0RA1LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LB1RZ3LA_1LA3RC3LB1LC_2RA3RC0RA1LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LC1RC2RA_1LA3RA2RB1RZ_3LB2LC1RA0LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|[[User:WarpedWartWars|Lúkos]]&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA1LB3RA_1RC3LB1LC1RC_2LA2RA1RZ0LA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {96.06390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA1LB3RA_1RC3LB1LC1RC_2LA2RA1RZ1RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {96.06390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LC0RA1RC_2LA1RZ3LA2RB_3LA0RA1LA0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {95.24590}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LC0RA1RC_2LA1RZ3LA2RB_3LA0RA3LB0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {95.24590}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LA1RA1RC_1LA3LC3RB1RC_3LA1RZ3LB2RC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {84.19957}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LB1RA2LB_2RC3LB3RB2LA_2LC1RZ1LA2RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {76.17604}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LA1RZ0LB_2LC2LB1RC1RB_3LA3LC0LC0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {74.18390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2RA1LA1LB_2RC3RB1RZ3LC_2LA1RC1RB0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {69.55341}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Lúkos&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 1 ==&lt;br /&gt;
The initial phase of enumeration and reduction of [[holdouts]] took place in December 2024 and was done by Terry Ligocki using the Ligockis&#039; C++ and Python codes. The initial enumerations generated 600,253,156,787 TMs of which 42,391,877,333 were holdout TMs. Also found were 202,014,400,019 halting TMs and 355,846,879,435 infinite TMs. The number of holdouts was reduced to 434,787,751 TMs (a 98.97% reduction).&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Phase 1 Info&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Two C++ programs were run before the filters in the table.&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
lr_enum 3 4 8 /dev/null /dev/null 3x4.unk.txt false&lt;br /&gt;
00 &amp;lt;= XX &amp;lt; 47: lr_enum_continue 3x4.in.XX 1000 /dev/null /dev/null 3x4.unk.txt.XX XX false&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Both do the initial enumeration and simple filtering. The &amp;quot;/dev/null&amp;quot; in both commands would be files where the halting and infinite TMs would be stored. The first command generates the TMs from a TNF tree for BB(3,4) of depth 8 and outputs the holdouts to 3x4.unk.txt. This file was then divided into 48 pieces, 3x4.in.XX, 0 &amp;lt;= XX &amp;lt; 47. The second commands (one for each XX) continues the enumeration by running each TM for 1,000 steps. It classifies each as halting, infinite, or unknown/holdout. Again, the halting and infinite TMs are &amp;quot;written&amp;quot; to /dev/null, i.e., they aren&#039;t saved. The holdouts are stored in 48 files: 3x4.unk.txt.XX.&lt;br /&gt;
&lt;br /&gt;
For these runs the first command generated a total of 22,366,747 TMs: 932,198 halting, 235,446 infinite, and 21,199,103 holdouts. The second took the 22,366,747 holdout TMs and generated a total of 600,253,156,787 TMs: 202,014,400,019 halting, 355,846,879,435 infinite, and 42,391,877,333 holdouts. These holdouts were used as a starting point of the filters below.&lt;br /&gt;
&lt;br /&gt;
The &amp;quot;Description&amp;quot; column in the table below contain the command run. Two options are not given, &amp;quot;--infile=...&amp;quot; and an &amp;quot;--outfile=...&amp;quot;. These are necessary and specify where to read and write the results, respectively. Note: The work flow was to divide the input holdouts into 48 pieces, run the command on each piece simultaneously on one of 48 cores, and then combine the 48 results into a group of holdouts.&lt;br /&gt;
&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The details are given in this table:&lt;br /&gt;
&lt;br /&gt;
(done to reduce column size:&lt;br /&gt;
&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;= % Reduced,&lt;br /&gt;
&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;= Runtime (hours),&lt;br /&gt;
&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;= Decided,&lt;br /&gt;
&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;= Processed)&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: right&amp;quot;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |TMs/sec/core&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
!&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;&lt;br /&gt;
!&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|42,391,877,333&lt;br /&gt;
|32,247,381,725&lt;br /&gt;
|23.93%&lt;br /&gt;
|788.0&lt;br /&gt;
|3,576.08&lt;br /&gt;
|14,943.74&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Reverse_Engineer_Filter.py&lt;br /&gt;
|rowspan=&amp;quot;8&amp;quot; style=&amp;quot;text-align:left&amp;quot; |[https://drive.google.com/drive/folders/1EsFw5DOjjZ6Xzjc8QgRa2YkInrsmFnLX?usp=drive_link Google Drive]&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|32,247,381,725&lt;br /&gt;
|12,789,441,316&lt;br /&gt;
|60.34%&lt;br /&gt;
|6,185.2&lt;br /&gt;
|873.85&lt;br /&gt;
|1,448.22&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=1&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|12,789,441,316&lt;br /&gt;
|4,332,283,583&lt;br /&gt;
|66.13%&lt;br /&gt;
|4,771.0&lt;br /&gt;
|492.39&lt;br /&gt;
|744.62&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=2&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|4,332,283,583&lt;br /&gt;
|2,796,143,404&lt;br /&gt;
|35.46%&lt;br /&gt;
|7,873.1&lt;br /&gt;
|54.20&lt;br /&gt;
|152.85&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=3&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|2,796,143,404&lt;br /&gt;
|1,398,734,288&lt;br /&gt;
|49.98%&lt;br /&gt;
|10,239.4&lt;br /&gt;
|37.91&lt;br /&gt;
|75.85&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Enumerate.py --max-loops=1_000 --block-size=2 --time=10 --lin-steps=0 --no-reverse-engineer --save-freq=10_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|1,398,734,288&lt;br /&gt;
|764,851,053&lt;br /&gt;
|45.32%&lt;br /&gt;
|3,203.1&lt;br /&gt;
|54.97&lt;br /&gt;
|121.30&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Enumerate.py --max-loops=10_000 --block-size=12 --no-steps --time=0.01 --lin-steps=0 --no-ctl --no-reverse-engineer --save-freq=10_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|764,851,053&lt;br /&gt;
|581,654,405&lt;br /&gt;
|23.95%&lt;br /&gt;
|1,925.3&lt;br /&gt;
|26.43&lt;br /&gt;
|110.35&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --min-block-size=4 --max-block-size=12 --max-steps=1_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|581,654,405&lt;br /&gt;
|434,787,751&lt;br /&gt;
|25.25%&lt;br /&gt;
|9,042.5&lt;br /&gt;
|4.51&lt;br /&gt;
|17.87&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --min-block-size=4 --max-block-size=6 --max-steps=10_000&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 2 ==&lt;br /&gt;
XnoobSpeakable and Lúkos are working on applying mxdys&#039; deciders/parameters to the remaining holdouts. The previous holdouts list by Terry Ligocki was split up into 8696 files containing 50,000 holdouts each* (*the last one actually has 37,751) and the deciders were applied to the files individually. These files can be called subtasks. Lúkos made a Python script to compute the subtasks in parallel, based off of XnoobSpeakable&#039;s earlier imperfect script.&lt;br /&gt;
&lt;br /&gt;
Certain data such as TMs/sec/core is unavailable, because the amount of time the computation took was not kept track of.&lt;br /&gt;
&lt;br /&gt;
Stages 3 and 8 are lr_enum_continue computations to 1 million and 10 million steps respectively. Lúkos did not contribute to computing these stages, but rather created a Python script to compute them in bulk, which XnoobSpeakable used.&lt;br /&gt;
&lt;br /&gt;
For the &amp;quot;Contribution&amp;quot; column, the first number is the amount of subtasks solved by XnoobSpeakable, the 2nd is the amount solved by Lúkos. Note that the counts are unequal, because Lúkos has a slower CPU with a lower core count. According to XnoobSpeakable, the time contribution from both contributors is roughly equal. Lúkos also worked on the Python scripts used, while XnoobSpeakable worked on compiling holdouts lists and finding optimal deciders to apply. &lt;br /&gt;
&lt;br /&gt;
[[User:Peacemaker II|Peacemaker II]] worked on verifying the validity of the results as well as providing solved TM counts per decider. Stages 1, 2, and 4 have been validated - no dropped TMs. XnoobSpeakable verified stage 6.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;nowiki&amp;gt;**&amp;lt;/nowiki&amp;gt;Stage 9: The two subtasks are seperate sub-stages, applying Reverse-Engineer and Backtracking deciders.&lt;br /&gt;
&lt;br /&gt;
Stage 10 is also seperated into substages A, B, and C for ease of computation.&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1MamU8zivuqoe4j82vpb-jYBfc4wvXNRc All scripts used are available here.] The details will be given in this table:&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: left&amp;quot;&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
! colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |% Reduced&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Subtasks&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Contribution&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Verified&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |XnoobSpeakable, Lúkos&lt;br /&gt;
|434,787,751&lt;br /&gt;
|64,777,377&lt;br /&gt;
|85.1%&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Phase 2 stage 1&lt;br /&gt;
|8696&lt;br /&gt;
|7696 / 1000&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|64,777,377&lt;br /&gt;
|37,016,957&lt;br /&gt;
|42.9%&lt;br /&gt;
|Phase 2 stage 2&lt;br /&gt;
|1296&lt;br /&gt;
|1000 / 296&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|37,016,957&lt;br /&gt;
|26,266,261&lt;br /&gt;
|29.0%&lt;br /&gt;
|Phase 2 stage 3&lt;br /&gt;
|741&lt;br /&gt;
|741 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|26,266,261&lt;br /&gt;
|22,396,711&lt;br /&gt;
|14.7%&lt;br /&gt;
|Phase 2 stage 4&lt;br /&gt;
|526&lt;br /&gt;
|485 / 41&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|22,396,711&lt;br /&gt;
|17,983,810&lt;br /&gt;
|19.7%&lt;br /&gt;
|Phase 2 stage 5&lt;br /&gt;
|448&lt;br /&gt;
|390 / 58&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|17,983,810&lt;br /&gt;
|15,564,491&lt;br /&gt;
|13.5%&lt;br /&gt;
|Phase 2 stage 6&lt;br /&gt;
|360&lt;br /&gt;
|300 / 60&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|15,564,491&lt;br /&gt;
|15,136,283&lt;br /&gt;
|2.75%&lt;br /&gt;
|Phase 2 stage 7&lt;br /&gt;
|312&lt;br /&gt;
|260 / 52&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|15,136,283&lt;br /&gt;
|14,518,243&lt;br /&gt;
|4.08%&lt;br /&gt;
|Phase 2 stage 8&lt;br /&gt;
|303&lt;br /&gt;
|303 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|14,518,243&lt;br /&gt;
|14,413,460&lt;br /&gt;
|0.72%&lt;br /&gt;
|Phase 2 stage 9&lt;br /&gt;
|2**&lt;br /&gt;
|2 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|14,413,460&lt;br /&gt;
|13,733,388&lt;br /&gt;
|4.72%&lt;br /&gt;
|Phase 2 stage 10A&lt;br /&gt;
|289&lt;br /&gt;
|216 / 73&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|13,733,388&lt;br /&gt;
|13,334,244&lt;br /&gt;
|2.91%&lt;br /&gt;
|Phase 2 stage 10B&lt;br /&gt;
|275&lt;br /&gt;
|200 / 75&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|13,334,244&lt;br /&gt;
|12,435,284&lt;br /&gt;
|6.74%&lt;br /&gt;
|Phase 2 stage 10C&lt;br /&gt;
|267&lt;br /&gt;
|190 / 77&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 2 Data ==&lt;br /&gt;
Here we will list the deciders applied during the various stages of Phase 2. Each decider within a stage was not applied in a specific order. Some stages have a number of TMs solved by every decider at the end of each row, provided by Peacemaker II.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Details&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Phase 2 stage 1:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 1000 NG_n 2 run 86569103&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 1000 NG_n 1 run 26093656&lt;br /&gt;
chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 13972946&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 6 mod 3 n 2 run 7190617&lt;br /&gt;
chr_LRUH 10 chr_H 6 MitM_CTL NG maxT 1000 NG_n 2 run 90302784&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 1 n 4 run 4342619&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 12 H 0 tH 1 n 2 run 11764327&lt;br /&gt;
chr_LRUH 2 chr_H 2 MitM_CTL NG maxT 1000 NG_n 1 run 55465842&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 2 n 1 run 17805678&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 2 H 0 tH 0 n 1 run 12623067&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 3000 NG_n 2 run 2240499&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 4 H 1 tH 1 n 2 run 10223131&lt;br /&gt;
chr_LRUH 6 chr_H 4 MitM_CTL NG maxT 10000 NG_n 1 run 2901053&lt;br /&gt;
chr_LRUH 22 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 28515052&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 2:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 4 n 8 run 1030303&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 8 mod 2 n 2 run 1465523&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 10000 NG_n 4 run 5232902&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 1720994&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 8 mod 3 n 2 run 555883&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 3 H 1 tH 0 n 6 run 290547&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 1 run 67506&lt;br /&gt;
chr_LRUH 10 chr_H 8 MitM_CTL NG maxT 10000 NG_n 2 run 1577979&lt;br /&gt;
chr_LRUH 6 chr_H 6 MitM_CTL NG maxT 3000 NG_n 2 run 1604533&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 4 n 6 run 10012948&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 8 H 0 tH 0 n 4 run 526822&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 1 n 1 run 34821&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 6 H 0 tH 1 n 3 run 356375&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 20 run 1970422&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 6 mod 3 n 1 run 443339&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 3 H 0 tH 1 n 2 run 518824&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 2 mod 2 n 1 run 61865&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 1 tH 1 n 2 run 288834&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 3 (lr_enum_continue from [https://github.com/sligocki/busy-beaver busy-beaver] for 1 million steps):&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
lr_enum_continue ./in.txt 1000000 ./halt.txt ./inf.txt ./unknown.txt &amp;quot;&amp;quot; false&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 4:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 3000 NG_n 2 run 202520&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 3000 NG_n 1 run 559013&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 4 n 1 run 1584&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 10000 NG_n 1 run 148544&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 1 run 812666&lt;br /&gt;
chr_asth 0 chr_LRUH 48 chr_H 48 MitM_CTL NG maxT 10000 NG_n 3 run 2043171&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 4 mod 2 n 1 run 102052&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 5:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 0 tH 1 n 10 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 16 H 1 tH 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 6 n 2 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 10000 NG_n 3 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 5 n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 3 H 1 tH 0 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 3 mod 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 2 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 5 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 4 mod 4 n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 0 tH 1 n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 6 mod 3 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 2 MitM_CTL NG maxT 30000 NG_n 3 run&lt;br /&gt;
chr_LRUH 16 chr_H 12 MitM_CTL NG maxT 30000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 8 H 2 tH 1 n 2 run&lt;br /&gt;
chr_asth 0 chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 10000 NG_n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 16 H 1 tH 0 n 6 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 16 H 0 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 6 chr_H 2 MitM_CTL NG maxT 10000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 3 H 1 tH 0 n 2 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 2 mod 3 n 1 run&lt;br /&gt;
chr_LRUH 3 chr_H 1 MitM_CTL NG maxT 100000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 1 tH 0 n 4 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 2 mod 2 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 4 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 4 H 2 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 0 MitM_CTL NG maxT 1000 NG_n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 2 mod 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 3 mod 6 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 8 chr_H 8 MitM_CTL NG maxT 10000 NG_n 2 run&lt;br /&gt;
chr_asth 0 chr_LRUH 60 chr_H 60 MitM_CTL NG maxT 30000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 3 mod 2 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 4 H 1 tH 1 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 3 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 3000 NG_n 2 run&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 6:&lt;br /&gt;
&lt;br /&gt;
XnoobSpeakable ran Enumerate.py with a 0.15s/TM time limit, Lúkos ran it with a 0.75s/TM time limit.&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
python &amp;quot;+str(pl.Path(&amp;quot;../../Code/Enumerate.py&amp;quot;))+&amp;quot; --infile=&amp;quot;+str(pl.Path(&amp;quot;./in.txt&amp;quot;))+&amp;quot; --outfile=&amp;quot;+str(pl.Path(&amp;quot;./out.pb&amp;quot;))+&amp;quot; --max-loops=990_000 --tape-limit=9_900 --no-steps --time=&amp;quot;+str(time)+&amp;quot; --recursive --exp-linear-rules  --lin-steps=0 --no-ctl --save-freq=10_000&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 7:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 1000 NG_n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 12 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 1 mod 5 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 1000 NG_n 1 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 30000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 4 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 16 H 0 tH 1 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 3000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 4 H 0 tH 1 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 0 tH 2 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 12 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 1 mod 2 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 2 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 2 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 1 mod 3 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 1 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 2 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 6 H 0 tH 0 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 1000 NG_n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 100000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 1 mod 1 n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 2 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 30000 NG_n 1 run&lt;br /&gt;
&amp;lt;/pre&amp;gt;Phase 2 stage 8 (lr_enum_continue from [https://github.com/sligocki/busy-beaver busy-beaver] for 10 million steps):&amp;lt;pre&amp;gt;lr_enum_continue ./in.txt 10000000 ./halt.txt ./inf.txt ./unknown.txt &amp;quot;&amp;quot; false&amp;lt;/pre&amp;gt;Phase 2 stage 9a:&amp;lt;pre&amp;gt;python3 Code/Reverse_Engineer_Filter.py --infile=&#039;/home/xnoobspeakable/Desktop/Busy Beavers/BB(3,4)/resultsst8/3x4_holdouts_14518243.txt&#039; --outfile=&#039;out.txt&#039;&amp;lt;/pre&amp;gt;Phase 2 stage 9b:&amp;lt;pre&amp;gt;python3 ./Code/Backtracking_Filter.py --infile=&#039;/home/xnoobspeakable/Desktop/Busy Beavers/BB(3,4)/resultsst9/unknown.txt&#039;  --outfile=&#039;./b1.pb&#039; --steps=100&amp;lt;/pre&amp;gt;Phase 2 stage 10a:&amp;lt;pre&amp;gt;chr_LRUH 28 chr_LRUn 2 MitM_CTL NG maxT 30000 NG_n 8 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 6 H 1 tH 2 n 8 run&amp;lt;/pre&amp;gt;Phase 2 stage 10b:&amp;lt;pre&amp;gt;MitM_CTL CPS_LRU sim 1,001 maxT 10000 LRUH 2 H 0 tH 0 n 20 run&lt;br /&gt;
chr_LRUH 8 chr_H 8 MitM_CTL NG maxT 100000 NG_n 4 run&amp;lt;/pre&amp;gt;Phase 2 stage 10c:&lt;br /&gt;
&amp;lt;/div&amp;gt;&amp;lt;pre&amp;gt;chr_asth 0 chr_LRUH 60 chr_H 60 MitM_CTL NG maxT 100000 NG_n 8 run&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 100000 NG_n 11 run&amp;lt;/pre&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
[[Category:BB Domains]][[Category:BB(3,4)]]&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=BB(3,4)&amp;diff=5762</id>
		<title>BB(3,4)</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=BB(3,4)&amp;diff=5762"/>
		<updated>2025-12-24T18:13:43Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: /* Phase 2 Data */ attempt fix&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The Busy Beaver problem for 3 states and 4 symbols is unsolved, with the existence of [[Cryptids]] in the domain being given by the discovery of [[Bigfoot]] in [[BB(3,3)]]. The current BB(3,4) [[Champions#3-Symbol TMs|champion]] is {{TM|1RB3LB1RZ2RA_2LC3RB1LC2RA_3RB1LB3LC2RC|halt}}. It runs for &amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt; steps before halting. It was discovered by Pavel Kropitz in 2024 and was analysed by Shawn Ligocki in the same year.&lt;br /&gt;
&lt;br /&gt;
== Top Halters ==&lt;br /&gt;
The top 20 known longest running halting BB(3,4) TMs are:&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!Standard format&lt;br /&gt;
!(approximate) runtime&lt;br /&gt;
!Discoverer&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LB1RZ2RA_2LC3RB1LC2RA_3RB1LB3LC2RC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ1LA2RB_1RC3RC1LA2LB_2LB2RC1LC3RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{12} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3RB1LC2LA_2LA2RB1LB3RA_3LA1RZ1LC2RA}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{6} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3RB1LC2LA_2LA2RB1LB3RA_1RA1RZ1LC2RA}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{6} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LB1RZ3LA_0LC3RB3RC1LB_2RB2LA3RA1LC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {2\,048}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ1LA2RB_2RC3RC3LB2RA_2LB3RB3LC1LA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {189.05690}&amp;lt;/math&amp;gt;&lt;br /&gt;
|[[User:XnoobSpeakable|XnoobSpeakable]] &lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LA1RA2LB_2LC1RA2RC3RB_1RZ1LA2RA3RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {188.16168}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LB2LA3LC_1LA2RB3RA1LB_1RZ1RB2LB3LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {188.16168}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA3LA3RB_2LC2RC1LB2RA_2RA2RB0LB1RZ|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {149.57147}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LB1RZ3LA_1LA3RC2LC1LC_2LA3RC0RA1LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LB1RZ3LA_1LA3RC3LB1LC_2RA3RC0RA1LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LC1RC2RA_1LA3RA2RB1RZ_3LB2LC1RA0LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|[[User:WarpedWartWars|Lúkos]]&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA1LB3RA_1RC3LB1LC1RC_2LA2RA1RZ0LA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {96.06390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA1LB3RA_1RC3LB1LC1RC_2LA2RA1RZ1RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {96.06390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LC0RA1RC_2LA1RZ3LA2RB_3LA0RA1LA0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {95.24590}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LC0RA1RC_2LA1RZ3LA2RB_3LA0RA3LB0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {95.24590}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LA1RA1RC_1LA3LC3RB1RC_3LA1RZ3LB2RC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {84.19957}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LB1RA2LB_2RC3LB3RB2LA_2LC1RZ1LA2RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {76.17604}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LA1RZ0LB_2LC2LB1RC1RB_3LA3LC0LC0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {74.18390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2RA1LA1LB_2RC3RB1RZ3LC_2LA1RC1RB0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {69.55341}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Lúkos&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 1 ==&lt;br /&gt;
The initial phase of enumeration and reduction of [[holdouts]] took place in December 2024 and was done by Terry Ligocki using the Ligockis&#039; C++ and Python codes. The initial enumerations generated 600,253,156,787 TMs of which 42,391,877,333 were holdout TMs. Also found were 202,014,400,019 halting TMs and 355,846,879,435 infinite TMs. The number of holdouts was reduced to 434,787,751 TMs (a 98.97% reduction).&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Phase 1 Info&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Two C++ programs were run before the filters in the table.&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
lr_enum 3 4 8 /dev/null /dev/null 3x4.unk.txt false&lt;br /&gt;
00 &amp;lt;= XX &amp;lt; 47: lr_enum_continue 3x4.in.XX 1000 /dev/null /dev/null 3x4.unk.txt.XX XX false&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Both do the initial enumeration and simple filtering. The &amp;quot;/dev/null&amp;quot; in both commands would be files where the halting and infinite TMs would be stored. The first command generates the TMs from a TNF tree for BB(3,4) of depth 8 and outputs the holdouts to 3x4.unk.txt. This file was then divided into 48 pieces, 3x4.in.XX, 0 &amp;lt;= XX &amp;lt; 47. The second commands (one for each XX) continues the enumeration by running each TM for 1,000 steps. It classifies each as halting, infinite, or unknown/holdout. Again, the halting and infinite TMs are &amp;quot;written&amp;quot; to /dev/null, i.e., they aren&#039;t saved. The holdouts are stored in 48 files: 3x4.unk.txt.XX.&lt;br /&gt;
&lt;br /&gt;
For these runs the first command generated a total of 22,366,747 TMs: 932,198 halting, 235,446 infinite, and 21,199,103 holdouts. The second took the 22,366,747 holdout TMs and generated a total of 600,253,156,787 TMs: 202,014,400,019 halting, 355,846,879,435 infinite, and 42,391,877,333 holdouts. These holdouts were used as a starting point of the filters below.&lt;br /&gt;
&lt;br /&gt;
The &amp;quot;Description&amp;quot; column in the table below contain the command run. Two options are not given, &amp;quot;--infile=...&amp;quot; and an &amp;quot;--outfile=...&amp;quot;. These are necessary and specify where to read and write the results, respectively. Note: The work flow was to divide the input holdouts into 48 pieces, run the command on each piece simultaneously on one of 48 cores, and then combine the 48 results into a group of holdouts.&lt;br /&gt;
&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The details are given in this table:&lt;br /&gt;
&lt;br /&gt;
(done to reduce column size:&lt;br /&gt;
&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;= % Reduced,&lt;br /&gt;
&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;= Runtime (hours),&lt;br /&gt;
&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;= Decided,&lt;br /&gt;
&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;= Processed)&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: right&amp;quot;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |TMs/sec/core&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
!&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;&lt;br /&gt;
!&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|42,391,877,333&lt;br /&gt;
|32,247,381,725&lt;br /&gt;
|23.93%&lt;br /&gt;
|788.0&lt;br /&gt;
|3,576.08&lt;br /&gt;
|14,943.74&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Reverse_Engineer_Filter.py&lt;br /&gt;
|rowspan=&amp;quot;8&amp;quot; style=&amp;quot;text-align:left&amp;quot; |[https://drive.google.com/drive/folders/1EsFw5DOjjZ6Xzjc8QgRa2YkInrsmFnLX?usp=drive_link Google Drive]&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|32,247,381,725&lt;br /&gt;
|12,789,441,316&lt;br /&gt;
|60.34%&lt;br /&gt;
|6,185.2&lt;br /&gt;
|873.85&lt;br /&gt;
|1,448.22&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=1&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|12,789,441,316&lt;br /&gt;
|4,332,283,583&lt;br /&gt;
|66.13%&lt;br /&gt;
|4,771.0&lt;br /&gt;
|492.39&lt;br /&gt;
|744.62&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=2&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|4,332,283,583&lt;br /&gt;
|2,796,143,404&lt;br /&gt;
|35.46%&lt;br /&gt;
|7,873.1&lt;br /&gt;
|54.20&lt;br /&gt;
|152.85&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=3&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|2,796,143,404&lt;br /&gt;
|1,398,734,288&lt;br /&gt;
|49.98%&lt;br /&gt;
|10,239.4&lt;br /&gt;
|37.91&lt;br /&gt;
|75.85&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Enumerate.py --max-loops=1_000 --block-size=2 --time=10 --lin-steps=0 --no-reverse-engineer --save-freq=10_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|1,398,734,288&lt;br /&gt;
|764,851,053&lt;br /&gt;
|45.32%&lt;br /&gt;
|3,203.1&lt;br /&gt;
|54.97&lt;br /&gt;
|121.30&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Enumerate.py --max-loops=10_000 --block-size=12 --no-steps --time=0.01 --lin-steps=0 --no-ctl --no-reverse-engineer --save-freq=10_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|764,851,053&lt;br /&gt;
|581,654,405&lt;br /&gt;
|23.95%&lt;br /&gt;
|1,925.3&lt;br /&gt;
|26.43&lt;br /&gt;
|110.35&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --min-block-size=4 --max-block-size=12 --max-steps=1_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|581,654,405&lt;br /&gt;
|434,787,751&lt;br /&gt;
|25.25%&lt;br /&gt;
|9,042.5&lt;br /&gt;
|4.51&lt;br /&gt;
|17.87&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --min-block-size=4 --max-block-size=6 --max-steps=10_000&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 2 ==&lt;br /&gt;
XnoobSpeakable and Lúkos are working on applying mxdys&#039; deciders/parameters to the remaining holdouts. The previous holdouts list by Terry Ligocki was split up into 8696 files containing 50,000 holdouts each* (*the last one actually has 37,751) and the deciders were applied to the files individually. These files can be called subtasks. Lúkos made a Python script to compute the subtasks in parallel, based off of XnoobSpeakable&#039;s earlier imperfect script.&lt;br /&gt;
&lt;br /&gt;
Certain data such as TMs/sec/core is unavailable, because the amount of time the computation took was not kept track of.&lt;br /&gt;
&lt;br /&gt;
Stages 3 and 8 are lr_enum_continue computations to 1 million and 10 million steps respectively. Lúkos did not contribute to computing these stages, but rather created a Python script to compute them in bulk, which XnoobSpeakable used.&lt;br /&gt;
&lt;br /&gt;
For the &amp;quot;Contribution&amp;quot; column, the first number is the amount of subtasks solved by XnoobSpeakable, the 2nd is the amount solved by Lúkos. Note that the counts are unequal, because Lúkos has a slower CPU with a lower core count. According to XnoobSpeakable, the time contribution from both contributors is roughly equal. Lúkos also worked on the Python scripts used, while XnoobSpeakable worked on compiling holdouts lists and finding optimal deciders to apply. &lt;br /&gt;
&lt;br /&gt;
[[User:Peacemaker II|Peacemaker II]] worked on verifying the validity of the results as well as providing solved TM counts per decider. Stages 1, 2, and 4 have been validated - no dropped TMs. XnoobSpeakable verified stage 6.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;nowiki&amp;gt;**&amp;lt;/nowiki&amp;gt;Stage 9: The two subtasks are seperate sub-stages, applying Reverse-Engineer and Backtracking deciders.&lt;br /&gt;
&lt;br /&gt;
Stage 10 is also seperated into substages A, B, and C for ease of computation.&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1MamU8zivuqoe4j82vpb-jYBfc4wvXNRc All scripts used are available here.] The details will be given in this table:&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: left&amp;quot;&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
! colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |% Reduced&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Subtasks&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Contribution&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Verified&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |XnoobSpeakable, Lúkos&lt;br /&gt;
|434,787,751&lt;br /&gt;
|64,777,377&lt;br /&gt;
|85.1%&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Phase 2 stage 1&lt;br /&gt;
|8696&lt;br /&gt;
|7696 / 1000&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|64,777,377&lt;br /&gt;
|37,016,957&lt;br /&gt;
|42.9%&lt;br /&gt;
|Phase 2 stage 2&lt;br /&gt;
|1296&lt;br /&gt;
|1000 / 296&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|37,016,957&lt;br /&gt;
|26,266,261&lt;br /&gt;
|29.0%&lt;br /&gt;
|Phase 2 stage 3&lt;br /&gt;
|741&lt;br /&gt;
|741 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|26,266,261&lt;br /&gt;
|22,396,711&lt;br /&gt;
|14.7%&lt;br /&gt;
|Phase 2 stage 4&lt;br /&gt;
|526&lt;br /&gt;
|485 / 41&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|22,396,711&lt;br /&gt;
|17,983,810&lt;br /&gt;
|19.7%&lt;br /&gt;
|Phase 2 stage 5&lt;br /&gt;
|448&lt;br /&gt;
|390 / 58&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|17,983,810&lt;br /&gt;
|15,564,491&lt;br /&gt;
|13.5%&lt;br /&gt;
|Phase 2 stage 6&lt;br /&gt;
|360&lt;br /&gt;
|300 / 60&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|15,564,491&lt;br /&gt;
|15,136,283&lt;br /&gt;
|2.75%&lt;br /&gt;
|Phase 2 stage 7&lt;br /&gt;
|312&lt;br /&gt;
|260 / 52&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|15,136,283&lt;br /&gt;
|14,518,243&lt;br /&gt;
|4.08%&lt;br /&gt;
|Phase 2 stage 8&lt;br /&gt;
|303&lt;br /&gt;
|303 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|14,518,243&lt;br /&gt;
|14,413,460&lt;br /&gt;
|0.72%&lt;br /&gt;
|Phase 2 stage 9&lt;br /&gt;
|2**&lt;br /&gt;
|2 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|14,413,460&lt;br /&gt;
|13,733,388&lt;br /&gt;
|4.72%&lt;br /&gt;
|Phase 2 stage 10A&lt;br /&gt;
|289&lt;br /&gt;
|216 / 73&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|13,733,388&lt;br /&gt;
|13,334,244&lt;br /&gt;
|2.91%&lt;br /&gt;
|Phase 2 stage 10B&lt;br /&gt;
|275&lt;br /&gt;
|200 / 75&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 2 Data ==&lt;br /&gt;
Here we will list the deciders applied during the various stages of Phase 2. Each decider within a stage was not applied in a specific order. Some stages have a number of TMs solved by every decider at the end of each row, provided by Peacemaker II.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Details&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Phase 2 stage 1:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 1000 NG_n 2 run 86569103&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 1000 NG_n 1 run 26093656&lt;br /&gt;
chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 13972946&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 6 mod 3 n 2 run 7190617&lt;br /&gt;
chr_LRUH 10 chr_H 6 MitM_CTL NG maxT 1000 NG_n 2 run 90302784&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 1 n 4 run 4342619&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 12 H 0 tH 1 n 2 run 11764327&lt;br /&gt;
chr_LRUH 2 chr_H 2 MitM_CTL NG maxT 1000 NG_n 1 run 55465842&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 2 n 1 run 17805678&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 2 H 0 tH 0 n 1 run 12623067&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 3000 NG_n 2 run 2240499&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 4 H 1 tH 1 n 2 run 10223131&lt;br /&gt;
chr_LRUH 6 chr_H 4 MitM_CTL NG maxT 10000 NG_n 1 run 2901053&lt;br /&gt;
chr_LRUH 22 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 28515052&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 2:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 4 n 8 run 1030303&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 8 mod 2 n 2 run 1465523&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 10000 NG_n 4 run 5232902&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 1720994&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 8 mod 3 n 2 run 555883&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 3 H 1 tH 0 n 6 run 290547&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 1 run 67506&lt;br /&gt;
chr_LRUH 10 chr_H 8 MitM_CTL NG maxT 10000 NG_n 2 run 1577979&lt;br /&gt;
chr_LRUH 6 chr_H 6 MitM_CTL NG maxT 3000 NG_n 2 run 1604533&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 4 n 6 run 10012948&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 8 H 0 tH 0 n 4 run 526822&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 1 n 1 run 34821&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 6 H 0 tH 1 n 3 run 356375&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 20 run 1970422&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 6 mod 3 n 1 run 443339&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 3 H 0 tH 1 n 2 run 518824&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 2 mod 2 n 1 run 61865&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 1 tH 1 n 2 run 288834&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 3 (lr_enum_continue from [https://github.com/sligocki/busy-beaver busy-beaver] for 1 million steps):&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
lr_enum_continue ./in.txt 1000000 ./halt.txt ./inf.txt ./unknown.txt &amp;quot;&amp;quot; false&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 4:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 3000 NG_n 2 run 202520&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 3000 NG_n 1 run 559013&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 4 n 1 run 1584&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 10000 NG_n 1 run 148544&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 1 run 812666&lt;br /&gt;
chr_asth 0 chr_LRUH 48 chr_H 48 MitM_CTL NG maxT 10000 NG_n 3 run 2043171&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 4 mod 2 n 1 run 102052&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 5:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 0 tH 1 n 10 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 16 H 1 tH 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 6 n 2 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 10000 NG_n 3 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 5 n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 3 H 1 tH 0 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 3 mod 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 2 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 5 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 4 mod 4 n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 0 tH 1 n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 6 mod 3 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 2 MitM_CTL NG maxT 30000 NG_n 3 run&lt;br /&gt;
chr_LRUH 16 chr_H 12 MitM_CTL NG maxT 30000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 8 H 2 tH 1 n 2 run&lt;br /&gt;
chr_asth 0 chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 10000 NG_n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 16 H 1 tH 0 n 6 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 16 H 0 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 6 chr_H 2 MitM_CTL NG maxT 10000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 3 H 1 tH 0 n 2 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 2 mod 3 n 1 run&lt;br /&gt;
chr_LRUH 3 chr_H 1 MitM_CTL NG maxT 100000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 1 tH 0 n 4 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 2 mod 2 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 4 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 4 H 2 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 0 MitM_CTL NG maxT 1000 NG_n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 2 mod 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 3 mod 6 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 8 chr_H 8 MitM_CTL NG maxT 10000 NG_n 2 run&lt;br /&gt;
chr_asth 0 chr_LRUH 60 chr_H 60 MitM_CTL NG maxT 30000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 3 mod 2 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 4 H 1 tH 1 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 3 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 3000 NG_n 2 run&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 6:&lt;br /&gt;
&lt;br /&gt;
XnoobSpeakable ran Enumerate.py with a 0.15s/TM time limit, Lúkos ran it with a 0.75s/TM time limit.&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
python &amp;quot;+str(pl.Path(&amp;quot;../../Code/Enumerate.py&amp;quot;))+&amp;quot; --infile=&amp;quot;+str(pl.Path(&amp;quot;./in.txt&amp;quot;))+&amp;quot; --outfile=&amp;quot;+str(pl.Path(&amp;quot;./out.pb&amp;quot;))+&amp;quot; --max-loops=990_000 --tape-limit=9_900 --no-steps --time=&amp;quot;+str(time)+&amp;quot; --recursive --exp-linear-rules  --lin-steps=0 --no-ctl --save-freq=10_000&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 7:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 1000 NG_n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 12 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 1 mod 5 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 1000 NG_n 1 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 30000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 4 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 16 H 0 tH 1 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 3000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 4 H 0 tH 1 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 0 tH 2 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 12 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 1 mod 2 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 2 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 2 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 1 mod 3 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 1 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 2 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 6 H 0 tH 0 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 1000 NG_n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 100000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 1 mod 1 n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 2 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 30000 NG_n 1 run&lt;br /&gt;
&amp;lt;/pre&amp;gt;Phase 2 stage 8 (lr_enum_continue from [https://github.com/sligocki/busy-beaver busy-beaver] for 10 million steps):&amp;lt;pre&amp;gt;lr_enum_continue ./in.txt 10000000 ./halt.txt ./inf.txt ./unknown.txt &amp;quot;&amp;quot; false&amp;lt;/pre&amp;gt;Phase 2 stage 9a:&amp;lt;pre&amp;gt;python3 Code/Reverse_Engineer_Filter.py --infile=&#039;/home/xnoobspeakable/Desktop/Busy Beavers/BB(3,4)/resultsst8/3x4_holdouts_14518243.txt&#039; --outfile=&#039;out.txt&#039;&amp;lt;/pre&amp;gt;Phase 2 stage 9b:&amp;lt;pre&amp;gt;python3 ./Code/Backtracking_Filter.py --infile=&#039;/home/xnoobspeakable/Desktop/Busy Beavers/BB(3,4)/resultsst9/unknown.txt&#039;  --outfile=&#039;./b1.pb&#039; --steps=100&amp;lt;/pre&amp;gt;Phase 2 stage 10a:&amp;lt;pre&amp;gt;chr_LRUH 28 chr_LRUn 2 MitM_CTL NG maxT 30000 NG_n 8 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 6 H 1 tH 2 n 8 run&amp;lt;/pre&amp;gt;Phase 2 stage 10b:&amp;lt;pre&amp;gt;MitM_CTL CPS_LRU sim 1,001 maxT 10000 LRUH 2 H 0 tH 0 n 20 run&lt;br /&gt;
chr_LRUH 8 chr_H 8 MitM_CTL NG maxT 100000 NG_n 4 run&amp;lt;/pre&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
[[Category:BB Domains]][[Category:BB(3,4)]]&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=BB(3,4)&amp;diff=5761</id>
		<title>BB(3,4)</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=BB(3,4)&amp;diff=5761"/>
		<updated>2025-12-24T18:13:07Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: /* Phase 2 Data */ test&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The Busy Beaver problem for 3 states and 4 symbols is unsolved, with the existence of [[Cryptids]] in the domain being given by the discovery of [[Bigfoot]] in [[BB(3,3)]]. The current BB(3,4) [[Champions#3-Symbol TMs|champion]] is {{TM|1RB3LB1RZ2RA_2LC3RB1LC2RA_3RB1LB3LC2RC|halt}}. It runs for &amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt; steps before halting. It was discovered by Pavel Kropitz in 2024 and was analysed by Shawn Ligocki in the same year.&lt;br /&gt;
&lt;br /&gt;
== Top Halters ==&lt;br /&gt;
The top 20 known longest running halting BB(3,4) TMs are:&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!Standard format&lt;br /&gt;
!(approximate) runtime&lt;br /&gt;
!Discoverer&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LB1RZ2RA_2LC3RB1LC2RA_3RB1LB3LC2RC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ1LA2RB_1RC3RC1LA2LB_2LB2RC1LC3RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{12} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3RB1LC2LA_2LA2RB1LB3RA_3LA1RZ1LC2RA}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{6} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3RB1LC2LA_2LA2RB1LB3RA_1RA1RZ1LC2RA}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{6} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LB1RZ3LA_0LC3RB3RC1LB_2RB2LA3RA1LC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {2\,048}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ1LA2RB_2RC3RC3LB2RA_2LB3RB3LC1LA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {189.05690}&amp;lt;/math&amp;gt;&lt;br /&gt;
|[[User:XnoobSpeakable|XnoobSpeakable]] &lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LA1RA2LB_2LC1RA2RC3RB_1RZ1LA2RA3RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {188.16168}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LB2LA3LC_1LA2RB3RA1LB_1RZ1RB2LB3LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {188.16168}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA3LA3RB_2LC2RC1LB2RA_2RA2RB0LB1RZ|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {149.57147}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LB1RZ3LA_1LA3RC2LC1LC_2LA3RC0RA1LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LB1RZ3LA_1LA3RC3LB1LC_2RA3RC0RA1LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LC1RC2RA_1LA3RA2RB1RZ_3LB2LC1RA0LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|[[User:WarpedWartWars|Lúkos]]&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA1LB3RA_1RC3LB1LC1RC_2LA2RA1RZ0LA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {96.06390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA1LB3RA_1RC3LB1LC1RC_2LA2RA1RZ1RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {96.06390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LC0RA1RC_2LA1RZ3LA2RB_3LA0RA1LA0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {95.24590}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LC0RA1RC_2LA1RZ3LA2RB_3LA0RA3LB0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {95.24590}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LA1RA1RC_1LA3LC3RB1RC_3LA1RZ3LB2RC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {84.19957}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LB1RA2LB_2RC3LB3RB2LA_2LC1RZ1LA2RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {76.17604}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LA1RZ0LB_2LC2LB1RC1RB_3LA3LC0LC0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {74.18390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2RA1LA1LB_2RC3RB1RZ3LC_2LA1RC1RB0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {69.55341}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Lúkos&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 1 ==&lt;br /&gt;
The initial phase of enumeration and reduction of [[holdouts]] took place in December 2024 and was done by Terry Ligocki using the Ligockis&#039; C++ and Python codes. The initial enumerations generated 600,253,156,787 TMs of which 42,391,877,333 were holdout TMs. Also found were 202,014,400,019 halting TMs and 355,846,879,435 infinite TMs. The number of holdouts was reduced to 434,787,751 TMs (a 98.97% reduction).&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Phase 1 Info&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Two C++ programs were run before the filters in the table.&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
lr_enum 3 4 8 /dev/null /dev/null 3x4.unk.txt false&lt;br /&gt;
00 &amp;lt;= XX &amp;lt; 47: lr_enum_continue 3x4.in.XX 1000 /dev/null /dev/null 3x4.unk.txt.XX XX false&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Both do the initial enumeration and simple filtering. The &amp;quot;/dev/null&amp;quot; in both commands would be files where the halting and infinite TMs would be stored. The first command generates the TMs from a TNF tree for BB(3,4) of depth 8 and outputs the holdouts to 3x4.unk.txt. This file was then divided into 48 pieces, 3x4.in.XX, 0 &amp;lt;= XX &amp;lt; 47. The second commands (one for each XX) continues the enumeration by running each TM for 1,000 steps. It classifies each as halting, infinite, or unknown/holdout. Again, the halting and infinite TMs are &amp;quot;written&amp;quot; to /dev/null, i.e., they aren&#039;t saved. The holdouts are stored in 48 files: 3x4.unk.txt.XX.&lt;br /&gt;
&lt;br /&gt;
For these runs the first command generated a total of 22,366,747 TMs: 932,198 halting, 235,446 infinite, and 21,199,103 holdouts. The second took the 22,366,747 holdout TMs and generated a total of 600,253,156,787 TMs: 202,014,400,019 halting, 355,846,879,435 infinite, and 42,391,877,333 holdouts. These holdouts were used as a starting point of the filters below.&lt;br /&gt;
&lt;br /&gt;
The &amp;quot;Description&amp;quot; column in the table below contain the command run. Two options are not given, &amp;quot;--infile=...&amp;quot; and an &amp;quot;--outfile=...&amp;quot;. These are necessary and specify where to read and write the results, respectively. Note: The work flow was to divide the input holdouts into 48 pieces, run the command on each piece simultaneously on one of 48 cores, and then combine the 48 results into a group of holdouts.&lt;br /&gt;
&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The details are given in this table:&lt;br /&gt;
&lt;br /&gt;
(done to reduce column size:&lt;br /&gt;
&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;= % Reduced,&lt;br /&gt;
&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;= Runtime (hours),&lt;br /&gt;
&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;= Decided,&lt;br /&gt;
&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;= Processed)&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: right&amp;quot;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |TMs/sec/core&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
!&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;&lt;br /&gt;
!&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|42,391,877,333&lt;br /&gt;
|32,247,381,725&lt;br /&gt;
|23.93%&lt;br /&gt;
|788.0&lt;br /&gt;
|3,576.08&lt;br /&gt;
|14,943.74&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Reverse_Engineer_Filter.py&lt;br /&gt;
|rowspan=&amp;quot;8&amp;quot; style=&amp;quot;text-align:left&amp;quot; |[https://drive.google.com/drive/folders/1EsFw5DOjjZ6Xzjc8QgRa2YkInrsmFnLX?usp=drive_link Google Drive]&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|32,247,381,725&lt;br /&gt;
|12,789,441,316&lt;br /&gt;
|60.34%&lt;br /&gt;
|6,185.2&lt;br /&gt;
|873.85&lt;br /&gt;
|1,448.22&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=1&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|12,789,441,316&lt;br /&gt;
|4,332,283,583&lt;br /&gt;
|66.13%&lt;br /&gt;
|4,771.0&lt;br /&gt;
|492.39&lt;br /&gt;
|744.62&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=2&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|4,332,283,583&lt;br /&gt;
|2,796,143,404&lt;br /&gt;
|35.46%&lt;br /&gt;
|7,873.1&lt;br /&gt;
|54.20&lt;br /&gt;
|152.85&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=3&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|2,796,143,404&lt;br /&gt;
|1,398,734,288&lt;br /&gt;
|49.98%&lt;br /&gt;
|10,239.4&lt;br /&gt;
|37.91&lt;br /&gt;
|75.85&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Enumerate.py --max-loops=1_000 --block-size=2 --time=10 --lin-steps=0 --no-reverse-engineer --save-freq=10_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|1,398,734,288&lt;br /&gt;
|764,851,053&lt;br /&gt;
|45.32%&lt;br /&gt;
|3,203.1&lt;br /&gt;
|54.97&lt;br /&gt;
|121.30&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Enumerate.py --max-loops=10_000 --block-size=12 --no-steps --time=0.01 --lin-steps=0 --no-ctl --no-reverse-engineer --save-freq=10_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|764,851,053&lt;br /&gt;
|581,654,405&lt;br /&gt;
|23.95%&lt;br /&gt;
|1,925.3&lt;br /&gt;
|26.43&lt;br /&gt;
|110.35&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --min-block-size=4 --max-block-size=12 --max-steps=1_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|581,654,405&lt;br /&gt;
|434,787,751&lt;br /&gt;
|25.25%&lt;br /&gt;
|9,042.5&lt;br /&gt;
|4.51&lt;br /&gt;
|17.87&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --min-block-size=4 --max-block-size=6 --max-steps=10_000&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 2 ==&lt;br /&gt;
XnoobSpeakable and Lúkos are working on applying mxdys&#039; deciders/parameters to the remaining holdouts. The previous holdouts list by Terry Ligocki was split up into 8696 files containing 50,000 holdouts each* (*the last one actually has 37,751) and the deciders were applied to the files individually. These files can be called subtasks. Lúkos made a Python script to compute the subtasks in parallel, based off of XnoobSpeakable&#039;s earlier imperfect script.&lt;br /&gt;
&lt;br /&gt;
Certain data such as TMs/sec/core is unavailable, because the amount of time the computation took was not kept track of.&lt;br /&gt;
&lt;br /&gt;
Stages 3 and 8 are lr_enum_continue computations to 1 million and 10 million steps respectively. Lúkos did not contribute to computing these stages, but rather created a Python script to compute them in bulk, which XnoobSpeakable used.&lt;br /&gt;
&lt;br /&gt;
For the &amp;quot;Contribution&amp;quot; column, the first number is the amount of subtasks solved by XnoobSpeakable, the 2nd is the amount solved by Lúkos. Note that the counts are unequal, because Lúkos has a slower CPU with a lower core count. According to XnoobSpeakable, the time contribution from both contributors is roughly equal. Lúkos also worked on the Python scripts used, while XnoobSpeakable worked on compiling holdouts lists and finding optimal deciders to apply. &lt;br /&gt;
&lt;br /&gt;
[[User:Peacemaker II|Peacemaker II]] worked on verifying the validity of the results as well as providing solved TM counts per decider. Stages 1, 2, and 4 have been validated - no dropped TMs. XnoobSpeakable verified stage 6.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;nowiki&amp;gt;**&amp;lt;/nowiki&amp;gt;Stage 9: The two subtasks are seperate sub-stages, applying Reverse-Engineer and Backtracking deciders.&lt;br /&gt;
&lt;br /&gt;
Stage 10 is also seperated into substages A, B, and C for ease of computation.&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1MamU8zivuqoe4j82vpb-jYBfc4wvXNRc All scripts used are available here.] The details will be given in this table:&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: left&amp;quot;&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
! colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |% Reduced&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Subtasks&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Contribution&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Verified&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |XnoobSpeakable, Lúkos&lt;br /&gt;
|434,787,751&lt;br /&gt;
|64,777,377&lt;br /&gt;
|85.1%&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Phase 2 stage 1&lt;br /&gt;
|8696&lt;br /&gt;
|7696 / 1000&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|64,777,377&lt;br /&gt;
|37,016,957&lt;br /&gt;
|42.9%&lt;br /&gt;
|Phase 2 stage 2&lt;br /&gt;
|1296&lt;br /&gt;
|1000 / 296&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|37,016,957&lt;br /&gt;
|26,266,261&lt;br /&gt;
|29.0%&lt;br /&gt;
|Phase 2 stage 3&lt;br /&gt;
|741&lt;br /&gt;
|741 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|26,266,261&lt;br /&gt;
|22,396,711&lt;br /&gt;
|14.7%&lt;br /&gt;
|Phase 2 stage 4&lt;br /&gt;
|526&lt;br /&gt;
|485 / 41&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|22,396,711&lt;br /&gt;
|17,983,810&lt;br /&gt;
|19.7%&lt;br /&gt;
|Phase 2 stage 5&lt;br /&gt;
|448&lt;br /&gt;
|390 / 58&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|17,983,810&lt;br /&gt;
|15,564,491&lt;br /&gt;
|13.5%&lt;br /&gt;
|Phase 2 stage 6&lt;br /&gt;
|360&lt;br /&gt;
|300 / 60&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|15,564,491&lt;br /&gt;
|15,136,283&lt;br /&gt;
|2.75%&lt;br /&gt;
|Phase 2 stage 7&lt;br /&gt;
|312&lt;br /&gt;
|260 / 52&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|15,136,283&lt;br /&gt;
|14,518,243&lt;br /&gt;
|4.08%&lt;br /&gt;
|Phase 2 stage 8&lt;br /&gt;
|303&lt;br /&gt;
|303 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|14,518,243&lt;br /&gt;
|14,413,460&lt;br /&gt;
|0.72%&lt;br /&gt;
|Phase 2 stage 9&lt;br /&gt;
|2**&lt;br /&gt;
|2 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|14,413,460&lt;br /&gt;
|13,733,388&lt;br /&gt;
|4.72%&lt;br /&gt;
|Phase 2 stage 10A&lt;br /&gt;
|289&lt;br /&gt;
|216 / 73&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|13,733,388&lt;br /&gt;
|13,334,244&lt;br /&gt;
|2.91%&lt;br /&gt;
|Phase 2 stage 10B&lt;br /&gt;
|275&lt;br /&gt;
|200 / 75&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 2 Data ==&lt;br /&gt;
Here we will list the deciders applied during the various stages of Phase 2. Each decider within a stage was not applied in a specific order. Some stages have a number of TMs solved by every decider at the end of each row, provided by Peacemaker II.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Details&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Phase 2 stage 1:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 1000 NG_n 2 run 86569103&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 1000 NG_n 1 run 26093656&lt;br /&gt;
chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 13972946&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 6 mod 3 n 2 run 7190617&lt;br /&gt;
chr_LRUH 10 chr_H 6 MitM_CTL NG maxT 1000 NG_n 2 run 90302784&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 1 n 4 run 4342619&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 12 H 0 tH 1 n 2 run 11764327&lt;br /&gt;
chr_LRUH 2 chr_H 2 MitM_CTL NG maxT 1000 NG_n 1 run 55465842&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 2 n 1 run 17805678&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 2 H 0 tH 0 n 1 run 12623067&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 3000 NG_n 2 run 2240499&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 4 H 1 tH 1 n 2 run 10223131&lt;br /&gt;
chr_LRUH 6 chr_H 4 MitM_CTL NG maxT 10000 NG_n 1 run 2901053&lt;br /&gt;
chr_LRUH 22 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 28515052&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 2:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 4 n 8 run 1030303&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 8 mod 2 n 2 run 1465523&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 10000 NG_n 4 run 5232902&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 1720994&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 8 mod 3 n 2 run 555883&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 3 H 1 tH 0 n 6 run 290547&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 1 run 67506&lt;br /&gt;
chr_LRUH 10 chr_H 8 MitM_CTL NG maxT 10000 NG_n 2 run 1577979&lt;br /&gt;
chr_LRUH 6 chr_H 6 MitM_CTL NG maxT 3000 NG_n 2 run 1604533&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 4 n 6 run 10012948&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 8 H 0 tH 0 n 4 run 526822&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 1 n 1 run 34821&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 6 H 0 tH 1 n 3 run 356375&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 20 run 1970422&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 6 mod 3 n 1 run 443339&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 3 H 0 tH 1 n 2 run 518824&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 2 mod 2 n 1 run 61865&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 1 tH 1 n 2 run 288834&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 3 (lr_enum_continue from [https://github.com/sligocki/busy-beaver busy-beaver] for 1 million steps):&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
lr_enum_continue ./in.txt 1000000 ./halt.txt ./inf.txt ./unknown.txt &amp;quot;&amp;quot; false&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 4:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 3000 NG_n 2 run 202520&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 3000 NG_n 1 run 559013&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 4 n 1 run 1584&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 10000 NG_n 1 run 148544&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 1 run 812666&lt;br /&gt;
chr_asth 0 chr_LRUH 48 chr_H 48 MitM_CTL NG maxT 10000 NG_n 3 run 2043171&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 4 mod 2 n 1 run 102052&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 5:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 0 tH 1 n 10 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 16 H 1 tH 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 6 n 2 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 10000 NG_n 3 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 5 n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 3 H 1 tH 0 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 3 mod 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 2 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 5 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 4 mod 4 n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 0 tH 1 n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 6 mod 3 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 2 MitM_CTL NG maxT 30000 NG_n 3 run&lt;br /&gt;
chr_LRUH 16 chr_H 12 MitM_CTL NG maxT 30000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 8 H 2 tH 1 n 2 run&lt;br /&gt;
chr_asth 0 chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 10000 NG_n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 16 H 1 tH 0 n 6 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 16 H 0 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 6 chr_H 2 MitM_CTL NG maxT 10000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 3 H 1 tH 0 n 2 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 2 mod 3 n 1 run&lt;br /&gt;
chr_LRUH 3 chr_H 1 MitM_CTL NG maxT 100000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 1 tH 0 n 4 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 2 mod 2 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 4 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 4 H 2 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 0 MitM_CTL NG maxT 1000 NG_n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 2 mod 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 3 mod 6 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 8 chr_H 8 MitM_CTL NG maxT 10000 NG_n 2 run&lt;br /&gt;
chr_asth 0 chr_LRUH 60 chr_H 60 MitM_CTL NG maxT 30000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 3 mod 2 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 4 H 1 tH 1 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 3 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 3000 NG_n 2 run&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 6:&lt;br /&gt;
&lt;br /&gt;
XnoobSpeakable ran Enumerate.py with a 0.15s/TM time limit, Lúkos ran it with a 0.75s/TM time limit.&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
python &amp;quot;+str(pl.Path(&amp;quot;../../Code/Enumerate.py&amp;quot;))+&amp;quot; --infile=&amp;quot;+str(pl.Path(&amp;quot;./in.txt&amp;quot;))+&amp;quot; --outfile=&amp;quot;+str(pl.Path(&amp;quot;./out.pb&amp;quot;))+&amp;quot; --max-loops=990_000 --tape-limit=9_900 --no-steps --time=&amp;quot;+str(time)+&amp;quot; --recursive --exp-linear-rules  --lin-steps=0 --no-ctl --save-freq=10_000&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 7:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 1000 NG_n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 12 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 1 mod 5 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 1000 NG_n 1 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 30000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 4 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 16 H 0 tH 1 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 3000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 4 H 0 tH 1 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 0 tH 2 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 12 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 1 mod 2 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 2 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 2 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 1 mod 3 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 1 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 2 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 6 H 0 tH 0 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 1000 NG_n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 100000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 1 mod 1 n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 2 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 30000 NG_n 1 run&lt;br /&gt;
&amp;lt;/pre&amp;gt;Phase 2 stage 8 (lr_enum_continue from [https://github.com/sligocki/busy-beaver busy-beaver] for 10 million steps):&amp;lt;pre&amp;gt;lr_enum_continue ./in.txt 10000000 ./halt.txt ./inf.txt ./unknown.txt &amp;quot;&amp;quot; false&amp;lt;/pre&amp;gt;Phase 2 stage 9a:&amp;lt;pre&amp;gt;python3 Code/Reverse_Engineer_Filter.py --infile=&#039;/home/xnoobspeakable/Desktop/Busy Beavers/BB(3,4)/resultsst8/3x4_holdouts_14518243.txt&#039; --outfile=&#039;out.txt&#039;&amp;lt;/pre&amp;gt;Phase 2 stage 9b:&amp;lt;pre&amp;gt;python3 ./Code/Backtracking_Filter.py --infile=&#039;/home/xnoobspeakable/Desktop/Busy Beavers/BB(3,4)/resultsst9/unknown.txt&#039;  --outfile=&#039;./b1.pb&#039; --steps=100&amp;lt;/pre&amp;gt;Phase 2 stage 10a:&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 28 chr_LRUn 2 MitM_CTL NG maxT 30000 NG_n 8 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 6 H 1 tH 2 n 8 run&lt;br /&gt;
&amp;lt;/pre&amp;gt;Phase 2 stage 10b:&amp;lt;pre&amp;gt;MitM_CTL CPS_LRU sim 1,001 maxT 10000 LRUH 2 H 0 tH 0 n 20 run&lt;br /&gt;
chr_LRUH 8 chr_H 8 MitM_CTL NG maxT 100000 NG_n 4 run&amp;lt;/pre&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
[[Category:BB Domains]][[Category:BB(3,4)]]&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=BB(3,4)&amp;diff=5759</id>
		<title>BB(3,4)</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=BB(3,4)&amp;diff=5759"/>
		<updated>2025-12-24T17:54:25Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: /* Phase 2 */ fix 10b&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The Busy Beaver problem for 3 states and 4 symbols is unsolved, with the existence of [[Cryptids]] in the domain being given by the discovery of [[Bigfoot]] in [[BB(3,3)]]. The current BB(3,4) [[Champions#3-Symbol TMs|champion]] is {{TM|1RB3LB1RZ2RA_2LC3RB1LC2RA_3RB1LB3LC2RC|halt}}. It runs for &amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt; steps before halting. It was discovered by Pavel Kropitz in 2024 and was analysed by Shawn Ligocki in the same year.&lt;br /&gt;
&lt;br /&gt;
== Top Halters ==&lt;br /&gt;
The top 20 known longest running halting BB(3,4) TMs are:&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!Standard format&lt;br /&gt;
!(approximate) runtime&lt;br /&gt;
!Discoverer&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LB1RZ2RA_2LC3RB1LC2RA_3RB1LB3LC2RC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ1LA2RB_1RC3RC1LA2LB_2LB2RC1LC3RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{12} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3RB1LC2LA_2LA2RB1LB3RA_3LA1RZ1LC2RA}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{6} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3RB1LC2LA_2LA2RB1LB3RA_1RA1RZ1LC2RA}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{6} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LB1RZ3LA_0LC3RB3RC1LB_2RB2LA3RA1LC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {2\,048}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ1LA2RB_2RC3RC3LB2RA_2LB3RB3LC1LA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {189.05690}&amp;lt;/math&amp;gt;&lt;br /&gt;
|[[User:XnoobSpeakable|XnoobSpeakable]] &lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LA1RA2LB_2LC1RA2RC3RB_1RZ1LA2RA3RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {188.16168}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LB2LA3LC_1LA2RB3RA1LB_1RZ1RB2LB3LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {188.16168}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA3LA3RB_2LC2RC1LB2RA_2RA2RB0LB1RZ|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {149.57147}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LB1RZ3LA_1LA3RC2LC1LC_2LA3RC0RA1LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LB1RZ3LA_1LA3RC3LB1LC_2RA3RC0RA1LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LC1RC2RA_1LA3RA2RB1RZ_3LB2LC1RA0LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|[[User:WarpedWartWars|Lúkos]]&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA1LB3RA_1RC3LB1LC1RC_2LA2RA1RZ0LA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {96.06390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA1LB3RA_1RC3LB1LC1RC_2LA2RA1RZ1RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {96.06390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LC0RA1RC_2LA1RZ3LA2RB_3LA0RA1LA0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {95.24590}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LC0RA1RC_2LA1RZ3LA2RB_3LA0RA3LB0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {95.24590}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LA1RA1RC_1LA3LC3RB1RC_3LA1RZ3LB2RC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {84.19957}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LB1RA2LB_2RC3LB3RB2LA_2LC1RZ1LA2RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {76.17604}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LA1RZ0LB_2LC2LB1RC1RB_3LA3LC0LC0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {74.18390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2RA1LA1LB_2RC3RB1RZ3LC_2LA1RC1RB0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {69.55341}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Lúkos&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 1 ==&lt;br /&gt;
The initial phase of enumeration and reduction of [[holdouts]] took place in December 2024 and was done by Terry Ligocki using the Ligockis&#039; C++ and Python codes. The initial enumerations generated 600,253,156,787 TMs of which 42,391,877,333 were holdout TMs. Also found were 202,014,400,019 halting TMs and 355,846,879,435 infinite TMs. The number of holdouts was reduced to 434,787,751 TMs (a 98.97% reduction).&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Phase 1 Info&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Two C++ programs were run before the filters in the table.&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
lr_enum 3 4 8 /dev/null /dev/null 3x4.unk.txt false&lt;br /&gt;
00 &amp;lt;= XX &amp;lt; 47: lr_enum_continue 3x4.in.XX 1000 /dev/null /dev/null 3x4.unk.txt.XX XX false&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Both do the initial enumeration and simple filtering. The &amp;quot;/dev/null&amp;quot; in both commands would be files where the halting and infinite TMs would be stored. The first command generates the TMs from a TNF tree for BB(3,4) of depth 8 and outputs the holdouts to 3x4.unk.txt. This file was then divided into 48 pieces, 3x4.in.XX, 0 &amp;lt;= XX &amp;lt; 47. The second commands (one for each XX) continues the enumeration by running each TM for 1,000 steps. It classifies each as halting, infinite, or unknown/holdout. Again, the halting and infinite TMs are &amp;quot;written&amp;quot; to /dev/null, i.e., they aren&#039;t saved. The holdouts are stored in 48 files: 3x4.unk.txt.XX.&lt;br /&gt;
&lt;br /&gt;
For these runs the first command generated a total of 22,366,747 TMs: 932,198 halting, 235,446 infinite, and 21,199,103 holdouts. The second took the 22,366,747 holdout TMs and generated a total of 600,253,156,787 TMs: 202,014,400,019 halting, 355,846,879,435 infinite, and 42,391,877,333 holdouts. These holdouts were used as a starting point of the filters below.&lt;br /&gt;
&lt;br /&gt;
The &amp;quot;Description&amp;quot; column in the table below contain the command run. Two options are not given, &amp;quot;--infile=...&amp;quot; and an &amp;quot;--outfile=...&amp;quot;. These are necessary and specify where to read and write the results, respectively. Note: The work flow was to divide the input holdouts into 48 pieces, run the command on each piece simultaneously on one of 48 cores, and then combine the 48 results into a group of holdouts.&lt;br /&gt;
&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The details are given in this table:&lt;br /&gt;
&lt;br /&gt;
(done to reduce column size:&lt;br /&gt;
&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;= % Reduced,&lt;br /&gt;
&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;= Runtime (hours),&lt;br /&gt;
&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;= Decided,&lt;br /&gt;
&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;= Processed)&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: right&amp;quot;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |TMs/sec/core&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
!&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;&lt;br /&gt;
!&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|42,391,877,333&lt;br /&gt;
|32,247,381,725&lt;br /&gt;
|23.93%&lt;br /&gt;
|788.0&lt;br /&gt;
|3,576.08&lt;br /&gt;
|14,943.74&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Reverse_Engineer_Filter.py&lt;br /&gt;
|rowspan=&amp;quot;8&amp;quot; style=&amp;quot;text-align:left&amp;quot; |[https://drive.google.com/drive/folders/1EsFw5DOjjZ6Xzjc8QgRa2YkInrsmFnLX?usp=drive_link Google Drive]&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|32,247,381,725&lt;br /&gt;
|12,789,441,316&lt;br /&gt;
|60.34%&lt;br /&gt;
|6,185.2&lt;br /&gt;
|873.85&lt;br /&gt;
|1,448.22&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=1&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|12,789,441,316&lt;br /&gt;
|4,332,283,583&lt;br /&gt;
|66.13%&lt;br /&gt;
|4,771.0&lt;br /&gt;
|492.39&lt;br /&gt;
|744.62&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=2&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|4,332,283,583&lt;br /&gt;
|2,796,143,404&lt;br /&gt;
|35.46%&lt;br /&gt;
|7,873.1&lt;br /&gt;
|54.20&lt;br /&gt;
|152.85&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=3&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|2,796,143,404&lt;br /&gt;
|1,398,734,288&lt;br /&gt;
|49.98%&lt;br /&gt;
|10,239.4&lt;br /&gt;
|37.91&lt;br /&gt;
|75.85&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Enumerate.py --max-loops=1_000 --block-size=2 --time=10 --lin-steps=0 --no-reverse-engineer --save-freq=10_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|1,398,734,288&lt;br /&gt;
|764,851,053&lt;br /&gt;
|45.32%&lt;br /&gt;
|3,203.1&lt;br /&gt;
|54.97&lt;br /&gt;
|121.30&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Enumerate.py --max-loops=10_000 --block-size=12 --no-steps --time=0.01 --lin-steps=0 --no-ctl --no-reverse-engineer --save-freq=10_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|764,851,053&lt;br /&gt;
|581,654,405&lt;br /&gt;
|23.95%&lt;br /&gt;
|1,925.3&lt;br /&gt;
|26.43&lt;br /&gt;
|110.35&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --min-block-size=4 --max-block-size=12 --max-steps=1_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|581,654,405&lt;br /&gt;
|434,787,751&lt;br /&gt;
|25.25%&lt;br /&gt;
|9,042.5&lt;br /&gt;
|4.51&lt;br /&gt;
|17.87&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --min-block-size=4 --max-block-size=6 --max-steps=10_000&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 2 ==&lt;br /&gt;
XnoobSpeakable and Lúkos are working on applying mxdys&#039; deciders/parameters to the remaining holdouts. The previous holdouts list by Terry Ligocki was split up into 8696 files containing 50,000 holdouts each* (*the last one actually has 37,751) and the deciders were applied to the files individually. These files can be called subtasks. Lúkos made a Python script to compute the subtasks in parallel, based off of XnoobSpeakable&#039;s earlier imperfect script.&lt;br /&gt;
&lt;br /&gt;
Certain data such as TMs/sec/core is unavailable, because the amount of time the computation took was not kept track of.&lt;br /&gt;
&lt;br /&gt;
Stages 3 and 8 are lr_enum_continue computations to 1 million and 10 million steps respectively. Lúkos did not contribute to computing these stages, but rather created a Python script to compute them in bulk, which XnoobSpeakable used.&lt;br /&gt;
&lt;br /&gt;
For the &amp;quot;Contribution&amp;quot; column, the first number is the amount of subtasks solved by XnoobSpeakable, the 2nd is the amount solved by Lúkos. Note that the counts are unequal, because Lúkos has a slower CPU with a lower core count. According to XnoobSpeakable, the time contribution from both contributors is roughly equal. Lúkos also worked on the Python scripts used, while XnoobSpeakable worked on compiling holdouts lists and finding optimal deciders to apply. &lt;br /&gt;
&lt;br /&gt;
[[User:Peacemaker II|Peacemaker II]] worked on verifying the validity of the results as well as providing solved TM counts per decider. Stages 1, 2, and 4 have been validated - no dropped TMs. XnoobSpeakable verified stage 6.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;nowiki&amp;gt;**&amp;lt;/nowiki&amp;gt;Stage 9: The two subtasks are seperate sub-stages, applying Reverse-Engineer and Backtracking deciders.&lt;br /&gt;
&lt;br /&gt;
Stage 10 is also seperated into substages A, B, and C for ease of computation.&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1MamU8zivuqoe4j82vpb-jYBfc4wvXNRc All scripts used are available here.] The details will be given in this table:&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: left&amp;quot;&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
! colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |% Reduced&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Subtasks&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Contribution&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Verified&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |XnoobSpeakable, Lúkos&lt;br /&gt;
|434,787,751&lt;br /&gt;
|64,777,377&lt;br /&gt;
|85.1%&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Phase 2 stage 1&lt;br /&gt;
|8696&lt;br /&gt;
|7696 / 1000&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|64,777,377&lt;br /&gt;
|37,016,957&lt;br /&gt;
|42.9%&lt;br /&gt;
|Phase 2 stage 2&lt;br /&gt;
|1296&lt;br /&gt;
|1000 / 296&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|37,016,957&lt;br /&gt;
|26,266,261&lt;br /&gt;
|29.0%&lt;br /&gt;
|Phase 2 stage 3&lt;br /&gt;
|741&lt;br /&gt;
|741 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|26,266,261&lt;br /&gt;
|22,396,711&lt;br /&gt;
|14.7%&lt;br /&gt;
|Phase 2 stage 4&lt;br /&gt;
|526&lt;br /&gt;
|485 / 41&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|22,396,711&lt;br /&gt;
|17,983,810&lt;br /&gt;
|19.7%&lt;br /&gt;
|Phase 2 stage 5&lt;br /&gt;
|448&lt;br /&gt;
|390 / 58&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|17,983,810&lt;br /&gt;
|15,564,491&lt;br /&gt;
|13.5%&lt;br /&gt;
|Phase 2 stage 6&lt;br /&gt;
|360&lt;br /&gt;
|300 / 60&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|15,564,491&lt;br /&gt;
|15,136,283&lt;br /&gt;
|2.75%&lt;br /&gt;
|Phase 2 stage 7&lt;br /&gt;
|312&lt;br /&gt;
|260 / 52&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|15,136,283&lt;br /&gt;
|14,518,243&lt;br /&gt;
|4.08%&lt;br /&gt;
|Phase 2 stage 8&lt;br /&gt;
|303&lt;br /&gt;
|303 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|14,518,243&lt;br /&gt;
|14,413,460&lt;br /&gt;
|0.72%&lt;br /&gt;
|Phase 2 stage 9&lt;br /&gt;
|2**&lt;br /&gt;
|2 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|14,413,460&lt;br /&gt;
|13,733,388&lt;br /&gt;
|4.72%&lt;br /&gt;
|Phase 2 stage 10A&lt;br /&gt;
|289&lt;br /&gt;
|216 / 73&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|13,733,388&lt;br /&gt;
|13,334,244&lt;br /&gt;
|2.91%&lt;br /&gt;
|Phase 2 stage 10B&lt;br /&gt;
|275&lt;br /&gt;
|200 / 75&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 2 Data ==&lt;br /&gt;
Here we will list the deciders applied during the various stages of Phase 2. Each decider within a stage was not applied in a specific order. Some stages have a number of TMs solved by every decider at the end of each row, provided by Peacemaker II.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Details&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Phase 2 stage 1:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 1000 NG_n 2 run 86569103&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 1000 NG_n 1 run 26093656&lt;br /&gt;
chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 13972946&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 6 mod 3 n 2 run 7190617&lt;br /&gt;
chr_LRUH 10 chr_H 6 MitM_CTL NG maxT 1000 NG_n 2 run 90302784&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 1 n 4 run 4342619&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 12 H 0 tH 1 n 2 run 11764327&lt;br /&gt;
chr_LRUH 2 chr_H 2 MitM_CTL NG maxT 1000 NG_n 1 run 55465842&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 2 n 1 run 17805678&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 2 H 0 tH 0 n 1 run 12623067&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 3000 NG_n 2 run 2240499&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 4 H 1 tH 1 n 2 run 10223131&lt;br /&gt;
chr_LRUH 6 chr_H 4 MitM_CTL NG maxT 10000 NG_n 1 run 2901053&lt;br /&gt;
chr_LRUH 22 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 28515052&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 2:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 4 n 8 run 1030303&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 8 mod 2 n 2 run 1465523&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 10000 NG_n 4 run 5232902&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 1720994&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 8 mod 3 n 2 run 555883&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 3 H 1 tH 0 n 6 run 290547&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 1 run 67506&lt;br /&gt;
chr_LRUH 10 chr_H 8 MitM_CTL NG maxT 10000 NG_n 2 run 1577979&lt;br /&gt;
chr_LRUH 6 chr_H 6 MitM_CTL NG maxT 3000 NG_n 2 run 1604533&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 4 n 6 run 10012948&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 8 H 0 tH 0 n 4 run 526822&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 1 n 1 run 34821&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 6 H 0 tH 1 n 3 run 356375&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 20 run 1970422&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 6 mod 3 n 1 run 443339&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 3 H 0 tH 1 n 2 run 518824&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 2 mod 2 n 1 run 61865&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 1 tH 1 n 2 run 288834&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 3 (lr_enum_continue from [https://github.com/sligocki/busy-beaver busy-beaver] for 1 million steps):&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
lr_enum_continue ./in.txt 1000000 ./halt.txt ./inf.txt ./unknown.txt &amp;quot;&amp;quot; false&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 4:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 3000 NG_n 2 run 202520&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 3000 NG_n 1 run 559013&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 4 n 1 run 1584&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 10000 NG_n 1 run 148544&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 1 run 812666&lt;br /&gt;
chr_asth 0 chr_LRUH 48 chr_H 48 MitM_CTL NG maxT 10000 NG_n 3 run 2043171&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 4 mod 2 n 1 run 102052&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 5:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 0 tH 1 n 10 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 16 H 1 tH 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 6 n 2 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 10000 NG_n 3 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 5 n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 3 H 1 tH 0 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 3 mod 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 2 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 5 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 4 mod 4 n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 0 tH 1 n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 6 mod 3 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 2 MitM_CTL NG maxT 30000 NG_n 3 run&lt;br /&gt;
chr_LRUH 16 chr_H 12 MitM_CTL NG maxT 30000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 8 H 2 tH 1 n 2 run&lt;br /&gt;
chr_asth 0 chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 10000 NG_n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 16 H 1 tH 0 n 6 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 16 H 0 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 6 chr_H 2 MitM_CTL NG maxT 10000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 3 H 1 tH 0 n 2 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 2 mod 3 n 1 run&lt;br /&gt;
chr_LRUH 3 chr_H 1 MitM_CTL NG maxT 100000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 1 tH 0 n 4 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 2 mod 2 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 4 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 4 H 2 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 0 MitM_CTL NG maxT 1000 NG_n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 2 mod 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 3 mod 6 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 8 chr_H 8 MitM_CTL NG maxT 10000 NG_n 2 run&lt;br /&gt;
chr_asth 0 chr_LRUH 60 chr_H 60 MitM_CTL NG maxT 30000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 3 mod 2 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 4 H 1 tH 1 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 3 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 3000 NG_n 2 run&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 6:&lt;br /&gt;
&lt;br /&gt;
XnoobSpeakable ran Enumerate.py with a 0.15s/TM time limit, Lúkos ran it with a 0.75s/TM time limit.&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
python &amp;quot;+str(pl.Path(&amp;quot;../../Code/Enumerate.py&amp;quot;))+&amp;quot; --infile=&amp;quot;+str(pl.Path(&amp;quot;./in.txt&amp;quot;))+&amp;quot; --outfile=&amp;quot;+str(pl.Path(&amp;quot;./out.pb&amp;quot;))+&amp;quot; --max-loops=990_000 --tape-limit=9_900 --no-steps --time=&amp;quot;+str(time)+&amp;quot; --recursive --exp-linear-rules  --lin-steps=0 --no-ctl --save-freq=10_000&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 7:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 1000 NG_n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 12 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 1 mod 5 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 1000 NG_n 1 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 30000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 4 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 16 H 0 tH 1 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 3000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 4 H 0 tH 1 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 0 tH 2 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 12 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 1 mod 2 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 2 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 2 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 1 mod 3 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 1 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 2 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 6 H 0 tH 0 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 1000 NG_n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 100000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 1 mod 1 n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 2 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 30000 NG_n 1 run&lt;br /&gt;
&amp;lt;/pre&amp;gt;Phase 2 stage 8 (lr_enum_continue from [https://github.com/sligocki/busy-beaver busy-beaver] for 10 million steps):&amp;lt;pre&amp;gt;lr_enum_continue ./in.txt 10000000 ./halt.txt ./inf.txt ./unknown.txt &amp;quot;&amp;quot; false&amp;lt;/pre&amp;gt;Phase 2 stage 9a:&amp;lt;pre&amp;gt;python3 Code/Reverse_Engineer_Filter.py --infile=&#039;/home/xnoobspeakable/Desktop/Busy Beavers/BB(3,4)/resultsst8/3x4_holdouts_14518243.txt&#039; --outfile=&#039;out.txt&#039;&amp;lt;/pre&amp;gt;Phase 2 stage 9b:&amp;lt;pre&amp;gt;python3 ./Code/Backtracking_Filter.py --infile=&#039;/home/xnoobspeakable/Desktop/Busy Beavers/BB(3,4)/resultsst9/unknown.txt&#039;  --outfile=&#039;./b1.pb&#039; --steps=100&amp;lt;/pre&amp;gt;Phase 2 stage 10a:&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 28 chr_LRUn 2 MitM_CTL NG maxT 30000 NG_n 8 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 6 H 1 tH 2 n 8 run&lt;br /&gt;
&amp;lt;/pre&amp;gt;Phase 2 stage 10b:&amp;lt;pre&amp;gt;&lt;br /&gt;
MitM_CTL CPS_LRU sim 1,001 maxT 10000 LRUH 2 H 0 tH 0 n 20 run&lt;br /&gt;
chr_LRUH 8 chr_H 8 MitM_CTL NG maxT 100000 NG_n 4 run&lt;br /&gt;
&amp;lt;/pre&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
[[Category:BB Domains]][[Category:BB(3,4)]]&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=BB(3,4)&amp;diff=5758</id>
		<title>BB(3,4)</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=BB(3,4)&amp;diff=5758"/>
		<updated>2025-12-24T17:53:57Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: /* Phase 2 */ stage 10b + fixes in 10a data&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The Busy Beaver problem for 3 states and 4 symbols is unsolved, with the existence of [[Cryptids]] in the domain being given by the discovery of [[Bigfoot]] in [[BB(3,3)]]. The current BB(3,4) [[Champions#3-Symbol TMs|champion]] is {{TM|1RB3LB1RZ2RA_2LC3RB1LC2RA_3RB1LB3LC2RC|halt}}. It runs for &amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt; steps before halting. It was discovered by Pavel Kropitz in 2024 and was analysed by Shawn Ligocki in the same year.&lt;br /&gt;
&lt;br /&gt;
== Top Halters ==&lt;br /&gt;
The top 20 known longest running halting BB(3,4) TMs are:&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!Standard format&lt;br /&gt;
!(approximate) runtime&lt;br /&gt;
!Discoverer&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LB1RZ2RA_2LC3RB1LC2RA_3RB1LB3LC2RC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ1LA2RB_1RC3RC1LA2LB_2LB2RC1LC3RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{12} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3RB1LC2LA_2LA2RB1LB3RA_3LA1RZ1LC2RA}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{6} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3RB1LC2LA_2LA2RB1LB3RA_1RA1RZ1LC2RA}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{6} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LB1RZ3LA_0LC3RB3RC1LB_2RB2LA3RA1LC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {2\,048}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ1LA2RB_2RC3RC3LB2RA_2LB3RB3LC1LA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {189.05690}&amp;lt;/math&amp;gt;&lt;br /&gt;
|[[User:XnoobSpeakable|XnoobSpeakable]] &lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LA1RA2LB_2LC1RA2RC3RB_1RZ1LA2RA3RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {188.16168}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LB2LA3LC_1LA2RB3RA1LB_1RZ1RB2LB3LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {188.16168}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA3LA3RB_2LC2RC1LB2RA_2RA2RB0LB1RZ|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {149.57147}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LB1RZ3LA_1LA3RC2LC1LC_2LA3RC0RA1LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LB1RZ3LA_1LA3RC3LB1LC_2RA3RC0RA1LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LC1RC2RA_1LA3RA2RB1RZ_3LB2LC1RA0LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|[[User:WarpedWartWars|Lúkos]]&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA1LB3RA_1RC3LB1LC1RC_2LA2RA1RZ0LA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {96.06390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA1LB3RA_1RC3LB1LC1RC_2LA2RA1RZ1RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {96.06390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LC0RA1RC_2LA1RZ3LA2RB_3LA0RA1LA0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {95.24590}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LC0RA1RC_2LA1RZ3LA2RB_3LA0RA3LB0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {95.24590}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LA1RA1RC_1LA3LC3RB1RC_3LA1RZ3LB2RC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {84.19957}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LB1RA2LB_2RC3LB3RB2LA_2LC1RZ1LA2RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {76.17604}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LA1RZ0LB_2LC2LB1RC1RB_3LA3LC0LC0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {74.18390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2RA1LA1LB_2RC3RB1RZ3LC_2LA1RC1RB0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {69.55341}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Lúkos&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 1 ==&lt;br /&gt;
The initial phase of enumeration and reduction of [[holdouts]] took place in December 2024 and was done by Terry Ligocki using the Ligockis&#039; C++ and Python codes. The initial enumerations generated 600,253,156,787 TMs of which 42,391,877,333 were holdout TMs. Also found were 202,014,400,019 halting TMs and 355,846,879,435 infinite TMs. The number of holdouts was reduced to 434,787,751 TMs (a 98.97% reduction).&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Phase 1 Info&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Two C++ programs were run before the filters in the table.&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
lr_enum 3 4 8 /dev/null /dev/null 3x4.unk.txt false&lt;br /&gt;
00 &amp;lt;= XX &amp;lt; 47: lr_enum_continue 3x4.in.XX 1000 /dev/null /dev/null 3x4.unk.txt.XX XX false&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Both do the initial enumeration and simple filtering. The &amp;quot;/dev/null&amp;quot; in both commands would be files where the halting and infinite TMs would be stored. The first command generates the TMs from a TNF tree for BB(3,4) of depth 8 and outputs the holdouts to 3x4.unk.txt. This file was then divided into 48 pieces, 3x4.in.XX, 0 &amp;lt;= XX &amp;lt; 47. The second commands (one for each XX) continues the enumeration by running each TM for 1,000 steps. It classifies each as halting, infinite, or unknown/holdout. Again, the halting and infinite TMs are &amp;quot;written&amp;quot; to /dev/null, i.e., they aren&#039;t saved. The holdouts are stored in 48 files: 3x4.unk.txt.XX.&lt;br /&gt;
&lt;br /&gt;
For these runs the first command generated a total of 22,366,747 TMs: 932,198 halting, 235,446 infinite, and 21,199,103 holdouts. The second took the 22,366,747 holdout TMs and generated a total of 600,253,156,787 TMs: 202,014,400,019 halting, 355,846,879,435 infinite, and 42,391,877,333 holdouts. These holdouts were used as a starting point of the filters below.&lt;br /&gt;
&lt;br /&gt;
The &amp;quot;Description&amp;quot; column in the table below contain the command run. Two options are not given, &amp;quot;--infile=...&amp;quot; and an &amp;quot;--outfile=...&amp;quot;. These are necessary and specify where to read and write the results, respectively. Note: The work flow was to divide the input holdouts into 48 pieces, run the command on each piece simultaneously on one of 48 cores, and then combine the 48 results into a group of holdouts.&lt;br /&gt;
&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The details are given in this table:&lt;br /&gt;
&lt;br /&gt;
(done to reduce column size:&lt;br /&gt;
&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;= % Reduced,&lt;br /&gt;
&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;= Runtime (hours),&lt;br /&gt;
&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;= Decided,&lt;br /&gt;
&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;= Processed)&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: right&amp;quot;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |TMs/sec/core&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
!&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;&lt;br /&gt;
!&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|42,391,877,333&lt;br /&gt;
|32,247,381,725&lt;br /&gt;
|23.93%&lt;br /&gt;
|788.0&lt;br /&gt;
|3,576.08&lt;br /&gt;
|14,943.74&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Reverse_Engineer_Filter.py&lt;br /&gt;
|rowspan=&amp;quot;8&amp;quot; style=&amp;quot;text-align:left&amp;quot; |[https://drive.google.com/drive/folders/1EsFw5DOjjZ6Xzjc8QgRa2YkInrsmFnLX?usp=drive_link Google Drive]&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|32,247,381,725&lt;br /&gt;
|12,789,441,316&lt;br /&gt;
|60.34%&lt;br /&gt;
|6,185.2&lt;br /&gt;
|873.85&lt;br /&gt;
|1,448.22&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=1&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|12,789,441,316&lt;br /&gt;
|4,332,283,583&lt;br /&gt;
|66.13%&lt;br /&gt;
|4,771.0&lt;br /&gt;
|492.39&lt;br /&gt;
|744.62&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=2&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|4,332,283,583&lt;br /&gt;
|2,796,143,404&lt;br /&gt;
|35.46%&lt;br /&gt;
|7,873.1&lt;br /&gt;
|54.20&lt;br /&gt;
|152.85&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=3&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|2,796,143,404&lt;br /&gt;
|1,398,734,288&lt;br /&gt;
|49.98%&lt;br /&gt;
|10,239.4&lt;br /&gt;
|37.91&lt;br /&gt;
|75.85&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Enumerate.py --max-loops=1_000 --block-size=2 --time=10 --lin-steps=0 --no-reverse-engineer --save-freq=10_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|1,398,734,288&lt;br /&gt;
|764,851,053&lt;br /&gt;
|45.32%&lt;br /&gt;
|3,203.1&lt;br /&gt;
|54.97&lt;br /&gt;
|121.30&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Enumerate.py --max-loops=10_000 --block-size=12 --no-steps --time=0.01 --lin-steps=0 --no-ctl --no-reverse-engineer --save-freq=10_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|764,851,053&lt;br /&gt;
|581,654,405&lt;br /&gt;
|23.95%&lt;br /&gt;
|1,925.3&lt;br /&gt;
|26.43&lt;br /&gt;
|110.35&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --min-block-size=4 --max-block-size=12 --max-steps=1_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|581,654,405&lt;br /&gt;
|434,787,751&lt;br /&gt;
|25.25%&lt;br /&gt;
|9,042.5&lt;br /&gt;
|4.51&lt;br /&gt;
|17.87&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --min-block-size=4 --max-block-size=6 --max-steps=10_000&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 2 ==&lt;br /&gt;
XnoobSpeakable and Lúkos are working on applying mxdys&#039; deciders/parameters to the remaining holdouts. The previous holdouts list by Terry Ligocki was split up into 8696 files containing 50,000 holdouts each* (*the last one actually has 37,751) and the deciders were applied to the files individually. These files can be called subtasks. Lúkos made a Python script to compute the subtasks in parallel, based off of XnoobSpeakable&#039;s earlier imperfect script.&lt;br /&gt;
&lt;br /&gt;
Certain data such as TMs/sec/core is unavailable, because the amount of time the computation took was not kept track of.&lt;br /&gt;
&lt;br /&gt;
Stages 3 and 8 are lr_enum_continue computations to 1 million and 10 million steps respectively. Lúkos did not contribute to computing these stages, but rather created a Python script to compute them in bulk, which XnoobSpeakable used.&lt;br /&gt;
&lt;br /&gt;
For the &amp;quot;Contribution&amp;quot; column, the first number is the amount of subtasks solved by XnoobSpeakable, the 2nd is the amount solved by Lúkos. Note that the counts are unequal, because Lúkos has a slower CPU with a lower core count. According to XnoobSpeakable, the time contribution from both contributors is roughly equal. Lúkos also worked on the Python scripts used, while XnoobSpeakable worked on compiling holdouts lists and finding optimal deciders to apply. &lt;br /&gt;
&lt;br /&gt;
[[User:Peacemaker II|Peacemaker II]] worked on verifying the validity of the results as well as providing solved TM counts per decider. Stages 1, 2, and 4 have been validated - no dropped TMs. XnoobSpeakable verified stage 6.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;nowiki&amp;gt;**&amp;lt;/nowiki&amp;gt;Stage 9: The two subtasks are seperate sub-stages, applying Reverse-Engineer and Backtracking deciders.&lt;br /&gt;
&lt;br /&gt;
Stage 10 is also seperated into substages A, B, and C for ease of computation.&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1MamU8zivuqoe4j82vpb-jYBfc4wvXNRc All scripts used are available here.] The details will be given in this table:&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: left&amp;quot;&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
! colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |% Reduced&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Subtasks&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Contribution&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Verified&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |XnoobSpeakable, Lúkos&lt;br /&gt;
|434,787,751&lt;br /&gt;
|64,777,377&lt;br /&gt;
|85.1%&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Phase 2 stage 1&lt;br /&gt;
|8696&lt;br /&gt;
|7696 / 1000&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|64,777,377&lt;br /&gt;
|37,016,957&lt;br /&gt;
|42.9%&lt;br /&gt;
|Phase 2 stage 2&lt;br /&gt;
|1296&lt;br /&gt;
|1000 / 296&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|37,016,957&lt;br /&gt;
|26,266,261&lt;br /&gt;
|29.0%&lt;br /&gt;
|Phase 2 stage 3&lt;br /&gt;
|741&lt;br /&gt;
|741 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|26,266,261&lt;br /&gt;
|22,396,711&lt;br /&gt;
|14.7%&lt;br /&gt;
|Phase 2 stage 4&lt;br /&gt;
|526&lt;br /&gt;
|485 / 41&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|22,396,711&lt;br /&gt;
|17,983,810&lt;br /&gt;
|19.7%&lt;br /&gt;
|Phase 2 stage 5&lt;br /&gt;
|448&lt;br /&gt;
|390 / 58&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|17,983,810&lt;br /&gt;
|15,564,491&lt;br /&gt;
|13.5%&lt;br /&gt;
|Phase 2 stage 6&lt;br /&gt;
|360&lt;br /&gt;
|300 / 60&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|15,564,491&lt;br /&gt;
|15,136,283&lt;br /&gt;
|2.75%&lt;br /&gt;
|Phase 2 stage 7&lt;br /&gt;
|312&lt;br /&gt;
|260 / 52&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|15,136,283&lt;br /&gt;
|14,518,243&lt;br /&gt;
|4.08%&lt;br /&gt;
|Phase 2 stage 8&lt;br /&gt;
|303&lt;br /&gt;
|303 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|14,518,243&lt;br /&gt;
|14,413,460&lt;br /&gt;
|0.72%&lt;br /&gt;
|Phase 2 stage 9&lt;br /&gt;
|2**&lt;br /&gt;
|2 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|14,413,460&lt;br /&gt;
|13,733,388&lt;br /&gt;
|4.72%&lt;br /&gt;
|Phase 2 stage 10A&lt;br /&gt;
|289&lt;br /&gt;
|216 / 73&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|14,413,460&lt;br /&gt;
|13,733,388&lt;br /&gt;
|4.72%&lt;br /&gt;
|Phase 2 stage 10B&lt;br /&gt;
|275&lt;br /&gt;
|200 / 75&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 2 Data ==&lt;br /&gt;
Here we will list the deciders applied during the various stages of Phase 2. Each decider within a stage was not applied in a specific order. Some stages have a number of TMs solved by every decider at the end of each row, provided by Peacemaker II.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Details&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Phase 2 stage 1:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 1000 NG_n 2 run 86569103&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 1000 NG_n 1 run 26093656&lt;br /&gt;
chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 13972946&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 6 mod 3 n 2 run 7190617&lt;br /&gt;
chr_LRUH 10 chr_H 6 MitM_CTL NG maxT 1000 NG_n 2 run 90302784&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 1 n 4 run 4342619&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 12 H 0 tH 1 n 2 run 11764327&lt;br /&gt;
chr_LRUH 2 chr_H 2 MitM_CTL NG maxT 1000 NG_n 1 run 55465842&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 2 n 1 run 17805678&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 2 H 0 tH 0 n 1 run 12623067&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 3000 NG_n 2 run 2240499&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 4 H 1 tH 1 n 2 run 10223131&lt;br /&gt;
chr_LRUH 6 chr_H 4 MitM_CTL NG maxT 10000 NG_n 1 run 2901053&lt;br /&gt;
chr_LRUH 22 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 28515052&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 2:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 4 n 8 run 1030303&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 8 mod 2 n 2 run 1465523&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 10000 NG_n 4 run 5232902&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 1720994&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 8 mod 3 n 2 run 555883&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 3 H 1 tH 0 n 6 run 290547&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 1 run 67506&lt;br /&gt;
chr_LRUH 10 chr_H 8 MitM_CTL NG maxT 10000 NG_n 2 run 1577979&lt;br /&gt;
chr_LRUH 6 chr_H 6 MitM_CTL NG maxT 3000 NG_n 2 run 1604533&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 4 n 6 run 10012948&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 8 H 0 tH 0 n 4 run 526822&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 1 n 1 run 34821&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 6 H 0 tH 1 n 3 run 356375&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 20 run 1970422&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 6 mod 3 n 1 run 443339&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 3 H 0 tH 1 n 2 run 518824&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 2 mod 2 n 1 run 61865&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 1 tH 1 n 2 run 288834&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 3 (lr_enum_continue from [https://github.com/sligocki/busy-beaver busy-beaver] for 1 million steps):&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
lr_enum_continue ./in.txt 1000000 ./halt.txt ./inf.txt ./unknown.txt &amp;quot;&amp;quot; false&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 4:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 3000 NG_n 2 run 202520&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 3000 NG_n 1 run 559013&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 4 n 1 run 1584&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 10000 NG_n 1 run 148544&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 1 run 812666&lt;br /&gt;
chr_asth 0 chr_LRUH 48 chr_H 48 MitM_CTL NG maxT 10000 NG_n 3 run 2043171&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 4 mod 2 n 1 run 102052&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 5:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 0 tH 1 n 10 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 16 H 1 tH 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 6 n 2 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 10000 NG_n 3 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 5 n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 3 H 1 tH 0 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 3 mod 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 2 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 5 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 4 mod 4 n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 0 tH 1 n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 6 mod 3 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 2 MitM_CTL NG maxT 30000 NG_n 3 run&lt;br /&gt;
chr_LRUH 16 chr_H 12 MitM_CTL NG maxT 30000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 8 H 2 tH 1 n 2 run&lt;br /&gt;
chr_asth 0 chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 10000 NG_n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 16 H 1 tH 0 n 6 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 16 H 0 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 6 chr_H 2 MitM_CTL NG maxT 10000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 3 H 1 tH 0 n 2 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 2 mod 3 n 1 run&lt;br /&gt;
chr_LRUH 3 chr_H 1 MitM_CTL NG maxT 100000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 1 tH 0 n 4 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 2 mod 2 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 4 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 4 H 2 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 0 MitM_CTL NG maxT 1000 NG_n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 2 mod 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 3 mod 6 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 8 chr_H 8 MitM_CTL NG maxT 10000 NG_n 2 run&lt;br /&gt;
chr_asth 0 chr_LRUH 60 chr_H 60 MitM_CTL NG maxT 30000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 3 mod 2 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 4 H 1 tH 1 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 3 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 3000 NG_n 2 run&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 6:&lt;br /&gt;
&lt;br /&gt;
XnoobSpeakable ran Enumerate.py with a 0.15s/TM time limit, Lúkos ran it with a 0.75s/TM time limit.&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
python &amp;quot;+str(pl.Path(&amp;quot;../../Code/Enumerate.py&amp;quot;))+&amp;quot; --infile=&amp;quot;+str(pl.Path(&amp;quot;./in.txt&amp;quot;))+&amp;quot; --outfile=&amp;quot;+str(pl.Path(&amp;quot;./out.pb&amp;quot;))+&amp;quot; --max-loops=990_000 --tape-limit=9_900 --no-steps --time=&amp;quot;+str(time)+&amp;quot; --recursive --exp-linear-rules  --lin-steps=0 --no-ctl --save-freq=10_000&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 7:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 1000 NG_n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 12 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 1 mod 5 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 1000 NG_n 1 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 30000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 4 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 16 H 0 tH 1 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 3000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 4 H 0 tH 1 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 0 tH 2 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 12 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 1 mod 2 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 2 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 2 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 1 mod 3 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 1 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 2 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 6 H 0 tH 0 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 1000 NG_n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 100000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 1 mod 1 n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 2 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 30000 NG_n 1 run&lt;br /&gt;
&amp;lt;/pre&amp;gt;Phase 2 stage 8 (lr_enum_continue from [https://github.com/sligocki/busy-beaver busy-beaver] for 10 million steps):&amp;lt;pre&amp;gt;lr_enum_continue ./in.txt 10000000 ./halt.txt ./inf.txt ./unknown.txt &amp;quot;&amp;quot; false&amp;lt;/pre&amp;gt;Phase 2 stage 9a:&amp;lt;pre&amp;gt;python3 Code/Reverse_Engineer_Filter.py --infile=&#039;/home/xnoobspeakable/Desktop/Busy Beavers/BB(3,4)/resultsst8/3x4_holdouts_14518243.txt&#039; --outfile=&#039;out.txt&#039;&amp;lt;/pre&amp;gt;Phase 2 stage 9b:&amp;lt;pre&amp;gt;python3 ./Code/Backtracking_Filter.py --infile=&#039;/home/xnoobspeakable/Desktop/Busy Beavers/BB(3,4)/resultsst9/unknown.txt&#039;  --outfile=&#039;./b1.pb&#039; --steps=100&amp;lt;/pre&amp;gt;Phase 2 stage 10a:&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 28 chr_LRUn 2 MitM_CTL NG maxT 30000 NG_n 8 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 6 H 1 tH 2 n 8 run&lt;br /&gt;
&amp;lt;/pre&amp;gt;Phase 2 stage 10b:&amp;lt;pre&amp;gt;&lt;br /&gt;
MitM_CTL CPS_LRU sim 1,001 maxT 10000 LRUH 2 H 0 tH 0 n 20 run&lt;br /&gt;
chr_LRUH 8 chr_H 8 MitM_CTL NG maxT 100000 NG_n 4 run&lt;br /&gt;
&amp;lt;/pre&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
[[Category:BB Domains]][[Category:BB(3,4)]]&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=BB(3,4)&amp;diff=5732</id>
		<title>BB(3,4)</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=BB(3,4)&amp;diff=5732"/>
		<updated>2025-12-22T14:51:24Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: /* Phase 2 Data */ data&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The Busy Beaver problem for 3 states and 4 symbols is unsolved, with the existence of [[Cryptids]] in the domain being given by the discovery of [[Bigfoot]] in [[BB(3,3)]]. The current BB(3,4) [[Champions#3-Symbol TMs|champion]] is {{TM|1RB3LB1RZ2RA_2LC3RB1LC2RA_3RB1LB3LC2RC|halt}}. It runs for &amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt; steps before halting. It was discovered by Pavel Kropitz in 2024 and was analysed by Shawn Ligocki in the same year.&lt;br /&gt;
&lt;br /&gt;
== Top Halters ==&lt;br /&gt;
The top 20 known longest running halting BB(3,4) TMs are:&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!Standard format&lt;br /&gt;
!(approximate) runtime&lt;br /&gt;
!Discoverer&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LB1RZ2RA_2LC3RB1LC2RA_3RB1LB3LC2RC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ1LA2RB_1RC3RC1LA2LB_2LB2RC1LC3RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{12} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3RB1LC2LA_2LA2RB1LB3RA_3LA1RZ1LC2RA}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{6} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3RB1LC2LA_2LA2RB1LB3RA_1RA1RZ1LC2RA}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{6} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LB1RZ3LA_0LC3RB3RC1LB_2RB2LA3RA1LC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {2\,048}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ1LA2RB_2RC3RC3LB2RA_2LB3RB3LC1LA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {189.05690}&amp;lt;/math&amp;gt;&lt;br /&gt;
|[[User:XnoobSpeakable|XnoobSpeakable]] &lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LA1RA2LB_2LC1RA2RC3RB_1RZ1LA2RA3RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {188.16168}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LB2LA3LC_1LA2RB3RA1LB_1RZ1RB2LB3LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {188.16168}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA3LA3RB_2LC2RC1LB2RA_2RA2RB0LB1RZ|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {149.57147}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LB1RZ3LA_1LA3RC2LC1LC_2LA3RC0RA1LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LB1RZ3LA_1LA3RC3LB1LC_2RA3RC0RA1LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LC1RC2RA_1LA3RA2RB1RZ_3LB2LC1RA0LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|[[User:WarpedWartWars|Lúkos]]&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA1LB3RA_1RC3LB1LC1RC_2LA2RA1RZ0LA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {96.06390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA1LB3RA_1RC3LB1LC1RC_2LA2RA1RZ1RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {96.06390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LC0RA1RC_2LA1RZ3LA2RB_3LA0RA1LA0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {95.24590}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LC0RA1RC_2LA1RZ3LA2RB_3LA0RA3LB0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {95.24590}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LA1RA1RC_1LA3LC3RB1RC_3LA1RZ3LB2RC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {84.19957}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LB1RA2LB_2RC3LB3RB2LA_2LC1RZ1LA2RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {76.17604}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LA1RZ0LB_2LC2LB1RC1RB_3LA3LC0LC0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {74.18390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2RA1LA1LB_2RC3RB1RZ3LC_2LA1RC1RB0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {69.55341}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Lúkos&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 1 ==&lt;br /&gt;
The initial phase of enumeration and reduction of [[holdouts]] took place in December 2024 and was done by Terry Ligocki using the Ligockis&#039; C++ and Python codes. The initial enumerations generated 600,253,156,787 TMs of which 42,391,877,333 were holdout TMs. Also found were 202,014,400,019 halting TMs and 355,846,879,435 infinite TMs. The number of holdouts was reduced to 434,787,751 TMs (a 98.97% reduction).&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Phase 1 Info&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Two C++ programs were run before the filters in the table.&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
lr_enum 3 4 8 /dev/null /dev/null 3x4.unk.txt false&lt;br /&gt;
00 &amp;lt;= XX &amp;lt; 47: lr_enum_continue 3x4.in.XX 1000 /dev/null /dev/null 3x4.unk.txt.XX XX false&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Both do the initial enumeration and simple filtering. The &amp;quot;/dev/null&amp;quot; in both commands would be files where the halting and infinite TMs would be stored. The first command generates the TMs from a TNF tree for BB(3,4) of depth 8 and outputs the holdouts to 3x4.unk.txt. This file was then divided into 48 pieces, 3x4.in.XX, 0 &amp;lt;= XX &amp;lt; 47. The second commands (one for each XX) continues the enumeration by running each TM for 1,000 steps. It classifies each as halting, infinite, or unknown/holdout. Again, the halting and infinite TMs are &amp;quot;written&amp;quot; to /dev/null, i.e., they aren&#039;t saved. The holdouts are stored in 48 files: 3x4.unk.txt.XX.&lt;br /&gt;
&lt;br /&gt;
For these runs the first command generated a total of 22,366,747 TMs: 932,198 halting, 235,446 infinite, and 21,199,103 holdouts. The second took the 22,366,747 holdout TMs and generated a total of 600,253,156,787 TMs: 202,014,400,019 halting, 355,846,879,435 infinite, and 42,391,877,333 holdouts. These holdouts were used as a starting point of the filters below.&lt;br /&gt;
&lt;br /&gt;
The &amp;quot;Description&amp;quot; column in the table below contain the command run. Two options are not given, &amp;quot;--infile=...&amp;quot; and an &amp;quot;--outfile=...&amp;quot;. These are necessary and specify where to read and write the results, respectively. Note: The work flow was to divide the input holdouts into 48 pieces, run the command on each piece simultaneously on one of 48 cores, and then combine the 48 results into a group of holdouts.&lt;br /&gt;
&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The details are given in this table:&lt;br /&gt;
&lt;br /&gt;
(done to reduce column size:&lt;br /&gt;
&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;= % Reduced,&lt;br /&gt;
&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;= Runtime (hours),&lt;br /&gt;
&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;= Decided,&lt;br /&gt;
&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;= Processed)&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: right&amp;quot;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |TMs/sec/core&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
!&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;&lt;br /&gt;
!&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|42,391,877,333&lt;br /&gt;
|32,247,381,725&lt;br /&gt;
|23.93%&lt;br /&gt;
|788.0&lt;br /&gt;
|3,576.08&lt;br /&gt;
|14,943.74&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Reverse_Engineer_Filter.py&lt;br /&gt;
|rowspan=&amp;quot;8&amp;quot; style=&amp;quot;text-align:left&amp;quot; |[https://drive.google.com/drive/folders/1EsFw5DOjjZ6Xzjc8QgRa2YkInrsmFnLX?usp=drive_link Google Drive]&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|32,247,381,725&lt;br /&gt;
|12,789,441,316&lt;br /&gt;
|60.34%&lt;br /&gt;
|6,185.2&lt;br /&gt;
|873.85&lt;br /&gt;
|1,448.22&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=1&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|12,789,441,316&lt;br /&gt;
|4,332,283,583&lt;br /&gt;
|66.13%&lt;br /&gt;
|4,771.0&lt;br /&gt;
|492.39&lt;br /&gt;
|744.62&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=2&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|4,332,283,583&lt;br /&gt;
|2,796,143,404&lt;br /&gt;
|35.46%&lt;br /&gt;
|7,873.1&lt;br /&gt;
|54.20&lt;br /&gt;
|152.85&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=3&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|2,796,143,404&lt;br /&gt;
|1,398,734,288&lt;br /&gt;
|49.98%&lt;br /&gt;
|10,239.4&lt;br /&gt;
|37.91&lt;br /&gt;
|75.85&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Enumerate.py --max-loops=1_000 --block-size=2 --time=10 --lin-steps=0 --no-reverse-engineer --save-freq=10_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|1,398,734,288&lt;br /&gt;
|764,851,053&lt;br /&gt;
|45.32%&lt;br /&gt;
|3,203.1&lt;br /&gt;
|54.97&lt;br /&gt;
|121.30&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Enumerate.py --max-loops=10_000 --block-size=12 --no-steps --time=0.01 --lin-steps=0 --no-ctl --no-reverse-engineer --save-freq=10_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|764,851,053&lt;br /&gt;
|581,654,405&lt;br /&gt;
|23.95%&lt;br /&gt;
|1,925.3&lt;br /&gt;
|26.43&lt;br /&gt;
|110.35&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --min-block-size=4 --max-block-size=12 --max-steps=1_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|581,654,405&lt;br /&gt;
|434,787,751&lt;br /&gt;
|25.25%&lt;br /&gt;
|9,042.5&lt;br /&gt;
|4.51&lt;br /&gt;
|17.87&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --min-block-size=4 --max-block-size=6 --max-steps=10_000&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 2 ==&lt;br /&gt;
XnoobSpeakable and Lúkos are working on applying mxdys&#039; deciders/parameters to the remaining holdouts. The previous holdouts list by Terry Ligocki was split up into 8696 files containing 50,000 holdouts each* (*the last one actually has 37,751) and the deciders were applied to the files individually. These files can be called subtasks. Lúkos made a Python script to compute the subtasks in parallel, based off of XnoobSpeakable&#039;s earlier imperfect script.&lt;br /&gt;
&lt;br /&gt;
Certain data such as TMs/sec/core is unavailable, because the amount of time the computation took was not kept track of.&lt;br /&gt;
&lt;br /&gt;
Stages 3 and 8 are lr_enum_continue computations to 1 million and 10 million steps respectively. Lúkos did not contribute to computing these stages, but rather created a Python script to compute them in bulk, which XnoobSpeakable used.&lt;br /&gt;
&lt;br /&gt;
For the &amp;quot;Contribution&amp;quot; column, the first number is the amount of subtasks solved by XnoobSpeakable, the 2nd is the amount solved by Lúkos. Note that the counts are unequal, because Lúkos has a slower CPU with a lower core count. According to XnoobSpeakable, the time contribution from both contributors is roughly equal. Lúkos also worked on the Python scripts used, while XnoobSpeakable worked on compiling holdouts lists and finding optimal deciders to apply. &lt;br /&gt;
&lt;br /&gt;
[[User:Peacemaker II|Peacemaker II]] worked on verifying the validity of the results as well as providing solved TM counts per decider. Stages 1, 2, and 4 have been validated - no dropped TMs. XnoobSpeakable verified stage 6.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;nowiki&amp;gt;**&amp;lt;/nowiki&amp;gt;Stage 9: The two subtasks are seperate sub-stages, applying Reverse-Engineer and Backtracking deciders.&lt;br /&gt;
&lt;br /&gt;
Stage 10 is also seperated into substages A, B, and C for ease of computation.&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1MamU8zivuqoe4j82vpb-jYBfc4wvXNRc All scripts used are available here.] The details will be given in this table:&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: left&amp;quot;&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
! colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |% Reduced&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Subtasks&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Contribution&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Verified&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |XnoobSpeakable, Lúkos&lt;br /&gt;
|434,787,751&lt;br /&gt;
|64,777,377&lt;br /&gt;
|85.1%&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Phase 2 stage 1&lt;br /&gt;
|8696&lt;br /&gt;
|7696 / 1000&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|64,777,377&lt;br /&gt;
|37,016,957&lt;br /&gt;
|42.9%&lt;br /&gt;
|Phase 2 stage 2&lt;br /&gt;
|1296&lt;br /&gt;
|1000 / 296&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|37,016,957&lt;br /&gt;
|26,266,261&lt;br /&gt;
|29.0%&lt;br /&gt;
|Phase 2 stage 3&lt;br /&gt;
|741&lt;br /&gt;
|741 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|26,266,261&lt;br /&gt;
|22,396,711&lt;br /&gt;
|14.7%&lt;br /&gt;
|Phase 2 stage 4&lt;br /&gt;
|526&lt;br /&gt;
|485 / 41&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|22,396,711&lt;br /&gt;
|17,983,810&lt;br /&gt;
|19.7%&lt;br /&gt;
|Phase 2 stage 5&lt;br /&gt;
|448&lt;br /&gt;
|390 / 58&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|17,983,810&lt;br /&gt;
|15,564,491&lt;br /&gt;
|13.5%&lt;br /&gt;
|Phase 2 stage 6&lt;br /&gt;
|360&lt;br /&gt;
|300 / 60&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|15,564,491&lt;br /&gt;
|15,136,283&lt;br /&gt;
|2.75%&lt;br /&gt;
|Phase 2 stage 7&lt;br /&gt;
|312&lt;br /&gt;
|260 / 52&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|15,136,283&lt;br /&gt;
|14,518,243&lt;br /&gt;
|4.08%&lt;br /&gt;
|Phase 2 stage 8&lt;br /&gt;
|303&lt;br /&gt;
|303 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|14,518,243&lt;br /&gt;
|14,413,460&lt;br /&gt;
|0.72%&lt;br /&gt;
|Phase 2 stage 9&lt;br /&gt;
|2**&lt;br /&gt;
|2 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|14,413,460&lt;br /&gt;
|13,733,388&lt;br /&gt;
|4.72%&lt;br /&gt;
|Phase 2 stage 10A&lt;br /&gt;
|289&lt;br /&gt;
|216 / 73&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 2 Data ==&lt;br /&gt;
Here we will list the deciders applied during the various stages of Phase 2. Each decider within a stage was not applied in a specific order. Some stages have a number of TMs solved by every decider at the end of each row, provided by Peacemaker II.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Details&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Phase 2 stage 1:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 1000 NG_n 2 run 86569103&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 1000 NG_n 1 run 26093656&lt;br /&gt;
chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 13972946&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 6 mod 3 n 2 run 7190617&lt;br /&gt;
chr_LRUH 10 chr_H 6 MitM_CTL NG maxT 1000 NG_n 2 run 90302784&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 1 n 4 run 4342619&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 12 H 0 tH 1 n 2 run 11764327&lt;br /&gt;
chr_LRUH 2 chr_H 2 MitM_CTL NG maxT 1000 NG_n 1 run 55465842&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 2 n 1 run 17805678&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 2 H 0 tH 0 n 1 run 12623067&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 3000 NG_n 2 run 2240499&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 4 H 1 tH 1 n 2 run 10223131&lt;br /&gt;
chr_LRUH 6 chr_H 4 MitM_CTL NG maxT 10000 NG_n 1 run 2901053&lt;br /&gt;
chr_LRUH 22 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 28515052&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 2:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 4 n 8 run 1030303&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 8 mod 2 n 2 run 1465523&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 10000 NG_n 4 run 5232902&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 1720994&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 8 mod 3 n 2 run 555883&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 3 H 1 tH 0 n 6 run 290547&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 1 run 67506&lt;br /&gt;
chr_LRUH 10 chr_H 8 MitM_CTL NG maxT 10000 NG_n 2 run 1577979&lt;br /&gt;
chr_LRUH 6 chr_H 6 MitM_CTL NG maxT 3000 NG_n 2 run 1604533&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 4 n 6 run 10012948&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 8 H 0 tH 0 n 4 run 526822&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 1 n 1 run 34821&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 6 H 0 tH 1 n 3 run 356375&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 20 run 1970422&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 6 mod 3 n 1 run 443339&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 3 H 0 tH 1 n 2 run 518824&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 2 mod 2 n 1 run 61865&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 1 tH 1 n 2 run 288834&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 3 (lr_enum_continue from [https://github.com/sligocki/busy-beaver busy-beaver] for 1 million steps):&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
lr_enum_continue ./in.txt 1000000 ./halt.txt ./inf.txt ./unknown.txt &amp;quot;&amp;quot; false&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 4:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 3000 NG_n 2 run 202520&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 3000 NG_n 1 run 559013&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 4 n 1 run 1584&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 10000 NG_n 1 run 148544&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 1 run 812666&lt;br /&gt;
chr_asth 0 chr_LRUH 48 chr_H 48 MitM_CTL NG maxT 10000 NG_n 3 run 2043171&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 4 mod 2 n 1 run 102052&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 5:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 0 tH 1 n 10 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 16 H 1 tH 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 6 n 2 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 10000 NG_n 3 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 5 n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 3 H 1 tH 0 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 3 mod 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 2 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 5 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 4 mod 4 n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 0 tH 1 n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 6 mod 3 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 2 MitM_CTL NG maxT 30000 NG_n 3 run&lt;br /&gt;
chr_LRUH 16 chr_H 12 MitM_CTL NG maxT 30000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 8 H 2 tH 1 n 2 run&lt;br /&gt;
chr_asth 0 chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 10000 NG_n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 16 H 1 tH 0 n 6 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 16 H 0 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 6 chr_H 2 MitM_CTL NG maxT 10000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 3 H 1 tH 0 n 2 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 2 mod 3 n 1 run&lt;br /&gt;
chr_LRUH 3 chr_H 1 MitM_CTL NG maxT 100000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 1 tH 0 n 4 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 2 mod 2 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 4 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 4 H 2 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 0 MitM_CTL NG maxT 1000 NG_n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 2 mod 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 3 mod 6 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 8 chr_H 8 MitM_CTL NG maxT 10000 NG_n 2 run&lt;br /&gt;
chr_asth 0 chr_LRUH 60 chr_H 60 MitM_CTL NG maxT 30000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 3 mod 2 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 4 H 1 tH 1 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 3 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 3000 NG_n 2 run&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 6:&lt;br /&gt;
&lt;br /&gt;
XnoobSpeakable ran Enumerate.py with a 0.15s/TM time limit, Lúkos ran it with a 0.75s/TM time limit.&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
python &amp;quot;+str(pl.Path(&amp;quot;../../Code/Enumerate.py&amp;quot;))+&amp;quot; --infile=&amp;quot;+str(pl.Path(&amp;quot;./in.txt&amp;quot;))+&amp;quot; --outfile=&amp;quot;+str(pl.Path(&amp;quot;./out.pb&amp;quot;))+&amp;quot; --max-loops=990_000 --tape-limit=9_900 --no-steps --time=&amp;quot;+str(time)+&amp;quot; --recursive --exp-linear-rules  --lin-steps=0 --no-ctl --save-freq=10_000&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 7:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 1000 NG_n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 12 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 1 mod 5 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 1000 NG_n 1 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 30000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 4 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 16 H 0 tH 1 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 3000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 4 H 0 tH 1 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 0 tH 2 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 12 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 1 mod 2 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 2 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 2 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 1 mod 3 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 1 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 2 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 6 H 0 tH 0 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 1000 NG_n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 100000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 1 mod 1 n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 2 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 30000 NG_n 1 run&lt;br /&gt;
&amp;lt;/pre&amp;gt;Phase 2 stage 8 (lr_enum_continue from [https://github.com/sligocki/busy-beaver busy-beaver] for 10 million steps):&amp;lt;pre&amp;gt;lr_enum_continue ./in.txt 10000000 ./halt.txt ./inf.txt ./unknown.txt &amp;quot;&amp;quot; false&amp;lt;/pre&amp;gt;Phase 2 stage 9a:&amp;lt;pre&amp;gt;python3 Code/Reverse_Engineer_Filter.py --infile=&#039;/home/xnoobspeakable/Desktop/Busy Beavers/BB(3,4)/resultsst8/3x4_holdouts_14518243.txt&#039; --outfile=&#039;out.txt&#039;&amp;lt;/pre&amp;gt;Phase 2 stage 9b:&amp;lt;pre&amp;gt;python3 ./Code/Backtracking_Filter.py --infile=&#039;/home/xnoobspeakable/Desktop/Busy Beavers/BB(3,4)/resultsst9/unknown.txt&#039;  --outfile=&#039;./b1.pb&#039; --steps=100&amp;lt;/pre&amp;gt;Phase 2 stage 10a:&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 28 chr_LRUn 2 MitM_CTL NG maxT 30,000 NG_n 8 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1,001 maxT 10,000 LRUH 6 H 1 tH 2 n 8 run&lt;br /&gt;
&amp;lt;/pre&amp;gt;&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
[[Category:BB Domains]][[Category:BB(3,4)]]&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=BB(3,4)&amp;diff=5731</id>
		<title>BB(3,4)</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=BB(3,4)&amp;diff=5731"/>
		<updated>2025-12-22T14:50:07Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: /* Phase 2 Data */ info&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The Busy Beaver problem for 3 states and 4 symbols is unsolved, with the existence of [[Cryptids]] in the domain being given by the discovery of [[Bigfoot]] in [[BB(3,3)]]. The current BB(3,4) [[Champions#3-Symbol TMs|champion]] is {{TM|1RB3LB1RZ2RA_2LC3RB1LC2RA_3RB1LB3LC2RC|halt}}. It runs for &amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt; steps before halting. It was discovered by Pavel Kropitz in 2024 and was analysed by Shawn Ligocki in the same year.&lt;br /&gt;
&lt;br /&gt;
== Top Halters ==&lt;br /&gt;
The top 20 known longest running halting BB(3,4) TMs are:&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!Standard format&lt;br /&gt;
!(approximate) runtime&lt;br /&gt;
!Discoverer&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LB1RZ2RA_2LC3RB1LC2RA_3RB1LB3LC2RC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ1LA2RB_1RC3RC1LA2LB_2LB2RC1LC3RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{12} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3RB1LC2LA_2LA2RB1LB3RA_3LA1RZ1LC2RA}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{6} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3RB1LC2LA_2LA2RB1LB3RA_1RA1RZ1LC2RA}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{6} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LB1RZ3LA_0LC3RB3RC1LB_2RB2LA3RA1LC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {2\,048}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ1LA2RB_2RC3RC3LB2RA_2LB3RB3LC1LA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {189.05690}&amp;lt;/math&amp;gt;&lt;br /&gt;
|[[User:XnoobSpeakable|XnoobSpeakable]] &lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LA1RA2LB_2LC1RA2RC3RB_1RZ1LA2RA3RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {188.16168}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LB2LA3LC_1LA2RB3RA1LB_1RZ1RB2LB3LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {188.16168}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA3LA3RB_2LC2RC1LB2RA_2RA2RB0LB1RZ|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {149.57147}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LB1RZ3LA_1LA3RC2LC1LC_2LA3RC0RA1LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LB1RZ3LA_1LA3RC3LB1LC_2RA3RC0RA1LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LC1RC2RA_1LA3RA2RB1RZ_3LB2LC1RA0LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|[[User:WarpedWartWars|Lúkos]]&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA1LB3RA_1RC3LB1LC1RC_2LA2RA1RZ0LA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {96.06390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA1LB3RA_1RC3LB1LC1RC_2LA2RA1RZ1RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {96.06390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LC0RA1RC_2LA1RZ3LA2RB_3LA0RA1LA0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {95.24590}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LC0RA1RC_2LA1RZ3LA2RB_3LA0RA3LB0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {95.24590}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LA1RA1RC_1LA3LC3RB1RC_3LA1RZ3LB2RC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {84.19957}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LB1RA2LB_2RC3LB3RB2LA_2LC1RZ1LA2RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {76.17604}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LA1RZ0LB_2LC2LB1RC1RB_3LA3LC0LC0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {74.18390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2RA1LA1LB_2RC3RB1RZ3LC_2LA1RC1RB0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {69.55341}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Lúkos&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 1 ==&lt;br /&gt;
The initial phase of enumeration and reduction of [[holdouts]] took place in December 2024 and was done by Terry Ligocki using the Ligockis&#039; C++ and Python codes. The initial enumerations generated 600,253,156,787 TMs of which 42,391,877,333 were holdout TMs. Also found were 202,014,400,019 halting TMs and 355,846,879,435 infinite TMs. The number of holdouts was reduced to 434,787,751 TMs (a 98.97% reduction).&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Phase 1 Info&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Two C++ programs were run before the filters in the table.&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
lr_enum 3 4 8 /dev/null /dev/null 3x4.unk.txt false&lt;br /&gt;
00 &amp;lt;= XX &amp;lt; 47: lr_enum_continue 3x4.in.XX 1000 /dev/null /dev/null 3x4.unk.txt.XX XX false&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Both do the initial enumeration and simple filtering. The &amp;quot;/dev/null&amp;quot; in both commands would be files where the halting and infinite TMs would be stored. The first command generates the TMs from a TNF tree for BB(3,4) of depth 8 and outputs the holdouts to 3x4.unk.txt. This file was then divided into 48 pieces, 3x4.in.XX, 0 &amp;lt;= XX &amp;lt; 47. The second commands (one for each XX) continues the enumeration by running each TM for 1,000 steps. It classifies each as halting, infinite, or unknown/holdout. Again, the halting and infinite TMs are &amp;quot;written&amp;quot; to /dev/null, i.e., they aren&#039;t saved. The holdouts are stored in 48 files: 3x4.unk.txt.XX.&lt;br /&gt;
&lt;br /&gt;
For these runs the first command generated a total of 22,366,747 TMs: 932,198 halting, 235,446 infinite, and 21,199,103 holdouts. The second took the 22,366,747 holdout TMs and generated a total of 600,253,156,787 TMs: 202,014,400,019 halting, 355,846,879,435 infinite, and 42,391,877,333 holdouts. These holdouts were used as a starting point of the filters below.&lt;br /&gt;
&lt;br /&gt;
The &amp;quot;Description&amp;quot; column in the table below contain the command run. Two options are not given, &amp;quot;--infile=...&amp;quot; and an &amp;quot;--outfile=...&amp;quot;. These are necessary and specify where to read and write the results, respectively. Note: The work flow was to divide the input holdouts into 48 pieces, run the command on each piece simultaneously on one of 48 cores, and then combine the 48 results into a group of holdouts.&lt;br /&gt;
&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The details are given in this table:&lt;br /&gt;
&lt;br /&gt;
(done to reduce column size:&lt;br /&gt;
&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;= % Reduced,&lt;br /&gt;
&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;= Runtime (hours),&lt;br /&gt;
&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;= Decided,&lt;br /&gt;
&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;= Processed)&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: right&amp;quot;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |TMs/sec/core&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
!&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;&lt;br /&gt;
!&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|42,391,877,333&lt;br /&gt;
|32,247,381,725&lt;br /&gt;
|23.93%&lt;br /&gt;
|788.0&lt;br /&gt;
|3,576.08&lt;br /&gt;
|14,943.74&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Reverse_Engineer_Filter.py&lt;br /&gt;
|rowspan=&amp;quot;8&amp;quot; style=&amp;quot;text-align:left&amp;quot; |[https://drive.google.com/drive/folders/1EsFw5DOjjZ6Xzjc8QgRa2YkInrsmFnLX?usp=drive_link Google Drive]&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|32,247,381,725&lt;br /&gt;
|12,789,441,316&lt;br /&gt;
|60.34%&lt;br /&gt;
|6,185.2&lt;br /&gt;
|873.85&lt;br /&gt;
|1,448.22&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=1&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|12,789,441,316&lt;br /&gt;
|4,332,283,583&lt;br /&gt;
|66.13%&lt;br /&gt;
|4,771.0&lt;br /&gt;
|492.39&lt;br /&gt;
|744.62&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=2&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|4,332,283,583&lt;br /&gt;
|2,796,143,404&lt;br /&gt;
|35.46%&lt;br /&gt;
|7,873.1&lt;br /&gt;
|54.20&lt;br /&gt;
|152.85&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=3&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|2,796,143,404&lt;br /&gt;
|1,398,734,288&lt;br /&gt;
|49.98%&lt;br /&gt;
|10,239.4&lt;br /&gt;
|37.91&lt;br /&gt;
|75.85&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Enumerate.py --max-loops=1_000 --block-size=2 --time=10 --lin-steps=0 --no-reverse-engineer --save-freq=10_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|1,398,734,288&lt;br /&gt;
|764,851,053&lt;br /&gt;
|45.32%&lt;br /&gt;
|3,203.1&lt;br /&gt;
|54.97&lt;br /&gt;
|121.30&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Enumerate.py --max-loops=10_000 --block-size=12 --no-steps --time=0.01 --lin-steps=0 --no-ctl --no-reverse-engineer --save-freq=10_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|764,851,053&lt;br /&gt;
|581,654,405&lt;br /&gt;
|23.95%&lt;br /&gt;
|1,925.3&lt;br /&gt;
|26.43&lt;br /&gt;
|110.35&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --min-block-size=4 --max-block-size=12 --max-steps=1_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|581,654,405&lt;br /&gt;
|434,787,751&lt;br /&gt;
|25.25%&lt;br /&gt;
|9,042.5&lt;br /&gt;
|4.51&lt;br /&gt;
|17.87&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --min-block-size=4 --max-block-size=6 --max-steps=10_000&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 2 ==&lt;br /&gt;
XnoobSpeakable and Lúkos are working on applying mxdys&#039; deciders/parameters to the remaining holdouts. The previous holdouts list by Terry Ligocki was split up into 8696 files containing 50,000 holdouts each* (*the last one actually has 37,751) and the deciders were applied to the files individually. These files can be called subtasks. Lúkos made a Python script to compute the subtasks in parallel, based off of XnoobSpeakable&#039;s earlier imperfect script.&lt;br /&gt;
&lt;br /&gt;
Certain data such as TMs/sec/core is unavailable, because the amount of time the computation took was not kept track of.&lt;br /&gt;
&lt;br /&gt;
Stages 3 and 8 are lr_enum_continue computations to 1 million and 10 million steps respectively. Lúkos did not contribute to computing these stages, but rather created a Python script to compute them in bulk, which XnoobSpeakable used.&lt;br /&gt;
&lt;br /&gt;
For the &amp;quot;Contribution&amp;quot; column, the first number is the amount of subtasks solved by XnoobSpeakable, the 2nd is the amount solved by Lúkos. Note that the counts are unequal, because Lúkos has a slower CPU with a lower core count. According to XnoobSpeakable, the time contribution from both contributors is roughly equal. Lúkos also worked on the Python scripts used, while XnoobSpeakable worked on compiling holdouts lists and finding optimal deciders to apply. &lt;br /&gt;
&lt;br /&gt;
[[User:Peacemaker II|Peacemaker II]] worked on verifying the validity of the results as well as providing solved TM counts per decider. Stages 1, 2, and 4 have been validated - no dropped TMs. XnoobSpeakable verified stage 6.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;nowiki&amp;gt;**&amp;lt;/nowiki&amp;gt;Stage 9: The two subtasks are seperate sub-stages, applying Reverse-Engineer and Backtracking deciders.&lt;br /&gt;
&lt;br /&gt;
Stage 10 is also seperated into substages A, B, and C for ease of computation.&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1MamU8zivuqoe4j82vpb-jYBfc4wvXNRc All scripts used are available here.] The details will be given in this table:&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: left&amp;quot;&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
! colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |% Reduced&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Subtasks&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Contribution&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Verified&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |XnoobSpeakable, Lúkos&lt;br /&gt;
|434,787,751&lt;br /&gt;
|64,777,377&lt;br /&gt;
|85.1%&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Phase 2 stage 1&lt;br /&gt;
|8696&lt;br /&gt;
|7696 / 1000&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|64,777,377&lt;br /&gt;
|37,016,957&lt;br /&gt;
|42.9%&lt;br /&gt;
|Phase 2 stage 2&lt;br /&gt;
|1296&lt;br /&gt;
|1000 / 296&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|37,016,957&lt;br /&gt;
|26,266,261&lt;br /&gt;
|29.0%&lt;br /&gt;
|Phase 2 stage 3&lt;br /&gt;
|741&lt;br /&gt;
|741 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|26,266,261&lt;br /&gt;
|22,396,711&lt;br /&gt;
|14.7%&lt;br /&gt;
|Phase 2 stage 4&lt;br /&gt;
|526&lt;br /&gt;
|485 / 41&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|22,396,711&lt;br /&gt;
|17,983,810&lt;br /&gt;
|19.7%&lt;br /&gt;
|Phase 2 stage 5&lt;br /&gt;
|448&lt;br /&gt;
|390 / 58&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|17,983,810&lt;br /&gt;
|15,564,491&lt;br /&gt;
|13.5%&lt;br /&gt;
|Phase 2 stage 6&lt;br /&gt;
|360&lt;br /&gt;
|300 / 60&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|15,564,491&lt;br /&gt;
|15,136,283&lt;br /&gt;
|2.75%&lt;br /&gt;
|Phase 2 stage 7&lt;br /&gt;
|312&lt;br /&gt;
|260 / 52&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|15,136,283&lt;br /&gt;
|14,518,243&lt;br /&gt;
|4.08%&lt;br /&gt;
|Phase 2 stage 8&lt;br /&gt;
|303&lt;br /&gt;
|303 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|14,518,243&lt;br /&gt;
|14,413,460&lt;br /&gt;
|0.72%&lt;br /&gt;
|Phase 2 stage 9&lt;br /&gt;
|2**&lt;br /&gt;
|2 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|14,413,460&lt;br /&gt;
|13,733,388&lt;br /&gt;
|4.72%&lt;br /&gt;
|Phase 2 stage 10A&lt;br /&gt;
|289&lt;br /&gt;
|216 / 73&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 2 Data ==&lt;br /&gt;
Here we will list the deciders applied during the various stages of Phase 2. Each decider within a stage was not applied in a specific order. Some stages have a number of TMs solved by every decider at the end of each row, provided by Peacemaker II.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Details&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Phase 2 stage 1:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 1000 NG_n 2 run 86569103&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 1000 NG_n 1 run 26093656&lt;br /&gt;
chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 13972946&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 6 mod 3 n 2 run 7190617&lt;br /&gt;
chr_LRUH 10 chr_H 6 MitM_CTL NG maxT 1000 NG_n 2 run 90302784&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 1 n 4 run 4342619&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 12 H 0 tH 1 n 2 run 11764327&lt;br /&gt;
chr_LRUH 2 chr_H 2 MitM_CTL NG maxT 1000 NG_n 1 run 55465842&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 2 n 1 run 17805678&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 2 H 0 tH 0 n 1 run 12623067&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 3000 NG_n 2 run 2240499&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 4 H 1 tH 1 n 2 run 10223131&lt;br /&gt;
chr_LRUH 6 chr_H 4 MitM_CTL NG maxT 10000 NG_n 1 run 2901053&lt;br /&gt;
chr_LRUH 22 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 28515052&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 2:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 4 n 8 run 1030303&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 8 mod 2 n 2 run 1465523&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 10000 NG_n 4 run 5232902&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 1720994&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 8 mod 3 n 2 run 555883&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 3 H 1 tH 0 n 6 run 290547&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 1 run 67506&lt;br /&gt;
chr_LRUH 10 chr_H 8 MitM_CTL NG maxT 10000 NG_n 2 run 1577979&lt;br /&gt;
chr_LRUH 6 chr_H 6 MitM_CTL NG maxT 3000 NG_n 2 run 1604533&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 4 n 6 run 10012948&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 8 H 0 tH 0 n 4 run 526822&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 1 n 1 run 34821&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 6 H 0 tH 1 n 3 run 356375&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 20 run 1970422&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 6 mod 3 n 1 run 443339&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 3 H 0 tH 1 n 2 run 518824&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 2 mod 2 n 1 run 61865&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 1 tH 1 n 2 run 288834&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 3 (lr_enum_continue from [https://github.com/sligocki/busy-beaver busy-beaver] for 1 million steps):&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
lr_enum_continue ./in.txt 1000000 ./halt.txt ./inf.txt ./unknown.txt &amp;quot;&amp;quot; false&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 4:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 3000 NG_n 2 run 202520&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 3000 NG_n 1 run 559013&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 4 n 1 run 1584&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 10000 NG_n 1 run 148544&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 1 run 812666&lt;br /&gt;
chr_asth 0 chr_LRUH 48 chr_H 48 MitM_CTL NG maxT 10000 NG_n 3 run 2043171&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 4 mod 2 n 1 run 102052&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 5:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 0 tH 1 n 10 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 16 H 1 tH 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 6 n 2 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 10000 NG_n 3 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 5 n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 3 H 1 tH 0 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 3 mod 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 2 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 5 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 4 mod 4 n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 0 tH 1 n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 6 mod 3 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 2 MitM_CTL NG maxT 30000 NG_n 3 run&lt;br /&gt;
chr_LRUH 16 chr_H 12 MitM_CTL NG maxT 30000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 8 H 2 tH 1 n 2 run&lt;br /&gt;
chr_asth 0 chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 10000 NG_n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 16 H 1 tH 0 n 6 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 16 H 0 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 6 chr_H 2 MitM_CTL NG maxT 10000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 3 H 1 tH 0 n 2 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 2 mod 3 n 1 run&lt;br /&gt;
chr_LRUH 3 chr_H 1 MitM_CTL NG maxT 100000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 1 tH 0 n 4 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 2 mod 2 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 4 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 4 H 2 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 0 MitM_CTL NG maxT 1000 NG_n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 2 mod 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 3 mod 6 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 8 chr_H 8 MitM_CTL NG maxT 10000 NG_n 2 run&lt;br /&gt;
chr_asth 0 chr_LRUH 60 chr_H 60 MitM_CTL NG maxT 30000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 3 mod 2 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 4 H 1 tH 1 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 3 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 3000 NG_n 2 run&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 6:&lt;br /&gt;
&lt;br /&gt;
XnoobSpeakable ran Enumerate.py with a 0.15s/TM time limit, Lúkos ran it with a 0.75s/TM time limit.&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
python &amp;quot;+str(pl.Path(&amp;quot;../../Code/Enumerate.py&amp;quot;))+&amp;quot; --infile=&amp;quot;+str(pl.Path(&amp;quot;./in.txt&amp;quot;))+&amp;quot; --outfile=&amp;quot;+str(pl.Path(&amp;quot;./out.pb&amp;quot;))+&amp;quot; --max-loops=990_000 --tape-limit=9_900 --no-steps --time=&amp;quot;+str(time)+&amp;quot; --recursive --exp-linear-rules  --lin-steps=0 --no-ctl --save-freq=10_000&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 7:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 1000 NG_n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 12 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 1 mod 5 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 1000 NG_n 1 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 30000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 4 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 16 H 0 tH 1 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 3000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 4 H 0 tH 1 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 0 tH 2 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 12 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 1 mod 2 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 2 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 2 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 1 mod 3 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 1 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 2 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 6 H 0 tH 0 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 1000 NG_n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 100000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 1 mod 1 n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 2 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 30000 NG_n 1 run&lt;br /&gt;
&amp;lt;/pre&amp;gt;Phase 2 stage 8 (lr_enum_continue from [https://github.com/sligocki/busy-beaver busy-beaver] for 10 million steps):&amp;lt;pre&amp;gt;lr_enum_continue ./in.txt 10000000 ./halt.txt ./inf.txt ./unknown.txt &amp;quot;&amp;quot; false&amp;lt;/pre&amp;gt;Phase 2 stage 9a:&amp;lt;pre&amp;gt;python3 Code/Reverse_Engineer_Filter.py --infile=&#039;/home/xnoobspeakable/Desktop/Busy Beavers/BB(3,4)/resultsst8/3x4_holdouts_14518243.txt&#039; --outfile=&#039;out.txt&#039;&amp;lt;/pre&amp;gt;Phase 2 stage 9b:&amp;lt;pre&amp;gt;python3 ./Code/Backtracking_Filter.py --infile=&#039;/home/xnoobspeakable/Desktop/Busy Beavers/BB(3,4)/resultsst9/unknown.txt&#039;  --outfile=&#039;./b1.pb&#039; --steps=100&amp;lt;/pre&amp;gt;&lt;br /&gt;
&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
[[Category:BB Domains]][[Category:BB(3,4)]]&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=BB(3,4)&amp;diff=5730</id>
		<title>BB(3,4)</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=BB(3,4)&amp;diff=5730"/>
		<updated>2025-12-22T14:46:43Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: /* Phase 2 */ Stage 10A&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The Busy Beaver problem for 3 states and 4 symbols is unsolved, with the existence of [[Cryptids]] in the domain being given by the discovery of [[Bigfoot]] in [[BB(3,3)]]. The current BB(3,4) [[Champions#3-Symbol TMs|champion]] is {{TM|1RB3LB1RZ2RA_2LC3RB1LC2RA_3RB1LB3LC2RC|halt}}. It runs for &amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt; steps before halting. It was discovered by Pavel Kropitz in 2024 and was analysed by Shawn Ligocki in the same year.&lt;br /&gt;
&lt;br /&gt;
== Top Halters ==&lt;br /&gt;
The top 20 known longest running halting BB(3,4) TMs are:&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!Standard format&lt;br /&gt;
!(approximate) runtime&lt;br /&gt;
!Discoverer&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LB1RZ2RA_2LC3RB1LC2RA_3RB1LB3LC2RC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ1LA2RB_1RC3RC1LA2LB_2LB2RC1LC3RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{12} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3RB1LC2LA_2LA2RB1LB3RA_3LA1RZ1LC2RA}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{6} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3RB1LC2LA_2LA2RB1LB3RA_1RA1RZ1LC2RA}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{6} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LB1RZ3LA_0LC3RB3RC1LB_2RB2LA3RA1LC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {2\,048}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ1LA2RB_2RC3RC3LB2RA_2LB3RB3LC1LA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {189.05690}&amp;lt;/math&amp;gt;&lt;br /&gt;
|[[User:XnoobSpeakable|XnoobSpeakable]] &lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LA1RA2LB_2LC1RA2RC3RB_1RZ1LA2RA3RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {188.16168}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LB2LA3LC_1LA2RB3RA1LB_1RZ1RB2LB3LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {188.16168}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA3LA3RB_2LC2RC1LB2RA_2RA2RB0LB1RZ|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {149.57147}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LB1RZ3LA_1LA3RC2LC1LC_2LA3RC0RA1LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LB1RZ3LA_1LA3RC3LB1LC_2RA3RC0RA1LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LC1RC2RA_1LA3RA2RB1RZ_3LB2LC1RA0LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|[[User:WarpedWartWars|Lúkos]]&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA1LB3RA_1RC3LB1LC1RC_2LA2RA1RZ0LA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {96.06390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA1LB3RA_1RC3LB1LC1RC_2LA2RA1RZ1RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {96.06390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LC0RA1RC_2LA1RZ3LA2RB_3LA0RA1LA0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {95.24590}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LC0RA1RC_2LA1RZ3LA2RB_3LA0RA3LB0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {95.24590}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LA1RA1RC_1LA3LC3RB1RC_3LA1RZ3LB2RC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {84.19957}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LB1RA2LB_2RC3LB3RB2LA_2LC1RZ1LA2RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {76.17604}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LA1RZ0LB_2LC2LB1RC1RB_3LA3LC0LC0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {74.18390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2RA1LA1LB_2RC3RB1RZ3LC_2LA1RC1RB0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {69.55341}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Lúkos&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 1 ==&lt;br /&gt;
The initial phase of enumeration and reduction of [[holdouts]] took place in December 2024 and was done by Terry Ligocki using the Ligockis&#039; C++ and Python codes. The initial enumerations generated 600,253,156,787 TMs of which 42,391,877,333 were holdout TMs. Also found were 202,014,400,019 halting TMs and 355,846,879,435 infinite TMs. The number of holdouts was reduced to 434,787,751 TMs (a 98.97% reduction).&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Phase 1 Info&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Two C++ programs were run before the filters in the table.&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
lr_enum 3 4 8 /dev/null /dev/null 3x4.unk.txt false&lt;br /&gt;
00 &amp;lt;= XX &amp;lt; 47: lr_enum_continue 3x4.in.XX 1000 /dev/null /dev/null 3x4.unk.txt.XX XX false&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Both do the initial enumeration and simple filtering. The &amp;quot;/dev/null&amp;quot; in both commands would be files where the halting and infinite TMs would be stored. The first command generates the TMs from a TNF tree for BB(3,4) of depth 8 and outputs the holdouts to 3x4.unk.txt. This file was then divided into 48 pieces, 3x4.in.XX, 0 &amp;lt;= XX &amp;lt; 47. The second commands (one for each XX) continues the enumeration by running each TM for 1,000 steps. It classifies each as halting, infinite, or unknown/holdout. Again, the halting and infinite TMs are &amp;quot;written&amp;quot; to /dev/null, i.e., they aren&#039;t saved. The holdouts are stored in 48 files: 3x4.unk.txt.XX.&lt;br /&gt;
&lt;br /&gt;
For these runs the first command generated a total of 22,366,747 TMs: 932,198 halting, 235,446 infinite, and 21,199,103 holdouts. The second took the 22,366,747 holdout TMs and generated a total of 600,253,156,787 TMs: 202,014,400,019 halting, 355,846,879,435 infinite, and 42,391,877,333 holdouts. These holdouts were used as a starting point of the filters below.&lt;br /&gt;
&lt;br /&gt;
The &amp;quot;Description&amp;quot; column in the table below contain the command run. Two options are not given, &amp;quot;--infile=...&amp;quot; and an &amp;quot;--outfile=...&amp;quot;. These are necessary and specify where to read and write the results, respectively. Note: The work flow was to divide the input holdouts into 48 pieces, run the command on each piece simultaneously on one of 48 cores, and then combine the 48 results into a group of holdouts.&lt;br /&gt;
&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The details are given in this table:&lt;br /&gt;
&lt;br /&gt;
(done to reduce column size:&lt;br /&gt;
&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;= % Reduced,&lt;br /&gt;
&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;= Runtime (hours),&lt;br /&gt;
&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;= Decided,&lt;br /&gt;
&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;= Processed)&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: right&amp;quot;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |TMs/sec/core&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
!&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;&lt;br /&gt;
!&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|42,391,877,333&lt;br /&gt;
|32,247,381,725&lt;br /&gt;
|23.93%&lt;br /&gt;
|788.0&lt;br /&gt;
|3,576.08&lt;br /&gt;
|14,943.74&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Reverse_Engineer_Filter.py&lt;br /&gt;
|rowspan=&amp;quot;8&amp;quot; style=&amp;quot;text-align:left&amp;quot; |[https://drive.google.com/drive/folders/1EsFw5DOjjZ6Xzjc8QgRa2YkInrsmFnLX?usp=drive_link Google Drive]&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|32,247,381,725&lt;br /&gt;
|12,789,441,316&lt;br /&gt;
|60.34%&lt;br /&gt;
|6,185.2&lt;br /&gt;
|873.85&lt;br /&gt;
|1,448.22&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=1&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|12,789,441,316&lt;br /&gt;
|4,332,283,583&lt;br /&gt;
|66.13%&lt;br /&gt;
|4,771.0&lt;br /&gt;
|492.39&lt;br /&gt;
|744.62&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=2&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|4,332,283,583&lt;br /&gt;
|2,796,143,404&lt;br /&gt;
|35.46%&lt;br /&gt;
|7,873.1&lt;br /&gt;
|54.20&lt;br /&gt;
|152.85&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=3&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|2,796,143,404&lt;br /&gt;
|1,398,734,288&lt;br /&gt;
|49.98%&lt;br /&gt;
|10,239.4&lt;br /&gt;
|37.91&lt;br /&gt;
|75.85&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Enumerate.py --max-loops=1_000 --block-size=2 --time=10 --lin-steps=0 --no-reverse-engineer --save-freq=10_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|1,398,734,288&lt;br /&gt;
|764,851,053&lt;br /&gt;
|45.32%&lt;br /&gt;
|3,203.1&lt;br /&gt;
|54.97&lt;br /&gt;
|121.30&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Enumerate.py --max-loops=10_000 --block-size=12 --no-steps --time=0.01 --lin-steps=0 --no-ctl --no-reverse-engineer --save-freq=10_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|764,851,053&lt;br /&gt;
|581,654,405&lt;br /&gt;
|23.95%&lt;br /&gt;
|1,925.3&lt;br /&gt;
|26.43&lt;br /&gt;
|110.35&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --min-block-size=4 --max-block-size=12 --max-steps=1_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|581,654,405&lt;br /&gt;
|434,787,751&lt;br /&gt;
|25.25%&lt;br /&gt;
|9,042.5&lt;br /&gt;
|4.51&lt;br /&gt;
|17.87&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --min-block-size=4 --max-block-size=6 --max-steps=10_000&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 2 ==&lt;br /&gt;
XnoobSpeakable and Lúkos are working on applying mxdys&#039; deciders/parameters to the remaining holdouts. The previous holdouts list by Terry Ligocki was split up into 8696 files containing 50,000 holdouts each* (*the last one actually has 37,751) and the deciders were applied to the files individually. These files can be called subtasks. Lúkos made a Python script to compute the subtasks in parallel, based off of XnoobSpeakable&#039;s earlier imperfect script.&lt;br /&gt;
&lt;br /&gt;
Certain data such as TMs/sec/core is unavailable, because the amount of time the computation took was not kept track of.&lt;br /&gt;
&lt;br /&gt;
Stages 3 and 8 are lr_enum_continue computations to 1 million and 10 million steps respectively. Lúkos did not contribute to computing these stages, but rather created a Python script to compute them in bulk, which XnoobSpeakable used.&lt;br /&gt;
&lt;br /&gt;
For the &amp;quot;Contribution&amp;quot; column, the first number is the amount of subtasks solved by XnoobSpeakable, the 2nd is the amount solved by Lúkos. Note that the counts are unequal, because Lúkos has a slower CPU with a lower core count. According to XnoobSpeakable, the time contribution from both contributors is roughly equal. Lúkos also worked on the Python scripts used, while XnoobSpeakable worked on compiling holdouts lists and finding optimal deciders to apply. &lt;br /&gt;
&lt;br /&gt;
[[User:Peacemaker II|Peacemaker II]] worked on verifying the validity of the results as well as providing solved TM counts per decider. Stages 1, 2, and 4 have been validated - no dropped TMs. XnoobSpeakable verified stage 6.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;nowiki&amp;gt;**&amp;lt;/nowiki&amp;gt;Stage 9: The two subtasks are seperate sub-stages, applying Reverse-Engineer and Backtracking deciders.&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1MamU8zivuqoe4j82vpb-jYBfc4wvXNRc All scripts used are available here.] The details will be given in this table:&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: left&amp;quot;&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
! colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |% Reduced&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Subtasks&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Contribution&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Verified&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |XnoobSpeakable, Lúkos&lt;br /&gt;
|434,787,751&lt;br /&gt;
|64,777,377&lt;br /&gt;
|85.1%&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Phase 2 stage 1&lt;br /&gt;
|8696&lt;br /&gt;
|7696 / 1000&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|64,777,377&lt;br /&gt;
|37,016,957&lt;br /&gt;
|42.9%&lt;br /&gt;
|Phase 2 stage 2&lt;br /&gt;
|1296&lt;br /&gt;
|1000 / 296&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|37,016,957&lt;br /&gt;
|26,266,261&lt;br /&gt;
|29.0%&lt;br /&gt;
|Phase 2 stage 3&lt;br /&gt;
|741&lt;br /&gt;
|741 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|26,266,261&lt;br /&gt;
|22,396,711&lt;br /&gt;
|14.7%&lt;br /&gt;
|Phase 2 stage 4&lt;br /&gt;
|526&lt;br /&gt;
|485 / 41&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|22,396,711&lt;br /&gt;
|17,983,810&lt;br /&gt;
|19.7%&lt;br /&gt;
|Phase 2 stage 5&lt;br /&gt;
|448&lt;br /&gt;
|390 / 58&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|17,983,810&lt;br /&gt;
|15,564,491&lt;br /&gt;
|13.5%&lt;br /&gt;
|Phase 2 stage 6&lt;br /&gt;
|360&lt;br /&gt;
|300 / 60&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|15,564,491&lt;br /&gt;
|15,136,283&lt;br /&gt;
|2.75%&lt;br /&gt;
|Phase 2 stage 7&lt;br /&gt;
|312&lt;br /&gt;
|260 / 52&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|15,136,283&lt;br /&gt;
|14,518,243&lt;br /&gt;
|4.08%&lt;br /&gt;
|Phase 2 stage 8&lt;br /&gt;
|303&lt;br /&gt;
|303 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|14,518,243&lt;br /&gt;
|14,413,460&lt;br /&gt;
|0.72%&lt;br /&gt;
|Phase 2 stage 9&lt;br /&gt;
|2**&lt;br /&gt;
|2 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|14,413,460&lt;br /&gt;
|13,733,388&lt;br /&gt;
|4.72%&lt;br /&gt;
|Phase 2 stage 10A&lt;br /&gt;
|289&lt;br /&gt;
|216 / 73&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 2 Data ==&lt;br /&gt;
Here we will list the deciders applied during the various stages of Phase 2. Each decider within a stage was not applied in a specific order. Some stages have a number of TMs solved by every decider at the end of each row, provided by Peacemaker II.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Details&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Phase 2 stage 1:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 1000 NG_n 2 run 86569103&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 1000 NG_n 1 run 26093656&lt;br /&gt;
chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 13972946&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 6 mod 3 n 2 run 7190617&lt;br /&gt;
chr_LRUH 10 chr_H 6 MitM_CTL NG maxT 1000 NG_n 2 run 90302784&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 1 n 4 run 4342619&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 12 H 0 tH 1 n 2 run 11764327&lt;br /&gt;
chr_LRUH 2 chr_H 2 MitM_CTL NG maxT 1000 NG_n 1 run 55465842&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 2 n 1 run 17805678&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 2 H 0 tH 0 n 1 run 12623067&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 3000 NG_n 2 run 2240499&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 4 H 1 tH 1 n 2 run 10223131&lt;br /&gt;
chr_LRUH 6 chr_H 4 MitM_CTL NG maxT 10000 NG_n 1 run 2901053&lt;br /&gt;
chr_LRUH 22 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 28515052&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 2:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 4 n 8 run 1030303&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 8 mod 2 n 2 run 1465523&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 10000 NG_n 4 run 5232902&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 1720994&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 8 mod 3 n 2 run 555883&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 3 H 1 tH 0 n 6 run 290547&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 1 run 67506&lt;br /&gt;
chr_LRUH 10 chr_H 8 MitM_CTL NG maxT 10000 NG_n 2 run 1577979&lt;br /&gt;
chr_LRUH 6 chr_H 6 MitM_CTL NG maxT 3000 NG_n 2 run 1604533&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 4 n 6 run 10012948&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 8 H 0 tH 0 n 4 run 526822&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 1 n 1 run 34821&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 6 H 0 tH 1 n 3 run 356375&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 20 run 1970422&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 6 mod 3 n 1 run 443339&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 3 H 0 tH 1 n 2 run 518824&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 2 mod 2 n 1 run 61865&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 1 tH 1 n 2 run 288834&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 3 (lr_enum_continue from [https://github.com/sligocki/busy-beaver busy-beaver] for 1 million steps):&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
lr_enum_continue ./in.txt 1000000 ./halt.txt ./inf.txt ./unknown.txt &amp;quot;&amp;quot; false&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 4:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 3000 NG_n 2 run 202520&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 3000 NG_n 1 run 559013&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 4 n 1 run 1584&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 10000 NG_n 1 run 148544&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 1 run 812666&lt;br /&gt;
chr_asth 0 chr_LRUH 48 chr_H 48 MitM_CTL NG maxT 10000 NG_n 3 run 2043171&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 4 mod 2 n 1 run 102052&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 5:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 0 tH 1 n 10 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 16 H 1 tH 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 6 n 2 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 10000 NG_n 3 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 5 n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 3 H 1 tH 0 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 3 mod 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 2 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 5 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 4 mod 4 n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 0 tH 1 n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 6 mod 3 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 2 MitM_CTL NG maxT 30000 NG_n 3 run&lt;br /&gt;
chr_LRUH 16 chr_H 12 MitM_CTL NG maxT 30000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 8 H 2 tH 1 n 2 run&lt;br /&gt;
chr_asth 0 chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 10000 NG_n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 16 H 1 tH 0 n 6 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 16 H 0 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 6 chr_H 2 MitM_CTL NG maxT 10000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 3 H 1 tH 0 n 2 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 2 mod 3 n 1 run&lt;br /&gt;
chr_LRUH 3 chr_H 1 MitM_CTL NG maxT 100000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 1 tH 0 n 4 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 2 mod 2 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 4 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 4 H 2 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 0 MitM_CTL NG maxT 1000 NG_n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 2 mod 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 3 mod 6 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 8 chr_H 8 MitM_CTL NG maxT 10000 NG_n 2 run&lt;br /&gt;
chr_asth 0 chr_LRUH 60 chr_H 60 MitM_CTL NG maxT 30000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 3 mod 2 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 4 H 1 tH 1 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 3 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 3000 NG_n 2 run&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 6:&lt;br /&gt;
&lt;br /&gt;
XnoobSpeakable ran Enumerate.py with a 0.15s/TM time limit, Lúkos ran it with a 0.75s/TM time limit.&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
python &amp;quot;+str(pl.Path(&amp;quot;../../Code/Enumerate.py&amp;quot;))+&amp;quot; --infile=&amp;quot;+str(pl.Path(&amp;quot;./in.txt&amp;quot;))+&amp;quot; --outfile=&amp;quot;+str(pl.Path(&amp;quot;./out.pb&amp;quot;))+&amp;quot; --max-loops=990_000 --tape-limit=9_900 --no-steps --time=&amp;quot;+str(time)+&amp;quot; --recursive --exp-linear-rules  --lin-steps=0 --no-ctl --save-freq=10_000&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 7:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 1000 NG_n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 12 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 1 mod 5 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 1000 NG_n 1 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 30000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 4 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 16 H 0 tH 1 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 3000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 4 H 0 tH 1 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 0 tH 2 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 12 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 1 mod 2 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 2 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 2 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 1 mod 3 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 1 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 2 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 6 H 0 tH 0 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 1000 NG_n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 100000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 1 mod 1 n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 2 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 30000 NG_n 1 run&lt;br /&gt;
&amp;lt;/pre&amp;gt;Phase 2 stage 8 (lr_enum_continue from [https://github.com/sligocki/busy-beaver busy-beaver] for 10 million steps):&amp;lt;pre&amp;gt;lr_enum_continue ./in.txt 10000000 ./halt.txt ./inf.txt ./unknown.txt &amp;quot;&amp;quot; false&amp;lt;/pre&amp;gt;Phase 2 stage 9a:&amp;lt;pre&amp;gt;python3 Code/Reverse_Engineer_Filter.py --infile=&#039;/home/xnoobspeakable/Desktop/Busy Beavers/BB(3,4)/resultsst8/3x4_holdouts_14518243.txt&#039; --outfile=&#039;out.txt&#039;&amp;lt;/pre&amp;gt;Phase 2 stage 9b:&amp;lt;pre&amp;gt;python3 ./Code/Backtracking_Filter.py --infile=&#039;/home/xnoobspeakable/Desktop/Busy Beavers/BB(3,4)/resultsst9/unknown.txt&#039;  --outfile=&#039;./b1.pb&#039; --steps=100&amp;lt;/pre&amp;gt;&lt;br /&gt;
&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
[[Category:BB Domains]][[Category:BB(3,4)]]&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=BB(3,4)&amp;diff=5650</id>
		<title>BB(3,4)</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=BB(3,4)&amp;diff=5650"/>
		<updated>2025-12-18T10:53:04Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: /* Phase 2 */ Stage 9&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;The Busy Beaver problem for 3 states and 4 symbols is unsolved, with the existence of [[Cryptids]] in the domain being given by the discovery of [[Bigfoot]] in [[BB(3,3)]]. The current BB(3,4) [[Champions#3-Symbol TMs|champion]] is {{TM|1RB3LB1RZ2RA_2LC3RB1LC2RA_3RB1LB3LC2RC|halt}}. It runs for &amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt; steps before halting. It was discovered by Pavel Kropitz in 2024 and was analysed by Shawn Ligocki in the same year.&lt;br /&gt;
&lt;br /&gt;
== Top Halters ==&lt;br /&gt;
The top 20 known longest running halting BB(3,4) TMs are:&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!Standard format&lt;br /&gt;
!(approximate) runtime&lt;br /&gt;
!Discoverer&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LB1RZ2RA_2LC3RB1LC2RA_3RB1LB3LC2RC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{15} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ1LA2RB_1RC3RC1LA2LB_2LB2RC1LC3RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{12} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3RB1LC2LA_2LA2RB1LB3RA_3LA1RZ1LC2RA}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{6} 5&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3RB1LC2LA_2LA2RB1LB3RA_1RA1RZ1LC2RA}}&lt;br /&gt;
|&amp;lt;math&amp;gt;2 \uparrow^{6} 4&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LB1RZ3LA_0LC3RB3RC1LB_2RB2LA3RA1LC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {2\,048}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Pavel Kropitz&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RZ1LA2RB_2RC3RC3LB2RA_2LB3RB3LC1LA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {189.05690}&amp;lt;/math&amp;gt;&lt;br /&gt;
|[[User:XnoobSpeakable|XnoobSpeakable]] &lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LA1RA2LB_2LC1RA2RC3RB_1RZ1LA2RA3RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {188.16168}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LB2LA3LC_1LA2RB3RA1LB_1RZ1RB2LB3LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {188.16168}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA3LA3RB_2LC2RC1LB2RA_2RA2RB0LB1RZ|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {149.57147}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LB1RZ3LA_1LA3RC2LC1LC_2LA3RC0RA1LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LB1RZ3LA_1LA3RC3LB1LC_2RA3RC0RA1LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LC1RC2RA_1LA3RA2RB1RZ_3LB2LC1RA0LB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {130.20142}&amp;lt;/math&amp;gt;&lt;br /&gt;
|[[User:WarpedWartWars|Lúkos]]&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA1LB3RA_1RC3LB1LC1RC_2LA2RA1RZ0LA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {96.06390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1RA1LB3RA_1RC3LB1LC1RC_2LA2RA1RZ1RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {96.06390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LC0RA1RC_2LA1RZ3LA2RB_3LA0RA1LA0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {95.24590}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB3LC0RA1RC_2LA1RZ3LA2RB_3LA0RA3LB0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {95.24590}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2LA1RA1RC_1LA3LC3RB1RC_3LA1RZ3LB2RC|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {84.19957}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB0LB1RA2LB_2RC3LB3RB2LA_2LC1RZ1LA2RB|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {76.17604}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB1LA1RZ0LB_2LC2LB1RC1RB_3LA3LC0LC0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {74.18390}&amp;lt;/math&amp;gt;&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|-&lt;br /&gt;
|{{TM|1RB2RA1LA1LB_2RC3RB1RZ3LC_2LA1RC1RB0RA|halt}}&lt;br /&gt;
|&amp;lt;math&amp;gt;10 \uparrow\uparrow {69.55341}&amp;lt;/math&amp;gt;&lt;br /&gt;
|Lúkos&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 1 ==&lt;br /&gt;
The initial phase of enumeration and reduction of [[holdouts]] took place in December 2024 and was done by Terry Ligocki using the Ligockis&#039; C++ and Python codes. The initial enumerations generated 600,253,156,787 TMs of which 42,391,877,333 were holdout TMs. Also found were 202,014,400,019 halting TMs and 355,846,879,435 infinite TMs. The number of holdouts was reduced to 434,787,751 TMs (a 98.97% reduction).&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Phase 1 Info&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Two C++ programs were run before the filters in the table.&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
lr_enum 3 4 8 /dev/null /dev/null 3x4.unk.txt false&lt;br /&gt;
00 &amp;lt;= XX &amp;lt; 47: lr_enum_continue 3x4.in.XX 1000 /dev/null /dev/null 3x4.unk.txt.XX XX false&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Both do the initial enumeration and simple filtering. The &amp;quot;/dev/null&amp;quot; in both commands would be files where the halting and infinite TMs would be stored. The first command generates the TMs from a TNF tree for BB(3,4) of depth 8 and outputs the holdouts to 3x4.unk.txt. This file was then divided into 48 pieces, 3x4.in.XX, 0 &amp;lt;= XX &amp;lt; 47. The second commands (one for each XX) continues the enumeration by running each TM for 1,000 steps. It classifies each as halting, infinite, or unknown/holdout. Again, the halting and infinite TMs are &amp;quot;written&amp;quot; to /dev/null, i.e., they aren&#039;t saved. The holdouts are stored in 48 files: 3x4.unk.txt.XX.&lt;br /&gt;
&lt;br /&gt;
For these runs the first command generated a total of 22,366,747 TMs: 932,198 halting, 235,446 infinite, and 21,199,103 holdouts. The second took the 22,366,747 holdout TMs and generated a total of 600,253,156,787 TMs: 202,014,400,019 halting, 355,846,879,435 infinite, and 42,391,877,333 holdouts. These holdouts were used as a starting point of the filters below.&lt;br /&gt;
&lt;br /&gt;
The &amp;quot;Description&amp;quot; column in the table below contain the command run. Two options are not given, &amp;quot;--infile=...&amp;quot; and an &amp;quot;--outfile=...&amp;quot;. These are necessary and specify where to read and write the results, respectively. Note: The work flow was to divide the input holdouts into 48 pieces, run the command on each piece simultaneously on one of 48 cores, and then combine the 48 results into a group of holdouts.&lt;br /&gt;
&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The details are given in this table:&lt;br /&gt;
&lt;br /&gt;
(done to reduce column size:&lt;br /&gt;
&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;= % Reduced,&lt;br /&gt;
&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;= Runtime (hours),&lt;br /&gt;
&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;= Decided,&lt;br /&gt;
&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;= Processed)&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: right&amp;quot;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^1&amp;lt;/math&amp;gt;&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |&amp;lt;math&amp;gt;*^2&amp;lt;/math&amp;gt;&lt;br /&gt;
!colspan=&amp;quot;2&amp;quot; |TMs/sec/core&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
!rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
!&amp;lt;math&amp;gt;*^3&amp;lt;/math&amp;gt;&lt;br /&gt;
!&amp;lt;math&amp;gt;*^4&amp;lt;/math&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|42,391,877,333&lt;br /&gt;
|32,247,381,725&lt;br /&gt;
|23.93%&lt;br /&gt;
|788.0&lt;br /&gt;
|3,576.08&lt;br /&gt;
|14,943.74&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Reverse_Engineer_Filter.py&lt;br /&gt;
|rowspan=&amp;quot;8&amp;quot; style=&amp;quot;text-align:left&amp;quot; |[https://drive.google.com/drive/folders/1EsFw5DOjjZ6Xzjc8QgRa2YkInrsmFnLX?usp=drive_link Google Drive]&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|32,247,381,725&lt;br /&gt;
|12,789,441,316&lt;br /&gt;
|60.34%&lt;br /&gt;
|6,185.2&lt;br /&gt;
|873.85&lt;br /&gt;
|1,448.22&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=1&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|12,789,441,316&lt;br /&gt;
|4,332,283,583&lt;br /&gt;
|66.13%&lt;br /&gt;
|4,771.0&lt;br /&gt;
|492.39&lt;br /&gt;
|744.62&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=2&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|4,332,283,583&lt;br /&gt;
|2,796,143,404&lt;br /&gt;
|35.46%&lt;br /&gt;
|7,873.1&lt;br /&gt;
|54.20&lt;br /&gt;
|152.85&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --block-size=3&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|2,796,143,404&lt;br /&gt;
|1,398,734,288&lt;br /&gt;
|49.98%&lt;br /&gt;
|10,239.4&lt;br /&gt;
|37.91&lt;br /&gt;
|75.85&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Enumerate.py --max-loops=1_000 --block-size=2 --time=10 --lin-steps=0 --no-reverse-engineer --save-freq=10_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|1,398,734,288&lt;br /&gt;
|764,851,053&lt;br /&gt;
|45.32%&lt;br /&gt;
|3,203.1&lt;br /&gt;
|54.97&lt;br /&gt;
|121.30&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Enumerate.py --max-loops=10_000 --block-size=12 --no-steps --time=0.01 --lin-steps=0 --no-ctl --no-reverse-engineer --save-freq=10_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|764,851,053&lt;br /&gt;
|581,654,405&lt;br /&gt;
|23.95%&lt;br /&gt;
|1,925.3&lt;br /&gt;
|26.43&lt;br /&gt;
|110.35&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --min-block-size=4 --max-block-size=12 --max-steps=1_000&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |Terry Ligocki&lt;br /&gt;
|581,654,405&lt;br /&gt;
|434,787,751&lt;br /&gt;
|25.25%&lt;br /&gt;
|9,042.5&lt;br /&gt;
|4.51&lt;br /&gt;
|17.87&lt;br /&gt;
|style=&amp;quot;text-align:left&amp;quot; |CPS_Filter.py --min-block-size=4 --max-block-size=6 --max-steps=10_000&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 2 ==&lt;br /&gt;
XnoobSpeakable and Lúkos are working on applying mxdys&#039; deciders/parameters to the remaining holdouts. The previous holdouts list by Terry Ligocki was split up into 8696 files containing 50,000 holdouts each* (*the last one actually has 37,751) and the deciders were applied to the files individually. These files can be called subtasks. Lúkos made a Python script to compute the subtasks in parallel, based off of XnoobSpeakable&#039;s earlier imperfect script.&lt;br /&gt;
&lt;br /&gt;
Certain data such as TMs/sec/core is unavailable, because the amount of time the computation took was not kept track of.&lt;br /&gt;
&lt;br /&gt;
Stages 3 and 8 are lr_enum_continue computations to 1 million and 10 million steps respectively. Lúkos did not contribute to computing these stages, but rather created a Python script to compute them in bulk, which XnoobSpeakable used.&lt;br /&gt;
&lt;br /&gt;
For the &amp;quot;Contribution&amp;quot; column, the first number is the amount of subtasks solved by XnoobSpeakable, the 2nd is the amount solved by Lúkos. Note that the counts are unequal, because Lúkos has a slower CPU with a lower core count. According to XnoobSpeakable, the time contribution from both contributors is roughly equal. Lúkos also worked on the Python scripts used, while XnoobSpeakable worked on compiling holdouts lists and finding optimal deciders to apply. &lt;br /&gt;
&lt;br /&gt;
[[User:Peacemaker II|Peacemaker II]] worked on verifying the validity of the results as well as providing solved TM counts per decider. Stages 1, 2, and 4 have been validated - no dropped TMs. XnoobSpeakable verified stage 6.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;nowiki&amp;gt;**&amp;lt;/nowiki&amp;gt;Stage 9: The two subtasks are seperate sub-stages, applying Reverse-Engineer and Backtracking deciders.&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/drive/folders/1MamU8zivuqoe4j82vpb-jYBfc4wvXNRc All scripts used are available here.] The details will be given in this table:&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;text-align: left&amp;quot;&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Done by&lt;br /&gt;
! colspan=&amp;quot;2&amp;quot; |Holdout TMs&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |% Reduced&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Description&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Subtasks&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Contribution&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Data&lt;br /&gt;
! rowspan=&amp;quot;2&amp;quot; |Verified&lt;br /&gt;
|-&lt;br /&gt;
!Input&lt;br /&gt;
!Output&lt;br /&gt;
|-&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |XnoobSpeakable, Lúkos&lt;br /&gt;
|434,787,751&lt;br /&gt;
|64,777,377&lt;br /&gt;
|85.1%&lt;br /&gt;
| style=&amp;quot;text-align:left&amp;quot; |Phase 2 stage 1&lt;br /&gt;
|8696&lt;br /&gt;
|7696 / 1000&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|64,777,377&lt;br /&gt;
|37,016,957&lt;br /&gt;
|42.9%&lt;br /&gt;
|Phase 2 stage 2&lt;br /&gt;
|1296&lt;br /&gt;
|1000 / 296&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|37,016,957&lt;br /&gt;
|26,266,261&lt;br /&gt;
|29.0%&lt;br /&gt;
|Phase 2 stage 3&lt;br /&gt;
|741&lt;br /&gt;
|741 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|26,266,261&lt;br /&gt;
|22,396,711&lt;br /&gt;
|14.7%&lt;br /&gt;
|Phase 2 stage 4&lt;br /&gt;
|526&lt;br /&gt;
|485 / 41&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|22,396,711&lt;br /&gt;
|17,983,810&lt;br /&gt;
|19.7%&lt;br /&gt;
|Phase 2 stage 5&lt;br /&gt;
|448&lt;br /&gt;
|390 / 58&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|17,983,810&lt;br /&gt;
|15,564,491&lt;br /&gt;
|13.5%&lt;br /&gt;
|Phase 2 stage 6&lt;br /&gt;
|360&lt;br /&gt;
|300 / 60&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|Yes&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable, Lúkos&lt;br /&gt;
|15,564,491&lt;br /&gt;
|15,136,283&lt;br /&gt;
|2.75%&lt;br /&gt;
|Phase 2 stage 7&lt;br /&gt;
|312&lt;br /&gt;
|260 / 52&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|15,136,283&lt;br /&gt;
|14,518,243&lt;br /&gt;
|4.08%&lt;br /&gt;
|Phase 2 stage 8&lt;br /&gt;
|303&lt;br /&gt;
|303 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|-&lt;br /&gt;
|XnoobSpeakable&lt;br /&gt;
|14,518,243&lt;br /&gt;
|14,413,460&lt;br /&gt;
|0.72%&lt;br /&gt;
|Phase 2 stage 9&lt;br /&gt;
|2**&lt;br /&gt;
|2 / 0&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i Google Drive]&lt;br /&gt;
|No&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Phase 2 Data ==&lt;br /&gt;
Here we will list the deciders applied during the various stages of Phase 2. Each decider within a stage was not applied in a specific order. Some stages have a number of TMs solved by every decider at the end of each row, provided by Peacemaker II.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;div class=&amp;quot;toccolours mw-collapsible mw-collapsed&amp;quot;&amp;gt;&#039;&#039;&#039;Details&#039;&#039;&#039;&amp;lt;div class=&amp;quot;mw-collapsible-content&amp;quot;&amp;gt;&lt;br /&gt;
Phase 2 stage 1:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 1000 NG_n 2 run 86569103&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 1000 NG_n 1 run 26093656&lt;br /&gt;
chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 13972946&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 6 mod 3 n 2 run 7190617&lt;br /&gt;
chr_LRUH 10 chr_H 6 MitM_CTL NG maxT 1000 NG_n 2 run 90302784&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 1 n 4 run 4342619&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 12 H 0 tH 1 n 2 run 11764327&lt;br /&gt;
chr_LRUH 2 chr_H 2 MitM_CTL NG maxT 1000 NG_n 1 run 55465842&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 2 n 1 run 17805678&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 2 H 0 tH 0 n 1 run 12623067&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 3000 NG_n 2 run 2240499&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 4 H 1 tH 1 n 2 run 10223131&lt;br /&gt;
chr_LRUH 6 chr_H 4 MitM_CTL NG maxT 10000 NG_n 1 run 2901053&lt;br /&gt;
chr_LRUH 22 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 28515052&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 2:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 4 n 8 run 1030303&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 8 mod 2 n 2 run 1465523&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 10000 NG_n 4 run 5232902&lt;br /&gt;
chr_LRUH 18 chr_H 12 MitM_CTL NG maxT 3000 NG_n 2 run 1720994&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 8 mod 3 n 2 run 555883&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 3 H 1 tH 0 n 6 run 290547&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 1 run 67506&lt;br /&gt;
chr_LRUH 10 chr_H 8 MitM_CTL NG maxT 10000 NG_n 2 run 1577979&lt;br /&gt;
chr_LRUH 6 chr_H 6 MitM_CTL NG maxT 3000 NG_n 2 run 1604533&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 4 n 6 run 10012948&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 8 H 0 tH 0 n 4 run 526822&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 1 n 1 run 34821&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 6 H 0 tH 1 n 3 run 356375&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 20 run 1970422&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 6 mod 3 n 1 run 443339&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 3 H 0 tH 1 n 2 run 518824&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 2 mod 2 n 1 run 61865&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 1 tH 1 n 2 run 288834&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 3 (lr_enum_continue from [https://github.com/sligocki/busy-beaver busy-beaver] for 1 million steps):&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
lr_enum_continue ./in.txt 1000000 ./halt.txt ./inf.txt ./unknown.txt &amp;quot;&amp;quot; false&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 4:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 3000 NG_n 2 run 202520&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 3000 NG_n 1 run 559013&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 4 n 1 run 1584&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 10000 NG_n 1 run 148544&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 1 run 812666&lt;br /&gt;
chr_asth 0 chr_LRUH 48 chr_H 48 MitM_CTL NG maxT 10000 NG_n 3 run 2043171&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 4 mod 2 n 1 run 102052&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 5:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 0 tH 1 n 10 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 16 H 1 tH 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 6 n 2 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 10000 NG_n 3 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 5 n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 3 H 1 tH 0 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 3 mod 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 2 mod 3 n 2 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 5 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 4 mod 4 n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 0 tH 1 n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 1 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 6 mod 3 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 2 MitM_CTL NG maxT 30000 NG_n 3 run&lt;br /&gt;
chr_LRUH 16 chr_H 12 MitM_CTL NG maxT 30000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 8 H 2 tH 1 n 2 run&lt;br /&gt;
chr_asth 0 chr_LRUH 12 chr_H 12 MitM_CTL NG maxT 10000 NG_n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 16 H 1 tH 0 n 6 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 16 H 0 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 6 chr_H 2 MitM_CTL NG maxT 10000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 3 H 1 tH 0 n 2 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 2 mod 3 n 1 run&lt;br /&gt;
chr_LRUH 3 chr_H 1 MitM_CTL NG maxT 100000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 6 H 1 tH 0 n 4 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 2 mod 2 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 4 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 4 H 2 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 0 MitM_CTL NG maxT 1000 NG_n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 2 mod 1 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 3 mod 6 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 8 chr_H 8 MitM_CTL NG maxT 10000 NG_n 2 run&lt;br /&gt;
chr_asth 0 chr_LRUH 60 chr_H 60 MitM_CTL NG maxT 30000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 10000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 3 mod 2 n 1 run&lt;br /&gt;
chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 4 H 1 tH 1 n 2 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 1000 H 3 mod 3 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 4 chr_H 4 MitM_CTL NG maxT 3000 NG_n 2 run&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 6:&lt;br /&gt;
&lt;br /&gt;
XnoobSpeakable ran Enumerate.py with a 0.15s/TM time limit, Lúkos ran it with a 0.75s/TM time limit.&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
python &amp;quot;+str(pl.Path(&amp;quot;../../Code/Enumerate.py&amp;quot;))+&amp;quot; --infile=&amp;quot;+str(pl.Path(&amp;quot;./in.txt&amp;quot;))+&amp;quot; --outfile=&amp;quot;+str(pl.Path(&amp;quot;./out.pb&amp;quot;))+&amp;quot; --max-loops=990_000 --tape-limit=9_900 --no-steps --time=&amp;quot;+str(time)+&amp;quot; --recursive --exp-linear-rules  --lin-steps=0 --no-ctl --save-freq=10_000&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;br /&gt;
Phase 2 stage 7:&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 1000 NG_n 3 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 12 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 1 mod 5 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 1000 NG_n 1 run&lt;br /&gt;
chr_LRUH 2 chr_H 0 MitM_CTL NG maxT 30000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 4 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 30000 LRUH 16 H 0 tH 1 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 3000 NG_n 2 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 4 H 0 tH 1 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 16 H 0 tH 2 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 12 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 30000 H 1 mod 2 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 4 mod 2 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 2 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 100000 LRUH 3 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 1 mod 3 n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 3000 H 1 mod 1 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 3000 LRUH 2 H 0 tH 0 n 1 run&lt;br /&gt;
MitM_CTL CPS_LRU sim 1001 maxT 1000 LRUH 6 H 0 tH 0 n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 3000 NG_n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 1000 NG_n 1 run&lt;br /&gt;
chr_asth 0 chr_LRUH 1 chr_H 1 MitM_CTL NG maxT 100000 NG_n 1 run&lt;br /&gt;
MitM_CTL RWL_mod sim 1001 maxT 10000 H 1 mod 1 n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 1 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 100000 NG_n 2 run&lt;br /&gt;
chr_LRUH 0 chr_H 0 MitM_CTL NG maxT 30000 NG_n 1 run&lt;br /&gt;
&amp;lt;/pre&amp;gt;Phase 2 stage 8 (lr_enum_continue from [https://github.com/sligocki/busy-beaver busy-beaver] for 10 million steps):&amp;lt;pre&amp;gt;lr_enum_continue ./in.txt 10000000 ./halt.txt ./inf.txt ./unknown.txt &amp;quot;&amp;quot; false&amp;lt;/pre&amp;gt;Phase 2 stage 9a:&amp;lt;pre&amp;gt;python3 Code/Reverse_Engineer_Filter.py --infile=&#039;/home/xnoobspeakable/Desktop/Busy Beavers/BB(3,4)/resultsst8/3x4_holdouts_14518243.txt&#039; --outfile=&#039;out.txt&#039;&amp;lt;/pre&amp;gt;Phase 2 stage 9b:&amp;lt;pre&amp;gt;python3 ./Code/Backtracking_Filter.py --infile=&#039;/home/xnoobspeakable/Desktop/Busy Beavers/BB(3,4)/resultsst9/unknown.txt&#039;  --outfile=&#039;./b1.pb&#039; --steps=100&amp;lt;/pre&amp;gt;&lt;br /&gt;
&amp;lt;/div&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
[[Category:BB Domains]][[Category:BB(3,4)]]&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=Holdouts_lists&amp;diff=5568</id>
		<title>Holdouts lists</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=Holdouts_lists&amp;diff=5568"/>
		<updated>2025-12-13T18:36:32Z</updated>

		<summary type="html">&lt;p&gt;XnoobSpeakable: BB(3,4)&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;A &#039;&#039;&#039;holdout&#039;&#039;&#039; (or undecided machine) is a [[Turing machine]] for which it is not known whether the machine halts or not from all-0 input tape. Holdouts are the machines which [[Decider|deciders]] are yet unable to decide.&lt;br /&gt;
&lt;br /&gt;
Holdout lists are often shared by contributors. There is a [[#Downloadable Holdout Lists|Downloadable Holdout Lists]] table where people have added lists with no restriction or independent verification. For some of the entries there is a reference to a spreadsheet that documents what was run to achieve the result. For others, there is additional documentation on the specific BB pages. They may exclude known equivalent machines, whose halting status is implied by the halting status of another machine.&lt;br /&gt;
&lt;br /&gt;
The table with the &amp;quot;Number of holdouts&amp;quot; is based on the holdout lists listed in the table below it. Thus, some of these numbers have not been independently verified. All the zero entries (no remaining holdouts) have been verified.&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+Number of holdouts&lt;br /&gt;
!&lt;br /&gt;
!2-state&lt;br /&gt;
!3-state&lt;br /&gt;
!4-state&lt;br /&gt;
!5-state&lt;br /&gt;
!6-state&lt;br /&gt;
!7-state&lt;br /&gt;
|-&lt;br /&gt;
!2-symbol&lt;br /&gt;
|0&lt;br /&gt;
|0&lt;br /&gt;
|0&lt;br /&gt;
|0&lt;br /&gt;
|1,416&lt;br /&gt;
|20,405,295&lt;br /&gt;
|-&lt;br /&gt;
!3-symbol&lt;br /&gt;
|0&lt;br /&gt;
|6&lt;br /&gt;
|9,401,447&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
!4-symbol&lt;br /&gt;
|0&lt;br /&gt;
|14,518,243&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
!5-symbol&lt;br /&gt;
|75&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
!6-symbol&lt;br /&gt;
|870,085&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Downloadable Holdout Lists ==&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot;&lt;br /&gt;
|+&lt;br /&gt;
!BB space&lt;br /&gt;
!Date&lt;br /&gt;
!Shared by&lt;br /&gt;
!Number of holdouts&lt;br /&gt;
!File&lt;br /&gt;
!Notes&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(6)]]&lt;br /&gt;
|November 28th, 2025&lt;br /&gt;
|@mxdys&lt;br /&gt;
|1416&lt;br /&gt;
|[https://wiki.bbchallenge.org/w/images/9/98/BB6_holdouts_1416.txt BB6_holdouts_1416.txt]&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(6)]]&lt;br /&gt;
|November 22nd, 2025&lt;br /&gt;
|Robin Rovenszky&lt;br /&gt;
|~1534&lt;br /&gt;
|[https://docs.google.com/spreadsheets/d/10y2aMp9yZVLyN-nXAxgA25rw4EA_lJqn3Vxy2kB-m-U/edit?gid=1330361301#gid=1330361301 Google Sheets]&lt;br /&gt;
|Annotated list, including links to Discord discussions&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(6)]]&lt;br /&gt;
|November 14th, 2025&lt;br /&gt;
|@mxdys&lt;br /&gt;
|1534&lt;br /&gt;
|[https://wiki.bbchallenge.org/w/images/0/02/BB6_holdouts_1534.txt BB6_holdouts_1534.txt]&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(6)]]&lt;br /&gt;
|October 20th, 2025&lt;br /&gt;
|@mxdys&lt;br /&gt;
|1618&lt;br /&gt;
|[https://wiki.bbchallenge.org/w/images/e/e3/BB6_holdouts_1618.txt BB6 holdouts 1618.txt]&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(3,4)]]&lt;br /&gt;
|[https://drive.google.com/drive/folders/1_5j19qrvo1q7jN_c0pYnjBOrIXAP6b7i October 4th, 2025]&lt;br /&gt;
|@tjligocki&lt;br /&gt;
|64,777,377&lt;br /&gt;
|[https://drive.google.com/file/d/1I3s3w-T4NPLn-eCdaZLPgC2Mya51pyvH/view?usp=drive_link 3x4_holdouts_64777377.txt.gz]&lt;br /&gt;
|Work done by [[User:XnoobSpeakable|XnoobSpeakable]] and [[User:WarpedWartWars|Lúkos]].&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(7)]]&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1369339127652159509/1423806362072256676 October 4th, 2025]&lt;br /&gt;
|Andrew Ducharme&lt;br /&gt;
|22,721,168&lt;br /&gt;
|[https://drive.google.com/file/d/1xAFSPh6qAR8VxsF4QVipmdc0UpdPC1hn/view bb7_holdouts_22721168.txt.zip]&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(2,6)]]&lt;br /&gt;
|[https://drive.google.com/drive/folders/1TsSpW27x3LBlu5qmk-cjzCJzgo_3ehyT September 22nd, 2025]&lt;br /&gt;
|@tjligocki&lt;br /&gt;
|873,469&lt;br /&gt;
|[http://2x6_holdouts_873469.txt.zip 2x6_holdouts_873469.txt.zip]&lt;br /&gt;
|Work done by Andrew Ducharme.&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(6)]]&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1239205785913790465/1411308408220549140 August 30 2025]&lt;br /&gt;
|@mxdys&lt;br /&gt;
|2,592&lt;br /&gt;
|[[:File:BB6 holdouts 2592.txt|BB6 holdouts 2592.txt]]&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(6)]]&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1239205785913790465/1399783936019664896 July 29 2025]&lt;br /&gt;
|@mxdys&lt;br /&gt;
|2,728&lt;br /&gt;
|[[:File:BB6 holdouts 2728.txt|BB6 holdouts 2728.txt]]&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(2,5)]]&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1259770421046411285/1355593937531961365 March 29 2025]&lt;br /&gt;
|@mxdys&lt;br /&gt;
|83&lt;br /&gt;
|[[:File:BB2x5 Coq holdouts 83.txt]]&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(4,3)]]&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1084047886494470185/1320172124509311004  December 21, 2024]&lt;br /&gt;
|@tjligocki&lt;br /&gt;
|460,916,384&lt;br /&gt;
|[https://drive.google.com/file/d/1hKy0TuPuI62rN95j6ZLjXgE-Pue8tRsK/view?usp=drive_link 4x3_holdouts_460916384.txt.gz]&lt;br /&gt;
|[https://drive.google.com/drive/folders/1HBPZ17llVE_8wCy5FvRUFQ5MJsaYXAW-?usp=drive_link Google Drive directory for 4x3 TMs]&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(6)]]&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1239205785913790465/1310648046576730124 November 25, 2024 (@icy)]&lt;br /&gt;
|@tjligocki&lt;br /&gt;
|4,319&lt;br /&gt;
|[https://docs.google.com/spreadsheets/d/1grhW_0neb2I8TfceN5-v70_3W42Z2U159r9L6FhPGf8/edit?usp=sharing Spreadsheet of holdouts]&lt;br /&gt;
|Keeping track of BB(6) progress - informal.&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(3,3)]]&lt;br /&gt;
|November 10, 2024&lt;br /&gt;
|&lt;br /&gt;
|6&lt;br /&gt;
|[[:File:3x3 holdout 6.txt|3x3 holdout 6.txt]]&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(6)]]&lt;br /&gt;
|[https://discordapp.com/channels/960643023006490684/1239205785913790465/1304303803213942846 November 8, 2024]&lt;br /&gt;
|@mxdys&lt;br /&gt;
|4,408&lt;br /&gt;
|[[:File:BB6 holdouts 4408.txt|BB6_holdouts_4408.txt]]&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(2,6)]]&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/960643023530762341/1303219184221683733 November 4, 2024]&lt;br /&gt;
|@tjligocki&lt;br /&gt;
|22,302,296&lt;br /&gt;
|[https://drive.google.com/file/d/1xRLIjdiqImFP2SL38gvhxVlAaX0L1cYO/view?usp=drive_link 2x6_holdouts_22302296.txt.gz]&lt;br /&gt;
|[https://drive.google.com/drive/folders/1p9b5g-Id3WEMUYIwEnaKWRBGIW66ADjM?usp=drive_link Google Drive directory for 2x6 TMs]&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(3,4)]]&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/960643023530762341/1302767449476694188  November 3, 2024]&lt;br /&gt;
|@tjligocki&lt;br /&gt;
|434,787,751&lt;br /&gt;
|[https://drive.google.com/file/d/1PLzN3wLw-MRgk1OFmYh4RTwNc30nflR7/view?usp=drive_link 3x4_holdouts_434787751.txt.gz]&lt;br /&gt;
|[https://drive.google.com/drive/folders/1bZxl7jg5q9IVvHQNZwItx1kPusAWznZk?usp=drive_link Google Drive directory for 3x4 TMs]&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(6)]]&lt;br /&gt;
|[https://discordapp.com/channels/960643023006490684/1239205785913790465/1280185195877634098 September 2, 2024]&lt;br /&gt;
|@mxdys&lt;br /&gt;
|5394&lt;br /&gt;
|[[:File:BB6 holdouts 5394.txt]]&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(6)]]&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1239205785913790465/1269612923127599164 August 4, 2024]&lt;br /&gt;
|@mxdys&lt;br /&gt;
|5877&lt;br /&gt;
|[[:File:BB6 holdouts 5877.txt]]&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(6)]]&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1239205785913790465/1259131753176498216 July 6, 2024]&lt;br /&gt;
|@mxdys&lt;br /&gt;
|7296&lt;br /&gt;
|[[:File:BB6 holdouts 7296.txt]]&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(2,5)]]&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1084047886494470185/1252989316175499284 June 19, 2024]&lt;br /&gt;
|@mxdys&lt;br /&gt;
|217&lt;br /&gt;
|[[:File:2x5_holdouts_217.txt]]&lt;br /&gt;
|273 holdouts minus machines solved by CTL&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(2,5)]]&lt;br /&gt;
|June 15th 2024&lt;br /&gt;
|@dyuan01&lt;br /&gt;
| 273&lt;br /&gt;
|[[:File:2x5_holdouts_273.txt]]&lt;br /&gt;
|@Justin Blanchard&#039;s 499 holdouts minus machines solved by @mxdys&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(6)]]&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1239205785913790465/1250895665719148595 June 13, 2024]&lt;br /&gt;
|@tjligocki&lt;br /&gt;
| 12,091&lt;br /&gt;
|[[:File:BB6 holdouts 12091.txt]]&lt;br /&gt;
|Work done with @Shawn Ligocki&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(3,3)]]&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1084047886494470185/1249142547217907772 June 9, 2024]&lt;br /&gt;
|@Justin Blanchard&lt;br /&gt;
|22&lt;br /&gt;
|[[:File:3x3.todo.txt]], [[:File:Mugshots small.pdf]]&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|BB(6)&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1239205785913790465/1248708916381220954 June 7, 2024]&lt;br /&gt;
|@mxdys&lt;br /&gt;
|12,325&lt;br /&gt;
|[[:File:BB6 holdouts 12325.txt]]&lt;br /&gt;
|Some equivalent machines are removed.&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(5)]]&lt;br /&gt;
|June 2024&lt;br /&gt;
|BBChallenge&lt;br /&gt;
|0&lt;br /&gt;
|&lt;br /&gt;
|&#039;&#039;&#039;BB(5) is SOLVED!&#039;&#039;&#039;&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(2,5)]]&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1084047886494470185/1242679236142170203 May 22, 2024]&lt;br /&gt;
|@Justin Blanchard&lt;br /&gt;
|499&lt;br /&gt;
|[[:File:2x5.todo.txt]]&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(3,3)]]&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1084047886494470185/1116351783040716830 June 8, 2023]&lt;br /&gt;
|@Iijil&lt;br /&gt;
|925&lt;br /&gt;
|[[:File:2023 06 08.3x3.holdouts intersect sligocki iijil 925.txt]]&lt;br /&gt;
|Intersection of @sligocki and @Iijil from below&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(3,3)]]&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1084047886494470185/1116351783040716830 June 8, 2023]&lt;br /&gt;
|@Iijil&lt;br /&gt;
|2,480&lt;br /&gt;
|[[:File:2023 06 08.3x3.holdouts iijil 2380.txt]]&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(3,3)]]&lt;br /&gt;
|[https://discord.com/channels/960643023006490684/1084047886494470185/1116178334620070000 June 7, 2023]&lt;br /&gt;
|@sligocki&lt;br /&gt;
|2,417&lt;br /&gt;
|[[:File:2023 06 07.3x3.holdouts 2417.txt]]&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(6)]]&lt;br /&gt;
|May 27, 2023&lt;br /&gt;
|@sligocki&lt;br /&gt;
|181,851&lt;br /&gt;
|[https://drive.google.com/file/d/1YNwFCN6XJeDNKxxK5KbGHOAFOdIBvDb6/view?usp=drive_link 6x2.holdouts_181851.txt.gz]&lt;br /&gt;
|This was posted to the BBChallenge Forum (before Discord)&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(6)]]&lt;br /&gt;
|May 10, 2023&lt;br /&gt;
|@sligocki&lt;br /&gt;
|1,458,704&lt;br /&gt;
|[https://drive.google.com/file/d/14bDnBt0OwuHATFBiubc_5jub0220EyXf/view?usp=drive_link 6x2.holdouts_1458704.txt.gz]&lt;br /&gt;
|This was posted to the BBChallenge Forum (before Discord)&lt;br /&gt;
|-&lt;br /&gt;
|[[BB(5)]]&lt;br /&gt;
|[https://skelet.ludost.net/bb/nreg.html circa May 13th, 2003]&lt;br /&gt;
|Georgi Georgiev (Skelet)&lt;br /&gt;
|43&lt;br /&gt;
|[https://bbchallenge.org/skelet List of 43 holdouts]&lt;br /&gt;
|&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>XnoobSpeakable</name></author>
	</entry>
</feed>