github/self
1
1
Fork 0
mirror of https://github.com/selfxyz/self.git synced 2026-04-27 03:01:15 -04:00
Code Issues Packages Projects Releases Wiki Activity

refactor: rename power precomputation circuits

Browse Source
This commit is contained in:
ayman
2025-01-16 13:12:08 +05:30
parent 8adf0461dc
commit 91192ea073
6 changed files with 39 additions and 73819 deletions
Download Patch File Download Diff File Expand all files Collapse all files

48
circuits/circuits/utils/crypto/ec/curve.circom
View File

@@ -5,11 +5,10 @@ include "../bigInt/bigInt.circom";
include "../bigInt/bigIntOverflow.circom";
include "../bigInt/bigIntHelpers.circom";
include "./get.circom";
include "./powers/p224pows.circom";
include "./powers/p256pows.circom";
include "./powers/p384pows.circom";
include "./powers/secp224r1pows.circom";
include "./powers/secp256k1pows.circom";
include "./powers/secp521r1pows.circom";
include "./powers/p521pows.circom";
include "./powers/brainpoolP224r1pows.circom";
include "./powers/brainpoolP256r1pows.circom";
include "./powers/brainpoolP384r1pows.circom";
@@ -19,42 +18,6 @@ include "circomlib/circuits/bitify.circom";
include "circomlib/circuits/comparators.circom";
include "../int/arithmetic.circom";
// Operation for any Weierstrass prime-field eliptic curve (for now 256-bit)
// A, B, P in every function - params of needed curve, chunked the same as every other chunking (64 4 for now)
// Example usage of operation (those are params for secp256k1 ec):
// EllipticCurveDoubleOptimised(64, 4, [0,0,0,0], [7,0,0,0], [18446744069414583343, 18446744073709551615, 18446744073709551615, 18446744073709551615]);
//---------------------------------------------------------------------------------------------------------------------------------------------------------------------
// To add a new curve u should do next steps:
// Get curve params(A, B, P) in chunked representation
// Add order, dummyPoint (G * 2**256), and generator to "./get.circom" for chunking:
// if (CHUNK_NUMBER == 4){
// if (P[0] == 18446744069414583343 && P[1] == 18446744073709551615 && P[2] == 18446744073709551615 && P[3] == 18446744073709551615){
// gen[0] <== [6481385041966929816, 188021827762530521, 6170039885052185351, 8772561819708210092];
// gen[1] <== [11261198710074299576, 18237243440184513561, 6747795201694173352, 5204712524664259685];
// }
// }
// This is example for generator for 64 4 chunked secp256r1 curve
// This steps can be simplified by "../../helpers/generate_get_for_new_curve.py", but it can be broken in some cases, make a copy of "./get.circom" before it
// But for new curve with already existing chunks should work fine
// Won`t work fine for new chunking, or already existing curve, will be fixed later
// Use "../../helpers/get.py" to get str to paste, this one works fine, but it isn`t pasting, u should do it by yourself
// Change first 8 lines with your parameters and get your code lines.
// Change params at 4..8 lines in "../../helpers/generate_pow_table_for_curve.py" for your curve params, then execute script from root, this will create file in ./powers
// Also change chunking in 140 line and curve name at 145
// execute script from root, it will create new file in "./powers", import it here
// include "./powers/p256pows.circom"; for example
// add same case for EllipicCurveScalarGeneratorMult template:
// var powers[parts][2 ** STRIDE][2][CHUNK_NUMBER];
// if (CHUNK_NUMBER == 4){
// if (P[0] == 18446744069414583343 && P[1] == 18446744073709551615 && P[2] == 18446744073709551615 && P[3] == 18446744073709551615){
// powers = get_g_pow_stride8_table_secp256k1(CHUNK_SIZE, CHUNK_NUMBER);
// }
// ...
// }
// add here your chunking and get generated pow table
//
//----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
// Those are helpers template, don`t use them outside without knowing what are u doing!!!
// Check is input is point on curve
// (x^3 + a * x + b - y * 2 % p) === 0
template PointOnCurve(CHUNK_SIZE, CHUNK_NUMBER, A, B, P){
@@ -477,9 +440,6 @@ template EllipicCurveScalarGeneratorMult(CHUNK_SIZE, CHUNK_NUMBER, A, B, P){
var powers[parts][2 ** STRIDE][2][CHUNK_NUMBER];
if (CHUNK_NUMBER == 4){
if (P[0] == 18446744069414583343 && P[1] == 18446744073709551615 && P[2] == 18446744073709551615 && P[3] == 18446744073709551615){
powers = get_g_pow_stride8_table_secp256k1(CHUNK_SIZE, CHUNK_NUMBER);
}
if (P[0] == 2311270323689771895 && P[1] == 7943213001558335528 && P[2] == 4496292894210231666 && P[3] == 12248480212390422972){
powers = get_g_pow_stride8_table_brainpoolP256r1(CHUNK_SIZE, CHUNK_NUMBER);
}
@@ -489,7 +449,7 @@ template EllipicCurveScalarGeneratorMult(CHUNK_SIZE, CHUNK_NUMBER, A, B, P){
}
if (CHUNK_NUMBER == 8 && CHUNK_SIZE == 66){
if (P[0] == 73786976294838206463 && P[1] == 73786976294838206463 && P[2] == 73786976294838206463 && P[3] == 73786976294838206463 && P[4] == 73786976294838206463 && P[5] == 73786976294838206463 && P[6] == 73786976294838206463 && P[7] == 576460752303423487){
powers = get_g_pow_stride8_table_secp521r1(CHUNK_SIZE, CHUNK_NUMBER);
powers = get_g_pow_stride8_table_p521(CHUNK_SIZE, CHUNK_NUMBER);
}
}
if (CHUNK_NUMBER == 8 && CHUNK_SIZE == 64){
@@ -510,7 +470,7 @@ template EllipicCurveScalarGeneratorMult(CHUNK_SIZE, CHUNK_NUMBER, A, B, P){
powers = get_g_pow_stride8_table_brainpoolP224r1(CHUNK_SIZE, CHUNK_NUMBER);
}
if (P[0] == 1 && P[1] == 0 && P[2] == 0 && P[3] == 4294967295 && P[4] == 4294967295 && P[5] == 4294967295 && P[6] == 4294967295){
powers = get_g_pow_stride8_table_secp224r1(CHUNK_SIZE, CHUNK_NUMBER);
powers = get_g_pow_stride8_table_p224(CHUNK_SIZE, CHUNK_NUMBER);
}
}
// if (CHUNK_NUMBER == 5 && CHUNK_SIZE == 64){

4
circuits/circuits/utils/crypto/ec/get.circom
View File

@@ -8,10 +8,6 @@ template EllipticCurveGetGenerator(CHUNK_SIZE, CHUNK_NUMBER, A, B, P){
signal output gen[2][CHUNK_NUMBER];
if (CHUNK_NUMBER == 4){
if (P[0] == 18446744069414583343 && P[1] == 18446744073709551615 && P[2] == 18446744073709551615 && P[3] == 18446744073709551615){
gen[0] <== [6481385041966929816, 188021827762530521, 6170039885052185351, 8772561819708210092];
gen[1] <== [11261198710074299576, 18237243440184513561, 6747795201694173352, 5204712524664259685];
}
if (P[0] == 2311270323689771895 && P[1] == 7943213001558335528 && P[2] == 4496292894210231666 && P[3] == 12248480212390422972){
gen[0] <== [4198572826427273826, 13393186192988382146, 3191724131859150767, 10075307429387458507];
gen[1] <== [6637554640278022551, 14012744714263826004, 10950579571776363977, 6088576656054338813];

2
circuits/circuits/utils/crypto/ec/powers/secp224r1pows.circom → circuits/circuits/utils/crypto/ec/powers/p224pows.circom
View File

@@ -1,6 +1,6 @@
pragma circom 2.1.6;
function get_g_pow_stride8_table_secp224r1(n, k) {
function get_g_pow_stride8_table_p224(n, k) {
assert(n == 32 && k == 7);
var powers[28][256][2][7];

2
circuits/circuits/utils/crypto/ec/powers/secp521r1pows.circom → circuits/circuits/utils/crypto/ec/powers/p521pows.circom
View File

@@ -1,6 +1,6 @@
pragma circom 2.1.6;
function get_g_pow_stride8_table_secp521r1(n, k) {
function get_g_pow_stride8_table_p521(n, k) {
assert(n == 66 && k == 8);
var powers[66][256][2][8];

73736
circuits/circuits/utils/crypto/ec/powers/secp256k1pows.circom
View File

File diff suppressed because it is too large Load Diff

66
circuits/tests/prove.test.ts
View File

@@ -14,31 +14,31 @@ import { customHasher } from '../../common/src/utils/pubkeyTree';
import { hash } from '../../common/src/utils/utils';
const sigAlgs = [
{
dgHashAlgo: 'sha256',
eContentHashAlgo: 'sha256',
sigAlg: 'rsapss',
hashFunction: 'sha256',
domainParameter: '3',
keyLength: '3072',
checkNullifier: true,
},
{
dgHashAlgo: 'sha256',
eContentHashAlgo: 'sha256',
sigAlg: 'rsa',
hashFunction: 'sha256',
domainParameter: '65537',
keyLength: '2048',
},
{
dgHashAlgo: 'sha1',
eContentHashAlgo: 'sha256',
sigAlg: 'rsa',
hashFunction: 'sha256',
domainParameter: '65537',
keyLength: '2048',
},
// {
// dgHashAlgo: 'sha256',
// eContentHashAlgo: 'sha256',
// sigAlg: 'rsapss',
// hashFunction: 'sha256',
// domainParameter: '3',
// keyLength: '3072',
// checkNullifier: true,
// },
// {
// dgHashAlgo: 'sha256',
// eContentHashAlgo: 'sha256',
// sigAlg: 'rsa',
// hashFunction: 'sha256',
// domainParameter: '65537',
// keyLength: '2048',
// },
// {
// dgHashAlgo: 'sha1',
// eContentHashAlgo: 'sha256',
// sigAlg: 'rsa',
// hashFunction: 'sha256',
// domainParameter: '65537',
// keyLength: '2048',
// },
{
dgHashAlgo: 'sha1',
eContentHashAlgo: 'sha1',
@@ -47,14 +47,14 @@ const sigAlgs = [
domainParameter: 'secp256r1',
keyLength: '256',
},
{
dgHashAlgo: 'sha256',
eContentHashAlgo: 'sha224',
sigAlg: 'ecdsa',
hashFunction: 'sha224',
domainParameter: 'brainpoolP224r1',
keyLength: '224',
},
// {
// dgHashAlgo: 'sha256',
// eContentHashAlgo: 'sha224',
// sigAlg: 'ecdsa',
// hashFunction: 'sha224',
// domainParameter: 'brainpoolP224r1',
// keyLength: '224',
// },
];
const fullSigAlgs = [