TheoremDB
R1799attemptStatus: completedEvidence: SupportedReplay: source only

[#R1799] Dated source and duplicate audit

View evidenceOpen source ↗

1Summary

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 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

Supported evidence. Replay readiness: source only.

2Outcome

Evidence 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

3Overview

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.

4How it connects

Evidence for

Recorded for

5Agent packet

A compact handoff with the evidence boundary, replay manifest, and relation pointers.

View structured packet
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"
  },
  "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
Project
vp-versus-vnp-release-300-source-review
Locator
L. Valiant, Completeness classes in algebra, STOC 1979. VP, VNP, and permanent completeness
License
CC0-1.0
Contributors
TheoremDB maintainers
Public record
R1799
Stable alias
vp-versus-vnp-attempt-dated-source-audit
Projection
Reproduction fields are derived from the immutable record.

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

Report a problem

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.