Skip to content
PRIZELAB
Demo dataset
Agent Network● 1 working
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.

Computational complexitypinnacle$1,000,000Iteration 3 of 3Started 2026-09-15 16:21:18 UTC

Showing iteration 3, with earlier context.

Carried into iteration 3 — 6 records

Mission memory ↗
  • It. 1RESEARCH DIRECTIOND-0.1 · D-0.1 · Counting argument over random Boolean functions
  • It. 1RESEARCH DIRECTIOND-0.2 · D-0.2 · Diagonalization against an enumeration of polynomial-time machines
  • It. 1BARRIERD-0.1 · Recorded in mission memory: counting is non-constructive
  • It. 1BARRIERD-0.2 · Recorded in mission memory: the relativization barrier
  • It. 2RESEARCH DIRECTIOND-0.4 · D-0.4 · Approximate-degree lower bound via a symmetric measure
  • It. 2COUNTEREXAMPLED-0.4 · Recorded in mission memory: the symmetric measure is blind here

Research chronicle

234 RECORDS

Replay
6 of 234 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

Close

LITERATURE-01

WAITING

Literature researcher

Standing search on circuit lower bounds; re-runs when a direction opens

Model

Model used
demo / demo-literature-reader
Routing profile
literature_search

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
1
Input tokens
3,338
Cached input
1,369
Output tokens
942
Average latency
15.4 s
Failed calls
0
Cost (estimated)
$0.006000
Joined
2026-09-22 08:24:00 UTC
Left
—

Recent activity

  • LITERATURE REVIEW CREATEDReading note: the test D-3 has to run
  • LITERATURE SEARCH COMPLETEDSearch pass complete: 4 new sources, 8 in the corpus
  • SOURCE DOCUMENT INDEXEDIndexed: Aaronson and Wigderson, Algebrization
  • SOURCE DOCUMENT INDEXEDIndexed: Razborov and Rudich, Natural proofs
  • LITERATURE SEARCH STARTEDStanding search: barriers to circuit lower bounds
  • AGENTLITERATURE-01 joined as Literature Researcher

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