Graph Hacks · FalkorDB
Know who you’re really doing business with.
Name a counterparty. Three agents trace offshore officers, nominees and shared addresses toward sanctioned parties, argue over the weakest link, and return a verdict with the graph path as proof.
How a case is built
Three agents. One graph. Every step shown.
The language model never writes Cypher. It chooses among human-written graph tools that run on FalkorDB, and each result carries the exact query and parameters behind it. Desk default remembers every case and recalls it as precedent.
- 01
Investigator
Traces officers, nominees and shared addresses toward listed parties using fixed, parameterised Cypher tools. Every query is on the record.
- 02
Skeptic
Attacks the weakest link: similar-name edges, token-only name matches. A weakened path never drives the verdict.
- 03
Gatekeeper
Applies a deterministic rule set, writes the memo, and files the case to desk memory so later work can cite it.
- APPROVE
No path to a listed party within 6 hops, and no cluster signal.
- EDD
A possible link within 6 hops, a weakened short path, or a 25+ entity shell cluster.
- REJECT
A path of 3 hops or fewer, match score ≥ 0.95, with no weak edge.