TMBR: November 2026 - Revision history

Loader3229: /* Champions */

2026-11-10T12:11:47Z

Champions

← Older revision		Revision as of 12:11, 10 November 2026
Line 87:		Line 87:
	\|}		\|}

	* [[User:Loader3229]] discovered an array of champions based on Kropitz's current [[BB(3,4)]] champion, demonstrating the following bounds:		* [[User:Loader3229]] discovered an array of champions based on Kropitz's current [[BB(3,4)]] champion and Jacobzheng's former BB(11,3) champion, demonstrating the following bounds:
	** On November 1, BB(8,5) > <math>f_{\omega \cdot 2 + 1}(93)</math>.<sup>[https://discord.com/channels/960643023006490684/1084047886494470185/1566410612949385317]</sup> and BB(11,4) > <math>f_{\omega \cdot 2}(21)</math>.<sup>[https://discord.com/channels/960643023006490684/1084047886494470185/1566423230187700245]</sup>		** On November 1, BB(8,5) > <math>f_{\omega \cdot 2 + 1}(93)</math>.<sup>[https://discord.com/channels/960643023006490684/1084047886494470185/1566410612949385317]</sup> and BB(11,4) > <math>f_{\omega \cdot 2}(21)</math>.<sup>[https://discord.com/channels/960643023006490684/1084047886494470185/1566423230187700245]</sup>
	** On November 2, BB(4,6) > <math>f_{\omega + 2}(29)</math>, BB(5,6) > <math>f_{\omega + 3}(31)</math>, BB(6,6) > <math>f_{\omega \times 2}(36)</math> and BB(7,6) > <math>f_{\omega^2}(28)</math>.		** On November 2, BB(4,6) > <math>f_{\omega + 2}(29)</math>, BB(5,6) > <math>f_{\omega + 3}(31)</math>, BB(6,6) > <math>f_{\omega \times 2}(36)</math> and BB(7,6) > <math>f_{\omega^2}(28)</math>.

GregoryMorse: Unconditional NTT

2026-11-10T10:52:02Z

Unconditional NTT

← Older revision		Revision as of 10:52, 10 November 2026
Line 218:		Line 218:
	\| [[User:GregoryMorse\|GregoryMorse]], Claude		\| [[User:GregoryMorse\|GregoryMorse]], Claude
	\| November 9		\| November 9
	\| [https://github.com/GregoryMorse/NP-complete/blob/main/formal/ZP/MainNTT.lean Lean proof]: chain-circuit condition~~, assuming <code>PrimeEx</code>~~.		\| [https://github.com/GregoryMorse/NP-complete/blob/main/formal/ZP/MainNTT.lean Lean proof]: chain-circuit condition.
	\|-		\|-
	\| Twin prime conjecture		\| Twin prime conjecture

GregoryMorse: Standardize contributor names and BBB notation; shorten notes and retain direct proof links.

2026-11-09T20:03:56Z

Standardize contributor names and BBB notation; shorten notes and retain direct proof links.

Show changes

GregoryMorse at 19:01, 9 November 2026

2026-11-09T19:01:05Z

@@ Line 137: / Line 137: @@
 ***[[wikipedia:New_foundations|New Foundations]]
 ****On November 6, svennik-alt-account used ChatGPT 6 Astra to find a 210-state TM that halts iff New Foundations is inconsistent. This is accompanied by a Lean proof. This is also the smallest known TM which PA cannot prove is non-halting.
-** Computational Complexity Theory
-*** On November 1, GregoryMorse claimed to have found a 278-state machine that quasihalts iff P = NP, a 295-state machine that quasihalts iff P = PP, and a 291-state machine that quasihalts iff P = PSPACE.<sup>[https://discord.com/channels/960643023006490684/1385498968011575366/1566326998563823719]</sup>
+=== Computational Complexity Theory ===
 {| class="wikitable"

Svennik: /* Cryptids */

2026-11-09T04:24:44Z

Cryptids

← Older revision		Revision as of 04:24, 9 November 2026
Line 136:		Line 136:
	**** On November 1, charlie claimed to have used Claude to [https://github.com/calr3/tinycryptids/tree/main/zfc_nsymbols/mm0 formally] reduce the number of defined instructions required in a ZFC-independent TM to 375 (376 including the halting transition).		**** On November 1, charlie claimed to have used Claude to [https://github.com/calr3/tinycryptids/tree/main/zfc_nsymbols/mm0 formally] reduce the number of defined instructions required in a ZFC-independent TM to 375 (376 including the halting transition).
	***[[wikipedia:New_foundations\|New Foundations]]		***[[wikipedia:New_foundations\|New Foundations]]
	****On November 6, svennik-alt-account used ChatGPT 6 Astra to find a 210-state TM that halts iff New Foundations is inconsistent. This is accompanied ~~with~~ a Lean proof. This is also the smallest known TM which PA cannot prove is non-halting.		****On November 6, svennik-alt-account used ChatGPT 6 Astra to find a 210-state TM that halts iff New Foundations is inconsistent. This is accompanied by a Lean proof. This is also the smallest known TM which PA cannot prove is non-halting.
	** Computational Complexity Theory		** Computational Complexity Theory
	*** On November 1, GregoryMorse claimed to have found a 278-state machine that quasihalts iff P = NP, a 295-state machine that quasihalts iff P = PP, and a 291-state machine that quasihalts iff P = PSPACE.<sup>[https://discord.com/channels/960643023006490684/1385498968011575366/1566326998563823719]</sup>		*** On November 1, GregoryMorse claimed to have found a 278-state machine that quasihalts iff P = NP, a 295-state machine that quasihalts iff P = PP, and a 291-state machine that quasihalts iff P = PSPACE.<sup>[https://discord.com/channels/960643023006490684/1385498968011575366/1566326998563823719]</sup>

Svennik: /* Cryptids */ PA cannot determine BB(210)

2026-11-09T04:18:36Z

Cryptids: PA cannot determine BB(210)

← Older revision		Revision as of 04:18, 9 November 2026
Line 136:		Line 136:
	**** On November 1, charlie claimed to have used Claude to [https://github.com/calr3/tinycryptids/tree/main/zfc_nsymbols/mm0 formally] reduce the number of defined instructions required in a ZFC-independent TM to 375 (376 including the halting transition).		**** On November 1, charlie claimed to have used Claude to [https://github.com/calr3/tinycryptids/tree/main/zfc_nsymbols/mm0 formally] reduce the number of defined instructions required in a ZFC-independent TM to 375 (376 including the halting transition).
	***[[wikipedia:New_foundations\|New Foundations]]		***[[wikipedia:New_foundations\|New Foundations]]
	****On November 6, svennik-alt-account used ChatGPT 6 Astra to find a 210-state TM that halts iff New Foundations is inconsistent. This is accompanied with a Lean proof. This is also the smallest known TM which PA cannot prove ~~doesn't halt~~.		****On November 6, svennik-alt-account used ChatGPT 6 Astra to find a 210-state TM that halts iff New Foundations is inconsistent. This is accompanied with a Lean proof. This is also the smallest known TM which PA cannot prove is non-halting.
	** Computational Complexity Theory		** Computational Complexity Theory
	*** On November 1, GregoryMorse claimed to have found a 278-state machine that quasihalts iff P = NP, a 295-state machine that quasihalts iff P = PP, and a 291-state machine that quasihalts iff P = PSPACE.<sup>[https://discord.com/channels/960643023006490684/1385498968011575366/1566326998563823719]</sup>		*** On November 1, GregoryMorse claimed to have found a 278-state machine that quasihalts iff P = NP, a 295-state machine that quasihalts iff P = PP, and a 291-state machine that quasihalts iff P = PSPACE.<sup>[https://discord.com/channels/960643023006490684/1385498968011575366/1566326998563823719]</sup>

Svennik: /* Cryptids */

2026-11-09T04:17:44Z

Cryptids

← Older revision		Revision as of 04:17, 9 November 2026
Line 136:		Line 136:
	**** On November 1, charlie claimed to have used Claude to [https://github.com/calr3/tinycryptids/tree/main/zfc_nsymbols/mm0 formally] reduce the number of defined instructions required in a ZFC-independent TM to 375 (376 including the halting transition).		**** On November 1, charlie claimed to have used Claude to [https://github.com/calr3/tinycryptids/tree/main/zfc_nsymbols/mm0 formally] reduce the number of defined instructions required in a ZFC-independent TM to 375 (376 including the halting transition).
	***[[wikipedia:New_foundations\|New Foundations]]		***[[wikipedia:New_foundations\|New Foundations]]
	****On November 6, svennik-alt-account used ChatGPT 6 Astra to find a 210-state TM that halts iff New Foundations is inconsistent. This is accompanied with a Lean proof.		****On November 6, svennik-alt-account used ChatGPT 6 Astra to find a 210-state TM that halts iff New Foundations is inconsistent. This is accompanied with a Lean proof. This is also the smallest known TM which PA cannot prove doesn't halt.
	** Computational Complexity Theory		** Computational Complexity Theory
	*** On November 1, GregoryMorse claimed to have found a 278-state machine that quasihalts iff P = NP, a 295-state machine that quasihalts iff P = PP, and a 291-state machine that quasihalts iff P = PSPACE.<sup>[https://discord.com/channels/960643023006490684/1385498968011575366/1566326998563823719]</sup>		*** On November 1, GregoryMorse claimed to have found a 278-state machine that quasihalts iff P = NP, a 295-state machine that quasihalts iff P = PP, and a 291-state machine that quasihalts iff P = PSPACE.<sup>[https://discord.com/channels/960643023006490684/1385498968011575366/1566326998563823719]</sup>

Svennik: /* Cryptids */

2026-11-09T04:14:10Z

Cryptids

← Older revision		Revision as of 04:14, 9 November 2026
Line 135:		Line 135:
	*** [[wikipedia:Zermelo–Fraenkel_set_theory\|Zermelo-Frankel set theory]]		*** [[wikipedia:Zermelo–Fraenkel_set_theory\|Zermelo-Frankel set theory]]
	**** On November 1, charlie claimed to have used Claude to [https://github.com/calr3/tinycryptids/tree/main/zfc_nsymbols/mm0 formally] reduce the number of defined instructions required in a ZFC-independent TM to 375 (376 including the halting transition).		**** On November 1, charlie claimed to have used Claude to [https://github.com/calr3/tinycryptids/tree/main/zfc_nsymbols/mm0 formally] reduce the number of defined instructions required in a ZFC-independent TM to 375 (376 including the halting transition).
	**** On November 6, svennik-alt-account used ChatGPT 6 Astra to find a 210-state TM that halts iff New Foundations is inconsistent. This is accompanied with a Lean proof.		***[[wikipedia:New_foundations\|New Foundations]]
			****On November 6, svennik-alt-account used ChatGPT 6 Astra to find a 210-state TM that halts iff New Foundations is inconsistent. This is accompanied with a Lean proof.
	** Computational Complexity Theory		** Computational Complexity Theory
	*** On November 1, GregoryMorse claimed to have found a 278-state machine that quasihalts iff P = NP, a 295-state machine that quasihalts iff P = PP, and a 291-state machine that quasihalts iff P = PSPACE.<sup>[https://discord.com/channels/960643023006490684/1385498968011575366/1566326998563823719]</sup>		*** On November 1, GregoryMorse claimed to have found a 278-state machine that quasihalts iff P = NP, a 295-state machine that quasihalts iff P = PP, and a 291-state machine that quasihalts iff P = PSPACE.<sup>[https://discord.com/channels/960643023006490684/1385498968011575366/1566326998563823719]</sup>

Svennik: /* Cryptids */ New Foundations set theory

2026-11-09T04:12:40Z

Cryptids: New Foundations set theory

← Older revision		Revision as of 04:12, 9 November 2026
Line 135:		Line 135:
	*** [[wikipedia:Zermelo–Fraenkel_set_theory\|Zermelo-Frankel set theory]]		*** [[wikipedia:Zermelo–Fraenkel_set_theory\|Zermelo-Frankel set theory]]
	**** On November 1, charlie claimed to have used Claude to [https://github.com/calr3/tinycryptids/tree/main/zfc_nsymbols/mm0 formally] reduce the number of defined instructions required in a ZFC-independent TM to 375 (376 including the halting transition).		**** On November 1, charlie claimed to have used Claude to [https://github.com/calr3/tinycryptids/tree/main/zfc_nsymbols/mm0 formally] reduce the number of defined instructions required in a ZFC-independent TM to 375 (376 including the halting transition).
			**** On November 6, svennik-alt-account used ChatGPT 6 Astra to find a 210-state TM that halts iff New Foundations is inconsistent. This is accompanied with a Lean proof.
	** Computational Complexity Theory		** Computational Complexity Theory
	*** On November 1, GregoryMorse claimed to have found a 278-state machine that quasihalts iff P = NP, a 295-state machine that quasihalts iff P = PP, and a 291-state machine that quasihalts iff P = PSPACE.<sup>[https://discord.com/channels/960643023006490684/1385498968011575366/1566326998563823719]</sup>		*** On November 1, GregoryMorse claimed to have found a 278-state machine that quasihalts iff P = NP, a 295-state machine that quasihalts iff P = PP, and a 291-state machine that quasihalts iff P = PSPACE.<sup>[https://discord.com/channels/960643023006490684/1385498968011575366/1566326998563823719]</sup>

Merieke: fixed multiplication

2026-11-06T21:27:12Z

fixed multiplication

← Older revision		Revision as of 21:27, 6 November 2026
Line 89:		Line 89:
	* [[User:Loader3229]] discovered an array of champions based on Kropitz's current [[BB(3,4)]] champion, demonstrating the following bounds:		* [[User:Loader3229]] discovered an array of champions based on Kropitz's current [[BB(3,4)]] champion, demonstrating the following bounds:
	** On November 1, BB(8,5) > <math>f_{\omega \cdot 2 + 1}(93)</math>.<sup>[https://discord.com/channels/960643023006490684/1084047886494470185/1566410612949385317]</sup> and BB(11,4) > <math>f_{\omega \cdot 2}(21)</math>.<sup>[https://discord.com/channels/960643023006490684/1084047886494470185/1566423230187700245]</sup>		** On November 1, BB(8,5) > <math>f_{\omega \cdot 2 + 1}(93)</math>.<sup>[https://discord.com/channels/960643023006490684/1084047886494470185/1566410612949385317]</sup> and BB(11,4) > <math>f_{\omega \cdot 2}(21)</math>.<sup>[https://discord.com/channels/960643023006490684/1084047886494470185/1566423230187700245]</sup>
	** On November 2, BB(4,6) > <math>f_{\omega + 2}(29)</math>, BB(5,6) > <math>f_{\omega + 3}(31)</math>, BB(6,6) > <math>f_{\omega * 2}(36)</math> and BB(7,6) > <math>f_{\omega^2}(28)</math>.		** On November 2, BB(4,6) > <math>f_{\omega + 2}(29)</math>, BB(5,6) > <math>f_{\omega + 3}(31)</math>, BB(6,6) > <math>f_{\omega \times 2}(36)</math> and BB(7,6) > <math>f_{\omega^2}(28)</math>.
	** On November 3, BB(6,6) > <math>f_{\omega * 2}(89)</math>.		** On November 3, BB(6,6) > <math>f_{\omega * 2}(89)</math>.
	** On November 4, BB(7,6) > <math>f_{\omega^2}(63)</math>, BB(8,6) > <math>f_{\omega^2 + 1}(7)</math>, BB(3,7) > <math>f_{\omega + 1}(77)</math> and BB(4,7) > <math>f_{\omega + 2}(124)</math>		** On November 4, BB(7,6) > <math>f_{\omega^2}(63)</math>, BB(8,6) > <math>f_{\omega^2 + 1}(7)</math>, BB(3,7) > <math>f_{\omega + 1}(77)</math> and BB(4,7) > <math>f_{\omega + 2}(124)</math>
	* [[User:Jacobzheng]] discovered the following bounds:		* [[User:Jacobzheng]] discovered the following bounds:
	** On November 2, BB(20) > <math>f_{\omega + 7}^2(5)</math>.		** On November 2, BB(20) > <math>f_{\omega + 7}^2(5)</math>.
	** On November 4, BB(19) > <math>f_{\omega + 7}^2(5)</math> and BB(20) > <math>f_{\omega * 2}(f_{\omega + 2}^2(f_{10}(2))</math>.		** On November 4, BB(19) > <math>f_{\omega + 7}^2(5)</math> and BB(20) > <math>f_{\omega \times 2}(f_{\omega + 2}^2(f_{10}(2))</math>.
	* On November 4, Jeff Ketchersid used Claude and Gemini to discover the bounds BB(17) > <math>f_{\omega + 3}(9)</math>, BB(18) > <math>f_{\omega + 3}^4(9)</math> and BB(19) > <math>f_{\omega + 4}(f_{\omega + 2}(114))</math>.		* On November 4, Jeff Ketchersid used Claude and Gemini to discover the bounds BB(17) > <math>f_{\omega + 3}(9)</math>, BB(18) > <math>f_{\omega + 3}^4(9)</math> and BB(19) > <math>f_{\omega + 4}(f_{\omega + 2}(114))</math>.