@nori-zk/o1js-zk-utils/build/merkle-attestor/testUtils.js

o1js-zk-utils supporting Nori Bridge

import { Bytes, Field, Poseidon, Struct, UInt8 } from 'o1js';
import { Bytes32 } from '../types.js';
export function dummyCodeChallenge(i) {
    const arr = new Uint8Array(32).fill(0);
    const view = new DataView(arr.buffer);
    view.setUint32(0, i, true); // little-endian, first 4 bytes
    return Bytes32.from(arr);
}
export function dummyValue(i) {
    const arr = new Uint8Array(32).fill(0);
    const view = new DataView(arr.buffer);
    view.setUint32(0, i, true); // little-endian, first 4 bytes
    return Bytes32.from(arr);
}
export function nonProvableStorageSlotLeafHash(codeChallenge, value) {
    const codeChallengeBytes = codeChallenge.toBytes();
    const valueBytes = value.toBytes();
    // 64 bytes total (32 + 32), max 31 bytes per field -> 3 fields
    // firstFieldBytes: 1 byte from codeChallenge + 1 byte from value + 30 zeros
    const firstFieldBytes = new Uint8Array(32);
    firstFieldBytes[0] = codeChallengeBytes[0];
    firstFieldBytes[1] = valueBytes[0];
    // secondFieldBytes: remaining 31 bytes from codeChallenge (1 to 31)
    const secondFieldBytes = new Uint8Array(32);
    secondFieldBytes.set(codeChallengeBytes.slice(1, 32), 0);
    // thirdFieldBytes: remaining 31 bytes from value (1 to 31)
    const thirdFieldBytes = new Uint8Array(32);
    thirdFieldBytes.set(valueBytes.slice(1, 32), 0);
    /*console.log('firstFieldBytes', firstFieldBytes);
    console.log('secondFieldBytes', secondFieldBytes);
    console.log('thirdFieldBytes', thirdFieldBytes);*/
    const firstField = Field.fromBytes(Array.from(firstFieldBytes));
    const secondField = Field.fromBytes(Array.from(secondFieldBytes));
    const thirdField = Field.fromBytes(Array.from(thirdFieldBytes));
    /*console.log('firstField', firstField.toBigInt().toString());
    console.log('secondField', secondField.toBigInt().toString());
    console.log('thirdField', thirdField.toBigInt().toString());*/
    return Poseidon.hash([firstField, secondField, thirdField]);
}
// Build leaf hashes from pairs of (CodeChallenge, Value)
export function buildLeavesNonProvable(pairs) {
    return pairs.map(([codeChallenge, val]) => nonProvableStorageSlotLeafHash(codeChallenge, val));
}
export class ProvableLeafObject extends Struct({
    codeChallenge: Bytes32.provable,
    value: Bytes32.provable,
}) {
}
export function provableLeafContentsHash(leafContents) {
    const codeChallengeBytes = leafContents.codeChallenge.bytes; // UInt8[]
    const valueBytes = leafContents.value.bytes; // UInt8[]
    /*Provable.asProver(() => {
        Provable.log('codeChallengeBytes', codeChallengeBytes);
        Provable.log('valueBytes', valueBytes);
    });*/
    // 64 bytes total (32 + 32), max 31 bytes per field -> 3 fields
    // firstFieldBytes: 1 byte from codeChallenge + 1 byte from value + 30 zeros
    const firstFieldBytes = [];
    firstFieldBytes.push(codeChallengeBytes[0]);
    firstFieldBytes.push(valueBytes[0]);
    for (let i = 2; i < 32; i++) {
        firstFieldBytes.push(UInt8.zero); // static pad to 32
    }
    // secondFieldBytes: remaining 31 bytes from codeChallenge (1 to 31)
    const secondFieldBytes = [];
    for (let i = 1; i < 32; i++) {
        secondFieldBytes.push(codeChallengeBytes[i]);
    }
    // already 31 elements; add 1 zero to reach 32
    secondFieldBytes.push(UInt8.zero);
    // thirdFieldBytes: remaining 31 bytes from value (1 to 31)
    const thirdFieldBytes = [];
    for (let i = 1; i < 32; i++) {
        thirdFieldBytes.push(valueBytes[i]);
    }
    // already 31 elements; add 1 zero to reach 32
    thirdFieldBytes.push(UInt8.zero);
    // Convert UInt8[] to Bytes (provable bytes)
    const firstBytes = Bytes.from(firstFieldBytes);
    const secondBytes = Bytes.from(secondFieldBytes);
    const thirdBytes = Bytes.from(thirdFieldBytes);
    // Extract the first field (there should only ever be one here)
    /*Provable.asProver(() => {
        Provable.log('firstBytes.toFields()', firstBytes.toFields());
        Provable.log('secondBytes.toFields()', secondBytes.toFields());
        Provable.log('thirdBytes.toFields()', thirdBytes.toFields());
    });*/
    let firstField = new Field(0);
    let secondField = new Field(0);
    let thirdField = new Field(0);
    // Little endian
    for (let i = 31; i >= 0; i--) {
        firstField = firstField.mul(256).add(firstBytes.bytes[i].value);
        secondField = secondField.mul(256).add(secondBytes.bytes[i].value);
        thirdField = thirdField.mul(256).add(thirdBytes.bytes[i].value);
    }
    /*Provable.asProver(() => {
        Provable.log('(provable)firstField', firstField.toBigInt());
        Provable.log('(provable)secondField', secondField.toBigInt());
        Provable.log('(provable)thirdField', thirdField.toBigInt());
    });*/
    return Poseidon.hash([firstField, secondField, thirdField]);
}
//# sourceMappingURL=testUtils.js.map