surveillance-frontier · a research project in market surveillance
How well can a surveillance policy be stress-tested within a fixed time budget?
Each phase fixes its hypotheses before measuring. So far, the right exact algorithm on a 32-core CPU brings both stated tasks well under the hour, and a GPU engine is next.
Oct 2026 – ongoingC++17 · OpenMP · CUDA · PythonGitHub (opens in a new tab)README (opens in a new tab)
01What the detector sees
On 2024-01-09 a fake post from the SEC's hacked X account moved Bitcoin by more than $1,000 in minutes. The detector ranks every window — each start × 15 lengths, about two million per quarter — against windows of its own length, so an event draws a cone of rare windows.
Fig. 1 · Rarity of every window around the fake SEC post, 1-minute bars
02Evaluating a policy means repeating one trial thousands of times
Whether a policy holds up is an estimate: inject a test event, re-run the detector, count the hits. Its precision depends on how many trials fit in the time — the quantity every hypothesis of the project is about.
Fig. 2 · One trial, and what n trials estimate
- 1
Fix one series
A real BTCUSDT series x: a week of 1-s bars or a quarter of 1-min bars.
- 2
Inject a test event
A rise-and-fall of length L and strength q at a start s drawn at random.
- 3
Re-run the policy
Scan, rank, select. A policy sets window lengths, threshold and merge gap.
- 4
New episode inside?
A hit only if centred in the event and absent from the unchanged series.
- 5
Repeat n times
Hits / n estimates the detection rate p(L, q | x) with a 95% interval.
| Hypothesis | Criterion → result | Verdict | |
|---|---|---|---|
| H1 | Group-level policies bound the undetected effect; account-level ones do not. | needs group policies and damage bounds | not tested |
| H2 | Even the fastest exact CPU method needs more time than is available. | > 1 h criterion, result 12.1 min | not supported |
| H3 | A bit-identical GPU engine reaches the same accuracy sooner. | Phase 2 | not tested |
| H4 | At equal wall-clock time, the GPU's estimate has a smaller error. | Phase 2 | not tested |
03Two measurements that shaped the project
The pilot showed that precision is bought with re-runs. Before giving that job to a GPU, Phase 1 asked what the best exact CPU method costs — and found full recomputation was far from its floor.
Phase 0 · same time budget, CPU vs GPU
Phase 1 · time per trial, N = 604,800, one thread
04Read each phase
Each phase page opens with its core result, then the evidence: correctness gates, the measurements, and every hypothesis with its verdict.
- Phase 0 · pilotWhen does a GPU help an exhaustive window scan, and what does a time budget buy?Read Phase 0 →
- Phase 1 · feasibilityWhat does a stated stress-testing task cost with the fastest exact CPU method?Read Phase 1 →
- Phase 2 · designedDoes a bit-identical GPU engine beat the incremental CPU on larger tasks?Protocol on GitHub ↗ (opens in a new tab)
Scope. Rates are conditional on one asset and two periods; no damage bound is reported yet; task times are projections from measured throughput; detectors are research reimplementations, and nothing here labels trading as manipulative.