TMBR: September 2025 - Revision history

RobinCodes: /* BB Adjacent */ Updated references for consistency

2026-04-11T18:18:27Z

BB Adjacent: Updated references for consistency

← Older revision		Revision as of 18:18, 11 April 2026
Line 81:		Line 81:
	[[File:Bug Game Example.png\|thumb\|An example of a Bug Game maze]]		[[File:Bug Game Example.png\|thumb\|An example of a Bug Game maze]]
	*@savask shared the [[Bug Game]] (and fast-growing <math>Bug(H,W)</math> function)		*@savask shared the [[Bug Game]] (and fast-growing <math>Bug(H,W)</math> function)
	**Optimal square mazes have been discovered up to Bug(7,7) = 218 by Katelyn Doucette using [[TNF]]-style search. [https://discord.com/channels/960643023006490684/1362008236118511758/1416593147210895491]		**Optimal square mazes have been discovered up to Bug(7,7) = 218 by Katelyn Doucette using [[TNF]]-style search.<sup>[https://discord.com/channels/960643023006490684/1362008236118511758/1416593147210895491 <nowiki>[1]</nowiki>]</sup>
	**Daniel Yuan found some long running mazes using a greedy algorithm including Bug(19,29) ≥ 11,160,428. [https://discord.com/channels/960643023006490684/1362008236118511758/1416241487452049469]		**Daniel Yuan found some long running mazes using a greedy algorithm including Bug(19,29) ≥ 11,160,428.<sup>[https://discord.com/channels/960643023006490684/1362008236118511758/1416241487452049469 <nowiki>[2]</nowiki>]</sup>
	**Daniel Yuan proved that <math>Bug(H,W) \le 4^{HW}</math>. [https://discord.com/channels/960643023006490684/1362008236118511758/1415874391199449088], [https://discord.com/channels/960643023006490684/1362008236118511758/1416144180039651401] ~~and~~ [https://discord.com/channels/960643023006490684/1362008236118511758/1416158428287602752]		**Daniel Yuan proved that <math>Bug(H,W) \le 4^{HW}</math>.<sup>[https://discord.com/channels/960643023006490684/1362008236118511758/1415874391199449088 <nowiki>[3]</nowiki>][https://discord.com/channels/960643023006490684/1362008236118511758/1416144180039651401 <nowiki>[4]</nowiki>][https://discord.com/channels/960643023006490684/1362008236118511758/1416158428287602752 <nowiki>[5]</nowiki>]</sup>
	*John Tromp proved <math>BB\lambda(350) > BMS^3(5)</math> ([https://discord.com/channels/960643023006490684/1355653587824283678/1413637783045542038 announcement on Discord], [https://github.com/tromp/AIT/blob/master/fast_growing_and_conjectures/bms.lam Code]). This is an improvement over the previous result requiring 404 bits. BMS(n) is a fast-growing function related to [https://googology.miraheze.org/wiki/Bashicu_matrix_system Bashicu Matrix System] and the evaluation of n-row, 2-column matrices <code>(0..0)(1..1)</code>.		*John Tromp proved <math>BB\lambda(350) > BMS^3(5)</math> ([https://discord.com/channels/960643023006490684/1355653587824283678/1413637783045542038 announcement on Discord], [https://github.com/tromp/AIT/blob/master/fast_growing_and_conjectures/bms.lam Code]). This is an improvement over the previous result requiring 404 bits. BMS(n) is a fast-growing function related to [https://googology.miraheze.org/wiki/Bashicu_matrix_system Bashicu Matrix System] and the evaluation of n-row, 2-column matrices <code>(0..0)(1..1)</code>.

RobinCodes: /* BB Adjacent */ Fixed "n-column, 2-row" -> "n-row, 2-column"

2025-10-04T07:59:19Z

BB Adjacent: Fixed "n-column, 2-row" -> "n-row, 2-column"

← Older revision		Revision as of 07:59, 4 October 2025
Line 84:		Line 84:
	**Daniel Yuan found some long running mazes using a greedy algorithm including Bug(19,29) ≥ 11,160,428. [https://discord.com/channels/960643023006490684/1362008236118511758/1416241487452049469]		**Daniel Yuan found some long running mazes using a greedy algorithm including Bug(19,29) ≥ 11,160,428. [https://discord.com/channels/960643023006490684/1362008236118511758/1416241487452049469]
	**Daniel Yuan proved that <math>Bug(H,W) \le 4^{HW}</math>. [https://discord.com/channels/960643023006490684/1362008236118511758/1415874391199449088], [https://discord.com/channels/960643023006490684/1362008236118511758/1416144180039651401] and [https://discord.com/channels/960643023006490684/1362008236118511758/1416158428287602752]		**Daniel Yuan proved that <math>Bug(H,W) \le 4^{HW}</math>. [https://discord.com/channels/960643023006490684/1362008236118511758/1415874391199449088], [https://discord.com/channels/960643023006490684/1362008236118511758/1416144180039651401] and [https://discord.com/channels/960643023006490684/1362008236118511758/1416158428287602752]
	*John Tromp proved <math>BB\lambda(350) > BMS^3(5)</math> ([https://discord.com/channels/960643023006490684/1355653587824283678/1413637783045542038 announcement on Discord], [https://github.com/tromp/AIT/blob/master/fast_growing_and_conjectures/bms.lam Code]). This is an improvement over the previous result requiring 404 bits. BMS(n) is a fast-growing function related to [https://googology.miraheze.org/wiki/Bashicu_matrix_system Bashicu Matrix System] and the evaluation of n-~~column~~, 2-~~row~~ matrices <code>(0..0)(1..1)</code>.		*John Tromp proved <math>BB\lambda(350) > BMS^3(5)</math> ([https://discord.com/channels/960643023006490684/1355653587824283678/1413637783045542038 announcement on Discord], [https://github.com/tromp/AIT/blob/master/fast_growing_and_conjectures/bms.lam Code]). This is an improvement over the previous result requiring 404 bits. BMS(n) is a fast-growing function related to [https://googology.miraheze.org/wiki/Bashicu_matrix_system Bashicu Matrix System] and the evaluation of n-row, 2-column matrices <code>(0..0)(1..1)</code>.

	== Interesting TMs ==		== Interesting TMs ==

Sligocki: /* Holdouts */ Remove 4x3 holdout reductions that were affected by a bug.

2025-10-02T06:23:16Z

Holdouts: Remove 4x3 holdout reductions that were affected by a bug.

← Older revision		Revision as of 06:23, 2 October 2025
Line 47:		Line 47:
	\|21,428,827		\|21,428,827
	\|96.1%		\|96.1%
	\|-
	~~\|[[BB(4,3)]]~~
	~~\|46,118,252~~
	~~\|460,916,384~~
	~~\|414,798,132~~
	~~\|90.0%~~
	\|}		\|}

Line 79:		Line 73:
	** Andrew Ducharme ran <code>lr_enum_continue</code> to 100 million steps and <code>Enumerate.py</code> with various block-multiples [https://discord.com/channels/960643023006490684/1084047886494470185/1419506101912866937 reducing the holdout count] to 873,469 TMs (9.96% reduction).		** Andrew Ducharme ran <code>lr_enum_continue</code> to 100 million steps and <code>Enumerate.py</code> with various block-multiples [https://discord.com/channels/960643023006490684/1084047886494470185/1419506101912866937 reducing the holdout count] to 873,469 TMs (9.96% reduction).
	** Peacemaker II found a new second place champion, halting at around <math>10\uparrow\uparrow19892</math> steps.		** Peacemaker II found a new second place champion, halting at around <math>10\uparrow\uparrow19892</math> steps.

	*[[BB(4,3)]]:
	** Terry Ligocki ran @mxdys' <code>main.exe</code> and [[BB(4,3)#Phase 2\|reduced holdouts]] from 460,916,384 to 97,701,052 TMs (78.80% reduction).
	** Andrew Ducharme <code>lr_enum_continue</code> to one million steps and <code>Enumerate.py</code> with various block-multiples to [https://discord.com/channels/960643023006490684/1084047886494470185/1422325962980196392 reduce the holdout list] to 46,118,252.

	*[[BB(3,4)]]:		*[[BB(3,4)]]:

Sligocki: Remove LIATA from lede as well.

2025-10-01T18:57:44Z

Remove LIATA from lede as well.

← Older revision		Revision as of 18:57, 1 October 2025
Line 5:		Line 5:
	The biggest news this month is that we publicly posted a preprint of our [[BB(5)]] paper: "[https://arxiv.org/abs/2509.12337 Determination of the fifth Busy Beaver value]" on arXiv on 15 Sep 2025. This represents over a year of work writing up the proof that BB(5) = 47,176,870.		The biggest news this month is that we publicly posted a preprint of our [[BB(5)]] paper: "[https://arxiv.org/abs/2509.12337 Determination of the fifth Busy Beaver value]" on arXiv on 15 Sep 2025. This represents over a year of work writing up the proof that BB(5) = 47,176,870.

	This month saw continued public attention with Ben Brubaker's [[BB(6)]] Quanta article reprinted in Wired. There were massive holdout reductions across 4 Busy Beaver domains with [[BB(2,6)]] seeing over a 96% reduction in holdouts! ~~A new theoretical framework ([[LIATA]]) was introduced generalizing [[BMO1]].~~ And the [[Bug Game]] was introduced and computed for small values. Next month will be our first themed focus months.		This month saw continued public attention with Ben Brubaker's [[BB(6)]] Quanta article reprinted in Wired. There were massive holdout reductions across 4 Busy Beaver domains with [[BB(2,6)]] seeing over a 96% reduction in holdouts! And the [[Bug Game]] was introduced and computed for small values. Next month will be our first themed focus months.

	== BB(3,3) Month ==		== BB(3,3) Month ==

Sligocki: Remove LIATA for now while we explore literature.

2025-10-01T18:56:29Z

Remove LIATA for now while we explore literature.

← Older revision		Revision as of 18:56, 1 October 2025
Line 87:		Line 87:
	**[[User:XnoobSpeakable\|XnoobSpeakable]] and [[User:WarpedWartWars\|Lúkos]] are working on the holdout list for BB(3,4), currently at ~435M TMs, using @mxdys' deciders with various parameters.		**[[User:XnoobSpeakable\|XnoobSpeakable]] and [[User:WarpedWartWars\|Lúkos]] are working on the holdout list for BB(3,4), currently at ~435M TMs, using @mxdys' deciders with various parameters.
	</div></div>		</div></div>

	~~== Theory ==~~
	~~[[Linear-Inequality Affine Transformation Automata]] (LIATA) were introduced as a generalization of the [[BMO1]] rules:~~

	* @Bard proved that 3 dimension LIATA are Turing complete: [https://discord.com/channels/960643023006490684/1239205785913790465/1420457986564030641]
	* @star proved that 2 dimension LIATA are Turing complete: [https://discord.com/channels/960643023006490684/1239205785913790465/1421271424588451915]
	* BMO1 is a 2d-LIATA so this provides some sense for the difficulty of the problem.

	== BB Adjacent ==		== BB Adjacent ==

Sligocki: Add Bug Game maze image

2025-10-01T18:54:51Z

Add Bug Game maze image

← Older revision		Revision as of 18:54, 1 October 2025
Line 96:		Line 96:

	== BB Adjacent ==		== BB Adjacent ==
			[[File:Bug Game Example.png\|thumb\|An example of a Bug Game maze]]
	*@savask shared the [[Bug Game]] (and fast-growing <math>Bug(H,W)</math> function)		*@savask shared the [[Bug Game]] (and fast-growing <math>Bug(H,W)</math> function)
	**Optimal square mazes have been discovered up to Bug(7,7) = 218 by Katelyn Doucette using [[TNF]]-style search. [https://discord.com/channels/960643023006490684/1362008236118511758/1416593147210895491]		**Optimal square mazes have been discovered up to Bug(7,7) = 218 by Katelyn Doucette using [[TNF]]-style search. [https://discord.com/channels/960643023006490684/1362008236118511758/1416593147210895491]

Sligocki: Add Sporadic TM family picture.

2025-10-01T17:42:31Z

Add Sporadic TM family picture.

← Older revision		Revision as of 17:42, 1 October 2025
Line 1:		Line 1:
	{{TMBRnav\|August 2025\|October 2025}}[[:Category:This Month in Beaver Research\|This Month in Beaver Research]] for September 2025.		{{TMBRnav\|August 2025\|October 2025}}
			[[File:BB(5) Sporadic TMs.png\|alt=Family picture of the 5-state Sporadic Machines (20,000-step space-time diagrams) which required individual Coq nonhalting proofs. All Sporadic Machines were also identified by Skelet as holdouts of his bbfind program. For better visibility, diagrams of counters (Skelet #10 and Shift Overflow Counters) have been represented using a tape of length 200 instead of 400, giving a zoomed-in effect.\|thumb\|"Family picture" of [[BB(5)]] Sporadic TMs from the arXiv preprint.]]
			[[:Category:This Month in Beaver Research\|This Month in Beaver Research]] for September 2025.

	The biggest news this month is that we publicly posted a preprint of our [[BB(5)]] paper: "[https://arxiv.org/abs/2509.12337 Determination of the fifth Busy Beaver value]" on arXiv on 15 Sep 2025. This represents over a year of work writing up the proof that BB(5) = 47,176,870.		The biggest news this month is that we publicly posted a preprint of our [[BB(5)]] paper: "[https://arxiv.org/abs/2509.12337 Determination of the fifth Busy Beaver value]" on arXiv on 15 Sep 2025. This represents over a year of work writing up the proof that BB(5) = 47,176,870.

Sligocki: /* BB Adjacent */ Some final editing including removing last TODO

2025-10-01T17:10:56Z

BB Adjacent: Some final editing including removing last TODO

← Older revision		Revision as of 17:10, 1 October 2025
Line 1:		Line 1:
	{{TMBRnav\|August 2025\|October 2025}}		{{TMBRnav\|August 2025\|October 2025}}[[:Category:This Month in Beaver Research\|This Month in Beaver Research]] for September 2025.
	:<div class="notice metadata plainlinks" id="stub">''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).''</div>

	[[:Category:This Month in Beaver Research\|This Month in Beaver Research]] for September 2025.

	The biggest news this month is that we publicly posted a preprint of our [[BB(5)]] paper: "[https://arxiv.org/abs/2509.12337 Determination of the fifth Busy Beaver value]" on arXiv on 15 Sep 2025. This represents over a year of work writing up the proof that BB(5) = 47,176,870.		The biggest news this month is that we publicly posted a preprint of our [[BB(5)]] paper: "[https://arxiv.org/abs/2509.12337 Determination of the fifth Busy Beaver value]" on arXiv on 15 Sep 2025. This represents over a year of work writing up the proof that BB(5) = 47,176,870.

	This month saw continued public attention with Ben Brubaker's [[BB(6)]] Quanta article reprinted in Wired. There were massive holdout reductions across 4 Busy Beaver domains with [[BB(2,6)]] seeing over a 96% reduction in holdouts! A new theoretical framework ([[LIATA]]) was introduced generalizing [[BMO1]]. And the [[Bug Game]] was introduced and ~~explored~~ for small values.		This month saw continued public attention with Ben Brubaker's [[BB(6)]] Quanta article reprinted in Wired. There were massive holdout reductions across 4 Busy Beaver domains with [[BB(2,6)]] seeing over a 96% reduction in holdouts! A new theoretical framework ([[LIATA]]) was introduced generalizing [[BMO1]]. And the [[Bug Game]] was introduced and computed for small values. Next month will be our first themed focus months.

	== BB(3,3) Month ==		== BB(3,3) Month ==
	October 2025 will be [[BB(3,3)]] month. The goal is to significantly reduce the remaining 10 holdouts in this domain. Because one holdout ([[Bigfoot]]) is a probviously non-halting [[cryptid]], we likely will not solve BB(3,3) this month. An ambitious but potentially achievable goal, however, is to reduce the holdout list to three: Bigfoot, [[Wily Coyote]], and {{TM\|1RB0LB0RC_2LC2LA1RA_1RA1LC---\|undecided}} (the probvious champion). Intermediate goals include confirming the longitudinal analyses of four holdouts performed by LegionMammal, applying new high-speed Hydra iterations to further forward simulate Bigfoot, and eliminating possible halting configurations for Wily Coyote. Project coordination will happen on [[bbchallenge]] Discord server's <code>#bb3x3</code> channel.		October 2025 will be [[BB(3,3)]] month. The goal is to significantly reduce the remaining 10 holdouts in this domain. Because one holdout ([[Bigfoot]]) is a probviously non-halting [[cryptid]], we likely will not solve BB(3,3) this month. An ambitious but potentially achievable goal, however, is to reduce the holdout list to three: Bigfoot, [[Wily Coyote]], and {{TM\|1RB0LB0RC_2LC2LA1RA_1RA1LC---\|undecided}} (the probvious champion). Intermediate goals include confirming the longitudinal analyses of four holdouts performed by LegionMammal, applying new high-speed Hydra iterations to further forward simulate Bigfoot, and eliminating possible halting configurations for Wily Coyote. Project coordination will happen on [[bbchallenge]] Discord server's <code>#bb3x3</code> channel. Anyone who is interested is welcome to join!

	==In the News==		==In the News==
Line 95:		Line 92:
	* @star proved that 2 dimension LIATA are Turing complete: [https://discord.com/channels/960643023006490684/1239205785913790465/1421271424588451915]		* @star proved that 2 dimension LIATA are Turing complete: [https://discord.com/channels/960643023006490684/1239205785913790465/1421271424588451915]
	* BMO1 is a 2d-LIATA so this provides some sense for the difficulty of the problem.		* BMO1 is a 2d-LIATA so this provides some sense for the difficulty of the problem.
	** This is analogous to how Conway proved that generalized collatz maps are Turing complete which suggests the difficulty with solving Collatz-like problems.
	** But, like Conway's proof, it does not say anything concrete about any specific 2d-LIATA problem.

	== BB Adjacent ==		== BB Adjacent ==
Line 103:		Line 98:
	**Daniel Yuan found some long running mazes using a greedy algorithm including Bug(19,29) ≥ 11,160,428. [https://discord.com/channels/960643023006490684/1362008236118511758/1416241487452049469]		**Daniel Yuan found some long running mazes using a greedy algorithm including Bug(19,29) ≥ 11,160,428. [https://discord.com/channels/960643023006490684/1362008236118511758/1416241487452049469]
	**Daniel Yuan proved that <math>Bug(H,W) \le 4^{HW}</math>. [https://discord.com/channels/960643023006490684/1362008236118511758/1415874391199449088], [https://discord.com/channels/960643023006490684/1362008236118511758/1416144180039651401] and [https://discord.com/channels/960643023006490684/1362008236118511758/1416158428287602752]		**Daniel Yuan proved that <math>Bug(H,W) \le 4^{HW}</math>. [https://discord.com/channels/960643023006490684/1362008236118511758/1415874391199449088], [https://discord.com/channels/960643023006490684/1362008236118511758/1416144180039651401] and [https://discord.com/channels/960643023006490684/1362008236118511758/1416158428287602752]
	*John Tromp proved <math>BB\lambda(350) > BMS^3(5)</math> ([https://discord.com/channels/960643023006490684/1355653587824283678/1413637783045542038 announcement on Discord], [https://github.com/tromp/AIT/blob/master/fast_growing_and_conjectures/bms.lam Code]). This is an improvement over the previous result requiring 404 bits. (~~TODO~~: ~~clarify what BMS is~~ and ~~if this function notation is standard~~).		*John Tromp proved <math>BB\lambda(350) > BMS^3(5)</math> ([https://discord.com/channels/960643023006490684/1355653587824283678/1413637783045542038 announcement on Discord], [https://github.com/tromp/AIT/blob/master/fast_growing_and_conjectures/bms.lam Code]). This is an improvement over the previous result requiring 404 bits. BMS(n) is a fast-growing function related to [https://googology.miraheze.org/wiki/Bashicu_matrix_system Bashicu Matrix System] and the evaluation of n-column, 2-row matrices <code>(0..0)(1..1)</code>.

	== Interesting TMs ==		== Interesting TMs ==

	* {{TM\|1RB1RF_1RC0RA_1LD1RC_1LE0LE_0RA0LD_0RB---}}: [[Beaver Math Olympiad#7. 1RB1RF 1RC0RA 1LD1RC 1LE0LE 0RA0LD 0RB--- (bbch)\|BMO7]] ([https://discord.com/channels/960643023006490684/1421782442213376000/1421782442213376000 Discord thread])		* {{TM\|1RB1RF_1RC0RA_1LD1RC_1LE0LE_0RA0LD_0RB---}} [[Beaver Math Olympiad#7. 1RB1RF 1RC0RA 1LD1RC 1LE0LE 0RA0LD 0RB--- (bbch)\|BMO7]] is the newest [[Beaver Math Olympiad]] problem. Some promising patterns have been noticed on the [https://discord.com/channels/960643023006490684/1421782442213376000/1421782442213376000 Discord thread].

	[[Category:This Month in Beaver Research\|2025-09]]		[[Category:This Month in Beaver Research\|2025-09]]

Sligocki: Move BB(3,3) month stuff to it's own section.

2025-09-30T22:05:30Z

Move BB(3,3) month stuff to it's own section.

← Older revision		Revision as of 22:05, 30 September 2025
Line 8:		Line 8:
	This month saw continued public attention with Ben Brubaker's [[BB(6)]] Quanta article reprinted in Wired. There were massive holdout reductions across 4 Busy Beaver domains with [[BB(2,6)]] seeing over a 96% reduction in holdouts! A new theoretical framework ([[LIATA]]) was introduced generalizing [[BMO1]]. And the [[Bug Game]] was introduced and explored for small values.		This month saw continued public attention with Ben Brubaker's [[BB(6)]] Quanta article reprinted in Wired. There were massive holdout reductions across 4 Busy Beaver domains with [[BB(2,6)]] seeing over a 96% reduction in holdouts! A new theoretical framework ([[LIATA]]) was introduced generalizing [[BMO1]]. And the [[Bug Game]] was introduced and explored for small values.

	October 2025 will be [[BB(3,3)]] month. The goal is to significantly reduce the remaining 10 holdouts in this domain. Because one holdout ([[Bigfoot]]) is a probviously non-halting [[cryptid]], we likely will not solve BB(3,3) this month. An ambitious but potentially achievable goal, however, is to reduce the holdout list to three: Bigfoot, ~~{{TM\|1RB2LA1LA_2LA0RA2RC_---0LC2RA\|undecided}}~~, and {{TM\|1RB0LB0RC_2LC2LA1RA_1RA1LC---\|undecided}}. Intermediate goals include confirming the longitudinal analyses of four holdouts performed by LegionMammal, applying new high-speed Hydra iterations to further forward simulate Bigfoot, and eliminating possible halting configurations for ~~{{TM\|1RB2LA1LA_2LA0RA2RC_---0LC2RA\|undecided}}~~.		== BB(3,3) Month ==
			October 2025 will be [[BB(3,3)]] month. The goal is to significantly reduce the remaining 10 holdouts in this domain. Because one holdout ([[Bigfoot]]) is a probviously non-halting [[cryptid]], we likely will not solve BB(3,3) this month. An ambitious but potentially achievable goal, however, is to reduce the holdout list to three: Bigfoot, [[Wily Coyote]], and {{TM\|1RB0LB0RC_2LC2LA1RA_1RA1LC---\|undecided}} (the probvious champion). Intermediate goals include confirming the longitudinal analyses of four holdouts performed by LegionMammal, applying new high-speed Hydra iterations to further forward simulate Bigfoot, and eliminating possible halting configurations for Wily Coyote. Project coordination will happen on [[bbchallenge]] Discord server's <code>#bb3x3</code> channel.

	==In the News==		==In the News==

ADucharme: /* Holdouts */ updated details for 2x6, 4x3 reductions

2025-09-30T21:37:01Z

Holdouts: updated details for 2x6, 4x3 reductions

← Older revision		Revision as of 21:37, 30 September 2025
Line 75:		Line 75:
	* [[BB(2,6)]]:		* [[BB(2,6)]]:
	** [https://discord.com/channels/960643023006490684/1084047886494470185/1415184724707639377 An error was noticed] in the BB(2,6) holdout reduction reported last month. It was decided to start back at the original 22,302,296 holdout TMs.		** [https://discord.com/channels/960643023006490684/1084047886494470185/1415184724707639377 An error was noticed] in the BB(2,6) holdout reduction reported last month. It was decided to start back at the original 22,302,296 holdout TMs.
	** Andrew Ducharme ran <code>lr_enum_continue</code> and [https://discord.com/channels/960643023006490684/1084047886494470185/1415871302274777269 reduced] the 22,302,296 holdout TMs to 20,358,011 (8.72% reduction).		** Andrew Ducharme ran <code>lr_enum_continue</code> to 10 million steps and [https://discord.com/channels/960643023006490684/1084047886494470185/1415871302274777269 reduced] the 22,302,296 holdout TMs to 20,358,011 (8.72% reduction).
	** Terry Ligocki ran 50 variations of deciders/parameters using @mxdys' C++ code, <code>main.exe</code>, [https://discord.com/channels/960643023006490684/1084047886494470185/1417287770774307037 reducing the holdout count] to 970,101 TMs (95.23% reduction)!		** Terry Ligocki ran 50 variations of deciders/parameters using @mxdys' C++ code, <code>main.exe</code>, [https://discord.com/channels/960643023006490684/1084047886494470185/1417287770774307037 reducing the holdout count] to 970,101 TMs (95.23% reduction)!
	** Andrew Ducharme ran <code>Enumerate.py</code> [https://discord.com/channels/960643023006490684/1084047886494470185/1419506101912866937 reducing the holdout count] to 873,469 TMs (9.96% reduction).		** Andrew Ducharme ran <code>lr_enum_continue</code> to 100 million steps and <code>Enumerate.py</code> with various block-multiples [https://discord.com/channels/960643023006490684/1084047886494470185/1419506101912866937 reducing the holdout count] to 873,469 TMs (9.96% reduction).
	** Peacemaker II found a new second place champion, halting at around <math>10\uparrow\uparrow19892</math> steps.		** Peacemaker II found a new second place champion, halting at around <math>10\uparrow\uparrow19892</math> steps.

	*[[BB(4,3)]]:		*[[BB(4,3)]]:
	** Terry Ligocki ran @mxdys' <code>main.exe</code> and [[BB(4,3)#Phase 2\|reduced holdouts]] from 460,916,384 to 97,701,052 TMs (78.80% reduction).		** Terry Ligocki ran @mxdys' <code>main.exe</code> and [[BB(4,3)#Phase 2\|reduced holdouts]] from 460,916,384 to 97,701,052 TMs (78.80% reduction).
	** Andrew Ducharme [https://discord.com/channels/960643023006490684/1084047886494470185/1422325962980196392 ~~reduced~~ the holdout list] to 46,118,252 ~~using <code>Enumerate.py</code>~~.		** Andrew Ducharme <code>lr_enum_continue</code> to one million steps and <code>Enumerate.py</code> with various block-multiples to [https://discord.com/channels/960643023006490684/1084047886494470185/1422325962980196392 reduce the holdout list] to 46,118,252.

	*[[BB(3,4)]]:		*[[BB(3,4)]]:
	**[[User:XnoobSpeakable\|XnoobSpeakable]] and [[User:WarpedWartWars\|Lúkos]] are working on the holdout list for BB(3,4), ~435M TMs, using @mxdys' deciders with various parameters.		**[[User:XnoobSpeakable\|XnoobSpeakable]] and [[User:WarpedWartWars\|Lúkos]] are working on the holdout list for BB(3,4), currently at ~435M TMs, using @mxdys' deciders with various parameters.
	</div></div>		</div></div>