circomlibjs-hinkal-fork 0.0.2 → 0.0.3

package/src/mimcsponge_gencontract.js

@@ -1,125 +0,0 @@
-// Copyright (c) 2018 Jordi Baylina
-// License: LGPL-3.0+
-//
-
-import { ethers } from "ethers";
-
-import Contract from "./evmasm.js";
-
-export function createCode(seed, n) {
-
-    let ci = ethers.utils.keccak256(ethers.utils.toUtf8Bytes(seed));
-
-    const C = new Contract();
-
-    C.push(0x64);
-    C.push("0x00");
-    C.push("0x00");
-    C.calldatacopy();
-    C.push("0x0100000000000000000000000000000000000000000000000000000000");
-    C.push("0x00");
-    C.mload();
-    C.div();
-    C.push("0x3f1a1187"); // MiMCSponge(uint256,uint256,uint256)
-    C.eq();
-    C.jmpi("start");
-    C.invalid();
-
-    C.label("start");
-    C.push("0x30644e72e131a029b85045b68181585d2833e84879b9709143e1f593f0000001");  // q
-    C.push("0x44");
-    C.mload();          // k q
-    C.push("0x04");
-    C.mload();          // xL k q
-    C.dup(2);           // q xL k q
-    C.push("0x24");
-    C.mload();          // xR q xL k q
-    C.dup(1);           // q xR q xL k q
-    C.dup(0);           // q q xR q xL k q
-    C.dup(4);           // xL q q xR q xL k q
-    C.dup(6);           // k xL q q xR q xL k q
-    C.addmod();         // t=k+xL q xR q xL k q
-    C.dup(1);           // q t q xR q xL k q
-    C.dup(0);           // q q t q xR q xL k q
-    C.dup(2);           // t q q t q xR q xL k q
-    C.dup(0);           // t t q q t q xR q xL k q
-    C.mulmod();         // b=t^2 q t q xR q xL k q
-    C.dup(0);           // b b q t q xR q xL k q
-    C.mulmod();         // c=t^4 t q xR q xL k q
-    C.mulmod();         // d=t^5 xR q xL k q
-    C.addmod();         // e=t^5+xR xL k q (for next round: xL xR k q)
-
-    for (let i=0; i<n-1; i++) {
-        if (i < n-2) {
-          ci = ethers.utils.keccak256(ci);
-        } else {
-          ci = "0x00";
-        }
-        C.swap(1);      // xR xL k q
-        C.dup(3);       // q xR xL k q
-        C.dup(3);       // k q xR xL k q
-        C.dup(1);       // q k q xR xL k q
-        C.dup(4);       // xL q k q xR xL k q
-        C.push(ci);     // ci xL q k q xR xL k q
-        C.addmod();     // a=ci+xL k q xR xL k q
-        C.addmod();     // t=a+k xR xL k q
-        C.dup(4);       // q t xR xL k q
-        C.swap(1);      // t q xR xL k q
-        C.dup(1);       // q t q xR xL k q
-        C.dup(0);       // q q t q xR xL k q
-        C.dup(2);       // t q q t q xR xL k q
-        C.dup(0);       // t t q q t q xR xL k q
-        C.mulmod();     // b=t^2 q t q xR xL k q
-        C.dup(0);       // b b q t q xR xL k q
-        C.mulmod();     // c=t^4 t q xR xL k q
-        C.mulmod();     // d=t^5 xR xL k q
-        C.dup(4);       // q d xR xL k q
-        C.swap(2);      // xR d q xL k q
-        C.addmod();     // e=t^5+xR xL k q (for next round: xL xR k q)
-    }
-
-    C.push("0x20");
-    C.mstore();     // Save it to pos 0;
-    C.push("0x00");
-    C.mstore();     // Save it to pos 1;
-    C.push("0x40");
-    C.push("0x00");
-    C.return();
-
-    return C.createTxData();
-}
-
-export const abi = [
-    {
-        "constant": true,
-        "inputs": [
-            {
-                "name": "xL_in",
-                "type": "uint256"
-            },
-            {
-                "name": "xR_in",
-                "type": "uint256"
-            },
-            {
-                "name": "k",
-                "type": "uint256"
-            }
-        ],
-        "name": "MiMCSponge",
-        "outputs": [
-            {
-                "name": "xL",
-                "type": "uint256"
-            },
-            {
-                "name": "xR",
-                "type": "uint256"
-            }
-        ],
-        "payable": false,
-        "stateMutability": "pure",
-        "type": "function"
-    }
-];
-

package/src/mimcsponge_printconstants.js

@@ -1,25 +0,0 @@
-import buildMimcSponge from "./mimcsponge.js";
-import process from "process";
-
-async function run() {
-    const mimcsponge = await buildMimcSponge();
-    const nRounds = 220;
-    let S = "[\n";
-    const cts = mimcsponge.getConstants();
-    for (let i=0; i<nRounds; i++) {
-        S = S + mimcsponge.F.toString(cts[i]);
-        if (i<nRounds-1) S = S + ",";
-        S=S+"\n";
-    }
-    S = S + "]\n";
-    
-    console.log(S);
-}
-
-run().then(()=> {
-    process.exit(0);
-}, (err) => {
-    console.log(err.stack);
-    console.log(err.message);
-    process.exit(1);
-});

package/src/mimcsponge_printcontract.js

@@ -1,14 +0,0 @@
-import {createCode} from "./mimcsponge_gencontract.js";
-import process from "process";
-
-const SEED = "mimcsponge";
-
-let nRounds;
-if (typeof process.argv[2] != "undefined") {
-    nRounds = parseInt(process.argv[2]);
-} else {
-    nRounds = 220;
-}
-
-console.log(createCode(SEED, nRounds));
-

package/src/pedersen_printbases.js

@@ -1,36 +0,0 @@
-import buildPedersenHash from "./pedersenhash.js";
-import process from "process";
-
-async function run() {
-    const pedersenHash = await buildPedersenHash();
-
-    let nBases;
-    if (typeof process.argv[2] != "undefined") {
-        nBases = parseInt(process.argv[2]);
-    } else {
-        nBases = 5;
-    }
-
-    let baseHash;
-    if (typeof process.argv[3] != "undefined") {
-        baseHash = process.argv[3];
-    } else {
-        baseHash = "blake";
-    }
-
-    for (let i=0; i < nBases; i++) {
-        const p = pedersenHash.getBasePoint(i);
-        console.log(`[${pedersenHash.babyJub.F.toString(p[0])},${pedersenHash.babyJub.F.toString(p[1])}]`);
-    }
-
-
-}
-
-run().then(()=> {
-    process.exit(0);
-}, (err) => {
-    console.log(err.stack);
-    console.log(err.message);
-    process.exit(1);
-});
-

package/src/poseidon_gencontract.js

@@ -1,209 +0,0 @@
-// Copyright (c) 2018 Jordi Baylina
-// License: LGPL-3.0+
-//
-
-import Contract from "./evmasm.js";
-import { utils } from "ffjavascript";
-const { unstringifyBigInts } = utils;
-import { ethers } from "ethers";
-
-import poseidonConstants from "./poseidon_constants.js";
-
-const { C:K, M } = unstringifyBigInts(poseidonConstants);
-
-const N_ROUNDS_F = 8;
-const N_ROUNDS_P = [56, 57, 56, 60, 60, 63, 64, 63];
-
-function toHex256(a) {
-    let S = a.toString(16);
-    while (S.length < 64) S="0"+S;
-    return "0x" + S;
-}
-
-export function createCode(nInputs) {
-
-    if (( nInputs<1) || (nInputs>8)) throw new Error("Invalid number of inputs. Must be 1<=nInputs<=8");
-    const t = nInputs + 1;
-    const nRoundsF = N_ROUNDS_F;
-    const nRoundsP = N_ROUNDS_P[t - 2];
-
-    const C = new Contract();
-
-    function saveM() {
-        for (let i=0; i<t; i++) {
-            for (let j=0; j<t; j++) {
-                C.push(toHex256(M[t-2][i][j]));
-                C.push((1+i*t+j)*32);
-                C.mstore();
-            }
-        }
-    }
-
-    function ark(r) {   // st, q
-        for (let i=0; i<t; i++) {
-            C.dup(t); // q, st, q
-            C.push(toHex256(K[t-2][r*t+i]));  // K, q, st, q
-            C.dup(2+i); // st[i], K, q, st, q
-            C.addmod(); // newSt[i], st, q
-            C.swap(1 + i); // xx, st, q
-            C.pop();
-        }
-    }
-
-    function sigma(p) {
-        // sq, q
-        C.dup(t);   // q, st, q
-        C.dup(1+p); // st[p] , q , st, q
-        C.dup(1);   // q, st[p] , q , st, q
-        C.dup(0);   // q, q, st[p] , q , st, q
-        C.dup(2);   // st[p] , q, q, st[p] , q , st, q
-        C.dup(0);   // st[p] , st[p] , q, q, st[p] , q , st, q
-        C.mulmod(); // st2[p], q, st[p] , q , st, q
-        C.dup(0);   // st2[p], st2[p], q, st[p] , q , st, q
-        C.mulmod(); // st4[p], st[p] , q , st, q
-        C.mulmod(); // st5[p], st, q
-        C.swap(1+p);
-        C.pop();      // newst, q
-    }
-
-    function mix() {
-        C.label("mix");
-        for (let i=0; i<t; i++) {
-            for (let j=0; j<t; j++) {
-                if (j==0) {
-                    C.dup(i+t);      // q, newSt, oldSt, q
-                    C.push((1+i*t+j)*32);
-                    C.mload();      // M, q, newSt, oldSt, q
-                    C.dup(2+i+j);    // oldSt[j], M, q, newSt, oldSt, q
-                    C.mulmod();      // acc, newSt, oldSt, q
-                } else {
-                    C.dup(1+i+t);    // q, acc, newSt, oldSt, q
-                    C.push((1+i*t+j)*32);
-                    C.mload();      // M, q, acc, newSt, oldSt, q
-                    C.dup(3+i+j);    // oldSt[j], M, q, acc, newSt, oldSt, q
-                    C.mulmod();      // aux, acc, newSt, oldSt, q
-                    C.dup(2+i+t);    // q, aux, acc, newSt, oldSt, q
-                    C.swap(2);       // acc, aux, q, newSt, oldSt, q
-                    C.addmod();      // acc, newSt, oldSt, q
-                }
-            }
-        }
-        for (let i=0; i<t; i++) {
-            C.swap((t -i) + (t -i-1));
-            C.pop();
-        }
-        C.push(0);
-        C.mload();
-        C.jmp();
-    }
-
-
-    // Check selector
-    C.push("0x0100000000000000000000000000000000000000000000000000000000");
-    C.push(0);
-    C.calldataload();
-    C.div();
-    C.dup(0);
-    C.push(ethers.utils.keccak256(ethers.utils.toUtf8Bytes(`poseidon(uint256[${nInputs}])`)).slice(0, 10)); // poseidon(uint256[n])
-    C.eq();
-    C.swap(1);
-    C.push(ethers.utils.keccak256(ethers.utils.toUtf8Bytes(`poseidon(bytes32[${nInputs}])`)).slice(0, 10)); // poseidon(bytes32[n])
-    C.eq();
-    C.or();
-    C.jmpi("start");
-    C.invalid();
-
-    C.label("start");
-
-    saveM();
-
-    C.push("0x30644e72e131a029b85045b68181585d2833e84879b9709143e1f593f0000001");  // q
-
-    // Load t values from the call data.
-    // The function has a single array param param
-    // [Selector (4)] [item1 (32)] [item2 (32)] ....
-    // Stack positions 0-nInputs.
-    for (let i=0; i<nInputs; i++) {
-        C.push(0x04+(0x20*(nInputs-i-1)));
-        C.calldataload();
-    }
-
-    C.push(0);
-
-    for (let i=0; i<nRoundsF+nRoundsP; i++) {
-        ark(i);
-        if ((i<nRoundsF/2) || (i>=nRoundsP+nRoundsF/2)) {
-            for (let j=0; j<t; j++) {
-                sigma(j);
-            }
-        } else {
-            sigma(0);
-        }
-        const strLabel = "aferMix"+i;
-        C._pushLabel(strLabel);
-        C.push(0);
-        C.mstore();
-        C.jmp("mix");
-        C.label(strLabel);
-    }
-
-    C.push("0x00");
-    C.mstore();     // Save it to pos 0;
-    C.push("0x20");
-    C.push("0x00");
-    C.return();
-
-    mix();
-
-    return C.createTxData();
-}
-
-export function generateABI(nInputs) {
-    return [
-        {
-            "constant": true,
-            "inputs": [
-                {
-                    "internalType": `bytes32[${nInputs}]`,
-                    "name": "input",
-                    "type": `bytes32[${nInputs}]`
-                }
-            ],
-            "name": "poseidon",
-            "outputs": [
-                {
-                    "internalType": "bytes32",
-                    "name": "",
-                    "type": "bytes32"
-                }
-            ],
-            "payable": false,
-            "stateMutability": "pure",
-            "type": "function"
-        },
-        {
-            "constant": true,
-            "inputs": [
-                {
-                    "internalType": `uint256[${nInputs}]`,
-                    "name": "input",
-                    "type": `uint256[${nInputs}]`
-                }
-            ],
-            "name": "poseidon",
-            "outputs": [
-                {
-                    "internalType": "uint256",
-                    "name": "",
-                    "type": "uint256"
-                }
-            ],
-            "payable": false,
-            "stateMutability": "pure",
-            "type": "function"
-        }
-    ];
-}
-
-
-

package/src/poseidon_opt.js

@@ -1,119 +0,0 @@
-// Parameters are generated by a reference script https://extgit.iaik.tugraz.at/krypto/hadeshash/-/blob/master/code/generate_parameters_grain.sage
-// Used like so: sage generate_parameters_grain.sage 1 0 254 2 8 56 0x30644e72e131a029b85045b68181585d2833e84879b9709143e1f593f0000001
-
-// Using recommended parameters from whitepaper https://eprint.iacr.org/2019/458.pdf (table 2, table 8)
-// Generated by https://extgit.iaik.tugraz.at/krypto/hadeshash/-/blob/master/code/calc_round_numbers.py
-// And rounded up to nearest integer that divides by t
-
-// Optimization is taken from https://github.com/filecoin-project/neptune
-
-import assert from "assert";
-import { getCurveFromName }  from "ffjavascript";
-
-import poseidonConstants from "./poseidon_constants_opt.js";
-
-function unsringifyConstants(Fr, o) {
-    if ((typeof(o) == "string") && (/^[0-9]+$/.test(o) ))  {
-        return Fr.e(o);
-    } else if ((typeof(o) == "string") && (/^0x[0-9a-fA-F]+$/.test(o) ))  {
-        return Fr.e(o);
-    } else if (Array.isArray(o)) {
-        return o.map(unsringifyConstants.bind(null, Fr));
-    } else if (typeof o == "object") {
-        if (o===null) return null;
-        const res = {};
-        const keys = Object.keys(o);
-        keys.forEach( (k) => {
-            res[k] = unsringifyConstants(Fr, o[k]);
-        });
-        return res;
-    } else {
-        return o;
-    }
-}
-
-export default async function buildPoseidon() {
-    const bn128 = await getCurveFromName("bn128", true);
-
-    const F = bn128.Fr;
-
-    const opt = unsringifyConstants(F, poseidonConstants);
-
-    const N_ROUNDS_F = 8;
-    const N_ROUNDS_P = [56, 57, 56, 60, 60, 63, 64, 63, 60, 66, 60, 65, 70, 60, 64, 68];
-
-    const pow5 = a => F.mul(a, F.square(F.square(a, a)));
-
-    function poseidon(inputs, initState, nOut) {
-        assert(inputs.length > 0);
-        assert(inputs.length <= N_ROUNDS_P.length);
-
-        if (initState) {
-            initState = F.e(initState);
-        } else {
-            initState = F.zero;
-        }
-        nOut = nOut || 1;
-
-
-        const t = inputs.length + 1;
-        const nRoundsF = N_ROUNDS_F;
-        const nRoundsP = N_ROUNDS_P[t - 2];
-        const C = opt.C[t-2];
-        const S = opt.S[t-2];
-        const M = opt.M[t-2];
-        const P = opt.P[t-2];
-
-        let state = [initState, ...inputs.map(a => F.e(a))];
-
-        state = state.map((a, i) => F.add(a, C[i]));
-
-        for (let r = 0; r < nRoundsF/2-1; r++) {
-            state = state.map(a => pow5(a));
-            state = state.map((a, i) => F.add(a, C[(r +1)* t +i]));
-            state = state.map((_, i) =>
-                state.reduce((acc, a, j) => F.add(acc, F.mul(M[j][i], a)), F.zero)
-            );
-        }
-        state = state.map(a => pow5(a));
-        state = state.map((a, i) => F.add(a, C[(nRoundsF/2-1 +1)* t +i]));
-        state = state.map((_, i) =>
-            state.reduce((acc, a, j) => F.add(acc, F.mul(P[j][i], a)), F.zero)
-        );
-        for (let r = 0; r < nRoundsP; r++) {
-            state[0] = pow5(state[0]);
-            state[0] = F.add(state[0], C[(nRoundsF/2 +1)*t + r]);
-
-
-            const s0 = state.reduce((acc, a, j) => {
-                return F.add(acc, F.mul(S[(t*2-1)*r+j], a));
-            }, F.zero);
-            for (let k=1; k<t; k++) {
-                state[k] = F.add(state[k], F.mul(state[0], S[(t*2-1)*r+t+k-1]   ));
-            }
-            state[0] =s0;
-        }
-        for (let r = 0; r < nRoundsF/2-1; r++) {
-            state = state.map(a => pow5(a));
-            state = state.map((a, i) => F.add(a, C[ (nRoundsF/2 +1)*t + nRoundsP + r*t + i ]));
-            state = state.map((_, i) =>
-                state.reduce((acc, a, j) => F.add(acc, F.mul(M[j][i], a)), F.zero)
-            );
-        }
-        state = state.map(a => pow5(a));
-        state = state.map((_, i) =>
-            state.reduce((acc, a, j) => F.add(acc, F.mul(M[j][i], a)), F.zero)
-        );
-
-        if (nOut == 1) {
-            return state[0]
-        } else {
-            return state.slice(0, nOut);
-        }
-    }
-
-    poseidon.F = F;
-    return poseidon;
-}
-
-

package/src/poseidon_printcontract.js

@@ -1,14 +0,0 @@
-import {createCode} from "./poseidon_gencontract.js";
-import process from 'process';
-
-if (process.argv.length != 3) {
-    console.log("Usage: node poseidon_gencontract.js [numberOfInputs]");
-    process.exit(1);
-}
-
-const nInputs = Number(process.argv[2]);
-
-console.log(nInputs);
-
-console.log(createCode(nInputs));
-

package/src/poseidon_printmatrix.js

@@ -1,22 +0,0 @@
-
-
-const Poseidon = require("./poseidon.js");
-
-const M = Poseidon.getMatrix();
-
-let S = "[\n    ";
-
-for (let i=0; i<M.length; i++) {
-    const LC = M[i];
-    S = S + "[\n";
-    for (let j=0; j<LC.length; j++) {
-        S = S + "        " + M[i][j].toString();
-        if (j<LC.length-1) S = S + ",";
-        S = S + "\n";
-    }
-    S = S + "    ]";
-    if (i<M.length-1) S = S + ",";
-}
-S=S+ "\n]\n";
-
-console.log(S);

package/src/poseidon_reference.js

@@ -1,83 +0,0 @@
-
-import assert from "assert";
-import { getCurveFromName }  from "ffjavascript";
-
-import poseidonConstants from "./poseidon_constants.js";
-
-function unsringifyConstants(Fr, o) {
-    if ((typeof(o) == "string") && (/^[0-9]+$/.test(o) ))  {
-        return Fr.e(o);
-    } else if ((typeof(o) == "string") && (/^0x[0-9a-fA-F]+$/.test(o) ))  {
-        return Fr.e(o);
-    } else if (Array.isArray(o)) {
-        return o.map(unsringifyConstants.bind(null, Fr));
-    } else if (typeof o == "object") {
-        if (o===null) return null;
-        const res = {};
-        const keys = Object.keys(o);
-        keys.forEach( (k) => {
-            res[k] = unsringifyConstants(Fr, o[k]);
-        });
-        return res;
-    } else {
-        return o;
-    }
-}
-
-export default async function buildPoseidon() {
-    const bn128 = await getCurveFromName("bn128", true);
-
-    const F = bn128.Fr;
-
-    // Parameters are generated by a reference script https://extgit.iaik.tugraz.at/krypto/hadeshash/-/blob/master/code/generate_parameters_grain.sage
-    // Used like so: sage generate_parameters_grain.sage 1 0 254 2 8 56 0x30644e72e131a029b85045b68181585d2833e84879b9709143e1f593f0000001
-    const {C, M} = unsringifyConstants(F, poseidonConstants);
-
-    // Using recommended parameters from whitepaper https://eprint.iacr.org/2019/458.pdf (table 2, table 8)
-    // Generated by https://extgit.iaik.tugraz.at/krypto/hadeshash/-/blob/master/code/calc_round_numbers.py
-    // And rounded up to nearest integer that divides by t
-    const N_ROUNDS_F = 8;
-    const N_ROUNDS_P = [56, 57, 56, 60, 60, 63, 64, 63, 60, 66, 60, 65, 70, 60, 64, 68];
-
-    const pow5 = a => F.mul(a, F.square(F.square(a, a)));
-
-    function poseidon(inputs, initState, nOut) {
-        assert(inputs.length > 0);
-        assert(inputs.length <= N_ROUNDS_P.length);
-
-        const t = inputs.length + 1;
-        const nRoundsF = N_ROUNDS_F;
-        const nRoundsP = N_ROUNDS_P[t - 2];
-
-        if (initState) {
-            initState = F.e(initState);
-        } else {
-            initState = F.zero;
-        }
-        nOut = nOut || 1;
-
-        let state = [initState, ...inputs.map(a => F.e(a))];
-        for (let r = 0; r < nRoundsF + nRoundsP; r++) {
-            state = state.map((a, i) => F.add(a, C[t - 2][r * t + i]));
-
-            if (r < nRoundsF / 2 || r >= nRoundsF / 2 + nRoundsP) {
-                state = state.map(a => pow5(a));
-            } else {
-                state[0] = pow5(state[0]);
-            }
-
-            state = state.map((_, i) =>
-                state.reduce((acc, a, j) => F.add(acc, F.mul(M[t - 2][i][j], a)), F.zero)
-            );
-        }
-        if (nOut == 1) {
-            return state[0]
-        } else {
-            return state.slice(0, nOut);
-        }
-    }
-
-    poseidon.F = F;
-    return poseidon;
-}
-