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

dcharlot commented 2026-11-05 11:31:45 -05:00

Owner

Copy link

Timeliness gets a ladder of fallbacks, and a reference scheduler that runs a sink's plans.

The ladder (extensions/timeliness.md §4.1, §4.2, §4.3, §5.3, §6.3, §7.3)

• fallback is null, one rung as an object, or 2 to 8 rungs as an array. Values strictly fall, and no object appears twice; a violation is timeliness_ladder_invalid (rule 3.4).
• A single fallback object stays valid and reads, judges and plans as before. An array of one is refused, so one ladder has one written form.
• At by_ms a sink presents the primary if it holds it, otherwise the first rung it holds. Holding neither, it states passed and presents no rung in the primary's place from then on. It presents the primary when it first holds it, while its value is at least 1, and at the end, having presented nothing, abandons any request and states ended.

The scheduler (§7.5, wai-rs/src/timeliness/scheduler.rs)

scheduler::run takes a sink's plans and the instants it first held each object, and returns fetch, abandon, present, passed and ended by ordered steps, as a function of those inputs alone. A later plan replaces the one in force wholly, and anything settled stays settled. plans_invalid and arrivals_invalid refuse bad input.

Verified

On a Linux build host, Rust 1.99.1, at this head:

• The timeliness corpus: every case, group by group, 0 failures. timeliness_verify.py derives each outcome from the text; all mutated copies fail and all weakened verifiers are caught.
• wai_timeliness_vectors verify regenerates the corpus byte for byte.
• The cache-authority step, claim_verify.py on the claim corpus, and http_verify.py all pass.
• wai breaking: no unacknowledged break. The API changes are acknowledged in the entry.
• Clippy on the touched targets has no finding in the touched files; the public-text and spec-reference checks pass.
• Falsification: every planted Rust fault is caught.

Limits

• The step bodies ran with narrowed WAI_FEATURES, not the workflow's full union; CI runs the union.
• No cache-authority vector carries a ladder yet. Both sides implement it; the case is added after the carousel change that regenerates that corpus lands.

The changelog entry is wai/changes/2026-11-05-rungs-fallback-ladder-sink-scheduler.md.

🤖 Generated with Claude Code

Timeliness gets a ladder of fallbacks, and a reference scheduler that runs a sink's plans. ## The ladder (`extensions/timeliness.md` §4.1, §4.2, §4.3, §5.3, §6.3, §7.3) - `fallback` is `null`, one rung as an object, or 2 to 8 rungs as an array. Values strictly fall, and no object appears twice; a violation is `timeliness_ladder_invalid` (rule 3.4). - A single fallback object stays valid and reads, judges and plans as before. An array of one is refused, so one ladder has one written form. - At `by_ms` a sink presents the primary if it holds it, otherwise the first rung it holds. Holding neither, it states `passed` and presents no rung in the primary's place from then on. It presents the primary when it first holds it, while its value is at least 1, and at the end, having presented nothing, abandons any request and states `ended`. ## The scheduler (§7.5, `wai-rs/src/timeliness/scheduler.rs`) `scheduler::run` takes a sink's plans and the instants it first held each object, and returns `fetch`, `abandon`, `present`, `passed` and `ended` by ordered steps, as a function of those inputs alone. A later plan replaces the one in force wholly, and anything settled stays settled. `plans_invalid` and `arrivals_invalid` refuse bad input. ## Verified On a Linux build host, Rust 1.99.1, at this head: - The timeliness corpus: every case, group by group, 0 failures. `timeliness_verify.py` derives each outcome from the text; all mutated copies fail and all weakened verifiers are caught. - `wai_timeliness_vectors verify` regenerates the corpus byte for byte. - The cache-authority step, `claim_verify.py` on the claim corpus, and `http_verify.py` all pass. - `wai breaking`: no unacknowledged break. The API changes are acknowledged in the entry. - Clippy on the touched targets has no finding in the touched files; the public-text and spec-reference checks pass. - Falsification: every planted Rust fault is caught. ## Limits - The step bodies ran with narrowed `WAI_FEATURES`, not the workflow's full union; CI runs the union. - No cache-authority vector carries a ladder yet. Both sides implement it; the case is added after the carousel change that regenerates that corpus lands. The changelog entry is `wai/changes/2026-11-05-rungs-fallback-ladder-sink-scheduler.md`. 🤖 Generated with [Claude Code](https://claude.com/claude-code)

dcharlot added 4 commits 2026-11-05 11:31:46 -05:00

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

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]>

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

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

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

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]>

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

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]>

dcharlot referenced this pull request 2026-11-05 12:44:39 -05:00

wai: a carousel schedule extends, what a receiver needs rides in band, a node schedules its own instance, and Raptor #658

dcharlot merged commit 744f336455 into main 2026-11-05 18:13:50 -05:00

dcharlot referenced this pull request from a commit 2026-11-05 18:13:53 -05:00

Merge pull request 'wai: a ladder of timeliness fallbacks, and the reference sink scheduler' (#655) from wai/timeliness-ladder-scheduler into main

Sign in to join this conversation.

Reviewers

No reviewers

Labels

Clear labels

No items

No labels

Milestone

Clear milestone

No items

No milestone

Projects

Clear projects

No items

No project

Assignees

Clear assignees

No assignees

1 participant

Notifications

Subscribe

Due date

The due date is invalid or out of range. Please use the format "yyyy-mm-dd".

No due date set.

Dependencies

No dependencies set

Reference

Transaction-Science/open-standards!655

No description provided.