Mira @_Mira___Mira_Someone else formalized my 254-state "halts iff ZFC is inconsistent" Turing Machine. Claude is really good for this, apparently. So the 254th Busy Beaver cannot be proven in ZFC. That leaves only the 238-state PA machine, which will probably come soon.
01259























