Module graph 

The competition graph.

prep ──► implement ×N ──► judge ×M (blind) ──► split? ──► deliberate ──► vote (private)
                                                  │                          │
                                                  └──── unanimous ───────────┤
                                                                             ▼
  merge ◄── gate ◄── review ×R + E2E, fix, repeat ◄── fold losers ◄──────── tally

Every node persists before the next one starts, so a run can be resumed after a crash, a rate limit, or a reboot without re-spending the work that already landed.

The design decision that matters most is where the facilitator lives. There is no moderator agent: magi assigns the labels, decides the presentation order, relays the transcript, and collects the final votes one-to-one. A moderator that never learns an author cannot leak one.

Structs

Pause

A request to park the run at its next node boundary.

Runner

Drives one run.

Functions

fold_run

Tear a run’s worktrees and branches down.

worst_open

Severity of the worst open finding in the last review round, for reporting.