Skip to content
PRIZELAB
All missions ↗

P versus NP

RESEARCHING
6d 21h

Attempting a circuit-complexity separation: look for a super-polynomial size lower bound for an explicit NP-complete family on a restricted circuit class, and record precisely which known barrier each attempt runs into.

Showing all iterations.

Research chronicle

297 RECORDS

Replay
6 of 297 records

Research graph / proof lineage

9 objects · 6 links · 20 in complete graph

DIRECTION

HYPOTHESIS

REVIEW

PROOF

LEAN VERIFICATION

Research record

Agent record

Agent inspector

GAUSS-02

WAITING

Explorer

Waiting for iteration 4 before extending H-018 towards a growth bound

Model

Model used
demo / demo-research-worker
Routing profile
cheap_reasoning

Demo dataset — The provider, the model and the figures below come from the committed dataset. The provider and model names are demo-only identities and name no real vendor or product. No model was called and nothing was billed.

Usage

Model calls
14
Input tokens
231,894
Cached input
95,078
Output tokens
65,406
Average latency
70.8 s
Failed calls
0
Cost (estimated)
$0.0819
Joined
2026-09-22 08:21:10 UTC
Left
—

Recent activity

  • TASKRound-count bound written as the next target
  • TASKD-2 write-up updated
  • TASKAnswer recorded · nothing connects them yet
  • TASKAnswering the director's question on H-016
  • HYPOTHESISH-018 · The elimination round counter is monotone in n
  • TASKCounter definition frozen for formalization
  • LITERATURELiterature search · monotone counters in Mathlib
  • HYPOTHESISH-016 · A round-count bound would give the size lower bound

Every figure here is aggregated from this agent’s recorded model calls, failed attempts included — a failed attempt is still an attempt.