Help
This is a deterministic simulation of the intelligent compute scheduler proposed with LSBU. Every action is an event in one log; replaying the log rebuilds every placement and receipt exactly.
How placement works
- Health: only nodes in service.
- Permission: the workload's classification may not exceed the site's clearance (PUBLIC, OFFICIAL, OFFICIAL-SENSITIVE).
- Jurisdiction: UK-only data stays in the UK; UK+adequate data may go to nations the UK treats as adequate (Law page); 'any' may go anywhere.
- Capacity: cores and GPUs.
- Carbon: among lawful nodes, the lowest grams of CO2 per hour wins (kW × PUE × grid intensity). UK grid intensity is read from carbon.judiverse.tech (NESO).
The crew
Jude monitors and repairs. Erling attacks on a schedule. Jordan keeps three or more recovery copies, two in the UK, so every node has a lawful path back.
Squads
Red squad Blue squad Green squad Gold squad Violet squad