forked from bitcoin/bitcoin
-
Notifications
You must be signed in to change notification settings - Fork 1.2k
Expand file tree
/
Copy pathquorums.cpp
More file actions
235 lines (197 loc) Β· 6.94 KB
/
quorums.cpp
File metadata and controls
235 lines (197 loc) Β· 6.94 KB
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
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
// Copyright (c) 2018-2026 The Dash Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include <llmq/quorums.h>
#include <evo/deterministicmns.h>
#include <llmq/commitment.h>
#include <util/helpers.h>
#include <dbwrapper.h>
#include <memory>
#include <ranges>
namespace llmq {
const std::string DB_QUORUM_SK_SHARE = "q_Qsk";
const std::string DB_QUORUM_QUORUM_VVEC = "q_Qqvvec";
uint256 MakeQuorumKey(const CQuorum& q)
{
CHashWriter hw(SER_NETWORK, 0);
hw << q.params.type;
hw << q.qc->quorumHash;
for (const auto& dmn : q.members) {
hw << dmn->proTxHash;
}
return hw.GetHash();
}
void DataCleanupHelper(CDBWrapper& db, const Uint256HashSet& skip_list, bool compact)
{
const auto prefixes = {DB_QUORUM_QUORUM_VVEC, DB_QUORUM_SK_SHARE};
CDBBatch batch(db);
std::unique_ptr<CDBIterator> pcursor(db.NewIterator());
for (const auto& prefix : prefixes) {
auto start = std::make_tuple(prefix, uint256());
pcursor->Seek(start);
int count{0};
while (pcursor->Valid()) {
decltype(start) k;
if (!pcursor->GetKey(k) || std::get<0>(k) != prefix) {
break;
}
pcursor->Next();
if (skip_list.find(std::get<1>(k)) != skip_list.end()) continue;
++count;
batch.Erase(k);
if (batch.SizeEstimate() >= (1 << 24)) {
db.WriteBatch(batch);
batch.Clear();
}
}
db.WriteBatch(batch);
LogPrint(BCLog::LLMQ, "CQuorumManager::%s -- %s removed %d\n", __func__, prefix, count);
}
pcursor.reset();
if (compact) {
// Avoid using this on regular cleanups, use on db migrations only
LogPrint(BCLog::LLMQ, "CQuorumManager::%s -- compact start\n", __func__);
db.CompactFull();
LogPrint(BCLog::LLMQ, "CQuorumManager::%s -- compact end\n", __func__);
}
}
std::string CQuorumDataRequest::GetErrorString() const
{
switch (nError) {
case (Errors::NONE):
return "NONE";
case (Errors::QUORUM_TYPE_INVALID):
return "QUORUM_TYPE_INVALID";
case (Errors::QUORUM_BLOCK_NOT_FOUND):
return "QUORUM_BLOCK_NOT_FOUND";
case (Errors::QUORUM_NOT_FOUND):
return "QUORUM_NOT_FOUND";
case (Errors::MASTERNODE_IS_NO_MEMBER):
return "MASTERNODE_IS_NO_MEMBER";
case (Errors::QUORUM_VERIFICATION_VECTOR_MISSING):
return "QUORUM_VERIFICATION_VECTOR_MISSING";
case (Errors::ENCRYPTED_CONTRIBUTIONS_MISSING):
return "ENCRYPTED_CONTRIBUTIONS_MISSING";
case (Errors::UNDEFINED):
return "UNDEFINED";
default:
return "UNDEFINED";
}
return "UNDEFINED";
}
CQuorum::CQuorum(const Consensus::LLMQParams& _params, CBLSWorker& _blsWorker,
CFinalCommitmentPtr _qc, const CBlockIndex* _pQuorumBaseBlockIndex,
const uint256& _minedBlockHash, Span<CDeterministicMNCPtr> _members) :
params{_params},
qc{std::move(_qc)},
m_quorum_base_block_index{_pQuorumBaseBlockIndex},
minedBlockHash{_minedBlockHash},
members{_members.begin(), _members.end()},
blsCache{_blsWorker}
{
assert(qc != nullptr);
assert(m_quorum_base_block_index != nullptr);
}
bool CQuorum::SetVerificationVector(const std::vector<CBLSPublicKey>& quorumVecIn)
{
const auto quorumVecInSerialized = ::SerializeHash(quorumVecIn);
LOCK(cs_vvec_shShare);
if (quorumVecInSerialized != qc->quorumVvecHash) {
return false;
}
quorumVvec = std::make_shared<std::vector<CBLSPublicKey>>(quorumVecIn);
return true;
}
bool CQuorum::SetSecretKeyShare(const CBLSSecretKey& secretKeyShare, const uint256& protx_hash)
{
if (protx_hash.IsNull() || !secretKeyShare.IsValid() || (secretKeyShare.GetPublicKey() != GetPubKeyShare(GetMemberIndex(protx_hash)))) {
return false;
}
LOCK(cs_vvec_shShare);
skShare = secretKeyShare;
return true;
}
bool CQuorum::IsMember(const uint256& proTxHash) const
{
return std::ranges::any_of(members, [&proTxHash](const auto& dmn) { return dmn->proTxHash == proTxHash; });
}
bool CQuorum::IsValidMember(const uint256& proTxHash) const
{
for (const auto i : util::irange(members.size())) {
// cppcheck-suppress useStlAlgorithm
if (members[i]->proTxHash == proTxHash) {
return qc->validMembers[i];
}
}
return false;
}
CBLSPublicKey CQuorum::GetPubKeyShare(size_t memberIdx) const
{
LOCK(cs_vvec_shShare);
if (!HasVerificationVectorInternal() || memberIdx >= members.size() || !qc->validMembers[memberIdx]) {
return CBLSPublicKey();
}
const auto& m = members[memberIdx];
return blsCache.BuildPubKeyShare(m->proTxHash, quorumVvec, CBLSId(m->proTxHash));
}
bool CQuorum::HasVerificationVector() const {
LOCK(cs_vvec_shShare);
return HasVerificationVectorInternal();
}
bool CQuorum::HasVerificationVectorInternal() const {
AssertLockHeld(cs_vvec_shShare);
return quorumVvec != nullptr;
}
CBLSSecretKey CQuorum::GetSkShare() const
{
LOCK(cs_vvec_shShare);
return skShare;
}
int CQuorum::GetMemberIndex(const uint256& proTxHash) const
{
for (const auto i : util::irange(members.size())) {
// cppcheck-suppress useStlAlgorithm
if (members[i]->proTxHash == proTxHash) {
return int(i);
}
}
return -1;
}
void CQuorum::WriteContributions(CDBWrapper& db) const
{
uint256 dbKey = MakeQuorumKey(*this);
LOCK(cs_vvec_shShare);
if (HasVerificationVectorInternal()) {
CDataStream s(SER_DISK, CLIENT_VERSION);
WriteCompactSize(s, quorumVvec->size());
for (auto& pubkey : *quorumVvec) {
s << CBLSPublicKeyVersionWrapper(pubkey, false);
}
db.Write(std::make_pair(DB_QUORUM_QUORUM_VVEC, dbKey), s);
}
if (skShare.IsValid()) {
db.Write(std::make_pair(DB_QUORUM_SK_SHARE, dbKey), skShare);
}
}
bool CQuorum::ReadContributions(const CDBWrapper& db)
{
uint256 dbKey = MakeQuorumKey(*this);
CDataStream s(SER_DISK, CLIENT_VERSION);
if (!db.ReadDataStream(std::make_pair(DB_QUORUM_QUORUM_VVEC, dbKey), s)) {
return false;
}
size_t vvec_size = ReadCompactSize(s);
CBLSPublicKey pubkey;
std::vector<CBLSPublicKey> qv;
for ([[maybe_unused]] size_t _ : util::irange(vvec_size)) {
s >> CBLSPublicKeyVersionWrapper(pubkey, false);
qv.emplace_back(pubkey);
}
LOCK(cs_vvec_shShare);
quorumVvec = std::make_shared<std::vector<CBLSPublicKey>>(std::move(qv));
// We ignore the return value here as it is ok if this fails. If it fails, it usually means that we are not a
// member of the quorum but observed the whole DKG process to have the quorum verification vector.
db.Read(std::make_pair(DB_QUORUM_SK_SHARE, dbKey), skShare);
return true;
}
} // namespace llmq