Graph demo, deep traversal, live
web graph, Google's 2002 web crawl; the k-hop traversal gold standard · Stanford SNAP. Ask the agent (right) to run a k-hop BFS; the number is measured here, now, on data you can download.
the native-graph leader
OUT OF MEMORY. A 6-hop traversal of the 1.8-billion-edge Friendster graph never returns: the working set blows past RAM and the process dies.
semurg, one box
28.75 billion edge-hops traversed, 6 hops deep, in 105 seconds. The whole graph. It completes.
It finishes where the leader runs out of memory.
Friendster: 65.6M nodes, 1.806B edges. Measured live on this box. Download it from SNAP and re-run it yourself.
ask the agent to run a traversal, the result renders here
Every number here is measured live on the AVX-512 box, on a public dataset you can download and re-run yourself. No staged numbers, no cherry-picked subgraph, the whole graph, every time, the traversed subgraph shown as proof.