These agreement tests (also known as direct product tests) are central tools in the proofs of PCP theorems, low-degree tests, and more general locally testable codes. In this talk, I will describe recent advances in agreement testing on high-dimensional expanders — powerful combinatorial structures that provide robust frameworks for local-to- global inference — and show how they open new doors for constructing efficient, highly resilient systems.