Merkle proof mechanism for crossing infeasible LCA boundaries

Sidestep: LCA Boundary Crossing

Sidestep is a movement action for crossing LCA (Lowest Common Ancestor) boundaries that are computationally infeasible to traverse via Cantor pairing. It uses a Merkle hash tree proof to demonstrate knowledge of a valid path, enabling movement between regions separated by storage-infeasible heights.

Key Distinction

Sidestep uses Merkle proofs, not Cantor pairing. This is intentional: sidestep is designed for heights where direct traversal is infeasible (h > 35-40). The Merkle proof demonstrates knowledge of the path without requiring O(2^h) computation.

What Is Sidestep?

In the Cyberspace coordinate system, movement between coordinates requires proving you've traversed the path. For nearby coordinates (low LCA height), this is done with Cantor pairing trees. But what about crossing boundaries that are thermodynamically infeasible?

The Infeasible Heights

LCA heights above 35-40 become storage-infeasible:

h = 35: ~34 billion leaves (storage challenge)
h = 40: ~1 trillion leaves (nation-state scale)
h = 84: Categorically infeasible (more than age of universe)

Sidestep allows entities to cross these boundaries by publishing a Merkle proof that demonstrates knowledge of the intermediate coordinates, without requiring the entity to have computed every step.

When to Use Sidestep

Use Cantor Pairing

Local movement (hop action)
Hyperspace entry (enter-hyperspace)
Inter-hyperjump traversal (hyperjump)
LCA height < 35
Feasible computation: O(path_length)

Use Sidestep (Merkle)

LCA boundary crossing
Storage-infeasible heights
LCA height > 35-40
Proving knowledge without full traversal
Sector-to-sector movement

Event Structure

Sidestep events use the standard Cyberspace action kind with a specific action tag:

Nostr Event Format

{
  "kind": 3333,
  "tags": [
    ["A", "sidestep"],
    ["c", "<prev_coord_hex>"],
    ["c", "<new_coord_hex>"],
    ["proof", "<merkle_root_hex>"]
  ],
  "content": ""
}

Critical: Kind 3333 Pattern

ALL Cyberspace movement actions use kind: 3333. The action type is differentiated ONLY by the A tag:

A=spawn — Initial entry to cyberspace
A=hop — Local movement (within sector)
A=sidestep — LCA boundary crossing (Merkle proof)
A=enter-hyperspace — Hyperspace plane entry (Cantor proof, h≈33)
A=hyperjump — Inter-hyperjump traversal (Cantor tree)

See: DECK-0001-hyperspace.md, DECISION-action-kinds.md

Merkle Proof Construction

The sidestep Merkle proof demonstrates knowledge of the path between two coordinates separated by an infeasible LCA height.

Proof Structure

Leaves: The set of intermediate coordinates forming the path from source to destination. These are the coordinates at the LCA boundary.
Tree construction: Standard Merkle tree: pair adjacent leaves, hash each pair (SHA-256), repeat until single root remains.
Proof publication: Publish the Merkle root in the proof tag.
Verification: Verifier can validate the proof demonstrates knowledge of the path without recomputing every coordinate.

Why Merkle (Not Cantor)?

Cantor pairing is bijective and preserves entropy, making it ideal for feasible heights where direct computation is possible. But at storage-infeasible heights, the goal shifts from computing the path to proving knowledge of the path.

Merkle proofs are the standard cryptographic tool for this: they demonstrate knowledge of data without revealing all of it, and verification is efficient (O(log n) hashes) even when the full dataset is massive.

Use Cases

Sector Transitions

Moving between sectors that are separated by high LCA boundaries. Sidestep enables crossing without requiring infeasible computation.

LCA Boundary Crossings

Any movement where the LCA height exceeds practical computation limits (h > 35-40). Sidestep provides a feasible proof mechanism.

Progressive Unlocking

Future protocols may use sidestep proofs for progressive content unlocking, where revealing Merkle branches gradually exposes deeper content layers.

Proof Mechanism Comparison

Action	Proof Type	LCA Height	Cost
hop	Cantor pairing	Low (< 20)	O(path_length)
enter-hyperspace	Cantor proof	h ≈ 33	~15 min, $0.09
hyperjump	Cantor tree + temporal leaf	Path length	O(blocks traversed)
sidestep	Merkle tree	h > 35-40	Storage-bound

References

DECISION-action-kinds.md — Locked decision: all actions use kind 3333
DECK-0001-hyperspace.md — Hyperspace entry and traversal mechanics
CYBERSPACE_V2.md — Core protocol specification