A DNA-Based Archival Storage System
Abstract
Demand for data storage is growing exponentially, but the capacity of existing storage media is not keeping up. Using DNA to archive data is an attractive possibility because it is extremely dense, with a raw limit of 1 exabyte/mm 3 (109 GB/mm 3 ), and long-lasting, with observed half-life of over 500 years. This paper presents an architecture for a DNA-based archival storage system. It is structured as a key-value store, and leverages common biochemical techniques to provide random access. We also propose a new encoding scheme that offers controllable redundancy, trading off reliability for density. We demonstrate feasibility, random access, and robustness of the proposed encoding with wet lab experiments involving 151 kB of synthesized DNA and a 42 kB random-access subset, and simulation experiments of larger sets calibrated to the wet lab experiments. Finally, we highlight trends in biotechnology that indicate the impending practicality of DNA storage for much larger datasets.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
DNA has emerged as an attractive alternative as conventional data storage media converge on their physical limits.
“As conventional data storage media steadily converge on their physical limits, DNA has emerged as an attractive alternative.[1][2][3][4][5]”
From Integrating DNA Encapsulates and Digital Microfluidics for Automated Data Storage in DNA (2022) · cites this paper as [3]
The citation lists haven’t been fetched yet
References 23 · Cited by 54
- Authors
- Bornholt, J., Lopez, R., Carmean, D. M., Ceze, L., Seelig, G., & Strauss, K.
- Affiliations
- University of Washington (US)
- Microsoft (United States) (US)
- University of Washington, Seattle, WA, USA
- Venue
- ACM SIGPLAN Notices
- Published
- 2016-03-25
- Volume
- 51
- Issue
- 4
- Pages
- 637-649
- ISSN
- 0362-1340 (ISSN-L)
- 1558-1160
- OpenAlex
- W4231505808
- Cited by
- 54
- References
- 23
- Citations by year
- 2026: 4 · 2025: 5 · 2024: 7 · 2023: 6 · 2022: 13 · 2021: 6 · 2020: 3 · 2019: 2 · 2018: 5 · 2017: 2 · 2016: 1
- FWCI
- 1.73
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- ACM SIGPLAN Notices (publishedVersion)
- Funders
- National Science Foundation (1409831)
- Topics
- Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › DNA and Biological Computing
- Physical Sciences › Computer Science › Computer Networks and Communications › Advanced Data Storage Technologies
- Physical Sciences › Computer Science › Artificial Intelligence › Algorithms and Data Compression
- Keywords
- DNA data storage, archival storage, key-value stores, random access, redundancy, storage density, data longevity, DNA synthesis, storage architecture
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review