Skip to content

Every number, re-run on a fresh machine ​

22 September 2026. A new c8g.8xlarge in Virginia, 32 Graviton4 cores, nothing on it. I clone the public repository at commit 320d21d and re-run the receipts in docs/evidence: the zero-allocation gate, the layout, algebra and handshake tests, the ingest benchmark, the core scaling gate. Then three node processes on the same box converge, one is killed with kill -9, and it recovers from its write-ahead log. Five minutes. The numbers are the ones on the screen, including the ingest run that came in below my receipt.

Recorded
22 September 2026, 16:30 UTC
Machine
c8g.8xlarge · 32 Graviton4 cores · us-east-1
Commit
320d21d
Length
5 min 09 s · captions in English

Keys ←→ 5 sJL 10 sK play / pauseF full screenC captions0–9 jump

On the screen, against the receipts ​

Three runs of the same commands, all public: the receipt in the repository, the recording above, and scripts/reproduce.sh run on the recording's machine after the camera stopped. Benchmarks move from run to run; the spread below is that movement.

MeasurementReceipt in docs/evidenceOn the screenSame machine, after the recording
Write path, per insert0 B, 0 allocs0 B, 0 allocs0 B, 0 allocs
Ingest, 32 cores, one signature per 100 deltas5,681,818 deltas/s4,608,2944,444,444
Ingest, 32 cores, one signature per 256 deltas6,024,096 deltas/s6,369,4266,410,256
Core gate, 16 cores85,096,809 ops/s83,482,66879,106,994
Core gate, 32 cores, floor 50,000,00068,278,197 ops/s69,554,25069,102,044

The three-node run at the end stays on one box: three processes, three loopback addresses standing in for three regions, 1,000 keys written into node 0, all three Merkle roots equal by the time node 0 went quiet at 3.01 s. Then kill -9 on node 0, and it answers again after 113 ms with the same root. That checks the mechanism, not the three-region result; the 100-process run across three regions has its own receipts, convergence-100-node.txt and crash-recovery.txt, in the same folder.

What is edited ​

The typing of one long command is speeded up. Where a line of the voice needs longer than the run took, the screen is held. The voice was recorded afterwards, one line at a time. The terminal output is not touched. For the web, the sound is level-normalised and the picture is encoded once more at constant quality, so that the whole recording is one 17 MB file the browser plays on its own; the re-encode scores 0.997 against the export on the SSIM scale, where 1.0 is identical.

Transcript ​

  1. I am Harsh Rawat. I am seventeen. I am in Kota, in India.
  2. This is a fresh cloud machine. 32 cores.
  3. Neoverse V2. That is Graviton4.
  4. The long command asks the cloud what the machine is.
  5. c8g.8xlarge, in Virginia.
  6. A clean box. Nothing of the project on it yet.
  7. I will re-run the numbers from my application. Then a three-node mesh.
  8. This is the public repository.
  9. Commit 320d21d. Everything here runs from this tree.
  10. First, the memory rule.
  11. The write path allocates nothing. This test fails the build if that ever changes.
  12. Zero bytes, zero allocations per insert.
  13. The records live outside Go's heap. The garbage collector never touches them.
  14. Three quick checks. Layout first. Struct sizes and field offsets are pinned by tests.
  15. Algebra. Merge in any order, in any grouping, merge twice, same result. One hundred random cases each.
  16. This is what lets nodes merge without a leader.
  17. Handshake. The default TLS config negotiates the post-quantum hybrid key exchange.
  18. Signing stays classical by default. The hybrid signature is opt-in.
  19. Now the real receive path, not the core.
  20. One signature check per frame of 100 or 256 deltas. Then a merge for each delta, in process. No socket, no disk.
  21. My receipt says 5.7 to 6 million deltas a second.
  22. N = 100: 4.6 million. Lower than the receipt.
  23. N = 256: 6.4 million. Higher than the receipt.
  24. Benchmarks move run to run. Both runs are public: the receipt, and today's transcript.
  25. The ceiling rows give every core its own engine, so nothing contends. That best case is 11 and 13 million.
  26. The gap between the rows is contention on one shared engine. That is the part I am working on.
  27. The in-process core gate is 50 million a second.
  28. Today: 83 million at 16 cores.
  29. 69 million at 32 cores.
  30. It passed.
  31. This is a three-node mesh across three simulated regions.
  32. 1,000 keys injected into node 0, and all three roots converged.
  33. Then kill -9 on node 0.
  34. It recovered from checkpoint and log in 113 milliseconds, with its root matching again.
  35. Every number I said has a receipt in this folder, with the exact command and machine.
  36. About 57 percent of version one is done.
  37. The straggler tail and the durable path are the open problems.
  38. This is the engine today. Thank you.

Files ​

Engineered from first principles to solve the distributed state problem without the latency tax of traditional consensus.