This is Lace's successor, which is in still development. Hoping to have a demo showing scaling to trillions of records via distributed inference in couple of months.

For those in the thread: we're comparing against standard serial Gibbs.

We have implementations of split-merge and parallel slice in Lace. The times per-iteration and to-converge are quite different for these kernels. It's usually best to alternate as they're better at different kinds of moves.