tests.rs 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457
  1. /* This file is part of DarkFi (https://dark.fi)
  2. *
  3. * Copyright (C) 2020-2026 Dyne.org foundation
  4. *
  5. * This program is free software: you can redistribute it and/or modify
  6. * it under the terms of the GNU Affero General Public License as
  7. * published by the Free Software Foundation, either version 3 of the
  8. * License, or (at your option) any later version.
  9. *
  10. * This program is distributed in the hope that it will be useful,
  11. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  13. * GNU Affero General Public License for more details.
  14. *
  15. * You should have received a copy of the GNU Affero General Public License
  16. * along with this program. If not, see <https://www.gnu.org/licenses/>.
  17. */
  18. // cargo test --release --features=event-graph --lib eventgraph_propagation -- --include-ignored
  19. use std::{collections::HashMap, slice, sync::Arc};
  20. use rand::{prelude::SliceRandom, rngs::ThreadRng};
  21. use sled_overlay::sled;
  22. use smol::{channel, future, Executor};
  23. use tracing::{info, warn};
  24. use url::Url;
  25. use crate::{
  26. event_graph::{
  27. proto::{EventPut, ProtocolEventGraph},
  28. Event, EventGraph,
  29. },
  30. net::{session::SESSION_DEFAULT, settings::NetworkProfile, P2p, Settings},
  31. system::sleep,
  32. util::logger::{setup_test_logger, Level},
  33. };
  34. // Number of nodes to spawn and number of peers each node connects to
  35. const N_NODES: usize = 5;
  36. const N_CONNS: usize = 2;
  37. //const N_NODES: usize = 50;
  38. //const N_CONNS: usize = N_NODES / 3;
  39. fn init_logger() {
  40. let ignored_targets = [
  41. "sled",
  42. "net::protocol_ping",
  43. "net::channel::subscribe_stop()",
  44. "net::hosts",
  45. "net::session",
  46. "net::message_subscriber",
  47. "net::protocol_address",
  48. "net::protocol_version",
  49. "net::protocol_registry",
  50. "net::channel::send()",
  51. "net::channel::start()",
  52. "net::channel::subscribe_msg()",
  53. "net::channel::main_receive_loop()",
  54. "net::tcp",
  55. ];
  56. // We check this error so we can execute same file tests in parallel,
  57. // otherwise second one fails to init logger here.
  58. if setup_test_logger(
  59. &ignored_targets,
  60. false,
  61. Level::Info,
  62. //Level::Verbose,
  63. //Level::Debug,
  64. //Level::Tracing,
  65. )
  66. .is_err()
  67. {
  68. warn!(target: "test_harness", "Logger already initialized");
  69. }
  70. }
  71. async fn spawn_node(
  72. inbound_addrs: Vec<Url>,
  73. peers: Vec<Url>,
  74. ex: Arc<Executor<'static>>,
  75. ) -> Arc<EventGraph> {
  76. let mut profiles = HashMap::new();
  77. profiles.insert(
  78. "tcp".to_string(),
  79. NetworkProfile { outbound_connect_timeout: 2, ..Default::default() },
  80. );
  81. let settings = Settings {
  82. localnet: true,
  83. inbound_addrs,
  84. outbound_connections: 0,
  85. inbound_connections: usize::MAX,
  86. peers,
  87. active_profiles: vec!["tcp".to_string()],
  88. profiles,
  89. ..Default::default()
  90. };
  91. let p2p = P2p::new(settings, ex.clone()).await.unwrap();
  92. let sled_db = sled::Config::new().temporary(true).open().unwrap();
  93. let event_graph =
  94. EventGraph::new(p2p.clone(), sled_db, "/tmp".into(), false, "dag", 1, ex.clone())
  95. .await
  96. .unwrap();
  97. *event_graph.synced.write().await = true;
  98. let event_graph_ = event_graph.clone();
  99. // Register the P2P protocols
  100. let registry = p2p.protocol_registry();
  101. registry
  102. .register(SESSION_DEFAULT, move |channel, _| {
  103. let event_graph_ = event_graph_.clone();
  104. async move { ProtocolEventGraph::init(event_graph_, channel).await.unwrap() }
  105. })
  106. .await;
  107. event_graph
  108. }
  109. async fn bootstrap_nodes(
  110. peer_indexes: &[usize],
  111. starting_port: usize,
  112. rng: &mut ThreadRng,
  113. ex: Arc<Executor<'static>>,
  114. ) -> Vec<Arc<EventGraph>> {
  115. let mut eg_instances = vec![];
  116. // Initialize the nodes
  117. for i in 0..N_NODES {
  118. // Everyone will connect to N_CONNS random peers.
  119. let mut peer_indexes_copy = peer_indexes.to_owned();
  120. peer_indexes_copy.remove(i);
  121. let peer_indexes_to_connect: Vec<_> =
  122. peer_indexes_copy.choose_multiple(rng, N_CONNS).collect();
  123. let mut peers = vec![];
  124. for peer_index in peer_indexes_to_connect {
  125. let port = starting_port + peer_index;
  126. peers.push(Url::parse(&format!("tcp://127.0.0.1:{port}")).unwrap());
  127. }
  128. let event_graph = spawn_node(
  129. vec![Url::parse(&format!("tcp://127.0.0.1:{}", starting_port + i)).unwrap()],
  130. peers,
  131. ex.clone(),
  132. )
  133. .await;
  134. eg_instances.push(event_graph);
  135. }
  136. // Start the P2P network
  137. for eg in eg_instances.iter() {
  138. eg.p2p.clone().start().await.unwrap();
  139. }
  140. info!("Waiting 5s until all peers connect");
  141. sleep(5).await;
  142. eg_instances
  143. }
  144. async fn assert_dags(eg_instances: &[Arc<EventGraph>], expected_len: usize, rng: &mut ThreadRng) {
  145. let random_node = eg_instances.choose(rng).unwrap();
  146. let last_layer_tips =
  147. random_node.unreferenced_tips.read().await.last_key_value().unwrap().1.clone();
  148. for (i, eg) in eg_instances.iter().enumerate() {
  149. let node_last_layer_tips =
  150. eg.unreferenced_tips.read().await.last_key_value().unwrap().1.clone();
  151. assert!(
  152. eg.dag.len() == expected_len,
  153. "Node {i}, expected {expected_len} events, have {}",
  154. eg.dag.len()
  155. );
  156. assert_eq!(
  157. node_last_layer_tips, last_layer_tips,
  158. "Node {i} contains malformed unreferenced tips"
  159. );
  160. }
  161. }
  162. macro_rules! test_body {
  163. ($real_call:ident) => {
  164. init_logger();
  165. let ex = Arc::new(Executor::new());
  166. let ex_ = ex.clone();
  167. let (signal, shutdown) = channel::unbounded::<()>();
  168. // Run a thread for each node.
  169. easy_parallel::Parallel::new()
  170. .each(0..N_NODES, |_| future::block_on(ex.run(shutdown.recv())))
  171. .finish(|| {
  172. future::block_on(async {
  173. $real_call(ex_).await;
  174. drop(signal);
  175. })
  176. });
  177. };
  178. }
  179. #[test]
  180. fn eventgraph_propagation() {
  181. test_body!(eventgraph_propagation_real);
  182. }
  183. async fn eventgraph_propagation_real(ex: Arc<Executor<'static>>) {
  184. let mut rng = rand::thread_rng();
  185. let peer_indexes: Vec<usize> = (0..N_NODES).collect();
  186. // Bootstrap nodes
  187. let mut eg_instances = bootstrap_nodes(&peer_indexes, 13200, &mut rng, ex.clone()).await;
  188. // Grab genesis event
  189. let random_node = eg_instances.choose(&mut rng).unwrap();
  190. let (id, _) = random_node.dag.last().unwrap().unwrap();
  191. let genesis_event_id = blake3::Hash::from_bytes((&id as &[u8]).try_into().unwrap());
  192. // =========================================
  193. // 1. Assert that everyone's DAG is the same
  194. // =========================================
  195. assert_dags(&eg_instances, 1, &mut rng).await;
  196. // ==========================================
  197. // 2. Create an event in one node and publish
  198. // ==========================================
  199. let random_node = eg_instances.choose(&mut rng).unwrap();
  200. let event = Event::new(vec![1, 2, 3, 4], random_node).await;
  201. assert!(event.parents.contains(&genesis_event_id));
  202. // The node adds it to their DAG, on layer 1.
  203. let event_id = random_node.dag_insert(slice::from_ref(&event)).await.unwrap()[0];
  204. let tips_layers = random_node.unreferenced_tips.read().await;
  205. // Since genesis was referenced, its layer (0) have been removed
  206. assert_eq!(tips_layers.len(), 1);
  207. assert!(tips_layers.last_key_value().unwrap().1.get(&event_id).is_some());
  208. drop(tips_layers);
  209. info!("Broadcasting event {event_id}");
  210. random_node.p2p.broadcast(&EventPut(event)).await;
  211. info!("Waiting 5s for event propagation");
  212. sleep(5).await;
  213. // ====================================================
  214. // 3. Assert that everyone has the new event in the DAG
  215. // ====================================================
  216. assert_dags(&eg_instances, 2, &mut rng).await;
  217. // ==============================================================
  218. // 4. Create multiple events on a node and broadcast the last one
  219. // The `EventPut` logic should manage to fetch all of them,
  220. // provided that the last one references the earlier ones.
  221. // ==============================================================
  222. let random_node = eg_instances.choose(&mut rng).unwrap();
  223. let event0 = Event::new(vec![1, 2, 3, 4, 0], random_node).await;
  224. let event0_id = random_node.dag_insert(slice::from_ref(&event0)).await.unwrap()[0];
  225. let event1 = Event::new(vec![1, 2, 3, 4, 1], random_node).await;
  226. let event1_id = random_node.dag_insert(slice::from_ref(&event1)).await.unwrap()[0];
  227. let event2 = Event::new(vec![1, 2, 3, 4, 2], random_node).await;
  228. let event2_id = random_node.dag_insert(slice::from_ref(&event2)).await.unwrap()[0];
  229. // Genesis event + event from 2. + upper 3 events (layer 4)
  230. assert_eq!(random_node.dag.len(), 5);
  231. let tips_layers = random_node.unreferenced_tips.read().await;
  232. assert_eq!(tips_layers.len(), 1);
  233. assert!(tips_layers.get(&4).unwrap().get(&event2_id).is_some());
  234. drop(tips_layers);
  235. let event_chain =
  236. vec![(event0_id, event0.parents), (event1_id, event1.parents), (event2_id, event2.parents)];
  237. info!("Broadcasting event {event2_id}");
  238. info!("Event chain: {event_chain:#?}");
  239. random_node.p2p.broadcast(&EventPut(event2)).await;
  240. info!("Waiting 5s for event propagation");
  241. sleep(5).await;
  242. // ==========================================
  243. // 5. Assert that everyone has all the events
  244. // ==========================================
  245. assert_dags(&eg_instances, 5, &mut rng).await;
  246. // ===========================================
  247. // 6. Create multiple events on multiple nodes
  248. // ===========================================
  249. // node 1
  250. // =======
  251. let node1 = eg_instances.choose(&mut rng).unwrap();
  252. let event0_1 = Event::new(vec![1, 2, 3, 4, 3], node1).await;
  253. node1.dag_insert(slice::from_ref(&event0_1)).await.unwrap();
  254. node1.p2p.broadcast(&EventPut(event0_1)).await;
  255. let event1_1 = Event::new(vec![1, 2, 3, 4, 4], node1).await;
  256. node1.dag_insert(slice::from_ref(&event1_1)).await.unwrap();
  257. node1.p2p.broadcast(&EventPut(event1_1)).await;
  258. let event2_1 = Event::new(vec![1, 2, 3, 4, 5], node1).await;
  259. node1.dag_insert(slice::from_ref(&event2_1)).await.unwrap();
  260. node1.p2p.broadcast(&EventPut(event2_1)).await;
  261. // =======
  262. // node 2
  263. // =======
  264. let node2 = eg_instances.choose(&mut rng).unwrap();
  265. let event0_2 = Event::new(vec![1, 2, 3, 4, 6], node2).await;
  266. node2.dag_insert(slice::from_ref(&event0_2)).await.unwrap();
  267. node2.p2p.broadcast(&EventPut(event0_2)).await;
  268. let event1_2 = Event::new(vec![1, 2, 3, 4, 7], node2).await;
  269. node2.dag_insert(slice::from_ref(&event1_2)).await.unwrap();
  270. node2.p2p.broadcast(&EventPut(event1_2)).await;
  271. let event2_2 = Event::new(vec![1, 2, 3, 4, 8], node2).await;
  272. node2.dag_insert(slice::from_ref(&event2_2)).await.unwrap();
  273. node2.p2p.broadcast(&EventPut(event2_2)).await;
  274. // =======
  275. // node 3
  276. // =======
  277. let node3 = eg_instances.choose(&mut rng).unwrap();
  278. let event0_3 = Event::new(vec![1, 2, 3, 4, 9], node3).await;
  279. node3.dag_insert(slice::from_ref(&event0_3)).await.unwrap();
  280. node2.p2p.broadcast(&EventPut(event0_3)).await;
  281. let event1_3 = Event::new(vec![1, 2, 3, 4, 10], node3).await;
  282. node3.dag_insert(slice::from_ref(&event1_3)).await.unwrap();
  283. node2.p2p.broadcast(&EventPut(event1_3)).await;
  284. let event2_3 = Event::new(vec![1, 2, 3, 4, 11], node3).await;
  285. node3.dag_insert(slice::from_ref(&event2_3)).await.unwrap();
  286. node3.p2p.broadcast(&EventPut(event2_3)).await;
  287. info!("Waiting 5s for events propagation");
  288. sleep(5).await;
  289. // ==========================================
  290. // 7. Assert that everyone has all the events
  291. // ==========================================
  292. // 5 events from 2. and 4. + 9 events from 6. = 14
  293. assert_dags(&eg_instances, 14, &mut rng).await;
  294. // ============================================================
  295. // 8. Start a new node and try to sync the DAG from other peers
  296. // ============================================================
  297. {
  298. // Connect to N_CONNS random peers.
  299. let peer_indexes_to_connect: Vec<_> =
  300. peer_indexes.choose_multiple(&mut rng, N_CONNS).collect();
  301. let mut peers = vec![];
  302. for peer_index in peer_indexes_to_connect {
  303. let port = 13200 + peer_index;
  304. peers.push(Url::parse(&format!("tcp://127.0.0.1:{port}")).unwrap());
  305. }
  306. let event_graph = spawn_node(
  307. vec![Url::parse(&format!("tcp://127.0.0.1:{}", 13200 + N_NODES + 1)).unwrap()],
  308. peers,
  309. ex.clone(),
  310. )
  311. .await;
  312. eg_instances.push(event_graph.clone());
  313. event_graph.p2p.clone().start().await.unwrap();
  314. info!("Waiting 5s for new node connection");
  315. sleep(5).await;
  316. event_graph.dag_sync().await.unwrap()
  317. }
  318. // ============================================================
  319. // 9. Assert the new synced DAG has the same contents as others
  320. // ============================================================
  321. // 5 events from 2. and 4. + 9 events from 6. = 14
  322. assert_dags(&eg_instances, 14, &mut rng).await;
  323. // Stop the P2P network
  324. for eg in eg_instances.iter() {
  325. eg.p2p.clone().stop().await;
  326. }
  327. }
  328. #[test]
  329. #[ignore]
  330. fn eventgraph_chaotic_propagation() {
  331. test_body!(eventgraph_chaotic_propagation_real);
  332. }
  333. async fn eventgraph_chaotic_propagation_real(ex: Arc<Executor<'static>>) {
  334. let mut rng = rand::thread_rng();
  335. let peer_indexes: Vec<usize> = (0..N_NODES).collect();
  336. let n_events: usize = 100000;
  337. // Bootstrap nodes
  338. let mut eg_instances = bootstrap_nodes(&peer_indexes, 14200, &mut rng, ex.clone()).await;
  339. // =========================================
  340. // 1. Assert that everyone's DAG is the same
  341. // =========================================
  342. assert_dags(&eg_instances, 1, &mut rng).await;
  343. // ===========================================
  344. // 2. Create multiple events on multiple nodes
  345. for i in 0..n_events {
  346. let random_node = eg_instances.choose(&mut rng).unwrap();
  347. let event = Event::new(i.to_be_bytes().to_vec(), random_node).await;
  348. random_node.dag_insert(slice::from_ref(&event)).await.unwrap();
  349. random_node.p2p.broadcast(&EventPut(event)).await;
  350. }
  351. info!("Waiting 5s for events propagation");
  352. sleep(5).await;
  353. // ==========================================
  354. // 3. Assert that everyone has all the events
  355. // ==========================================
  356. assert_dags(&eg_instances, n_events + 1, &mut rng).await;
  357. // ============================================================
  358. // 4. Start a new node and try to sync the DAG from other peers
  359. // ============================================================
  360. {
  361. // Connect to N_CONNS random peers.
  362. let peer_indexes_to_connect: Vec<_> =
  363. peer_indexes.choose_multiple(&mut rng, N_CONNS).collect();
  364. let mut peers = vec![];
  365. for peer_index in peer_indexes_to_connect {
  366. let port = 14200 + peer_index;
  367. peers.push(Url::parse(&format!("tcp://127.0.0.1:{port}")).unwrap());
  368. }
  369. let event_graph = spawn_node(
  370. vec![Url::parse(&format!("tcp://127.0.0.1:{}", 14200 + N_NODES + 1)).unwrap()],
  371. peers,
  372. ex.clone(),
  373. )
  374. .await;
  375. eg_instances.push(event_graph.clone());
  376. event_graph.p2p.clone().start().await.unwrap();
  377. info!("Waiting 5s for new node connection");
  378. sleep(5).await;
  379. event_graph.dag_sync().await.unwrap()
  380. }
  381. // ============================================================
  382. // 5. Assert the new synced DAG has the same contents as others
  383. // ============================================================
  384. assert_dags(&eg_instances, n_events + 1, &mut rng).await;
  385. // Stop the P2P network
  386. for eg in eg_instances.iter() {
  387. eg.p2p.clone().stop().await;
  388. }
  389. }