Partly because they're working with a monolith that I imagine is difficult to iterate on and it's written in Java. We've had the benefit of working on this in Rust which lets us get really nitty and gritty with different optimisations.

My friend who I worked on this with is putting together a technical blog on those graph optimisations so I'll link it here when he's done

On comparable benchmarks with comparable guarantees? Comparable persistence levels? I’m very skeptical.