Validate submission d9d9fab0-57a6-4e03-863f-1c3a9c59ad78 - #22
Closed
yukon-autoresearch[bot] wants to merge 1 commit into
Closed
Validate submission d9d9fab0-57a6-4e03-863f-1c3a9c59ad78#22yukon-autoresearch[bot] wants to merge 1 commit into
yukon-autoresearch[bot] wants to merge 1 commit into
Conversation
Co-authored-by: gnuchev <859355+gnuchev@users.noreply.github.com>
Author
|
Benchmark workflow dispatched: view run #30890383062. |
Author
|
Scored 182501937973 — does not improve the current best 1486468554; not promoted.
|
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Yukon submission
d9d9fab0-57a6-4e03-863f-1c3a9c59ad78against https://github.com/Layr-Labs/ecdsafail-challenge at6909d15d5642acbc643e075fb7cae393ef8132ef.Current best score: 1486468554. This PR's own benchmark run scores the head commit;
the PR is merged automatically if the submission is accepted, and closed with the result otherwise.
Submitter note
Model: GPT-5 Codex
Q823 exact adjacent-CCX cancellation
This submission starts from the validated Q823 Paper2607 aux-11 streaming source
in submission
dacbe1f/ source commit880b642and applies a local,semantics-preserving operation-stream simplification. It is intended as a
strict replacement for the existing rejected-only Q823 Pareto point, not as a
claim about the main promoted leaderboard.
Within each uninterrupted run of Toffoli operations, adjacent identical
CCXrecords cancel in pairs. A Toffoli gate is self-inverse, and record equality
includes both controls, the target, the classical condition, the classical
target, and the register field. Every non-
CCXoperation flushes the pendingrun. The same rule is implemented in the ordinary in-memory builder and in the
low-memory streaming writer.
Measured effect:
The frozen source was tested through the official
ecdsafail runcommand:This is an exact structural simplification. It does not depend on a tail nonce,
an empirical support window, a selected hash island, or an omitted input family.
Credit to nasqret and the preceding Paper2607 Q823 lineage for the underlying
circuit.
Objective and isolated source
The rejected-only Pareto chart contained a public Q823 point at 221,993,915
average executed Toffoli operations. The narrow objective was to produce a
strict, reproducible improvement at the same qubit count so that the old point
is dominated geometrically. Even a one-gate exact reduction would be sufficient;
the measured reduction is 241,864 gates.
The source was checked out into a dedicated Git worktree directly from public
submission commit
880b642. No code from unrelated experiments or neighboringdirty worktrees was mixed into the candidate. The original Q823 configuration,
register schedule, Paper2607 arithmetic, aux-11 choice, and simulator contract
remain unchanged.
Audit and hypothesis
The working hypothesis was that very large generated circuits can retain
mechanical self-inverse pairs at construction boundaries even after their
higher-level arithmetic has been optimized. A temporary count-only diagnostic
compared complete adjacent operation records. It found repeated identical
CCXpairs, making an exact peephole reduction possible without changing arithmetic
algorithms or qubit allocation.
The diagnostic itself was removed from the frozen candidate. The submitted
source contains the actual rewrite and a precise removed-gate counter. The
rewrite uses a stack reduction, so a sequence such as
A B B Areduces first toA Aand then to the empty sequence. It never searches for a matching gate pastan intervening operation.
Exactness argument
For any Toffoli operation
U, applying the identical operation twice givesU * U = I. A pair is removed only when the completeOpvalues compare equal.The comparison includes:
No commutation rule is used. Gates are never reordered, and a pair is never
cancelled across an
X,CX, measurement-randomization operation, conditionpush/pop, declaration, or any other record. Condition-stack changes are
non-Toffoli records and therefore force a flush before the next run. Each
cancelled pair consequently executes under exactly the same surrounding
classical condition.
Removing
U * Uis value exact and phase exact. It creates no measurement,allocates no ancilla, changes no declared register, and changes no free-list
lifetime. Peak logical width must remain 823. The proof is local to the emitted
operation stream and does not rely on the verifier's Fiat--Shamir sample.
Implementation details
The circuit-source change is confined to
src/point_add/mod.rs.For low-memory streaming construction,
OpStreamWritermaintains a pendingvector for the current uninterrupted
CCXrun. If the next record equals thetop record, the top is popped and neither pair member is written. Otherwise the
new record is pushed. A non-
CCXrecord flushes the reduced run in originalorder before that record is written. Finalization flushes the last run, closes
the zstd frame, and writes the actual shortened record count into the header.
For ordinary in-memory construction, the same stack rule is implemented in
place using read and write cursors. Popping a pair decrements the write cursor;
keeping a gate copies it to the current write position. The vector is truncated
to the final length. This adds constant auxiliary memory and ensures that the
official benchmark path and the archived streaming path implement the same
transformation.
The optimization is enabled before creation of the submitted TrailMix builder.
The streaming finalizer permits the emitted count to be below the builder's raw
count only for this explicit transform. Other routes retain the original count
equality assertion.
No Clifford peepholes are enabled. Deleting Clifford identities would change
the operation hash without reducing the Q-times-Toffoli score. Restricting the
candidate to identical adjacent
CCXpairs keeps the proof and metric effectdirectly aligned.
Frozen streaming artifact
The optimized low-memory operation stream was archived outside the worktree at:
Its measured properties are:
The artifact was replayed by the trusted evaluator before the official CLI run.
That independent replay loaded all 441,961,492 operations, measured Q823 and
221,752,051.000 average executed Toffoli operations, and completed all 9,024
shots with classical, phase, and ancilla failure counts equal to
0/0/0.Official reproduction
The final validation gate was the current CLI workflow from the isolated
worktree:
The Windows checkout initially represented
benchmark.shwith CRLF lineendings. Before invoking the WSL sandbox, the launcher was normalized to LF.
This is a working-tree transport correction only; Git's text filter reports no
semantic benchmark-script patch. The circuit source and candidate commit are
unchanged by that normalization.
The complete official run rebuilt the circuit in its read-only/no-network
sandbox and produced:
The official result exactly matches the prior direct replay. This gives two
full trusted evaluations of the frozen transform, both covering the complete
9,024-shot challenge set.
Failures, selection, and caveats
No correctness failure was retried or hidden. This candidate required no nonce
search, no GPU pod, and no selection among multiple Fiat--Shamir hashes. The
same unchanged hash island that validated the base circuit validates the exact
reduction because the Q823 Paper2607 source does not use a tuned tail nonce.
This optimization intentionally does not claim all possible stream identities
have been removed. It avoids gate commutation, arithmetic resynthesis, and
cancellation across non-Toffoli operations. Those larger transformations may
offer additional savings but need their own correctness argument and full
validation. The conservative adjacent subset already gives a strict same-Q
improvement over the public Q823 point.
Result
The final candidate is Q823 / 221,752,051 average executed Toffoli, improving the
public Q823 rejected point by exactly 241,864 Toffoli operations and lowering its
score by 199,054,072. The authoritative candidate score is the directly measured
182,501,937,973. All metric and correctness claims above come from the frozen
stream and official full benchmark.
Need help on this PR? Tag
@codesmith-botwith what you need. Autofix is disabled.