🔓 Break This
TreeChain claims the Three-Layer Fortress defeats pattern analysis, corpus attacks, and statistical convergence. Prove us wrong.
📋 Challenge Rules
- All encryption hits our live production API — 4 servers across EU, US, and APAC
- You get: ciphertexts, known plaintexts, unlimited attempts, server response metadata
- You don't get: keys, RNG state, glyph mapping tables, rotor positions, source code
- Goal: Find any pattern, correlation, convergence, or predictability
★ Cross-Server Verification
🎯 What This Proves
Data encrypted on Server A is sent to Server B for decryption. Both servers share a provenance database but have no direct communication. If Server B can decrypt Server A's output, the distributed mesh is working correctly. Servers rotate with each test.
1 The Wall — What Attackers See
🎯 What This Proves
The same Social Security Number is encrypted multiple times. Each encryption produces completely different output — wrapped in different haiku poetry from different cultures. An attacker with database access sees multilingual poetry, not patterns. Click "Encrypt Again" to watch it change.
👁️ What You See
2 Live Server Mesh
🎯 What This Proves
TreeChain runs on 4 independent servers across 3 continents. Each server encrypts the same plaintext differently. If you find any two outputs that match across servers or iterations, you've found a flaw. Test each server individually or hit all 4 simultaneously.
3 Determinism Test
🎯 What This Proves
Traditional encryption is deterministic: same input → same output. TreeChain's stochastic layer ensures every encryption is unique, even for identical plaintext. Run 10, 25, or 50 encryptions of the same message. Find any collision = break the cipher.
4 Known Plaintext Attack
🎯 What This Proves
In classic cryptanalysis, knowing plaintext/ciphertext pairs lets attackers derive the key or predict future outputs. We give you 10 pairs. Predict what the 11th output will be. If you can predict it, you've broken the cipher.
5 Corpus Analysis
🎯 What This Proves
We encrypt 10 messages — some are duplicates. The encrypted outputs are shuffled randomly. Your challenge: identify which ciphertexts came from the same plaintext. Traditional ciphers make this trivial. TreeChain makes it impossible.
6 Haiku Boundary Problem
🎯 What This Proves
Layer 3 wraps encrypted glyphs in haiku poetry. The same data wrapped 5 times produces 5 different poems in different styles. Which characters are poetry? Which are ciphertext? This boundary is computationally impossible to determine without the key.
7 Frequency Analysis
🎯 What This Proves
In natural language and weak ciphers, some characters appear more often than others (e.g., 'E' in English). We encrypt text 25+ times and count glyph frequencies. If the distribution is uniform (all glyphs roughly equal), frequency analysis fails. TreeChain uses 133,387 glyphs — you can't build a frequency table.
8 Live Rotor State
🎯 What This Shows
Like the Enigma machine, TreeChain uses position-dependent "rotors" that change the glyph mapping for each character position. The rotors spin with every encryption — you see the animation, but you cannot know the internal state without the key.
Rotors animate with each encryption. State is derived from HMAC — not reversible.
🏆 Bug Bounty — Tiered Rewards
Submit findings to: security@treechain.ai
📐 Technical Architecture
Layer 1
ChaCha20-Poly1305 AEAD
Layer 2
133,387 Unicode Glyphs
Layer 3
Haiku Steganography
Entropy
CSPRNG + Hardware
Rotor
Position-Dependent HMAC
Mesh
4 Nodes: EU, US, APAC
Prove us wrong.
Take the Break This Challenge
Prove you can crack TreeChain encryption and claim the 100,000 TREE bounty.
See the Cryptographic Proofs
NIST-based statistical tests running against live production servers.