Verification Is Identification
Year: 2026
Type: preprint
Abstract: From one postulate — a finite structure exists — the paper derives decidable structural equality, three invariants (finite space, determinism, append-only cache), and five theorems (soundness, safety, identifiability, universality, completeness). When exactly one candidate passes a decidable test over a finite space, the passing candidate is the identified structure: verification and identification collapse into one operation. The framework yields 26 proven properties plus information-theoretic bounds. The inner pipeline is total on valid finite encodings, deterministic under fixed features and protocol. Formalized over finite binary trees with decidable equality. Implemented in Python (runtime solver) and Swift (compile-time proof via the type checker). Appendices include an axiom dependency map and a reference implementation.
Author: Strizhov, Daniil
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7162201302
Cites:
Cited by:
Related to: