Dilithion: A Post-Quantum Cryptocurrency

Abstract

Key Features:

• Post-quantum security: CRYSTALS-Dilithium (NIST FIPS 204)
• ASIC-resistant mining: RandomX proof-of-work (DIL chain)
• VDF distribution: Hardware-neutral block rewards (DilV chain)
• Digital DNA: Anonymous Sybil defense with 8 unforgeable identity dimensions
• Fair mining: Miner Identity Keys (MIK) and payout heat tracking
• Cross-chain bridge: Native tokens bridged to Base L2 as ERC-20
• Fair distribution: No premine, pure proof-of-work launch
• Fixed supply: 21 million DIL, 210 million DilV

Important Disclosure

Table of Contents

1. Introduction: The Quantum Threat

1.1 The Problem

Modern cryptocurrency security relies on classical cryptography:

• ECDSA (Bitcoin, Ethereum): Elliptic Curve Digital Signature Algorithm
• RSA: Rivest-Shamir-Adleman encryption
• SHA-256: Secure Hash Algorithm (for mining)

Shor's Algorithm (1994) demonstrated that quantum computers can break ECDSA and RSA in polynomial time. While SHA-256 mining receives only a modest speedup (Grover's algorithm), digital signatures are critically vulnerable.

1.2 Timeline to Quantum Threat

Current State (2025-2026):

• IBM: 1,121-qubit quantum computer (Condor)
• Google: Quantum supremacy claimed
• China: Pan-Jianwei's quantum network

Expert Estimates:

• 2030-2035: Cryptographically relevant quantum computers (CRQC)
• Breaking Bitcoin: Estimated 1,500-3,000 logical qubits required
• Current trajectory: Doubling qubits every ~2 years

Conclusion: Cryptocurrencies must transition to post-quantum cryptography now to remain secure over their multi-decade lifespan.

1.3 Existing Cryptocurrency Vulnerability

Critical Issue: Retrofitting existing blockchains with post-quantum cryptography requires:

• Hard fork (community consensus required)
• Wallet migrations (user action required)
• Backward compatibility challenges
• Risk of botched transition

Dilithion's Solution: Start with post-quantum cryptography from genesis block.

2. Post-Quantum Cryptography

2.1 CRYSTALS-Dilithium

Selection Process:

• NIST Post-Quantum Cryptography Standardization (2016-2024)
• 82 initial submissions
• Multiple rounds of evaluation
• Winner: CRYSTALS-Dilithium (2022)
• Standardized: FIPS 204 (August 2024)

Why Dilithium?

• Security: Based on hard lattice problems (Module-LWE, Module-SIS)
• Performance: Fast signing and verification
• Standardization: Official NIST standard
• Analysis: Years of public cryptanalysis, no serious breaks
• Versatility: Three security levels (Dilithium2, 3, 5)

Dilithion uses Dilithium3:

• Security level: NIST Level 3 (equivalent to AES-192)
• Public key size: 1,952 bytes
• Signature size: 3,309 bytes
• Private key size: 4,000 bytes
• Signing speed: ~1-2 milliseconds
• Verification speed: ~1 millisecond

2.2 Comparison to Classical Cryptography

Trade-off: Dilithion transactions are ~15x larger than Bitcoin transactions, but provide quantum resistance. This trade-off is mitigated by the 4 MB block size limit.

2.3 SHA-3 Hashing

Dilithion uses SHA-3 (Keccak) throughout:

• Address generation: SHA3-256
• Transaction IDs: SHA3-256
• Merkle trees: SHA3-256
• Wallet encryption: SHA3-512 with PBKDF2

Why SHA-3?

• Quantum-resistant (Grover's algorithm provides only quadratic speedup)
• NIST standard (FIPS 202)
• Different construction than SHA-2 (defense in depth)
• Well-analyzed and trusted

3. Technical Architecture

3.1 Dual-Chain Ecosystem

Dilithion operates as a dual-chain ecosystem: DIL (proof-of-work) and DilV (VDF distribution). Both chains share the same post-quantum cryptographic foundation but serve different purposes.

3.2 Transaction Structure

class CTransaction {
    int32_t nVersion;               // Transaction version
    std::vector<CTxIn> vin;         // Inputs
    std::vector<CTxOut> vout;       // Outputs
    uint32_t nLockTime;             // Lock time
};

class CTxIn {
    COutPoint prevout;              // Previous output reference
    std::vector<uint8_t> scriptSig; // Dilithium signature (3,309 bytes)
    uint32_t nSequence;             // Sequence number
};

class CTxOut {
    CAmount nValue;                 // Amount in ions (smallest unit)
    std::vector<uint8_t> scriptPubKey; // Dilithium public key (1,952 bytes)
};

Typical Transaction Sizes:

• 1-input, 1-output: ~3,864 bytes
• 2-input, 2-output: ~9,598 bytes
• Average: ~5,000-7,000 bytes

Comparison to Bitcoin:

• Bitcoin typical: ~250 bytes
• Dilithion is ~15x larger (trade-off for quantum security)
• Mitigated by 4 MB block size limit

3.3 Currency Units

3.4 Block Structure

class CBlockHeader {
    int32_t nVersion;               // Block version
    uint256 hashPrevBlock;          // Previous block hash (SHA-3)
    uint256 hashMerkleRoot;         // Merkle root of transactions
    uint32_t nTime;                 // Block timestamp
    uint32_t nBits;                 // Difficulty target (compact)
    uint32_t nNonce;                // RandomX nonce (PoW) or 0 (VDF)
};

4. Consensus Mechanisms

4.1 DIL: RandomX Proof-of-Work

The DIL chain uses RandomX proof-of-work, the same algorithm used by Monero. RandomX is designed to be optimal for general-purpose CPUs and resistant to ASIC and GPU optimization.

RandomX Characteristics:

• Memory requirement: 2 GB (dataset)
• Algorithm: Random code execution
• Hash rate: ~60-80 H/s per CPU core (consumer hardware)
• ASIC resistance: High (designed to utilize general-purpose CPU features)

Block Parameters (DIL):

Why 4-minute blocks?

• Large signature propagation: Dilithium signatures at 3,309 bytes each require time for global propagation. 4-minute blocks reduce orphan rates compared to shorter block times.
• Blockchain growth: 360 blocks/day vs. 720 at 2-minute blocks—50% reduction in storage growth.
• Confirmation speed: 3 confirmations in 12 minutes (vs. Bitcoin's 60 minutes for 6 confirmations).
• Mining fairness: Network latency (200-400ms globally) becomes a smaller fraction of block time.

4.2 DilV: Verifiable Delay Functions

The DilV chain uses a fundamentally different consensus mechanism: Verifiable Delay Functions (VDF). Instead of competing on hash rate (who has more CPUs), DilV miners compete on luck (lowest output wins) after completing a mandatory sequential computation.

How VDF Consensus Works:

1. Each miner computes a unique VDF challenge: SHA3-256(prev_block_hash || height || miner_address)
2. The VDF performs 500,000 sequential squarings in a class group (using the Chia VDF library)
3. This takes approximately 4-8 seconds on typical hardware
4. The miner with the lowest VDF output wins the block
5. A Wesolowski proof (~100 bytes) allows instant verification (~1ms)

Key Properties:

• Sequential: Cannot be parallelized. Running 100 machines does not help.
• Fair: Every miner has equal probability of producing the lowest output.
• Verifiable: Proof verification takes ~1ms (vs. seconds to compute).
• Deterministic: Same input always produces same output.

Block Parameters (DilV):

Why a separate chain?

• Independent consensus: VDF and PoW have different security models; separating them prevents cross-contamination of attacks.
• Optimized parameters: 45-second blocks enable fast payments (5x faster than DIL).
• Lower barrier to entry: No mining hardware required—any computer can participate.
• Clean foundation: Digital DNA active from genesis, modern DFMP rules from block 1.

4.3 ASERT Difficulty Adjustment (DIL)

The DIL chain uses the Absolutely Scheduled Exponential Rising Targets (ASERT) difficulty adjustment algorithm, based on Bitcoin Cash's aserti3-2d implementation (November 2020).

Formula:

next_target = anchor_target * 2^((time_delta - blockTime * height_delta) / halflife)

Properties:

• Per-block adjustment: Difficulty adjusts on every block (not every 2016 blocks)
• Anchor-based: All calculations reference a fixed anchor block (height 24,499)
• Halflife: 34,560 seconds (~9.6 hours, equivalent to 144 blocks at target spacing)
• Integer arithmetic: 16-bit fixed-point exponent with cubic polynomial approximation of 2^x
• Timestamp domain: Raw block timestamps (not Median Time Past)

ASERT provides smooth, responsive difficulty adjustment without the oscillation problems of periodic retargeting algorithms.

4.4 Timestamp Validation

A hard fork at block height 24,500 tightened timestamp rules to prevent gaming:

• Future time limit: Reduced from 2 hours to 10 minutes (600 seconds)
• Median-time-past: Block timestamps must exceed the median of the previous 11 blocks

This prevents timestamp manipulation attacks that could game difficulty calculations.

5. Fair Mining Protocol (DFMP)

The Dilithion Fair Mining Protocol (DFMP) ensures that block rewards are distributed fairly across the mining community. It prevents any single entity from dominating block production by tracking mining identity and penalizing excessive concentration.

5.1 Miner Identity Keys (MIK)

Every miner must register a persistent Miner Identity Key (MIK)—a 20-byte identity encoded in the coinbase transaction of each block they mine. MIK is required from block 1 on both chains.

Properties:

• Persistent: Unlike addresses (which can rotate freely), MIK identity persists across all blocks mined by that entity
• Dilithium-signed: MIK registration requires a valid Dilithium3 signature, proving the miner controls the identity key
• Consensus-enforced: Blocks without a valid MIK in the coinbase are rejected by all nodes
• Links to Digital DNA: Each MIK is associated with a Digital DNA identity for Sybil detection

5.2 Payout Heat Tracking

DFMP tracks the "heat" of each MIK identity across a rolling observation window. Mining too frequently incurs escalating penalties.

Current Parameters (v3.3):

• Free tier: 12 blocks—a miner can mine up to 12 blocks in the observation window with no penalty
• Linear penalty: Blocks 13-24 incur linearly increasing difficulty (up to 4x harder)
• Exponential wall: Beyond 24 blocks, difficulty increases exponentially, making further mining prohibitively difficult
• Dormancy decay: Heat decreases over time when a miner is inactive

Effect: A miner operating one identity can mine ~12 blocks per observation window without penalty. Running multiple identities (Sybil attack) is detected by Digital DNA. This creates a natural incentive for a decentralized mining distribution.

6. Digital DNA: Anonymous Sybil Defense

Digital DNA is Dilithion's novel approach to Sybil defense. It creates an unforgeable identity fingerprint for each mining node based on physical properties that cannot be faked—without requiring any personal information, KYC, or trusted hardware.

6.1 Eight Identity Dimensions

Core Dimensions (unforgeable physics-based)

L — Latency Fingerprint: Geographic location via Round-Trip Time (RTT) to the four mainnet seed nodes (New York, London, Singapore, Sydney). A miner's latency profile is determined by their physical position on the globe and the speed of light through fiber optic cables. Spoofing requires physically relocating or adding intentional delay (which is detectable as inconsistency).

V — VDF Timing Signature: Hardware fingerprint via VDF computation speed. Different CPUs (architecture, cache hierarchy, clock speed) produce subtly different VDF computation profiles. The timing collector runs 1,000,000 VDF iterations and records checkpoint timings that characterize the hardware.

P — Perspective Proof: Network vantage point via peer observations. Each node connects to a unique set of peers depending on its network position. The Jaccard similarity of peer sets reveals whether two nodes occupy the same network location.

Extended Dimensions (v3.0)

M — Memory Fingerprint: Cache hierarchy probing that characterizes L1/L2/L3 cache sizes and access latencies. Different hardware has measurably different memory architectures.

D — Clock Drift: Crystal oscillator uniqueness. Every quartz crystal has a slightly different resonant frequency, creating a unique timing drift pattern that is consistent over time and different between machines.

B — Bandwidth Proof: Network throughput measurement. Upload and download speeds characterize the miner's network connection.

T — Thermal Profile: Cooling curve from VDF checkpoints. Different cooling solutions (air, liquid, passive) produce different thermal signatures during sustained computation.

BP — Behavioral Profile: Protocol participation patterns including block reception timing and transaction relay latency. These patterns reflect both network position and hardware characteristics.

6.2 Similarity Detection

When a new mining identity registers, its Digital DNA is compared against all existing identities using equal-weight averaging across all available dimensions:

Physics hard rule: If both Memory and Clock Drift similarity exceed 0.95, the probability of two distinct physical machines producing both values is vanishingly small—automatic rejection regardless of combined score.

Current status: Digital DNA is active on mainnet (since block 30,000) and on DilV from genesis. It currently operates in advisory mode—flagging suspicious identities without rejecting blocks. This allows calibration of thresholds before enforcement.

6.3 Privacy by Design

Digital DNA achieves Sybil resistance without compromising privacy:

• No KYC: No personal information required
• No trusted hardware: No TPM, SGX, or secure enclave required
• No biometrics: Identity is tied to the machine, not the person
• Anonymity preserved: A miner's DNA proves they are unique, not who they are
• Progressive enrichment: DNA dimensions can be updated over time as new measurements are collected, and hardware changes are expected and handled gracefully

7. Economic Model

7.1 DIL Supply Schedule

Total Supply:    21,000,000 DIL (fixed cap)
Initial Reward:  50 DIL per block
Block Time:      4 minutes (240 seconds)
Halving:         Every 210,000 blocks (~1.6 years)

Comparison to Bitcoin: Dilithion's emission is exactly 2.5x faster than Bitcoin (matching the block time ratio of 4 min vs. 10 min). Same total supply (21M), same halving interval (210,000 blocks), but halvings occur every ~1.6 years instead of ~4 years.

7.2 DilV Supply Schedule

Total Supply:    210,000,000 DilV (fixed cap)
Initial Reward:  100 DilV per block
Block Time:      45 seconds
Halving:         Every 1,050,000 blocks (~1.5 years)

DilV's faster block time (45s vs. 4min) and higher initial reward (100 vs. 50) are balanced by a proportionally larger halving interval (1,050,000 blocks vs. 210,000 blocks), resulting in a similar ~1.5 year halving cadence.

7.3 Mining Development Contribution

Both chains implement a 2% mining development contribution—not a premine, but an ongoing transparent allocation from block subsidies:

• Dev Fund (1%): Long-term development, security audits, infrastructure
• Developer Reward (1%): Active contributor compensation
• Miner receives: 98% of block subsidy + 100% of transaction fees

DIL Block Subsidy: 50 DIL (100%)
├── Miner Reward:     49 DIL (98%)
├── Dev Fund:         0.5 DIL (1%)
└── Developer Reward: 0.5 DIL (1%)

DilV Block Subsidy: 100 DilV (100%)
├── Miner Reward:     98 DilV (98%)
├── Dev Fund:         1.0 DilV (1%)
└── Developer Reward: 1.0 DilV (1%)

Hardcoded Addresses:

• Dev Fund: DJrywx4AsVQSPLZCKRdg8erZdPMNaRSrKq
• Developer Reward: DRne9ygVbQJFKma1pyEMPpyRbjmVKNcbWe

All nodes validate that mined blocks include the correct development outputs at the correct amounts. Blocks without valid development outputs are rejected by the network.

7.4 Transaction Fees

Fee Model:

• Minimum fee per KB: 1,000 ions (0.00001 DIL)
• Typical 1-in, 2-out fee: ~0.002 DIL
• Miners receive: 100% of transaction fees (not subject to 2% development contribution)

Fees remain negligible to encourage usage while providing spam protection. The fee market will evolve as adoption grows.

8. Bridge to Base

Dilithion includes a bridge to Base (Coinbase L2), allowing native DIL and DilV to be represented as ERC-20 tokens on Ethereum's L2 ecosystem.

8.1 Architecture

The bridge uses a lock-and-mint / burn-and-release model:

1. Deposit: User sends native DIL/DilV to a designated bridge address on the native chain
2. Mint: After confirmation, the bridge relayer calls mint() on the ERC-20 contract on Base, creating wrapped tokens
3. Trade: Wrapped tokens (wDIL, wDILV) can be traded on Aerodrome and other Base DEXes
4. Withdraw: User calls burn() on the ERC-20 contract, specifying their native chain address
5. Release: The bridge relayer detects the burn event and sends native tokens to the specified address

8.2 Wrapped Tokens

8.3 Security Model

Current: Custodial bridge operated by the development team. The bridge owner controls minting authority.

Safety features:

• Daily mint cap: Configurable limit on total daily minting (limits exposure in case of compromise)
• Per-deposit limit: Maximum amount per single bridge transaction
• Replay protection: Each native transaction ID can only trigger one mint (prevents double-minting)
• Pause mechanism: Bridge can be paused instantly if suspicious activity is detected

Upgrade path: Migrate minting authority to a 3-of-5 Gnosis Safe multisig for decentralized control.

9. Network Security

9.1 Attack Vector Analysis

51% Attack (DIL)

Defenses: RandomX CPU mining means an attacker must acquire thousands of consumer CPUs. No ASIC shortcut exists. Combined with DFMP heat tracking, sustained dominance by a single identity triggers escalating penalties.

Risk Level: LOW (economically impractical)

Sybil Attack (Both Chains)

Definition: Attacker creates many fake mining identities to circumvent DFMP fair mining limits.

Defenses:

• Digital DNA: Physics-based identity fingerprinting detects when multiple identities originate from the same physical machine
• MIK persistence: Mining identities cannot be cheaply created and discarded
• 8-dimensional similarity scoring: Spoofing all dimensions simultaneously is infeasible

Risk Level: LOW (Digital DNA makes Sybil identities detectable)

Eclipse Attack

Defenses:

• Four globally distributed seed nodes (New York, London, Singapore, Sydney)
• Peer diversity requirements
• Automatic peer discovery
• Maximum connection limits (8 outbound, 117 inbound)

Risk Level: LOW (standard Bitcoin-style defenses)

Quantum Computer Attack

Defense: Dilithion is quantum-safe by design:

• Signatures: Quantum-resistant (Dilithium3, NIST Level 3)
• Hashing: Quantum-resistant (SHA-3, only Grover speedup = 2x)
• Mining: RandomX provides minimal quantum advantage

Risk Level: NONE (primary design goal)

9.2 Wallet Security

• AES-256-CBC encryption with PBKDF2-SHA3 key derivation (100,000 rounds)
• Two-tier key architecture: Master key encrypts individual private keys
• Automatic lock after configurable timeout with secure memory wiping
• Binary wallet format (DILWLT01) with encrypted backups

9.3 Network Infrastructure

• 4 mainnet seed nodes: New York, London, Singapore, Sydney
• 4 DilV seed nodes: Independent infrastructure
• Checkpoints: Hardcoded trusted block hashes prevent deep chain reorganizations
• Auto-recovery: Automatic UTXO corruption detection and chain resync

10. Development History

Dilithion has been under active development since late 2025, with rapid iteration on mainnet. All development is open-source on GitHub.

10.1 Shipped Features (as of March 2026)

10.2 Roadmap

Near-term:

• CoinGecko and CoinMarketCap listings
• Exchange listings (CEX)
• Digital DNA enforcement mode (graduated from advisory)
• Bridge multisig upgrade (3-of-5 Gnosis Safe)

Medium-term:

• x402 payment protocol integration
• Mobile wallets (iOS, Android)
• Block explorer
• Mining pool software

Long-term:

• Hardware wallet support
• Signature aggregation research (75-85% transaction size reduction)
• Additional cross-chain bridges

11. Conclusion

11.1 What Makes Dilithion Different

11.2 Fair Launch Principles

Dilithion adheres to fair launch principles:

• No premine
• No ICO / token sale
• No founder allocation
• No venture capital pre-allocation
• Pure proof-of-work from genesis
• Open-source (MIT license)
• Community-driven development
• Transparent 2% development contribution

11.3 Vision

Dilithion aims to be the standard for quantum-safe cryptocurrency—a store of value and medium of exchange that remains secure as quantum computing advances. With dual-chain architecture, physics-based Sybil defense, and cross-chain interoperability, Dilithion is building a complete ecosystem for the post-quantum era.

Mission Statement:
"Secure digital currency for the quantum age, built by the community, for the community."

Technical Specifications Summary

References

1. NIST. (2024). FIPS 204: Module-Lattice-Based Digital Signature Standard. National Institute of Standards and Technology.
2. Ducas, L., et al. (2018). CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme. IACR Transactions on Cryptographic Hardware and Embedded Systems.
3. Shor, P. (1994). Algorithms for quantum computation: Discrete logarithms and factoring. Proceedings 35th Annual Symposium on Foundations of Computer Science.
4. National Academies of Sciences, Engineering, and Medicine. (2019). Quantum Computing: Progress and Prospects. The National Academies Press.
5. Monero Research Lab. (2019). RandomX: CPU-optimized Proof-of-Work. https://github.com/tevador/RandomX
6. Nakamoto, S. (2008). Bitcoin: A Peer-to-Peer Electronic Cash System.
7. Bernstein, D. J., et al. (2015). Post-quantum cryptography. Nature, 549(7671), 188-194.
8. Bitcoin Cash. (2020). aserti3-2d: Absolutely Scheduled Exponential Rising Targets. CHIP-2020-11-15.
9. Wesolowski, B. (2019). Efficient Verifiable Delay Functions. Advances in Cryptology – EUROCRYPT 2019.
10. Cohen, B., et al. (2019). Chia VDF: Verifiable Delay Functions for Proof of Space. Chia Network.

Appendix A: Glossary

ASERT

Absolutely Scheduled Exponential Rising Targets. Per-block difficulty adjustment algorithm anchored to a fixed reference point.

ASIC (Application-Specific Integrated Circuit)

Specialized hardware designed for a specific task. Dilithion uses RandomX to resist ASICs.

CRYSTALS-Dilithium

NIST-standardized post-quantum digital signature scheme based on lattice cryptography.

DFMP (Dilithion Fair Mining Protocol)

Identity-based mining fairness system using MIK keys and payout heat tracking.

Digital DNA

Anonymous identity fingerprinting system using 8 unforgeable physical dimensions for Sybil detection.

DilV

Dilithion's companion chain using VDF consensus. 45-second blocks, 210M total supply.

Halving

Reduction of block reward by 50%. Occurs every 210,000 blocks for DIL (~1.6 years) and every 1,050,000 blocks for DilV (~1.5 years).

HTLC (Hash Time-Locked Contract)

Script that enables trustless atomic swaps between chains using hash preimage revelation with timeout.

Lattice Cryptography

Post-quantum cryptographic approach based on hard mathematical problems in lattice structures.

MIK (Miner Identity Key)

Persistent 20-byte mining identity required in every coinbase transaction. Enables DFMP and Digital DNA.

Module-LWE

Learning With Errors over Module Lattices, the hard problem underlying Dilithium's security.

RandomX

ASIC-resistant proof-of-work algorithm optimized for general-purpose CPUs. Used by Monero.

SHA-3

Secure Hash Algorithm 3, NIST-standardized hash function (Keccak).

Shor's Algorithm

Quantum algorithm that can break RSA and ECDSA in polynomial time.

VDF (Verifiable Delay Function)

A function that takes a prescribed amount of sequential computation to evaluate, but whose result can be efficiently verified.

wDIL / wDILV

Wrapped DIL and Wrapped DilV. ERC-20 tokens on Base (Coinbase L2) representing bridged native tokens.

Appendix B: Contact & Community

Website: https://dilithion.org

GitHub: https://github.com/dilithion/dilithion

Discord: https://discord.gg/dilithion

Telegram: https://t.me/dilithion

Dilithion Whitepaper v2.0
March 2026
"Quantum-Safe. Community-Driven. Fair Launch."

Disclaimer: This whitepaper is for informational and educational purposes only and does not constitute investment, financial, or legal advice. Dilithion is EXPERIMENTAL software developed with AI assistance and has NOT been professionally audited. The software may contain bugs, vulnerabilities, or design flaws. Cryptocurrency investments carry significant risk, including total loss of funds. No guarantees are made regarding security, functionality, future value, adoption, or success. Use this software entirely at your own risk. Users are responsible for securing their own keys and funds. Always do your own research (DYOR) and consult with qualified professionals before participating in any cryptocurrency project.