A minimal proof-of-work cryptocurrency. Memory-hard mining that runs on the computer you already own. Zero-fee instant payments, final at mempool entry. A supply that quietly repairs itself over time. No premine, no foundation, no roadmap.
Three commitments — fairness in mining, freeness in payment, longevity in the ledger — fixed at v1.0. Everything else is implementation.
Memcoin takes the original proposition of peer-to-peer electronic cash and removes everything that pulled it away from that goal. What remains is a complete design β there is no roadmap because the destination has been reached.
Yesmem requires 8 GiB of RAM per mining thread and uses x86-64-v3 bit-manipulation instructions that GPUs cannot run and ASICs cannot accelerate. Each thread requires its own working set β memory cannot be shared, and aggregation provides no per-unit cost reduction.
TX1 locks the exact payment amount β up to 1 MEM β into a single CLTV output assigned to the recipient. The moment TX1 enters the mempool, the sender permanently relinquishes control. TX2 spends any unlocked CLTV outputs β also at zero fee β to up to three addresses. Miner income is the block reward.
Lost keys, dead hardware, abandoned addresses. Every chain accumulates this damage. A permanent 7 MEM block reward replaces what time removes, asymptotically. No foundation, no roadmap, no premine.
| Unit | Symbol | Value | Definition |
|---|---|---|---|
| MEM | π | 1 | base unit |
| mbit | α΄ | 1 / 100 MEM | = 1,000,000 Κ |
| kbit | α΄ | 1 / 100,000 MEM | = 1,000 Κ |
| bit | Κ | 1 / 100,000,000 MEM | smallest unit |
Early Bitcoin mining was genuinely democratic β anyone with a CPU could participate. ASICs replaced that. Yesmem is built so they cannot return: a memory ceiling no consumer GPU can clear, a serial bit-manipulation chain native to standard CPUs, and a memory controller that saturates long before capital can scale. The algorithm is a guest, not an occupant. It breathes.
A standard home computer has the resources to mine Memcoin without displacing any existing workload. The marginal cost of participation is the electricity already being consumed by a machine left on.
exactly β exceeds the VRAM of virtually all consumer GPUs. Each thread requires its own working set; aggregation provides no cost reduction.
Mining runs on the computers people already own and use β alongside normal computer use, without displacing any existing workload.
Send a payment and it is done. The moment Bob's payment reaches the network, the funds belong to Alice β Bob cannot cancel, recall, or redirect them. Capped at 1 MEM per payment, sized for everyday amounts. No confirmation needed. No waiting.
The funds are locked in Alice's name for approximately three days. After that, Alice sends to any address at zero fee β one transaction, confirmed in one block, no restrictions. No intermediary. No cost.
Both transaction types coexist on the same chain. Standard payments suit larger transfers where waiting one block is acceptable. The instant payment system is designed for everyday use β the 3-day lock is the trade-off for zero fee and immediate finality. Full rule-by-rule design: TX1 / TX2 β design & architecture β
Every confirmed output stays part of the UTXO set until it's spent β a decade-old balance costs a node exactly as much attention as one confirmed an hour ago, unless something changes that. Memcoin moves outputs through three storage tiers as they age. The path runs one direction only, and it never touches what the owner can do with the funds.
Every confirmed output starts here. Demoted once its value has "cooled" enough relative to its age β see the formula below.
A single record per address β outputs at the same address share it. Spending still requires no block read.
Spending triggers a block read to reconstruct the output's data on demand from the heights on file.
COOLING_RATE = 2,000 Κ / block
temperature(h) = value β COOLING_RATE Γ (h β heightAnchor)
For CLTV outputs, heightAnchor is the unlock height β a locked payment only starts cooling once it becomes spendable, not while it's frozen.
| Value | Blocks | β time |
|---|---|---|
| 10 kbit (min) | 5 | ~50 min |
| 100 kbit | 50 | ~8 hours |
| 1 mbit | 500 | ~3.5 days |
| 1 MEM | 50,000 | ~347 days |
12,960 blocks by default, operator-adjustable β a grace period before Cold cooling begins.
Normal cooling + Cold protection + Cold cooling, summed β roughly two years for a one-coin output.
A node without the data asks the peer that relayed the spending transaction β point-to-point, not broadcast.
This is a storage optimisation, not a hold on funds β an output in any tier is exactly as spendable as the moment it was created. The temperature formula and the NormalβCold schedule are consensus rules; the Cold protection period and Ice index depth are per-node configuration. Full rule-by-rule design: UTXO Temperature β design & architecture β
Gold is finite, unmanaged, and resistant to debasement. Memcoin is designed around the same reality: a permanent 7 MEM floor slowly returns to circulation what time removes from it β without targeting any specific number, without measuring the damage.
y0 β y3 Β· 7,875,000
y3 β y6 Β· 3,937,500
y6 β y9 Β· 1,968,750
y9 Β· permanent Β· ~367,500 / yr
Every parameter exists to serve a goal. When a parameter no longer serves its goal, the parameter changes β the goal does not. Three commitments are written into the first block. Everything else is implementation.
Most networks lost this condition within years. Memcoin takes it as a design requirement — the intended mining landscape is produced by physics, not policy.
The 8 GiB threshold exists so home PCs can participate. If home hardware changes, the threshold changes with it.
The 32 MB default block size guarantees zero-fee payments make it in. The cap is 64 MB.
A 7 MEM permanent floor returns what time removes. There is no roadmap because the destination has been reached.