Frequently asked question
Have any questions? Explore the timestamping process further and find your answers here.
How does RockProof document enshrining work?
If you wish an advanced service, allowing you to bundle more files into a single timestamping transaction, even higher security (by storing the proof in multiple blockchains), not having to touch the Ether cryptocurrency or deal with the Metamask, you can explore our advanced products here.
Once you install Metamask, you’ll have to create your Ethereum wallet and fund it with some Ether, that you can buy on many cryptocurrency exchanges. We can recommend GBX, Coinbase.com or Kraken.com. You then transfer Ether from your exchange account to your Metamask wallet and start using the free, Basic version of Rockproof. You can find more information in this comprehensive guide to installing and using Metamask.
If you do not wish to use Metamask or deal with cryptocurrencies or exchanges at all, you may opt for our advanced products.
A cryptographic hash function is an algorithm, which can take digital data of any size and type as input (e.g. contents of a file) and returns a fixed-size alphanumeric string. The string is often called the 'hash value', 'message digest', 'digital fingerprint', 'digest' or 'checksum'.
It has the following properties:
- It is easy to calculate a hash for any given data
- It is extremely computationally difficult to calculate an alphanumeric text that has a given hash.
- It is extremely unlikely that two slightly different messages will have the same hash.
Rockproof uses SHA256 algorithm, that is a widely recognized standard developed by the US National Security Agency (NSA).
Examples of a applying a hashing function:
As can be seen, a slight change in the original data results in a dramatically different hash result.
A Merkle tree of hashes in which every leaf node is labelled with the hash of a data block (a hash of one of your files in case of RockProof) and every non-leaf node is labelled with the the hash of the labels of its child nodes.
This structure allows us to:
- Establish, whether a data structure (a file) is a part of the merkle tree
- Prove the validity of data being part of a dataset without storing the whole data set
- Ensure the validity of a certain data set being inclusive in a larger data set without revealing either the complete data set or its subset
A Merkle Root is the Hash sitting on top of the tree, it’s the ultimate fingerprint of all files that have been sealed.
Combining the hashes into a Merkle tree allows us to timestamp a large number of files, resulting in a single transaction submitted to the Ethereum blockchain, while retaining our ability to verify, whether a particular hash exists in a given Merkle Tree, represented by the stored Merkle Root hash.
Once the hash has been recorded in the blockchain, there is no additional cost related to keeping it stored indefinitely and publicly available, making it a very cost effective solution for maintaining the integrity and persistency of the proofs.
How does RockProof validation of existence and integrity work?
You can also deploy your own version of RockProof within your organization or use our Managed Service. See more information here.
Is there something we did not answer? Do not hesitate to contact us.