Documentation

Complexity.Algorithms.WordRAM.FusionTree.Query.Node

Actual preprocessed-node calls from traversal #

The large-width routine receives the parameters actually stored by parameterWords. The small-width routine receives exactly two children, as forced by the branching rule. Neither branch assumes a node oracle. Both frame the caller's persistent registers.

Main results #

References #

theorem Cslib.Algorithms.WordRAM.FusionTree.QueryProgram.Entry.frame {q p : ℕ} {x y : WordRAM.Data registers} (hx : Entry q p x) (hq : y.regs query = q) (hp : y.regs pointer = p) (hf : ∀ (i : Fin registers), 31 ≤ ↑i → ↑i < 39 → y.regs i = x.regs i) :
Entry q p y

A node call may alter scratch registers but frames all persistent traversal data.

Whole-tree representation projects to the exact chosen fusion-node witness.

Both actual node implementations return full-key inclusive rank. All preprocessing is derived from the real tree, with constant words and the entire arena fitting explicitly. The instruction bound includes the whole selected node call, with no assumed oracle.