Mohs scale of mineral hardness incorporates additional substances that may fall between levels: Comparison between hardness (Mohs) and hardness (Vickers): Mohs scale of mineral hardness The Mohs scale of mineral hardness is a qualitative ordinal scale characterizing scratch resistance of various minerals through the ability of harder material to scratch softer material. Created in 1812 by German geologist and mineralogist Friedrich Mohs, it is one of several definitions of hardness in materials science, some of which are more quantitative. The method of comparing hardness by seeing which minerals can visibly scratch others is, however, of great antiquity, having been mentioned by Theophrastus in his treatise
Computational hardness assumption Computational hardness assumption In computational complexity theory, a computational hardness assumption is the hypothesis that a particular problem cannot be solved efficiently (where "efficiently" typically means "in polynomial time"). It is not known how to prove (unconditional) hardness for essentially any useful problem. Instead, computer scientists rely on reductions to formally relate the hardness of a new or complicated problem to a computational hardness assumption about a problem that is better-understood. Computational hardness assumptions are of particular importance in cryptography. A major goal in cryptography is to create cryptographic primitives with provable security. In some cases, cryptographic protocols are found