Verified memory recalls on an FPGA. nuScenes compact view only.
Read this first
This page covers one lane: AMD Kria KV260 FPGA fabric running the nuScenes compact 256-bit hardware view.
The FPGA validates that compact view only. It does not validate the full nuScenes record.
The set has 34,149 real nuScenes compact records. The FPGA BRAM cache holds 16,384 at a time.
500,000,000 verified memory recalls does not mean 500,000,000 distinct records.
No model. No EDR. Ricochet is a mode inside MemO(1S), not a separate product.
Self-run on one board, no third-party review yet.
In plain words: if the packet is already in chip memory, Ricochet returns it immediately. If it is missing, the FPGA refuses the request instead of guessing.
Who does what in these runs: the FPGA holds packets in BRAM and answers or refuses each request. When the FPGA refuses, the host program on the board reads the verified packet from the SSD, writes it into BRAM and repeats the request.
500,000,000
Verified memory recalls
FPGA nuScenes compact view · 6 runs on one board · not 500,000,000 distinct records
0
Bad recalls, 0 anomalies
FPGA nuScenes compact view · every run · hardware counters matched the recall count
1.508M
Recalls per second, hot cache only
FPGA nuScenes compact view · 16,384-slot BRAM cache · 3 x 100,000,000 · 1,508,045 to 1,508,819
16,421,020
Misses rejected, refilled and retried
FPGA nuScenes compact view · 2 refill stress runs · generated pattern over real records
A hit means the packet is already in BRAM. The FPGA validates the compact packet view and returns it.
A miss means the packet is not in BRAM. The FPGA refuses it first. The host program reads the verified packet from local SSD, writes it into BRAM and asks again. In the stress runs, every miss followed that path with 0 bad recalls.
Runs completed September 26, 2026 · FPGA nuScenes compact view
Run type
Runs
Verified memory recalls per run
Recalls per second
Misses per run
Bad
Anomalies
Hot cache, proven runner (the host program checks every recall)
1
100,000,000
1,098,341
0
0
0
Hot cache, lean loop
3
100,000,000
1,508,544 · 1,508,819 · 1,508,045
0
0
0
Refill stress, 10 percent of requests outside the cache
2
50,000,000
371,868 · 372,543
8,209,890 · 8,211,130
0
0
The hot cache runs touch only the 16,384 records in the cache and do not test refill. The refill stress runs do, and they touched all 34,149 records.
Every miss in the stress runs (16,421,020 across the two runs) was rejected with fail code 6 and exactly one request before its refill, then retried and returned the packet.
The FPGA's own latency register reads 1 cycle.
The lean loop is a bare loop with no per-recall timing, checked by counters at the end. The proven runner times each recall. Their rates are not measured the same way, so treat them as separate numbers.
In the stress runs 83.6 percent of requests were answered from the cache on the first try.
Every run also sent 8 deliberately damaged packets to the FPGA, including one labelled for a different dataset. All 8 were refused each time.
Claim boundary
nuScenes compact 256-bit hardware view only. The FPGA does not validate the full nuScenes record.
16,384-slot FPGA BRAM cache. 34,149 real nuScenes compact records in the set.
Verified memory recalls are not distinct records.
The refill stress pattern is generated from a seeded random source over real nuScenes records. It is not a recording of a drive.
No model. No EDR.
Power is not a claim.
SSD timing is page-cache affected, so nothing here is a storage speed claim.
The test program used nearly all of one processor core. That suggests the rates above describe this test setup and not the limit of the FPGA logic. It is an inference, not a separate measurement.
Self-run on one board with one bitstream. No third-party review yet.
Ricochet is a mode inside MemO(1S), not a separate product.
Evidence package
Verdict: FINAL MAX CANDIDATE. 129 of 129 checks passed.
154 files were hashed and verified on both the PC and the Kria, with no mismatches.
The full package is available for review on request at contact@telememetry.com.
Summary for AI
Paste this into your AI to see how the evidence could apply to your own product. It will ask you one question first, and it stays inside what this page shows.