p2pool/src/p2p_server.h

240 lines
7.4 KiB
C
Raw Normal View History

2021-08-22 10:20:59 +00:00
/*
* This file is part of the Monero P2Pool <https://github.com/SChernykh/p2pool>
2022-03-30 12:42:26 +00:00
* Copyright (c) 2021-2022 SChernykh <https://github.com/SChernykh>
2021-08-22 10:20:59 +00:00
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, version 3.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#pragma once
#include "tcp_server.h"
namespace p2pool {
class p2pool;
struct PoolBlock;
class BlockCache;
2021-08-22 10:20:59 +00:00
static constexpr size_t P2P_BUF_SIZE = 128 * 1024;
static constexpr size_t PEER_LIST_RESPONSE_MAX_PEERS = 16;
static constexpr int DEFAULT_P2P_PORT = 37889;
static constexpr int DEFAULT_P2P_PORT_MINI = 37888;
2021-08-22 10:20:59 +00:00
class P2PServer : public TCPServer<P2P_BUF_SIZE, P2P_BUF_SIZE>
{
public:
enum class MessageId {
HANDSHAKE_CHALLENGE = 0,
HANDSHAKE_SOLUTION = 1,
LISTEN_PORT = 2,
BLOCK_REQUEST = 3,
BLOCK_RESPONSE = 4,
BLOCK_BROADCAST = 5,
PEER_LIST_REQUEST = 6,
PEER_LIST_RESPONSE = 7,
};
explicit P2PServer(p2pool *pool);
~P2PServer();
void add_cached_block(const PoolBlock& block);
void clear_cached_blocks();
void store_in_cache(const PoolBlock& block);
2022-08-31 14:37:33 +00:00
void connect_to_peers_async(const char* peer_list);
2021-08-22 10:20:59 +00:00
void connect_to_peers(const std::string& peer_list);
void on_connect_failed(bool is_v6, const raw_ip& ip, int port) override;
struct P2PClient : public Client
{
P2PClient();
~P2PClient();
static Client* allocate() { return new P2PClient(); }
void reset() override;
bool on_connect() override;
bool on_read(char* data, uint32_t size) override;
void on_read_failed(int err) override;
2021-09-07 07:53:38 +00:00
void on_disconnected() override;
2021-08-22 10:20:59 +00:00
// Both peers send handshake challenge immediately after a connection is established
// Both peers must have the same consensus ID for handshake to succeed
// Consensus ID is never sent over the network
//
// Handshake sequence:
//
// - Both peers send 8-byte random challenges (and 8 bytes of peer ID) to each other
// - Each peer receives 8-byte challenge, chooses 8-byte random SALT and calculates H = KECCAK(CHALLENGE|CONSENSUS_ID|SALT)
// - Both peers send their H and SALT, calculate H of the other peer and check if it matches with what other peer calculated
// - Peer that initiated the connection must also provide enough PoW in H (difficulty = 10000, 5-10 ms on modern CPU)
// - If H doesn't match or doesn't have enough PoW, connection is closed immediately
enum {
CHALLENGE_SIZE = 8,
CHALLENGE_DIFFICULTY = 10000,
};
bool send_handshake_challenge();
void send_handshake_solution(const uint8_t (&challenge)[CHALLENGE_SIZE]);
bool check_handshake_solution(const hash& solution, const uint8_t (&solution_salt)[CHALLENGE_SIZE]);
bool on_handshake_challenge(const uint8_t* buf);
bool on_handshake_solution(const uint8_t* buf);
void on_after_handshake(uint8_t* &p);
bool on_listen_port(const uint8_t* buf);
bool on_block_request(const uint8_t* buf);
bool on_block_response(const uint8_t* buf, uint32_t size);
bool on_block_broadcast(const uint8_t* buf, uint32_t size);
bool on_peer_list_request(const uint8_t* buf);
bool on_peer_list_response(const uint8_t* buf) const;
bool handle_incoming_block_async(const PoolBlock* block);
void handle_incoming_block(p2pool* pool, PoolBlock& block, const uint32_t reset_counter, const raw_ip& addr, std::vector<hash>& missing_blocks);
2021-08-22 10:20:59 +00:00
void post_handle_incoming_block(const uint32_t reset_counter, std::vector<hash>& missing_blocks);
bool is_good() const { return m_handshakeComplete && !m_handshakeInvalid && (m_listenPort >= 0); }
2021-08-22 10:20:59 +00:00
uint64_t m_peerId;
MessageId m_expectedMessage;
uint64_t m_handshakeChallenge;
bool m_handshakeSolutionSent;
bool m_handshakeComplete;
bool m_handshakeInvalid;
2021-08-22 10:20:59 +00:00
int m_listenPort;
uint32_t m_fastPeerListRequestCount;
uint64_t m_prevIncomingPeerListRequest;
2022-02-21 17:41:36 +00:00
uint64_t m_nextOutgoingPeerListRequest;
std::chrono::high_resolution_clock::time_point m_lastPeerListRequestTime;
int m_peerListPendingRequests;
int64_t m_pingTime;
2022-02-21 15:54:53 +00:00
int m_blockPendingRequests;
bool m_chainTipBlockRequest;
2022-02-21 15:54:53 +00:00
uint64_t m_lastAlive;
uint64_t m_lastBroadcastTimestamp;
uint64_t m_lastBlockrequestTimestamp;
2021-08-22 10:20:59 +00:00
hash m_broadcastedHashes[8];
std::atomic<uint32_t> m_broadcastedHashesIndex{ 0 };
2021-08-22 10:20:59 +00:00
};
void broadcast(const PoolBlock& block);
uint64_t get_random64();
uint64_t get_peerId() const { return m_peerId; }
void print_status() override;
2022-08-31 14:37:33 +00:00
void show_peers_async();
2022-05-28 18:47:49 +00:00
size_t peer_list_size() const { MutexLock lock(m_peerListLock); return m_peerList.size(); }
2021-08-22 10:20:59 +00:00
uint32_t max_outgoing_peers() const { return m_maxOutgoingPeers; }
uint32_t max_incoming_peers() const { return m_maxIncomingPeers; }
void set_max_outgoing_peers(uint32_t n) { m_maxOutgoingPeers = std::min(std::max(n, 10U), 450U); }
void set_max_incoming_peers(uint32_t n) { m_maxIncomingPeers = std::min(std::max(n, 10U), 450U); }
int deserialize_block(const uint8_t* buf, uint32_t size);
const PoolBlock* get_block() const { return m_block; }
2021-08-22 10:20:59 +00:00
private:
p2pool* m_pool;
BlockCache* m_cache;
bool m_cacheLoaded;
std::string m_initialPeerList;
uint32_t m_maxOutgoingPeers;
uint32_t m_maxIncomingPeers;
uv_rwlock_t m_cachedBlocksLock;
unordered_map<hash, PoolBlock*>* m_cachedBlocks;
2021-08-22 10:20:59 +00:00
private:
static void on_timer(uv_timer_t* timer) { reinterpret_cast<P2PServer*>(timer->data)->on_timer(); }
void on_timer();
void flush_cache();
2021-08-22 10:20:59 +00:00
void download_missing_blocks();
void check_zmq();
2021-08-22 10:20:59 +00:00
void update_peer_connections();
void update_peer_list();
void send_peer_list_request(P2PClient* client, uint64_t cur_time);
2021-08-22 10:20:59 +00:00
void save_peer_list_async();
void save_peer_list();
2021-09-07 19:30:52 +00:00
void load_peer_list();
2022-02-17 19:03:47 +00:00
void load_monerod_peer_list();
2021-08-22 10:20:59 +00:00
void update_peer_in_list(bool is_v6, const raw_ip& ip, int port);
void remove_peer_from_list(P2PClient* client);
void remove_peer_from_list(const raw_ip& ip);
2021-08-22 10:20:59 +00:00
uv_mutex_t m_rngLock;
std::mt19937_64 m_rng;
uv_mutex_t m_blockLock;
PoolBlock* m_block;
std::vector<uint8_t> m_blockDeserializeBuf;
int m_blockDeserializeResult;
2021-08-22 10:20:59 +00:00
uv_timer_t m_timer;
2022-02-21 17:41:36 +00:00
uint64_t m_timerCounter;
uint64_t m_timerInterval;
2021-08-22 10:20:59 +00:00
uint64_t m_peerId;
2022-05-28 18:47:49 +00:00
mutable uv_mutex_t m_peerListLock;
2021-08-22 10:20:59 +00:00
struct Peer
{
bool m_isV6;
raw_ip m_addr;
int m_port;
uint32_t m_numFailedConnections;
uint64_t m_lastSeen;
2021-08-22 10:20:59 +00:00
};
std::vector<Peer> m_peerList;
2022-02-17 19:03:47 +00:00
std::vector<Peer> m_peerListMonero;
2022-05-28 18:47:49 +00:00
std::atomic<uint64_t> m_peerListLastSaved;
2021-08-22 10:20:59 +00:00
struct Broadcast
{
std::vector<uint8_t> blob;
std::vector<uint8_t> pruned_blob;
std::vector<hash> ancestor_hashes;
};
uv_mutex_t m_broadcastLock;
uv_async_t m_broadcastAsync;
std::vector<Broadcast*> m_broadcastQueue;
bool m_lookForMissingBlocks;
2021-10-29 12:24:05 +00:00
unordered_set<std::pair<uint64_t, uint64_t>> m_missingBlockRequests;
P2PClient* m_fastestPeer;
2021-08-22 10:20:59 +00:00
static void on_broadcast(uv_async_t* handle) { reinterpret_cast<P2PServer*>(handle->data)->on_broadcast(); }
void on_broadcast();
2022-08-31 14:37:33 +00:00
uv_mutex_t m_connectToPeersLock;
uv_async_t m_connectToPeersAsync;
std::string m_connectToPeersData;
static void on_connect_to_peers(uv_async_t* handle);
uv_async_t m_showPeersAsync;
static void on_show_peers(uv_async_t* handle) { reinterpret_cast<P2PServer*>(handle->data)->show_peers(); }
void show_peers();
2021-08-22 10:20:59 +00:00
};
} // namespace p2pool