Indahl

美龙 Meilong

SHA-256. XOR split. Three lanes. Reassemble or fail.

Tunnel — Idle
21 nodes. 7 rings. 3 lanes. Click a node to intercept.

What this is

SHA-256 + XOR split. Your message is hashed. Two random byte arrays are generated. A third is computed: hash XOR random1 XOR random2. Each fragment alone is random noise — meaningless without the other two.
Three lanes. Each fragment routes through a separate lane in a 21-node tunnel (7 rings × 3). Every node timestamps the fragment. At the exit, all three must arrive to reconstruct the hash.
Intercept one lane: you get random bytes. No key, no pattern, no partial data. The XOR makes each fragment indistinguishable from noise without the other two.
Timing consensus. All three lanes should arrive within the same timing window. A node that was intercepted takes longer to forward. The data still arrives — but late. The timing drift is the detection.

Split a file

Everything goes inside the XOR — filename, type, size, content. Each fragment is a flat opaque blob. No metadata. No envelope. Noise or nothing.

Drop a file here or browse

Reassemble

Load all three .meilong fragments. Only when all three are present can the original be reconstructed.

The message never travels whole. Three fragments, three lanes, three random arrays.
Intercept one: noise. Intercept two: noise. Need all three to reconstruct.
No keys. No shared secrets. The split is the security.

heurémen indahl contact