![]() |
BSHA3
0.17.99
P2P Blockchain, based on Bitcoin
|
Go to the source code of this file.
Macros | |
| #define | WINDOW_A 5 |
| #define | WINDOW_G 16 |
| larger numbers may result in slightly better performance, at the cost of exponentially larger precomputed tables. More... | |
| #define | ECMULT_TABLE_SIZE(w) (1 << ((w)-2)) |
| The number of entries a table with precomputed multiples needs to have. More... | |
| #define | ECMULT_TABLE_GET_GE(r, pre, n, w) |
| The following two macro retrieves a particular odd multiple from a table of precomputed multiples. More... | |
| #define | ECMULT_TABLE_GET_GE_STORAGE(r, pre, n, w) |
| #define ECMULT_TABLE_GET_GE | ( | r, | |
| pre, | |||
| n, | |||
| w | |||
| ) |
The following two macro retrieves a particular odd multiple from a table of precomputed multiples.
Definition at line 134 of file ecmult_impl.h.
| #define ECMULT_TABLE_GET_GE_STORAGE | ( | r, | |
| pre, | |||
| n, | |||
| w | |||
| ) |
Definition at line 145 of file ecmult_impl.h.
| #define ECMULT_TABLE_SIZE | ( | w | ) | (1 << ((w)-2)) |
The number of entries a table with precomputed multiples needs to have.
Definition at line 45 of file ecmult_impl.h.
| #define WINDOW_A 5 |
Definition at line 32 of file ecmult_impl.h.
| #define WINDOW_G 16 |
larger numbers may result in slightly better performance, at the cost of exponentially larger precomputed tables.
One table for window size 16: 1.375 MiB.
Definition at line 40 of file ecmult_impl.h.
1.8.14