# US 2025/0156335 A1 · Vector processor storage

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

- Number: US 2025/0156335 A1
- Document ID: US20250156335A1
- Status: Published application
- Kind: A1
- Application number: 19/020,108
- Filed: 2025-01-14
- Published: 2025-05-15
- Earliest claimed: 2018-08-31
- Assignees: Daedalus Cloud LLC
- Applicants: Daedalus Cloud LLC
- Inventors: Xavier Aldren SIMMONS; Jack Spencer TURPITT; Rafael John Patrick SHUKER; Tyler Wilson HALE; Alexander Kingsley ST. JOHN; Stuart John INGLIS
- Web page: https://patentgrep.com/patent/US20250156335A1

## CPC

- G06F 12/0842: for multiprocessing or multitasking
- G06F 12/10: Address translation
- G06F 3/0607: {by facilitating the process of upgrading existing storage systems, e.g. for improving compatibility between host and storage device}
- G06F 3/061: {Improving I/O performance}
- G06F 3/0619: {in relation to data integrity, e.g. data losses, bit errors}
- G06F 3/064: {Management of blocks}
- G06F 3/065: {Replication mechanisms}
- G06F 3/0652: {Erasing, e.g. deleting, data cleaning, moving of data to a wastebasket}
- G06F 3/0688: {Non-volatile semiconductor memory arrays}
- G06F 3/0689: {Disk arrays, e.g. RAID, JBOD}
- G06F 9/30036: {Instructions to perform operations on packed data, e.g. vector, tile or matrix operations}
- G06F 9/30123: {according to context, e.g. thread buffers}
- G06F 9/3877: {using a secondary processor, e.g. coprocessor (peripheral processor G06F13/12)}
- G06F 9/3881: {Arrangements for communication of instructions and data}
- G06F 11/1004: {to protect a block of data words, e.g. CRC or checksum (G06F11/1076 takes precedence; security arrangements for protecting computers or computer systems against unauthorized activity G06F21/00)}
- G06F 11/1076: {Parity data used in redundant arrays of independent storages, e.g. in RAID systems}
- G06F 11/1088: {Reconstruction on already foreseen single or plurality of spare disks}
- G06F 12/0246: {in block erasable memory, e.g. flash memory}
- G06F 12/0815: Cache consistency protocols
- G06F 12/0868: Data transfer between cache memory and other subsystems, e.g. storage devices or host systems
- G06F 12/0871: Allocation or management of cache space
- G06F 12/12: Replacement control
- G06F 12/1408: {by using cryptography (for digital transmission H04L9/00)}
- G06F 15/167: using a common memory, e.g. mailbox
- G06F 3/0679: {Non-volatile semiconductor memory device, e.g. flash memory, one time programmable memory [OTP]}
- G06F 12/126: with special data handling, e.g. priority of data or instructions, handling errors or pinning
- G06F 13/1663: {Access to shared memory}
- G06F 2212/1024: Latency reduction
- G06F 2212/1032: Reliability improvement, data loss prevention, degraded operation etc
- G06F 2212/1052: Security improvement
- G06F 2212/222: Non-volatile memory
- G06F 2212/261: Storage comprising a plurality of storage devices
- G06F 2212/286: Mirrored cache memory
- G06F 2212/301: In special purpose processing node, e.g. vector processor
- G06F 2212/3042: being part of a memory device, e.g. cache DRAM
- G06F 2212/401: Compressed data
- G06F 2212/402: Encrypted data
- G06F 2212/403: Error protection encoding, e.g. using parity or ECC codes
- G06F 2212/461: Sector or disk block
- G06F 2212/657: Virtual address space management
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A method comprising: receiving, at a vector processor, a request to store data; performing, by the vector processor, one or more transforms on the data; and directly instructing, by the vector processor, one or more storage device to store the data; wherein performing one or more transforms on the data comprises: erasure encoding the data to generate n data fragments configured such that any k of the data fragments are usable to regenerate the data, where k is less than n; and wherein directly instructing one or more storage device to store the data comprises: directly instructing the one or more storage devices to store the plurality of data fragments.

## Claims

### Claim 1

A method comprising:
receiving, at a vector processor, a request to store data;
performing, by the vector processor, one or more transforms on the data, wherein performing one or more transforms on the data comprises erasure encoding the data to generate n data fragments configured such that any k of the data fragments are usable to regenerate the data, where k is less than n;
instructing, by the vector processor, one or more storage devices to store the data; and
receiving, by the vector processor, an acknowledgment from the one or more storage devices that m of the data fragments have been stored, in which k≤m<n.

### Claim 2 (depends on 1)

The method of claim 1, wherein performing one or more transforms on the data comprises performing one or more invertible transforms on the data.

### Claim 3 (depends on 1)

The method of claim 1, wherein:
performing one or more transforms on the data further comprises calculating a cryptographic hash for the data; and
instructing one or more storage device to store the data comprises instructing the one or more storage devices to store the cryptographic hash for the data.

### Claim 4 (depends on 1)

The method of claim 1, wherein performing one or more transforms on the data comprises logging a storage event associated with the request to store data.

### Claim 5 (depends on 1)

The method of claim 1, wherein performing one or more transforms on the data comprises one or more of encrypting or compressing the data.

### Claim 6 (depends on 1)

A system comprising:
a vector processor; and
a memory, wherein the memory comprises instructions which, when executed by the vector processor, configure the vector processor to perform the method of claim 1.

### Claim 7 (depends on 1)

One or more non-transitory computer readable media comprising instructions which, when executed by a vector processor, cause the vector processor to perform the method of claim 1.

### Claim 8

A method comprising:
storing a plurality of data fragments at a memory;
periodically attempting, by a vector processor, to decode the plurality of data fragments stored at the memory, wherein when an insufficient number of data fragments have been written to the memory, the vector processor failing to correctly decode the data fragments, and wherein when a sufficient number of data fragments have been written to the memory, the vector processor correctly decoding the plurality of data fragments to form decoded data; and
utilizing a checksum included in the decoded data to determine whether the decoded data was decoded correctly.

### Claim 9 (depends on 8)

The method of claim 8, wherein the vector processor utilizes a Berlekamp-Welch algorithm to decode the plurality of data fragments.

### Claim 10 (depends on 8)

The method of claim 8, further comprising storing the decoded data at a first memory address specified in a data retrieval request.

### Claim 11 (depends on 8)

The method of claim 8, wherein the vector processor attempts to periodically decode the plurality of data fragments stored at the memory in response to a request to retrieve data stored at the memory.

### Claim 12 (depends on 8)

The method of claim 8, wherein the vector processor comprises one or more of a graphics processing unit (GPU) or a field programmable gate array (FPGA).

### Claim 13 (depends on 8)

A system comprising:
a vector processor; and
a memory, wherein the memory comprises instructions which, when executed by the vector processor, configure the vector processor to perform the method of claim 8.

### Claim 14 (depends on 8)

One or more non-transitory computer readable media comprising instructions which, when executed by a vector processor, cause the vector processor to perform the method of claim 8.

### Claim 15

A method, comprising:
receiving, by a vector processor, a request to store data;
performing, by the vector processor, one or more transforms on the data; and
storing, by the vector processor, respective parts of the transformed data on a first and a second storage device, wherein the vector processor simultaneously instructs the first and second storage devices to store the respective parts of the transformed data.

### Claim 16 (depends on 15)

The method of claim 15, wherein the one or more transforms comprise one or more of encrypting the data, encoding the data, compressing the data, deduplicating the data, or logging the data.

### Claim 17 (depends on 15)

The method of claim 15, wherein the first and second storage devices each include one or more of a hard disk drive, a solid-state drive, a network device or a storage controller that is communicatively coupled to a further storage device.

### Claim 18 (depends on 15)

The method of claim 15, further comprising, after storing the respective parts of the transformed data on the first and second storage devices, acknowledging, by the vector processor, that the data has been stored.

### Claim 19 (depends on 15)

A system comprising:
a vector processor; and
a memory, wherein the memory comprises instructions which, when executed by the vector processor, configure the vector processor to perform the method of claim 15.

### Claim 20 (depends on 15)

One or more non-transitory computer readable media comprising instructions which, when executed by a vector processor, cause the vector processor to perform the method of claim 15.
