diff --git a/src/node/dataplane/peer_actions.rs b/src/node/dataplane/peer_actions.rs
index 4d801d0..ec86f8c 100644
--- a/src/node/dataplane/peer_actions.rs
+++ b/src/node/dataplane/peer_actions.rs
@@ -102,7 +102,6 @@ impl Node {
     /// `index_allocator` are **distinct `Node` fields**, so the collect below is a
     /// disjoint two-field borrow the checker accepts; once the actions are
     /// collected both borrows drop and the executor runs against `&mut self`.
-    #[allow(dead_code)]
     pub(in crate::node) async fn advance_peer_machine(
         &mut self,
         link: LinkId,
@@ -125,7 +124,6 @@ impl Node {
     /// executor stays a single flat future (no boxing) and the emitted order is
     /// preserved. `PromoteToActive` (deferred) will feed its resolution back into
     /// the machine and fold follow-up actions onto this same queue.
-    #[allow(dead_code)]
     pub(in crate::node) async fn execute_peer_actions(
         &mut self,
         link: LinkId,
diff --git a/src/node/handlers/rekey.rs b/src/node/handlers/rekey.rs
index 43c4d52..d4de118 100644
--- a/src/node/handlers/rekey.rs
+++ b/src/node/handlers/rekey.rs
@@ -113,7 +113,7 @@ impl Node {
         self.advance_peer_machine(
             link,
             PeerEvent::RekeyConsume { action },
-            Self::now_ms(),
+            ambient.now_ms,
             &ambient,
         )
         .await;