oxen-io
/
oxen-core
mirror of https://github.com/oxen-io/oxen-core.git
2
1
Fork 0
Code Issues Projects Releases Wiki Activity
oxen-core/src/cryptonote_protocol/quorumnet_conn_matrix.h

344 lines
12 KiB
C++
Raw Blame History

// Copyright (c) 2019, The Loki Project
//
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without modification, are
// permitted provided that the following conditions are met:
//
// 1. Redistributions of source code must retain the above copyright notice, this list of
// conditions and the following disclaimer.
//
// 2. Redistributions in binary form must reproduce the above copyright notice, this list
// of conditions and the following disclaimer in the documentation and/or other
// materials provided with the distribution.
//
// 3. Neither the name of the copyright holder nor the names of its contributors may be
// used to endorse or promote products derived from this software without specific
// prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY
// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
// MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
// THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
// STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
// THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
#pragma once
// This file contains several pre-defined matrix interconnections establishing which nodes in a
// N-quorum establish connections to each other. The patterns here were determined by the
// utils/generate-quorum-matrix.py script.
#include <array>
namespace quorumnet {
class quorum_conn_iterator {
private:
friend class quorum_outgoing_conns;
friend class quorum_incoming_conns;
const bool * const flags;
int i;
const int N;
const int step;
quorum_conn_iterator(const bool *flags_, int N_, bool outgoing_ = true) : flags{flags_}, i{0}, N{N_}, step{outgoing_ ? 1 : N} {
if (flags == nullptr && N != 0)
throw std::domain_error("Invalid/unsupported quorum size (" + std::to_string(N) + ")");
if (!flags[0] && N > 0) ++*this;
}
public:
using iterator_category = std::forward_iterator_tag;
using value_type = int;
using difference_type = int;
using pointer_type = const int *;
using reference = const int &;
constexpr quorum_conn_iterator() : flags{nullptr}, i{0}, N{0}, step{1} {}
reference operator*() const { return i; }
bool operator==(const quorum_conn_iterator &it) const {
return (i == N && it.i == it.N) || (flags == it.flags && i == it.i);
}
bool operator!=(const quorum_conn_iterator &it) const { return !(*this == it); }
quorum_conn_iterator &operator++() {
do { ++i; } while (i < N && !flags[i*step]);
return *this;
}
quorum_conn_iterator operator++(int) {
quorum_conn_iterator old{*this};
++*this;
return old;
}
};
template <int N> constexpr void requested_quorum_size_is_not_defined() { static_assert(N != N, "Requested quorum size is not implemented"); }
/// Base implementation for quorum matrices; instantiating this is an error; all supported sizes are
/// defined below.
template <int N> constexpr static std::array<bool, N*N> quorum_conn_matrix = requested_quorum_size_is_not_defined<N>();
template<> constexpr std::array<bool, 7*7> quorum_conn_matrix<7>{{
0,1,0,1,0,1,0,
0,0,1,1,0,0,1,
1,0,0,1,1,0,0,
0,0,0,0,1,1,1,
1,0,0,0,0,1,0,
0,1,0,0,0,0,1,
0,0,1,0,1,0,0,
}};
template<> constexpr std::array<bool, 8*8> quorum_conn_matrix<8>{{
0,1,1,1,0,1,0,0,
0,0,1,1,1,0,0,0,
0,0,0,1,0,1,1,0,
0,0,0,0,1,0,1,1,
1,0,1,0,0,0,0,1,
0,1,0,0,0,0,1,0,
1,0,0,0,1,0,0,1,
1,1,0,0,0,1,0,0,
}};
template<> constexpr std::array<bool, 9*9> quorum_conn_matrix<9>{{
0,1,1,0,0,1,0,0,0,
0,0,1,0,0,1,0,1,0,
0,0,0,1,1,0,0,0,1,
0,0,0,0,1,0,1,1,0,
1,1,0,0,0,0,1,0,0,
0,0,1,1,0,0,1,0,0,
1,0,0,0,0,0,0,1,1,
1,0,0,0,1,0,0,0,1,
0,1,0,1,0,1,0,0,0,
}};
template<> constexpr std::array<bool, 10*10> quorum_conn_matrix<10>{{
0,1,0,0,0,1,0,0,0,1,
0,0,1,0,0,0,1,1,0,0,
0,0,0,1,0,0,0,0,1,1,
0,0,0,0,1,1,1,0,0,0,
1,0,0,0,0,0,0,1,1,0,
0,1,1,0,0,0,1,0,0,0,
1,0,0,0,1,0,0,1,0,0,
0,0,1,1,0,0,0,0,1,0,
1,1,0,0,0,0,0,0,0,1,
0,0,0,1,1,1,0,0,0,0,
}};
template<> constexpr std::array<bool, 13*13> quorum_conn_matrix<13>{{
0,1,1,1,0,1,0,0,0,0,0,0,0,
0,0,1,0,0,0,0,1,0,0,0,0,1,
0,0,0,1,0,0,1,1,0,0,0,0,0,
0,0,0,0,1,1,0,0,0,1,0,0,0,
1,0,0,0,0,0,0,0,0,0,1,1,0,
0,0,0,0,0,0,1,0,1,0,1,0,0,
0,0,0,0,1,0,0,1,0,1,0,0,0,
1,0,0,0,1,0,0,0,1,0,0,0,0,
0,1,0,1,0,0,0,0,0,1,0,0,0,
0,0,0,0,0,1,0,0,0,0,0,1,1,
1,0,1,0,0,0,0,0,0,0,0,1,0,
0,1,0,0,0,0,0,0,1,0,0,0,1,
0,0,1,0,0,0,1,0,0,0,1,0,0,
}};
template<> constexpr std::array<bool, 14*14> quorum_conn_matrix<14>{{
0,1,0,0,0,1,0,0,0,0,0,0,0,1,
0,0,1,0,1,0,0,0,1,0,0,0,0,0,
0,0,0,1,0,0,0,1,1,0,0,0,0,0,
0,0,0,0,1,0,1,0,0,1,0,0,0,0,
1,0,0,0,0,1,1,0,0,0,0,0,0,0,
0,0,0,0,0,0,1,1,0,0,1,0,0,0,
0,1,0,0,0,0,0,1,0,0,1,1,0,0,
0,0,0,0,0,0,0,0,1,1,0,0,1,0,
0,0,0,1,0,0,0,0,0,1,0,0,0,1,
0,0,0,0,0,1,0,0,0,0,0,1,1,0,
1,0,1,0,0,0,0,0,0,0,0,1,0,0,
0,1,0,0,1,0,0,0,0,0,0,0,1,0,
1,0,0,0,0,0,0,0,0,0,0,0,0,1,
0,0,1,1,0,0,0,0,0,0,1,0,0,0,
}};
template<> constexpr std::array<bool, 15*15> quorum_conn_matrix<15>{{
0,1,1,0,0,1,0,0,0,0,0,0,0,0,0,
0,0,1,0,0,0,1,0,1,1,0,0,0,0,0,
0,0,0,1,0,0,1,1,0,0,0,1,0,0,0,
0,0,0,0,1,0,1,0,0,1,0,0,0,0,0,
1,0,0,0,0,0,0,0,0,0,0,0,1,0,1,
0,1,0,0,0,0,1,0,0,0,1,0,0,0,0,
0,0,0,0,1,0,0,1,0,0,1,0,0,0,0,
0,0,0,0,0,0,0,0,1,1,0,0,1,0,0,
1,0,0,0,0,0,0,0,0,1,0,1,0,0,0,
0,0,0,0,0,1,0,0,0,0,0,0,0,1,1,
0,0,1,0,0,0,0,0,0,0,0,1,0,1,0,
0,0,0,1,0,0,0,1,0,0,0,0,1,0,0,
1,0,0,0,0,1,0,0,0,0,0,0,0,1,0,
0,1,0,0,1,0,0,0,0,0,0,0,0,0,1,
0,0,0,1,0,0,0,0,1,0,1,0,0,0,0,
}};
template<> constexpr std::array<bool, 16*16> quorum_conn_matrix<16>{{
0,1,1,0,0,0,0,0,0,0,0,0,1,0,0,1,
0,0,1,0,0,1,0,0,0,0,0,0,1,1,0,0,
0,0,0,1,0,0,0,0,1,0,1,0,0,0,0,1,
0,0,0,0,1,0,0,0,1,0,0,1,0,0,0,0,
1,0,0,0,0,0,0,0,0,0,0,1,0,0,0,1,
0,0,1,0,0,0,1,0,0,0,0,0,0,0,1,0,
1,0,0,1,0,0,0,1,0,0,0,0,0,0,0,0,
1,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0,
0,1,0,0,0,0,0,0,0,1,0,0,0,1,0,0,
0,1,0,0,1,1,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,1,0,0,0,1,1,0,0,0,
0,0,0,0,0,0,1,0,0,1,0,0,1,0,0,0,
0,0,0,0,0,1,1,0,0,0,0,0,0,1,0,0,
0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,1,
0,0,0,0,1,0,0,1,0,0,1,0,0,0,0,0,
0,0,0,0,0,1,0,0,0,0,1,0,0,0,1,0,
}};
template<> constexpr std::array<bool, 17*17> quorum_conn_matrix<17>{{
0,1,0,0,0,0,1,1,0,0,0,0,0,0,0,1,0,
0,0,1,0,0,1,0,1,0,0,0,0,0,0,0,0,0,
0,0,0,1,1,1,0,0,1,0,0,0,0,0,0,0,0,
0,0,0,0,1,0,1,0,0,0,0,0,1,0,0,0,0,
1,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,
0,0,0,0,0,0,1,0,0,0,1,1,0,0,0,1,0,
0,0,0,0,0,0,0,1,0,0,0,0,0,0,1,1,0,
0,0,0,0,0,0,0,0,1,0,1,1,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,1,0,1,0,1,0,0,1,
0,0,0,0,0,1,1,0,0,0,0,0,0,1,0,0,0,
1,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,1,
0,0,0,1,0,0,0,0,0,1,0,0,1,0,0,0,0,
1,0,0,0,0,0,0,0,1,0,0,0,0,1,0,0,0,
0,1,0,0,1,0,0,0,0,0,0,0,0,0,1,0,0,
0,0,0,1,1,0,0,0,0,0,1,0,0,0,0,0,0,
0,0,1,0,0,0,0,0,0,0,0,0,1,0,0,0,1,
0,0,1,0,0,0,0,0,0,0,0,0,0,1,1,0,0,
}};
template<> constexpr std::array<bool, 18*18> quorum_conn_matrix<18>{{
0,1,0,1,0,1,0,0,1,0,0,0,0,0,0,0,0,0,
0,0,1,0,0,0,0,0,0,1,0,0,0,1,0,1,0,0,
0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,1,1,0,
0,1,0,0,1,0,1,0,0,1,0,0,0,0,0,0,0,0,
1,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,
0,0,0,0,0,0,1,1,0,0,1,0,0,0,1,0,0,0,
0,1,0,0,0,0,0,1,0,1,0,0,1,0,0,0,0,0,
0,0,0,0,0,0,0,0,1,0,0,1,1,0,0,0,1,0,
0,0,1,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,
0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,1,
0,0,1,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,
0,0,0,1,0,0,0,0,0,0,0,0,1,0,0,1,0,0,
1,0,0,0,1,0,0,0,0,0,0,0,0,1,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,1,0,0,0,1,0,1,0,
1,0,0,0,0,0,0,0,1,0,1,0,0,0,0,0,0,1,
0,0,0,0,0,1,1,0,0,0,0,0,0,0,0,0,1,0,
0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,1,
0,0,0,0,0,0,0,1,0,0,0,1,0,0,0,1,0,0,
}};
template<> constexpr std::array<bool, 19*19> quorum_conn_matrix<19>{{
0,1,0,0,0,1,0,1,0,0,0,0,0,0,0,0,0,0,0,
0,0,1,1,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,
0,0,0,1,0,0,0,1,0,0,0,0,1,0,0,1,0,0,0,
0,0,0,0,1,0,0,0,0,1,0,1,0,0,0,0,0,0,0,
1,0,0,0,0,0,0,0,0,0,0,0,0,1,1,0,0,1,0,
0,0,0,0,0,0,1,0,0,0,1,1,0,0,0,0,0,1,0,
0,0,0,0,0,0,0,1,0,0,0,1,1,0,0,0,1,0,0,
0,0,0,0,0,0,0,0,1,0,0,0,1,0,1,0,0,0,0,
0,0,0,1,0,0,0,0,0,1,0,0,0,1,0,0,0,1,0,
0,0,0,0,0,1,1,0,0,0,0,0,0,1,0,0,0,0,0,
0,1,1,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,
0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,0,1,
1,0,0,0,1,0,0,0,0,0,0,0,0,1,0,0,0,0,1,
0,0,0,0,0,0,0,0,0,0,1,0,0,0,1,0,1,0,0,
0,0,0,0,0,0,0,0,1,0,1,0,0,0,0,1,0,0,1,
0,0,0,0,0,1,1,0,0,0,0,0,0,0,0,0,1,0,0,
0,0,1,0,1,0,0,0,0,0,0,0,0,0,0,0,0,1,0,
1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
0,0,0,1,0,0,0,0,1,0,0,0,0,0,0,1,0,0,0,
}};
template<> constexpr std::array<bool, 20*20> quorum_conn_matrix<20>{{
0,1,0,0,0,1,0,0,1,0,0,0,0,0,0,1,0,0,0,0,
0,0,1,0,0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,0,
0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,1,
0,0,0,0,1,1,0,0,0,1,1,0,0,0,0,0,0,0,0,0,
1,0,0,0,0,0,1,0,0,0,0,0,1,0,1,0,0,0,0,0,
0,0,0,0,0,0,1,0,0,0,1,1,0,0,1,0,0,0,0,0,
0,0,0,0,0,0,0,1,0,0,0,1,0,1,0,0,1,0,0,0,
0,0,0,0,1,0,0,0,1,0,0,0,1,0,0,0,0,0,1,0,
0,0,0,1,0,1,0,0,0,1,0,0,0,0,0,0,0,1,0,0,
0,1,0,0,1,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,
0,0,1,0,0,0,0,0,0,0,0,1,0,0,0,0,0,1,0,0,
1,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,1,0,
1,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,1,0,
0,0,0,0,0,0,0,0,0,0,0,1,0,0,1,0,1,0,0,1,
0,0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,0,0,0,1,
0,0,0,0,0,0,1,1,0,0,0,0,0,0,0,0,1,1,0,0,
0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,
0,1,0,0,0,0,0,1,0,0,0,0,0,0,1,0,0,0,1,0,
0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
0,0,0,0,0,0,0,0,1,1,0,0,0,0,0,1,0,0,0,0,
}};
/// Returns the maximum possible outgoing connections for a single quorum of any supported size.
constexpr int max_outgoing_conns() { return 5; }
constexpr const bool *get_matrix(int N) {
switch (N) {
case 7: return &quorum_conn_matrix<7>[0];
case 8: return &quorum_conn_matrix<8>[0];
case 9: return &quorum_conn_matrix<9>[0];
case 10: return &quorum_conn_matrix<10>[0];
case 13: return &quorum_conn_matrix<13>[0];
case 14: return &quorum_conn_matrix<14>[0];
case 15: return &quorum_conn_matrix<15>[0];
case 16: return &quorum_conn_matrix<16>[0];
case 17: return &quorum_conn_matrix<17>[0];
case 18: return &quorum_conn_matrix<18>[0];
case 19: return &quorum_conn_matrix<19>[0];
case 20: return &quorum_conn_matrix<20>[0];
default: return nullptr;
};
}
/// Iterable class that lets you iterate through peer indices that should have an outgoing
/// connection. (Internally this is traversing all indices of the connection matrix with a true
/// value along the given row).
class quorum_outgoing_conns {
quorum_conn_iterator begin_;
public:
/// Constructs an iterable object iterating over the peers of node `i` in a quorum of size `N`
quorum_outgoing_conns(int i, int N) : begin_{get_matrix(N) + i*N, N} {}
using iterator = quorum_conn_iterator;
iterator begin() const { return begin_; }
static constexpr iterator end() { return {}; }
};
/// Iterable class that lets you iterator through peer indices of expected inbound connections for
/// the quorum. (Internally this is traversing all indices of the connection matrix with a true
/// value along the given column).
class quorum_incoming_conns {
quorum_conn_iterator begin_;
public:
/// Constructs an iterable object iterating over the peers of node `i` in a quorum of size `N`
quorum_incoming_conns(int i, int N) : begin_{get_matrix(N) + i, N, false} {}
using iterator = quorum_conn_iterator;
iterator begin() const { return begin_; }
static constexpr iterator end() { return {}; }
};
}
Reference in New Issue View Git Blame Copy Permalink