Pinsketch decoder: the key-solver, root-search and verifier frames lie inside the decoder scratch
ProvedLinearSetReconciliation327.Main.p21_scratch_boundsarithmeticdecoderlayoutlinear-set-reconciliationproposition-2-1
The three stage frames of Proposition 2.1 never touch a word at or above decoderAllocEnd t. For : every address writable by the key-solver stage (solverInitWritable t) is below decoderAllocEnd t; every address writable by the root-search stage, at the concrete row/queue geometry of the decoder, is below it; every address writable by the verification stage at is below it; and the saved syndrome block ends at or below it. Consequently each published stage frame preserves the zero-ness of .
Preamble
import Definitions.Def_LinearSetReconciliation327_Main_DecoderLemmas set_option autoImplicit false open Finset
Formal statement
theorem LinearSetReconciliation327.Main.p21_scratch_bounds (t : ℕ) (ht : 1 ≤ t) :
(∀ addr, solverInitWritable t addr → addr < decoderAllocEnd t) ∧
(∀ addr, rootSearchWritable (decoderRowBase t 0) (decoderRowBase t 6) (decoderRowBase t 1)
(decoderRowBase t 7) (decoderRowBase t 4) (decoderCapacity t) (decoderQueue0 t)
(decoderQueue1 t) (decoderOutputBase t) t addr → addr < decoderAllocEnd t) ∧
(∀ addr, verifierWritable (decoderVerifyBase t) (2 * t) addr → addr < decoderAllocEnd t) ∧
decoderSavedBase t + 2 * t ≤ decoderAllocEnd t := by sorry
Source
arXiv:2611.11409, Section 2.2 (Pinsketch, PDF p.10): the address layout of the Proposition 2.1 decoder (`decoderSavedBase`, `decoderRowBase`, `decoderQueue0/1`, `decoderOutputBase`, `decoderVerifyBase`).