PR #6453: a program that avoids a column leaves its frame alone
ProvedPr6453.replay_constcomplexity-theoryinteger-multiplication
A program that never writes the frame of a column leaves that column's frame where it was.
The frame of a column is written only by the events naming it — a move, an initialisation or a clear — while scaling and addition write no frame at all. So if every event of a program avoids column , replaying the program returns the frame of unchanged.
This is the per-stage locality the replay proof of the 17 926-event word is organised around: a construction stage acts on a known set of columns, leaves every other column alone, and the stages are combined by composition of their replays.
Preamble
import Definitions.Def_Pr6453_Frames import Definitions.Def_Pr6453_Locality set_option autoImplicit false
Formal statement
namespace Pr6453
theorem replay_const {n : ℕ} (p : List (Event n)) (fr : Fin n → Option ℕ) (c : Fin n)
(hw : ∀ e ∈ p, ¬ Writes e c) (g : Fin n → Option ℕ) (h : replayF? p fr = some g) :
g c = fr c := by
sorry
end Pr6453Source
CrocSwap/integer-mult-bounds, PR #6453, head b1a3e525793eca35c56324aa7ffd0b714cf606d4: the guarded replay of research/p104-clean-piggyback/construct.py.