# US 2021/0279358 A1 · Cryptographic data entry blockchain data structure

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

- Number: US 2021/0279358 A1
- Document ID: US20210279358A1
- Status: Published application
- Kind: A1
- Application number: 17/192,776
- Filed: 2021-03-04
- Published: 2021-09-09
- Earliest claimed: 2020-03-04
- Assignees: Rubidex, LLC
- Applicants: Rubidex, LLC
- Inventors: Steven Teel; Michael Felker
- Web page: https://patentgrep.com/patent/US20210279358A1

## CPC

- G06F 21/6227: {where protection concerns the structure of data, e.g. records, types, queries}
- H04L 9/3239: {involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD}
- G06F 16/178: Techniques for file synchronisation in file systems
- G06F 16/1834: {implemented based on peer-to-peer networks, e.g. gnutella (p2p communication protocols H04L67/104)}
- G06F 16/2255: {Hash tables}
- G06F 16/248: Presentation of query results
- G06F 21/602: {Providing cryptographic facilities or services}
- G06F 21/64: Protecting data integrity, e.g. using checksums, certificates or signatures
- H04L 9/0618: {Block ciphers, i.e. encrypting groups of characters of a plain text message using fixed encryption transformation}
- H04L 9/3297: {involving time stamps, e.g. generation of time stamps}
- H04L 9/50: {using hash chains, e.g. blockchains or hash trees}
- H04L 2209/56: Financial cryptography, e.g. electronic payment or e-cash
- 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 for securely storing and transmitting data using a blockchain structure. The blockchain structure is operated on the local node and through SSH transmission with an arbiter server and cloud infrastructure. The local application coordinates the order of appended blocks, where each block is a flat file that uses a respective filename to indicate block order. Data entry and retrieval is performed where plaintext data is available only in local memory as decrypted through an authorized client. Data written to disk only as encrypted.

## Claims

### Claim 1

A data storage method comprising:
receiving new data via an input interface on a local blockchain node;
storing the new data as plaintext in local memory while displaying on a user interface;
writing the new data as encrypted ciphertext on local non-volatile storage as a new block on a local copy of a blockchain data structure; and
transmitting the new block to a peer network to be appended to respective blockchain data structures throughout the peer network.

### Claim 2 (depends on 1)

The method of claim 1, wherein each block on the local blockchain node comprises a flat file including a naming convention that designates block order in the local blockchain node, the method further comprising:
receiving, at the local blockchain node through the peer network, a second new block; and
ordering the second new block on the local blockchain node based on the naming convention.

### Claim 3 (depends on 2)

The method of claim 2, wherein each block on the local blockchain node further includes a timestamp, the method further comprising:
in response to the new block and the second new block having a matching block order as designated by the naming convention, disambiguating, by the local blockchain node, the new block and the second new block by creation order using the timestamp; and
renaming either of the new block or the second new block based on the naming convention signifying which block was created subsequent to the other.

### Claim 4 (depends on 1)

The method of claim 1, wherein each block on the local blockchain node comprises a flat file including a naming convention that designates block order in the local blockchain node, the method further comprising:
connecting, by the local blockchain node, to the peer network after an offline period; and
in response to said connecting, syncing, by the local blockchain node, copies of the blockchain data structure with the peer network beginning with the most recent blocks.

### Claim 5 (depends on 4)

The method of claim 4, wherein said writing and transmitting steps are performed prior to completion of said syncing.

### Claim 6 (depends on 1)

The method of claim 1, further comprising:
executing a blockchain viewing application on the local blockchain node, the blockchain viewing application configured to verify a set of user login credentials for a first user, the first user having a first user key;
identifying a subset of the blockchain data structure that is decryptable by the first user key;
loading the subset of the blockchain data structure into local memory on the local blockchain node; and
decrypting the subset of the blockchain in local memory into plaintext.

### Claim 7 (depends on 6)

The method of claim 6, further comprising:
identifying, by the blockchain viewing application, a physical location of the local blockchain node, and whereby the subset of the blockchain data structure that is decryptable by the first user key is subject to whether the physical location of the local blockchain node falls within a predetermined geofence.

### Claim 8 (depends on 6)

The method of claim 6, further comprising:
receiving a search query from the first user via a graphic user interface of a blockchain viewing application;
applying the search query to the plaintext; and
displaying, by blockchain viewing application, search results in memory to the first user.

### Claim 9 (depends on 6)

The method of claim 6, further comprising:
displaying, via the blockchain viewing application, a graphic user interface including data field pointers; and
populating the data field pointers from the decrypted subset of the blockchain data structure in local memory.

### Claim 10

A secure data retrieval method comprising:
maintaining a copy of a blockchain data structure on a local blockchain node, wherein the blockchain data structure includes a set of encrypted blocks of data that are linked to one another in order;
executing a blockchain viewing application on a local blockchain node, the blockchain viewing application configured to verify a set of user login credentials for a first user, the first user having a first user key;
identifying a subset of the blockchain data structure that is decryptable by the first user key;
loading the subset of the blockchain into local memory on the local blockchain node; and
decrypting the subset of the blockchain in local memory into plaintext.

### Claim 11 (depends on 10)

The method of claim 10, further comprising:
identifying, by the blockchain viewing application, a physical location of the local blockchain node wherein the subset of the blockchain data structure that is decryptable by the first user key is subject to whether the physical location of the local blockchain node falls within a predetermined geofence.

### Claim 12 (depends on 10)

The method of claim 10, further comprising:
receiving a search query from the first user via a graphic user interface of a blockchain viewing application;
applying the search query to the plaintext; and
displaying, by blockchain viewing application, search results in memory to the first user.

### Claim 13 (depends on 10)

The method of claim 10, further comprising:
displaying, via the blockchain viewing application, a graphic user interface including data field pointers; and
populating the data field pointers from the decrypted subset of the blockchain data structure in local memory.

### Claim 14

A system of data storage comprising:
a processor implemented on a local blockchain node;
a non-volatile data store including a copy of a blockchain data structure, wherein data elements of the blockchain data structure are encrypted; and
a memory including instructions that when executed cause the processor to:
receive new data on the local blockchain node;
store the new data as plaintext in the memory while displaying on a user interface;
write the new data as encrypted ciphertext the non-volatile data store as a new block on to the copy of the blockchain data structure; and
transmit the new block to a peer network to be appended to respective blockchain data structures throughout the peer network.

### Claim 15 (depends on 14)

The system of claim 14, wherein each block on the blockchain data structure comprises a flat file including a naming convention that designates block order in the local blockchain node, the method further comprising:
receive, at the local blockchain node through the peer network, a second new block; and
order the second new block in the non-volatile data store based on the naming convention.

### Claim 16 (depends on 15)

The system of claim 15, wherein each block on the local blockchain node further includes a timestamp, the memory further including instructions that when executed cause the processor to:
in response to the new block and the second new block having a matching block order as designating by the naming convention, disambiguate, by the local blockchain node, the new block and the second new block by creation order using the timestamp; and
rename either of the new block or the second new block based on the naming convention signifying which block was created subsequent the other.

### Claim 17 (depends on 14)

The system of claim 14, wherein each block on the local blockchain node comprises a flat file including a naming convention that designates block order in the local blockchain node, the memory further including instructions that when executed cause the processor to:
connect, by the local blockchain node, to the peer network after an offline period; and
in response to the connection, syncing, by the local blockchain node, copies of the blockchain data structure with the peer network beginning with the most recent blocks.

### Claim 18 (depends on 14)

The system of claim 14, the memory further including instructions that when executed cause the processor to:
executing a blockchain viewing application on the local blockchain node, the blockchain viewing application configured to verify a set of user login credentials for a first user, the first user having a first user key;
identifying a subset of the blockchain data structure that is decryptable by the first user key;
loading the subset of the blockchain data structure into the memory on the local blockchain node; and
decrypting the subset of the blockchain data structure in the memory into plaintext.

### Claim 19 (depends on 18)

The system of claim 18, further including:
a location sensor configured to identify a physical location of the local blockchain node via GPS or IP tracing, and whereby the subset of the blockchain data structure that is decryptable by the first user key is subject to whether the physical location of the local blockchain node falls within a predetermined geofence.

### Claim 20 (depends on 18)

The system of claim 18, the memory further including instructions that when executed cause the processor to:
receive a search query from the first user via a graphic user interface of a blockchain viewing application;
apply the search query to the plaintext; and
display, by blockchain viewing application, search results in the memory to the first user.

### Claim 21 (depends on 18)

The system of claim 18, the memory further including instructions that when executed cause the processor to:
display, via the blockchain viewing application, a graphic user interface including data field pointers; and
populate the data field pointers from the decrypted subset of the blockchain data structure in the memory.
