Being able to calculate the graph_id from a processor graph that is not currently available is useful for a variety of workflows.
In particular, it would be useful to replace bespoke graph hashes of D-Wave graphs by this same system, or have a method for comparing such hashes: e.g.: https://github.com/dwave-examples/quantum-blockchain and other demos.
Being able to calculate the graph_id from a processor graph that is not currently available is useful for a variety of workflows.
In particular, it would be useful to replace bespoke graph hashes of D-Wave graphs by this same system, or have a method for comparing such hashes: e.g.: https://github.com/dwave-examples/quantum-blockchain and other demos.