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
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
// Copyright (c) 2013-2021 The Bitcoin Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include <core_io.h>
#include <consensus/tx_check.h>
#include <consensus/validation.h>
#include <hash.h>
#include <script/interpreter.h>
#include <serialize.h>
#include <streams.h>
#include <test/data/ctvhash.json.h>
#include <test/util/json.h>
#include <test/util/setup_common.h>
#include <util/strencodings.h>
#include <common/system.h>
#include <random.h>
#include <boost/test/unit_test.hpp>
#include <univalue.h>
BOOST_FIXTURE_TEST_SUITE(ctvhash_tests, BasicTestingSetup)
// Goal: check that CTV Hash Functions generate correct hash
BOOST_AUTO_TEST_CASE(ctvhash_from_data)
{
UniValue tests = read_json(std::string(json_tests::ctvhash));
for (unsigned int idx = 0; idx < tests.size(); idx++) {
const UniValue& test = tests[idx];
std::string strTest = test.write();
// comment
if (test.isStr())
continue;
else if (test.isObject()) {
std::vector<uint256> hash;
std::vector<uint32_t> spend_index;
try {
auto& hash_arr = test["result"].get_array();
for (size_t i = 0; i < hash_arr.size(); ++i) {
auto test_hash = uint256::FromHex(hash_arr[i].get_str());
if (!test_hash) {
BOOST_ERROR("Bad test: invalid hex string: " << strTest);
continue;
}
hash.push_back(*test_hash);
// reverse because python's sha256().digest().hex() is backwards
std::reverse(hash.back().begin(), hash.back().end());
}
} catch (...) {
BOOST_ERROR("Bad test: Results could not be deserialized: " << strTest);
break;
}
try {
auto& spend_index_arr = test["spend_index"].get_array();
for (size_t i = 0; i < spend_index_arr.size(); ++i) {
spend_index.emplace_back(spend_index_arr[i].getInt<uint32_t>());
}
} catch (...) {
BOOST_ERROR("Bad test: spend_index could not be deserialized: " << strTest);
break;
}
if (spend_index.size() != hash.size()) {
BOOST_ERROR("Bad test: Spend Indexes not same length as Result Hashes: " << strTest);
break;
}
CMutableTransaction tx;
try {
// deserialize test data
BOOST_CHECK(DecodeHexTx(tx, test["hex_tx"].get_str()));
} catch (...) {
BOOST_ERROR("Bad test, couldn't deserialize hex_tx: " << strTest);
continue;
}
const PrecomputedTransactionData data{tx};
for (size_t i = 0; i < hash.size(); ++i) {
uint256 sh = GetDefaultCheckTemplateVerifyHash(tx, data.m_outputs_single_hash, data.m_sequences_single_hash, spend_index[i]);
if (sh != hash[i]) {
BOOST_ERROR("Expected: " << sh << " Got: " << hash[i] << " For:\n"
<< strTest);
}
}
// Change all of the outpoints and there should be no difference.
FastRandomContext fr;
for (auto i = 0; i < 200; ++i) {
CMutableTransaction txc = tx;
bool hash_will_change = false;
// do n mutations, 50% of being 1, 50% chance of being 2-11
const uint64_t n_mutations = fr.randbool()? (fr.randrange(10)+2) : 1;
for (uint64_t j = 0; j < n_mutations; ++j) {
// on the first 50 passes, modify in ways that will not change hash
const int mutate_field = i < 50 ? fr.randrange(2) : fr.randrange(10);
switch (mutate_field) {
case 0: {
if (tx.vin.size() > 0) {
// no need to rejection sample on 256 bits
const auto which = fr.randrange(tx.vin.size());
tx.vin[which].prevout = {Txid::FromUint256(fr.rand256()), fr.rand32()};
}
break;
}
case 1: {
if (tx.vin.size() > 0) {
const auto which = fr.randrange(tx.vin.size());
tx.vin[which].scriptWitness.stack.push_back(fr.randbytes(500));
}
break;
}
case 2: {
// Mutate a scriptSig
txc.vin[0].scriptSig.push_back('x');
hash_will_change = true;
break;
}
case 3: {
// Mutate a sequence
do {
txc.vin.back().nSequence = fr.rand32();
} while (txc.vin.back().nSequence == tx.vin.back().nSequence);
hash_will_change = true;
break;
}
case 4: {
// Mutate version
do {
txc.version = fr.rand<int32_t>();
} while (txc.version == tx.version);
hash_will_change = true;
break;
}
case 5: {
if (tx.vin.size() > 0) {
// Mutate output amount
const auto which = fr.randrange(tx.vout.size());
txc.vout[which].nValue += 1;
hash_will_change = true;
}
break;
}
case 6: {
if (tx.vin.size() > 0) {
// Mutate output script
const auto which = fr.randrange(tx.vout.size());
txc.vout[which].scriptPubKey.push_back('x');
hash_will_change = true;
}
break;
}
case 7: {
// Mutate nLockTime
do {
txc.nLockTime = fr.rand32();
} while (txc.nLockTime == tx.nLockTime);
hash_will_change = true;
break;
}
case 8: {
// don't add and remove for a mutation otherwise it may end up valid
break;
}
case 9: {
// don't add and remove for a mutation otherwise it may end up valid
break;
}
default:
assert(0);
}
}
const PrecomputedTransactionData data_txc{txc};
// iterate twice, one time with the correct spend indexes, one time with incorrect.
for (auto use_random_index = 0; use_random_index < 2; ++use_random_index) {
hash_will_change |= use_random_index != 0;
for (size_t i = 0; i < hash.size(); ++i) {
uint32_t index{spend_index[i]};
while (use_random_index && index == spend_index[i]) {
index = fr.rand32();
}
uint256 sh = GetDefaultCheckTemplateVerifyHash(txc, data_txc.m_outputs_single_hash, data_txc.m_sequences_single_hash, index);
const bool hash_equals = sh == hash[i];
if (hash_will_change && hash_equals) {
BOOST_ERROR("Expected: NOT " << hash[i] << " Got: " << sh << " For:\n"
<< strTest);
} else if (!hash_will_change && !hash_equals) {
BOOST_ERROR("Expected: " << hash[i] << " Got: " << sh << " For:\n"
<< strTest);
}
}
}
}
} else {
BOOST_ERROR("Bad test: " << strTest);
continue;
}
}
}
BOOST_AUTO_TEST_SUITE_END()