Declare the searchable windowScope + grid
NEXUS CEREBRI / Deterministic Planning Field
Search a declared grid, then say exactly what was proven.
The current planner performs bounded single-event grid search and ranks feasible candidates deterministically.
TECHNICAL DEPTH / CONTRACTS
PROVEN_OPTIMAL is only valid after the declared grid is fully traversed with a solution. Candidate limits can reduce the assessment to BEST_FOUND.
RESEARCH DEPTH / BOUNDARY
Bounded recurrence compilation, dependency/cycle evidence, composed hard constraints and explicit ordering keys are implemented. Joint repair and broader release validation remain future work.
BOUNDED DETERMINISTIC SEARCH
The planner searches a declared grid and reports what it actually established.
Known busy state and hard rules remove invalid positions. The remaining candidates are ordered deterministically, and the search assessment says whether the declared grid was exhausted.
TECHNICAL DETAIL
The browser renders generated Rust results. PROVEN_OPTIMAL applies only to the declared discrete grid after full traversal with a solution; candidate limits reduce the assessment to BEST_FOUND.
Compile known blocking stateContext snapshot
Evaluate discrete positionsCandidate search
Reject invalid candidatesHard validity
Order valid candidatesResult + assessment
A three-hour search field shows a known busy block, deterministic grid positions, evaluated candidates and the selected candidate. A proof strip states outcome and assessment from Rust output.
REALDeterministic Planning Field
SEARCH SPACE09:00 → 12:00 UTCThe planner may only choose inside this window.
ASSESSMENTProvenOptimalRust planner claim for this bounded run
blockedfeasible candidateselected resultdiscrete grid
09:0010:0011:0012:00
KNOWN BUSY09:00—10:00
C110:00
C210:15
C310:30
C410:45
C511:00
C611:15
C711:30
OUTCOMESolution
FEASIBLE7candidates remain valid
SELECTED10:00 UTCchosen deterministically
AUTHORITYRust core outputrendered, not recomputed
Text alternative
A three-hour search field shows a known busy block, deterministic grid positions, evaluated candidates and the selected candidate. A proof strip states outcome and assessment from Rust output.
CORE / RESULT
CURRENT CORE RESULT
Read ADR-0006→ProvenOptimal
The value above is generated by running the Rust core example during the website build.