{"slug":"hunter-self-supporting-generation","identifier":"hunter-self-supporting-generation","title":"Self-Supporting Generation by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"6f9572f429bafbfe348e6578ea13c1c3928df4503d967fe9b71dd93ed7449e59","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T15:32:31.078Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:41:41.681Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.inference_2","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q <-> R, R <-> S, S <-> T, T <-> U, U <-> P} |= ((((P & Q) & R) & S) & T) & U","sourceOffset":632,"scope":"Exact source sequent under finite two-valued propositional semantics. Source proposition meanings and Logic/Logos/God Ground are preserved separately; this checks the inference, not unencoded prose.","variables":["P","Q","R","S","T","U"],"premises":["P","P <-> Q","Q <-> R","R <-> S","S <-> T","T <-> U","U <-> P"],"conclusion":"((((P & Q) & R) & S) & T) & U","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!((((((v0 && (v0 == v1)) && (v1 == v2)) && (v2 == v3)) && (v3 == v4)) && (v4 == v5)) && (v5 == v0))) || (((((v0 && v1) && v2) && v3) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"inference_2","sourceStatement":"{P, P <-> Q, Q <-> R, R <-> S, S <-> T, T <-> U, U <-> P} |= ((((P & Q) & R) & S) & T) & U","sourceOffset":2306,"scope":"Exact source sequent under finite two-valued propositional semantics. Source proposition meanings and Logic/Logos/God Ground are preserved separately; this checks the inference, not unencoded prose.","variables":["P","Q","R","S","T","U"],"premises":["P","P <-> Q","Q <-> R","R <-> S","S <-> T","T <-> U","U <-> P"],"conclusion":"((((P & Q) & R) & S) & T) & U","status":"candidate","leanStatement":"theorem inference_2 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!((((((v0 && (v0 == v1)) && (v1 == v2)) && (v2 == v3)) && (v3 == v4)) && (v4 == v5)) && (v5 == v0))) || (((((v0 && v1) && v2) && v3) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_2\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_2"},{"id":"source_identity_rule","sourceStatement":"Logic is Logic","sourceOffset":2444,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"3c4a13a1108afb6a9968808c34a53bee1da0b52f6ab6489a8d14dd7a6557a1ab","bytes":3714},"Proof.lean":{"sha256":"1cb9620b5c62730148ca8669db3f4715051c86c544a0d4de7a74e2164f641c9d","bytes":1056},"lean-check.txt":{"sha256":"40b7da001d5d78d36b6960c8ae1b7c13a2ea6cf5f9da51ea55e40e490d78ea16","bytes":242}},"boundary":"Lean establishes the listed formal statements and dependencies. The exact authored source, Ground, known premise meanings, application validation and empirical evidence remain separately typed. No unencoded section is certified by a neighboring theorem.","currentSourceSha256":"6f9572f429bafbfe348e6578ea13c1c3928df4503d967fe9b71dd93ed7449e59","timestamp":"2026-10-03T10:42:55.000Z","timestampAuthority":"https://www.freetsa.org","manifestSha256":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4","url":"/proof-verification/hunter-self-supporting-generation","jsonUrl":"/proof-verification/hunter-self-supporting-generation.json","leanUrl":"/proof-verification/hunter-self-supporting-generation.lean","graph":{"@context":"https://schema.org","@type":"SoftwareSourceCode","@id":"https://mcbcore.net/proof-verification/hunter-self-supporting-generation#lean","name":"Lean 4 witness: Self-Supporting Generation by Maclain Hunter","url":"https://mcbcore.net/proof-verification/hunter-self-supporting-generation","dateCreated":"2026-10-03T10:37:05.082Z","dateModified":"2026-10-03T10:41:41.681Z","creator":{"@type":"Organization","name":"Replit Agent"},"programmingLanguage":{"@type":"ComputerLanguage","name":"Lean","version":"Lean (version 4.7.0, commit v4.7.0, Release)"},"author":{"@type":"Organization","name":"Replit Agent"},"description":"Lean establishes the listed formal statements and dependencies. The exact authored source, Ground, known premise meanings, application validation and empirical evidence remain separately typed. No unencoded section is certified by a neighboring theorem.","isBasedOn":{"@type":"CreativeWork","name":"Self-Supporting Generation by Maclain Hunter","author":{"@type":"Person","name":"Maclain Hunter"},"url":"https://mcbcore.net/proof-knowledge/hunter-self-supporting-generation","identifier":"hunter-self-supporting-generation"},"encoding":{"@type":"MediaObject","encodingFormat":"text/plain","contentUrl":"https://mcbcore.net/proof-verification/hunter-self-supporting-generation.lean"},"subjectOf":{"@type":"DigitalDocument","name":"Independently verified RFC 3161 existence timestamp","dateCreated":"2026-10-03T10:42:55.000Z","url":"https://mcbcore.net/proof-verification/timestamp.json"},"additionalProperty":[{"@type":"PropertyValue","name":"verificationStatus","value":"verified"},{"@type":"PropertyValue","name":"axiomFree","value":"true"},{"@type":"PropertyValue","name":"axiomDependencies","value":"[]"},{"@type":"PropertyValue","name":"theorems","value":"[\"HunterAuthored.inference_1\",\"HunterAuthored.inference_2\",\"HunterAuthored.source_identity_rule\"]"},{"@type":"PropertyValue","name":"sourceSha256","value":"6f9572f429bafbfe348e6578ea13c1c3928df4503d967fe9b71dd93ed7449e59"},{"@type":"PropertyValue","name":"releaseManifestSha256","value":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4"},{"@type":"PropertyValue","name":"sourceRecordedAt","value":"2026-10-02T15:32:31.078Z"},{"@type":"PropertyValue","name":"sourceDateMeaning","value":"Database registration time, not a claim of original handwritten authorship."},{"@type":"PropertyValue","name":"originalAuthoredAt","value":"null"},{"@type":"PropertyValue","name":"timestampAuthority","value":"https://www.freetsa.org"},{"@type":"PropertyValue","name":"timestampScope","value":"Independent cryptographic existence timestamp for the manifest and its content-addressed artifacts. Not legal notarization, an authorship adjudication, or a retroactive timestamp for handwritten work."},{"@type":"PropertyValue","name":"governingGround","value":"Logic / Logos / God"},{"@type":"PropertyValue","name":"formalizationAttribution","value":"Machine formalization by Replit Agent of Maclain Hunter's unchanged authored source"}]}}