[2607.12207] Rzk: a Proof Assistant for Synthetic $\infty$-Categories
Skip to main content
Search arXiv
Press Enter to search · Advanced search
-->
Computer Science > Logic in Computer Science
arXiv:2607.12207 (cs)
[Submitted on 13 Jul 2026]
Title:Rzk: a Proof Assistant for Synthetic $\infty$-Categories
Authors:Nikolai Kudasov, Violetta Sim, Benedikt Ahrens<br>View a PDF of the paper titled Rzk: a Proof Assistant for Synthetic $\infty$-Categories, by Nikolai Kudasov and 2 other authors
View PDF
Abstract:Homotopy type theory (HoTT) is a type theory that allows for synthetic reasoning about $\infty$-groupoids. Several proof assistants (such as Rocq and Agda) implement variants of HoTT.
Directed type theory is a type theory for synthetic reasoning about $\infty$-categories, where morphisms (or paths) of dimension 1 are not necessarily invertible. Among the proposals for directed type theory, the most developed is Riehl and Shulman's simplicial type theory (RSTT), based on simplicial shapes such as directed intervals and triangles.
We present Rzk, a proof assistant implementing (a refinement of) RSTT for synthetic reasoning about $\infty$-categories. Specifically, the type theory implemented by Rzk is a computational variant of RSTT adjusted to make type checking practical.
We define a translation from RSTT to Rzk and prove that it is sensible: every RSTT proof translates to an Rzk proof (faithfulness), and Rzk proves nothing new about RSTT types (conservativity). We also give a tutorial introduction to proving in Rzk, and describe its implementation, including the type-checking algorithm and the automated prover for the logic of shapes.
Comments:<br>54 pages, including appendices. Describes Rzk v0.7.8. Ancillary files include the code of every example in the paper and the scripts and trace behind the evaluation
Subjects:
Logic in Computer Science (cs.LO); Programming Languages (cs.PL); Category Theory (math.CT)
Cite as:<br>arXiv:2607.12207 [cs.LO]
(or<br>arXiv:2607.12207v1 [cs.LO] for this version)
https://doi.org/10.48550/arXiv.2607.12207
Focus to learn more
arXiv-issued DOI via DataCite (pending registration)
Submission history<br>From: Nikolai Kudasov [view email]<br>[v1]<br>Mon, 13 Jul 2026 23:16:49 UTC (189 KB)
Full-text links:<br>Access Paper:
View a PDF of the paper titled Rzk: a Proof Assistant for Synthetic $\infty$-Categories, by Nikolai Kudasov and 2 other authors<br>View PDF<br>TeX Source
view license
Current browse context:
cs.LO
next >
new<br>recent<br>| 2026-07
Change to browse by:
cs<br>cs.PL<br>math<br>math.CT
References & Citations
NASA ADS<br>Google Scholar
Semantic Scholar
export BibTeX citation<br>Loading...
BibTeX formatted citation
×
loading...
Data provided by:
Bookmark
Bibliographic Tools
Bibliographic and Citation Tools
Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media
Code, Data and Media Associated with this Article
alphaXiv Toggle
alphaXiv (What is alphaXiv?)
Links to Code Toggle
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub Toggle
DagsHub (What is DagsHub?)
GotitPub Toggle
Gotit.pub (What is GotitPub?)
Huggingface Toggle
Hugging Face (What is Huggingface?)
ScienceCast Toggle
ScienceCast (What is ScienceCast?)
Demos
Demos
Replicate Toggle
Replicate (What is Replicate?)
Spaces Toggle
Hugging Face Spaces (What is Spaces?)
Spaces Toggle
TXYZ.AI (What is TXYZ.AI?)
Related Papers
Recommenders and Search Tools
Link to Influence Flower
Influence Flower (What are Influence Flowers?)
Core recommender toggle
CORE Recommender (What is CORE?)
Author
Venue
Institution
Topic
About arXivLabs
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs .
Which authors of this paper are endorsers? |<br>Disable MathJax (What is MathJax?)
Major funding support from