Secp256k1 Alternatives

secp256k1 reviews and mentions

• Online Cryptography Course by Dan Boneh
  2 projects | news.ycombinator.com | 2 May 2024
• Apple’s 2½ year old iPhone 12 is 6% faster than the new Samsung Galaxy S23 Ultra
  2 projects | news.ycombinator.com | 9 Feb 2023

  Just yesterday I was trying to generate a vanity pub key for Nostr. I was using https://github.com/kdmukai/nostr_vanity_npub which uses the python-nostr library which in turn uses https://github.com/bitcoin-core/secp256k1.

  The test (single thread with -j1 flag) has some interesting result. Time taken to calculate 1 million keys:

  i7 8650U=2m5s,

• Questions about generating a random number for ECDSA
  1 project | /r/BitcoinTechnology | 16 Aug 2022

  However, I am trying to find the answer in the Bitcoin core source code, but it's kind of hard to read and could find an answer to it there.

• My Summer of Bitcoin Journey [2022]
  1 project | dev.to | 27 Jul 2022

  I will be working on a Schnorr batch verification interface for the libsecp256k1. For those unfamiliar with libsecp256k1, it is a library (written in C) used by Bitcoin Core for low-level cryptographic operations. Initially, this library was a personal project of Pieter Wuille, which was later integrated into Bitcoin Core. You can listen to this Chaincode podcast where he talks about the early developments of this library.

• Usage Of Cryptonite Library In GHCJS
  3 projects | /r/haskell | 26 Jan 2022

  That's a binding to the C library https://github.com/bitcoin-core/secp256k1, so it causes the exact same issue OP had with Cryptonite.

• Binary GCD
  2 projects | news.ycombinator.com | 10 Oct 2021

  The binary GCD has inferior performance to other approaches for big numbers because those min() comparisons require that you had to update the entire numbers at each step.

  I submitted a writeup on the safegcd algorithm used by libsecp256k1 a while back, but it got the HN zomg-bitcoin-related quick flagging: https://github.com/bitcoin-core/secp256k1/blob/master/doc/sa...

  Safegcd-like functions requires somewhat more iterations but most of the iterations need to only operate on the least significant bits of the numbers, which makes them faster in practice.

  For safegcd-ish functions proving a hard upper bound on the number of require iterations is non-trivial. But it's useful to prove the bound in order to make constant time versions. Here is a writeup on our techniques for proving the upper bounds: https://github.com/sipa/safegcd-bounds#bounds-on-divsteps-it...

• Dev Meeting Transcript (May 28, 2021)
  3 projects | /r/Ravencoin | 31 May 2021

  [4:23 PM] fdov: Soulless | Scamcoin.onlinehttps://github.com/bitcoin-core/secp256k1/issues/451

• How to use a library that was installed with autotools in a Makefile?
  1 project | /r/C_Programming | 24 Apr 2021
• Sha-256 input data type
  3 projects | /r/cryptography | 17 Feb 2021

  And the one from libsecp256k1 (which underlies Bitcoin) and is optimized for HMAC: - https://github.com/bitcoin-core/secp256k1/blob/master/src/hash_impl.h

• We've come a long way! This is the load on my Raspberry Pi 4 validating a 6 hour streak of blocks on BCH's Scalenet (most of them 256MB) with 1100tx/s troughput. Cheers!
  1 project | /r/btc | 28 Jan 2021

  Just build and benckmark this https://github.com/bitcoin-core/secp256k1

• A note from our sponsor - SaaSHub
  www.saashub.com | 10 May 2024

  SaaSHub helps you find the best software and product alternatives Learn more →