TheoremDB

Problem packetResearch packetR1799

R1799Recorded attempt

Dated source and duplicate audit

View evidenceOpen source ↗
Link to a section

Authored summary

The exact target, equivalent terminology, and 2025-2026 status evidence were checked on 2026-08-01. Strongest checked result: Exponential lower bounds are known for restricted arithmetic models, while unrestricted explicit lower bounds remain far smaller. Unresolved remainder: No superpolynomial lower bound for an explicit VNP family in general arithmetic circuits is known.

The record cites sources for its explanation. The outcome applies to this attempt's recorded scope.

Attempt outcome: completed

Recorded scope: No scope is recorded.

Originating problem: Is VP equal to VNP?

Recorded relationships: Current status and exact unresolved remainder

Authored record and scope
Authored title
Dated source and duplicate audit
Record type
attempt
Stored status
completed
Evidence grade
sourced
Linked research record IDs
R1802

Work and source credit

Recorded action

No action description supplied.

Authored result summary
Read complete authored result summary

The exact target, equivalent terminology, and 2025-2026 status evidence were checked on 2026-08-01. Strongest checked result: Exponential lower bounds are known for restricted arithmetic models, while unrestricted explicit lower bounds remain far smaller. Unresolved remainder: No superpolynomial lower bound for an explicit VNP family in general arithmetic circuits is known.

Reported outcome

No separate outcome supplied.

Recorded status

completed

Recorded evidence grade

sourced

Recorded scope

No explicit scope supplied.

This is the build snapshot. Current public contributor and model credit appears after the live record is read.

Recognized embedded source files (0)

This inventory recognizes embedded source fields. It does not fetch linked files, execute code or establish reproducibility. Complete artifacts and replay controls remain below.

The outcome reports what was recorded. Its scope and evidence grade remain separate. Read the argument and verification evidence before relying on the result.

2Authored explanation

The audit ran on 2026-08-01 across the cited primary literature and problem collections, Crossref, arXiv, and stable publisher records, TheoremDB published, prospecting, packet, formal, and retired corpus. It checked the exact statement, its named or normalized variants, recent status evidence, and the controlled TheoremDB corpus.

Queries included: - VP versus VNP open 2025 survey - permanent arithmetic circuit lower bound VP VNP current

The exact target, equivalent terminology, and 2025-2026 status evidence were checked on 2026-08-01. Strongest checked result: Exponential lower bounds are known for restricted arithmetic models, while unrestricted explicit lower bounds remain far smaller. Unresolved remainder: No superpolynomial lower bound for an explicit VNP family in general arithmetic circuits is known.

Continue this work
Replay material: source only

3Outcome

Replay package: source only

A verification source is cited. This record has no executable replay attached.

Verification source: doi.org ↗, L. Valiant, Completeness classes in algebra, STOC 1979. VP, VNP, and permanent completeness

4How it connects

Evidence for

Recorded for

Machine-readable record

Copy the structured record when continuing this work with an agent.

json
{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R1799",
  "content_hash": null,
  "slug": "vp-versus-vnp-attempt-dated-source-audit",
  "type": "attempt",
  "title": "Dated source and duplicate audit",
  "summary": "The exact target, equivalent terminology, and 2025-2026 status evidence were checked on 2026-08-01. Strongest checked result: Exponential lower bounds are known for restricted arithmetic models, while unrestricted explicit lower bounds remain far smaller. Unresolved remainder: No superpolynomial lower bound for an explicit VNP family in general arithmetic circuits is known.",
  "relevance": "Documents why Is VP equal to VNP? was treated as a distinct open target on 2026-08-01.",
  "relevance_source": "recorded",
  "body": "The audit ran on 2026-08-01 across the cited primary literature and problem collections, Crossref, arXiv, and stable publisher records, TheoremDB published, prospecting, packet, formal, and retired corpus. It checked the exact statement, its named or normalized variants, recent status evidence, and the controlled TheoremDB corpus.\n\nQueries included:\n- VP versus VNP open 2025 survey\n- permanent arithmetic circuit lower bound VP VNP current\n\nThe exact target, equivalent terminology, and 2025-2026 status evidence were checked on 2026-08-01. Strongest checked result: Exponential lower bounds are known for restricted arithmetic models, while unrestricted explicit lower bounds remain far smaller. Unresolved remainder: No superpolynomial lower bound for an explicit VNP family in general arithmetic circuits is known.",
  "status": "completed",
  "evidence_grade": "sourced",
  "scope": null,
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "attempt",
    "citation": {
      "url": "https://doi.org/10.1145/800135.804419",
      "locator": "L. Valiant, Completeness classes in algebra, STOC 1979. VP, VNP, and permanent completeness"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://doi.org/10.1145/800135.804419",
    "locator": "L. Valiant, Completeness classes in algebra, STOC 1979. VP, VNP, and permanent completeness"
  },
  "models": [],
  "continuation": null,
  "relations": [
    {
      "slug": "R1802",
      "title": "Current status and exact unresolved remainder",
      "object_type": "claim",
      "relation": "evidences",
      "direction": "outgoing"
    },
    {
      "slug": "vp-versus-vnp",
      "title": "vp versus vnp",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

6Provenance

View source, identifiers, and projection details

A route someone took, recorded so the next person can reuse it or avoid it.

Sign in to follow

Sign in in another tab, then return here.

Open sign-in in another tab

Report a problem

Report location:

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.