mirror of
https://github.com/dashpay/dash.git
synced 2024-12-26 12:32:48 +01:00
174 lines
7.6 KiB
Python
Executable File
174 lines
7.6 KiB
Python
Executable File
#!/usr/bin/env python3
|
|
# Copyright (c) 2015-2024 The Dash Core developers
|
|
# Distributed under the MIT software license, see the accompanying
|
|
# file COPYING or http://www.opensource.org/licenses/mit-license.php.
|
|
|
|
'''
|
|
feature_llmq_singlenode.py
|
|
|
|
Checks creating LLMQs signle node quorum creation and signing
|
|
This functional test is similar to feature_llmq_signing.py but difference are big enough to make implementation common.
|
|
|
|
'''
|
|
|
|
import time
|
|
|
|
from test_framework.test_framework import DashTestFramework
|
|
from test_framework.util import (
|
|
assert_raises_rpc_error,
|
|
assert_greater_than,
|
|
wait_until_helper,
|
|
)
|
|
|
|
|
|
id = "0000000000000000000000000000000000000000000000000000000000000001"
|
|
msgHash = "0000000000000000000000000000000000000000000000000000000000000002"
|
|
msgHashConflict = "0000000000000000000000000000000000000000000000000000000000000003"
|
|
|
|
class LLMQSigningTest(DashTestFramework):
|
|
def set_test_params(self):
|
|
self.set_dash_test_params(1, 0, [["-llmqtestplatform=llmq_1_100", "-llmqtestchainlocks=llmq_1_100", "-llmqtestinstantsenddip0024=llmq_1_100"]] * 1, evo_count=2)
|
|
|
|
|
|
def mine_single_node_quorum(self):
|
|
node = self.nodes[0]
|
|
quorums = node.quorum('list')['llmq_1_100']
|
|
while node.quorum('list')['llmq_1_100'] == quorums:
|
|
self.bump_mocktime(1)
|
|
self.generate(node, 2)
|
|
|
|
def check_sigs(self, hasrecsigs, isconflicting1, isconflicting2):
|
|
has_sig = False
|
|
conflicting_1 = False
|
|
conflicting_2 = False
|
|
|
|
for mn in self.mninfo:
|
|
if mn.node.quorum("hasrecsig", 111, id, msgHash):
|
|
has_sig = True
|
|
if mn.node.quorum("isconflicting", 111, id, msgHash):
|
|
conflicting_1 = True
|
|
if mn.node.quorum("isconflicting", 111, id, msgHashConflict):
|
|
conflicting_2 = True
|
|
if has_sig != hasrecsigs:
|
|
return False
|
|
if conflicting_1 != isconflicting1:
|
|
return False
|
|
if conflicting_2 != isconflicting2:
|
|
return False
|
|
|
|
return True
|
|
|
|
def wait_for_sigs(self, hasrecsigs, isconflicting1, isconflicting2, timeout):
|
|
self.wait_until(lambda: self.check_sigs(hasrecsigs, isconflicting1, isconflicting2), timeout = timeout)
|
|
|
|
def assert_sigs_nochange(self, hasrecsigs, isconflicting1, isconflicting2, timeout):
|
|
assert not wait_until_helper(lambda: not self.check_sigs(hasrecsigs, isconflicting1, isconflicting2), timeout = timeout, do_assert = False)
|
|
|
|
|
|
def log_connections(self):
|
|
connections = []
|
|
for idx in range(len(self.nodes)):
|
|
connections.append(self.nodes[idx].getconnectioncount())
|
|
self.log.info(f"nodes connection count: {connections}")
|
|
|
|
def run_test(self):
|
|
self.nodes[0].sporkupdate("SPORK_17_QUORUM_DKG_ENABLED", 0)
|
|
self.wait_for_sporks_same()
|
|
|
|
self.activate_v19(expected_activation_height=900)
|
|
self.dynamically_add_masternode(evo=True)
|
|
self.dynamically_add_masternode(evo=True)
|
|
self.connect_nodes(1, 2)
|
|
|
|
# move forward to next DKG
|
|
skip_count = 24 - (self.nodes[0].getblockcount() % 24)
|
|
if skip_count != 0:
|
|
self.bump_mocktime(1)
|
|
time.sleep(1)
|
|
self.generate(self.nodes[0], skip_count)
|
|
self.generate(self.nodes[0], 30)
|
|
|
|
self.log_connections()
|
|
assert_greater_than(len(self.nodes[0].quorum('list')['llmq_1_100']), 0)
|
|
self.log.info("We have quorum waiting for ChainLock")
|
|
self.wait_for_chainlocked_block(self.nodes[0], self.nodes[0].getbestblockhash())
|
|
|
|
self.log.info("Send funds and wait InstantSend lock")
|
|
txid = self.nodes[0].sendtoaddress(self.nodes[0].getnewaddress(), 1)
|
|
self.wait_for_instantlock(txid, self.nodes[0])
|
|
|
|
|
|
self.log.info("Test various options to sign messages with nodes")
|
|
recsig_time = self.mocktime
|
|
|
|
# Initial state
|
|
self.wait_for_sigs(False, False, False, 1)
|
|
|
|
# Sign first share without any optional parameter, should not result in recovered sig
|
|
# Sign second share and test optional quorumHash parameter, should not result in recovered sig
|
|
# 1. Providing an invalid quorum hash should fail and cause no changes for sigs
|
|
assert not self.mninfo[1].node.quorum("sign", 111, id, msgHash, msgHash)
|
|
self.assert_sigs_nochange(False, False, False, 3)
|
|
# 2. Providing a valid quorum hash should succeed and cause no changes for sigss
|
|
quorumHash = self.mninfo[1].node.quorum("selectquorum", 111, id)["quorumHash"]
|
|
|
|
self.mninfo[0].node.quorum("sign", 111, id, msgHash, quorumHash, False)
|
|
self.mninfo[0].node.quorum("sign", 111, id, msgHash)
|
|
self.mninfo[1].node.quorum("sign", 111, id, msgHash)
|
|
|
|
self.wait_for_sigs(True, False, True, 15)
|
|
has0 = self.nodes[0].quorum("hasrecsig", 111, id, msgHash)
|
|
has1 = self.nodes[1].quorum("hasrecsig", 111, id, msgHash)
|
|
has2 = self.nodes[2].quorum("hasrecsig", 111, id, msgHash)
|
|
assert (has0 or has1 or has2)
|
|
|
|
self.log.info("Test `quorum verify` rpc")
|
|
self.log_connections()
|
|
node = self.mninfo[0].node
|
|
recsig = node.quorum("getrecsig", 111, id, msgHash)
|
|
self.log.info("Find quorum automatically")
|
|
height = node.getblockcount()
|
|
height_bad = node.getblockheader(recsig["quorumHash"])["height"]
|
|
hash_bad = node.getblockhash(0)
|
|
assert node.quorum("verify", 111, id, msgHash, recsig["sig"])
|
|
assert node.quorum("verify", 111, id, msgHash, recsig["sig"], "", height)
|
|
assert not node.quorum("verify", 111, id, msgHashConflict, recsig["sig"])
|
|
assert not node.quorum("verify", 111, id, msgHash, recsig["sig"], "", height_bad)
|
|
self.log.info("Use specific quorum")
|
|
assert node.quorum("verify", 111, id, msgHash, recsig["sig"], recsig["quorumHash"])
|
|
assert not node.quorum("verify", 111, id, msgHashConflict, recsig["sig"], recsig["quorumHash"])
|
|
assert_raises_rpc_error(-8, "quorum not found", node.quorum, "verify", 111, id, msgHash, recsig["sig"], hash_bad)
|
|
|
|
self.log.info("Mine one more quorum, so that we have 2 active ones, nothing should change")
|
|
self.mine_single_node_quorum()
|
|
self.assert_sigs_nochange(True, False, True, 3)
|
|
|
|
self.log_connections()
|
|
|
|
self.log.info("Mine 2 more quorums, so that the one used for the the recovered sig should become inactive, nothing should change")
|
|
self.mine_single_node_quorum()
|
|
self.mine_single_node_quorum()
|
|
self.assert_sigs_nochange(True, False, True, 3)
|
|
|
|
self.log.info("Fast forward until 0.5 days before cleanup is expected, recovered sig should still be valid")
|
|
self.bump_mocktime(recsig_time + int(60 * 60 * 24 * 6.5) - self.mocktime, update_schedulers=False)
|
|
self.log.info("Cleanup starts every 5 seconds")
|
|
self.wait_for_sigs(True, False, True, 15)
|
|
self.log.info("Fast forward 1 day, recovered sig should not be valid anymore")
|
|
self.bump_mocktime(int(60 * 60 * 24 * 1), update_schedulers=False)
|
|
self.log.info("Cleanup starts every 5 seconds")
|
|
self.wait_for_sigs(False, False, False, 15)
|
|
|
|
self.log_connections()
|
|
|
|
self.log.info("Test chainlocks and InstantSend with new quorums and 2 nodes")
|
|
block_hash = self.nodes[0].getbestblockhash()
|
|
self.log.info(f"Chainlock on block: {block_hash} is expected")
|
|
self.wait_for_best_chainlock(self.nodes[0], block_hash)
|
|
txid = self.nodes[0].sendtoaddress(self.nodes[0].getnewaddress(), 1)
|
|
self.log.info(f"InstantSend lock on tx: {txid} is expected")
|
|
self.wait_for_instantlock(txid, self.nodes[0])
|
|
|
|
if __name__ == '__main__':
|
|
LLMQSigningTest().main()
|