Our paper Verifiable Boosted Tree Ensembles has been accepted at IEEE S&P 2025! In this work, we demonstrate how to train boosted tree ensembles with robustness guarantees that can be efficiently verified in polynomial time, overcoming the challenge of robustness verification, which is NP-hard for tree ensembles in general.