magus
Portable high-level assembler with authentic C syntax (by Bulat-Ziganshin)
leopard
Leopard-RS : O(N Log N) MDS Reed-Solomon Block Erasure Code for Large Data (by catid)
Our great sponsors
| magus | leopard | |
|---|---|---|
| 1 | 2 | |
| 21 | 128 | |
| - | - | |
| 1.8 | 0.0 | |
| almost 2 years ago | almost 2 years ago | |
| Haskell | C++ | |
| MIT License | BSD 3-clause "New" or "Revised" License |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.
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.
magus
Posts with mentions or reviews of magus.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-07-10.
-
FastECC – Reed-Solomon coder computing one million parity blocks at 1 GB/s
If it's any consolance, he has been commiting quite recently too. This was updated 9 days ago https://github.com/Bulat-Ziganshin/magus. So far from not alive and kicking it seems.
leopard
Posts with mentions or reviews of leopard.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-07-10.
-
reedsolomon package now supports up to 65536 shards
This mode is compatible with the RS-Leopard C-library, but is now ported to Go and assembly (SSSE3, AVX2 and AVX512). So no cgo required.
-
FastECC – Reed-Solomon coder computing one million parity blocks at 1 GB/s
That it uses a prime field is a bit awkward, as it requires repacking bytes to and from the field.
Leopard (https://github.com/catid/leopard) is similarly fast but constructed over GF(2^16) so it doesn't need any repacking. OTOH, that also limits it to 2^16 packets per codeword.
What are some alternatives?
When comparing magus and leopard you can also consider the following projects:
FastECC - Reed-Solomon coder computing one million parity blocks at 1 GB/s. O(N*log(N)) algo employing FFT.
xcc - Toy C compiler for x86-64/aarch64/riscv64/wasm
fasmg - flat assembler g - adaptable assembly engine
XOpcodeCalc - Opcode calculator / ASM calculator
fisk - A pure Ruby assembler
asmjit - Low-latency machine code generation