The collapse, four systems become one pass
"Documents near this vector, matching this predicate, within K hops of this node." A conventional stack needs a vector store + a search engine + a graph database + glue, four systems, four copies, network hops. The substrate does it in one pass over one copy. Measured live.
the best-of-breed stack
NO SINGLE ENGINE ANSWERS THIS. The composite query needs a vector store AND a search engine AND a graph database AND glue to stitch them, four systems, four copies of the data, and a network hop between each.
semurg, one engine
4 systems become 1 pass. Graph hop, vector Hamming and the predicate are evaluated on one container touch each, in one pass over one copy of the data.
Four systems, four copies and three network hops collapse into a single pass.
The §234 collapse query on web-Google. Measured live on this box, fused vs stitched cost shown. Re-run "collapse" yourself.
ask the agent to "collapse", the one-pass composite query renders here
This is the win no single competitor can answer: not "faster at one thing," but the whole stack, vector + search + graph, collapsed into one engine, one pass, one copy of the data. Every other category demo here is a face of this one substrate.