Data Block Matrix
The invention is a data structure, referred to as a data block matrix, that supports the ongoing addition of hash-linked records while also allowing the deletion of arbitrary records, preserving hash-based integrity assurance that other blocks are unchanged. A data block matrix uses an array of blocks, with hash values for each row and column, which makes it possible to delete or modify a particular block, assuring that other blocks have not been affected. It can be implemented in a decentralized system to provide data replication among peers, and may have utility for incorporation into applications requiring integrity protection that currently use permissioned blockchains.
The invention is a data structure, referred to as a data block matrix, that supports the ongoing addition of hash-linked records while also allowing the deletion of arbitrary records, preserving hash-based integrity assurance that other blocks are unchanged. A data block matrix uses an array of blocks, with hash values for each row and column, which makes it possible to delete or modify a particular block, assuring that other blocks have not been affected. It can be implemented in a decentralized system to provide data replication among peers, and may have utility for incorporation into applications requiring integrity protection that currently use permissioned blockchains.
David Kuhn
