We discuss recent developments in probabilistically checkable proofs (PCPs) that use high-dimensional expansion. We will focus on the construction of low-soundness size efficient PCPs, and their relation to fault-tolerant distributed protocols.