referrerpolicy=no-referrer-when-downgrade

round_trip/
round_trip.rs

1// Copyright (C) Parity Technologies (UK) Ltd.
2// This file is part of Polkadot.
3
4// Polkadot is free software: you can redistribute it and/or modify
5// it under the terms of the GNU General Public License as published by
6// the Free Software Foundation, either version 3 of the License, or
7// (at your option) any later version.
8
9// Polkadot is distributed in the hope that it will be useful,
10// but WITHOUT ANY WARRANTY; without even the implied warranty of
11// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
12// GNU General Public License for more details.
13
14// You should have received a copy of the GNU General Public License
15// along with Polkadot.  If not, see <http://www.gnu.org/licenses/>.
16
17use honggfuzz::fuzz;
18use polkadot_erasure_coding::*;
19use polkadot_node_primitives::{AvailableData, BlockData, PoV};
20use polkadot_primitives::PersistedValidationData;
21use std::sync::Arc;
22
23fn main() {
24	loop {
25		fuzz!(|data: &[u8]| {
26			let pov_block = PoV { block_data: BlockData(data.iter().cloned().collect()) };
27
28			let available_data = AvailableData {
29				pov: Arc::new(pov_block),
30				validation_data: PersistedValidationData::default(),
31			};
32			let chunks = obtain_chunks_v1(10, &available_data).unwrap();
33
34			assert_eq!(chunks.len(), 10);
35
36			// any 4 chunks should work.
37			let reconstructed: AvailableData = reconstruct_v1(
38				10,
39				[(&*chunks[1], 1), (&*chunks[4], 4), (&*chunks[6], 6), (&*chunks[9], 9)]
40					.iter()
41					.cloned(),
42			)
43			.unwrap();
44
45			assert_eq!(reconstructed, available_data);
46			println!("{:?}", reconstructed);
47		});
48	}
49}