Explaining shape errors in the Rzk proof assistant
Master Project
Rzk is a proof assistant for synthetic ∞-category theory. Its proofs are built from geometric shapes: intervals, triangles, squares, and tetrahedra. Shapes are described by coordinate constraints. For example, 0 ≤ s ≤ t ≤ 1 is one triangular half of a square, and its edges are s = 0, s = t, and t = 1.
The most common mistakes are geometric: the wrong half of a square, two coordinates swapped, or a face given the wrong way round. Rzk currently reports them as a mismatch between two large terms that differ in one argument, together with a failed constraint check. Such messages are hard to read even for experienced users, and newcomers (for example, players of the Rzk proof games) find them very hard. A better message would say what went wrong in geometric terms: “this triangle is the other half of the square”, or “the coordinates s and t are swapped”, ideally with a picture.
Tasks
- Collect a corpus of shape mistakes: from the Rzk games, from the history of the sHoTT library, and by mutating correct proofs (swapping coordinates, replacing faces).
- Represent shapes up to dimension 3 combinatorially: vertices, edges, cells, and their incidence relations, computed from the constraints.
- Design an algorithm that compares an expected and a given shape and locates the difference: a wrong face, a permutation of coordinates, or a reversed orientation.
- Integrate the explanations into Rzk’s error messages, reusing Rzk’s existing diagram renderer for pictures.
- Evaluate on the corpus: how many mistakes are explained correctly, and how precisely. A small user study is optional.
What you will learn
How a type checker for a dependently typed language works, error reporting and its evaluation, and a little combinatorics of simplices. No category theory or homotopy theory is needed; the relevant parts of Rzk’s type theory can be learnt along the way.
Prerequisites
Functional programming, preferably Haskell (Rzk is written in Haskell), and basic discrete mathematics (partial orders, permutations, graphs).
Reading
- Nikolai Kudasov, Violetta Sim, and Benedikt Ahrens. Rzk: a Proof Assistant for Synthetic ∞-Categories. 2026. https://arxiv.org/abs/2607.12207 (§2.2, “Cubes, Topes, and Extension Types”)
- Emily Riehl and Michael Shulman. A type theory for synthetic ∞-categories. Higher Structures, 2017. https://arxiv.org/abs/1705.07442 (§2.1 and §§3.1–3.2)
- sHoTT’s definitions of simplices, boundaries, and horns: https://rzk-lang.github.io/sHoTT/simplicial-hott/02-simplicial-type-theory.rzk/
- The Rzk games: https://rzk-lang.github.io/warmup-game, https://rzk-lang.github.io/yoneda-game
Supervisor(s): Benedikt Ahrens
Posted: November 04, 2026