chia-pos2 0.5.0

A library for creating plots, validating proofs of space, farming partial proofs and solving proofs. Using Chia proof of space v2
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

#pragma once

#include <cstddef>
#include <cstdint>

#include "FeistelCipher.hpp"
#include "ProofParams.hpp"

// A “proof fragment” is 2k bits of the chiphertext
using ProofFragment = uint64_t;

// ProofFragment provides methods for encrypting/decrypting an x-value block and
// extracting partition bits from the resulting encrypted value.
class ProofFragmentCodec {
public:
    // Constructor: uses the provided ProofParams.
    ProofFragmentCodec(ProofParams const& proof_params)
        : params_(proof_params)
        , cipher_(proof_params.get_plot_id_bytes(), proof_params.get_k())
    {
    }

    // Does not validate the proof, just converts it to a QualityString, which is the chain of
    // ProofFragments
    std::array<ProofFragment, NUM_CHAIN_LINKS> fullProofXValuesToQualityString(
        std::span<uint32_t const, TOTAL_XS_IN_PROOF> const full_proof) const
    {
        assert(full_proof.size() == 8 * NUM_CHAIN_LINKS);
        std::array<ProofFragment, NUM_CHAIN_LINKS> quality_string;
        size_t num_proof_fragments = full_proof.size() / 8;
        for (size_t i = 0; i < num_proof_fragments; ++i) {
            // extract the 8 x-values from the proof
            uint32_t x_values[8];
            for (size_t j = 0; j < 8; ++j) {
                x_values[j] = full_proof[i * 8 + j];
            }
            ProofFragment proof_fragment = encode(x_values);
            quality_string[i] = proof_fragment;
        }
        return quality_string;
    }

    // Encrypt: Input is a 2*k‑bit integer containing bit-dropped x1/3/5/7
    // values (in the format [x1 (k/2 bits)][x3 (k/2 bits)][x5 (k/2 bits)][x7 (k/2 bits)]).
    // Returns the encryption result as a uint64_t.
    uint64_t encode(uint64_t all_x_bits) const { return cipher_.encrypt(all_x_bits); }

    ProofFragment encode(uint32_t const x_values[8]) const
    {
        // Combine the upper halves of x1, x3, x5, and x7 into a single 2*k bit value.
        uint32_t x1 = x_values[0] >> (params_.get_k() / 2);
        uint32_t x3 = x_values[2] >> (params_.get_k() / 2);
        uint32_t x5 = x_values[4] >> (params_.get_k() / 2);
        uint32_t x7 = x_values[6] >> (params_.get_k() / 2);
        uint64_t all_x_bits = 0;
        all_x_bits |= (static_cast<uint64_t>(x1) << (params_.get_k() * 3 / 2));
        all_x_bits |= (static_cast<uint64_t>(x3) << (params_.get_k() * 2 / 2));
        all_x_bits |= (static_cast<uint64_t>(x5) << (params_.get_k() * 1 / 2));
        all_x_bits |= (static_cast<uint64_t>(x7) << (params_.get_k() * 0 / 2));
        return cipher_.encrypt(all_x_bits);
    }

    // Decrypt: Given a ciphertext (2*k bits) returns the decrypted value as a uint64_t.
    uint64_t decode(uint64_t ciphertext) const { return cipher_.decrypt(ciphertext); }

    // checks that the decoded x-values match the provided x_values.
    // x_values is an array of 8 uint32_t values (each representing a k-bit number).
    // It compares the upper halves (k/2 bits) of x_values[0], [2], [4], and [6] with those
    // recovered from the decrypted ciphertext.
    bool validate_proof_fragment(ProofFragment proof_fragment, uint32_t const x_values[8]) const
    {
        size_t half_k
            = params_.get_k() / 2; // Each x-value is k bits, so its high half is k/2 bits.
        uint32_t x1 = x_values[0] >> half_k;
        uint32_t x3 = x_values[2] >> half_k;
        uint32_t x5 = x_values[4] >> half_k;
        uint32_t x7 = x_values[6] >> half_k;

        uint64_t decrypted_xs = cipher_.decrypt(proof_fragment);
        uint32_t decrypted_x1
            = static_cast<uint32_t>((decrypted_xs >> (half_k * 3)) & ((uint64_t(1) << half_k) - 1));
        uint32_t decrypted_x3
            = static_cast<uint32_t>((decrypted_xs >> (half_k * 2)) & ((uint64_t(1) << half_k) - 1));
        uint32_t decrypted_x5
            = static_cast<uint32_t>((decrypted_xs >> (half_k * 1)) & ((uint64_t(1) << half_k) - 1));
        uint32_t decrypted_x7 = static_cast<uint32_t>(decrypted_xs & ((uint64_t(1) << half_k) - 1));

        if (x1 != decrypted_x1 || x3 != decrypted_x3 || x5 != decrypted_x5 || x7 != decrypted_x7) {
            // If desired, one can add logging here.
            return false;
        }
        return true;
    }

    std::array<uint32_t, 4> get_x_bits_from_proof_fragment(ProofFragment proof_fragment) const
    {
        uint64_t decrypted_xs = cipher_.decrypt(proof_fragment);
        size_t half_k = params_.get_k() / 2;
        uint32_t x1
            = static_cast<uint32_t>((decrypted_xs >> (half_k * 3)) & ((uint64_t(1) << half_k) - 1));
        uint32_t x3
            = static_cast<uint32_t>((decrypted_xs >> (half_k * 2)) & ((uint64_t(1) << half_k) - 1));
        uint32_t x5
            = static_cast<uint32_t>((decrypted_xs >> (half_k * 1)) & ((uint64_t(1) << half_k) - 1));
        uint32_t x7 = static_cast<uint32_t>(decrypted_xs & ((uint64_t(1) << half_k) - 1));
        return { x1, x3, x5, x7 };
    }

private:
    ProofParams params_;
    FeistelCipher cipher_;
};