chia-pos2 0.4.2

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

#pragma once

#include "pos/ProofCore.hpp"
#include <array>
#include <vector>

// plot structure with absolute indexed back pointers into t3 (i.e. the actual fragment_index_l/r
// values into t3)
struct PlotData {
    std::vector<ProofFragment> t3_proof_fragments;
#ifdef RETAIN_X_VALUES_TO_T3
    std::vector<std::array<uint32_t, 8>> xs_correlating_to_proof_fragments;
#endif

    bool operator==(PlotData const& other) const = default;
};

struct ChunkedProofFragments {
    std::vector<std::vector<ProofFragment>> proof_fragments_chunks;

    static PlotData convertToPlotData(ChunkedProofFragments const& chunked_data)
    {
        PlotData plot_data;
        plot_data.t3_proof_fragments.clear();

        for (auto const& chunk: chunked_data.proof_fragments_chunks) {
            plot_data.t3_proof_fragments.insert(
                plot_data.t3_proof_fragments.end(), chunk.begin(), chunk.end());
        }

        return plot_data;
    }

    // Static factory: computes num_spans automatically from data + scan_span.
    static ChunkedProofFragments convertToChunkedProofFragments(
        PlotData const& plot_data, uint64_t range_per_chunk)
    {
        if (range_per_chunk == 0) {
            throw std::invalid_argument("range_per_chunk must be > 0");
        }

        ChunkedProofFragments chunked_data;

        if (plot_data.t3_proof_fragments.empty()) {
            // nothing to do
            return chunked_data;
        }

        // Because t3_proof_fragments are sorted, we can just look at the last one
        uint64_t max_value = plot_data.t3_proof_fragments.back();
        uint64_t num_spans = max_value / range_per_chunk + 1;

        chunked_data.proof_fragments_chunks.resize(static_cast<std::size_t>(num_spans));

        std::size_t current_span = 0;
        uint64_t current_span_end = range_per_chunk;

        for (ProofFragment const& fragment: plot_data.t3_proof_fragments) {

            // advance span until fragment fits in [current_span * scan_span, current_span_end)
            while (fragment >= current_span_end) {
                ++current_span;
                current_span_end += range_per_chunk;

                // safety: this should never trigger if num_spans was computed correctly
                assert(current_span < num_spans);
            }

            chunked_data.proof_fragments_chunks[current_span].push_back(fragment);
        }

        return chunked_data;
    }

    bool operator==(ChunkedProofFragments const& other) const = default;
};