Computed Retrieval, Decided Verdicts: A Parameter-Free Retrieval-to-Verification Chain over a Decidable Program Fragment

Abstract

Technical report of the LNFdex(TM) engine: a retrieval-to-verification chain in which retrieval is computed (hash-derived 256-bit binary hypervectors, Hamming ranking, no learned parameters, no floats) and the verdict is decided (exhaustive verification over a 54-point decidable program fragment with sound and complete abstention). Measured on Raspberry Pi 5 against the frozen artifact PLANWERK_v0_1_24_PI5: 1 exact check instead of 54 at 0 model tokens; 20/20 in 78 ms vs. 0/20 for three small language models on the same harness; 10-language render/parse round-trip proven over all 540 point checks. Companion to the P1 paper line.