Whitepaper
The Obelysk Protocol whitepaper describes the complete cryptographic design, security model, and verification architecture for both the privacy DeFi infrastructure and the ZKML verification system.
Read the Paper
The full Obelysk Protocol whitepaper is available on GitHub: Obelysk Whitepaper
Paper Overview
The paper covers the following topics:
🔐
ElGamal over STARK Curve
Exponential ElGamal encryption with additive homomorphism. Schnorr proofs, Chaum-Pedersen proofs, and range proofs.
🧠
GKR Interactive Proofs
Goldwasser-Kalai-Rothblum protocol for verifiable neural network inference. Sumcheck over multilinear extensions.
🪙
VM31 UTXO Privacy
Poseidon2-M31 hash function, UTXO commitments, nullifiers, and batch proving for 1,000 transactions in 2 seconds.
⚡
GPU Acceleration
CUDA kernels for sumcheck, FFT, and Merkle operations. Circle STARKs over M31 field with 50-112x speedup.
Key Results
42-255x
Trace Reduction
50-112x
GPU FFT Speedup
0.0003 STRK
Batch Cost
96-bit
Security
Citation
@article{obelysk2026,
title={Obelysk: Privacy DeFi Infrastructure and Verifiable AI on Starknet},
author={Bitsage Network},
year={2026},
url={https://github.com/Bitsage-Network/obelyzk-paper}
}
Related Documentation
- ElGamal Encryption — full ElGamal scheme over STARK curve
- GKR Protocol — interactive proof protocol details
- STARK Curve Primitives — curve parameters and proof systems
- Privacy Architecture — dual-track system overview