Problem packetWorkR1409
[#R1409] Work at the unresolved boundary
1Summary
Unconditional polynomial-time derandomization remains open.
Research should address this boundary directly: Unconditional polynomial-time derandomization remains open.
A claimed resolution should satisfy every item below and preserve the statement's exact quantifiers and normalizations: - Give an unconditional deterministic polynomial-time simulation for every BPP machine. - Or prove a language in BPP lies outside P.
Reported evidence. Replay readiness: source only.
2Outcome
A verification source is cited. This record has no executable replay attached.
Verification source: doi.org ↗, TheoremDB editorial route recorded 2026-08-01
3How it connects
Addresses
- claim
Recorded for
- problem
4Agent packet
A compact handoff with the evidence boundary, replay manifest, and relation pointers.
View structured packet
{
"schema": "theoremdb-agent-record-v1",
"ref": "R1409",
"content_hash": null,
"slug": "bpp-equals-p-attempt-open-remainder",
"type": "attempt",
"title": "Work at the unresolved boundary",
"summary": "Unconditional polynomial-time derandomization remains open.",
"relevance": "For Is randomized polynomial time equal to deterministic polynomial time?, record bpp-equals-p-attempt-open-remainder (“Work at the unresolved boundary”) documents a concrete method, search boundary, or failed route. The record states: Unconditional polynomial-time derandomization remains open.",
"relevance_source": "recorded",
"body": "Research should address this boundary directly: Unconditional polynomial-time derandomization remains open.\n\nA claimed resolution should satisfy every item below and preserve the statement's exact quantifiers and normalizations:\n- Give an unconditional deterministic polynomial-time simulation for every BPP machine.\n- Or prove a language in BPP lies outside P.",
"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/258533.258590",
"locator": "TheoremDB editorial route recorded 2026-08-01"
},
"missing": [
"source",
"command",
"runtime",
"expected_output"
]
},
"formal_statement": null,
"source": {
"url": "https://doi.org/10.1145/258533.258590",
"locator": "TheoremDB editorial route recorded 2026-08-01"
},
"models": [],
"relations": [
{
"slug": "R1411",
"title": "Current status and exact unresolved remainder",
"object_type": "claim",
"relation": "addresses",
"direction": "outgoing"
},
{
"slug": "bpp-equals-p",
"title": "bpp equals p",
"object_type": "problem",
"relation": "recorded_for",
"direction": "outgoing"
}
]
}5Provenance
View source, identifiers, and projection details
- Project
- bpp-equals-p-release-300-source-review
- Locator
- TheoremDB editorial route recorded 2026-08-01
- License
- CC0-1.0
- Contributors
- TheoremDB maintainers
- Source
- doi.org ↗
- Public record
- R1409
- Stable alias
- bpp-equals-p-attempt-open-remainder
- Projection
- Reproduction fields are derived from the immutable record.
A route someone took, recorded so the next person can reuse it or avoid it.