chiavdf 1.1.13

Bindings to the chiavdf C++ library.
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
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171

#ifndef VERIFIER_H
#define VERIFIER_H

#include "include.h"
#include "integer_common.h"
#include "util.h"
#include "picosha2.h"
#include "nucomp.h"
#include "proof_common.h"
#include "create_discriminant.h"

const uint8_t DEFAULT_ELEMENT[] = { 0x08 };

int VerifyWesoSegment(integer &D, form x, form proof, integer &B, uint64_t iters, form &out_y)
{
    PulmarkReducer reducer;
    integer L = root(-D, 4);
    integer r = FastPow(2, iters, B);
    form f1 = FastPowFormNucomp(proof, D, B, L, reducer);
    form f2 = FastPowFormNucomp(x, D, r, L, reducer);
    out_y = f1 * f2;

    return B == GetB(D, x, out_y) ? 0 : -1;
}

void VerifyWesolowskiProof(integer &D, form x, form y, form proof, uint64_t iters, bool &is_valid)
{
    PulmarkReducer reducer;
    integer L = root(-D, 4);
    integer B = GetB(D, x, y);
    integer r = FastPow(2, iters, B);
    form f1 = FastPowFormNucomp(proof, D, B, L, reducer);
    form f2 = FastPowFormNucomp(x, D, r, L, reducer);
    if (f1 * f2 == y)
    {
        is_valid = true;
    }
    else
    {
        is_valid = false;
    }
}

bool CheckProofOfTimeNWesolowski(integer D, const uint8_t* x_s, const uint8_t* proof_blob, int32_t proof_blob_len, uint64_t iterations, uint64 disc_size_bits, int32_t depth)
{
    int form_size = BQFC_FORM_SIZE;
    int segment_len = 8 + B_bytes + form_size;
    // Enforce all invariants and bounds before the loop        
    if (form_size <= 0) return false;
    if (depth < 0 || proof_blob_len != 2 * form_size + depth * segment_len)
        return false;
    if (x_s == nullptr || proof_blob == nullptr)
        return false;

    // All accesses in the loop are now safe
    int i = proof_blob_len - segment_len;
    form x = DeserializeForm(D, x_s, form_size);

    bool is_valid = false;
    for (; i >= 2 * form_size; i -= segment_len) {
        uint64_t segment_iters = BytesToInt64(&proof_blob[i]);
        form proof = DeserializeForm(D, &proof_blob[i + 8 + B_bytes], form_size);
        integer B(&proof_blob[i + 8], B_bytes);
        form xnew;
        if (VerifyWesoSegment(D, x, proof, B, segment_iters, xnew))
            return false;

        x = xnew;
        if (segment_iters > iterations) {
            return false;
        }
        iterations -= segment_iters;
    }

    // Final forms are guaranteed to be in-bounds
    VerifyWesolowskiProof(D, x,
        DeserializeForm(D, proof_blob, form_size),
        DeserializeForm(D, &proof_blob[form_size], form_size),
        iterations, is_valid);

    return is_valid;
}

bool CheckProofOfTimeNWesolowskiCommon(integer& D, form& x, const uint8_t* proof_blob, int32_t proof_blob_len, uint64_t& iterations, int last_segment, bool skip_check = false) {
    int form_size = BQFC_FORM_SIZE;
    int segment_len = 8 + B_bytes + form_size;
    if (proof_blob == nullptr) return false;
    if (last_segment < 0 || proof_blob_len < 0) return false;
    if (proof_blob_len < last_segment) return false;
    if ((proof_blob_len - last_segment) % segment_len != 0)
        return false;    
    int i = proof_blob_len - segment_len;
    PulmarkReducer reducer;

    for (; i >= last_segment; i -= segment_len) {
        uint64_t segment_iters = BytesToInt64(&proof_blob[i]);
        form proof = DeserializeForm(D, &proof_blob[i + 8 + B_bytes], form_size);
        integer B(&proof_blob[i + 8], B_bytes);
        form xnew;
        if (!skip_check) {
            if (VerifyWesoSegment(D, x, proof, B, segment_iters, xnew))
                return false;
        } else {
            integer L = root(-D, 4);
            integer r = FastPow(2, segment_iters, B);
            form f1 = FastPowFormNucomp(proof, D, B, L, reducer);
            form f2 = FastPowFormNucomp(x, D, r, L, reducer);
            xnew = f1 * f2;
        }

        x = xnew;
        if (segment_iters > iterations) {
            return false;
        }
        iterations -= segment_iters;
    }
    return true;
}

std::pair<bool, std::vector<uint8_t>> CheckProofOfTimeNWesolowskiWithB(integer D, integer B, const uint8_t* x_s, const uint8_t* proof_blob, int32_t proof_blob_len, uint64_t iterations, int32_t depth) {
    int form_size = BQFC_FORM_SIZE;
    int segment_len = 8 + B_bytes + form_size;
    if (x_s == nullptr || proof_blob == nullptr) return {false, {}};
    form x = DeserializeForm(D, x_s, form_size);
    std::vector<uint8_t> result;
    if (proof_blob_len != form_size + depth * segment_len) {
        return {false, result};
    }
    bool is_valid = CheckProofOfTimeNWesolowskiCommon(D, x, proof_blob, proof_blob_len, iterations, form_size);
    if (is_valid == false) {
        return {false, result};
    }
    if (form_size > proof_blob_len) return {false, result};
    form proof = DeserializeForm(D, proof_blob, form_size);
    form y_result;
    if (VerifyWesoSegment(D, x, proof, B, iterations, y_result) == -1) {
        return {false, result};
    }
    int d_bits = D.num_bits();
    result = SerializeForm(y_result, d_bits);
    return {true, result};
}

integer GetBFromProof(integer D, const uint8_t* x_s, const uint8_t* proof_blob, int32_t proof_blob_len, uint64_t iterations, int32_t depth) {
    int form_size = BQFC_FORM_SIZE;
    int segment_len = 8 + B_bytes + form_size;
    if (x_s == nullptr || proof_blob == nullptr) throw std::runtime_error("Invalid proof.");
    form x = DeserializeForm(D, x_s, form_size);
    if (proof_blob_len != 2 * form_size + depth * segment_len) {
        throw std::runtime_error("Invalid proof.");
    }
    bool is_valid = CheckProofOfTimeNWesolowskiCommon(D, x, proof_blob, proof_blob_len, iterations, 2 * form_size, true);
    if (is_valid == false) {
        throw std::runtime_error("Invalid proof.");
    }
    if (form_size > proof_blob_len) throw std::runtime_error("Invalid proof.");
    form y = DeserializeForm(D, proof_blob, form_size);
    return GetB(D, x, y);
}

bool CreateDiscriminantAndCheckProofOfTimeNWesolowski(std::vector<uint8_t> seed, uint32 disc_size_bits, const uint8_t* x_s, const uint8_t* proof_blob, int32_t proof_blob_len, uint64_t iterations, int32_t depth)
{
    integer D = CreateDiscriminant(
            seed,
            disc_size_bits
        );

    return CheckProofOfTimeNWesolowski(D, x_s, proof_blob, proof_blob_len, iterations, disc_size_bits, depth);
} 

#endif // VERIFIER_H