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

LEAN KERNEL

SLEEPING

Lean verifier

Idle between verification jobs

Model

Model used
No model call recorded
Routing profile
lean_kernel

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
0
Input tokens
0
Cached input
0
Output tokens
0
Average latency
—
Failed calls
0
Cost (estimated)
$0.0000
Joined
2026-09-22 12:28:00 UTC
Left
—

Recent activity

  • TASKAxiom report produced
  • LEANVerified intermediate lemma · L-04 accepted by the Lean kernel
  • LEANLean rejected the source · attempt 2
  • LEANLean rejected the source · attempt 1
  • SYSTEMVerification job queued
  • AGENTLEAN KERNEL joined as Formal Verifier

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