New York — A new construction roots cryptographic hardness in Gödelian undecidability — problems provably unsolvable under any axiom system. Standard schemes rely on computational difficulty like fact
Quanta Magazine