|
|
@@ -16,7 +16,14 @@
|
|
|
* along with this program. If not, see <https://www.gnu.org/licenses/>.
|
|
|
*/
|
|
|
|
|
|
-use std::{sync::Arc, time::Instant};
|
|
|
+use std::{
|
|
|
+ sync::{
|
|
|
+ atomic::{AtomicBool, AtomicU32, Ordering},
|
|
|
+ Arc,
|
|
|
+ },
|
|
|
+ thread,
|
|
|
+ time::Instant,
|
|
|
+};
|
|
|
|
|
|
use darkfi::{util::time::Timestamp, Result};
|
|
|
use darkfi_sdk::{
|
|
|
@@ -24,13 +31,19 @@ use darkfi_sdk::{
|
|
|
pasta::{group::ff::FromUniformBytes, pallas},
|
|
|
};
|
|
|
use darkfi_serial::{async_trait, Encodable, SerialDecodable, SerialEncodable};
|
|
|
+use rand::{rngs::OsRng, Rng};
|
|
|
use randomx::{RandomXCache, RandomXDataset, RandomXFlags, RandomXVM};
|
|
|
|
|
|
+/// Constant genesis block string used as the previous block hash
|
|
|
const GENESIS: &[u8] = b"genesis";
|
|
|
+/// The target mining difficulty
|
|
|
const DIFFICULTY: usize = 1;
|
|
|
+/// The output length of the BLAKE2b hash in bytes
|
|
|
const HASH_LEN: usize = 32;
|
|
|
+/// The amount of blocks the main loop will mine until the program exits
|
|
|
+const N_BLOCKS: usize = 5;
|
|
|
|
|
|
-#[derive(SerialEncodable, SerialDecodable)]
|
|
|
+#[derive(Clone, SerialEncodable, SerialDecodable)]
|
|
|
struct Transaction(Vec<u8>);
|
|
|
|
|
|
impl Transaction {
|
|
|
@@ -41,7 +54,7 @@ impl Transaction {
|
|
|
}
|
|
|
}
|
|
|
|
|
|
-#[derive(SerialEncodable, SerialDecodable)]
|
|
|
+#[derive(Clone, SerialEncodable, SerialDecodable)]
|
|
|
struct BlockHeader {
|
|
|
nonce: u32,
|
|
|
previous_hash: blake2b_simd::Hash,
|
|
|
@@ -49,7 +62,7 @@ struct BlockHeader {
|
|
|
txtree: MerkleTree,
|
|
|
}
|
|
|
|
|
|
-#[derive(SerialEncodable, SerialDecodable)]
|
|
|
+#[derive(Clone, SerialEncodable, SerialDecodable)]
|
|
|
struct Block {
|
|
|
header: BlockHeader,
|
|
|
transactions: Vec<Transaction>,
|
|
|
@@ -87,7 +100,7 @@ fn main() -> Result<()> {
|
|
|
header: BlockHeader {
|
|
|
nonce: 0,
|
|
|
previous_hash: genesis_hash,
|
|
|
- timestamp: Timestamp::current_time(),
|
|
|
+ timestamp: Timestamp(1693213806),
|
|
|
txtree: MerkleTree::new(100),
|
|
|
},
|
|
|
transactions: vec![],
|
|
|
@@ -96,64 +109,107 @@ fn main() -> Result<()> {
|
|
|
let genesis_tx = Transaction(vec![1, 3, 3, 7]);
|
|
|
genesis_block.insert_tx(&genesis_tx)?;
|
|
|
|
|
|
- // Get initial PoW input
|
|
|
- let pow_input = genesis_block.hash()?;
|
|
|
-
|
|
|
- // This is single-threaded mining, but check darkrenaissance/RandomX/examples/
|
|
|
- // for multi-threaded ops.
|
|
|
- let miner_setup = Instant::now();
|
|
|
- let flags = RandomXFlags::default() | RandomXFlags::FULLMEM;
|
|
|
- let dataset = Arc::new(RandomXDataset::new(flags, pow_input.as_bytes(), 1).unwrap());
|
|
|
- let vm = RandomXVM::new_fast(flags, &dataset).unwrap();
|
|
|
+ let mut cur_block = genesis_block;
|
|
|
+ for i in 0..N_BLOCKS {
|
|
|
+ // Get the PoW input. The key changes with every mined block.
|
|
|
+ let pow_input = cur_block.hash()?;
|
|
|
+ println!("[{}] [MINER] PoW Input: {}", i, pow_input.to_hex());
|
|
|
+
|
|
|
+ let miner_setup = Instant::now();
|
|
|
+ let flags = RandomXFlags::default() | RandomXFlags::FULLMEM;
|
|
|
+ println!("[{}] [MINER] Initializing RandomX dataset...", i);
|
|
|
+ let dataset = Arc::new(RandomXDataset::new(flags, pow_input.as_bytes(), 1).unwrap());
|
|
|
+
|
|
|
+ // The miner creates a block
|
|
|
+ let mut miner_block = Block {
|
|
|
+ header: BlockHeader {
|
|
|
+ nonce: 0,
|
|
|
+ previous_hash: cur_block.hash()?,
|
|
|
+ timestamp: Timestamp::current_time(),
|
|
|
+ txtree: MerkleTree::new(100),
|
|
|
+ },
|
|
|
+ transactions: vec![],
|
|
|
+ };
|
|
|
+ let tx0 = Transaction(OsRng.gen::<[u8; 32]>().to_vec());
|
|
|
+ let tx1 = Transaction(OsRng.gen::<[u8; 32]>().to_vec());
|
|
|
+ miner_block.insert_tx(&tx0)?;
|
|
|
+ miner_block.insert_tx(&tx1)?;
|
|
|
+ println!("[{}] [MINER] Setup time: {:?}", i, miner_setup.elapsed());
|
|
|
+
|
|
|
+ // Multithreaded mining setup
|
|
|
+ let mining_time = Instant::now();
|
|
|
+ // Let's use 4 threads
|
|
|
+ const NUM_THREADS: u32 = 4;
|
|
|
+ let mut handles = vec![];
|
|
|
+ let found_block = Arc::new(AtomicBool::new(false));
|
|
|
+ let found_nonce = Arc::new(AtomicU32::new(0));
|
|
|
+ for t in 0..NUM_THREADS {
|
|
|
+ let mut block = miner_block.clone();
|
|
|
+ let found_block = Arc::clone(&found_block);
|
|
|
+ let found_nonce = Arc::clone(&found_nonce);
|
|
|
+ let dataset = dataset.clone();
|
|
|
+ handles.push(thread::spawn(move || {
|
|
|
+ println!("[{}] [MINER] Initializing RandomX VM #{}...", i, t);
|
|
|
+ block.header.nonce = t;
|
|
|
+ let vm = RandomXVM::new_fast(flags, &dataset).unwrap();
|
|
|
+ loop {
|
|
|
+ if found_block.load(Ordering::SeqCst) {
|
|
|
+ println!("[{}] [MINER] Block was found, thread #{} exiting", i, t);
|
|
|
+ break
|
|
|
+ }
|
|
|
+
|
|
|
+ let out_hash = vm.hash(block.hash().unwrap().as_bytes());
|
|
|
+ let mut success = true;
|
|
|
+ for idx in out_hash.iter().take(DIFFICULTY) {
|
|
|
+ if *idx != 0x00 {
|
|
|
+ success = false;
|
|
|
+ }
|
|
|
+ }
|
|
|
+
|
|
|
+ if success {
|
|
|
+ found_block.store(true, Ordering::SeqCst);
|
|
|
+ found_nonce.store(block.header.nonce, Ordering::SeqCst);
|
|
|
+ println!(
|
|
|
+ "[{}] [MINER] Thread #{} found block using nonce {}",
|
|
|
+ i, t, block.header.nonce
|
|
|
+ );
|
|
|
+ println!("[{}] [MINER] Block hash {}", i, block.hash().unwrap().to_hex(),);
|
|
|
+ break
|
|
|
+ }
|
|
|
+
|
|
|
+ // This means thread 0 will use nonces, 0, 4, 8, ...
|
|
|
+ // and thread 1 will use nonces, 1, 5, 9, ...
|
|
|
+ block.header.nonce += NUM_THREADS;
|
|
|
+ }
|
|
|
+ }))
|
|
|
+ }
|
|
|
|
|
|
- // The miner creates a block
|
|
|
- let mut miner_block = Block {
|
|
|
- header: BlockHeader {
|
|
|
- nonce: 0,
|
|
|
- previous_hash: genesis_block.hash()?,
|
|
|
- timestamp: Timestamp::current_time(),
|
|
|
- txtree: MerkleTree::new(100),
|
|
|
- },
|
|
|
- transactions: vec![],
|
|
|
- };
|
|
|
- let tx0 = Transaction(vec![0, 3, 1, 2]);
|
|
|
- let tx1 = Transaction(vec![1, 2, 1, 0]);
|
|
|
- miner_block.insert_tx(&tx0)?;
|
|
|
- miner_block.insert_tx(&tx1)?;
|
|
|
- println!("Miner setup time: {:?}", miner_setup.elapsed());
|
|
|
-
|
|
|
- // Melt the CPU
|
|
|
- let mining_time = Instant::now();
|
|
|
- loop {
|
|
|
- let out_hash = vm.hash(miner_block.hash()?.as_bytes());
|
|
|
- let mut success = true;
|
|
|
- for i in 0..DIFFICULTY {
|
|
|
- if out_hash[i] != 0x00 {
|
|
|
- success = false;
|
|
|
- }
|
|
|
+ // Melt the CPU
|
|
|
+ for handle in handles {
|
|
|
+ let _ = handle.join();
|
|
|
}
|
|
|
+ println!("[{}] [MINER] Mining time: {:?}", i, mining_time.elapsed());
|
|
|
+
|
|
|
+ // Set the valid mined nonce in the block that's broadcasted
|
|
|
+ miner_block.header.nonce = found_nonce.load(Ordering::SeqCst);
|
|
|
|
|
|
- if success {
|
|
|
- break
|
|
|
+ // Verify
|
|
|
+ let verifier_setup = Instant::now();
|
|
|
+ let flags = RandomXFlags::default();
|
|
|
+ let cache = RandomXCache::new(flags, pow_input.as_bytes()).unwrap();
|
|
|
+ let vm = RandomXVM::new(flags, &cache).unwrap();
|
|
|
+ println!("[{}] [VERIFIER] Setup time: {:?}", i, verifier_setup.elapsed());
|
|
|
+
|
|
|
+ let verification_time = Instant::now();
|
|
|
+ let out_hash = vm.hash(miner_block.hash()?.as_bytes());
|
|
|
+ for idx in out_hash.iter().take(DIFFICULTY) {
|
|
|
+ assert!(*idx == 0x00);
|
|
|
}
|
|
|
+ println!("[{}] [VERIFIER] Verification time: {:?}", i, verification_time.elapsed());
|
|
|
|
|
|
- miner_block.header.nonce += 1;
|
|
|
- }
|
|
|
- println!("Mining time: {:?}", mining_time.elapsed());
|
|
|
-
|
|
|
- // Verify
|
|
|
- let verifier_setup = Instant::now();
|
|
|
- let flags = RandomXFlags::default();
|
|
|
- let cache = RandomXCache::new(flags, pow_input.as_bytes()).unwrap();
|
|
|
- let vm = RandomXVM::new(flags, &cache).unwrap();
|
|
|
- println!("Verifier setup time: {:?}", verifier_setup.elapsed());
|
|
|
-
|
|
|
- let verification_time = Instant::now();
|
|
|
- let out_hash = vm.hash(miner_block.hash()?.as_bytes());
|
|
|
- for i in 0..DIFFICULTY {
|
|
|
- assert!(out_hash[i] == 0x00);
|
|
|
+ // The new block appends to the blockchain
|
|
|
+ cur_block = miner_block;
|
|
|
}
|
|
|
- println!("Verification time: {:?}", verification_time.elapsed());
|
|
|
|
|
|
Ok(())
|
|
|
}
|