nim-stint
tiny-bignum-c
nim-stint | tiny-bignum-c | |
---|---|---|
3 | 2 | |
77 | 410 | |
- | - | |
7.0 | 0.0 | |
about 2 months ago | 11 months ago | |
Nim | C | |
Apache License 2.0 | The Unlicense |
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.
nim-stint
- Stint (Stack-based multiprecision integers)
-
Why static languages suffer from complexity
> I think the message is more nuanced
I thought it was more nuanced too as they were explaining how integer types can be derived, until I finished the article, and they really did just seem to be complaining that there's a mismatch between compile time and run time.
Dynamic types don't really solve the problems they mention as far as I can tell either (perhaps I am misunderstanding), they just don't provide any guarantees at all and so "work" in the loosest sense.
> otherwise wouldn't lisp with its homoiconicity and compile time macros fit the bill perfectly?
That's a good point, I do wonder why they didn't mention Lisp at all.
> we don't have a solution yet
What they want to do can, as far as I can see, be implemented in Nim easily in a standard, imperative form, without any declarative shenanigans. Indeed, it is implemented here: https://github.com/nim-lang/Nim/blob/ce44cf03cc4a78741c423b2...
Of course, that implementation is more complex than the one in the article because it handles a lot more.
At the end of the day, it's really a capability mismatch at the language level and the author even states this:
> Programming languages ought to be rethought.
I'd argue that Nim has been 'rethought' specifically to address the issues they mention. The language was built with extension in mind, and whilst the author states that macros are a bad thing, I get the impression this is because most languages implement them as tacked on substitution mechanisms (Rust/D), and/or are declarative rather than "simple" imperative processes. IMHO, most people want to write general code for compile time work (like Zig), not learn a new sub-language. The author states this as well.
Nim has a VM for running the language at compile time so you can do whatever you want, including the recursive type decomposition (for example: https://github.com/status-im/nim-stint). It also has 'real' macros that aren't substitutions but work on the core AST directly, can inspect types at compile time, and is a system language but also high level. It seems to solve their problems, but of course, they simply might not have used or even heard of it.
- Donald Knuth’s Algorithm D, its implementation in Hacker’s Delight and elsewhere
tiny-bignum-c
-
How to calculate large factorial number in C ?
Large? Factorials get very large very quickly. Do you need pointers to a bignum library? https://github.com/kokke/tiny-bignum-c
-
Library for arithmetic operations on integers represented by arrays
tiny-bignum-c looks what you want.... the code is also very small and hackable
What are some alternatives?
constantine - Constantine: modular, high-performance, zero-dependency cryptography stack for proof systems and blockchain protocols.
LibTomMath - LibTomMath is a free open source portable number theoretic multiple-precision integer library written entirely in C.
nimbus-eth1 - Nimbus: an Ethereum Execution Client for Resource-Restricted Devices
arb - Arb has been merged into FLINT -- use https://github.com/flintlib/flint/ instead
libtorsion - C crypto library
arpra - Arpra is a C library for analyzing the propagation of numerical error in arbitrary precision IEEE-754 floating-point computations.
Fermat - A library providing math and statistics operations for numbers of arbitrary size.
break_infinity.js - A replacement for decimal.js for incremental games who want to deal with very large numbers (bigger in magnitude than 1e308, up to as much as 1e(9e15) ) and want to prioritize speed over accuracy.
go - The Go programming language
gmp-wasm - Fork of the GNU Multiple Precision Arithmetic Library (GMP), suitable for compilation into WebAssembly.
OpenZKP - OpenZKP - pure Rust implementations of Zero-Knowledge Proof systems.
gmp-extensions - Extending GNU MP library.