Line data Source code
1 : // Copyright (c) 2011-2022 The Bitcoin Core developers
2 : // Distributed under the MIT software license, see the accompanying
3 : // file COPYING or http://www.opensource.org/licenses/mit-license.php.
4 :
5 : #include <test/util/setup_common.h>
6 :
7 : #include <kernel/validation_cache_sizes.h>
8 :
9 : #include <addrman.h>
10 : #include <banman.h>
11 : #include <chainparams.h>
12 : #include <common/system.h>
13 : #include <common/url.h>
14 : #include <consensus/consensus.h>
15 : #include <consensus/params.h>
16 : #include <consensus/validation.h>
17 2 : #include <crypto/sha256.h>
18 2 : #include <init.h>
19 : #include <init/common.h>
20 : #include <interfaces/chain.h>
21 : #include <kernel/mempool_entry.h>
22 : #include <logging.h>
23 : #include <net.h>
24 : #include <net_processing.h>
25 : #include <node/blockstorage.h>
26 : #include <node/chainstate.h>
27 2 : #include <node/context.h>
28 : #include <node/kernel_notifications.h>
29 : #include <node/mempool_args.h>
30 : #include <node/miner.h>
31 : #include <node/peerman_args.h>
32 : #include <node/validation_cache_args.h>
33 : #include <noui.h>
34 : #include <policy/fees.h>
35 : #include <policy/fees_args.h>
36 : #include <pow.h>
37 : #include <random.h>
38 : #include <rpc/blockchain.h>
39 1 : #include <rpc/register.h>
40 : #include <rpc/server.h>
41 1 : #include <scheduler.h>
42 : #include <script/sigcache.h>
43 1 : #include <shutdown.h>
44 1 : #include <streams.h>
45 1 : #include <test/util/net.h>
46 2 : #include <test/util/random.h>
47 : #include <test/util/txmempool.h>
48 : #include <timedata.h>
49 : #include <txdb.h>
50 : #include <txmempool.h>
51 : #include <util/chaintype.h>
52 : #include <util/strencodings.h>
53 : #include <util/string.h>
54 : #include <util/thread.h>
55 : #include <util/threadnames.h>
56 : #include <util/time.h>
57 : #include <util/translation.h>
58 : #include <util/vector.h>
59 : #include <validation.h>
60 : #include <validationinterface.h>
61 : #include <walletinitinterface.h>
62 :
63 : #include <algorithm>
64 1 : #include <functional>
65 1 : #include <stdexcept>
66 1 :
67 : using kernel::BlockTreeDB;
68 : using kernel::ValidationCacheSizes;
69 : using node::ApplyArgsManOptions;
70 : using node::BlockAssembler;
71 : using node::BlockManager;
72 : using node::CalculateCacheSizes;
73 : using node::KernelNotifications;
74 2 : using node::LoadChainstate;
75 : using node::RegenerateCommitments;
76 : using node::VerifyLoadedChainstate;
77 :
78 2 : const std::function<std::string(const char*)> G_TRANSLATION_FUN = nullptr;
79 : UrlDecodeFn* const URL_DECODE = nullptr;
80 :
81 : /** Random context to get unique temp data dirs. Separate from g_insecure_rand_ctx, which can be seeded from a const env var */
82 2 : static FastRandomContext g_insecure_rand_ctx_temp_path;
83 2 :
84 0 : std::ostream& operator<<(std::ostream& os, const uint256& num)
85 : {
86 0 : os << num.ToString();
87 0 : return os;
88 0 : }
89 :
90 1 : BasicTestingSetup::BasicTestingSetup(const ChainType chainType, const std::vector<const char*>& extra_args)
91 1 : : m_path_root{fs::temp_directory_path() / "test_common_" PACKAGE_NAME / g_insecure_rand_ctx_temp_path.rand256().ToString()},
92 1 : m_args{}
93 : {
94 1 : m_node.args = &gArgs;
95 1 : std::vector<const char*> arguments = Cat(
96 1 : {
97 : "dummy",
98 : "-printtoconsole=0",
99 : "-logsourcelocations",
100 : "-logtimemicros",
101 : "-logthreadnames",
102 : "-loglevel=trace",
103 : "-debug",
104 : "-debugexclude=libevent",
105 : "-debugexclude=leveldb",
106 : },
107 1 : extra_args);
108 1 : if (G_TEST_COMMAND_LINE_ARGUMENTS) {
109 1 : arguments = Cat(arguments, G_TEST_COMMAND_LINE_ARGUMENTS());
110 1 : }
111 1 : util::ThreadRename("test");
112 1 : fs::create_directories(m_path_root);
113 1 : m_args.ForceSetArg("-datadir", fs::PathToString(m_path_root));
114 1 : gArgs.ForceSetArg("-datadir", fs::PathToString(m_path_root));
115 1 : gArgs.ClearPathCache();
116 : {
117 1 : SetupServerArgs(*m_node.args);
118 1 : std::string error;
119 1 : if (!m_node.args->ParseParameters(arguments.size(), arguments.data(), error)) {
120 0 : m_node.args->ClearArgs();
121 0 : throw std::runtime_error{error};
122 : }
123 1 : }
124 1 : SelectParams(chainType);
125 1 : SeedInsecureRand();
126 1 : if (G_TEST_LOG_FUN) LogInstance().PushBackCallback(G_TEST_LOG_FUN);
127 1 : InitLogging(*m_node.args);
128 1 : AppInitParameterInteraction(*m_node.args);
129 1 : LogInstance().StartLogging();
130 1 : m_node.kernel = std::make_unique<kernel::Context>();
131 1 : SetupEnvironment();
132 1 : SetupNetworking();
133 :
134 1 : ValidationCacheSizes validation_cache_sizes{};
135 1 : ApplyArgsManOptions(*m_node.args, validation_cache_sizes);
136 1 : Assert(InitSignatureCache(validation_cache_sizes.signature_cache_bytes));
137 1 : Assert(InitScriptExecutionCache(validation_cache_sizes.script_execution_cache_bytes));
138 :
139 1 : m_node.chain = interfaces::MakeChain(m_node);
140 : static bool noui_connected = false;
141 1 : if (!noui_connected) {
142 1 : noui_connect();
143 1 : noui_connected = true;
144 1 : }
145 1 : }
146 :
147 1 : BasicTestingSetup::~BasicTestingSetup()
148 : {
149 1 : SetMockTime(0s); // Reset mocktime for following tests
150 1 : LogInstance().DisconnectTestLogger();
151 1 : fs::remove_all(m_path_root);
152 1 : gArgs.ClearArgs();
153 1 : }
154 :
155 1 : ChainTestingSetup::ChainTestingSetup(const ChainType chainType, const std::vector<const char*>& extra_args)
156 1 : : BasicTestingSetup(chainType, extra_args)
157 : {
158 1 : const CChainParams& chainparams = Params();
159 :
160 : // We have to run a scheduler thread to prevent ActivateBestChain
161 : // from blocking due to queue overrun.
162 1 : m_node.scheduler = std::make_unique<CScheduler>();
163 2 : m_node.scheduler->m_service_thread = std::thread(util::TraceThread, "scheduler", [&] { m_node.scheduler->serviceQueue(); });
164 1 : GetMainSignals().RegisterBackgroundSignalScheduler(*m_node.scheduler);
165 :
166 1 : m_node.fee_estimator = std::make_unique<CBlockPolicyEstimator>(FeeestPath(*m_node.args), DEFAULT_ACCEPT_STALE_FEE_ESTIMATES);
167 1 : m_node.mempool = std::make_unique<CTxMemPool>(MemPoolOptionsForTest(m_node));
168 :
169 1 : m_cache_sizes = CalculateCacheSizes(m_args);
170 :
171 1 : m_node.notifications = std::make_unique<KernelNotifications>(m_node.exit_status);
172 :
173 3 : const ChainstateManager::Options chainman_opts{
174 1 : .chainparams = chainparams,
175 1 : .datadir = m_args.GetDataDirNet(),
176 1 : .adjusted_time_callback = GetAdjustedTime,
177 1 : .check_block_index = true,
178 1 : .notifications = *m_node.notifications,
179 : };
180 4 : const BlockManager::Options blockman_opts{
181 1 : .chainparams = chainman_opts.chainparams,
182 1 : .blocks_dir = m_args.GetBlocksDirPath(),
183 1 : .notifications = chainman_opts.notifications,
184 : };
185 1 : m_node.chainman = std::make_unique<ChainstateManager>(m_node.kernel->interrupt, chainman_opts, blockman_opts);
186 4 : m_node.chainman->m_blockman.m_block_tree_db = std::make_unique<BlockTreeDB>(DBParams{
187 1 : .path = m_args.GetDataDirNet() / "blocks" / "index",
188 1 : .cache_bytes = static_cast<size_t>(m_cache_sizes.block_tree_db),
189 : .memory_only = true});
190 :
191 1 : constexpr int script_check_threads = 2;
192 1 : StartScriptCheckWorkerThreads(script_check_threads);
193 1 : }
194 :
195 1 : ChainTestingSetup::~ChainTestingSetup()
196 : {
197 1 : if (m_node.scheduler) m_node.scheduler->stop();
198 1 : StopScriptCheckWorkerThreads();
199 1 : GetMainSignals().FlushBackgroundCallbacks();
200 1 : GetMainSignals().UnregisterBackgroundSignalScheduler();
201 1 : m_node.connman.reset();
202 1 : m_node.banman.reset();
203 1 : m_node.addrman.reset();
204 1 : m_node.netgroupman.reset();
205 1 : m_node.args = nullptr;
206 1 : m_node.mempool.reset();
207 1 : m_node.scheduler.reset();
208 1 : m_node.chainman.reset();
209 1 : }
210 :
211 1 : void ChainTestingSetup::LoadVerifyActivateChainstate()
212 : {
213 1 : auto& chainman{*Assert(m_node.chainman)};
214 1 : node::ChainstateLoadOptions options;
215 1 : options.mempool = Assert(m_node.mempool.get());
216 1 : options.block_tree_db_in_memory = m_block_tree_db_in_memory;
217 1 : options.coins_db_in_memory = m_coins_db_in_memory;
218 1 : options.reindex = node::fReindex;
219 1 : options.reindex_chainstate = m_args.GetBoolArg("-reindex-chainstate", false);
220 1 : options.prune = chainman.m_blockman.IsPruneMode();
221 1 : options.check_blocks = m_args.GetIntArg("-checkblocks", DEFAULT_CHECKBLOCKS);
222 1 : options.check_level = m_args.GetIntArg("-checklevel", DEFAULT_CHECKLEVEL);
223 1 : options.require_full_verification = m_args.IsArgSet("-checkblocks") || m_args.IsArgSet("-checklevel");
224 3 : auto [status, error] = LoadChainstate(chainman, m_cache_sizes, options);
225 1 : assert(status == node::ChainstateLoadStatus::SUCCESS);
226 :
227 1 : std::tie(status, error) = VerifyLoadedChainstate(chainman, options);
228 1 : assert(status == node::ChainstateLoadStatus::SUCCESS);
229 :
230 1 : BlockValidationState state;
231 1 : if (!chainman.ActiveChainstate().ActivateBestChain(state)) {
232 0 : throw std::runtime_error(strprintf("ActivateBestChain failed. (%s)", state.ToString()));
233 : }
234 1 : }
235 :
236 1 : TestingSetup::TestingSetup(
237 : const ChainType chainType,
238 : const std::vector<const char*>& extra_args,
239 : const bool coins_db_in_memory,
240 : const bool block_tree_db_in_memory)
241 1 : : ChainTestingSetup(chainType, extra_args)
242 : {
243 1 : m_coins_db_in_memory = coins_db_in_memory;
244 1 : m_block_tree_db_in_memory = block_tree_db_in_memory;
245 : // Ideally we'd move all the RPC tests to the functional testing framework
246 : // instead of unit tests, but for now we need these here.
247 1 : RegisterAllCoreRPCCommands(tableRPC);
248 :
249 1 : LoadVerifyActivateChainstate();
250 :
251 1 : m_node.netgroupman = std::make_unique<NetGroupManager>(/*asmap=*/std::vector<bool>());
252 2 : m_node.addrman = std::make_unique<AddrMan>(*m_node.netgroupman,
253 1 : /*deterministic=*/false,
254 1 : m_node.args->GetIntArg("-checkaddrman", 0));
255 1 : m_node.banman = std::make_unique<BanMan>(m_args.GetDataDirBase() / "banlist", nullptr, DEFAULT_MISBEHAVING_BANTIME);
256 1 : m_node.connman = std::make_unique<ConnmanTestMsg>(0x1337, 0x1337, *m_node.addrman, *m_node.netgroupman, Params()); // Deterministic randomness for tests.
257 1 : PeerManager::Options peerman_opts;
258 1 : ApplyArgsManOptions(*m_node.args, peerman_opts);
259 2 : m_node.peerman = PeerManager::make(*m_node.connman, *m_node.addrman,
260 1 : m_node.banman.get(), *m_node.chainman,
261 1 : *m_node.mempool, peerman_opts);
262 :
263 : {
264 1 : CConnman::Options options;
265 1 : options.m_msgproc = m_node.peerman.get();
266 1 : m_node.connman->Init(options);
267 1 : }
268 1 : }
269 :
270 0 : TestChain100Setup::TestChain100Setup(
271 : const ChainType chain_type,
272 : const std::vector<const char*>& extra_args,
273 : const bool coins_db_in_memory,
274 : const bool block_tree_db_in_memory)
275 0 : : TestingSetup{ChainType::REGTEST, extra_args, coins_db_in_memory, block_tree_db_in_memory}
276 : {
277 0 : SetMockTime(1598887952);
278 0 : constexpr std::array<unsigned char, 32> vchKey = {
279 : {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1}};
280 0 : coinbaseKey.Set(vchKey.begin(), vchKey.end(), true);
281 :
282 : // Generate a 100-block chain:
283 0 : this->mineBlocks(COINBASE_MATURITY);
284 :
285 : {
286 0 : LOCK(::cs_main);
287 0 : assert(
288 : m_node.chainman->ActiveChain().Tip()->GetBlockHash().ToString() ==
289 : "571d80a9967ae599cec0448b0b0ba1cfb606f584d8069bd7166b86854ba7a191");
290 0 : }
291 0 : }
292 :
293 0 : void TestChain100Setup::mineBlocks(int num_blocks)
294 : {
295 0 : CScript scriptPubKey = CScript() << ToByteVector(coinbaseKey.GetPubKey()) << OP_CHECKSIG;
296 0 : for (int i = 0; i < num_blocks; i++) {
297 0 : std::vector<CMutableTransaction> noTxns;
298 0 : CBlock b = CreateAndProcessBlock(noTxns, scriptPubKey);
299 0 : SetMockTime(GetTime() + 1);
300 0 : m_coinbase_txns.push_back(b.vtx[0]);
301 0 : }
302 0 : }
303 :
304 0 : CBlock TestChain100Setup::CreateBlock(
305 : const std::vector<CMutableTransaction>& txns,
306 : const CScript& scriptPubKey,
307 : Chainstate& chainstate)
308 : {
309 0 : CBlock block = BlockAssembler{chainstate, nullptr}.CreateNewBlock(scriptPubKey)->block;
310 :
311 0 : Assert(block.vtx.size() == 1);
312 0 : for (const CMutableTransaction& tx : txns) {
313 0 : block.vtx.push_back(MakeTransactionRef(tx));
314 : }
315 0 : RegenerateCommitments(block, *Assert(m_node.chainman));
316 :
317 0 : while (!CheckProofOfWork(block.GetHash(), block.nBits, m_node.chainman->GetConsensus())) ++block.nNonce;
318 :
319 0 : return block;
320 0 : }
321 :
322 0 : CBlock TestChain100Setup::CreateAndProcessBlock(
323 : const std::vector<CMutableTransaction>& txns,
324 : const CScript& scriptPubKey,
325 : Chainstate* chainstate)
326 : {
327 0 : if (!chainstate) {
328 0 : chainstate = &Assert(m_node.chainman)->ActiveChainstate();
329 0 : }
330 :
331 0 : CBlock block = this->CreateBlock(txns, scriptPubKey, *chainstate);
332 0 : std::shared_ptr<const CBlock> shared_pblock = std::make_shared<const CBlock>(block);
333 0 : Assert(m_node.chainman)->ProcessNewBlock(shared_pblock, true, true, nullptr);
334 :
335 0 : return block;
336 0 : }
337 :
338 :
339 0 : CMutableTransaction TestChain100Setup::CreateValidMempoolTransaction(CTransactionRef input_transaction,
340 : int input_vout,
341 : int input_height,
342 : CKey input_signing_key,
343 : CScript output_destination,
344 : CAmount output_amount,
345 : bool submit)
346 : {
347 : // Transaction we will submit to the mempool
348 0 : CMutableTransaction mempool_txn;
349 :
350 : // Create an input
351 0 : COutPoint outpoint_to_spend(input_transaction->GetHash(), input_vout);
352 0 : CTxIn input(outpoint_to_spend);
353 0 : mempool_txn.vin.push_back(input);
354 :
355 : // Create an output
356 0 : CTxOut output(output_amount, output_destination);
357 0 : mempool_txn.vout.push_back(output);
358 :
359 : // Sign the transaction
360 : // - Add the signing key to a keystore
361 0 : FillableSigningProvider keystore;
362 0 : keystore.AddKey(input_signing_key);
363 : // - Populate a CoinsViewCache with the unspent output
364 0 : CCoinsView coins_view;
365 0 : CCoinsViewCache coins_cache(&coins_view);
366 0 : AddCoins(coins_cache, *input_transaction.get(), input_height);
367 : // - Use GetCoin to properly populate utxo_to_spend,
368 0 : Coin utxo_to_spend;
369 0 : assert(coins_cache.GetCoin(outpoint_to_spend, utxo_to_spend));
370 : // - Then add it to a map to pass in to SignTransaction
371 0 : std::map<COutPoint, Coin> input_coins;
372 0 : input_coins.insert({outpoint_to_spend, utxo_to_spend});
373 : // - Default signature hashing type
374 0 : int nHashType = SIGHASH_ALL;
375 0 : std::map<int, bilingual_str> input_errors;
376 0 : assert(SignTransaction(mempool_txn, &keystore, input_coins, nHashType, input_errors));
377 :
378 : // If submit=true, add transaction to the mempool.
379 0 : if (submit) {
380 0 : LOCK(cs_main);
381 0 : const MempoolAcceptResult result = m_node.chainman->ProcessTransaction(MakeTransactionRef(mempool_txn));
382 0 : assert(result.m_result_type == MempoolAcceptResult::ResultType::VALID);
383 0 : }
384 :
385 0 : return mempool_txn;
386 0 : }
387 :
388 0 : std::vector<CTransactionRef> TestChain100Setup::PopulateMempool(FastRandomContext& det_rand, size_t num_transactions, bool submit)
389 : {
390 0 : std::vector<CTransactionRef> mempool_transactions;
391 0 : std::deque<std::pair<COutPoint, CAmount>> unspent_prevouts;
392 0 : std::transform(m_coinbase_txns.begin(), m_coinbase_txns.end(), std::back_inserter(unspent_prevouts),
393 0 : [](const auto& tx){ return std::make_pair(COutPoint(tx->GetHash(), 0), tx->vout[0].nValue); });
394 0 : while (num_transactions > 0 && !unspent_prevouts.empty()) {
395 : // The number of inputs and outputs are random, between 1 and 24.
396 0 : CMutableTransaction mtx = CMutableTransaction();
397 0 : const size_t num_inputs = det_rand.randrange(24) + 1;
398 0 : CAmount total_in{0};
399 0 : for (size_t n{0}; n < num_inputs; ++n) {
400 0 : if (unspent_prevouts.empty()) break;
401 0 : const auto& [prevout, amount] = unspent_prevouts.front();
402 0 : mtx.vin.push_back(CTxIn(prevout, CScript()));
403 0 : total_in += amount;
404 0 : unspent_prevouts.pop_front();
405 0 : }
406 0 : const size_t num_outputs = det_rand.randrange(24) + 1;
407 0 : const CAmount fee = 100 * det_rand.randrange(30);
408 0 : const CAmount amount_per_output = (total_in - fee) / num_outputs;
409 0 : for (size_t n{0}; n < num_outputs; ++n) {
410 0 : CScript spk = CScript() << CScriptNum(num_transactions + n);
411 0 : mtx.vout.push_back(CTxOut(amount_per_output, spk));
412 0 : }
413 0 : CTransactionRef ptx = MakeTransactionRef(mtx);
414 0 : mempool_transactions.push_back(ptx);
415 0 : if (amount_per_output > 3000) {
416 : // If the value is high enough to fund another transaction + fees, keep track of it so
417 : // it can be used to build a more complex transaction graph. Insert randomly into
418 : // unspent_prevouts for extra randomness in the resulting structures.
419 0 : for (size_t n{0}; n < num_outputs; ++n) {
420 0 : unspent_prevouts.push_back(std::make_pair(COutPoint(ptx->GetHash(), n), amount_per_output));
421 0 : std::swap(unspent_prevouts.back(), unspent_prevouts[det_rand.randrange(unspent_prevouts.size())]);
422 0 : }
423 0 : }
424 0 : if (submit) {
425 0 : LOCK2(cs_main, m_node.mempool->cs);
426 0 : LockPoints lp;
427 0 : m_node.mempool->addUnchecked(CTxMemPoolEntry(ptx, /*fee=*/(total_in - num_outputs * amount_per_output),
428 : /*time=*/0, /*entry_height=*/1, /*entry_sequence=*/0,
429 0 : /*spends_coinbase=*/false, /*sigops_cost=*/4, lp));
430 0 : }
431 0 : --num_transactions;
432 0 : }
433 0 : return mempool_transactions;
434 0 : }
435 :
436 0 : void TestChain100Setup::MockMempoolMinFee(const CFeeRate& target_feerate)
437 : {
438 0 : LOCK2(cs_main, m_node.mempool->cs);
439 : // Transactions in the mempool will affect the new minimum feerate.
440 0 : assert(m_node.mempool->size() == 0);
441 : // The target feerate cannot be too low...
442 : // ...otherwise the transaction's feerate will need to be negative.
443 0 : assert(target_feerate > m_node.mempool->m_incremental_relay_feerate);
444 : // ...otherwise this is not meaningful. The feerate policy uses the maximum of both feerates.
445 0 : assert(target_feerate > m_node.mempool->m_min_relay_feerate);
446 :
447 : // Manually create an invalid transaction. Manually set the fee in the CTxMemPoolEntry to
448 : // achieve the exact target feerate.
449 0 : CMutableTransaction mtx = CMutableTransaction();
450 0 : mtx.vin.push_back(CTxIn{COutPoint{g_insecure_rand_ctx.rand256(), 0}});
451 0 : mtx.vout.push_back(CTxOut(1 * COIN, GetScriptForDestination(WitnessV0ScriptHash(CScript() << OP_TRUE))));
452 0 : const auto tx{MakeTransactionRef(mtx)};
453 0 : LockPoints lp;
454 : // The new mempool min feerate is equal to the removed package's feerate + incremental feerate.
455 0 : const auto tx_fee = target_feerate.GetFee(GetVirtualTransactionSize(*tx)) -
456 0 : m_node.mempool->m_incremental_relay_feerate.GetFee(GetVirtualTransactionSize(*tx));
457 0 : m_node.mempool->addUnchecked(CTxMemPoolEntry(tx, /*fee=*/tx_fee,
458 : /*time=*/0, /*entry_height=*/1, /*entry_sequence=*/0,
459 0 : /*spends_coinbase=*/true, /*sigops_cost=*/1, lp));
460 0 : m_node.mempool->TrimToSize(0);
461 0 : assert(m_node.mempool->GetMinFee() == target_feerate);
462 0 : }
463 : /**
464 : * @returns a real block (0000000000013b8ab2cd513b0261a14096412195a72a0c4827d229dcc7e0f7af)
465 : * with 9 txs.
466 : */
467 0 : CBlock getBlock13b8a()
468 : {
469 0 : CBlock block;
470 0 : CDataStream stream(ParseHex("0100000090f0a9f110702f808219ebea1173056042a714bad51b916cb6800000000000005275289558f51c9966699404ae2294730c3c9f9bda53523ce50e9b95e558da2fdb261b4d4c86041b1ab1bf930901000000010000000000000000000000000000000000000000000000000000000000000000ffffffff07044c86041b0146ffffffff0100f2052a01000000434104e18f7afbe4721580e81e8414fc8c24d7cfacf254bb5c7b949450c3e997c2dc1242487a8169507b631eb3771f2b425483fb13102c4eb5d858eef260fe70fbfae0ac00000000010000000196608ccbafa16abada902780da4dc35dafd7af05fa0da08cf833575f8cf9e836000000004a493046022100dab24889213caf43ae6adc41cf1c9396c08240c199f5225acf45416330fd7dbd022100fe37900e0644bf574493a07fc5edba06dbc07c311b947520c2d514bc5725dcb401ffffffff0100f2052a010000001976a914f15d1921f52e4007b146dfa60f369ed2fc393ce288ac000000000100000001fb766c1288458c2bafcfec81e48b24d98ec706de6b8af7c4e3c29419bfacb56d000000008c493046022100f268ba165ce0ad2e6d93f089cfcd3785de5c963bb5ea6b8c1b23f1ce3e517b9f022100da7c0f21adc6c401887f2bfd1922f11d76159cbc597fbd756a23dcbb00f4d7290141042b4e8625a96127826915a5b109852636ad0da753c9e1d5606a50480cd0c40f1f8b8d898235e571fe9357d9ec842bc4bba1827daaf4de06d71844d0057707966affffffff0280969800000000001976a9146963907531db72d0ed1a0cfb471ccb63923446f388ac80d6e34c000000001976a914f0688ba1c0d1ce182c7af6741e02658c7d4dfcd388ac000000000100000002c40297f730dd7b5a99567eb8d27b78758f607507c52292d02d4031895b52f2ff010000008b483045022100f7edfd4b0aac404e5bab4fd3889e0c6c41aa8d0e6fa122316f68eddd0a65013902205b09cc8b2d56e1cd1f7f2fafd60a129ed94504c4ac7bdc67b56fe67512658b3e014104732012cb962afa90d31b25d8fb0e32c94e513ab7a17805c14ca4c3423e18b4fb5d0e676841733cb83abaf975845c9f6f2a8097b7d04f4908b18368d6fc2d68ecffffffffca5065ff9617cbcba45eb23726df6498a9b9cafed4f54cbab9d227b0035ddefb000000008a473044022068010362a13c7f9919fa832b2dee4e788f61f6f5d344a7c2a0da6ae740605658022006d1af525b9a14a35c003b78b72bd59738cd676f845d1ff3fc25049e01003614014104732012cb962afa90d31b25d8fb0e32c94e513ab7a17805c14ca4c3423e18b4fb5d0e676841733cb83abaf975845c9f6f2a8097b7d04f4908b18368d6fc2d68ecffffffff01001ec4110200000043410469ab4181eceb28985b9b4e895c13fa5e68d85761b7eee311db5addef76fa8621865134a221bd01f28ec9999ee3e021e60766e9d1f3458c115fb28650605f11c9ac000000000100000001cdaf2f758e91c514655e2dc50633d1e4c84989f8aa90a0dbc883f0d23ed5c2fa010000008b48304502207ab51be6f12a1962ba0aaaf24a20e0b69b27a94fac5adf45aa7d2d18ffd9236102210086ae728b370e5329eead9accd880d0cb070aea0c96255fae6c4f1ddcce1fd56e014104462e76fd4067b3a0aa42070082dcb0bf2f388b6495cf33d789904f07d0f55c40fbd4b82963c69b3dc31895d0c772c812b1d5fbcade15312ef1c0e8ebbb12dcd4ffffffff02404b4c00000000001976a9142b6ba7c9d796b75eef7942fc9288edd37c32f5c388ac002d3101000000001976a9141befba0cdc1ad56529371864d9f6cb042faa06b588ac000000000100000001b4a47603e71b61bc3326efd90111bf02d2f549b067f4c4a8fa183b57a0f800cb010000008a4730440220177c37f9a505c3f1a1f0ce2da777c339bd8339ffa02c7cb41f0a5804f473c9230220585b25a2ee80eb59292e52b987dad92acb0c64eced92ed9ee105ad153cdb12d001410443bd44f683467e549dae7d20d1d79cbdb6df985c6e9c029c8d0c6cb46cc1a4d3cf7923c5021b27f7a0b562ada113bc85d5fda5a1b41e87fe6e8802817cf69996ffffffff0280651406000000001976a9145505614859643ab7b547cd7f1f5e7e2a12322d3788ac00aa0271000000001976a914ea4720a7a52fc166c55ff2298e07baf70ae67e1b88ac00000000010000000586c62cd602d219bb60edb14a3e204de0705176f9022fe49a538054fb14abb49e010000008c493046022100f2bc2aba2534becbdf062eb993853a42bbbc282083d0daf9b4b585bd401aa8c9022100b1d7fd7ee0b95600db8535bbf331b19eed8d961f7a8e54159c53675d5f69df8c014104462e76fd4067b3a0aa42070082dcb0bf2f388b6495cf33d789904f07d0f55c40fbd4b82963c69b3dc31895d0c772c812b1d5fbcade15312ef1c0e8ebbb12dcd4ffffffff03ad0e58ccdac3df9dc28a218bcf6f1997b0a93306faaa4b3a28ae83447b2179010000008b483045022100be12b2937179da88599e27bb31c3525097a07cdb52422d165b3ca2f2020ffcf702200971b51f853a53d644ebae9ec8f3512e442b1bcb6c315a5b491d119d10624c83014104462e76fd4067b3a0aa42070082dcb0bf2f388b6495cf33d789904f07d0f55c40fbd4b82963c69b3dc31895d0c772c812b1d5fbcade15312ef1c0e8ebbb12dcd4ffffffff2acfcab629bbc8685792603762c921580030ba144af553d271716a95089e107b010000008b483045022100fa579a840ac258871365dd48cd7552f96c8eea69bd00d84f05b283a0dab311e102207e3c0ee9234814cfbb1b659b83671618f45abc1326b9edcc77d552a4f2a805c0014104462e76fd4067b3a0aa42070082dcb0bf2f388b6495cf33d789904f07d0f55c40fbd4b82963c69b3dc31895d0c772c812b1d5fbcade15312ef1c0e8ebbb12dcd4ffffffffdcdc6023bbc9944a658ddc588e61eacb737ddf0a3cd24f113b5a8634c517fcd2000000008b4830450221008d6df731df5d32267954bd7d2dda2302b74c6c2a6aa5c0ca64ecbabc1af03c75022010e55c571d65da7701ae2da1956c442df81bbf076cdbac25133f99d98a9ed34c014104462e76fd4067b3a0aa42070082dcb0bf2f388b6495cf33d789904f07d0f55c40fbd4b82963c69b3dc31895d0c772c812b1d5fbcade15312ef1c0e8ebbb12dcd4ffffffffe15557cd5ce258f479dfd6dc6514edf6d7ed5b21fcfa4a038fd69f06b83ac76e010000008b483045022023b3e0ab071eb11de2eb1cc3a67261b866f86bf6867d4558165f7c8c8aca2d86022100dc6e1f53a91de3efe8f63512850811f26284b62f850c70ca73ed5de8771fb451014104462e76fd4067b3a0aa42070082dcb0bf2f388b6495cf33d789904f07d0f55c40fbd4b82963c69b3dc31895d0c772c812b1d5fbcade15312ef1c0e8ebbb12dcd4ffffffff01404b4c00000000001976a9142b6ba7c9d796b75eef7942fc9288edd37c32f5c388ac00000000010000000166d7577163c932b4f9690ca6a80b6e4eb001f0a2fa9023df5595602aae96ed8d000000008a4730440220262b42546302dfb654a229cefc86432b89628ff259dc87edd1154535b16a67e102207b4634c020a97c3e7bbd0d4d19da6aa2269ad9dded4026e896b213d73ca4b63f014104979b82d02226b3a4597523845754d44f13639e3bf2df5e82c6aab2bdc79687368b01b1ab8b19875ae3c90d661a3d0a33161dab29934edeb36aa01976be3baf8affffffff02404b4c00000000001976a9144854e695a02af0aeacb823ccbc272134561e0a1688ac40420f00000000001976a914abee93376d6b37b5c2940655a6fcaf1c8e74237988ac0000000001000000014e3f8ef2e91349a9059cb4f01e54ab2597c1387161d3da89919f7ea6acdbb371010000008c49304602210081f3183471a5ca22307c0800226f3ef9c353069e0773ac76bb580654d56aa523022100d4c56465bdc069060846f4fbf2f6b20520b2a80b08b168b31e66ddb9c694e240014104976c79848e18251612f8940875b2b08d06e6dc73b9840e8860c066b7e87432c477e9a59a453e71e6d76d5fe34058b800a098fc1740ce3012e8fc8a00c96af966ffffffff02c0e1e400000000001976a9144134e75a6fcb6042034aab5e18570cf1f844f54788ac404b4c00000000001976a9142b6ba7c9d796b75eef7942fc9288edd37c32f5c388ac00000000"), SER_NETWORK, PROTOCOL_VERSION);
471 0 : stream >> block;
472 0 : return block;
473 0 : }
|
