DNA Data Storage 2D: 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 — a 2D layered readout of storage density vs. decode reliability, with a live binomial probability chart.
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. A layered 2D readout shows the original sequence, every physical copy row-by-row (draggable/zoomable for long payloads), the decoded strand, and a live binomial probability chart plotting decode reliability against error rate for every redundancy level — showing exactly how physical redundancy trades storage density for decode reliability.
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 — a 2D layered readout (original strand, draggable/zoomable copies grid, decoded strand, and a live binomial probability chart per redundancy level) driving the same storage-density-vs-reliability trade-off as the 3D version.
2D · HTML5 Canvas 2D · 60 FPS target · runs fully client-side, no install