This submission describes an reimplementation of the core data structure of LazyPPL, the lazy rose tree, using techniques from data oriented design with the aim of reducing memory usage and increasing performance. On top of this, we implement an reverse-mode autodiff graph specialized to computing the gradients of the values of the lazy rose tree with respect to the score of the probabilistic program.