
local-llm
A comprehensive guide for building and configuring a high-end local machine to run state-of-the-art LLMs, with detailed hardware choices, BIOS tuning, and Docker-based model serving.
The benchmarks are fully reproducible with a single command, include automatic verification against sequential state roots to prevent inflated numbers, and show that signature verification and the virtual machine are not bottlenecks.
Reproducible benchmarks for the Quantova node. Every figure is produced by a harness that checks its parallel result against the sequential state root before it reports, and the throughput figures rerun on your own machine with a single command.
Around 44,000 transactions a second of execution throughput on a single node, and block finality under one second across a live validator committee. Signature verification and the virtual machine both run far above throughput, so the compute path keeps margin and the bound is serial state access.
Measured on an Apple M4, ten cores, 16 GB, release build. The full block path runs a module lattice signature verify, a virtual machine transfer, and an account write back.
| workload | parallel | speedup |
|---|---|---|
| independent transfers | 47,712 tx/s | 2.20x |
| a third contended on hot accounts | 47,021 tx/s | 2.14x |
| independent at half the cores | 36,469 tx/s |
Held constant over twenty seconds the floor is 41,431 a second and the median 44,085, so the figure is a rate the node sustains rather than a burst. Signature verification runs at 70,039 a second across the cores and the virtual machine alone at 1,381,895, both far past throughput, which places the ceiling on serial state access, the sparse Merkle state read and written in block order.
Measured across a real four validator committee producing and finalising blocks one after another, each block built, attested, aggregated, and verified with a real finality certificate that every node checks.
| percentile | finality |
|---|---|
| median | 607 ms |
| p90 | 620 ms |
| p99 | 635 ms |
Finality lands under a second, and it does not grow with the validator set. A fixed sampled committee carries it, so the certificate stays flat as validators join. This figure is the in process compute floor across the committee, a production network adds propagation between hosts on top.
Execution throughput is the compute path of one node. Finality is measured in process across the committee on a single host, so it is the compute floor and leaves out wide area propagation. Finalised throughput at production scale, with validators running in parallel across real hosts, is the figure the network is built to carry, and it is bounded by execution rather t
Reproducible execution throughput benchmark for the Quantova node
Similar projects matched by category, topics, and programming language.

A comprehensive guide for building and configuring a high-end local machine to run state-of-the-art LLMs, with detailed hardware choices, BIOS tuning, and Docker-based model serving.
Claudemux is a lightweight, dependency-minimal message bus that lets multiple Claude Code sessions communicate in real-time over tmux, enabling one session to ask another a question and receive the answer without manual intervention.
OpenClaude is an open-source CLI coding agent that runs on any platform and supports a wide range of LLM providers, offering the same tools and workflows as Claude Code.