A radically simple, parallel-scalable currency for humans, autonomous agents, and machines. π€
πΈ 0 Fees β’ π‘οΈ Quantum-Safe β’ π
Tor-Native β’ π€ Native Multisig
Every transaction extends the graph with exactly two parents. Tips glow β click any node to explore or simulate a new attachment.
SIKKA has strictly 0 fees. When you send SIKKA, the exact amount arrives. No gas, no priority fees, no hidden costs.
Technically, SIKKA is not a blockchain. It uses no Proof of Stake and no global Proof of Work race. Every transaction is its own accepted unit extending the DAG.
Unlike blockchains that congest, SIKKA is parallel scalable. Because transactions process asynchronously, the more users interact with the network, the faster it gets.
| Traditional Blockchains | Sikka DAG |
|---|---|
| Wait for next block | Attach instantly to DAG tips |
| Sequential chain growth | Parallel graph growth |
| Miners or validators decide ordering | Transactions extend graph directly |
| Transaction fees & gas | Exact-value feeless transfers |
| Classical signatures | ML-DSA-87 post-quantum signatures |
| Global block race | Per-transaction work |
Every non-genesis transaction references precisely two earlier transactions. A true directed acyclic graph, not a blockchain.
Inputs must exactly equal outputs. There is no fee field. The sender transmits the full amount with cryptographic certainty.
Each transaction mines its own SHA3-256 nonce. This provides built-in spam resistance. Abusive traffic becomes computationally expensive as difficulty scales with network congestion.
Sikka has no gas and no miner fees. Instead, every transaction solves a SHA3-256 puzzle whose difficulty rises automatically when the network is busy β a CPU cost for attackers, not an economic barrier for normal users.
At baseline load, ~4 hashes per payment. Negligible on any device.
Each extra 60 txs/min adds 2 bits β 4Γ more work per bucket.
There is no recipient and no money collected. Honest senders always pay the baseline. Flooders pay exponentially more CPU as they raise network load β and each transaction they submit makes the next one harder for everyone, including themselves.
Expected hashing work per transaction at different load levels
| Txs in last 60 s | Required bits | Expected hashes |
|---|---|---|
| 0 β 59 normal | 2 | ~4 |
| 60 β 119 | 4 | ~16 |
| 120 β 179 | 6 | ~64 |
| 180 β 239 | 8 | ~256 |
| 240 β 299 | 10 | ~1,024 |
PoW is bound to the live state of both parent tips at mining time. You cannot pre-mine a stockpile of transactions and dump them later β if the DAG moves while you hash, your work is instantly stale.
An attacker mining against outdated tips produces parent hashes that no longer match. The node rejects the transaction; the CPU cost is wasted.
Double-spends are not instantly rejected. Competing transactions enter the DAG and race until accumulated work picks a winner β per UTXO, without blocks, miners, or a global coordinator.
If two transactions spend the same UTXO, both are gossiped and stored. No mempool gatekeeper decides which one "gets in."
Each descendant adds weight: 2pow_bits per transaction in its subtree. The branch with more cumulative work wins.
Once weight crosses the confirmation threshold, the canonical spend is settled. The loser is pruned after a grace period for slow Tor peers.
Concurrent double-spends resolve by accumulated work β like competing forks, but at per-UTXO granularity instead of whole-chain reorgs.
Every honest node applies the same argmax rule. No coordinator, no validator set β all nodes converge on identical ledger state.
At base difficulty (2 bits), reaching 200 weight means ~200 descendants at ~4 hashes each. Under normal load, finality settles in seconds.
Sikka relies entirely on the ML-DSA-87 (Dilithium) signature scheme. We do not use any classical elliptic curves, ensuring maximum security against future quantum threats.
Up to 16 wallets
In Sikka, standard wallets are inherently n-of-n, and multisig is elegantly abstracted as an m-of-n wallet. There are no complicated, risky smart contracts required.
Because of this simple yet powerful abstraction, any single transaction can be collaboratively built and signed by up to 16 different wallets together. This dramatically simplifies complex multi-party flows and institutional custody.
Privacy is built into networking from the start. Nodes seamlessly advertise onion addresses, communicate privately, and support managed Tor integration to expose privacy-friendly peer connectivity globally.
Sikka nodes expose a clean HTTP API with CORS support. This makes it incredibly easy to federate networks, build lightweight web clients, and integrate directly with existing web applications.
A fixed genesis supply with no inflation, no premine, and no team allocation. 100% of all SIKKA is distributed to node operators who keep the DAG alive.
Pre-issued entirely in genesis. The cap encodes 19960907 β no emission schedule, no mining rewards, no hidden minting.
The entire supply flows to people running nodes. No VC slice, no foundation treasury β decentralization by design.
A few of our volunteers operate community faucets so anyone can receive a small amount of SIKKA, create a wallet, and send a real transaction across the DAG β no node required to start.
Join our Discord to claim a few SIKKAs every 6 hours and experience feeless, parallel transfers firsthand.
A tiny ~17 MB static binary containing the wallet, explorer, full DAG engine, and managed Tor. Everything you need, zero configuration required.
docker run -d --restart unless-stopped -p 8080:8080 besoeasy/sikka:latestThen open http://localhost:8080 in your browser.