SNAPKITTYWEST's picture
push from SNAPKITTYWEST/topological-quantum-computer
d6f21bb verified
|
Raw
History Blame Contribute Delete
4.1 kB
# Topological Quantum Computer Package Manifest
Package: `topological-quantum-computer`
Version: `1.0.1`
Release date: 2026-08-18
Repository: `SNAPKITTYWEST/topological-quantum-computer`
## Package Identity
Topological Quantum Computer is the staged institutional package for
Fibonacci-anyon topological quantum-computing research, reduced-round
SHA-family cryptanalysis experiments, proof-directed boundary analysis, and
falsifiable resource accounting.
This package is a research artifact. "Production" means the repository has
release metadata, licensing, audit notes, setup guidance, and reproducible
commands. It does not mean physical quantum hardware exists or that full-round
cryptanalysis is authorized or demonstrated.
## Contents
| Path | Package role |
| --- | --- |
| `README.md` | Institutional entry point |
| `ABOUT.md` | Short project overview |
| `LICENSE.tri` | Tri-license structure |
| `VERSION` | Version marker |
| `RELEASE_NOTES.md` | Current release notes |
| `CODEX_AUDIT.md` | Audit findings and residual gates |
| `CLAUDE.md` | Integrity gates and project vision |
| `BUILD_STATUS.md` | Build/audit checklist |
| `BUILD_COMPLETE.md` | Build completion summary |
| `lean/` | Lean 4 formalization surfaces |
| `python/` | Python classical, quantum, and simulator modules |
| `experiments/` | Four-phase experiment scripts |
| `docs/` | Architecture, falsification, resources, threat model, user guide |
| `python/qlambda/arrays.py` | SHA-520 IV/K arrays, round arrays, primitive arrays |
| `python/qlambda/compiler.py` | Q-Lambda lexer/parser/QIR synthesizer |
| `python/qlambda/license_policy.py` | Array-backed license-policy engine |
| `python/topological/` | QIR-to-Fibonacci-braid resource backend |
| `pyproject.toml` | Python package metadata |
## Release Gates
The package may be published as a staged research repository release when:
- Version files and release notes are present.
- README states the purpose, constraint-system boundary, and negative
cryptanalytic result clearly.
- License text matches `LICENSE.tri`.
- License policy can be selected through `python -m qlambda.license_policy`.
- GitHub About metadata and topics identify the research scope.
- Release notes do not overclaim Lean, Qiskit, hardware, or full-round results.
- Python syntax/import checks pass in the release environment.
- Reduced-round classical validation passes.
Additional gates are required before stronger claims:
- Lean/Lake build under the declared theorem environment.
- Critical theorem review with placeholders, `sorry`, `axiom`, and conjectures
explicitly classified.
- Qiskit Aer or equivalent quantum-simulation dependency installed and Phase 2
executed rather than skipped.
- Resource validation upgraded from estimate-only to measured compiler output.
- No full-round SHA attack path added without a separate legal/safety review.
## Validation Snapshot
Observed locally during packaging:
| Check | Result |
| --- | --- |
| Python AST syntax scan | PASS |
| `pyproject.toml` parse | PASS |
| Module import smoke test | PASS |
| Phase 1 classical validation | PASS |
| Phase 2 quantum simulation | RESOURCE_ESTIMATE_NO_QISKIT when Qiskit is unavailable |
| Phase 3 resource validation | ESTIMATE_ONLY |
| Phase 4 topological compilation | PASS-THEORETICAL |
| Lean/Lake build | PASS-LOCAL for `FibonacciAnyon LogicalQubits BraidCompilation QuantumGates Main` |
## GitHub Topics
Recommended repository topics for `v1.0.1`:
- `topological-quantum-computer`
- `fibonacci-anyons`
- `quantum-computing`
- `quantum-algorithms`
- `grover-search`
- `cryptanalysis`
- `sha-520`
- `sha-512`
- `lean4`
- `formal-methods`
- `constraint-systems`
- `proof-directed-search`
- `falsifiable-research`
- `qiskit`
- `tensor-network`
- `sovereign-compute`
## Release Artifact
The GitHub release should use tag `v1.0.1`.
Release assets are the automatic source archives generated by GitHub unless a
separate signed artifact is explicitly attached later.