If your pieces of important data are very tiny, that's probably your best option.

If they're hundreds of bytes or more, then two copies plus two hashes will do a better job.

d1sxeyes 12 hours ago | parent | next [-]

Ah, true! You just restore the one that matches its hash. Elegant.

rixed 8 hours ago | parent | prev [-]

A single hash should be enough.

	▲	Dylan16807 5 hours ago \| parent [-]
		Yes, but what's easier depends on layout. "Consensus" makes me think of multiple entire nodes, and in that situation you can have a nice symmetry by making each node store one copy and one small hash. If you're doing something that's more centralized then one hash might be simpler, but if you're centralized then you should probably use your own error correction codes instead of having multiple copies.