Farm·Balance Free fleet audit

Trust architecture · verify, don't trust

You don't have to trust us.
You check the number yourself.

Every answer we certify ships with a proof recipe — a short piece of standard arithmetic that re-derives the result from your own fleet file. No special software, no access to ours, no faith required. Below is the whole recipe, worked on the synthetic sample.

sample — synthetic fleet
total fleet draw (from your counts × rated watts)21,129,000 W
container power cap (your input)1,000,000 W
containers energized now24
provable minimum (achieved)22
# instance a3f19c · computed 2025-06-30 · true for the fleet as submitted # certificate: lb=22 · achieved=22 · gap=0 · exact=1 · signed # witness: ceil(21,129,000 / 1,000,000) = ceil(21.129) = 22

The two-minute recipe

Four steps. Standard math only.

  1. Read the echo.

    The certificate restates the exact inputs it answered — your model counts, your power cap, the date. Confirm they are yours. A certificate speaks only for the fleet file printed on its face.

  2. Re-derive the bound.

    The witness gives you the arithmetic. Here: add up your machines' rated watts, divide by the container cap, round up. No allocation can use fewer containers than that ceiling — it is a floor no schedule can beat. ceil(21,129,000 ÷ 1,000,000) = 22. That is the lower bound.

  3. Compare to achieved.

    The certificate's achieved value is the count our plan actually uses: 22. It equals the bound you just computed. When achieved equals the lower bound, the gap is zero and the answer is provably optimal — nothing can do better, and the certificate says exact = 1.

  4. Check the signature.

    The signature confirms this certificate is the one we issued for that exact instance, unaltered. The arithmetic proved it was optimal; the signature proves it is the number we stand behind. Both are on the face.

Why a ceiling is a proof

Some answers prove themselves both ways.

A footprint answer proves a floor: no plan can use fewer containers than the total watts divided by the cap. An assignment answer — which machines cover a committed hashrate, which stay free to shed — proves it two ways at once: the set we hand you is achievable, and a matching counting argument shows no smaller set exists. Achievable value meets impossible- to-beat bound; when they touch, the gap is zero. You can confirm both halves with the witness. That equality is the whole claim — nothing hidden, nothing to take on faith.

The Certified Number Guarantee

If a certified number is wrong, you don't pay.
If it's right, that is what you bought.

Every line marked CERTIFIED is warranted completely. If any certified line fails verification against its own witness, we void it in writing and the fee for that deliverable is waived or refunded in full. Lines marked ESTIMATE, YOUR INPUT, or FINDING are context, not promises, and carry no warranty. No trust in us is required anywhere. That's the point.

Run the free fleet audit See the Fleet Book