btcd
libtorsion
btcd | libtorsion | |
---|---|---|
11 | 2 | |
6,049 | 23 | |
3.3% | - | |
9.0 | 0.0 | |
8 days ago | 9 months ago | |
Go | C | |
ISC License | GNU General Public License v3.0 or later |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
btcd
-
SETTING UP BTCD FOR A DEV. ENVIRONMENT
Following the instructions on their official repo, first, install go and check the version with go version, root path, and path with go env GOROOT GOPATH.
-
What real-world problem is Kaspa trying to solve?
This dude caused all LND nodes to stop syncing recently with a single transaction costing less than $5 - https://twitter.com/brqgoo. Issues been patched recently. Theres others, will need to dig in order to find again.
-
Current Inflation Rates: BTC:3.7% ETH:0.1%
the main one i know of btcd is written in Go and sees a lot of use from what I understand: https://github.com/btcsuite/btcd
-
Help me understand using go libraries btcd/btcec, btcd/btcutil
For the Go code, I modified the code I found online to be able to generate P2PKH address, I believe. I am having a tough time navigating the plethora of functions defined here. I've also looked at the address_test.go to understand if I could get some clue, but I'm having trouble figuring out the intermediate conversions done to the Private Key hex like btcutil.NewAddressPubKeyHash(pkHash, &chaincfg.MainNetParams).
- Bitcoin is the only coin the SEC Chair will call a commodity
-
[Hiring] Experienced Golang Developer at Peercoin Foundation (work from anywhere!)
Salary: Competitive salary. Reach out to discuss. Port Bitcoin Tech to Peercoin, the World's First Green Blockchain (Opportunity for Ongoing Role) The Peercoin Foundation is looking to hire a developer experienced in both Go and Bitcoin. Peercoin is a cryptocurrency forked from Bitcoin that was launched ten years ago in 2012. It is responsible for inventing Proof of Stake consensus, the world's first green blockchain technology. The Peercoin Foundation is looking for an experienced developer to port Btcd to Peercoin. Btcd is an alternative full node bitcoin implementation written in Go. (https://github.com/btcsuite/btcd)
- Mako – a full Bitcoin implementation in C
-
[HIRING] Go Developer to Port Btcd to Peercoin
The Peercoin Foundation is looking to hire a developer to port btcd to Peercoin. Btcd is an alternative full node bitcoin implementation written in Go (golang).
-
Is Bitcoin the best at anything? Anonymity? Security? Transaction cost? Transaction speed? Etc.
Anyone. Also, there isn't just one implementation of Bitcoin. There are several implementations of the protocol in different programming languages, but they all stick to the same rules. btcd for example is written in Go, while Haskoin is written in Haskell.
- It's official - Nano is no longer among the top 100 coins
libtorsion
-
Mako – a full Bitcoin implementation in C
Most of the crypto is from my more general crypto library libtorsion: https://github.com/bcoin-org/libtorsion
I originally wanted to vendor my libtorsion code and link to it, but it felt clunky since libtorsion pulls in a ton of crypto that bitcoin doesn't need. Also, since I was focusing on just a few algorithms, it gave me the opportunity to optimize a lot of them (in particular, the ECC backend was optimized for secp256k1 whereas in libtorsion it supports all kinds of curves).
Because of all of this, there's probably some leftover comments. That comment isn't true anymore. rand.c is definitely used internally for libmako, just not libtorsion.
edit: fixed link.
-
Donald Knuth’s Algorithm D, its implementation in Hacker’s Delight and elsewhere
The 2-by-1 and 3-by-2 division functions described in the paper result in a very measurable speedup in my code. I think you're confusing those with the reciprocal calculation itself (which can be computed with a lookup table). I agree that part doesn't really lend itself to any significant performance benefit and is probably better calculated with a single hardware division instead.
I feel it necessary to point out that the 3-by-2 division actually has multiple benefits which are easy to miss:
1. The quotient loop can be skipped as I mentioned.
2. The "Add back" step is less likely to be triggered.
3. Since a 2-word remainder is computed with the division, you can skip 2 iterations on the multiply+subtract step.
My reimplementation of GMP documents both the 2-by-1 and 3-by-2 divisions pretty thoroughly[1][2].
[1] https://github.com/bcoin-org/libtorsion/blob/master/src/mpi....
[2] https://github.com/bcoin-org/libtorsion/blob/master/src/mpi....
What are some alternatives?
bitcore - A full stack for bitcoin and blockchain-based applications
OpenZKP - OpenZKP - pure Rust implementations of Zero-Knowledge Proof systems.
Bitcoin - Bitcoin Core integration/staging tree
mako - Bitcoin node written in C
bcoin - Javascript bitcoin library for node.js and browsers
nim-stint - Stack-based arbitrary-precision integers - Fast and portable with natural syntax for resource-restricted devices.
nix-bitcoin - A collection of Nix packages and NixOS modules for easily installing full-featured Bitcoin nodes with an emphasis on security.
Mako - THIS IS NOT THE OFFICIAL REPO - PLEASE SUBMIT PRs ETC AT: http://github.com/sqlalchemy/mako
gui - Bitcoin Core GUI staging repository