We take a fresh look at the S-matrix bootstrap program using modern tools inspired by the revived conformal bootstrap. There exist various approaches to taming the landscape of S-matrices. We will discuss two different methods and show that they both lead to the same universal bound for the interaction strength in 2-dimensional QFTs. We propose a specific numerical algorithm for higher-dimensional QFTs and present some initial results.
