RDF demo: the closure that doesn't time out
You are looking at Bitcoin value-flow graph1.78M nodes · 7.37B typed edges in one Semurg substrate. Ask it to run a (funds|pays)* transitive closure and count the reachable set and it runs the
real query live on this box, on data you can
download and re-run yourself.
Click an example in the agent rail, or change the closure depth or the seed, e.g. transitive closure depth 12 from 0. Every run is measured end to end, on
this box, on the real dataset. Nothing is pre-computed.
The SPARQL property path ?x (funds|pays)* ?addr walks funding then payment to a fixed point. On a public endpoint it hits the 300-second cap and is killed with no answer. Here it is a deep bounded traversal over the typed-edge graph, counted live. the live Bitcoin value-flow graph, transactions and addresses linked by value-flows (prev-tx to tx to address), parsed straight off the P2P network · Bitcoin mainnet P2P (our own block-parser node, no bitcoind, no REST).
the SPARQL-endpoint leader
TIMEOUT AT 300s. A property-path closure (
(funds|pays)*) routinely hits the 300-second wall-clock cap and is killed with no answer at all.
semurg, one engine
The closure, counted. The same query is a deep bounded BFS over the typed-edge graph: it returns the deduplicated reachable set in milliseconds warm, no triplestore and no SPARQL planner.
The speedup is unbounded, because the endpoint never finishes.
Bitcoin value-flow triples (tx pays address, prev-tx funds tx). Measured live on this box. Re-pull over Bitcoin P2P and re-run it yourself.
ask the agent to run a transitive closure, the result renders here
Honest framing: I count the distinct closure set (the deduplicated reachable nodes and edge-hops), I do not enumerate every distinct path. The win against a public SPARQL endpoint is RAW because that service caps this property-path query at 300 seconds and kills it with no answer, so the speedup is effectively unbounded. It is also a COLLAPSE win: no separate triplestore, no SPARQL planner, no index-build step, no second system. The triples are durable on disk (disk=truth) and queried in the one engine that also serves graph, search, key-value and vectors. Every number is measured live on a live Bitcoin value-flow you can re-pull over Bitcoin P2P and re-run.