• 2 Posts
  • 23 Comments
Joined 6 days ago
cake
Cake day: March 11th, 2025

help-circle


  • please correct me if i’m wrong on this. lots of people here saying that it’s not practical because we would have to trust tiny instances that may be malicious. however, what if we make user’s identity provable to anyone, simply by the use of logic? suppose we have a way of generating random proof-theorem pairs (for example, the theorems could be something like “the largest proper factor of n is greater than some m, where m and n are some huuuuuge numbers and n is semiprime”, the proofs could be constructive). we let the identity be the theorem and the password be the proof. hence, anyone is able to verify the indentity by the use of a theorem prover like Agda