openvm-circuit-primitives 2.0.2

Library of plonky3 primitives for general purpose use in other ZK circuits.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68

#pragma once

#include "trace_access.h"

template <size_t N> struct FpArray {
    uint32_t v[N];

    __device__ RowSlice as_row() { return RowSlice((Fp *)&v[0], 1); }

    __device__ static FpArray from_row(RowSlice slice, size_t length = N) {
        FpArray result;
        for (int i = 0; i < length; i++) {
            result.v[i] = slice[i].asRaw();
        }
        for (int i = length; i < N; i++) {
            result.v[i] = 0;
        }
        return result;
    }

    __device__ static FpArray from_raw_array(uint32_t const raw[N]) {
        FpArray result;
        for (int i = 0; i < N; i++) {
            result.v[i] = raw[i];
        }
        return result;
    }

    __device__ static FpArray from_u32_array(uint32_t const arr[N]) {
        FpArray result;
        for (int i = 0; i < N; i++) {
            result.v[i] = Fp(arr[i]).asRaw();
        }
        return result;
    }

    __device__ static FpArray from_u8_array(uint8_t const arr[N]) {
        FpArray result;
        for (int i = 0; i < N; i++) {
            result.v[i] = Fp(arr[i]).asRaw();
        }
        return result;
    }
};

template <size_t N> __host__ __device__ bool operator<(const FpArray<N> &a, const FpArray<N> &b) {
    for (size_t i = 0; i < N; i++) {
        if (a.v[i] != b.v[i]) {
            return a.v[i] < b.v[i];
        }
    }
    return false;
}

template <size_t N> __host__ __device__ bool operator==(const FpArray<N> &a, const FpArray<N> &b) {
    for (size_t i = 0; i < N; i++) {
        if (a.v[i] != b.v[i]) {
            return false;
        }
    }
    return true;
}

struct Fp16CompareOp {
    __host__ __device__ bool operator()(const FpArray<16> &a, const FpArray<16> &b) const {
        return a < b;
    }
};