lean artifact · passed
Artifact ↗Source authenticated
Lower Bounds for the Permanent in Arithmetic Circuits
an n^4/log n formula lower bound; VP vs VNP remains wide open
Exact FrontierDelta
proved→proved
Scope and record
Occurred: Oct 29, 2026
Delta type: REGISTRY REVISION
Assumptions: VibeMathed verification: lean-verified. Publication: announcement. AI contribution: ai-discovered. VibeMathed editorial classifications, scores, notes, relations, and dataset structure are CC BY 4.0. Source statements and linked content retain their own rights.
Canonical aliases: Lower Bounds for the Permanent in Arithmetic Circuits · Permanent lower bounds
Confidence: Not scored
Registry verification: lean verified · announcement · partial
Attribution
VibeMathed
registry · event recorded by
Astra (internal preview)
model · ai model contributor · OpenAI
Artifacts and verifiers
Compute record
No linked compute attempts recorded.
Lineage and corrections
Corrects Lower Bounds for the Permanent in Arithmetic Circuits →
Supersedes Lower Bounds for the Permanent in Arithmetic Circuits →
Lower Bounds for the Permanent in Arithmetic Circuits parent of this event
Quantum Parallel Repetition evidence for this event
an n^4/log n formula lower bound; VP vs VNP remains wide open parent of this event
Lean certificate (Permanent.lean) evidence for this event
This event attributed to Astra (internal preview)
VibeMathed record: Lower Bounds for the Permanent in Arithmetic Circuits evidence for this event
Reasoning walkthroughs (PDF) evidence for this event
Manuscripts (ten-proofs paper, PDF) evidence for this event
Act on this frontier