Build the post-quantum migration layer before it becomes urgent
QLSA aggregates thousands of post-quantum signatures into a single constant-size proof, targeting scalable blockchain verification without trusted setup and without forcing a hard fork.
QLSA (Quantum-Layered Signature Aggregation) is an open deep-tech project exploring how ML-DSA, Merkle commitments, and STARK proofs can make post-quantum blockchain systems operationally viable.
The Problem
Direct migration from classical signatures to post-quantum signatures can severely inflate block payloads. That turns protocol safety progress into an operational scaling problem.
| Signature | Size | 3000 tx block | Operational impact |
|---|---|---|---|
| ECDSA (current) | ~70 bytes | ~220 KB | Fits today’s assumptions |
| ML-DSA-65 (FIPS 204) | ~2,420 bytes | ~7.2 MB | Severe throughput penalty |
The Solution
QLSA is not a new signature scheme. It is a post-quantum aggregation layer that aims to make large signature sets proof-friendly, compact, and verifiable at fixed on-chain cost.
What QLSA does
- Aggregates
NML-DSA signatures into one batch commitment - Uses Merkle commitments to structure batch data
- Generates a STARK proof for batch correctness
- Allows fixed-cost on-chain verification independent of batch size
Why the architecture matters
- Heavy proving remains off-chain
- Public inputs can be kept minimal with commitment roots
- MVP can ship before full ML-DSA-inside-AIR is solved
- The system remains crypto-agile across future upgrades
Architecture
The system is split into three layers so that user flows stay familiar, proving stays off-chain, and on-chain verification remains lean.
Signing
Wallet-level signing using post-quantum keys.
- ML-DSA-65 for signatures
- Address derived from
SHA3-256(pubkey) - Intended to preserve a familiar wallet-style UX
Aggregation
Batch formation and proving pipeline.
- Collect transactions off-chain
- Verify ML-DSA signatures off-chain in the MVP
- Build Merkle tree with
SHA3-512 - Generate STARK proof for correctness claims
Verification
Constant-cost contract-side validation.
- Verify proof in Solidity verifier contract
- Store
merkle_rootand finalize the batch - Favor commitment roots over raw pubkey arrays in public inputs
MVP Strategy
The project intentionally separates realistic implementation milestones from the hardest research component.
| Stage | What STARK proves | ML-DSA in STARK |
|---|---|---|
| MVP-1 | Core crypto only | No |
| MVP-2 | Merkle correctness | No |
| MVP-3 | ML-DSA verification | Research target |
Key risks
- ML-DSA inside STARK: NTT and modular arithmetic can make AIR expensive.
- Aggregator trust model: the MVP relies on off-chain verification before challenge systems exist.
- Adoption timing: the need is real, but mainstream migration may still take years.
Tech Stack
The technical stack reflects a staged path: fast iteration now, stronger proving infrastructure later.
Cryptographic core
- ML-DSA-65
- SHA3-512 for Merkle hashing
- SHA3-256 for address derivation
- Python 3.10+
liboqs-python >= 0.14.0
STARK layer
- Winterfell for prototyping AIR
- Stwo / Circle STARK for production path
- FRI-based proofs
- No trusted setup
Contracts & infra
- Solidity + Hardhat
- Target L2: Polygon zkEVM or Starknet
- Aggregator node architecture planned
- Benchmarks and docs published in-repo
Performance targets
| Batch size | 3,000 tx |
| Proof size | 90–200 KB |
| On-chain verification | O(1) |
| Current proving focus | Merkle-first MVP |
Repository snapshot
QLSA/ ├── core/ ├── aggregator/ ├── stark/ ├── contracts/ ├── sdk/ ├── benchmarks/ ├── docs/ ├── tests/ └── CONTEXT.md
Roadmap
The roadmap prioritizes a credible implementation path before expanding into the hardest proving research.
Phase 1 — Core
In progressML-DSA keys, signing, verification, and Merkle tree implementation.
Phase 2 — STARK Prototype
PlannedMerkle correctness inside STARK, plus benchmarks and feasibility measurements.
Phase 3 — Smart Contracts
PlannedOn-chain verifier and batch registry for fixed-cost verification flow.
Phase 4 — Aggregator Node
PlannedMempool integration, batching logic, and off-chain proof pipeline.
Phase 5 — SDK
PlannedDeveloper-facing Python and JavaScript tooling for wallet and transaction integration.
Phase 6 — Testnet
FuturePublic deployment, end-to-end demo, and benchmark-backed technical validation.
FAQ
Short answers to the questions most people will ask when they first encounter the project.
Is QLSA a new signature algorithm?
No. QLSA is an aggregation and verification architecture built around post-quantum signatures such as ML-DSA.
Why not just replace ECDSA directly?
Because the size increase of post-quantum signatures can cause major throughput and cost problems if deployed naively.
Does the MVP already prove ML-DSA inside STARK?
No. The MVP intentionally starts with a lower-risk path and treats full ML-DSA-inside-STARK as a later research milestone.
Is this production-ready?
No. QLSA is currently research-stage software and should not be used in production systems.
Interested in PQC, ZK proofs, or blockchain infrastructure?
QLSA is an open research and engineering effort. Contributions, technical feedback, research discussion, and collaboration are welcome.