Lignum vitae wood can also be used to brew a tea. Other names for lignum vitae include palo santo (Spanish for "holy wood") Aura palo santo and "bastard greenheart" (not to be confused with true greenheart "Chlorocardium rodiei", a popular wood in shipbuilding, cabinetry, and woodturning but a completely different timber). Lignum vitae is also one of the numerous hard, dense woods loosely referred to as "ironwood". Lignum vitae is hard and durable, and is also the densest wood traded (density: 1.23 g/cm); it will easily sink in water. On the Janka Scale of Hardness, which measures hardness of woods, lignum vitae
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