mirror of
https://github.com/pezkuwichain/pezkuwi-subxt.git
synced 2026-07-03 04:07:23 +00:00
80616f6d03
[litep2p](https://github.com/altonen/litep2p) is a libp2p-compatible P2P networking library. It supports all of the features of `rust-libp2p` that are currently being utilized by Polkadot SDK. Compared to `rust-libp2p`, `litep2p` has a quite different architecture which is why the new `litep2p` network backend is only able to use a little of the existing code in `sc-network`. The design has been mainly influenced by how we'd wish to structure our networking-related code in Polkadot SDK: independent higher-levels protocols directly communicating with the network over links that support bidirectional backpressure. A good example would be `NotificationHandle`/`RequestResponseHandle` abstractions which allow, e.g., `SyncingEngine` to directly communicate with peers to announce/request blocks. I've tried running `polkadot --network-backend litep2p` with a few different peer configurations and there is a noticeable reduction in networking CPU usage. For high load (`--out-peers 200`), networking CPU usage goes down from ~110% to ~30% (80 pp) and for normal load (`--out-peers 40`), the usage goes down from ~55% to ~18% (37 pp). These should not be taken as final numbers because: a) there are still some low-hanging optimization fruits, such as enabling [receive window auto-tuning](https://github.com/libp2p/rust-yamux/pull/176), integrating `Peerset` more closely with `litep2p` or improving memory usage of the WebSocket transport b) fixing bugs/instabilities that incorrectly cause `litep2p` to do less work will increase the networking CPU usage c) verification in a more diverse set of tests/conditions is needed Nevertheless, these numbers should give an early estimate for CPU usage of the new networking backend. This PR consists of three separate changes: * introduce a generic `PeerId` (wrapper around `Multihash`) so that we don't have use `NetworkService::PeerId` in every part of the code that uses a `PeerId` * introduce `NetworkBackend` trait, implement it for the libp2p network stack and make Polkadot SDK generic over `NetworkBackend` * implement `NetworkBackend` for litep2p The new library should be considered experimental which is why `rust-libp2p` will remain as the default option for the time being. This PR currently depends on the master branch of `litep2p` but I'll cut a new release for the library once all review comments have been addresses. --------- Signed-off-by: Alexandru Vasile <alexandru.vasile@parity.io> Co-authored-by: Dmitry Markin <dmitry@markin.tech> Co-authored-by: Alexandru Vasile <60601340+lexnv@users.noreply.github.com> Co-authored-by: Alexandru Vasile <alexandru.vasile@parity.io>
110 lines
3.6 KiB
Rust
110 lines
3.6 KiB
Rust
// This file is part of Substrate.
|
|
|
|
// Copyright (C) Parity Technologies (UK) Ltd.
|
|
// SPDX-License-Identifier: GPL-3.0-or-later WITH Classpath-exception-2.0
|
|
|
|
// 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, either version 3 of the License, or
|
|
// (at your option) any later version.
|
|
|
|
// 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 <https://www.gnu.org/licenses/>.
|
|
|
|
use sc_network_common::role::ObservedRole;
|
|
use sc_network_types::PeerId;
|
|
use sp_runtime::traits::Block as BlockT;
|
|
|
|
/// Validates consensus messages.
|
|
pub trait Validator<B: BlockT>: Send + Sync {
|
|
/// New peer is connected.
|
|
fn new_peer(&self, _context: &mut dyn ValidatorContext<B>, _who: &PeerId, _role: ObservedRole) {
|
|
}
|
|
|
|
/// New connection is dropped.
|
|
fn peer_disconnected(&self, _context: &mut dyn ValidatorContext<B>, _who: &PeerId) {}
|
|
|
|
/// Validate consensus message.
|
|
fn validate(
|
|
&self,
|
|
context: &mut dyn ValidatorContext<B>,
|
|
sender: &PeerId,
|
|
data: &[u8],
|
|
) -> ValidationResult<B::Hash>;
|
|
|
|
/// Produce a closure for validating messages on a given topic.
|
|
fn message_expired<'a>(&'a self) -> Box<dyn FnMut(B::Hash, &[u8]) -> bool + 'a> {
|
|
Box::new(move |_topic, _data| false)
|
|
}
|
|
|
|
/// Produce a closure for filtering egress messages.
|
|
fn message_allowed<'a>(
|
|
&'a self,
|
|
) -> Box<dyn FnMut(&PeerId, MessageIntent, &B::Hash, &[u8]) -> bool + 'a> {
|
|
Box::new(move |_who, _intent, _topic, _data| true)
|
|
}
|
|
}
|
|
|
|
/// Validation context. Allows reacting to incoming messages by sending out further messages.
|
|
pub trait ValidatorContext<B: BlockT> {
|
|
/// Broadcast all messages with given topic to peers that do not have it yet.
|
|
fn broadcast_topic(&mut self, topic: B::Hash, force: bool);
|
|
/// Broadcast a message to all peers that have not received it previously.
|
|
fn broadcast_message(&mut self, topic: B::Hash, message: Vec<u8>, force: bool);
|
|
/// Send addressed message to a peer.
|
|
fn send_message(&mut self, who: &PeerId, message: Vec<u8>);
|
|
/// Send all messages with given topic to a peer.
|
|
fn send_topic(&mut self, who: &PeerId, topic: B::Hash, force: bool);
|
|
}
|
|
|
|
/// The reason for sending out the message.
|
|
#[derive(Eq, PartialEq, Copy, Clone)]
|
|
#[cfg_attr(test, derive(Debug))]
|
|
pub enum MessageIntent {
|
|
/// Requested broadcast.
|
|
Broadcast,
|
|
/// Requested broadcast to all peers.
|
|
ForcedBroadcast,
|
|
/// Periodic rebroadcast of all messages to all peers.
|
|
PeriodicRebroadcast,
|
|
}
|
|
|
|
/// Message validation result.
|
|
pub enum ValidationResult<H> {
|
|
/// Message should be stored and propagated under given topic.
|
|
ProcessAndKeep(H),
|
|
/// Message should be processed, but not propagated.
|
|
ProcessAndDiscard(H),
|
|
/// Message should be ignored.
|
|
Discard,
|
|
}
|
|
|
|
/// A gossip message validator that discards all messages.
|
|
pub struct DiscardAll;
|
|
|
|
impl<B: BlockT> Validator<B> for DiscardAll {
|
|
fn validate(
|
|
&self,
|
|
_context: &mut dyn ValidatorContext<B>,
|
|
_sender: &PeerId,
|
|
_data: &[u8],
|
|
) -> ValidationResult<B::Hash> {
|
|
ValidationResult::Discard
|
|
}
|
|
|
|
fn message_expired<'a>(&'a self) -> Box<dyn FnMut(B::Hash, &[u8]) -> bool + 'a> {
|
|
Box::new(move |_topic, _data| true)
|
|
}
|
|
|
|
fn message_allowed<'a>(
|
|
&'a self,
|
|
) -> Box<dyn FnMut(&PeerId, MessageIntent, &B::Hash, &[u8]) -> bool + 'a> {
|
|
Box::new(move |_who, _intent, _topic, _data| false)
|
|
}
|
|
}
|