R1CS constraints for non-native field arithmetic
-
Updated
Aug 7, 2021 - Rust
R1CS constraints for non-native field arithmetic
Secure Quantum Zero-Knowledge Proofs: Implementation, Analysis, and Optimization
Cryptographic timestamp proof for provisional patent submission – Sanctum CIRCE (2025)
A deterministic proof-generation framework that connects cultural computation, governance logic, and verifiable cryptographic proofs.
Enterprise-Grade Decentralized AI Infrastructure on AIDP. Seamlessly route, verify, and scale AI inference via a global network of decentralized GPUs.
Executable soundness analysis for ParanO(1)d production proof parameters, with theorem-backed bounds and reproducible industry-metric comparisons.
.NET library that implements the W3C Verifiable Credentials Data Model 2.0 (VCDM 2.0) — creating, issuing, holding, presenting, and verifying Verifiable Credentials (VCs) and Verifiable Presentations (VPs). A VC is a tamper-evident, cryptographically secured set of claims made by an issuer eg. a diploma or licence.
Canonical payment-evidence envelopes, deterministic hashing, and Merkle inclusion proofs for independently verifiable XPayr receipts.
Verifiable proof layer for AI agent computations on Casper Network
Detect structurally similar Python functions to find copy-paste code with different names, improving code quality through precise slop detection.
Add a description, image, and links to the cryptographic-proofs topic page so that developers can more easily learn about it.
To associate your repository with the cryptographic-proofs topic, visit your repo's landing page and select "manage topics."