| Filename | Latest commit message | Latest commit date |
|---|---|---|
3e7811fbbb
All checks were successful
WAI conformance / cargo-class corpora · windows (push) Successful in 1m29s
WAI conformance / cargo-class corpora · linux (push) Successful in 1m39s
WAI conformance / cross-arch byte-equality · linux (push) Successful in 14s
WAI conformance / cross-arch byte-equality · windows (push) Successful in 23s
WAI conformance / cargo-class corpora · linux-arm64 (push) Successful in 2m46s
WAI conformance / cross-arch byte-equality · linux-arm64 (push) Successful in 56s
WAI conformance / cargo-class corpora · macos (push) Successful in 20m46s
WAI conformance / cross-arch byte-equality · macos (push) Successful in 24s
Register preparation as a signed plan: a deterministic Hungarian / linear-sum- assignment solver that turns a stochastic ~half-full trap load into a defect-free target array at minimum total move distance. - quantum_atom.rs: a trap Array (stochastic load); a centered defect-free target block; the Hungarian algorithm (Kuhn–Munkres with potentials, O(n²m)) over integer Manhattan costs assigning every target site a distinct atom; a Plan (moves + total distance) with an order-independent set verifier (sources present, targets a bijection, every target covered). random load + rearrange_and_seal. - quantum_ops.rs: RearrangeReceipt binds (initial occupancy hash, target hash, plan hash) → (success, atoms_moved, total_distance, joules); merkle + Ed25519, joule ceiling in verify(). success is in the receipt (re-checkable). - wai-web: RearrangeDemo binding (plan + yield transformation + tamper-rejection). Honest boundary: a geometric/combinatorial model — the solver and its optimality are exact (tested vs brute force); transport/loss/AOD physics is out of scope. Tests green (Hungarian optimal over 30 instances, defect-free, infeasible-when- too-few, tamper caught, already-placed atoms don't move). Co-Authored-By: Claude Opus 4.8 <[email protected]> |
||
| .. | ||
| demo | ||
| src | ||
| Cargo.lock | ||
| Cargo.toml | ||