Open
Conversation
…vation Proposed extension to DECK-0001 solving the bootstrap problem: - Plane-based entry: Each HJ has 3 entry planes (X, Y, Z), reducing entry LCA from h≈84 (3D point) to h≈57 (1D plane, best axis) - Shadow HJ derivation: SHA256 iteration creates 60x more HJs at exponentially increasing cost (2^N multiplier, N ≤ 60) - Directional Cantor commitment: Hyperjump cost scales with XOR distance, single-use, prevents locality collapse - Coverage analysis: 00 cloud entry cost in 2026 → 5 by 2041 (with Moore's Law) - Preserves all Five Properties with explicit layer analysis (math/protocol/social) This is a draft for community review. See open questions in the spec for discussion points.
…wide Entry LCA: h≈57 (Gibson match) -> h≈27-35 (sector match) Consumer time: ~13 years -> ~3 hours Cloud cost: ~00 -> ~/usr/bin/bash.05 This makes HJ network instantly accessible to consumers in 2026.
Clean rewrite focusing on sector-matching planes as the bootstrap solution. Key changes: - Remove all shadow hyperjump derivation - Sector planes alone: h≈33, ~15 min, /usr/bin/bash.09 cloud - Improvement: 51 bits easier than point entry (10^14× cheaper) - Directional Cantor commitment for inter-HJ travel cost - New event kind 33340 (hyperjump entry announcement) Shadow HJs were a 61x optimization, not a requirement. Sector planes solve the bootstrap problem elegantly on their own.
Fix critical error: sector extraction requires de-interleaving first per CYBERSPACE_V2.md §2.2. Added proper definition with O(85) bit-op reference implementation.
- Replace HJ spec with sector-plane entry design - Entry LCA: h≈84 → h≈33 (51 bits easier = 10¹⁴× cheaper) - Consumer access: ~15 minutes, ~/usr/bin/bash.09 cloud cost - Shadow HJs removed as unnecessary (sector planes alone sufficient) - Add directional Cantor commitment for inter-HJ travel cost - Preserve locality: exit at exact 3D coordinate, not plane - Three-layer analysis: mathematical, protocol, social See DECK-0001-v2-sector-entry.md for full draft and mathematical derivation.
PROBLEM: Original formula (popcount of coordinate XOR) gives h=64 median for random merkle roots. Cost: 2^64 ≈ 10^19 ops (5.8 million years). Makes HJ network completely unusable. ROOT CAUSE: Bitcoin merkle roots are uniformly random 256-bit values. Any two random values have XOR distance ≈256 bits, popcount ≈64. SOLUTION: Use Bitcoin block HEIGHT difference instead: - commitment_height = |B_to - B_from|.bit_length() - Median Δ=271K blocks → h=19 → 524K ops (~5ms) - 100% of hops are h≤20 (max with current Bitcoin history) - Still preserves locality: nearby blocks cheap, distant blocks expensive - triangle inequality holds: multi-hop routing is valid skill This makes the HJ network practical for everyday use while maintaining spatial fabric and preventing free teleportation.
- hyperjump-commitment-analysis.md: Full mathematical analysis of why coordinate XOR fails and block height works for commitment metric - DECK-0001-finalization-summary.md: Complete status report, remaining open questions, and implementation checklist
- DECK-0001-hyperjumps.md: Canonical specification (sector entry + block height commitment) - DECK-0001-finalization-summary.md: Open questions, implementation status, and commitment analysis (appended) - Removed: DECK-0001-v2-sector-entry.md (obsolete draft with wrong XOR formula) - Removed: hyperjump-commitment-analysis.md (merged into summary)
…Leaf - New spec: hyperjump-traversal-proof.md - Single Nostr event proves multi-block traversal - Temporal seed from previous_event_id prevents replay (replay = equivocation) - O(path_length) Cantor pairings, consumer-feasible (~1M blocks/day) - Mathematical commitment (bijective Cantor pairing), no hash grinding - No LCA barriers - path leaves, not region leaves - Complements block_height_commitment (access toll vs traversal proof) See decks/hyperjump-traversal-proof.md for full specification.
- Replace sidestep-based entry with dedicated 'enter' action (kind 33340, A=enter) - Enter uses standard Cantor proof (h≈33 is consumer-feasible) - Sidestep is for h>35-40 (storage-infeasible), enter is for sector-level entry - Enter action includes HJ reference and axis specification - Validation: verify Cantor proof + sector match + chain order This is the proper 4th movement primitive (spawn, hop, sidestep, enter).
All Cyberspace movement actions are kind 3333, differentiated by A tag: - A=spawn - A=hop - A=sidestep - A=enter (new - 4th primitive for hyperjump plane entry) - A=hyperjump This is the established pattern from sidestep spec.
CRITICAL: All Cyberspace movement actions use kind 3333 with A tag. Never invent new kind numbers. This is the sidestep pattern. Anti-pattern examples (DO NOT USE): - kind 33340 for hyperjump_entry - kind 33334 for enter - Any new kind number for actions Correct pattern: - kind 3333, A=spawn - kind 3333, A=hop - kind 3333, A=sidestep - kind 3333, A=enter - kind 3333, A=hyperjump This decision is locked. Do not revisit.
…ction Files cleaned: - PR_12_DESCRIPTION.md - DECK-0001-hyperjumps.md - DECK-0001-finalization-summary.md All action handlers now correctly specify kind 3333.
… analysis The old spec had block height commitment as the inter-HJ travel mechanism. This was superseded by the Incremental Cantor Tree traversal proof. New summary reflects current spec: - Sector entry planes (h≈33) - Enter action (kind 3333, A=enter) - Traversal proof (Cantor tree, not block height commitment) - Clear separation: entry toll vs traversal proof Removed 150+ lines of outdated analysis.
…g core HJ spec - Preserved all original hyperjump specification (coordinate derivation, kind 321 anchors, kind 3333 hyperjump events, examples) - Added Part II: Sector-based entry planes to solve bootstrap problem (h≈84 → h≈33, 15 min entry) - Added Part III: Inter-hyperjump traversal with Cantor tree + temporal leaf binding - Added Part IV: Complete examples including enter action and traversal proof - Added Part V: Security considerations for new mechanisms - Reorganized into logical parts while maintaining backward compatibility The spec now contains both the original hyperjump mechanics AND the new v2 additions.
Updated the definition and mechanics of hyperjumps, including the introduction of hyperspace and new terms related to the teleport mechanism. Added details about how identities navigate within the hyperjump network and the role of Bitcoin blocks.
10 tasks
… proof - Replace all instances of 'avatar/avatars' with 'identity/identities' - Change 'enter action' to 'enter-hyperspace action' (A=enter-hyperspace) - Change 'traversal proof' to 'hyperspace proof' throughout - Update Part III title to 'Hyperspace Proof' - Update example titles for clarity - Add implementation checklist - Maintain consistency with Hyperspace/Hyperjump/hyperjump terminology This aligns the entire spec with the conceptual framework established in the Abstract and Terms sections.
arkin0x
changed the title
added 3 commits
April 16, 2026 15:41
MAJOR RESTRUCTURE: Part I - Enter-Hyperspace Action (Cyberspace → Hyperspace): - Moved bootstrap problem and sector planes to Part I - Defined enter-hyperspace action FIRST (how you board the network) - Added complete enter-hyperspace event spec with validation rules - Explains sector extraction, entry validation, exit behavior - Coverage/accessibility analysis with cost projections Part II - Hyperjump Action (Hyperspace Traversal): - Moved AFTER enter-hyperspace (logical flow: board first, then traverse) - Defines hyperjump action for moving between Hyperjumps - Clarifies when hyperspace proof is required (multi-block only) - Complete hyperspace proof spec (Cantor tree with temporal leaf) - Cost analysis and non-reuse mechanism Part III - Complete Examples: - Reordered examples to match narrative flow - Example 1: Block anchor (discovery) - Example 2: Enter-Hyperspace (boarding) - Example 3: Hyperjump single-block (no proof) - Example 4: Hyperjump multi-block (with proof) Removed: - Old Part I 'Core Hyperjump Specification' that mixed concepts - Premature hyperjump event spec before explaining entry - Confusing references to 'HJ network' before defining entry The spec now follows the user journey: 1. Learn what Hyperspace is 2. Learn how to ENTER it (sector planes, enter-hyperspace action) 3. Learn how to TRAVERSE it (hyperjump action, Cantor proof) 4. See complete examples of each step
… ref, clarify exit Abstract: - Changed 'navigate to a hyperjump' → 'navigate to a Hyperjump's Sector entry plane' Part I.3 (Enter-Hyperspace Action): - Replaced HJ tag with H tag (contains Merkle root; enables Nostr queries) - Added B tag (Bitcoin block height of the Hyperjump) - Added optional 'e' hyperjump-anchor tag (references kind 321 block anchor event) - Updated example to show H and B tags - Updated validation rules to verify H tag Merkle root and B tag height - Validation #6: if anchor ref present, verify it matches H and B values Part I.4 (Exit Behavior): - Complete rewrite explaining exit via normal hop/sidestep action - Clarifies that exit starts from Hyperjump's Merkle-root coordinate - The hop/sidestep 'c' tag = block anchor 'C' tag = Merkle root - Merkle root is the 'bridge coordinate' between Hyperspace and Cyberspace - Spatial integrity preserved: sector advantage only for entering, not exiting
Added problem and solution statements to the Hyperspace DECK.
- Remove distinction between single-block and multi-block jumps - All hyperjump actions now require proof tag with temporal-leaf Cantor tree - Add from_height and from_hj as required tags (not conditional) - Remove references to unpublished 'block height commitment' spec - Add 1-block example to cost analysis table (3 leaves, 2 pairings, ~200ns) - Add explicit examples of leaf construction for 1-block and 100-block jumps - Update verification steps to include from_hj and C tag validation The temporal-leaf mechanism scales uniformly: computational cost is linear with block height traveled, no special cases.
- Remove 'Why enter-hyperspace instead of sidestep' section (unnecessary comparison) - Add coordinate clarification: identity remains at C coordinate after enter-hyperspace - Clarify that location only resolves to Merkle-root coordinate after first hyperjump action - This prevents confusion about whether entry action teleports identity to Hyperjump coordinate
- Clarify that hop/sidestep after enter-hyperspace exits from C coordinate - This effectively cancels the Hyperspace traversal setup - Makes explicit that identity must publish hyperjump action (not hop/sidestep) to use the network
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
This PR contains the finalized DECK-0001 v2 specification for sector-based hyperjump entry.
Summary
This revision solves the bootstrap problem: how can a newly spawned avatar reach the hyperjump network with consumer-feasible computation?
Key changes:
Files
decks/DECK-0001-hyperjumps.md- Complete specificationdecks/hyperjump-traversal-proof.md- Full traversal proof specificationdecks/DECISION-action-kinds.md- Locked kind 3333 pattern for all actionsdecks/DECK-0001-finalization-summary.md- Finalization status and recommendationsTechnical Details
Entry: Match high 55 bits of one axis (sector) instead of full 85-bit Gibson coordinate
Traversal: Block height difference metric for access commitment (h≤20 max)
Proof: Cantor tree over path leaves with temporal seed from previous_event_id
Result: With ~940K Bitcoin block HJs, entry is consumer-feasible in ~15 minutes at ~/usr/bin/bash.09 cloud cost.
This branch is based on the full commit history of the original PR #12 work.