Theorem 1 (Euclid)
No largest prime exists. Multiply any finite list of primes and add one: the result leaves remainder 1 on division by each of them, so its prime factors sit outside the list. ∎
Launching soon on Robinhood Chain
Your browser hunts for a nonce that drops keccak256(seed ‖ miner ‖ nonce) under the target. When one lands, the fee splits: half buys $CALC and burns it, half buys NVDA for the address inside the hash.
01The whole loop
Start here. The film follows a single block: 84 bytes go into keccak, a hash comes out under the target, and one trading fee is cut into a burn and a share of NVDA. The sections below slow each step down so you can check it.
02The inequality
One inequality settles every block. You can verify it with keccak in any language; no oracle feeds it and no operator signs off on it.
03engine.sol
mine(nonce, minOut)Open to any caller. The engine hashes the live seed, the caller and the nonce, and reverts when the hash sits above the target. Your address is baked into the hash, so a stolen nonce is worthless.
The engine takes one eighth of its budget, buys $CALC on the curve and sends every token to 0x…dEaD in the same transaction. It pays nobody in $CALC.
The block log records the address that proved the block. That entry is the claim on the other half of the fee, paid in NVDA.
The winning hash seeds the next block. A block under five minutes makes the next one need a third more work; over twenty minutes, a quarter less. Bounds hold the target inside [2200, 2240].
harvest()Moves the engine's half of the creator fee out of the launchpad escrow and into the budget. Anyone can call it, so the budget refills whether or not we are around.
minOut caps the price a block can pay. The curve rejects a zero minimum, so no block ever buys at a price its caller did not accept.
04The split
The contract cuts each fee once, before either side can touch it.
The engine buys $CALC on the curve and sends it to 0x…dEaD inside the proof transaction. Bytecode enforces this half: read the source and confirm it has no other path.
⌊F / 2⌋ → engine
The equity desk converts the other half to NVDA and pays the address inside the winning hash. The public ledger lists each payout next to its block height.
F − ⌊F / 2⌋ → desk
whyNVDA
You spend electricity on math. The reward is a stake in the company that sells math by the chip.
A proof of work coin has one honest product: computation somebody performed, checked by the same keccak on every machine. NVDA sells that computation to most of the industry, one multiply-accumulate at a time.
Emission coins pay miners in the coin their work just made scarcer, and those miners sell. dotcalc pays outside the token, so $CALC supply only moves one way.
The halves always add back to F: the desk takes F − ⌊F/2⌋, so an odd fee never loses a wei to rounding.
05miner.exe
Lend it some threads and press start. With a wallet connected, the pool hands your address a job, re-checks each nonce you return, credits NVDA for it and puts you on the board. It pays out on its own schedule once your balance clears the minimum. Without a wallet you mine the genesis block for practice, and nothing leaves your browser.
Your threads hash the same 84 bytes the engine checks: the seed, your address and the nonce.
odds
The benchmark runs keccak on your threads for four seconds.
leaderboard · proven work
| # | miner | proven hashes | shares | blocks |
|---|---|---|---|---|
| Loading the board… | ||||
block log
each block moves the seed and retargets| height | prover | Δt | difficulty | hash |
|---|---|---|---|---|
| No blocks yet. The first one is 2^20 hashes away. | ||||
payout ledger · NVDA
| posted | miner | NVDA | transaction |
|---|---|---|---|
| Loading the ledger… | |||
Every payout the desk sends is posted here with its transaction, so the board and the payments can be read against each other.
06Difficulty
After each block the engine checks the gap since the last one. Under 300 seconds, the target drops to three quarters. Over 1,200 seconds, it rises by a third. In between it stays put, and clamps at 2200 and 2240 stop a runaway either way.
pool blocks · gap and difficulty
07theorem.exe
½ + ⅓ + ⅕ + 1⁄7 + 1⁄11 + … = ∞ Euler proved it in 1737. The sum climbs like ln ln n, slow enough that passing 4 takes primes near 1.8 × 1018, and it has no final term. The engine's budget has the same shape.
No largest prime exists. Multiply any finite list of primes and add one: the result leaves remainder 1 on division by each of them, so its prime factors sit outside the list. ∎
Σp 1/p = ∞. A stronger claim than Euclid's: the primes are dense enough that their reciprocals diverge, and the partial sums stay close to ln ln n + M. ∎
keccak output is uniform on [0, 2256). With target T one hash lands with probability (T + 1) / 2256, so the count to a block is geometric with mean 2256 / (T + 1). The site calls that mean difficulty. Luck moves a single block; the mean stays put. ∎
Each block spends B/8 of what is left. After n blocks B(7/8)n remains and B(1 − (7/8)n) is spent: it approaches B and never reaches it. Harvests refill B, so the blocks have no last one. ∎
A fee F splits once: ⌊F/2⌋ to the engine and F − ⌊F/2⌋ to the desk. The subtraction hands the remainder to the second half, so both halves sum to F for every F, odd ones included. ∎
With Δt since the last block, T' = ¾T if Δt < 300 s, 4⁄3·T if Δt > 1200 s, otherwise T, clamped to [2200, 2240]. One block per 600 seconds is the fixed point. ∎
Arithmetic can check every statement on this list. None of them predicts a price.
Σ 1/p against ln ln n + M
Blue steps: the partial sums over primes up to 100,000. Dashed curve: ln ln n + M, with M = 0.26149…, the Meissel-Mertens constant.
08The token
$CALC is what gets burned; it is never the payout. Each block removes some from the curve for good, and provers receive NVDA, so the reward never dumps the token it shrinks.
09Status
Multi-threaded keccak-256 in Web Workers, about five times faster per thread than a textbook implementation.
Sealed jobs, server-side re-hashing, vardiff, a public board and a block log that applies the engine's retarget rule.
Every accepted share credits NVDA against your address, capped per day. The pool pays out once your balance clears the minimum, and posts each transaction in the ledger.
Sign your stats with your wallet; anyone can paste the receipt back and check the signature against the pool.
The token contract. This page shows the address with copy and explorer links the day it exists.
On-chain mine() and harvest(). Blocks move from the pool log onto the chain.
The fee cut on chain, and NVDA payouts posted against block height.
10paper.txt
Most token burns depend on a decision. Someone clicks a button or a scheduled job fires, and that step can be skipped, front-run or quietly retired. dotcalc replaces the decision with an inequality: supply falls when somebody spends computation and lands a hash under the target, and at no other moment.
The payout is the second half of the design. Paying miners in the token their work just made scarcer contradicts itself, and emission coins bleed for it. dotcalc pays outside the token: half of each fee becomes NVDA, paid against the block log. Your work is arithmetic, and your pay is a claim on the business that sells arithmetic by the chip.
Three properties follow from the shape of the code. The engine has no mint, so supply can only fall. ETH held by the engine leaves one way, into the curve. $CALC the engine receives goes to one place, the dead address.
The money comes from creator fees on real trades, pulled out of escrow by a call anyone can make. No emissions, no treasury grant. If nobody trades, no fees arrive, no blocks pay and nothing burns. That failure mode is real, and you should weigh it.
You audit the two halves in different ways. Bytecode enforces the burn. The desk executes the NVDA purchase, and a public ledger keyed to block height records it. One is a proof and the other a record; neither promises a price.
Smart contracts carry risk, tokens carry market risk, and equities carry their own. Nothing here promises a price or a return, and none of it is financial advice.
?Questions
No. Without one you mine the genesis block for practice and nothing leaves the tab. Connect a wallet and the pool credits your shares to that address.
Pool shares cost nothing: your browser hashes and the pool checks off chain. After launch, calling mine() on the engine costs gas like any other transaction.
Launching soon. The token panel, the ticker and the desk show the address the day it exists, with a copy button and an explorer link.
Mining spends computation, and NVIDIA sells computation to most of the industry. The reward is a stake in the thing your work consumes, and it never touches $CALC.
It is a Robinhood Chain stock token that tracks NVIDIA common stock. Each payout is a transfer on chain, listed in the ledger with its transaction hash.
It uses the threads you give it and no more. Drop the slider or press stop and the CPU frees up at once. Closing the tab stops everything.
NVDA, credited the moment the pool accepts it, scaled by the difficulty of that share and capped at 5,000 credited shares a day per address. The pool sends the balance once it clears 0.00001 NVDA and posts the transaction in the ledger. Until the fee stream exists the desk funds this out of its own pocket; after launch the equity half of every fee does.