Interwoven Hash of Vicious Circle Free Graph

Resource Description Framework (RDF), including ontologies and Knowledge Graphs, can be archived in a sustainable way on blockchains. For example, when semantic data is published, it is possible to trace its original creation and all historical updates. Hashing can also be used for linking blocks, calculating tries, storing data structures in headers, etc. If we want to make RDF structures available in a blockchain network, we must have an algorithm to calculate a hash of RDF graphs. In this paper, we propose an innovative method for hashing RDF graphs which includes the concept of vicious circle free.