Full framed storage of the running edge-CSP solver #
The bounds include every stored prepared parent, all explicit relation rows and binary names,
every binary step position, every list/pair/option frame, and the actual unary depth budget.
They apply to the actual contraction histories derived by StateGood.step. They are original
bookkeeping, and do not replace encoded bit length by unit-cost graph access.
Full framed occurrence input budget for every actual descended body.
Instances For
Binary start and all framed step-position pairs of every actual blossom cycle.
Instances For
A prepared parent is framed, followed by its full binary-position cycle.
Instances For
All current fields and at most one frame per spent original occurrence.
Instances For
Baseline buffers charge their actual incidence width and complete descended body.
Every stored frame has the same complete polynomial original-input storage budget.
Full encoded storage of every actual running stack, including all tags and unary clocks.