]> Git Repo - secp256k1.git/commit
Merge #592: Use trivial algorithm in ecmult_multi if scratch space is small
authorGregory Maxwell <[email protected]>
Sat, 25 May 2019 22:34:47 +0000 (22:34 +0000)
committerGregory Maxwell <[email protected]>
Sat, 25 May 2019 22:41:35 +0000 (22:41 +0000)
commit40839e21b9dd092d64dcb6a56813a1614e390568
tree8e6138efedf0a3c77f2095a9cea63804a0398ab8
parenta484e0008bc9d27e5f8384813958aaba385ee000
parent9ab96f7b12c68af2be7f7fc5be555aa45e267fcc
Merge #592: Use trivial algorithm in ecmult_multi if scratch space is small

9ab96f7 Use trivial algorithm in ecmult_multi if scratch space is small (Jonas Nick)

Pull request description:

  `ecmult_multi` already selects the trivial algorithm if the scratch space is NULL. With this PR the trivial algorithm is also selected if the scratch space is too small to use pippenger or strauss instead of returning 0. That makes it more easier to avoid consensus relevant inconsistencies just because scratch space construction was messed up.

ACKs for commit 9ab96f:
  real-or-random:
    utACK 9ab96f7

Tree-SHA512: aa451adf8880af15cf167a59cb07fc411edc43f26c8eb0873bdae2774382ba182e2a1c54487912f8f2999cb0402d554b9d293e2fb9483234471348a1f43c6653
src/ecmult_impl.h
src/tests.c
This page took 0.024737 seconds and 4 git commands to generate.