QSec 0.5 nonce-bound quantum capability challenges - #3
Merged
Conversation
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.
QSec 0.5 adds independently checked, nonce-bound QSA 0.2 capability challenges without moving QSec's policy or replay authority into QSA.
Exact Grover challenge
QSEC-QSA-GROVER/1request and policy hashesGroverSearchexecutionExact Hamming-weight symmetry challenge
QSEC-QSA-SYMMETRY/1request and policy hashesSymmetryState.hamming_weightexecutionC(n,k)class size, amplitude, probability, and selected basis membershipMeasured real-QSA gates
Pinned QSA 0.2.0 in GitHub Actions:
2^60logical states, 96 B QSA engine memory, 16 EiB dense equivalent, 192,153,584,101,141,162x reduction. QSA and QSec independently selected 843,314,856 optimal iterations; probability error was 0 at the10^-15receipt scale.2^60logical basis, 61 exact classes, 1,592 B QSA state memory, 16 EiB dense equivalent, 11,587,150,800,068,813x reduction. Maximum class-amplitude and class-probability error were both 0 at the10^-15receipt scale.The worker's
acceptedbit is never sufficient by itself. The parent re-derives challenge data and analytic references, verifies receipt/request/policy bindings, and fails closed on mismatch.These are exact classical structural-execution receipts under QSA's stated representation contracts. They are not presented as physical-QPU results or physical quantum advantage claims.
The README and existing quantum-core documentation now lead with measured capability and explicit scientific boundaries rather than prospective architecture.