Lion Cipher Lab

Race an N-agent debate against one calibrated call on the same ambiguous alerts, count the agents that get talked out of the right answer, and go looking for the difficulty band where the extra rounds pay for themselves

Why it matters

Multi-agent debate is the most seductive idea in agent engineering: spin up several models, let them read each other's answers, argue for a few rounds, and vote. It has a real literature behind it, it feels like how a good incident-review call works, and it is trivially easy to ship into a SOC as 'the ambiguous alerts go to the panel'. What almost nobody does is put it on the same ambiguous alerts as one honest single call and print the two numbers next to the two bills. This lab does exactly that, on a corpus of 600 alerts per difficulty band with a planted answer key, and the result is…

What you'll learn

Steps in this lab

  1. The words first: calibrated call, confidence, Brier score, expected calibration error, reliability diagram, round, majority vote, herding
  2. Open a terminal and make a scratch folder (all three operating systems)
  3. The corpus: 600 ambiguous alerts per band, with the answer key planted
  4. The agent is a STUB, and here is its entire error model in writing
  5. The scoreboard: Brier score, expected calibration error and a reliability diagram in pure stdlib
  6. Architecture 1: one calibrated call - the baseline that cannot be beaten by a straw man
  7. Architecture 2: build the debate, and watch one alert get herded
  8. The headline: every architecture, every band, one table - and the baseline nobody prints
  9. Count the herding, then prove it is a net cost by ablating it
  10. Diversity is the whole engine: turn it off and the panel is a photocopier
  11. The one honest case for a panel: when the evidence will not fit in any single call
  12. The bottom line in money: dollars per EXTRA correct decision, on five bands
  13. When NOT to reach for a debate
  14. The way a pro does it differently

Open the full interactive lab →