Ravencoin VS secp256k1

No it is not u a hole https://github.com/RavenProject/Ravencoin

New RVN Wallet Install. - Download and install the latest wallet from here: https://github.com/RavenProject/Ravencoin/releases/

Code here. https://github.com/RavenProject/Ravencoin/releases

[4:19 PM] kinkajou (SegWit Clique): Same. If any of our Core Developer have a rough estimation it would probably be easier to start crowdfunding. Perhaps we could get a funding proposal page on the foundation site like we did for the stablecoins. An issue was created a while back: https://github.com/RavenProject/Ravencoin/issues/979

You can run a full node on the same machine you mine with. Just download RavenCore here: https://github.com/RavenProject/Ravencoin/releases

[4:21 PM] kinkajou (SegWit Clique): https://github.com/RavenProject/Ravencoin/issues/1188

[4:52 PM] Hans_Schmidt: The procedure is documented at https://github.com/RavenProject/Ravencoin/blob/master/test/README.md Run the whole test_runner.py testset

there is a bug when syncing tho it may be that https://github.com/RavenProject/Ravencoin/issues/1188 basically gotta invalidate the block then reconsider it

Case 1: You never used the Ravencoin Core Desktop wallet before - Install the latest wallet from https://github.com/RavenProject/Ravencoin/releases/ - Open it - Fill out your 12 seed words in the popup window. - Press import - Sync for 6+ hours

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,

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.

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.

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.

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...

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

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

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