https://github.com/nucypher/numerology
Numerology: Optimized ECC arithmetic library for secp256k1 in Solidity
https://github.com/nucypher/numerology
cryptography elliptic-curves secp256k1 solidity zero-knowledge-proofs
Last synced: 6 months ago
JSON representation
Numerology: Optimized ECC arithmetic library for secp256k1 in Solidity
- Host: GitHub
- URL: https://github.com/nucypher/numerology
- Owner: nucypher
- Created: 2018-07-03T00:24:27.000Z (over 7 years ago)
- Default Branch: master
- Last Pushed: 2018-11-02T17:26:15.000Z (almost 7 years ago)
- Last Synced: 2025-04-02T22:41:39.910Z (6 months ago)
- Topics: cryptography, elliptic-curves, secp256k1, solidity, zero-knowledge-proofs
- Language: JavaScript
- Homepage:
- Size: 739 KB
- Stars: 12
- Watchers: 9
- Forks: 5
- Open Issues: 2
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Numerology
*Optimized ECC arithmetic library for secp256k1 in Solidity*
**WARNING: Don't use it with any private input (e.g., a private key), as it's going to be exposed. Don't ever use this to sign something! Also, this is experimental -- Use at your own risk!**
**Numerology** is a Solidity library for elliptic curve arithmetic on secp256k1. Its original goal is to support [NuCypher](https://github.com/nucypher/nucypher) smart contracts for Re-Encryption Verification of [Umbral](https://github.com/nucypher/pyUmbral) ciphertexts, which is done by means of Non-Interactive Zero Knowledge Proofs of Knowledge. In particular, Numerology provides optimized ECC algorithms useful for verifying Schnorr-like NIZKs. These algorithms are honed to spend as little gas as possible. For this reason, and also to bypass some EVM and Solidity limitations, the code can be ugly as hell sometimes (sorry for that!).
It's initially based on the [ECCMath library](https://github.com/androlo/standard-contracts#eccmath), although it's completely rewritten.
### Features:
- Point addition and doubling in Jacobian coordinates with optimized formulas.
- Simultaneous scalar multiplication with several optimizations (interleaving, WNAF representation, curve endomorphism).
- Verifying an equation of the form `aP + bQ = R` takes approximately 500,000 gas.