# US 10,503,933 B2 · Structured data folding with transmutations > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 10,503,933 B2 - Document ID: US10503933B2 - Status: Granted - Kind: B2 - Application number: 15/692,648 - Filed: 2017-08-31 - Published: 2018-03-15 - Granted: 2019-12-10 - Earliest claimed: 2016-09-15 - Assignees: Nuts Holdings, LLC - Applicants: Nuts Holdings, LLC - Inventors: Yoon Ho Auh - Web page: https://patentgrep.com/patent/US10503933B2 ## CPC - G06F 21/78: to assure secure storage of data (address-based protection against unauthorised use of memory G06F12/14; record carriers for use with machines and with at least a part designed to carry digital markings G06K19/00) - G06F 16/258: {Data format conversion from or to a database} - G06F 21/602: {Providing cryptographic facilities or services} - G06F 21/6227: {where protection concerns the structure of data, e.g. records, types, queries} - H04L 9/0637: {Modes of operation, e.g. cipher block chaining [CBC], electronic codebook [ECB] or Galois/counter mode [GCM]} - H04L 9/0643: {Hash functions, e.g. MD5, SHA, HMAC or f9 MAC} - H04L 9/085: {Secret sharing or secret splitting, e.g. threshold schemes} - H04L 9/0861: {Generation of secret information including derivation or calculation of cryptographic keys or passwords} - H04L 9/14: using a plurality of keys or algorithms - H04L 9/3226: {using a predetermined code, e.g. password, passphrase or PIN (network architectures or network communication protocols for supporting authentication of entities using passwords in a packet data network H04L63/083)} - H04L 9/3242: {involving keyed hash functions, e.g. message authentication codes [MACs], CBC-MAC or HMAC} - H04L 9/3247: {involving digital signatures} - H04L 63/0281: {Proxies} - H04L 63/0442: {wherein the sending and receiving network entities apply asymmetric encryption, i.e. different keys for encryption and decryption (cryptographic mechanisms or cryptographic arrangements for public-key encryption H04L9/30)} - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) - H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M) ## Abstract A method of processing data includes at least one processor accessing a data storage unit, the data storage unit providing at least one input data object and at least one transmutation command to be performed on the at least one input data object. The at least one transmutation command operates in a forward mode on the at least one input data object to produce at least one output data object to be stored in a data storage unit. ## Claims ### Claim 1 A method of processing data comprising: at least one processor accessing a data storage structure in a memory, the data storage structure containing at least one data field including at least one input data object and at least one command field including a plurality of transmutation commands to be performed in a sequence specified in the data storage structure on a same one of the at least one input data object; operating in a forward traversal where each of the plurality of transmutation commands in the specified sequence is operated in a forward mode and the specified sequence is performed in a forward order on the at least one input data object to produce at least one output data object; and replacing the at least one input data object in the at least one data field of the data storage structure with the at least one output data object while leaving the plurality of transmutation commands in the at least one command field of the data storage structure wherein the plurality of transmutation commands is configured to be applied to the at least one output data object to recover the at least one input data object. ### Claim 2 (depends on 1) The method of claim 1, further comprising operating in a reverse traversal where each of the plurality of transmutation commands in the specified sequence is performed in a reverse mode and the specified sequence is performed in a reverse order on the at least one output data object to produce the at least one input data object; and replacing the at least one output data object in the data storage structure with the at least one input data object while leaving the plurality of transmutation commands in the data storage structure. ### Claim 3 (depends on 1) The method of claim 1, wherein at least one of the plurality of transmutation commands operating in a reverse mode comprises processing the at least one input data object in the forward mode to produce a second at least one output data object and comparing the at least one output data object with the second at least one output data object to produce a verification result. ### Claim 4 (depends on 1) The method of claim 1, wherein at least one of the plurality of transmutation commands, operating in the forward mode, requires at least one attribute to process the at least one input data object to produce at least one output data object. ### Claim 5 (depends on 4) The method of claim 4, wherein at least one of the plurality of transmutation commands, operating in a reverse mode, requires the at least one attribute to process the at least one output data object to produce the at least one input data object. ### Claim 6 (depends on 4) The method of claim 4, wherein the at least one processor generates the at least one attribute required by at least one of the plurality of transmutation commands operating in the forward mode to process the at least one input data object to produce at least one output data object. ### Claim 7 (depends on 5) The method of claim 5, wherein at least one of the plurality of transmutation commands, operating in the reverse mode, requires the at least one attribute to process the at least one input data object to produce at least one output data object comprising a verification result. ### Claim 8 (depends on 4) The method of claim 4, further comprising the at least one processor checking the structure of the at least one attribute presented for use by at least one of the plurality of transmutation commands operating in the forward mode which requires the at least one attribute of a specific structure to process the at least one input data object to produce the at least one output data object. ### Claim 9 (depends on 8) The method of claim 8, further comprising the at least one processor checking the structure of at least one attribute presented for use by at least one of the plurality of transmutation commands operating in the reverse mode which requires the at least one attribute of a specific structure to process the at least one output data object to produce the at least one input data object. ### Claim 10 (depends on 1) The method of claim 1, wherein at least one of the plurality of transmutation commands converts the data storage structure into a second data storage structure having a different structure than the first data storage structure. ### Claim 11 (depends on 10) The method of claim 10, wherein at least one of the plurality of transmutation commands is a mobius transmutation command. ### Claim 12 (depends on 1) The method of claim 1, wherein the data storage structure is provided as at least one input data object in a second data storage structure; and at least one processor accesses the second data storage structure to process the second data storage structure. ### Claim 13 (depends on 1) The method of claim 1, wherein two or more consecutive transmutation commands of the plurality of transmutation commands form a dependent group; and each transmutation command within the dependent group is processed in the same forward order operating in the forward traversal or a reverse traversal. ### Claim 14 (depends on 3) The method of claim 3, wherein at least one of the plurality of transmutation commands operating in the reverse mode produces a verification failure and terminates the processing of the plurality of transmutation commands. ### Claim 15 A method of folding data comprising: at least one processor processing at least one input data object to produce at least one output data object using a plurality of logical operations where the data folding encapsulates the at least one output data in at least one data field of a data structure with at least one essence of an entire sequence of the plurality of logical operations performed in discrete steps on a same one of the at least one input data object, the at least one essence of the entire sequence of logical operations being encapsulated of the plurality in at least one command field of the data structure; and at least one processor processing the at least one output data object from the at least one data field of the data structure to produce the same one of the at least one input data object using the encapsulated at least one essence of the entire sequence of the plurality of logical operations from the at least one command field of the data structure. ### Claim 16 (depends on 15) The method of claim 15, wherein the plurality of logical operations includes a transmutation. ### Claim 17 (depends on 15) The method of claim 15, wherein the at least one output data object is storable in a computing environment. ### Claim 18 (depends on 15) The method of claim 15, wherein the at least one output data object is transmissible to another computer process.