πŸ›‘οΈ LAYER 6 // DETERMINISTIC TOR CITADEL

The Ephemeral Gate β€” Parameterized Proof-of-Work & Zero-Crowdsource Sybil Defense

β€œThe fatal flaw of Cicada 3301 was crowdsourcing: Reddit and IRC swarms solved steps collaboratively, allowing intellectual freeloaders to ride the coattails of true polymaths. Layer 6 permanently closes this vector. Every candidate’s gate is unique to their personal cryptographic identity.”
β€” Council Directive // All-Signal Architecture


1. Executive Summary & Objective

ParameterSpecification
Pipeline StageSybil Defense & Cryptographic Citadel (Layer 6 of 7)
Input MediumTor Onion Service URL (http://ultronvxwkyn5j2naedmdba5it6eatbnyj7vvnv5yaw2pfl62xdynnqd.onion) unlocked via Layer 5 - The Telemetry Ghost
Integrated DomainsApplied Cryptography, Distributed Systems, Tor Hidden Services, Zero-Leakage Architecture
Target Audience FilterNeutralizes collaborative Discord/Reddit cheating rings; mandates individual computational and cryptographic proof-of-work
Downstream YieldEncrypted Triumvirate Crucible Invitation Token + One-Time SSH/WebRTC Enclave Access for Layer 7

2. The Citadel Architecture & Ephemeral Window

The Citadel operates on strict operational parameters detailed in Protocol - The Ephemeral Tor Citadel (1-tor):

  • Aperture Window: Strictly 2 hours (120 minutes) per session.
  • Server-Side Elapsed Telemetry: Time is computed on the host backend; refreshing the browser or changing Tor circuits does not reset the 2-hour countdown.
  • Isolation Sandbox: Executed under bwrap (Bubblewrap) with unmounted host filesystem (/home/ultron invisible), zero identification headers (Server:, Date: stripped), loopback binding 127.0.0.1:7799.
     [ Solver Connects via Tor Browser / SOCKS5 ]
                         β”‚
                         β–Ό
     β”Œβ”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”
     β”‚  CITADEL HUD: CONSOLE // DECK-01       β”‚
     β”‚  Time Remaining: Real-time countdown   β”‚
     β””β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”¬β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”˜
                         β”‚
        [ Candidate Submits Identity Anchor ]
           GitHub Handle + Public PGP Key
                         β”‚
                         β–Ό
        β”Œβ”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”
        β”‚ Dynamic Parameterized PoW Engine   β”‚
        β”‚ Seed = SHA256(PGP_Key || Salt)     β”‚
        β”‚ Equihash-200/9 + Micro-Rust VM     β”‚
        β””β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”¬β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”˜
                         β”‚
            [ Candidate Computes Proof ]
            (Hardware-bound memory puzzle)
                         β”‚
                         β–Ό
        β”Œβ”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”
        β”‚  Valid Proof Submitted in Window   β”‚
        β””β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”¬β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”˜
                         β”‚
                         β–Ό
          Proceed to [[Layer 7 - The Crucible]]

3. The Parameterized Proof-of-Work Engine

3.1 The Invalidation of Crowdsourced Solutions

When a solver reaches the Citadel HUD:

  1. They must input their GitHub Handle and their Public PGP Key (4096-bit RSA or Ed25519) into the CONSOLE // DECK-01 terminal.
  2. The server backend deterministically calculates:
  3. The server serves a custom Memory-Hard Proof-of-Work challenge (customized Equihash or Argon2d variant with 4GB memory commitment).
  4. Result: Candidate B cannot use Candidate A’s answers. Every single puzzle requires hours of personal compute tied to an immutable cryptographic identity.

3.2 The Proof Verification Contract

The candidate must write a multi-threaded solver in Rust/C++ to compute the valid nonce satisfying: under 4GB RAM saturation, preventing ASIC cloud farms from flooding the pipeline without prohibitive memory bandwidth costs.


4. Extraction & Yield

Upon submitting the valid mathematical nonce through the terminal deck:

  1. The server signs an ephemeral Crucible Invitation Token using the Council’s Private Key, encrypted to the candidate’s personal public PGP key.
  2. The HUD outputs the decryption envelope:
[DECK-01 TELEMETRY // CLEARANCE GRANTED]
SOLVER_PGP_FINGERPRINT: E3A1 B8C2 94D0 71FA ...
PROOF_VERIFICATION: 0x000000003f9b2c8a [VALID]
REMAINING_WINDOW_SECS: 2419

-----BEGIN PGP MESSAGE-----
Version: Ultron Citadel Core v3.0

hQGMA8X... [ENCRYPTED CRUCIBLE COORDINATES]
...
-----END PGP MESSAGE-----

INSTRUCTION: Decrypt message locally. Connect to enclave within 30 minutes.

When decrypted with their private key, the token reveals the private sovereign WebRTC / SSH gateway for the final live trial: The 30-Minute Crucible.


5. Security & Fail-Safe Mechanics

  • Watchdog Auto-Teardown: If the 2-hour window expires without a verified proof, 1-tor-watchdog.timer executes a hard shutdown, removing the onion keys from memory.
  • Tor Circuit Throttling: Built-in IP/circuit request limiting blocks automated brute-force attacks on the submission endpoint.