solver.press

A physically-anchored, bidirectionally-bounded time-locked encryption scheme can be constructed by combining two mechanisms: (1) cryptographic keys derived from the phase-coherent timing residuals of a minimum three-pulsar array at a target epoch T_target, preventing pre-epoch decryption since the required physical observables do not exist until T_target; and (2) an ephemeral session key transmitted exclusively during the T_target ± window and never stored, preventing post-epoch decryption since archived pulsar timing data recovers only the outer key while the session key is permanently destroyed. Together these designate the universe as the root of trust for the forward TTL and irreversible key erasure for the backward TTL — producing a message that is physically undecryptable both before and after its intended window, without relying on any trusted third party or mathematical hardness assumptions vulnerable to quantum attack.

CryptographyApr 11, 2026Evaluation Score: 59%

Adversarial Debate Score

50% survival rate under critique

Model Critiques

openai: The hypothesis is highly creative and falsifiable in principle, but the cited papers do not provide direct support for pulsar-based cryptographic schemes or their quantum resistance, and there are practical counterarguments regarding noise, predictability, and adversarial access to pulsar timing ...
mistral: The hypothesis is ambitious and theoretically intriguing, leveraging astrophysical phenomena for cryptographic innovation, but it lacks direct empirical support from the provided papers and faces practical challenges (e.g., pulsar timing noise, telescope sensitivity, and real-world implementation...
grok: The hypothesis is innovative and falsifiable, leveraging physical phenomena (pulsar timing) as a root of trust, which is theoretically resistant to pre-computation and quantum attacks. However, it lacks direct support from the provided papers, which focus on unrelated quantum and material science...
anthropic: The hypothesis is conceptually creative and internally coherent regarding falsifiability (pulsar timing residuals are measurable), but it is entirely unsupported by the provided papers, which cover hydrogen superconductors, quantum algorithms, AMR simulation, and protein folding — none relevant t...

Supporting Research Papers

Formal Verification

Z3 logical consistency:✅ Consistent

Z3 checks whether the hypothesis is internally consistent, not whether it is empirically true.

Experimental Validation Package

This discovery has a Claude-generated validation package with a full experimental design.

Precise Hypothesis

A bidirectionally time-locked encryption scheme (BTLE) can be constructed such that: (1) a ciphertext C encrypted at time T_enc < T_target remains computationally and physically undecryptable until epoch T_target, because the outer decryption key K_outer is derived deterministically from the phase-coherent timing residuals R(T_target) of ≥3 millisecond pulsars (MSPs) observed simultaneously at T_target, residuals that do not physically exist before T_target; and (2) the same ciphertext becomes permanently undecryptable after T_target + Δ (where Δ is a defined window, e.g., 60–3600 seconds), because an ephemeral session key K_session required to decrypt the inner layer is transmitted only during [T_target, T_target + Δ], never stored, and irreversibly erased. The scheme requires no trusted third party, no mathematical hardness assumption vulnerable to Grover's or Shor's algorithms, and no pre-committed secret. Falsifiable prediction: any adversary — including one with a quantum computer — cannot decrypt C outside [T_target, T_target + Δ] with probability > 2^-128, given that (a) K_session erasure is verified, (b) pulsar timing residuals at T_target are unpredictable to within σ_residual < 1 μs before T_target, and (c) the key derivation function maps residuals to keys with ≥128-bit entropy.

Disproof criteria:
  1. FORWARD TTL FAILURE: Any demonstrated method to predict phase-coherent timing residuals of ≥3 MSPs at T_target with accuracy < 10 ns more than 24 hours before T_target, using only data available before T_target, would disprove the forward time-lock. Threshold: prediction accuracy σ_pred < 10 ns with probability > 0.01% constitutes disproof.
  2. BACKWARD TTL FAILURE: Recovery of K_session after T_target + Δ from any source (memory forensics, side-channel, network replay, HSM compromise) with probability > 2^-64 constitutes disproof of the backward time-lock.
  3. ENTROPY COLLAPSE: Demonstration that the joint entropy H(R_1, R_2, R_3 | public ephemeris data) < 64 bits at T_target would disprove the cryptographic security claim.
  4. SPOOFING ATTACK: Successful injection of false timing signals at ≥2 independent telescope sites simultaneously (without physical access) that cause K_outer derivation from attacker-controlled values would disprove the physical anchoring claim.
  5. QUANTUM PREIMAGE: A quantum algorithm that finds a preimage of HKDF-SHA3-256 in < 2^64 oracle queries (violating Grover's bound for 128-bit security) would disprove quantum resistance.
  6. TIMING CORRELATION: If residuals from ≥3 pulsars are shown to be mutually predictable (correlation coefficient r > 0.9 across 10+ epochs) from pre-T_target data, the entropy assumption is falsified.
  7. THIRD-PARTY DEPENDENCY: If the scheme is shown to require any pre-committed secret held by a third party (beyond the HSM holding K_session during [T_target, T_target + Δ]), the "no trusted third party" claim is falsified.

Experimental Protocol

PHASE 0 — SIMULATION BASELINE (Weeks 1–4): Simulate the full BTLE scheme using historical pulsar timing data from IPTA DR2 (International Pulsar Timing Array Data Release 2) as a proxy for "future" residuals. Treat data from epoch T_sim as the target epoch and data before T_sim as the adversary's knowledge base.

PHASE 1 — ENTROPY QUANTIFICATION (Weeks 3–8): Using IPTA DR2 and NANOGrav 15-year dataset, compute the conditional entropy H(R_i(T) | {R_i(t): t < T-24h}) for 5 MSPs across 50 target epochs. Fit timing noise models (ENTERPRISE/TEMPO2) and measure residual unpredictability.

PHASE 2 — KEY DERIVATION SECURITY (Weeks 5–10): Implement HKDF-SHA3-256 key derivation from simulated residuals. Run 10,000 Monte Carlo trials varying residual noise realizations. Measure key entropy, collision probability, and sensitivity to residual quantization (1 ns, 10 ns, 100 ns bins).

PHASE 3 — PROTOCOL IMPLEMENTATION (Weeks 8–16): Build full BTLE stack: encryption engine (Python/Rust), HSM integration (SoftHSM2 for simulation, Thales Luna for hardware test), session key transmission protocol (TLS 1.3 + pre-shared key), and erasure verification module.

PHASE 4 — LIVE TELESCOPE PILOT (Weeks 16–32): Partner with Parkes Pulsar Timing Array (PPTA) or MeerKAT for a live test: encrypt a test message at T_enc, derive K_outer from actual MSP residuals at T_target (T_target = T_enc + 7 days), transmit K_session during Δ = 300 seconds, verify decryption succeeds only within window.

PHASE 5 — ADVERSARIAL RED-TEAM (Weeks 20–36): Engage independent cryptographers and astrophysicists to attempt: (a) residual prediction attacks, (b) K_session recovery after erasure, (c) spoofing simulations, (d) side-channel attacks on HSM.

Required datasets:
  1. IPTA Data Release 2 (IPTA DR2): Timing residuals for 65 MSPs, 1987–2019, publicly available at ipta.org. Required for entropy analysis and simulation. Size: ~2 GB.
  2. NANOGrav 15-Year Dataset: High-precision timing for 68 MSPs, 2004–2020, publicly available at nanograv.org. Size: ~5 GB. Required for cross-validation of entropy estimates.
  3. PPTA Data Release 3 (PPTA DR3): Parkes-specific timing data, 26 MSPs, 2004–2022. Size: ~1.5 GB. Required for Southern Hemisphere pulsar selection.
  4. JPL DE440 Solar System Ephemeris: Required for timing model residual computation. Available from NASA/JPL. Size: ~100 MB.
  5. ENTERPRISE Noise Model Outputs: Bayesian timing noise posteriors for target MSPs. Must be computed from datasets 1–3. Estimated compute output: ~50 GB of MCMC chains.
  6. Simulated Adversary Knowledge Base: Constructed from datasets 1–3 with T_sim cutoffs at T_target - 24h, T_target - 72h, T_target - 7d. Requires preprocessing pipeline.
  7. HSM Audit Logs: From SoftHSM2 simulation runs; tamper-evident logs of K_session creation, transmission, and erasure events. Generated during Phase 3.
  8. Radio Telescope Live Data (Phase 4 only): Real-time TOA measurements from Parkes or MeerKAT for ≥3 MSPs at T_target. Requires telescope time allocation (~8 hours per epoch, estimated cost $8,000–$40,000 per epoch).
  9. Quantum Circuit Simulation Data: Qiskit/Cirq simulations of Grover's attack on HKDF-SHA3-256 for 64-bit and 128-bit key sizes. Generated during Phase 2.
Success:
  1. ENTROPY THRESHOLD: H(ε_1, ε_2, ε_3 | public data, T < T_target - 24h) ≥ 128 bits, measured across ≥50 simulated epochs, with 95% CI lower bound ≥ 100 bits.
  2. KEY DERIVATION QUALITY: NIST SP 800-90B min-entropy estimate for K_outer ≥ 127.5 bits across 10,000 Monte Carlo trials; collision probability < 2^-120; avalanche effect ≥ 49% bit flip rate per input bit change.
  3. FORWARD TTL: Adversary prediction accuracy σ_pred ≥ 50 ns for all 3 pulsars using best available ML/statistical methods on pre-T_target data (i.e., adversary fails to predict residuals accurately enough to derive K_outer).
  4. BACKWARD TTL: Zero successful K_session recoveries in 1,000 post-erasure forensic attempts across SoftHSM2 simulation; HSM audit logs confirm erasure within Δ + 5 seconds.
  5. LIVE TEST: Successful decryption in ≥18/20 live telescope trials within window Δ; zero successful decryptions in 20 post-window attempts.
  6. QUANTUM RESISTANCE: Grover's attack requires ≥ 2^64 quantum oracle queries for K_outer; SHA3-256 collision resistance confirmed at ≥ 2^85 quantum queries.
  7. SPOOFING RESISTANCE: Spoofing detection probability P_detect ≥ 0.999 for adversary without physical access to telescope hardware, assuming ≥2 independent telescope sites.
  8. RED-TEAM: No critical vulnerabilities found; ≤2 major vulnerabilities found and patched; scheme-breaking attack not demonstrated by any red team.
  9. LATENCY: Full decryption pipeline (residual computation → key derivation → decryption) completes in ≤ 60 seconds from T_target, well within Δ = 300 seconds.
  10. REPRODUCIBILITY: Independent replication of entropy estimates within ±10 bits by ≥1 external team using published code and data.
Failure:
  1. ENTROPY COLLAPSE: H(ε_1, ε_2, ε_3 | public data) < 64 bits in ≥10% of simulated epochs — scheme provides insufficient forward security.
  2. RESIDUAL PREDICTABILITY: Any adversary method achieves σ_pred < 10 ns for ≥2 pulsars simultaneously — forward time-lock is broken.
  3. SESSION KEY RECOVERY: Any successful K_session recovery after T_target + Δ in simulation or hardware test — backward time-lock is broken.
  4. LIVE TEST FAILURE: Decryption success rate < 80% in live telescope trials (< 16/20) — scheme is operationally unreliable.
  5. QUANTUM VULNERABILITY: Discovery of quantum algorithm requiring < 2^48 queries to break K_outer derivation — quantum resistance claim is falsified.
  6. CRITICAL RED-TEAM FINDING: Any red team demonstrates full scheme break (decryption outside window) — scheme is cryptographically unsound.
  7. TIMING CORRELATION: Pairwise correlation |r(ε_i, ε_j)| > 0.7 for any pulsar pair across ≥30 epochs — joint entropy is lower than claimed.
  8. INFRASTRUCTURE DEPENDENCY: Scheme requires pre-shared secrets or trusted infrastructure beyond what is specified — "no trusted third party" claim is falsified.
  9. LATENCY OVERRUN: Decryption pipeline requires > 240 seconds (> 80% of Δ = 300s) in ≥25% of trials — scheme is operationally impractical.

420

GPU hours

245d

Time to result

$18,500

Min cost

$127,000

Full cost

ROI Projection

Commercial:
  1. PRODUCT OPPORTUNITIES: (a) BTLE-as-a-Service API for timed document release ($50–$500/encryption event); (b) HSM firmware module for session key management (licensing to Thales, Entrust, nCipher: $5M–$20M); (c) Pulsar timing beacon subscription service for key derivation ($100K–$1M/year per enterprise customer).
  2. PATENT LANDSCAPE: Core BTLE mechanism (pulsar-derived key + ephemeral session key) is likely patentable; estimated 3–5 core patents with licensing value $10M–$50M. Freedom-to-operate analysis needed against existing time-lock and PUF patents.
  3. STANDARDS BODY ENGAGEMENT: Submission to IETF (new RFC for BTLE protocol), ISO/IEC JTC 1/SC 27 (cryptographic standards), and NIST (post-quantum cryptography supplement). Standards adoption timeline: 5–10 years; market impact upon adoption: $500M+.
  4. ACADEMIC SPINOUT: University TTO licensing opportunity; estimated spinout valuation $5M–$30M at seed stage based on comparable cryptographic infrastructure companies (e.g., Keyless, Arqit).
  5. INSURANCE AND LEGAL: Time-locked legal instruments (wills, contracts, whistleblower disclosures) represent $200M+ addressable market; BTLE provides stronger guarantees than existing solutions (notary, escrow, blockchain).
  6. DEFENSE INDUSTRIAL BASE: Secure time-locked communications for autonomous systems (drones, satellites) that must execute actions at precise future times without real-time command links — $300M+ defense procurement opportunity.

🔓 If proven, this unlocks

Proving this hypothesis is a prerequisite for the following downstream discoveries and applications:

  • 1pulsar-timing-array-cryptographic-beacon-network
  • 2physical-unclonable-function-astrophysical-puf
  • 3quantum-resistant-time-capsule-protocol
  • 4distributed-pulsar-key-infrastructure-dpki
  • 5gravitational-wave-background-entropy-harvesting
  • 6btle-satellite-secure-communications
  • 7post-quantum-time-release-cryptography-standard

Prerequisites

These must be validated before this hypothesis can be confirmed:

  • pulsar-timing-entropy-characterization-v1
  • millisecond-pulsar-noise-model-ipta-dr2
  • hkdf-sha3-quantum-resistance-analysis
  • hsm-secure-erasure-verification-protocol
  • nanograv-15yr-residual-statistics

Implementation Sketch

# BTLE System Architecture — Pseudocode Outline
# ================================================

# === ENCRYPTION (at T_enc) ===
def btle_encrypt(plaintext, T_target, delta_seconds, pulsar_ids, salt):
    # 1. Generate ephemeral session key
    K_session = HSM.generate_csprng_key(256)  # Never leaves HSM until T_target
    HSM.store_with_release_schedule(K_session, T_target, T_target + delta_seconds)
    
    # 2. Encrypt plaintext with session key (inner layer)
    inner_ciphertext = AES_256_GCM.encrypt(K_session, plaintext)
    
    # 3. Construct pulsar key derivation commitment
    commitment = {
        'T_target': T_target,
        'pulsar_ids': pulsar_ids,  # e.g., ['J0437-4715', 'J1909-3744', 'J1713+0747']
        'quantization_ns': 10,     # 10 ns bins
        'salt': salt,              # 256-bit random salt, public
        'kdf': 'HKDF-SHA3-256'
    }
    
    # 4. Encrypt inner ciphertext with placeholder outer key
    # (outer key K_outer does not exist yet — commitment is stored in header)
    outer_ciphertext = ChaCha20_Poly1305.encrypt_with_commitment(
        commitment, inner_ciphertext
    )
    
    # 5. Package ciphertext bundle
    bundle = {
        'version': 'BTLE-1.0',
        'commitment': commitment,
        'outer_ciphertext': outer_ciphertext,
        'hsm_endpoint': HSM.get_public_endpoint(),
        'hsm_attestation': HSM.sign(commitment)
    }
    return bundle

# === KEY DERIVATION (at T_target, by authorized receiver) ===
def derive_outer_key(pulsar_residuals, commitment):
    # pulsar_residuals: dict {pulsar_id: residual_ns (float)}
    # Quantize residuals to 10 ns bins
    quantized = []
    for pid in commitment['pulsar_ids']:
        r = pulsar_residuals[pid]
        r_q = round(r / commitment['quantization_ns']) * commitment['quantization_ns']
        quantized.append(r_q.to_bytes(8, 'big'))  # 64-bit signed integer
    
    # Concatenate and derive key
    residual_bytes = b''.join(quantized)
    K_outer = HKDF_SHA3_256(
        ikm=residual_bytes,
        salt=commitment['salt'],
        info=f"BTLE-outer-{commitment['T_target']}".encode(),
        length=32  # 256 bits
    )
    return K_outer

# === DECRYPTION (during [T_target, T_target + delta]) ===
def btle_decrypt(bundle, telescope_data):
    T_now = get_verified_utc_time()  # GPS-disciplined clock
    commitment = bundle['commitment']
    
    # Verify timing window
    assert commitment['T_target'] <= T_now <= commitment['T_target'] + commitment['delta']
    
    # Step 1: Compute pulsar residuals from telescope data
    residuals = compute_timing_residuals(
        telescope_data,
        pulsar_ids=commitment['pulsar_ids'],
        ephemeris='DE440',
        timing_model='TEMPO2'
    )
    
    # Step 2: Derive outer key from physical observables
    K_outer = derive_outer_key(residuals, commitment)
    
    # Step 3: Decrypt outer layer
    inner_ciphertext = ChaCha20_Poly1305.decrypt(K_outer, bundle['outer_ciphertext'])
    
    # Step 4: Retrieve session key from HSM (only available during window)
    K_session = HSM.retrieve_session_key(
        endpoint=bundle['hsm_endpoint'],
        attestation=bundle['hsm_attestation'],
        T_now=T_now
    )
    # HSM enforces: returns K_session only if T_target <= T_now <= T_target + delta
    # HSM executes secure erase at T_target + delta regardless of retrieval
    
    # Step 5: Decrypt inner layer
    plaintext = AES_256_GCM.decrypt(K_session, inner_ciphertext)
    return plaintext

# === HSM SESSION KEY MANAGER ===
class BTLESessionKeyHSM:
    def store_with_release_schedule(self, K_session, T_release, T_erase):
        self.vault[id] = {
            'key': K_session,
            'T_release': T_release,
            'T_erase': T_erase,
            'retrieved': False
        }
        self.audit_log.append(('STORE', id, T_release, T_erase))
    
    def retrieve_session_key(self, id, T_now):
        entry = self.vault[id]
        if not (entry['T_release'] <= T_now <= entry['T_erase']):
            raise WindowViolationError("Outside decryption window")
        entry['retrieved'] = True
        self.audit_log.append(('RETRIEVE', id, T_now))
        return entry['key']
    
    def scheduled_erase(self):
        # Runs continuously; erases keys at T_erase
        for id, entry in self.vault.items():
            if get_utc_time() >= entry['T_erase']:
                secure_overwrite(entry['key'], passes=7)  # DoD 5220.22-M
                del self.vault[id]
                self.audit_log.append(('ERASE', id, get_utc_time()))

# === ENTROPY ESTIMATION PIPELINE ===
def estimate_residual_entropy(ipta_data, target_epochs, cutoff_hours=24):
    entropies = []
    for T_sim in target_epochs:
        # Train timing model

Source

AegisMind Research
Need AI to work rigorously on your problems? AegisMind uses the same multi-model engine for personal and professional use. Get started