fips-core 0.3.82

Reusable FIPS mesh, endpoint, transport, and protocol library
Documentation
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
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
use super::*;

impl Node {
    pub(in crate::node) async fn try_peer_addresses(
        &mut self,
        peer_config: &PeerConfig,
        peer_identity: PeerIdentity,
        allow_bootstrap_nat: bool,
    ) -> Result<(), NodeError> {
        let peer_node_addr = *peer_identity.node_addr();
        if self.peers.contains_key(&peer_node_addr) {
            debug!(
                npub = %peer_config.npub,
                "Peer already exists, skipping address attempts"
            );
            return Ok(());
        }

        let candidates = self.peer_address_candidates(peer_config).await;

        if candidates.is_empty() {
            if allow_bootstrap_nat && self.request_nostr_bootstrap(peer_config).await {
                return Ok(());
            }
            return Err(NodeError::NoTransportForType(format!(
                "no addresses known for {}",
                peer_config.npub
            )));
        }

        if self
            .attempt_peer_address_list(peer_config, peer_identity, allow_bootstrap_nat, &candidates)
            .await
            .is_ok()
        {
            if allow_bootstrap_nat {
                self.request_nostr_bootstrap(peer_config).await;
            }
            return Ok(());
        }

        if allow_bootstrap_nat && self.request_nostr_bootstrap(peer_config).await {
            return Ok(());
        }

        Err(NodeError::NoTransportForType(format!(
            "no operational transport for any of {}'s addresses",
            peer_config.npub
        )))
    }

    pub(super) async fn try_active_peer_alternative_addresses(
        &mut self,
        peer_config: &PeerConfig,
        peer_identity: PeerIdentity,
        allow_same_path_refresh: bool,
    ) -> Result<bool, NodeError> {
        let peer_node_addr = *peer_identity.node_addr();
        let mut candidates = self.peer_address_candidates(peer_config).await;
        let same_path_refresh_needed = allow_same_path_refresh
            && self.peers.get(&peer_node_addr).is_some_and(|peer| {
                !peer.is_healthy() || self.active_peer_needs_same_path_refresh(&peer_node_addr)
            });
        if same_path_refresh_needed
            && let Some(candidate) = self.active_peer_current_udp_candidate(&peer_node_addr)
            && !candidates.iter().any(|existing| {
                existing.transport == candidate.transport && existing.addr == candidate.addr
            })
        {
            candidates.push(candidate);
            Self::sort_peer_address_candidates(&mut candidates);
        }
        let should_try_nostr =
            self.active_peer_should_keep_direct_retry(&peer_node_addr, peer_config);

        if candidates.is_empty() {
            if should_try_nostr && self.request_nostr_bootstrap(peer_config).await {
                return Ok(true);
            }
            return Err(NodeError::NoTransportForType(format!(
                "no addresses known for {}",
                peer_config.npub
            )));
        }

        let alternatives: Vec<_> = candidates
            .into_iter()
            .filter(|addr| {
                same_path_refresh_needed
                    || !self.active_peer_matches_candidate(&peer_node_addr, addr)
            })
            .collect();

        if alternatives.is_empty() {
            if should_try_nostr && self.request_nostr_bootstrap(peer_config).await {
                return Ok(true);
            }
            return Ok(false);
        }

        let needs_separate_nostr_attempt = should_try_nostr
            && !alternatives
                .iter()
                .any(|addr| addr.transport == "udp" && addr.addr.eq_ignore_ascii_case("nat"));
        let address_result = self
            .attempt_peer_address_list(peer_config, peer_identity, true, &alternatives)
            .await;
        let nostr_attempted =
            needs_separate_nostr_attempt && self.request_nostr_bootstrap(peer_config).await;

        match address_result {
            Ok(()) => Ok(true),
            Err(err) if nostr_attempted => {
                debug!(
                    npub = %peer_config.npub,
                    error = %err,
                    "Static active-peer direct-path alternatives failed; Nostr traversal still queued"
                );
                Ok(true)
            }
            Err(err) => Err(err),
        }
    }

    pub(in crate::node) async fn peer_address_candidates(
        &self,
        peer_config: &PeerConfig,
    ) -> Vec<PeerAddress> {
        // Merge every candidate from every source we have for this peer.
        // Explicitly high-priority configured addresses keep first shot, while
        // ordinary static hints share priority with freshly fetched overlay
        // adverts so freshness can break ties after peers roam.
        let static_addresses = self.static_peer_addresses(peer_config);
        let overlay_addresses = self
            .nostr_peer_fallback_addresses(peer_config, &static_addresses)
            .await;

        let mut candidates = Vec::with_capacity(overlay_addresses.len() + static_addresses.len());
        for addr in overlay_addresses.into_iter().chain(static_addresses) {
            if !candidates.iter().any(|existing: &PeerAddress| {
                existing.transport == addr.transport && existing.addr == addr.addr
            }) {
                candidates.push(addr);
            }
        }

        Self::sort_peer_address_candidates(&mut candidates);

        candidates
    }

    pub(super) fn sort_peer_address_candidates(candidates: &mut [PeerAddress]) {
        // Stable sort: explicit priority is the contract, and freshness breaks
        // ties inside one priority tier. Ordinary configured endpoints are
        // hints, not authoritative paths, so fresh overlay/recent candidates can
        // win when priorities match.
        candidates.sort_by(|a, b| {
            if a.priority != b.priority {
                return a.priority.cmp(&b.priority);
            }
            match (a.seen_at_ms, b.seen_at_ms) {
                (Some(a_ts), Some(b_ts)) => b_ts.cmp(&a_ts),
                (Some(_), None) => std::cmp::Ordering::Less,
                (None, Some(_)) => std::cmp::Ordering::Greater,
                (None, None) => std::cmp::Ordering::Equal,
            }
        });
    }

    pub(super) fn active_peer_matches_any_candidate(
        &self,
        peer_node_addr: &NodeAddr,
        candidates: &[PeerAddress],
    ) -> bool {
        candidates
            .iter()
            .any(|candidate| self.active_peer_matches_candidate(peer_node_addr, candidate))
    }

    pub(in crate::node) fn active_peer_candidate_is_fresh_enough_to_skip(
        &self,
        peer_node_addr: &NodeAddr,
        candidates: &[PeerAddress],
    ) -> bool {
        if !self
            .peers
            .get(peer_node_addr)
            .is_some_and(|peer| peer.can_send())
        {
            return false;
        }
        if !self.active_peer_matches_any_candidate(peer_node_addr, candidates) {
            return false;
        }
        !self.active_peer_needs_same_path_refresh(peer_node_addr)
    }

    pub(in crate::node) fn active_peer_should_keep_direct_retry(
        &self,
        peer_node_addr: &NodeAddr,
        peer_config: &PeerConfig,
    ) -> bool {
        if !peer_config.auto_reconnect {
            return false;
        }

        let Some(peer) = self.peers.get(peer_node_addr) else {
            return false;
        };

        if self.session_direct_path_degradation_active(peer_node_addr, Self::now_ms()) {
            return true;
        }

        let static_addresses = self.static_peer_addresses(peer_config);
        if !static_addresses.is_empty() {
            let Some(peer) = self.peers.get(peer_node_addr) else {
                return true;
            };
            if self.active_peer_has_fresh_endpoint_data_liveness(peer_node_addr) {
                return false;
            }
            if peer
                .transport_id()
                .is_some_and(|transport_id| self.bootstrap_transports.contains(&transport_id))
            {
                return !self.active_peer_has_fresh_endpoint_data_liveness(peer_node_addr);
            }
            let same_path_refresh_needed = self.active_peer_needs_same_path_refresh(peer_node_addr);
            if !self.active_peer_matches_any_candidate(peer_node_addr, &static_addresses)
                && peer.is_healthy()
                && peer.can_send()
                && !same_path_refresh_needed
            {
                return false;
            }
            if peer.can_send() && !same_path_refresh_needed {
                return false;
            }
            return !self
                .active_peer_candidate_is_fresh_enough_to_skip(peer_node_addr, &static_addresses);
        }

        if peer_config.npub.is_empty() {
            return false;
        }

        if !self.config.node.discovery.nostr.enabled
            || self.config.node.discovery.nostr.policy == NostrDiscoveryPolicy::Disabled
        {
            return false;
        }

        let Some(transport_id) = peer.transport_id() else {
            return true;
        };

        if self.bootstrap_transports.contains(&transport_id) {
            return self.active_peer_needs_same_path_refresh(peer_node_addr);
        }

        let Some(transport) = self.transports.get(&transport_id) else {
            return true;
        };

        if transport.transport_type().name != "udp" {
            return true;
        }

        self.active_peer_needs_same_path_refresh(peer_node_addr)
    }

    pub(in crate::node) fn clear_retry_unless_direct_refresh_needed(
        &mut self,
        peer_node_addr: &NodeAddr,
    ) {
        let keep_retry = self
            .retry_pending
            .get(peer_node_addr)
            .map(|state| state.peer_config.clone())
            .is_some_and(|peer_config| {
                self.active_peer_should_keep_direct_retry(peer_node_addr, &peer_config)
            });

        if !keep_retry {
            self.retry_pending.remove(peer_node_addr);
            return;
        }

        if self.active_peer_has_fresh_endpoint_data_liveness(peer_node_addr)
            || (!self.active_peer_uses_bootstrap_transport(peer_node_addr)
                && self.active_peer_has_fresh_link_liveness(peer_node_addr))
        {
            self.retry_pending.remove(peer_node_addr);
        }
    }

    pub(in crate::node) fn active_peer_has_fresh_endpoint_data_liveness(
        &self,
        peer_node_addr: &NodeAddr,
    ) -> bool {
        let Some(peer) = self.peers.get(peer_node_addr) else {
            return false;
        };
        if !peer.is_healthy() || !peer.can_send() {
            return false;
        }

        let now_ms = Self::now_ms();
        let fresh_after_ms = self.session_direct_path_exclusive_trust_timeout_ms();
        self.dataplane
            .min_fsp_data_rx_age_for_next_hop(peer_node_addr, now_ms)
            .is_some_and(|age_ms| age_ms <= fresh_after_ms)
    }

    pub(in crate::node) fn active_peer_has_fresh_link_liveness(
        &self,
        peer_node_addr: &NodeAddr,
    ) -> bool {
        let Some(peer) = self.peers.get(peer_node_addr) else {
            return false;
        };
        if !peer.is_healthy() || !peer.can_send() {
            return false;
        }

        let now_ms = Self::now_ms();
        let now = std::time::Instant::now();
        let fresh_after_ms = self.session_direct_path_exclusive_trust_timeout_ms();
        peer.idle_time(now_ms) <= fresh_after_ms
            || self
                .dataplane
                .fmp_link_metrics(peer_node_addr, now)
                .and_then(|metrics| metrics.srtt_age_ms)
                .is_some_and(|age_ms| age_ms <= fresh_after_ms)
            || self
                .dataplane
                .min_fsp_rx_age_for_next_hop(peer_node_addr, now_ms)
                .is_some_and(|age_ms| age_ms <= fresh_after_ms)
            || self
                .dataplane
                .min_fsp_data_rx_age_for_next_hop(peer_node_addr, now_ms)
                .is_some_and(|age_ms| age_ms <= fresh_after_ms)
    }

    pub(in crate::node) fn active_peer_uses_bootstrap_transport(
        &self,
        peer_node_addr: &NodeAddr,
    ) -> bool {
        self.peers
            .get(peer_node_addr)
            .and_then(|peer| peer.transport_id())
            .is_some_and(|transport_id| self.bootstrap_transports.contains(&transport_id))
    }

    pub(in crate::node) fn active_peer_needs_same_path_refresh(
        &self,
        peer_node_addr: &NodeAddr,
    ) -> bool {
        let Some(peer) = self.peers.get(peer_node_addr) else {
            return false;
        };
        let now_ms = Self::now_ms();
        if self
            .dataplane
            .any_fsp_recent_outbound_without_inbound_for_next_hop(
                peer_node_addr,
                now_ms,
                self.session_direct_path_exclusive_trust_timeout_ms(),
            )
        {
            return true;
        }
        let stale_after_ms = self
            .config
            .node
            .heartbeat_interval_secs
            .saturating_mul(1000)
            .max(1000);
        let now = std::time::Instant::now();
        let mut inbound_quiet_ms = peer.idle_time(now_ms);
        inbound_quiet_ms = inbound_quiet_ms.min(
            self.dataplane
                .fmp_link_metrics(peer_node_addr, now)
                .and_then(|metrics| metrics.last_recv_age_ms)
                .unwrap_or_else(|| now_ms.saturating_sub(peer.authenticated_at())),
        );
        if let Some(session_age_ms) = self
            .dataplane
            .min_fsp_data_rx_age_for_next_hop(peer_node_addr, now_ms)
        {
            inbound_quiet_ms = inbound_quiet_ms.min(session_age_ms);
        }
        inbound_quiet_ms > stale_after_ms
    }

    pub(in crate::node) fn active_peer_current_udp_candidate(
        &self,
        peer_node_addr: &NodeAddr,
    ) -> Option<PeerAddress> {
        let peer = self.peers.get(peer_node_addr)?;
        let current_addr = peer.current_addr()?;
        if let Some(transport_id) = peer.transport_id() {
            if let Some(transport) = self.transports.get(&transport_id) {
                if transport.transport_type().name != "udp" {
                    return None;
                }
            } else if !self
                .transports
                .values()
                .any(|transport| transport.transport_type().name == "udp")
            {
                return None;
            }
        } else if !self
            .transports
            .values()
            .any(|transport| transport.transport_type().name == "udp")
        {
            return None;
        }
        let socket_addr = current_addr.as_str()?.parse::<SocketAddr>().ok()?;
        self.find_udp_transport_for_remote_addr(socket_addr)?;

        // A healthy current endpoint has already authenticated for this peer,
        // so prefer it over older overlay hints during idle refresh. If the
        // roster has explicit static UDP candidates and the current tuple is
        // only an observed source address, keep it probeable but let the
        // configured addresses race first; observed source ports can be
        // ephemeral across NAT and macOS roaming events.
        let current_is_configured = self
            .configured_path_priority(peer_node_addr, peer.transport_id()?, current_addr)
            .is_some();
        let has_configured_static_udp = self
            .configured_static_udp_path_for_peer(peer_node_addr, peer.transport_id()?)
            .is_some();
        if peer.is_healthy() && (!has_configured_static_udp || current_is_configured) {
            Some(
                PeerAddress::with_priority("udp", socket_addr.to_string(), 0)
                    .with_seen_at_ms(Self::now_ms()),
            )
        } else {
            Some(PeerAddress::with_priority(
                "udp",
                socket_addr.to_string(),
                u8::MAX,
            ))
        }
    }

    pub(super) fn active_peer_current_path_priority(
        &self,
        peer_node_addr: &NodeAddr,
        transport_id: TransportId,
        remote_addr: &TransportAddr,
    ) -> Option<u8> {
        let peer = self.peers.get(peer_node_addr)?;
        if !peer.is_healthy() {
            return None;
        }
        if peer.transport_id() != Some(transport_id) || peer.current_addr() != Some(remote_addr) {
            return None;
        }
        let transport = self.transports.get(&transport_id)?;
        (transport.transport_type().name == "udp").then_some(0)
    }

    pub(in crate::node) fn active_peer_matches_candidate(
        &self,
        peer_node_addr: &NodeAddr,
        candidate: &PeerAddress,
    ) -> bool {
        let Some(peer) = self.peers.get(peer_node_addr) else {
            return false;
        };
        let Some(current_addr) = peer.current_addr() else {
            return false;
        };
        if let Some(peer_transport_id) = peer.transport_id()
            && let Some((candidate_transport_id, candidate_addr)) =
                self.resolve_peer_address_for_match(candidate)
        {
            return peer_transport_id == candidate_transport_id && current_addr == &candidate_addr;
        }
        if candidate.transport == "udp"
            && candidate.addr.parse::<SocketAddr>().is_ok()
            && self
                .transports
                .values()
                .any(|transport| transport.transport_type().name == "udp")
        {
            return false;
        }
        if peer
            .transport_id()
            .map(|id| self.bootstrap_transports.contains(&id))
            .unwrap_or(false)
        {
            return false;
        }
        let current_addr = current_addr.to_string();
        let current_transport = peer
            .transport_id()
            .and_then(|id| self.transports.get(&id))
            .map(|transport| transport.transport_type().name);

        candidate.addr == current_addr
            && current_transport
                .map(|transport| transport == candidate.transport)
                .unwrap_or(true)
    }

    pub(super) fn configured_path_priority(
        &self,
        peer_node_addr: &NodeAddr,
        transport_id: TransportId,
        remote_addr: &TransportAddr,
    ) -> Option<u8> {
        self.configured_peer(peer_node_addr)?
            .addresses
            .iter()
            .filter_map(|candidate| {
                let (candidate_transport_id, candidate_addr) =
                    self.resolve_peer_address_for_match(candidate)?;
                (candidate_transport_id == transport_id && &candidate_addr == remote_addr)
                    .then_some(candidate.priority)
            })
            .min()
    }

    pub(in crate::node) fn configured_static_udp_path_for_peer(
        &self,
        peer_node_addr: &NodeAddr,
        transport_id: TransportId,
    ) -> Option<TransportAddr> {
        self.configured_peer(peer_node_addr)?
            .addresses
            .iter()
            .filter_map(|candidate| {
                if candidate.seen_at_ms.is_some()
                    || !candidate.transport.eq_ignore_ascii_case("udp")
                {
                    return None;
                }
                let (candidate_transport_id, candidate_addr) =
                    self.resolve_peer_address_for_match(candidate)?;
                (candidate_transport_id == transport_id)
                    .then_some((candidate.priority, candidate_addr))
            })
            .min_by_key(|(priority, _)| *priority)
            .map(|(_, addr)| addr)
    }

    pub(in crate::node) fn alternate_path_priority_allows_replace(
        &self,
        peer_node_addr: &NodeAddr,
        candidate_transport_id: TransportId,
        candidate_addr: &TransportAddr,
    ) -> bool {
        const UNKNOWN_PATH_PRIORITY: u16 = u8::MAX as u16 + 1;

        let Some(peer) = self.peers.get(peer_node_addr) else {
            return true;
        };
        let Some(current_transport_id) = peer.transport_id() else {
            return true;
        };
        let Some(current_addr) = peer.current_addr() else {
            return true;
        };

        let current_priority = self
            .configured_path_priority(peer_node_addr, current_transport_id, current_addr)
            .map(u16::from)
            .unwrap_or(UNKNOWN_PATH_PRIORITY);
        let candidate_priority = self
            .configured_path_priority(peer_node_addr, candidate_transport_id, candidate_addr)
            .map(u16::from)
            .unwrap_or(UNKNOWN_PATH_PRIORITY);

        if candidate_priority < current_priority {
            return true;
        }

        debug!(
            peer = %self.peer_display_name(peer_node_addr),
            current_transport_id = %current_transport_id,
            current_addr = %current_addr,
            current_priority,
            candidate_transport_id = %candidate_transport_id,
            candidate_addr = %candidate_addr,
            candidate_priority,
            "Suppressing lower-priority alternate path while current path remains healthy"
        );
        false
    }

    pub(in crate::node) fn authenticated_packet_path_allows_bookkeeping(
        &mut self,
        peer_node_addr: &NodeAddr,
        candidate_transport_id: TransportId,
        candidate_addr: &TransportAddr,
        now_ms: u64,
    ) -> bool {
        let Some(peer) = self.peers.get(peer_node_addr) else {
            return true;
        };

        if peer.transport_id() == Some(candidate_transport_id)
            && peer.current_addr() == Some(candidate_addr)
        {
            return true;
        }

        let current_path_sendable = peer.can_send();
        if !current_path_sendable
            || self.session_direct_path_blocks_direct_payload(peer_node_addr, now_ms)
        {
            return true;
        }

        if !self.alternate_path_priority_allows_replace(
            peer_node_addr,
            candidate_transport_id,
            candidate_addr,
        ) {
            return false;
        }

        debug!(
            peer = %self.peer_display_name(peer_node_addr),
            candidate_transport_id = %candidate_transport_id,
            candidate_addr = %candidate_addr,
            "Accepting authenticated direct-path rotation"
        );
        true
    }

    pub(in crate::node) fn active_peer_uses_recent_endpoint_path(
        &self,
        peer_node_addr: &NodeAddr,
        peer_config: &PeerConfig,
    ) -> bool {
        peer_config.addresses.iter().any(|addr| {
            addr.seen_at_ms.is_some() && self.active_peer_matches_candidate(peer_node_addr, addr)
        })
    }

    pub(in crate::node) fn active_peer_uses_traversal_path(
        &self,
        peer_node_addr: &NodeAddr,
        peer_config: &PeerConfig,
    ) -> bool {
        let via_bootstrap_transport = self
            .peers
            .get(peer_node_addr)
            .and_then(|peer| peer.transport_id())
            .map(|id| self.bootstrap_transports.contains(&id))
            .unwrap_or(false);

        via_bootstrap_transport
            || self.active_peer_uses_recent_endpoint_path(peer_node_addr, peer_config)
    }
}