frontiers / frontier
Current answer
No synthesized decision answer has been authored yet. The current reading is assembled from the frontier’s strongest accepted findings, shown below.
Frontier operating path
A frontier is the bounded record object. The record holds accepted state, the engine routes reviewed work back into it, the body renders derived maps, and proof fixes the release boundary.
record
Finding bundles, source records, evidence atoms, typed links, review events, and trails are the canonical frontier record.
open state →
engine
Sources, gaps, attempts, checks, benchmark runs, and reviewable changes return through Workbench and Review before state changes.
inspect review →
body
Graphs, briefs, atlases, and constellations materialize accepted records into navigable bodies. They guide work; they do not become the record.
open graph →
proof
Proof packets, citation packages, source manifests, and release pins make the current state portable and replayable.
open proof →
next action
Open reviewable changes are waiting for checks and reviewer authority before they can change accepted state.
inspect review →
Signals show what can change this record next: review queues, campaign work, benchmark gaps, proof boundaries, contested findings, and event history.
review signal
review waitingOpen reviewable changes need checks and reviewer authority before the record changes.
inspect review →
review signal
never_exportedNo sealed proof packet is present for this frontier. Events can still be inspected, but the release boundary is not frozen.
A frontier is the record. Work enters as gaps, attempts, reviewable changes, checks, and reviews before accepted events update proof, atlases, and constellations.
gapframing
A missing experiment, unresolved contradiction, extraction defect, or stale proof cell worth reviewing.
reviewable changework
A reviewable frontier-state change with affected findings, evidence, rationale, checks, and expected proof impact.
attemptwork
An agent, capability, procedure, system, or human run with input material, declared output material, environment, disclosures, failure state, and cited artifacts.
checkgate
A schema, provenance, contradiction, benchmark, proof, or evaluation result over a reviewable change or release.
Finding types
16 findingsTop findings
all stateThreshold theorem (Aharonov-Ben-Or, Kitaev) predicts fault tolerance is possible iff physical error rate < threshold; below-threshold demonstrations now confirm this 30-year-old prediction.
0.99vf_a0d02f2fb7b3ccbbGoogle's Willow chip demonstrated below-threshold surface code error correction, with a logical error rate of 0.143% per cycle for a distance-7 code and exponential suppression factor of 2.14 when distance increases by 2.
0.98vf_bd7084433fa099e3Harvard's neutral-atom processor encoded 48 logical qubits using LDPC codes on 280 physical qubits (distance-7), executing hundreds of logical gate operations with experimentally demonstrated distance-dependent error suppression.
0.96vf_3d66d05df2a49944inspect proof →
reviewgate
A human or authorized reviewer decision over a reviewable change, check, candidate gap, or contested finding.
eventaccepted
A signed, reviewable state transition that changes the Vela-backed frontier record.
releaseaccepted
A citation-ready bundle of source state, proof artifacts, mirrors, and known caveats.
Review state
Surface code threshold for depolarizing noise ranges from 0.57% to 1.40% per gate, with consensus around 1% optimal threshold depending on decoding algorithm and syndrome extraction model.
0.92vf_2ad9bc5ca37b565eShowing 12 of 16. Clone the full state with vela registry pull vfr_2b227f9d98ccd75e.