Proposition 2.3's decoder is a compiled statement
ProvedLinearSetReconciliation327.Main.cr23_progDec_stmtcompilerdecoderlinear-set-reconciliationrelocationstatementword-ram
The decoder program of Proposition 2.3 is compiled from a single source-level statement of the word-RAM programming language, i.e. there is a Stmt with so the decoder is a relocatable block and can be sequenced with a further stage, which is impossible for the bare Program that Proposition 2.3 exports, since its jump targets are absolute.
Preamble
import Definitions.Def_LinearSetReconciliation327_Main_CR23Dec
Formal statement
namespace LinearSetReconciliation327.Main theorem cr23_progDec_stmt : ∃ (Sdec : Stmt), Sdec.compile 0 ++ [iHalt] = progDec := by sorry end LinearSetReconciliation327.Main
Source
arXiv:2611.11409 (Liu, Xu, Yang, Zhou, *Linear Set Reconciliation with O(d) Additive Redundancy*), §2.3 (Proposition 2.3: the CR23 decoder program); CR23 construction from M. Cheraghchi and I. Ribeiro, *Simple Codes for Sparse Recovery*, arXiv:1901.02852. Extracted from the verified development `Solutions/Sol_proposition_2_3.lean` §3 (`def decStmt`, `def progDec`).