mirror of
https://github.com/pezkuwichain/pezkuwi-subxt.git
synced 2026-04-29 23:07:57 +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>
135 lines
3.6 KiB
Rust
135 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/>.
|
|
|
|
//! Testing block import logic.
|
|
|
|
use super::*;
|
|
use futures::executor::block_on;
|
|
use sc_consensus::{
|
|
import_single_block, BasicQueue, BlockImportError, BlockImportStatus, ImportedAux,
|
|
IncomingBlock,
|
|
};
|
|
use sp_consensus::BlockOrigin;
|
|
use substrate_test_runtime_client::{
|
|
self,
|
|
prelude::*,
|
|
runtime::{Block, Hash},
|
|
};
|
|
|
|
fn prepare_good_block() -> (TestClient, Hash, u64, PeerId, IncomingBlock<Block>) {
|
|
let mut client = substrate_test_runtime_client::new();
|
|
let block = BlockBuilderBuilder::new(&client)
|
|
.on_parent_block(client.chain_info().best_hash)
|
|
.with_parent_block_number(client.chain_info().best_number)
|
|
.build()
|
|
.unwrap()
|
|
.build()
|
|
.unwrap()
|
|
.block;
|
|
block_on(client.import(BlockOrigin::File, block)).unwrap();
|
|
|
|
let (hash, number) = (client.block_hash(1).unwrap().unwrap(), 1);
|
|
let header = client.header(hash).unwrap();
|
|
let justifications = client.justifications(hash).unwrap();
|
|
let peer_id = PeerId::random();
|
|
(
|
|
client,
|
|
hash,
|
|
number,
|
|
peer_id,
|
|
IncomingBlock {
|
|
hash,
|
|
header,
|
|
body: Some(Vec::new()),
|
|
indexed_body: None,
|
|
justifications,
|
|
origin: Some(peer_id.into()),
|
|
allow_missing_state: false,
|
|
import_existing: false,
|
|
state: None,
|
|
skip_execution: false,
|
|
},
|
|
)
|
|
}
|
|
|
|
#[test]
|
|
fn import_single_good_block_works() {
|
|
let (_, _hash, number, peer_id, block) = prepare_good_block();
|
|
|
|
let mut expected_aux = ImportedAux::default();
|
|
expected_aux.is_new_best = true;
|
|
|
|
match block_on(import_single_block(
|
|
&mut substrate_test_runtime_client::new(),
|
|
BlockOrigin::File,
|
|
block,
|
|
&mut PassThroughVerifier::new(true),
|
|
)) {
|
|
Ok(BlockImportStatus::ImportedUnknown(ref num, ref aux, ref org))
|
|
if *num == number && *aux == expected_aux && *org == Some(peer_id.into()) => {},
|
|
r @ _ => panic!("{:?}", r),
|
|
}
|
|
}
|
|
|
|
#[test]
|
|
fn import_single_good_known_block_is_ignored() {
|
|
let (mut client, _hash, number, _, block) = prepare_good_block();
|
|
match block_on(import_single_block(
|
|
&mut client,
|
|
BlockOrigin::File,
|
|
block,
|
|
&mut PassThroughVerifier::new(true),
|
|
)) {
|
|
Ok(BlockImportStatus::ImportedKnown(ref n, _)) if *n == number => {},
|
|
_ => panic!(),
|
|
}
|
|
}
|
|
|
|
#[test]
|
|
fn import_single_good_block_without_header_fails() {
|
|
let (_, _, _, peer_id, mut block) = prepare_good_block();
|
|
block.header = None;
|
|
match block_on(import_single_block(
|
|
&mut substrate_test_runtime_client::new(),
|
|
BlockOrigin::File,
|
|
block,
|
|
&mut PassThroughVerifier::new(true),
|
|
)) {
|
|
Err(BlockImportError::IncompleteHeader(ref org)) if *org == Some(peer_id.into()) => {},
|
|
_ => panic!(),
|
|
}
|
|
}
|
|
|
|
#[test]
|
|
fn async_import_queue_drops() {
|
|
let executor = sp_core::testing::TaskExecutor::new();
|
|
// Perform this test multiple times since it exhibits non-deterministic behavior.
|
|
for _ in 0..100 {
|
|
let verifier = PassThroughVerifier::new(true);
|
|
|
|
let queue = BasicQueue::new(
|
|
verifier,
|
|
Box::new(substrate_test_runtime_client::new()),
|
|
None,
|
|
&executor,
|
|
None,
|
|
);
|
|
drop(queue);
|
|
}
|
|
}
|