Solana’s transaction and consensus security relies on ED25519 signatures and SHA-256 hashing. Large-scale quantum computers could compromise these primitives in the future. This research explores post-quantum signature integration and hybrid transaction strategies for Solana, focusing on maintaining high throughput, validator performance, and minimal network disruption.
This proposal is purely academic and does not alter the Solana protocol.
1. Introduction
Solana achieves high throughput with:
-
ED25519 signatures for transaction validation
-
SHA-256 hashes for block integrity
-
Tower BFT consensus
-
Proof-of-Stake validators
Quantum attacks threaten the signature layer first. Preparing quantum-resistant upgrades early ensures long-term network security.
2. Cryptographic Background
2.1 ED25519 & Shor’s Algorithm
-
Security based on elliptic curve discrete logarithms
-
Quantum computers can theoretically recover private keys via Shor’s algorithm
-
Transactions using exposed public keys become vulnerable
2.2 Hashing & Grover’s Algorithm
-
Grover’s algorithm provides quadratic speedup for brute-force attacks
-
256-bit hashes → ~128-bit effective security
-
Hash functions remain secure; signature layer is priority
3. Threat Model
-
Quantum adversary with capability to recover private keys
-
Access to public keys on-chain
-
Attempting key recovery within transaction confirmation window
Not assumed:
-
Instantaneous break of SHA-256
-
Compromise of Tower BFT consensus
4. Upgrade Constraints
Any quantum-resistant solution must:
-
Preserve Tower BFT consensus
-
Maintain validator high throughput (TPS)
-
Be backward-compatible where feasible
-
Limit transaction size increase
-
Protect staking and account integrity
5. Strategy I — Hybrid Transactions
-
Transaction includes both ED25519 and PQ signatures (Dilithium, Falcon)
-
Valid if both signatures pass
-
Pros: layered security
-
Cons: larger transaction size, higher verification load
| Signature | Size | TPS Impact |
|---|---|---|
| ED25519 | 64 B | minimal |
| Dilithium L2 | 2420 B | moderate |
Mitigations:
-
Batch verification
-
Signature aggregation research
6. Strategy II — Optional PQ Accounts
-
Introduce quantum-resistant account type
-
ED25519 accounts remain valid
-
Validator software checks PQ signatures for new accounts
-
Pros: voluntary adoption, low disruption
-
Cons: legacy accounts still vulnerable
7. Strategy III — Full PQ Migration
-
Replace ED25519 completely
-
All accounts and transactions use PQ signatures
-
Pros: maximal security
-
Cons: high coordination cost, staking / wallet disruption
8. Economic & Validator Considerations
-
PQ signatures = higher computational cost → fee adjustments needed
-
Validator adoption depends on throughput & resource usage
-
User adoption requires wallet support and migration incentives
9. Migration Roadmap (Research Proposal)
-
Support optional PQ accounts
-
Introduce hybrid transactions
-
Evaluate deprecation of legacy accounts
-
Full PQ protocol upgrade only when threat materializes
10. Open Questions
-
How to optimize PQ signatures for high TPS Solana chains?
-
Aggregation techniques for reducing transaction overhead
-
Quantum-resistant staking & delegation models
-
Off-chain / layer-2 PQ solutions
11. References
-
Shor, P. (1994). Algorithms for quantum computation.
-
Grover, L. (1996). A fast quantum mechanical algorithm for database search.
-
NIST Post-Quantum Cryptography Standardization Project
-
Bernstein et al., CRYSTALS-Dilithium / Falcon specs
12. Conclusion
Quantum-resistant strategies for Solana are technically feasible, with hybrid and optional PQ accounts as near-term solutions. Full PQ migration remains a long-term research and coordination challenge. Early study strengthens protocol resilience and positions the ecosystem to respond before quantum threats become practical.
If you find this research useful, donations in SOL are welcome to support further studies: 3UPmUVPid3oVjBJCD23kpNpEdoZrieVEUEGTBtW8E2yR