pallas-math
| Crates.io | pallas-math |
| lib.rs | pallas-math |
| version | |
| source | src |
| created_at | 2024-07-01 16:53:11.165834+00 |
| updated_at | 2024-12-29 22:25:11.313865+00 |
| description | Mathematics functions for Cardano |
| homepage | https://github.com/txpipe/pallas |
| repository | https://github.com/txpipe/pallas |
| max_upload_size | |
| id | 1288870 |
| Cargo.toml error: | TOML parse error at line 19, column 1 | 19 | autolib = false | ^^^^^^^ unknown field `autolib`, expected one of `name`, `version`, `edition`, `authors`, `description`, `readme`, `license`, `repository`, `homepage`, `documentation`, `build`, `resolver`, `links`, `default-run`, `default_dash_run`, `rust-version`, `rust_dash_version`, `rust_version`, `license-file`, `license_dash_file`, `license_file`, `licenseFile`, `license_capital_file`, `forced-target`, `forced_dash_target`, `autobins`, `autotests`, `autoexamples`, `autobenches`, `publish`, `metadata`, `keywords`, `categories`, `exclude`, `include` |
| size | 0 |
Santiago Carmuega (scarmuega)
documentation
https://docs.rs/pallas-math
README
Pallas Math
Crate with all the mathematics functions to support Cardano protocol:
- [] lncf - Approximate
ln(1+x)forx in 0..infinty. - [] cf - Compute continued fraction using max steps or bounded list of a/b factors.
- [] bound - Simple way to find integer powers that bound x.
- [] contract - Bisect bounds to find the smallest integer power such that
factor^n<=x<factor^(n+1). - [] find_e - find n with
e^n<=x<e^(n+1). - [] ln - Compute natural logarithm via continued fraction, first splitting integral part and then using continued fractions approximation for
ln(1+x). - [] taylor_exp - Compute
exp(x)using Taylor expansion. - [] taylor_exp_cmp - Efficient way to compare the result of the Taylor expansion of the exponential function to a threshold value.
- ...
- ...