Powered by OpenAIRE graph
Found an issue? Give us feedback
ZENODOarrow_drop_down
ZENODO
Preprint . 2026
License: CC BY
Data sources: Datacite
ZENODO
Preprint . 2026
License: CC BY
Data sources: Datacite
versions View all 2 versions
addClaim

Predictive Rendezvous: Time--Intent--Deterministic Peer Coordination Without Infrastructure

Authors: de Beer, Riaan;

Predictive Rendezvous: Time--Intent--Deterministic Peer Coordination Without Infrastructure

Abstract

Most peer-to-peer systems rely on external infrastructure---such as signaling servers, trackers, or distributed hash tables---to enable peers to discover and connect to one another. This infrastructure is commonly treated as fundamental. This document adopts a different view: such components primarily synchronize transient, time-sensitive state between otherwise deterministic peers. We introduce Predictive Rendezvous, a coordination architecture in which peers establish communication by executing a shared, deterministic rendezvous plan derived from prior agreement, shared time context, and cryptographic entropy. Instead of discovering each other via network lookups, peers predict each other's behavior in time, causing their independently evolving network states to converge without negotiation or intermediaries. The approach generalizes across domains, including real-time communication and distributed content swarms, and reframes peer discovery as a problem of temporal and intentional coordination rather than address resolution. This document is intended as prior art describing the conceptual model, terminology, and protocol structure of Predictive Rendezvous and related notions such as Semantic Rendezvous Tokens. The architecture is independent of transport protocol, addressing scheme, or application payload.

Keywords

distributed systems, infrastructure-free networking, semantic-rendezvous-tokens, temporal coordination, deterministic coordination, intent-based systems, peer-to-peer, signaling-free communication, content swarms, predictive-rendezvous, time-based addressing, trackerless systems, predictive coordination, NAT traversal, rendezvous, distributed file systems, coordination theory, coordination architecture

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
0
Average
Average
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!