{"slug":"hunter-validation-tautological-sieve","identifier":"hunter-validation-tautological-sieve","title":"Validation Via Tautological Sieve","author":"Maclain Hunter","sourceSha256":"7c57bf304b2a920bc99e730fa761f3d8c06b3bd11709eaa4347e0e39678ee343","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:29:49.848Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:49.793Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.inference_2","HunterAuthored.inference_3"],"units":[{"id":"inference_1","sourceStatement":"{A, A -> ~B, (B & C) -> E, (C & D) -> D} |= (D -> ~(B & E)) & (D -> A)","sourceOffset":421,"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":["A","B","C","D","E"],"premises":["A","A -> ~B","(B & C) -> E","(C & D) -> D"],"conclusion":"(D -> ~(B & E)) & (D -> A)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 : Bool) :\n    ((!(((v0 && ((!v0) || (!v1))) && ((!(v1 && v2)) || v4)) && ((!(v2 && v3)) || v3))) || (((!v3) || (!(v1 && v4))) && ((!v3) || v0))) = 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, Q <-> R} |= R -> (Q <-> P)","sourceOffset":1172,"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 <-> Q","Q <-> R"],"conclusion":"R -> (Q <-> P)","status":"candidate","leanStatement":"theorem inference_2 (v0 v1 v2 : Bool) :\n    ((!((v0 == v1) && (v1 == v2))) || ((!v2) || (v1 == v0))) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> decide\n#print axioms inference_2\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_2"},{"id":"inference_3","sourceStatement":"{W, X, Y, (W & X) -> Z, (X & Y) -> Z} |= Z <-> X","sourceOffset":2295,"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":["W","X","Y","Z"],"premises":["W","X","Y","(W & X) -> Z","(X & Y) -> Z"],"conclusion":"Z <-> X","status":"candidate","leanStatement":"theorem inference_3 (v0 v1 v2 v3 : Bool) :\n    ((!((((v0 && v1) && v2) && ((!(v0 && v1)) || v3)) && ((!(v1 && v2)) || v3))) || (v3 == v1)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> decide\n#print axioms inference_3\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_3"}],"files":{"source.json":{"sha256":"8a8d028f638416af0fbe91e451b46f1408a4530a3e261bcd212b40fba01f3af7","bytes":2995},"Proof.lean":{"sha256":"25a84ed30582d5be09549a3dc7ea66dd8cd6b6716038bbe557435e57b526755f","bytes":1008},"lean-check.txt":{"sha256":"d131b333b863df4d5d5c7567649c22c57355691beead3b363ceaaf7bf31ab6ea","bytes":233}},"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":"7c57bf304b2a920bc99e730fa761f3d8c06b3bd11709eaa4347e0e39678ee343","timestamp":"2026-10-03T10:42:55.000Z","timestampAuthority":"https://www.freetsa.org","manifestSha256":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4","url":"/proof-verification/hunter-validation-tautological-sieve","jsonUrl":"/proof-verification/hunter-validation-tautological-sieve.json","leanUrl":"/proof-verification/hunter-validation-tautological-sieve.lean","graph":{"@context":"https://schema.org","@type":"SoftwareSourceCode","@id":"https://mcbcore.net/proof-verification/hunter-validation-tautological-sieve#lean","name":"Lean 4 witness: Validation Via Tautological Sieve","url":"https://mcbcore.net/proof-verification/hunter-validation-tautological-sieve","dateCreated":"2026-10-03T10:37:05.082Z","dateModified":"2026-10-03T10:42:49.793Z","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":"Validation Via Tautological Sieve","author":{"@type":"Person","name":"Maclain Hunter"},"url":"https://mcbcore.net/proof-knowledge/hunter-validation-tautological-sieve","identifier":"hunter-validation-tautological-sieve"},"encoding":{"@type":"MediaObject","encodingFormat":"text/plain","contentUrl":"https://mcbcore.net/proof-verification/hunter-validation-tautological-sieve.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.inference_3\"]"},{"@type":"PropertyValue","name":"sourceSha256","value":"7c57bf304b2a920bc99e730fa761f3d8c06b3bd11709eaa4347e0e39678ee343"},{"@type":"PropertyValue","name":"releaseManifestSha256","value":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4"},{"@type":"PropertyValue","name":"sourceRecordedAt","value":"2026-10-03T01:29:49.848Z"},{"@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"}]}}