Skip to main content

Distributed clock assessment gates

Score 0 missing/incorrect, 1 partial or prompted, 2 independently correct with evidence, 3 fresh-case transfer with explicit limits. Every gate requires 2; aggregate marks cannot replace a failed requirement.

  • DS1 — Event graph: derive reachability from process/message edges without inventing global-list edges.
  • DS2 — Clock updates: independently compute scalar/vector values and immutable send snapshots.
  • DS3 — Implementation: own starter passes supplied plus three independent traces; malformed histories are rejected.
  • DS4 — Counterexamples: distinguish scalar order from causality and expose wrong merge, strict-all comparison or mutable snapshot faults.
  • DS5 — Integration: explain completeness, fixed membership and restart limits; complete original detector, Raft and retry-safe API requirements.
  • DS6 — Retained transfer: after 48 hours, solve a changed graph without solutions and explain why its ordering does not establish delivery, commitment or leader authority.

Budget 6–8 hours including repair; waiting is excluded. Keep first score, evidence, assistance declaration and fresh retest. Passing finite tests does not establish learner independence or prove all histories. Use calibration after attempting.