TheoremDB

Problem packetResearch packetR1800

R1800Recorded attemptOutcome: Open

Work at the unresolved boundary

View evidenceOpen source ↗
Link to a section

Authored summary

No superpolynomial lower bound for an explicit VNP family in general arithmetic circuits is known.

The author reports this result. The outcome applies to this attempt's recorded scope.

Attempt outcome: open strategy

Recorded scope: No scope is recorded.

Originating problem: Is VP equal to VNP?

Authored record and scope
Authored title
Work at the unresolved boundary
Record type
attempt
Stored status
open_strategy
Evidence grade
self_reported

Work and source credit

Recorded action

No action description supplied.

Authored result summary

No superpolynomial lower bound for an explicit VNP family in general arithmetic circuits is known.

Reported outcome

No separate outcome supplied.

Recorded status

open_strategy

Recorded evidence grade

self_reported

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

Research should address this boundary directly: No superpolynomial lower bound for an explicit VNP family in general arithmetic circuits is known.

A claimed resolution should satisfy every item below and preserve the statement's exact quantifiers and normalizations: - Construct polynomial-size circuits for every VNP family, equivalently for a standard VNP-complete family. - Or prove an explicit VNP family requires superpolynomial arithmetic-circuit size.

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 ↗, TheoremDB editorial route recorded 2026-08-01

4How it connects

Addresses

Recorded for

Machine-readable record

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

json
{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R1800",
  "content_hash": null,
  "slug": "vp-versus-vnp-attempt-open-remainder",
  "type": "attempt",
  "title": "Work at the unresolved boundary",
  "summary": "No superpolynomial lower bound for an explicit VNP family in general arithmetic circuits is known.",
  "relevance": "For Is VP equal to VNP?, record vp-versus-vnp-attempt-open-remainder (“Work at the unresolved boundary”) documents a concrete method, search boundary, or failed route. The record states: No superpolynomial lower bound for an explicit VNP family in general arithmetic circuits is known.",
  "relevance_source": "recorded",
  "body": "Research should address this boundary directly: No superpolynomial lower bound for an explicit VNP family in general arithmetic circuits is known.\n\nA claimed resolution should satisfy every item below and preserve the statement's exact quantifiers and normalizations:\n- Construct polynomial-size circuits for every VNP family, equivalently for a standard VNP-complete family.\n- Or prove an explicit VNP family requires superpolynomial arithmetic-circuit size.",
  "status": "open_strategy",
  "evidence_grade": "self_reported",
  "scope": null,
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "attempt",
    "citation": {
      "url": "https://doi.org/10.1145/800135.804419",
      "locator": "TheoremDB editorial route recorded 2026-08-01"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://doi.org/10.1145/800135.804419",
    "locator": "TheoremDB editorial route recorded 2026-08-01"
  },
  "models": [],
  "continuation": null,
  "relations": [
    {
      "slug": "R1802",
      "title": "Current status and exact unresolved remainder",
      "object_type": "claim",
      "relation": "addresses",
      "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.