US 12,088,702 B2
Systems and methods for adaptive recursive descent data redundancy
David Lanc, Edinburgh (GB); Sophie Lanc, Edinburgh (GB); Josh Fraser, Edinburgh (GB); Lachlan Mackinnon, Edinburgh (GB); Jamie Hunter, Edinburgh (GB); and Iain Sutherland, Edinburgh (GB)
Assigned to CYBORN LIMITED, Edinburgh (GB)
Filed by CYBORN LIMITED, Edinburgh (GB)
Filed on Apr. 10, 2020, as Appl. No. 16/845,895.
Prior Publication US 2021/0320791 A1, Oct. 14, 2021
Int. Cl. H04L 9/08 (2006.01); G06F 21/62 (2013.01); G06N 10/00 (2022.01); H03M 7/30 (2006.01)
CPC H04L 9/0852 (2013.01) [G06F 21/6218 (2013.01); G06N 10/00 (2019.01); H03M 7/30 (2013.01); H04L 9/0819 (2013.01); H04L 9/085 (2013.01); H04L 2209/30 (2013.01)] 11 Claims
OG exemplary drawing
 
1. A computer-implemented method for quantum fragmenting a data object or file, comprising:
identifying the data object or file for Quantum Fragmentation;
determining, via a first portion of a Quantum Fragmentation computing entity, a factor of fragmentation for the data object or file;
transforming the data object or file into a plurality of first data fragments according to the factor of fragmentation by applying one or more cryptographic processing, integrity checking, and resilient fragmentation schemes, via the first portion of the Quantum Fragmentation computing entity, wherein the transforming is variable and dynamically defined, in terms of the number of data fragments for each data object or file; and
persisting, via the first portion of the Quantum Fragmentation computing entity, each of the plurality of first data fragments to a data store of a plurality of available Cloud or other data stores or to a subsequent portion of the Quantum Fragmentation computing entity, wherein the persistence for each of the first data fragment occurs independently from the other first data fragments.