DNA Data Storage: Redundancy & Majority-Vote Decoding
Encode a byte payload into synthetic DNA bases, synthesize R redundant molecule copies with a tunable per-base error rate, then sequence and majority-vote decode them back — watch storage density trade off against decode reliability in 3D.
DNA can, in principle, pack about 215 petabytes of data into a single gram — but real archival systems never write a message as one fragile copy. This simulator encodes a byte payload into synthetic DNA bases (2 bits each), synthesizes a chosen number of redundant physical copies, subjects every base of every copy to an adjustable substitution-error rate, then "sequences" the pool and majority-votes each position back to a decoded strand rendered as an interactive 3D instanced structure. Live readouts track bits encoded, effective storage density in bits per base, the theoretical majority-vote success probability from the binomial model, and the actual fraction of bases the simulated run recovered correctly — showing exactly how physical redundancy trades storage density for decode reliability.
Encode a byte payload into synthetic DNA bases, synthesize redundant molecule copies with a tunable error rate, then sequence and majority-vote decode them — see storage density trade off against decode reliability in an interactive 3D instanced strand.
3D · Three.js / WebGL renderer · 60 FPS target · runs fully client-side, no install