arXiv (All)
open access
Proof verification by polynomial Fingerprinting
To cater to the needs of fast verification for mathematical proofs, we describe a method to encode formal sentences in $2 \times 2$ - matrices over multivariate polynomials with integer coefficients. This correspondence is homomorphic: usual proof-steps like modus-ponens or variable substitution in
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Ten unknowns for Hilbert's tenth problem over the integers#924670
- Ten unknowns for Hilbert's tenth problem over the integers#920436
- ATLAS: Automated Approximation of Transformers for Efficient Homomorphic Inference in One Hour#677696
- ATLAS: Automated Approximation of Transformers for Efficient Homomorphic Inference in One Hour#674495
- ATLAS: Automated Approximation of Transformers for Efficient Homomorphic Inference in One Hour#405569
Record · ID 971694
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive