chia-pos2 0.6.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

#pragma once
#include "common/Timer.hpp"
#include <iomanip>
#include <iostream>
#include <string>

struct ProofSolverTimings {
    double allocating = 0;
    double hashing_x1s = 0;
    double sorting_x1s = 0;
    double bitmaskfillzero = 0;
    double bitmasksetx1s = 0;
    double chachafilterx2sbybitmask = 0;
    double sorting_filtered_x2s = 0;
    double match_x1_x2_sorted_lists = 0;
    double t2_matches = 0;
    double t2_gen_L_list = 0;
    double t2_sort_short_list = 0;
    double t2_scan_for_matches = 0;
    double misc = 0;

    void printSummary() const
    {
        constexpr int LABEL_W = 25;
        constexpr int VALUE_W = 8;
        std::string const sep(LABEL_W + VALUE_W + 5, '-');

        auto& os = std::cout;
        // reset fill-char to space, set fixed + two decimals
        os << std::setfill(' ') << std::fixed << std::setprecision(2);

        os << sep << "\n";
        os << std::left << std::setw(LABEL_W) << "Allocating" << ": " << std::right
           << std::setw(VALUE_W) << allocating << " ms\n";
        os << std::left << std::setw(LABEL_W) << "Hashing x1's" << ": " << std::right
           << std::setw(VALUE_W) << hashing_x1s << " ms\n";
        os << std::left << std::setw(LABEL_W) << "Sorting x1's" << ": " << std::right
           << std::setw(VALUE_W) << sorting_x1s << " ms\n";
        os << std::left << std::setw(LABEL_W) << "Bitmask fill zero" << ": " << std::right
           << std::setw(VALUE_W) << bitmaskfillzero << " ms\n";
        os << std::left << std::setw(LABEL_W) << "Bitmask set x1's" << ": " << std::right
           << std::setw(VALUE_W) << bitmasksetx1s << " ms\n";
        os << std::left << std::setw(LABEL_W) << "Chacha filter x2's" << ": " << std::right
           << std::setw(VALUE_W) << chachafilterx2sbybitmask << " ms\n";
        os << std::left << std::setw(LABEL_W) << "Sorting filtered x2's" << ": " << std::right
           << std::setw(VALUE_W) << sorting_filtered_x2s << " ms\n";
        os << std::left << std::setw(LABEL_W) << "Match x1 x2 sorted" << ": " << std::right
           << std::setw(VALUE_W) << match_x1_x2_sorted_lists << " ms\n";
        os << std::left << std::setw(LABEL_W) << "T2 matches" << ": " << std::right
           << std::setw(VALUE_W) << t2_matches << " ms\n";
        os << std::left << std::setw(LABEL_W) << " - T2 gen L list" << ": " << std::right
           << std::setw(VALUE_W) << t2_gen_L_list << " ms\n";
        os << std::left << std::setw(LABEL_W) << " - T2 sort short list" << ": " << std::right
           << std::setw(VALUE_W) << t2_sort_short_list << " ms\n";
        os << std::left << std::setw(LABEL_W) << " - T2 scan for matches" << ": " << std::right
           << std::setw(VALUE_W) << t2_scan_for_matches << " ms\n";
        os << std::left << std::setw(LABEL_W) << "Misc" << ": " << std::right << std::setw(VALUE_W)
           << misc << " ms\n";

        double nonAllocTotal = hashing_x1s + sorting_x1s + bitmaskfillzero + bitmasksetx1s
            + chachafilterx2sbybitmask + sorting_filtered_x2s + match_x1_x2_sorted_lists
            + t2_matches + misc;

        os << sep << "\n";
        os << std::left << std::setw(LABEL_W) << "Non-allocating total" << ": " << std::right
           << std::setw(VALUE_W) << nonAllocTotal << " ms\n";
        os << sep << "\n";
    }
};