Repository navigation
feat(dijkstra): realize Fibonacci-heap shortest paths natively - #2344
Conversation
…eld arrays Memory.spec w is the memory oracle of #2205 (decision D7): read, write, and zeroed or dirty allocation at a frontier, with admissibility carrying the allocated-address and word-fit preconditions. Field arrays are WordRAM Blocks accessed by Block.get/Block.set programs over the oracle. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_015DLg8kwPs8yi7ePPdtoNvG
Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_015DLg8kwPs8yi7ePPdtoNvG
…ions with stacked potentials Refinement D E is a Module whose representation is an invariant plus an abstraction function (#2205 D2). Refinement.Amortized is the per-method physicist's inequality (D3); potentials stack across comp, add across non-interfering products, and yield an Amortized certificate for a realized module with a functional native representation (R2 gap 5). CostIsBigO is the exported asymptotic form (D6). Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_015DLg8kwPs8yi7ePPdtoNvG
…inements Amortized.mono and Amortized.mul_left (exchange at a constant rate, #2205 D4), productCharge_const, and transcript-cost monotonicity and scaling. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_015DLg8kwPs8yi7ePPdtoNvG
Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_015DLg8kwPs8yi7ePPdtoNvG
…t, outside Refinement Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_015DLg8kwPs8yi7ePPdtoNvG
Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_015DLg8kwPs8yi7ePPdtoNvG
…structure A Prop-valued def whose body starts with an implicit binder is unfolded and auto-introduced during elaboration against an expected type, which broke term-mode uses such as Amortized.prod. A one-field structure, like the existing DataStructure.Amortized, avoids this. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_015DLg8kwPs8yi7ePPdtoNvG
Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_015DLg8kwPs8yi7ePPdtoNvG
Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_015DLg8kwPs8yi7ePPdtoNvG
Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_015DLg8kwPs8yi7ePPdtoNvG
Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_015DLg8kwPs8yi7ePPdtoNvG
Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_015DLg8kwPs8yi7ePPdtoNvG
….elim With a match, the answer types of product D E mention D and E through the matcher's parameters, so the elaborator cannot identify clients of two products whose components differ only in admissibility (for example the pair of stacks and the pair of bounded stacks). Sum.elim D.Result E.Result depends only on the component answer types. Queue.Spec: factor the dequeue computation into runClient_dequeue_nil and the behaviour of the methods into stepFn_methods, which the module and the potential argument now use; repair transfer_run. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_015DLg8kwPs8yi7ePPdtoNvG
Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_015DLg8kwPs8yi7ePPdtoNvG
The M1 slice of #2205. Stack.Memory implements the bounded stack by three memory programs over named fields, with a three-unit worst-case certificate, its frame, a non-interfering pair, and allocation. Queue.Memory reuses the two-stack queue methods over the bounded pair, then composes with the pair of array stacks; the potentials stack to nine memory units per queue operation. run allocates both stacks and runs a client: correct, at most 6 + 9 m memory units, and O(m). Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_015DLg8kwPs8yi7ePPdtoNvG
Add one framed register-word certificate over existing Code, with visible admissibility and fit envelopes, uniform costs, finite computed-argument substitution, and lazy selection. Keep exact-basis definedness explicit. Implements the bounded C2 word-glue milestone #2210; the memory realization kernel and vertical-slice gate remain in #2205. Validation: final staged tree a1b88e3 passed scripts/check.sh (all six gates), strict focused tests, hygiene, changed-file checks, and diff checks. No selected abstract/PDF impact. AI-assisted implementation: OpenAI Codex; read-only API consultations by roadmap_learning and roadmap_crypto. Independent outside review pending.
…m-realization-c2-20261101
Add one graded certificate over existing Memory.Prog and native Code. Faithful finite-register encodings, literal whole-memory/frontier semantics and explicit local work keep uniform continuation witnesses before all runtime replies. This is the foundational milestone of #2213 under #2205. Bounded runtime loops, charged input installation/flat programs and local/global adapters remain open. No curated abstract or headline scope changes. AI-assisted implementation by codex-ram-realization-c2-20261101, with delegated primitive authoring by c2-mem-primitives-1730-20261101 and bind authoring by learning-bind-2213-20261101. Memory5909 and Glue4283 prerequisites are preserved.
Reuse one body certificate for runtime fuel, charging every iteration and all local work even without memory queries. Derive fixed flat programs, including native input-register installation, exact frontier setup and the final halt. Unit observations execute an additional real zero instruction. This is the loop/whole-program milestone under #2213 and #2205. Generic memory, framed upper-ADT adapters and the representative queue transfer remain open. Existing selected abstracts and headline scope are unchanged. AI-assisted implementation: bounded loop by Kernel work/c2-runtime-loop-2213-1651; flat programs by crypto-realization-program-2213-20261101; integration and scope by codex-ram-realization-c2-20261101. Prior foundational source remains unchanged.
Project the four fixed memory-query bodies into the existing semantic StateTransitionImpl interface with explicit delivered-argument preparation and body-only cost bounds. Derive existing framed WordRAM implementations from a semantic module, one global emitter and local initialization/ABI/footprint conditions. Runtime argument maps do not choose a new emitter per object. Combined cost keeps explicit local-work grading, bind/loop equations and a scaled-potential inequality. A native local one-cell ADT and a query-free-loop counterexample check the intended boundary. Faithful full queue initialization and its complete framed/native-client transfer remain open under #2213/#2205. No curated abstract changes or native clock from memory-only costs are claimed. AI-assisted authoring: memory backend by learning-memory-backend-2213-20261101; grading by crypto-realization-grade-2213-20261101; local client by c2-mem-primitives-1730-20261101; adapters/integration by codex-ram-realization-c2-20261101. All new public API needs outside-fleet review.
Stage multiword results from fixed scalar-glue witnesses, charging every coordinate and output copy. Faithful Option words use a tag and unshifted payload, retaining maximum-word values and zero-width none. Consume the unchanged published Stack.Memory methods over full runtime layout words. Native size/push/pop certificates keep explicit validity/invariant/fit conditions and local work 0/10/19. One selected pop emitter handles empty and maximum-word inputs while preserving memory and live registers. This is a bounded #2213/#2205 milestone. The framed queue and faithful allocated queue-client path remain open. No abstract selection or headline changes. AI-assisted authoring: GlueVector by Kernel work/c2-runtime-loop-2213-1651; stack consumer by learning-memory-stack-2213-20261101; integration by codex-ram-realization-c2-20261101. Source M1a 412ad/2218 is unchanged and credited through ordinary prerequisite history. Outside-fleet review remains required.
Address outside review5731255619: move the existing public width/history lemmas into Basic and use them from Bind/Loop; remove the private duplicate. Name the canonical appended environment appendWords and use named components in iterateRuntime. Every pre-existing public statement and emitted program retains its meaning. Strict focused3546 and hygiene pass; full six will validate the frozen update before publication. Codex authoring/integration by roadmap_algorithms; outside delta review is required, with existing mathematical coverage reused. No selected abstract impact.
…m-memory-stack-c2-20261101
Address outside review5731265464. Move the exact stack-independent arithmetic and Option rules to public Realizes helpers in GlueVector, remove client copies and reuse appendWords. Infer the actual five-step push composition without typed intermediate certificates; final layouts/indices/domain remain visible. Statement meanings, clocks, source methods and tests are preserved. Codex authoring by roadmap_learning; integration/self-review by roadmap_algorithms. Ordinary parent merge carries2230a929 fix. Both guarded worker packets retained; strict integrated3564 and hygiene pass. Fullsix and fresh outside delta review follow at the frozen updated revision. No selected abstract impact or broader M1 completion claim.
Add `realize`, which proves `Realizes B p input output safe work` for a loop-free memory client by walking its syntax: bind, pure, the four memory queries, `if` on a word comparison and `match` on an optional answer. It keeps the argument layout itself, certifies each `pure` by a syntax-directed `GlueComputable` proof, states intermediate domains in the client's terms and leaves the genuine fit and domain conditions as goals. `Realization/Absorb.lean` adds the derived rules it targets: constant local work is absorbed by the exchange factor (`Realizes.mono_mul`), giving `bind₀`, `branch₀` and `pure₀`, plus `Realizes.congr` and the `WordEncoding` class for intermediate answers. Refs #2205. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_015DLg8kwPs8yi7ePPdtoNvG
Generalize `Realizes.mono_mul` to local work dominated by the memory charge, and add `Realizes.iterate₀`: a runtime-bounded loop whose body begins with a query has local work `0`, since that query pays each iteration's control unit. `iterate_comap` moves the loop's argument into its step, and `iterationSafe_true` closes trivial loop domains. `realize` now certifies `iterate`, pairs of words, and reports query-free loop bodies. Refs #2205. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_015DLg8kwPs8yi7ePPdtoNvG
Add `blockWords` and its `WordEncoding` instance, so binds may return blocks and layouts. `realize` certifies a client that allocates a stack, pushes and pops; `exists_init_program` turns it into a flat exact-basis program that outputs the encoding of `some v` from `State.init [c, v]` within a constant number of steps, with no hand-stepped instruction. Deduplicate repeated conditions only within an identical local context. Refs #2205. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_015DLg8kwPs8yi7ePPdtoNvG
Ordinarily merge fixed actual main 23c9b4b with public source 27e8ada. Preserve the exact own layers of #2268, #2281, #2294 and #2300, current-main Backend/Frame/client entries, documentation, pins and unrelated changes. The 14-path generic layer and its inverse are source-audited; no private heap/Dijkstra migration APIs are included. Supplier review/CI/landing gates remain separate. No Lean build was run for this source-only checkpoint. AI assistance: OpenAI Codex prepared this ordinary source-only merge; all original supplier authorship and source credit are retained.
Ordinarily merge audited supplier-only991f075f into saved655df7596. Both public27e8 and actual7bf are best bases; Git recursively combines them. Preserve the original50 code/test/deletion afterimages and patch byte-for-byte; transport the two exact project-document spans; retain every other supplier-base entry and canonical aggregate. Supplier-only identity audit:2282#6580697867. No proof, public API or clock is changed by this metadata composition. Final-context validation and independent application review remain required. No public push. AI assistance: OpenAI Codex source-only integration; all Renfei Zhou, Samuel Schlesinger and delegated source/contributor credit is retained.
Fix #2317 in the existing private iterate frontend: substitute live environment captures as the while frontend does, then transport the exact original loop and reached-state domain with kernel-checked fixed-environment inductions. Preserve the noncapturing paths, public calculus and elaborator entrypoint body, original source program, visible fits/work and uniform emitter quantifiers. No new loop rule, model or public mathematical API. Strict focused session5788 passed3648 jobs: unchanged R1/While/Framed/Call/OptionPair/scope, original-domain opaque captured calls and one emitted body on two distinct runtime inputs with zero/two charged iterations/full memory preservation. Identical final regressions fail on exact old27e in output-free session68169. Hygiene/whitespace pass. Circuits directly checked unchanged original F1 Gather/domain/work and native n0w3 with input7 and Fits3 8 false; local acceptance receipt is linked from the issue handoff. No full-six or publication claim; original Samuel/Claude supplier credit retained. AI assistance: OpenAI Codex.
Private F1 checkpoint for #2290: complete original extraction, forest-derived domains, a fixed five-tag Backend, exact typed source/history transport, original-potential amortized charges and footprint preservation. Selected-emitter cases cover zero capacity at width three, maximum unshifted keys, a real child and root-list collision/mark preparation; typed backend client and strict focused checks pass. Hygiene and canonical inventory pass. This focused checkpoint was checked with the exact accepted #2323 compiler source 1b87 overlay, which is excluded from this commit and will immediately be retained by its separately authorized ordinary supplier merge. Current all-six, outside application/API review and full caller migrations remain open. Initialization, Dijkstra/MinPQ migration, legacy-core removal and Samuel abstract-space decision are not completed. Pure models, legacy clients and abstracts remain unchanged. AI assistance: Codex implementation and self-review.
Private ordinary composition of exact #2323/9b990 into the focused F1 five-method checkpoint. Only the exact accepted Tactic source1b87 and its regression test are inherited; every own payload and unrelated tree entry, mode, pin, model and abstract is preserved. Original source and review credit retained. No canonical refs, upstream branch or actual-main disposition changed. Remaining supplier/API/actual gates and full F1 validation apply.
Private #2290 development composition of frozen binary e99e49b and F1 b959c53, preserving all reviewed application payloads and credited supplier 9b990eb. Only ROADMAP.md conflicted; resolution retains every binary-side byte and adds the exact F1-owned status span and issue reference. Generated imports are canonical. No validation or API approval is inferred.
Ordinary merge of outside-approved 27e8ada with fixed actually-landed Std parent fed3c59. Preserve all five reviewed source/client payloads and modes exactly; retain every unrelated actual-main entry, all Std source/clients and its complete manual section, pins and abstracts. Original and effective full six-path feature round-trips pass literally on original/current bases. The one original LinkCongr import is canonical among3,981 library imports; all5,543 unrelated entries and332 historical copy guards pass. No proof, public API, definition or client repair. Resolve inherited supplier add/add/doc conflicts to exact main under source==true287e-base guards; retain approved Tactic under main==base preimage guard. Reuse outside source/API review6579489405; no fresh math approval or Lean/changed-context validation is claimed. Independent carry and current canonical native evidence remain before integration. Original Samuel/Claude source and Learning/Crypto implementation credit, author refs and prior outputs remain unchanged. AI assistance: OpenAI Codex, codex-2300-actual-std-bpl-20261102, performed this source-only refresh under LogsQ. The separately authorized manual-only child follows; no canonical publication or queue action is included.
Add the authorized reader path to automation.md: exact import and scope activation, local zero-work certificates, live-word reindexing, charged computed-argument staging and domains at the actual reached memory. Link the existing complete scope/call clients rather than copying Lean. Add the short LinkCongr reference in memory-specifications.md, retaining its complete answer/state/history premise and separate native-cost task. The landed Standard section remains verbatim; no other manual changes. Manual impact: update the Algorithm/Operator's Manual API/proof guidance. No Agent Operator's Manual edit: roles, human direction, delegation, review and handoff procedures are unchanged. No selected abstract or catalogue statement/scope/rendering impact. Original code/API/source credit is retained with all five reviewed payloads exact. Both documented Python checks and all37 controls pass; whitespace passes. Documented private PDF build/freshness and affected-page review follow on this clean frozen child, recorded in the final handoff. No Lean build or new-context native validation is claimed. Outside source approval6579489405 is reused; independent source/doc carry review remains required. AI assistance: OpenAI Codex, codex-2300-actual-std-bpl-20261102, authored this bounded documentation child under LogsQ; no canonical publication, source/API repair or queue action is included.
Reuse the existing framed queue, source client and amortized potential. Preserve both original existential endpoints, graph encoding, word envelope and sharper reachable-vertex clock while exporting the exact whole final memory/frontier. Share the binary history/domain proofs, migrate the original graph clients and explicitly supersede the old Dijkstra executor and coefficient-640 helpers. Keep the MinPQ-used Fibonacci execution core and its source credit. Private #2290 implementation checkpoint. Default scripts/check.sh passed all six gates with two Lean threads on staged tree 5d348b8. Focused same-program graph/parallel/unreachable/edgeless clients, unchanged binary client and both selected abstract audits pass; hygiene/aggregate pass. All public binary statements and named Fibonacci endpoint types are unchanged. Whole-F1 outside correctness/API review and publication planning remain pending. Evidence: audits/learning-dijkstra-fibonacci-2290-20261102/full-six-terminal.json under the authorized Extra-drive team root; coordinator scope #2290 comment 6584355323 preserves the remaining F2/core/space/whole-client objectives. AI-assisted implementation by Codex; retains Renfei Zhou and Samuel Schlesinger credit and Circuits' unchanged method-family layer. No abstract headline change.
Source-only ordinary composition of fixed public ca7 and capture9b; exact two-path own patch, all other ca7 entries retained. No F1 application code or validation claim.
Ordinary merge of public e99 into public ca7+capture9b. Retain the original fifty-path binary code/test/deletion patch byte-for-byte, exact public capture entries, unrelated actual ca7 entries, and canonical imports. Resolve only ROADMAP metadata, retaining the actual queue contract and binary endpoint/clock sentences. No private Fibonacci source or parent is included. This is a source-identity preparation checkpoint, not correctness/API approval, a validation run, or publication authority. Original source authorship and pending supplier gates are preserved.
|
Current source is Outside whole-F1 APPROVE covers all original method, caller, shared-API, retirement, manual and affected-Bridge changes at Current local validation: one default Both manuals were assessed. Documented Python checks/37 controls and the current 189-page book build/freshness pass; affected pages 143–144 and retained-checkout client links were inspected under the independent carry. The unrelated inherited Crypto heading's 0.5766pt overfull warning is qualified evidence, not a new F1 finding. Agent Operator guidance needs no edit. Selected abstract statements/catalogue are unchanged; DijkstraBridge changes only its source-route prose. Render evidence is in The initial stacked hosted source execution remains certified historical evidence: run 41525102489/job 125550688279 passed all six at The capture supplier and binary migration have completed their actual landing, own queue and shared first-main usable-publication gates; the binary record owns that cache evidence. Fresh strict source previews over current main and both physical prefixes preserve reviewed code/manuals and unrelated entries, with canonical 4,024/4,025 imports; these previews are not executed CI. Current hosted F1 execution and required source checks are verified. Normally admitted at 22:25:28 UTC behind the existing #2324 and #2338 entries, without jumping the queue. Physical candidate |
|
Coordinator |
|
Independent whole-F1 review: APPROVE The five method certificates are fixed before runtime parameters. Source views preserve the original memory programs, results and query histories. Extraction's canonical three-word optional pair is a faithful erasure of the typed source, not a cheaper alternate algorithm. Cut/decrease domains come from the original invariant; cascade termination uses the reached forest's marked-count rank, while scattering uses decreasing slots. The proof bounds do not truncate native execution. Allocation reserves the original layout and preserves old contents; zero-above hypotheses are used explicitly when constructing the heap invariant. The Backend scales the original nonzero potential. Dijkstra retains that potential and its locality through the existing disjoint framed product and amortized telescope; only the initial potential is zeroed from the input's zero tail. Shared Domain/Word reasoning retains valid remaining histories, key bounds and real early exit, and the binary consumer retains its source/endpoint. One Fibonacci program, register layout and factor precede all graphs and widths. The unchanged word envelope covers the exact Clients exercise the native method boundaries and preserve the parallel-edge/multi-hop, unreachable and sparse-edgeless cases. One program gives the source distances and frontiers Both manual assessments pass. I inspected the exact-head rendered GitHub endpoint page and complete client, and checked its local source links. The page explains imports, premises, cost boundaries, retirement and remaining scope. This was a GFM visual review, not an independent book-PDF render. Agent Operator guidance needs no edit because roles and handoffs are unchanged. The original Hosted CI passed all six Lean gates and manual tooling. The recorded actual checkout |
Source-only ordinary merge of published fa657 and fixed actual c417. Original41 code/test/deletion beforeimages equal the public supplier and actual main; preserve every published afterimage and original patch exactly. Resolve only the enumerated squash-context source overlaps to those guarded afterimages/deletion, literal owned project-doc spans, fulfilled binary-manual/F1 insertion, and canonical imports. All unowned actual K1/K3/Core/Std/Crypto/manual/pin/abstract entries remain exact. No API/proof/domain/algorithm repair, Lean/full validation or publication claim. Circuits retains method authorship and Learning caller/public-head ownership; whole-F1 outside review remains pending. Coefficient640 retirement and F2/core/space gates are unchanged.
|
Coordinator All 41 original code/test/deletion afterimages and their complete patch are exact Saved 37 Python controls and the documented 189-page book build/freshness pass. I inspected affected pages 143–144 and retained-checkout source links. One inherited, unrelated Crypto heading has a 0.5766pt overfull warning; it is qualified evidence, not a new F1 gate. Preservation receipt: This is agent preservation review, not human approval. Fresh actual-context focused/full validation, publication and current-prefix admission remain required under LogsQ; F2, the live MinPQ/core and space objectives remain open. |
Closes #2290 (the F1 milestone); contributes to #2205 and #2213. This is the coherent F1 five-method and Dijkstra migration. It replaces the old Dijkstra executor with native code for the existing Fibonacci memory methods and the existing framed shortest-path client. It does not complete the separate MinPQ/F2 migration, retire the core that MinPQ still uses, or settle the abstract-space question.
All five method emitters are fixed before runtime capacity, key bound, base and word width. They preserve the original source result, full memory/frontier and query history. Extraction uses exactly the typed source program with its handle type erased to the canonical three-word optional-pair encoding; no decoder or cheaper alternate program is introduced. The shared native history/key/remaining-edge/domain leaf is consumed by both heap clients. The existing disjoint framed product and
Refinement.Amortized.clienttelescope retain the Fibonacci heap’s nonzero potential; decrease and extraction do not acquire worst-case constant native bounds.Native.Fibonacci.exists_program_statechooses one flat program, register layout and instruction factor before every graph and width. It preserves the original adjacency-list encoding,Fits w (8*(n+m+2)*(W+2)), halt-inclusive sharper boundC*(m+min(n,m+1)*(floorlog₂(n)+1)), encoded distances and complete final source memory/frontier. Native arithmetic, argument copies/staging, early-exit control, register/frontier initialization and halt are charged. Raw graph placement inData.initremains uncharged, as in the existing theorem. Its zero tail permits dirty reservation of the distance table and original9*n+5heap layout without a linear clear or extra initialization premise. The actual final frontier is11*n+2*m+9.The exact
FibonacciSpec/FibonacciLinearSpec, both existential statement types, and namedfibonacciSpecStatement/fibonacciStatementendpoints remain unchanged. The oldfibDijkstra,fibDijkstra_spec,fibonacciSpecandfibonacciLinearSpecimplementation-specific coefficient-640 helpers are explicitly superseded under the coordinator’s retirement disposition; 640 is not asserted for the native witness. After migrating their last consumers, the unused GenericPQ Dijkstra executor is removed. Model/Trees/Forest, PQCode/Basic and the Fibonacci execution core used by MinPQ/FibonacciHeapBridge are retained.The PR now targets main through an ordinary actual-parent preservation carry. The fixed comparison from actual binary
c417845aexposes all 45 distinct changed paths; all 41 original code/test/deletion afterimages remain exact to the outside-reviewed source. Binary manual guidance is already on main, and only the reviewed F1 insertion remains in this manual diff. The Algorithm Manual explains the native reader route, actual initialization/domain/frame/amortized conditions, delivered-argument body costs versus charged whole callers, retirement and remaining limits. Agent Operator guidance needs no edit. Selected abstract statements and catalogue are byte-identical; DijkstraBridge changes only its source-route explanation, with bridge proof code unchanged. No headline promotion or abstract-space change is proposed.Current actual-parent local validation passed one default
scripts/check.shwith two Lean threads: all six Lean gates and both manual gates. Focused checks retain both native clients, both abstract audits and one same program on the original parallel-edge/multi-hop, unreachable and sparse-edgeless graphs. The documented book build/freshness, Python checker/37 controls, affected rendered pages and retained-checkout links pass. The single source, validation and review record links exact current evidence, the outside whole-F1 approval and independent actual-parent carry. Current hosted native CI passed all six strict gates in the certified actual-main tested context, with Guide/Formal metadata successful. Initial stacked CI remains historical. Normal queue admission is complete; LogsQ owns queue execution, actual landing and usable publication.Binary and capture suppliers have actually landed and completed their own queue/shared usable-publication gates. The current F1 source is published against main with whole-application coverage carried forward. Current executed-context and required source checks passed, and normal queue admission completed at 22:25:28 UTC behind the existing entries. Own merge-queue execution, actual landing and usable cache remain under LogsQ’s watch, as recorded in the canonical evidence; no landing is claimed here. The new source/domain/native realization proofs are original infrastructure for the existing checked algorithmic contract, not a new asymptotic algorithm claim. Renfei Zhou and Samuel Schlesinger source credit, original Claude design/source work and Circuits/Learning/Kernel/Crypto/Algorithms contributions are preserved. AI-assisted by OpenAI Codex. No new author-fleet mathematical approval or broader F2/core/space/#2205/#2213 completion is claimed.