Findings / Dated observations

The arithmetic passes.The questions stay open.

These samples describe what the tools saw at the times shown. The devnet is disposable and may reset. Every figure keeps its source and capture time.

Conformance harness / recorded run

239 documented claims, checked from outside.

Requests
62
FLOP spent
0
Recorded
Recorded / not live

One cell per claim. Arrow keys move between claims.

Showing 1 to 64 of 239. Page 1 of 4.

Readout

Each cell is one claim from the public docs.

Hover or focus a cell to read its result and reason. Unverifiable means public data cannot settle it.

01What we found so far

Three findings, each dated.

Dated observations from a disposable devnet. These samples describe what the tools saw at the times below.

Settlement verifier / recorded tape

A settlement can add up.

20 recorded settlements gave 40 passing escrow and display-price checks. 0 failed.

That checks the arithmetic. Agreed pricing, transcript inclusion, hardware quotes and the exact challenge window still need evidence.

Settlement 01 of 20Block 2,945,2460xa5d0a172…66deec
Settlement 1 of 20. Miner paid 516,780,000,000,000,021, plus unused escrow 5,220,000,000,000,000, plus burned 0, equals 522,000,000,000,000,021 escrow. Difference 0. Escrow conservation Pass.
difference 0 raw unitsEscrow PassPrice ratio Pass

40 of 40 arithmetic checks pass. 0 fail. Each tick is one settlement: escrow on top, price ratio below.

Conformance harness / recorded run

A documented claim can fail.

Of 239 claims in a harness run, 177 passed, 3 failed, 54 could not be verified from outside and 5 were skipped.

  • Failflop_agent_pack_manifest minimal inputConfirmed by a fresh repeat: Advertised minimal input returned a tool error
  • Failflop_agent_pack_install minimal inputConfirmed by a fresh repeat: Advertised minimal input returned a tool error
  • Failflop_knowledge_get minimal inputConfirmed by a fresh repeat: Response violates the advertised output schema

One failure is filed upstream: a tool returns fields its own schema forbids

Gateway / price sources

A listed miner is not an uptime record.

The observed gateway response lists 65 price-source addresses. 4 of them appear in the sampled settlement page.

Every price source in the earlier recorded response was marked devnet-nominal. A scoreboard can rank settlement evidence. It cannot rank uptime.

Public gateway model list

Recorded price-source labels

Compare the evidence

02The promise / The outside view

Proofs should stand up to questions.

FLOP promises verified AI inference. Each promise sits next to what public data lets us check today and the recorded checks behind it. Read the design

Agents pay GPU miners for inference.

Recorded settlements split their escrow into miner pay, unused escrow and burn. The split adds up in exact integer arithmetic. That does not prove funds moved or that the price was agreed.

Check a settlement
  • harnessWhole-tape escrow conservationPass
  • verifierEscrow conservationPass
  • verifierAgreed compute priceUnverifiable

Miners submit proofs of the work.

The public TEE check labels itself simulated. The public docs give no byte-exact transcript encoding, so inclusion stays unverifiable.

Read the proof checks
  • harnessSimulated verifier is labelledPass
  • verifierTranscript inclusionUnverifiable
  • verifierAssurance evidenceUnverifiable

Anyone can challenge a session for about seven days.

The SDK documents cooperative settlement as an immediate payout with no standard window. Public surfaces do not expose the live window constant.

Watch the windows
  • harnessChallenge windowUnverifiable
  • verifierChallenge windowUnverifiable

Proven fraud costs the miner its whole stake.

The documented slash and base stake are design parameters. Public surfaces do not expose the runtime constants. The challenger has no slashing-history feed.

Inspect the claims
  • harnessFraud slashUnverifiable
  • harnessBase self-stakeUnverifiable

Harness results from the run recorded . Verifier results from the channel captured . A pass is a narrow claim about named inputs.