{"slug":"hunter-mspp-original-design","identifier":"hunter-mspp-original-design","title":"Machine Semantics Programming Platform Designed by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"7708862fbb4faeed369931fa1c0cc59ea96b840fad81ec6702e4197cbfebf3d0","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T21:22:45.308Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:02.706Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.inference_2"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R, R -> S, S -> T} |= ((P & Q) -> (R & S)) -> T","sourceOffset":3044,"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"],"premises":["P","P -> Q","Q -> R","R -> S","S -> T"],"conclusion":"((P & Q) -> (R & S)) -> T","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 : Bool) :\n    ((!((((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!v2) || v3)) && ((!v3) || v4))) || ((!((!(v0 && v1)) || (v2 && v3))) || v4)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"inference_2","sourceStatement":"{P, Q, R, S, T, U} |= U -> (((P & Q) & (R & S)) & T)","sourceOffset":3469,"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","Q","R","S","T","U"],"conclusion":"U -> (((P & Q) & (R & S)) & T)","status":"candidate","leanStatement":"theorem inference_2 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((v0 && v1) && v2) && v3) && v4) && v5)) || ((!v5) || (((v0 && v1) && (v2 && v3)) && v4))) = 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"}],"files":{"source.json":{"sha256":"a4105c7472eb3650f61e13e94a4139575176a6fb78d1a8559695bdf24cf2ad68","bytes":6953},"Proof.lean":{"sha256":"ec1a628ec57dfb1e452740db76569b019f232612f317f5a7a4c872bf375eb580","bytes":885},"lean-check.txt":{"sha256":"9dd24ecb3d82c309e42e8e914b5df3ec490fd2259644de7d887fca9eeff5dfe5","bytes":174}},"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":"7708862fbb4faeed369931fa1c0cc59ea96b840fad81ec6702e4197cbfebf3d0","timestamp":"2026-10-03T10:42:55.000Z","timestampAuthority":"https://www.freetsa.org","manifestSha256":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4","url":"/proof-verification/hunter-mspp-original-design","jsonUrl":"/proof-verification/hunter-mspp-original-design.json","leanUrl":"/proof-verification/hunter-mspp-original-design.lean","graph":{"@context":"https://schema.org","@type":"SoftwareSourceCode","@id":"https://4p-engine.com/proof-verification/hunter-mspp-original-design#lean","name":"Lean 4 witness: Machine Semantics Programming Platform Designed by Maclain Hunter","url":"https://4p-engine.com/proof-verification/hunter-mspp-original-design","dateCreated":"2026-10-03T10:37:05.082Z","dateModified":"2026-10-03T10:40:02.706Z","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":"Machine Semantics Programming Platform Designed by Maclain Hunter","author":{"@type":"Person","name":"Maclain Hunter"},"url":"https://4p-engine.com/proof-knowledge/hunter-mspp-original-design","identifier":"hunter-mspp-original-design"},"encoding":{"@type":"MediaObject","encodingFormat":"text/plain","contentUrl":"https://4p-engine.com/proof-verification/hunter-mspp-original-design.lean"},"subjectOf":{"@type":"DigitalDocument","name":"Independently verified RFC 3161 existence timestamp","dateCreated":"2026-10-03T10:42:55.000Z","url":"https://4p-engine.com/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\"]"},{"@type":"PropertyValue","name":"sourceSha256","value":"7708862fbb4faeed369931fa1c0cc59ea96b840fad81ec6702e4197cbfebf3d0"},{"@type":"PropertyValue","name":"releaseManifestSha256","value":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4"},{"@type":"PropertyValue","name":"sourceRecordedAt","value":"2026-10-02T21:22:45.308Z"},{"@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"}]}}