VEILORA 2.0 / TECHNICAL NOTES

Veilora 2.0 protocol

From authorization to the last packet: the connection architecture, processing model and implementation boundaries.

ARCHITECTURE

Two planes. One lifecycle.

Control plane

Coordinates identity, entitlement, node availability, configuration and rule updates. It decides what a client is authorized to use.

Data plane

Handles application traffic, DNS, routing, protected transport, health checks, recovery and delivery back to the application.

  1. Authorize & configure
  2. Resolve & route
  3. Authenticate & establish keys
  4. Transfer & monitor
  5. Recover or clean up
01 / REFERENCE MODEL

Authorization and configuration

The control plane checks identity and node permissions before issuing the configuration needed to connect. The model favors limited-lifetime credentials and validated configuration over permanently embedded node secrets.

Design detail

Check expiry, revocation, configuration integrity and client compatibility. Store sensitive material in the operating system’s secure storage.

02 / REFERENCE MODEL

System network entry

Traffic can enter through a virtual network interface or system proxy. The integration must coordinate virtual addresses, system routes and DNS before forwarding application traffic.

Design detail

Exclude the node connection and required control traffic from the tunnel to avoid routing loops. System APIs and kill-switch behavior depend on the actual platform implementation; this is not a supported-device list.

03 / REFERENCE MODEL

DNS and domain decisions

The resolver path is chosen alongside routing rules. A local destination may use local resolution; a tunneled destination may require resolution through a protected path. The domain-to-address relationship helps later routing decisions.

Design detail

Define IPv4 and IPv6 handling, cache lifetime, fallback rules and cache invalidation after a network change. DNS privacy cannot be inferred solely from an encrypted data tunnel.

04 / REFERENCE MODEL

Traffic classification and routing

A routing engine evaluates destinations and rules to choose direct, tunnel or block. Inputs may include domain, address, port, application, transport and user-defined policy.

Design detail

Direct traffic uses the local network. Tunneled traffic goes to a node. Blocked traffic is rejected. These are design actions, not a claim that ad or malware filtering is already available.

05 / REFERENCE MODEL

Node selection

Node selection should consider permission, availability, latency, loss, load, path length, transport support and client compatibility. A lower ping alone does not establish a better route.

Design detail

Manual and automatic selection are possible control strategies. Their availability and parameters depend on the released client and node configuration.

06 / REFERENCE MODEL

Capability negotiation

Before application data is sent, peers need a compatible set of capabilities: protocol generation, TCP/UDP behavior, address families, frame limits, heartbeat settings and optional recovery or multiplexing.

Design detail

Use the intersection of supported capabilities, explicitly reject incompatible versions and define safe fallback. No fixed frame size or negotiated extension is specified here.

07 / REFERENCE MODEL

Authentication and replay resistance

A reference authentication request binds authorization to the intended node, protocol and current connection. Limited-lifetime tokens, a fresh nonce and a server challenge can help prevent reuse of a captured request.

Design detail

The server must check issuer, expiry, revocation, permissions and replay state. The concrete authentication format and replay-window policy still need an implementation specification.

08 / REFERENCE MODEL

Key establishment and rotation

The reference model uses ephemeral key material and separates keys by direction and purpose. Session encryption, integrity protection, header protection and recovery should not automatically share one key.

Design detail

Forward secrecy and rotation are design goals requiring a reviewed construction. Algorithms, key lengths, rotation thresholds and cryptographic guarantees are not specified by this article.

09 / REFERENCE MODEL

Session establishment

A session groups negotiated parameters and connection state: identifier, version, transport mode, frame bounds, idle timeout and any supported recovery or stream limits.

Design detail

Application data should wait for a successful server confirmation. The fields described here are conceptual, not a production packet layout.

10 / REFERENCE MODEL

Logical streams or separate connections

A session may carry several logical streams, or applications may use separate underlying connections. Multiplexing can reduce repeated setup; separate connections can improve failure isolation at the cost of additional handshakes.

Design detail

A mixed design may separate bulk transfers from small requests. The actual Veilora 2.0 stream architecture remains an implementation detail to be specified.

11 / REFERENCE MODEL

Frame encapsulation

Conceptual frames associate payload with version, frame type, session, stream, sequence and length information, plus integrity protection. A receiver needs clear size and state limits before processing them.

Design detail

The frame names below are explanatory labels only. They do not define numeric opcodes, byte order, offsets or interoperable wire encoding.

12 / REFERENCE MODEL

TCP forwarding and closure

A TCP flow needs ordered bidirectional delivery and explicit success, failure and closure states. The node attempts the target connection, reports the result, and then forwards data in both directions.

Design detail

Normal closure should account for each direction before releasing state. Errors should be returned to the application and confined to the affected logical connection where the architecture allows.

13 / REFERENCE MODEL

UDP associations and transport choices

Datagrams retain message boundaries and a relationship to their source, destination and timeout state. Possible carriers include native UDP, a reliable tunnel or a QUIC-based design, each with different network and latency tradeoffs.

Design detail

UDP-over-TCP can introduce head-of-line blocking. Native UDP depends on network reachability. No automatic transport switching or QUIC support is asserted as deployed here.

14 / REFERENCE MODEL

Flow control and backpressure

Control is needed both across a session and within each stream. Bounded send and receive windows, queues and scheduling prevent one bulk transfer from exhausting capacity or growing memory indefinitely.

Design detail

Backpressure signals a producer to slow down when the receiver or downstream path cannot keep up. Fairness and throughput must be evaluated together.

15 / REFERENCE MODEL

Packet shaping and padding

Encryption does not hide every observable property: sizes, intervals and connection duration may remain visible. Splitting, batching and padding can alter some of these characteristics, with bandwidth and processing costs.

Design detail

Padding is not encryption and cannot promise undetectable traffic. Any shaping policy must be evaluated for overhead and the intended network conditions.

16 / REFERENCE MODEL

MTU and packet sizing

Tunnel headers and cryptographic overhead reduce the space available for payload. The design must account for path MTU, address family and encapsulation when choosing interface and frame sizes.

Design detail

Oversized packets can cause fragmentation, drops or apparent stalls. A universal MTU value cannot be inferred from this reference model.

17 / REFERENCE MODEL

Latency, loss and congestion

Health assessment should combine round-trip time, jitter, loss, throughput, outstanding data and node responses. A single failed probe is not enough to classify a persistent failure.

Design detail

Transient delay may call for waiting; ongoing pressure may call for adjusted windows or concurrency; sustained failure may require reconnection. Test these decisions under reproducible conditions.

18 / REFERENCE MODEL

Heartbeat and health checks

When application traffic is idle, liveness probes can check the path. An adaptive schedule can avoid redundant probes during active traffic and reassess more promptly after a network change.

Design detail

Frequent probes consume power, traffic and server resources; sparse probes delay failure detection. No fixed heartbeat interval is promised.

19 / REFERENCE MODEL

Network changes and session recovery

After an address or route change, stop sending into the failed path, refresh local network state, reconnect and validate any recovery credential. Resume only state that both peers still hold and authorize.

Design detail

Session recovery is not the same as preserving every application connection. If the destination TCP connection is gone, the application may still need to reconnect.

20 / REFERENCE MODEL

Node failures and reselection

Distinguish a temporary slowdown from an unreachable or deauthorized node. For softer failures, wait, reduce pressure and remeasure; for sustained failures, select an authorized alternative and establish a new session.

Design detail

The reference failover path coordinates DNS, routing and any implemented traffic-blocking policy. Kill-switch availability and behavior require platform-specific confirmation.

21 / REFERENCE MODEL

Return traffic and decapsulation

The node associates a response with its session and logical flow, protects it and sends it back. The client validates, decrypts and dispatches it to the original application through its network entry.

Design detail

Reject invalid lengths, integrity failures, duplicate or out-of-window data and references to closed streams before delivering payload.

22 / REFERENCE MODEL

Disconnection and state cleanup

An orderly shutdown stops new traffic, closes active flows, disposes of session keys and temporary credentials, and restores the relevant system routing and DNS state.

Design detail

Crash recovery should repair stale proxy, route and DNS settings. Removing temporary connection state is not evidence of a no-logs operating policy.

REFERENCE / FRAMES

Illustrative frame roles

These labels explain responsibilities only; they are not an implementation-ready wire specification.

Illustrative frame types
LabelPurpose
OPENStart a logical flow
DATA / UDPCarry stream data or a datagram
ACKAcknowledge relevant state
FIN / RESETOrderly close or error termination
PING / PONGProbe and respond to liveness checks
SETTINGSExchange session settings
KEY_UPDATECoordinate key changes
RESUMERequest supported session recovery
BOUNDARIES

What this document does not specify

  • Exact ciphers, key sizes, authentication encoding, packet layout and frame limits.
  • Deployed multiplexing, QUIC, automatic UDP selection, recovery and kill-switch support.
  • Device compatibility, node coverage, plan entitlements and release availability.
  • Independent security validation, performance guarantees, or a no-logs operating policy.

Temporary-state cleanup is different from a retention policy. Protocol recovery cannot promise uninterrupted third-party application sessions, and a VPN cannot guarantee wallet-fund security.

Compare protocol design boundaries →