feat: initialize Kurdistan SDK - independent fork of Polkadot SDK

2025-12-13 15:44:15 +03:00
commit 286de54384
6841 changed files with 1848356 additions and 0 deletions
@@ -0,0 +1,185 @@
+// Copyright (C) Parity Technologies (UK) Ltd.
+// This file is part of Pezkuwi.
+
+// Pezkuwi 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.
+
+// Pezkuwi 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 Pezkuwi.  If not, see <http://www.gnu.org/licenses/>.
+
+//! Basic teyrchain that adds a number as part of its state.
+
+#![no_std]
+
+extern crate alloc;
+
+use alloc::vec::Vec;
+use codec::{Decode, Encode};
+use pezkuwi_primitives::{
+	ClaimQueueOffset, CoreSelector, UMPSignal, DEFAULT_CLAIM_QUEUE_OFFSET, UMP_SEPARATOR,
+};
+use pezkuwi_teyrchain_primitives::primitives::UpwardMessages;
+use tiny_keccak::{Hasher as _, Keccak};
+
+#[cfg(not(feature = "std"))]
+mod wasm_validation;
+
+#[cfg(not(feature = "std"))]
+#[global_allocator]
+static ALLOC: dlmalloc::GlobalDlmalloc = dlmalloc::GlobalDlmalloc;
+const LOG_TARGET: &str = "runtime::undying";
+
+// Make the WASM binary available.
+#[cfg(feature = "std")]
+include!(concat!(env!("OUT_DIR"), "/wasm_binary.rs"));
+
+fn keccak256(input: &[u8]) -> [u8; 32] {
+	let mut out = [0u8; 32];
+	let mut keccak256 = Keccak::v256();
+	keccak256.update(input);
+	keccak256.finalize(&mut out);
+	out
+}
+
+/// Wasm binary unwrapped. If built with `BUILD_DUMMY_WASM_BINARY`, the function panics.
+#[cfg(feature = "std")]
+pub fn wasm_binary_unwrap() -> &'static [u8] {
+	WASM_BINARY.expect(
+		"Development wasm binary is not available. Testing is only \
+						supported with the flag disabled.",
+	)
+}
+
+/// Head data for this teyrchain.
+#[derive(Default, Clone, Hash, Eq, PartialEq, Encode, Decode, Debug)]
+pub struct HeadData {
+	/// Block number
+	pub number: u64,
+	/// parent block keccak256
+	pub parent_hash: [u8; 32],
+	/// hash of post-execution state.
+	pub post_state: [u8; 32],
+}
+
+impl HeadData {
+	pub fn hash(&self) -> [u8; 32] {
+		keccak256(&self.encode())
+	}
+}
+
+/// Block data for this teyrchain.
+#[derive(Default, Clone, Encode, Decode, Debug)]
+pub struct GraveyardState {
+	/// The grave index of the last placed tombstone.
+	pub index: u64,
+	/// We use a matrix where each element represents a grave.
+	/// The unsigned integer tracks the number of tombstones raised on
+	/// each grave.
+	pub graveyard: Vec<u8>,
+	// TODO: Add zombies. All of the graves produce zombies at a regular interval
+	// defined in blocks. The number of zombies produced scales with the tombstones.
+	// This would allow us to have a configurable and reproducible PVF execution time.
+	// However, PVF preparation time will likely rely on prebuild wasm binaries.
+	pub zombies: u64,
+	// Grave seal.
+	pub seal: [u8; 32],
+	// Increasing sequence number for core selector.
+	pub core_selector_number: u8,
+}
+
+/// Block data for this teyrchain.
+#[derive(Default, Clone, Encode, Decode, Debug)]
+pub struct BlockData {
+	/// The state
+	pub state: GraveyardState,
+	/// The number of tombstones to erect per iteration. For each tombstone placed
+	/// a hash operation is performed as CPU burn.
+	pub tombstones: u64,
+	/// The number of iterations to perform.
+	pub iterations: u32,
+	/// Whether or not to emit the experimental ApprovedPeer UMP signal.
+	pub experimental_send_approved_peer: bool,
+}
+
+pub fn hash_state(state: &GraveyardState) -> [u8; 32] {
+	keccak256(state.encode().as_slice())
+}
+
+/// Executes all graveyard transactions in the block.
+pub fn execute_transaction(mut block_data: BlockData) -> GraveyardState {
+	let graveyard_size = block_data.state.graveyard.len();
+
+	for _ in 0..block_data.iterations {
+		for _ in 0..block_data.tombstones {
+			block_data.state.graveyard[block_data.state.index as usize] =
+				block_data.state.graveyard[block_data.state.index as usize].wrapping_add(1);
+
+			block_data.state.index =
+				((block_data.state.index.saturating_add(1)) as usize % graveyard_size) as u64;
+		}
+		// Chain hash the seals and burn CPU.
+		block_data.state.seal = hash_state(&block_data.state);
+	}
+	block_data.state.core_selector_number = block_data.state.core_selector_number.wrapping_add(1);
+
+	block_data.state
+}
+
+/// Start state mismatched with parent header's state hash.
+#[derive(Debug)]
+pub struct StateMismatch;
+
+/// Execute a block body on top of given parent head, producing new parent head
+/// and new state if valid.
+pub fn execute(
+	parent_hash: [u8; 32],
+	parent_head: HeadData,
+	block_data: BlockData,
+) -> Result<(HeadData, GraveyardState, UpwardMessages), StateMismatch> {
+	assert_eq!(parent_hash, parent_head.hash());
+
+	if hash_state(&block_data.state) != parent_head.post_state {
+		log::debug!(
+			target: LOG_TARGET,
+			"state has diff vs head: {:?} vs {:?}",
+			hash_state(&block_data.state),
+			parent_head.post_state,
+		);
+		return Err(StateMismatch);
+	}
+
+	let mut upward_messages: UpwardMessages = Default::default();
+	upward_messages.force_push(UMP_SEPARATOR);
+	upward_messages.force_push(
+		UMPSignal::SelectCore(
+			CoreSelector(block_data.state.core_selector_number),
+			ClaimQueueOffset(DEFAULT_CLAIM_QUEUE_OFFSET),
+		)
+		.encode(),
+	);
+
+	if block_data.experimental_send_approved_peer {
+		upward_messages
+			.force_push(UMPSignal::ApprovedPeer(alloc::vec![1, 2, 3].try_into().unwrap()).encode());
+	}
+
+	// We need to clone the block data as the fn will mutate it's state.
+	let new_state = execute_transaction(block_data.clone());
+
+	Ok((
+		HeadData {
+			number: parent_head.number + 1,
+			parent_hash,
+			post_state: hash_state(&new_state),
+		},
+		new_state,
+		upward_messages,
+	))
+}
@@ -0,0 +1,47 @@
+// Copyright (C) Parity Technologies (UK) Ltd.
+// This file is part of Pezkuwi.
+
+// Pezkuwi 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.
+
+// Pezkuwi 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 Pezkuwi.  If not, see <http://www.gnu.org/licenses/>.
+
+//! WASM validation for the `Undying` teyrchain.
+
+use crate::{BlockData, HeadData};
+use codec::{Decode, Encode};
+use pezkuwi_teyrchain_primitives::primitives::{HeadData as GenericHeadData, ValidationResult};
+
+#[no_mangle]
+pub extern "C" fn validate_block(params: *const u8, len: usize) -> u64 {
+	let params = unsafe { pezkuwi_teyrchain_primitives::load_params(params, len) };
+	let parent_head =
+		HeadData::decode(&mut &params.parent_head.0[..]).expect("invalid parent head format.");
+
+	let mut block_data =
+		BlockData::decode(&mut &params.block_data.0[..]).expect("invalid block data format.");
+
+	let parent_hash = crate::keccak256(&params.parent_head.0[..]);
+
+	let (new_head, _, upward_messages) =
+		crate::execute(parent_hash, parent_head, block_data).expect("Executes block");
+
+	pezkuwi_teyrchain_primitives::write_result(&ValidationResult {
+		head_data: GenericHeadData(new_head.encode()),
+		new_validation_code: None,
+		upward_messages,
+		horizontal_messages: alloc::vec::Vec::new()
+			.try_into()
+			.expect("empty vec fits within bounds"),
+		processed_downward_messages: 0,
+		hrmp_watermark: params.relay_parent_number,
+	})
+}