# US 2025/0390761 A1 · Apparatus and methods for embedding data in genetic material

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2025/0390761 A1
- Document ID: US20250390761A1
- Status: Published application
- Kind: A1
- Application number: 19/298,711
- Filed: 2025-08-13
- Published: 2025-12-25
- Earliest claimed: 2021-12-31
- Assignees: CustomArray, Inc.
- Applicants: CustomArray, Inc.
- Inventors: Andrew Michael Antoniewicz
- Web page: https://patentgrep.com/patent/US20250390761A1

## CPC

- G06F 7/74: Selecting or encoding within a word the position of one or more bits having a specified value, e.g. most or least significant one or zero detection, priority encoders {(with shifting G06F5/01)}
- G06N 3/123: DNA computing
- H03M 13/3761: {using code combining, i.e. using combining of codeword portions which may have been transmitted separately, e.g. Digital Fountain codes, Raptor codes or Luby Transform [LT] codes}
- H03M 13/611: {Specific encoding aspects, e.g. encoding by means of decoding}
- H03M 7/6052: {Synchronisation of encoder and decoder}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)

## Abstract

Methods, systems, and apparatuses to encode data for storage in genetic materials. For example, a computing system may segment user data into a plurality of data blocks and generate seed data characterizing a plurality of fountain code seeds. Additionally, the computing system may, for each data block, implement a set of operations that generate one or more data packets. In some instances, the set of operations may include, for each of the plurality of fountain code seeds, determining a bit value and corresponding metaCode value and determining which of the fountain code seeds has a metaCode value of the bit value that matches a value of the bit position identified in the metadata. Moreover, the computing system may, for each data packet, cause an implementation of a second set of operations that synthesize a polynucleotide strand in accordance with at least bit values of the corresponding data packet.

## Claims

### Claim 1

A computing system:
a memory storing instructions; and
at least one processor coupled to the communications interface and to the memory, the at least one processor being configured to execute the instructions to:
segment user data into a plurality of data blocks, each data block including metadata;
generate seed data, the seed data characterizing a plurality of Fountain code seeds;
for each of the plurality of data blocks, implement a first set of operations that generate one or more data packets, the set of operations including:
for each of the plurality of Fountain code seeds:
determining a bit value identifying a bit position in the metadata and a metaCode value identifying and characterizing information being passed by the corresponding bit value; and
determining which of the plurality of Fountain code seeds has a metaCode value of the bit value that matches a value of the bit position identified in the metadata, each of the one or more data packets being associated with a Fountain code seed of the plurality of Fountain code seeds that has the metaCode value of the bit value that matches the value of the bit position identified in the associated metadata; and
for each data packet, cause an implementation of a second set of operations that synthesize a polynucleotide strand in accordance with at least bit values of the corresponding data packet.

### Claim 2 (depends on 1)

The computing system of claim 1, wherein the first set of operations further includes:
for each of the plurality of Fountain code seeds:
determining a data block identifier; and
determining which of the plurality of Fountain code seeds has a data block identifier that matches a block identifier identified in the associated metadata.

### Claim 3 (depends on 1)

The computing system of claim 1, wherein the first set of operations further includes:
for each of the plurality of Fountain code seeds, determining whether a particular Fountain code seed has been previously used in a synthesis of a polynucleotide strand.

### Claim 4 (depends on 1)

The computing system of claim 1, wherein the second set of operations includes:
encoding each of the one or more data packets as a sequence of nucleic acids; and
based on the sequence of nucleic acids, synthesizing a polynucleotide strand.

### Claim 5 (depends on 4)

The computing system of claim 4, wherein the second set of operations includes:
attaching a first primer and a second primer to each polynucleotide strand.

### Claim 6 (depends on 5)

The computing system of claim 5, wherein the at least one processor is further configured to:
for each polynucleotide strand, determine whether the corresponding polynucleotide strand satisfies a set of sequence criteria.

### Claim 7 (depends on 6)

The computing system of claim 6, wherein the set of sequence criteria includes:
at least one of a criterion associated with nucleotides repeating, a criterion associated with nucleotide patterns, and a criterion associated with nucleotide pair ratios.

### Claim 8 (depends on 1)

The computing system of claim 1, wherein, for each data packet, causing the implementation of the second set of operations that synthesize a polynucleotide strand in accordance with at least bit values of the corresponding data packet, includes, generating and transmitting an instruction to a device, the device being configured to implement the second set of operations.

### Claim 9 (depends on 1)

The computing system of claim 1, wherein, the second set of operations includes causing one or more electrodes of a set of electrodes to that synthesize a polynucleotide in accordance with at least bit values of the corresponding data packet.

### Claim 10 (depends on 1)

The computing system of claim 1, wherein for each of the plurality of data blocks, the one or more data packets is associated with one or more elements of the corresponding data block.

### Claim 11 (depends on 1)

The computing system of claim 1, wherein the plurality of data blocks are non-overlapping.

### Claim 12 (depends on 1)

The computing system of claim 1, wherein the metadata comprises parameters for the encoding.

### Claim 13

A computer-implemented method comprising:
segmenting, by at least a first processor, user data into a plurality of data blocks, each data block including metadata;
generating, by at least the first processor, seed data, the seed data characterizing a plurality of Fountain code seeds;
for each of the plurality of data blocks, implementing, by at least the first processor, a first set of operations that generate one or more data packets, the set of operations including:
for each of the plurality of Fountain code seeds:
determining a bit value identifying a bit position in the metadata and a metaCode value identifying and characterizing information being passed by the corresponding bit value; and
determining which of the plurality of Fountain code seeds has a metaCode value of the bit value that matches a value of the bit position identified in the metadata, each of the one or more data packets being associated with a Fountain code seed of the plurality of Fountain code seeds that has the metaCode value of the bit value that matches the value of the bit position identified in the associated metadata; and
for each data packet, causing, by at least the first processor, an implementation of a second set of operations that synthesize a polynucleotide strand in accordance with at least bit values of the corresponding data packet.

### Claim 14 (depends on 13)

The computer-implemented method of claim 13, wherein the first set of operations further includes:
for each of the plurality of Fountain code seeds:
determining a data block identifier; and
determining which of the plurality of Fountain code seeds has a data block identifier that matches a block identifier identified in the associated metadata.

### Claim 15 (depends on 13)

The computer-implemented method of claim 13, wherein the first set of operations further includes:
for each of the plurality of Fountain code seeds, determining whether a particular Fountain code seed has been previously used in a synthesis of a polynucleotide strand.

### Claim 16 (depends on 13)

The computer-implemented method of claim 13, wherein the first set of operations further includes:
for each of the plurality of data blocks, determining whether the generate data packets are together associated with all of data elements of the corresponding data block.

### Claim 17 (depends on 13)

The computer-implemented method of claim 13, wherein the second set of operations includes:
encoding each of the one or more data packets as a sequence of nucleic acids; and
based on the sequence of nucleic acids, synthesizing a polynucleotide strand.

### Claim 18 (depends on 17)

The computer-implemented method of claim 17, wherein the second set of operations includes:
attaching a first primer and a second primer to each polynucleotide strand.

### Claim 19 (depends on 18)

The computer-implemented method of claim 18, further comprising
for each polynucleotide strand, determining whether the corresponding polynucleotide strand satisfies a set of sequence criteria.

### Claim 20

A non-transitory, machine-readable storage medium storing instructions that, when executed by at least one processor of a server, causes the at least one processor to perform operations that include:
segmenting user data into a plurality of data blocks, each data block including metadata;
generating seed data, the seed data characterizing a plurality of Fountain code seeds;
for each of the plurality of data blocks, implementing a first set of operations that generate one or more data packets, the set of operations including:
for each of the plurality of Fountain code seeds:
determining a bit value identifying a bit position in the metadata and a metaCode value identifying and characterizing information being passed by the corresponding bit value; and
determining which of the plurality of Fountain code seeds has a metaCode value of the bit value that matches a value of the bit position identified in the metadata, each of the one or more data packets being associated with a Fountain code seed of the plurality of Fountain code seeds that has the metaCode value of the bit value that matches the value of the bit position identified in the associated metadata; and
for each data packet, implementing a second set of operations that synthesize a polynucleotide strand in accordance with at least bit values of the corresponding data packet.
