PEDDaL blockchaining for document integrity verification preparation

1. A computer implemented method of using a blockchain to generate evidence for later proving integrity of a document, the method executable by a processor, the method comprising:

providing a first node on a computer network, the node having a non-transitory computer readable medium;

storing, on the non-transitory computer readable medium at the first node, a first integrity verification code (IVC) associated with a first document and a first user account;

storing, on the non-transitory computer readable medium at the first node, a second IVC associated with a second document and a second user account, the second IVC being different than the first IVC and the second user account being different than the first user account;

appending the first IVC and the second IVC to an open first document dating list (DDL) edition, wherein the first DDL edition does not contain either the first document or the second document;

storing, on the non-transitory computer readable medium at the first node, a third IVC associated with a third document and a third user account, the third IVC being different than the first IVC and the second IVC and the third user account being different than the first user account and the second user account;

appending the third IVC to an open second DDL edition, wherein the second DDL edition does not contain the third document; and

closing the first DDL edition, wherein closing the first DDL edition comprises generating a fourth IVC for the first DDL edition and appending the fourth IVC to the open second DDL edition, thereby chaining the first DDL edition with the second DDL edition to create a set of chained DDL editions.

2. The method of claim 1 wherein each IVC comprises a first a hash function message digest (hash value).

3. The method of claim 2 wherein the first hash value is among the Secure Hash Algorithm (SHA) family of hash values.

4. The method of claim 2 wherein each wherein each IVC further comprises a second hash value.

5. The method of claim 1 further comprising:

transmitting the first and second DDL editions to a remote second node across the computer network.

6. The method of claim 1 further comprising:

generating a DDL record for each IVC, wherein generating a DDL record comprises appending at least one of a timestamp and an index number to the IVC, and

wherein appending an IVC to a DDL edition comprises appending the DDL record for the IVC.

7. The method of claim 1 further comprising:

receiving, at the first node, the user account information associated with each of the first, second, and third IVCs.

8. The method of claim 7 further comprising:

determining whether a count of IVCs associated with any one of the first user account, the second user account and the third user account, during a predetermined time interval, exceeds a predetermined number; and

responsive to determining that the count exceeds the predetermined number, generating billing information for the user account exceeding the predetermined number.

9. A computer program embodied on a non-transitory computer readable medium and configured to be executed by a processor, the program comprising:

code for storing, on the non-transitory computer readable medium at a first node on a computer network, a first integrity verification code (IVC) associated with a first document and a first user account;

code for storing, on the non-transitory computer readable medium at the first node, a second IVC associated with a second document and a second user account, the second IVC being different than the first IVC and the second user account being different than the first user account;

code for appending the first IVC and the second IVC to an open first document dating list (DDL) edition, wherein the first DDL edition does not contain either the first document or the second document;

code for storing, on the non-transitory computer readable medium at the first node, a third IVC associated with a third document and a third user account, the third IVC being different than the first IVC and the second IVC and the third user account being different than the first user account and the second user account; and

code for appending the third IVC to an open second DDL edition, wherein the second DDL edition does not contain the third document;

code for closing the first DDL edition, wherein closing the first DDL edition comprises generating a fourth IVC for the first DDL edition and appending the fourth IVC to the open second DDL edition, thereby chaining the first DDL edition with the second DDL edition to create a set of chained DDL editions.

10. The program of claim 9 wherein each IVC comprises a first a hash function message digest (hash value).

11. The program of claim 10 wherein the first hash value is among the Secure Hash Algorithm (SHA) family of hash values.

12. The program of claim 10 wherein each IVC further comprises a second hash value.

13. The program of claim 9 further comprising:

code for transmitting the first and second DDL editions to a remote second node across the computer network.

14. The program of claim 9 further comprising:

code for generating a DDL record for each IVC, wherein generating a DDL record comprises appending at least one of a timestamp and an index number to the IVC, and

wherein appending an IVC to a DDL edition comprises appending the DDL record for the IVC.

15. The program of claim 9 further comprising:

code for receiving, at the first node, the user account information associated with each of the first, second, and third IVCs.

16. The program of claim 15 further comprising:

code for determining whether a count of IVCs associated with any one of the first user account, the second user account and the third user account, during a predetermined time interval, exceeds a predetermined number; and

code for generating billing information for the user account exceeding the predetermined number, responsive to determining that the count exceeds the predetermined number.