Follow the MoneyAML investigation console
checking…probing /api/health

Graph Hacks · Track 1 — Agents that act on connected data

Find the mule ring.
Prove the smallest freeze.

An AI agent investigates AML alerts on a FalkorDB transaction graph — rings, money trails, laundering capacity — then proves which accounts to freeze on a copy of the graph before anyone acts. Every claim is a graph query you can replay.

can reach H3
$30,100can reach H3
accounts in the ring
7accounts in the ring
freezes stop it
2freezes stop it
mule ringmoney movingfreeze hereshared phone

Case board

Four scripted cases — two suspicious, two honest false alarms

Why the graph is load-bearing

Every step the agent takes is a native graph operation.

Ring detection

Accounts tied together by shared devices and IPs, then measured for pass-through behaviour — algo.WCC

Money trails

Shortest routes between accounts, kept only when real transfers follow them in time order — algo.SPpaths

Shared entities

Multi-hop pivots that link accounts through one device or IP — Cypher patterns

Minimum freeze, proven

The smallest set of accounts that cuts every route — verified on a copy of the graph — algo.maxFlow + minimum cut