Trust a Few: The Weakest Assumptions a Protocol Needs
A verifier loop computes the weakest key, value, and channel assumptions a protocol needs to meet a goal.
2 stories, newest first · one card per story
A verifier loop computes the weakest key, value, and channel assumptions a protocol needs to meet a goal.
LLMs produce useful cryptographic-protocol lemmas but average only 38.82% proof-tree coverage.
Today 1.6K readers · 2.4K views · 774 reads · all time 189K views