**Abstract:**

One of the central problems of proof theory is to find natural well orderings. In particular, one would like to measure the strength of theories by natural systems of ordinal notations. Traditional methods use systems of collapsing functions to reflect properties of cardinal numbers to computable ordinals. We will discuss the philosophy behind and recent progress using a method of directly describing large ordinals in terms of patterns formed by embeddings between initial segments of the ordinals.