{"slug":"hunter-aep-optimized-coherence","identifier":"hunter-aep-optimized-coherence","title":"AEP and Optimized Coherence","author":"Maclain Hunter","sourceSha256":"00d5334148e3844d08651db1aa5dbb3db943efabd073a7ae7c961e18a1353308","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:43:25.142Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:14.230Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R} |= P -> (R <-> Q)","sourceOffset":230,"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"],"premises":["P","P -> Q","Q -> R"],"conclusion":"P -> (R <-> Q)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && ((!v1) || v2))) || ((!v0) || (v2 == v1))) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"490c54ee8e207243b53ee76cd36042fb565d4bf907578d12751c4b69c7bf2ca9","bytes":853},"Proof.lean":{"sha256":"986afdf75206b6b43547593f0da38d2325b00c24d623663673be306117a967da","bytes":481},"lean-check.txt":{"sha256":"283a8aa40f54008e4bfc528069537344fae9f76a8d2f62b37f48d942b98ba62c","bytes":115}},"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":"00d5334148e3844d08651db1aa5dbb3db943efabd073a7ae7c961e18a1353308","timestamp":"2026-10-03T10:42:55.000Z","timestampAuthority":"https://www.freetsa.org","manifestSha256":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4","url":"/proof-verification/hunter-aep-optimized-coherence","jsonUrl":"/proof-verification/hunter-aep-optimized-coherence.json","leanUrl":"/proof-verification/hunter-aep-optimized-coherence.lean","graph":{"@context":"https://schema.org","@type":"SoftwareSourceCode","@id":"https://mcbcore.net/proof-verification/hunter-aep-optimized-coherence#lean","name":"Lean 4 witness: AEP and Optimized Coherence","url":"https://mcbcore.net/proof-verification/hunter-aep-optimized-coherence","dateCreated":"2026-10-03T10:37:05.082Z","dateModified":"2026-10-03T10:37:14.230Z","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":"AEP and Optimized Coherence","author":{"@type":"Person","name":"Maclain Hunter"},"url":"https://mcbcore.net/proof-knowledge/hunter-aep-optimized-coherence","identifier":"hunter-aep-optimized-coherence"},"encoding":{"@type":"MediaObject","encodingFormat":"text/plain","contentUrl":"https://mcbcore.net/proof-verification/hunter-aep-optimized-coherence.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\"]"},{"@type":"PropertyValue","name":"sourceSha256","value":"00d5334148e3844d08651db1aa5dbb3db943efabd073a7ae7c961e18a1353308"},{"@type":"PropertyValue","name":"releaseManifestSha256","value":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4"},{"@type":"PropertyValue","name":"sourceRecordedAt","value":"2026-10-02T23:43:25.142Z"},{"@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"}]}}