chiavdf 1.1.14

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

#include "c_wrapper.h"
#include <vector>
#include <gmpxx.h>
#include "../verifier.h"
#include "../prover_slow.h"

extern "C" {
    // C wrapper function
    bool create_discriminant_wrapper(const uint8_t* seed, size_t seed_size, size_t size_bits, uint8_t* result) {
        try {
            std::vector<uint8_t> seed_vector(seed, seed + seed_size);
            integer discriminant = CreateDiscriminant(seed_vector, size_bits);
            mpz_export(result, NULL, 1, 1, 0, 0, discriminant.impl);
            return true;
        } catch (...) {
            return false;
        }
    }

    ByteArray prove_wrapper(const uint8_t* challenge_hash, size_t challenge_size, const uint8_t* x_s, size_t x_s_size, size_t discriminant_size_bits, uint64_t num_iterations) {
        try {
            std::vector<uint8_t> challenge_hash_bytes(challenge_hash, challenge_hash + challenge_size);
            integer discriminant = CreateDiscriminant(challenge_hash_bytes, discriminant_size_bits);
            form x = DeserializeForm(discriminant, x_s, x_s_size);
            std::vector<uint8_t> result = ProveSlow(discriminant, x, num_iterations, "");

            // Allocate memory for the result and copy data
            uint8_t* resultData = new uint8_t[result.size()];
            std::copy(result.begin(), result.end(), resultData);

            return ByteArray  { resultData, result.size() };
        } catch (...) {
            return ByteArray { nullptr, 0 };
        }
    }

    bool verify_n_wesolowski_wrapper(const uint8_t* discriminant_bytes, size_t discriminant_size, const uint8_t* x_s, const uint8_t* proof_blob, size_t proof_blob_size, uint64_t num_iterations, uint64_t recursion) {
        try {
            integer discriminant;
            mpz_import(discriminant.impl, discriminant_size, 1, 1, 0, 0, discriminant_bytes);
            
            return CheckProofOfTimeNWesolowski(
                -discriminant,
                x_s,
                proof_blob,
                proof_blob_size,
                num_iterations,
                discriminant_size * 8,
                recursion
            );
        } catch (...) {
            return false;
        }
    }

    void delete_byte_array(ByteArray array) {
        delete[] array.data;
    }
}