Remote delivery keeps a local causal anchor

This figure documents the historical i386 source baseline. Current native x86-64/AArch64 qualification is recorded separately; this is not an ELF64 or native SMP implementation diagram.

Full-size SVG
Remote delivery keeps a local causal anchor Node A sends target actor, payload, sender node/actor, remote causal ID, Lamport clock and summary hash through the encrypted mesh. Node B decrypts and dispatches, merges the remote clock and anchors the remote cause, then attempts local mailbox enqueue. A later receive links local delivery ancestry. Unknown/full destinations fail; bounded retries and retained proofs are not exactly-once delivery. a->a1 t->t1 b->b1 a1->a2 a1->t1 1  actor message + cause a2->a3 a3->a4 a4->a5 t1->t2 t2->t3 t2->b2 2  decrypt + dispatch t3->t4 t4->t5 b1->b2 b2->b3 3  merge remote clock; anchor remote cause b3->b4 4  enqueue local mailbox or record delivery failure b4->b5 5  local receive event links delivery ancestry a Node A · federation t Encrypted mesh b Node B · federation a1 a2 a3 a4 a5 t1 t2 t3 t4 t5 b1 b2 b3 b4 b5 note Origin: node + actor + causal ID Lamport clock + summary hash Bounded retry ≠ exactly-once delivery
Remote delivery keeps a local causal anchor Node A sends target actor, payload, sender node/actor, remote causal ID, Lamport clock and summary hash through the encrypted mesh. Node B decrypts and dispatches, merges the remote clock and anchors the remote cause, then attempts local mailbox enqueue. A later receive links local delivery ancestry. Unknown/full destinations fail; bounded retries and retained proofs are not exactly-once delivery. a->a1 t->t1 b->b1 a1->a2 a1->t1 1 actor message + cause a2->a3 a3->a4 a4->a5 t1->t2 t2->t3 t2->b2 2 decrypt + dispatch t3->t4 t4->t5 b1->b2 b2->b3 3 merge remote clock; anchor remote cause b3->b4 4 enqueue local mailbox or record delivery failure b4->b5 5 local receive event links delivery ancestry a Node A · federation t Encrypted mesh b Node B · federation a1 a2 a3 a4 a5 t1 t2 t3 t4 t5 b1 b2 b3 b4 b5 note Origin: node + actor + causal ID Lamport clock + summary hash Bounded retry ≠ exactly-once delivery

A transported message carries enough origin context to connect remote ancestry to local delivery.

Text equivalent and source references
  • Node A sends target actor, payload, sender node/actor, remote causal ID, Lamport clock and summary hash through the encrypted mesh.
  • Node B decrypts and dispatches, merges the remote clock and anchors the remote cause, then attempts local mailbox enqueue. A later receive links local delivery ancestry. Unknown/full destinations fail; bounded retries and retained proofs are not exactly-once delivery.

Sequence diagram. Source paths refer to the atlas baseline; the kernel checkout is private.

  • include/federation.h · federation_msg_t, retry limits
  • kernel/graph/federation.c · federation receive loop
  • kernel/graph/actor.c · actor_send_remote, actor_recv

Download SVG · Editable DOT