blvm-node 0.1.2

Bitcoin Commons BLVM: Minimal Bitcoin node implementation using blvm-protocol and blvm-consensus
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33

#![cfg(feature = "dandelion")]
use blvm_node::network::relay::RelayManager;
use blvm_protocol::Hash;

fn hash_from_u8(v: u8) -> Hash {
    [v; 32]
}

#[test]
fn stem_then_fluff_via_hop_limit() {
    // Create relay manager with dandelion enabled
    let mut policies = blvm_node::network::relay::RelayPolicies::default();
    policies.enable_dandelion = true;
    let mut relay = blvm_node::network::relay::RelayManager::with_policies(policies);
    let peers = vec!["p1".into(), "p2".into(), "p3".into()];

    // Configure Dandelion for deterministic behavior
    relay.set_dandelion_fluff_probability(0.0);
    // Set hop limit to 0 (first call starts stem with hops=0, second call checks hops >= 0 and fluffs)
    relay.set_dandelion_max_stem_hops(0);

    // Initialize path for current peer
    relay.initialize_dandelion_path("p1".into(), &peers);

    let tx = hash_from_u8(1);

    // First decision will start stem (hops=0) and return Some(next)
    let next = relay.relay_transaction_dandelion(tx, "p1".into(), &peers);
    assert!(next.is_some());
    // Second decision: hops=0 >= max_stem_hops=0, so should fluff and return None
    let next2 = relay.relay_transaction_dandelion(tx, "p1".into(), &peers);
    assert!(next2.is_none());
}