# US 2021/0240868 A1 · 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 2021/0240868 A1 - Document ID: US20210240868A1 - Status: Published application - Kind: A1 - Application number: 17/232,929 - Filed: 2021-04-16 - Published: 2021-08-05 - Earliest claimed: 2016-09-15 - Assignees: Nuts Holdings, LLC - Applicants: Nuts Holdings, LLC - Inventors: Yoon Ho Auh - Web page: https://patentgrep.com/patent/US20210240868A1 ## 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 communication over a network comprising: processing, by at least one processor of one of a plurality of computers in communication with one another over the network, messages using a method of folding data comprising 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 the plurality of logical operations being encapsulated in at least one command field of the data structure; wherein the at least one output data object from the at least one data field of the data structure is configured 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 2 (depends on 1) The method of claim 1, further comprising processing, by at least one second processor of a second one of the plurality of computers, 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 3 (depends on 1) The method of claim 1, further comprising processing, by the at least one processor, messages using a method of processing at least one second output data object from at least one second data field of a second data structure to produce the same one of at least one second input data object using a second encapsulated at least one essence of a second entire sequence of a second plurality of logical operations from a second at least one command field of the second data structure received from one of the plurality of computers coupled over the network. ### Claim 4 (depends on 1) The method of claim 1, wherein the plurality of logical operations includes a transmutation. ### Claim 5 (depends on 1) The method of claim 1, wherein the at least one output data object is storable in a computing environment. ### Claim 6 (depends on 1) The method of claim 1, wherein the at least one output data object is transmissible to another computer process. ### Claim 7 (depends on 1) The method of claim 1, wherein the at least one essence of an entire sequence of the plurality of logical operations within a first message is different from the at least one essence of an entire sequence of the plurality of logical operations within a second message. ### Claim 8 A communication apparatus used among a plurality of computers coupled over a network comprising: at least one processor configured to process messages by 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 the plurality of logical operations being encapsulated in at least one command field of the data structure; wherein the at least one output data object from the at least one data field of the data structure is configured 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 9 (depends on 8) The apparatus of claim 8, wherein the at least one processor is further configured to process messages by processing at least one second output data object from at least one second data field of a second data structure to produce the same one of at least one second input data object using a second encapsulated at least one essence of a second entire sequence of a second plurality of logical operations from a second at least one command field of the second data structure received from one of the plurality of computers coupled over the network. ### Claim 10 (depends on 8) The apparatus of claim 8, wherein the plurality of logical operations includes a transmutation. ### Claim 11 (depends on 8) The apparatus of claim 8, wherein the at least one output data object is storable in a computing environment. ### Claim 12 (depends on 8) The apparatus of claim 8, wherein the at least one output data object is transmissible to another computer process. ### Claim 13 (depends on 8) The apparatus of claim 8, wherein the at least one essence of an entire sequence of the plurality of logical operations within a first message is different from the at least one essence of an entire sequence of the plurality of logical operations within a second message. ### Claim 14 A system for data folding comprising: at least one processor; at least one memory; and a data structure in the at least one memory, the data structure comprising: at least one input data object processed by the at least one processor 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 the 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 the plurality of logical operations being encapsulated in at least one command field of the data structure; wherein at least one output data object from the at least one data field of the data structure is configured 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 15 (depends on 14) The system of claim 14, wherein the at least one processor is further configured to process messages by processing at least one second output data object from at least one second data field of a second data structure to produce the same one of at least one second input data object using a second encapsulated at least one essence of a second entire sequence of a second plurality of logical operations from a second at least one command field of the second data structure received from one of the plurality of computers coupled over the network. ### Claim 16 (depends on 14) The system of claim 14, wherein the plurality of logical operations includes a transmutation. ### Claim 17 (depends on 14) The system of claim 14, wherein the at least one output data object is stored in a computing environment. ### Claim 18 (depends on 14) The system of claim 14, wherein the at least one output data object is transmitted to another computer process. ### Claim 19 (depends on 14) A plurality of computers coupled over a network, each of the plurality of computers processing messages using the system of claim 14. ### Claim 20 (depends on 19) The system of claim 19, wherein the at least one essence of an entire sequence of the plurality of logical operations within a first message is different from the at least one essence of an entire sequence of the plurality of logical operations within a second message.