| 摘要 |
The present invention generally relates to blockchain technology. Specifically, this invention relates to creating a blockchain called a slidechain that allows for multiple valid branches or forks to propagate simultaneously with a customized set of protocol rules embedded in and applied to each fork chain that branches from another chain. The invention generally provides a computer-implemented method for accessing, developing and maintaining a decentralized database through a peer-to-peer network, to preserve the original state of data inputs while adapting to changing circumstances, user preferences, and emerging technological capabilities. |
| 主权项 |
1. A method of securely storing data in data blocks so that it cannot be modified after storage, said method comprising the steps of:
creating a root block payload to be included as part of a root block, wherein a root block comprises the root block payload and a root header; computing a root data hash from at least part of the root block payload; creating the root header comprising at least the root data hash, a root timestamp, a root cryptographic nonce, a root proof standard, and a root data descriptor; computing a short hash from inputs of at least said root data hash, said root timestamp, said root proof standard, and said root data descriptor, but excluding said cryptographic nonce, and a fork header hash of a fork block; storing data as a fork block payload to be included as part of the fork block, wherein said fork block comprises a fork block payload, a fork header, and one or more authorized fork hashes; computing a payload hash from at least part of the fork block payload; creating a fork block header comprising at least said payload hash, a previous block hash, a payload timestamp, a payload cryptographic nonce, a payload proof standard, a fork block flag, and a payload data descriptor; storing said short hash in said fork block as said one or more authorized fork hashes; computing the fork header hash from inputs of at least said one or more authorized fork hashes, said payload hash, said previous block hash, said payload timestamp, said payload cryptographic nonce, said payload proof standard, said fork block flag, said payload data descriptor; storing said fork header hash as part of said root header; and computing a root header hash from inputs of at least said root data hash, said root timestamp, said root proof standard, said root data descriptor, said root cryptographic nonce, and said fork header hash. |
