O’Connor & Poelstra: A Formal Proof of safegcd Bounds [“A new algorithm for libsecp256k1: this would dramatically improve transaction signing (which is often done on very weak hardware) by 25%, and signature verification (which must be done tens of millions of times by Bitcoin full nodes) by 15%.”]

O’Connor & Poelstra: A Formal Proof of safegcd Bounds [“A new algorithm for libsecp256k1: this would dramatically improve transaction signing (which is often done on very weak hardware) by 25%, and signature verification (which must be done tens of millions of times by Bitcoin full nodes) by 15%.”] submitted by /u/eragmus
[link] [comments]

Leave a Reply

Your email address will not be published. Required fields are marked *