rust
diskproxy and stable camera ingest with virtual disks and WebDAV
A Leica ingest failure became a Rust proxy with stable timestamps, WebDAV, streamed virtual disks, and plugins that adapt filesystem views without rewriting photo data.
rust
eigentimes
Eigen Times: a newspaper in the eigenbasis of the news
A newspaper that prints each day as coordinates in the eigenbasis of a quarter-century of news—recurring archetypes, the daily decomposition, and what is different this time—built two ways and compared.
eigentimes
Eigen Times: a newspaper in the eigenbasis of the news
A newspaper that prints each day as coordinates in the eigenbasis of a quarter-century of news—recurring archetypes, the daily decomposition, and what is different this time—built two ways and compared.
eigentimes
Eigen Times: a newspaper in the eigenbasis of the news
A newspaper that prints each day as coordinates in the eigenbasis of a quarter-century of news—recurring archetypes, the daily decomposition, and what is different this time—built two ways and compared.
rust
Two rivers, one road: Rust and OxCaml race to count meanders
We ran the verified meander-counting machine as fast as two languages could take it. OxCaml took the lead, our first explanation was wrong, and one experiment let Rust catch up and count 50 crossings.
rust
Nutmeg 0.1.0: graph algorithms where the data already is
Grust's graph kernels inside Sail's Spark Connect server: stage a graph from a DataFrame, call an algorithm, get a DataFrame back.
rust
Grust Langoustine: narrower graphs, cheaper accounting, and scores you can ask for in f32
Grust's latest backend-neutral property-graph release.
rust
What one PageRank sweep costs: five implementations on one host
What one sweep of one PageRank kernel costs across five implementations on one host, with every distance carrying its margin.
rust
Grust Mysid twenty-three graph algorithms, and the properties they needed
Grust's latest backend-neutral property-graph release.
graphs
Graph algorithms, full paths, and the work a benchmark must count
A full-path graph algorithm benchmark over 2.147 billion path entries: an explicit output contract, three rounds of optimization, two regressions and one correctness bug.
rust
Grust Brine: admission follows Arrow data
Grust Brine retains execution admission through shared Arrow buffers and graph algorithm results.
graphs
Graph stores under strain: Rust in process matches Neo4j's reach, beats it on speed, and closes most of the memory gap
Rust in process now matches Neo4j's reach at 117 million edges and beats it on speed in every same-machine pair; Neo4j's memory lead is down to 10 to 40%. What 352 runs in 33 verified bundles show.