https://wiki.bbchallenge.org/w/index.php?action=history&feed=atom&title=User%3AGregoryMorse 2026-11-10T22:10:41Z Revision history for this page on the wiki MediaWiki 1.43.5 https://wiki.bbchallenge.org/w/index.php?title=User:GregoryMorse&diff=10519&oldid=prev 2026-11-10T10:52:43Z

<p>Unconditional NTT</p> <table style="background-color: #fff; color: #202122;" data-mw="interface"> <col class="diff-marker" /> <col class="diff-content" /> <col class="diff-marker" /> <col class="diff-content" /> <tr class="diff-title" lang="en"> <td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">← Older revision</td> <td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">Revision as of 10:52, 10 November 2026</td> </tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l46">Line 46:</td> <td colspan="2" class="diff-lineno">Line 46:</td></tr> <tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>| Linear-size NTT circuits</div></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>| Linear-size NTT circuits</div></td></tr> <tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>| 469</div></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>| 469</div></td></tr> <tr><td class="diff-marker" data-marker="−"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>| [https://github.com/GregoryMorse/NP-complete/blob/main/formal/ZP/MainNTT.lean Lean proof] <del style="font-weight: bold; text-decoration: none;">(assuming &lt;code&gt;PrimeEx&lt;/code&gt;)</del></div></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>| [https://github.com/GregoryMorse/NP-complete/blob/main/formal/ZP/MainNTT.lean Lean proof]</div></td></tr> <tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>|-</div></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>|-</div></td></tr> <tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>| Twin prime conjecture</div></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>| Twin prime conjecture</div></td></tr> <!-- diff cache key mediawiki:diff:1.41:old-10499:rev-10519:php=table --> </table>

GregoryMorse https://wiki.bbchallenge.org/w/index.php?title=User:GregoryMorse&diff=10499&oldid=prev 2026-11-09T20:14:57Z

<p>Created page with &quot;I am Gregory Morse, originally from Los Angeles, USA, and a PhD candidate and lecturer in the Department of Programming Languages and Compilers at Eötvös Loránd University (ELTE), Budapest, Hungary. My interests include algorithms, decompilation, self-modifying code, control-flow graphs and formal verification. == Contributions == === Guides === * <a href="/wiki/User:GregoryMorse/Computability_and_provability_guide" title="User:GregoryMorse/Computability and provability guide">Computability and provability guide</a> — computability, provabi...&quot;</p> <p><b>New page</b></p><div>I am Gregory Morse, originally from Los Angeles, USA, and a PhD candidate and lecturer in the Department of Programming Languages and Compilers at Eötvös Loránd University (ELTE), Budapest, Hungary. My interests include algorithms, decompilation, self-modifying code, control-flow graphs and formal verification.<br /> <br /> == Contributions ==<br /> <br /> === Guides ===<br /> * [[User:GregoryMorse/Computability and provability guide|Computability and provability guide]] — computability, provability, BB/BBB, the halting problem and logical independence.<br /> <br /> === Beeping machines ===<br /> Two-symbol, blank-tape [[Beeping Busy Beaver|beeping machines]] using a designated beep state, developed with Claude assistance. I completed the suite&#039;s Lean formalizations on 9 November 2026.<br /> <br /> {| class=&quot;wikitable&quot;<br /> ! Problem !! States !! Proof<br /> |-<br /> | P = NP<br /> | 278<br /> | [https://github.com/GregoryMorse/NP-complete/blob/main/formal/Solution.lean Lean proof]; [https://github.com/GregoryMorse/NP-complete/blob/main/formal/ZP/Hard.lean NP-completeness proof]<br /> |-<br /> | P = PSPACE<br /> | 291<br /> | [https://github.com/GregoryMorse/NP-complete/blob/main/formal/ZP/MainPS.lean Lean proof]<br /> |-<br /> | P = PP<br /> | 295<br /> | [https://github.com/GregoryMorse/NP-complete/blob/main/formal/ZP/MainPP.lean Lean proof]<br /> |-<br /> | NP = coNP<br /> | 317<br /> | [https://github.com/GregoryMorse/NP-complete/blob/main/formal/ZP/MainConp.lean Lean proof]<br /> |-<br /> | Integer factorization in P<br /> | 324<br /> | [https://github.com/GregoryMorse/NP-complete/blob/main/formal/ZP/MainF.lean Lean proof]<br /> |-<br /> | Discrete logarithms modulo primes in P<br /> | 400<br /> | [https://github.com/GregoryMorse/NP-complete/blob/main/formal/ZP/MainD.lean Lean proof]<br /> |-<br /> | Linear-time multiplication<br /> | 403<br /> | [https://github.com/GregoryMorse/NP-complete/blob/main/formal/ZP/MainMul.lean Lean proof] (queue-of-stacks model)<br /> |-<br /> | Graph isomorphism in P<br /> | 415<br /> | [https://github.com/GregoryMorse/NP-complete/blob/main/formal/ZP/MainG.lean Lean proof]<br /> |-<br /> | Linear-size NTT circuits<br /> | 469<br /> | [https://github.com/GregoryMorse/NP-complete/blob/main/formal/ZP/MainNTT.lean Lean proof] (assuming &lt;code&gt;PrimeEx&lt;/code&gt;)<br /> |-<br /> | Twin prime conjecture<br /> | 19<br /> | [https://github.com/GregoryMorse/NP-complete/blob/main/formal/ZP/MainTwin.lean Lean proof]; quasihalts iff the conjecture is false.<br /> |}<br /> <br /> The linked proofs state the precise language and machine-model formulations.<br /> <br /> === Wiki contributions ===<br /> * Machine and formalization entries in [[TMBR: November 2026]] and [[Cryptids#Beeping Busy Beaver|Cryptids]].<br /> * Clarification of beep-state and beep-transition conventions in [[Beeping Busy Beaver]].<br /> <br /> == Links ==<br /> * [https://grm.web.elte.hu/ Academic homepage]<br /> * [https://github.com/GregoryMorse GitHub]<br /> * [https://github.com/GregoryMorse/NP-complete Machine code and formalizations]</div>

GregoryMorse