We develop a new method for constructing models of bounded arithmetic and apply it to proof complexity.
