wai: a ladder of timeliness fallbacks, and the reference sink scheduler #655

Merged

dcharlot merged 4 commits from wai/timeliness-ladder-scheduler into main 2026-11-05 18:13:50 -05:00

Conversation 0 Commits 4 Files changed 18 +21212 -3318

2026-11-05

Transaction Science

wai: a timeliness rung writes itself by value ...

Fallback is Copy, so its to_value takes self, as clippy's wrong_self_convention asks.

Co-Authored-By: Claude Opus 5.5 <[email protected]>

73b68b245e

• View at this point in history

2026-11-05 11:25:13 -05:00

Transaction Science

wai: cache_authority_verify.py reads every rung of a ladder for §9's lines ...

timeliness §6.3's lines now read each rung, and cache_authority.rs asks for each. The second
implementation read one fallback object, which raises on a fallback written as an array. For one
rung the statements it gives are the same, so the cache-authority corpus reads as it did.

Co-Authored-By: Claude Opus 5.5 <[email protected]>

881bc5ab54

• View at this point in history

2026-11-05 11:05:46 -05:00

Transaction Science

wai: name the API changes of the timeliness ladder as breaking ...

Co-Authored-By: Claude Opus 5.5 <[email protected]>

0ceceda2e5

• View at this point in history

2026-11-05 11:05:46 -05:00

Transaction Science

wai: timeliness fallback ladder, and the reference sink scheduler that runs §7 plans ...

An entry's fallback is an ordered ladder: null, one rung as an object, or two to eight rungs as an
array in strictly falling value, no object named twice (§4.2 rule 3.4, timeliness_ladder_invalid).
One rung has one form, the object, so an entry with one fallback object is a ladder of one rung and
reads, judges and plans as it did; the cache-authority corpus regenerates unchanged.

§5.3 states which rung applies: at by_ms the primary held, else the first rung held; holding
neither, the sink has passed every rung, states `passed`, presents the primary late at its value at
arrival, and at the end, having presented nothing, abandons and states `ended`. §6.3 and §7.3 take
the ladder, and a plan's choice names its rung.

§7.5 and timeliness::scheduler run a sink's plans against the instants it first held each object:
fetch, abandon, present, passed and ended by exact steps, a function of those inputs alone. A later
plan replaces the one in force wholly. plans_invalid and arrivals_invalid refuse a run's inputs.

The corpus gains the group E, ladder claims, verdicts and plans, and runs, each outcome declared in
the generator. timeliness_verify.py writes the ladder and the run from the text, with mutations and
weakenings for both, and claim_verify.py holds rule 3.4.

Co-Authored-By: Claude Opus 5.5 <[email protected]>

e6a38c6b82

• View at this point in history

2026-11-05 11:05:46 -05:00