Merge pull request #17 from instagibbs/fixwhitelistdist

add whitelist_impl.h to include for dist

.cirrus.yml

@@ -1,95 +0,0 @@
-env:
-  ### cirrus config
-  CIRRUS_CLONE_DEPTH: 1
-  ### compiler options
-  HOST:
-  WRAPPER_CMD:
-  # Specific warnings can be disabled with -Wno-error=foo.
-  # -pedantic-errors is not equivalent to -Werror=pedantic and thus not implied by -Werror according to the GCC manual.
-  WERROR_CFLAGS: -Werror -pedantic-errors
-  MAKEFLAGS: -j4
-  BUILD: check
-  ### secp256k1 config
-  ECMULTWINDOW: auto
-  ECMULTGENPRECISION: auto
-  ASM: no
-  WIDEMUL: auto
-  WITH_VALGRIND: yes
-  EXTRAFLAGS:
-  ### secp256k1 modules
-  EXPERIMENTAL: no
-  ECDH: no
-  RECOVERY: no
-  SCHNORRSIG: no
-  ELLSWIFT: no
-  ### test options
-  SECP256K1_TEST_ITERS:
-  BENCH: yes
-  SECP256K1_BENCH_ITERS: 2
-  CTIMETESTS: yes
-  # Compile and run the tests
-  EXAMPLES: yes
-
-cat_logs_snippet: &CAT_LOGS
-  always:
-    cat_tests_log_script:
-      - cat tests.log || true
-    cat_noverify_tests_log_script:
-      - cat noverify_tests.log || true
-    cat_exhaustive_tests_log_script:
-      - cat exhaustive_tests.log || true
-    cat_ctime_tests_log_script:
-      - cat ctime_tests.log || true
-    cat_bench_log_script:
-      - cat bench.log || true
-    cat_config_log_script:
-      - cat config.log || true
-    cat_test_env_script:
-      - cat test_env.log || true
-    cat_ci_env_script:
-      - env
-
-linux_arm64_container_snippet: &LINUX_ARM64_CONTAINER
-  env_script:
-    - env | tee /tmp/env
-  build_script:
-    - DOCKER_BUILDKIT=1 docker build --file "ci/linux-debian.Dockerfile" --tag="ci_secp256k1_arm"
-    - docker image prune --force  # Cleanup stale layers
-  test_script:
-    - docker run --rm --mount "type=bind,src=./,dst=/ci_secp256k1" --env-file /tmp/env --replace --name "ci_secp256k1_arm" "ci_secp256k1_arm" bash -c "cd /ci_secp256k1/ && ./ci/ci.sh"
-
-task:
-  name: "ARM64: Linux (Debian stable)"
-  persistent_worker:
-    labels:
-      type: arm64
-  env:
-    ECDH: yes
-    RECOVERY: yes
-    SCHNORRSIG: yes
-    ELLSWIFT: yes
-  matrix:
-     # Currently only gcc-snapshot, the other compilers are tested on GHA with QEMU
-     - env: { CC: 'gcc-snapshot' }
-  << : *LINUX_ARM64_CONTAINER
-  << : *CAT_LOGS
-
-task:
-  name: "ARM64: Linux (Debian stable), Valgrind"
-  persistent_worker:
-    labels:
-      type: arm64
-  env:
-    ECDH: yes
-    RECOVERY: yes
-    SCHNORRSIG: yes
-    ELLSWIFT: yes
-    WRAPPER_CMD: 'valgrind --error-exitcode=42'
-    SECP256K1_TEST_ITERS: 2
-  matrix:
-     - env: { CC: 'gcc' }
-     - env: { CC: 'clang' }
-     - env: { CC: 'gcc-snapshot' }
-     - env: { CC: 'clang-snapshot' }
-  << : *LINUX_ARM64_CONTAINER
-  << : *CAT_LOGS

.gitattributes

@@ -1,2 +0,0 @@
-src/precomputed_ecmult.c linguist-generated
-src/precomputed_ecmult_gen.c linguist-generated

.github/actions/install-homebrew-valgrind/action.yml

@@ -1,33 +0,0 @@
-name: "Install Valgrind"
-description: "Install Homebrew's Valgrind package and cache it."
-runs:
-  using: "composite"
-  steps:
-    - run: |
-        brew tap LouisBrunner/valgrind
-        brew fetch --HEAD LouisBrunner/valgrind/valgrind
-        echo "CI_HOMEBREW_CELLAR_VALGRIND=$(brew --cellar valgrind)" >> "$GITHUB_ENV"
-      shell: bash
-
-    - run: |
-        sw_vers > valgrind_fingerprint
-        brew --version >> valgrind_fingerprint
-        git -C "$(brew --cache)/valgrind--git" rev-parse HEAD >> valgrind_fingerprint
-        cat valgrind_fingerprint
-      shell: bash
-
-    - uses: actions/cache@v3
-      id: cache
-      with:
-        path: ${{ env.CI_HOMEBREW_CELLAR_VALGRIND }}
-        key: ${{ github.job }}-valgrind-${{ hashFiles('valgrind_fingerprint') }}
-
-    - if: steps.cache.outputs.cache-hit != 'true'
-      run: |
-        brew install --HEAD LouisBrunner/valgrind/valgrind
-      shell: bash
-
-    - if: steps.cache.outputs.cache-hit == 'true'
-      run: |
-        brew link valgrind
-      shell: bash

.github/actions/run-in-docker-action/action.yml

@@ -1,49 +0,0 @@
-name: 'Run in Docker with environment'
-description: 'Run a command in a Docker container, while passing explicitly set environment variables into the container.'
-inputs:
-  dockerfile:
-    description: 'A Dockerfile that defines an image'
-    required: true
-  tag:
-    description: 'A tag of an image'
-    required: true
-  command:
-    description: 'A command to run in a container'
-    required: false
-    default: ./ci/ci.sh
-runs:
-  using: "composite"
-  steps:
-    - uses: docker/setup-buildx-action@v3
-
-    - uses: docker/build-push-action@v5
-      id: main_builder
-      continue-on-error: true
-      with:
-        context: .
-        file: ${{ inputs.dockerfile }}
-        tags: ${{ inputs.tag }}
-        load: true
-        cache-from: type=gha
-
-    - uses: docker/build-push-action@v5
-      id: retry_builder
-      if: steps.main_builder.outcome == 'failure'
-      with:
-        context: .
-        file: ${{ inputs.dockerfile }}
-        tags: ${{ inputs.tag }}
-        load: true
-        cache-from: type=gha
-
-    - # Tell Docker to pass environment variables in `env` into the container.
-      run: >
-        docker run \
-          $(echo '${{ toJSON(env) }}' | jq -r 'keys[] | "--env \(.) "') \
-          --volume ${{ github.workspace }}:${{ github.workspace }} \
-          --workdir ${{ github.workspace }} \
-          ${{ inputs.tag }} bash -c "
-            git config --global --add safe.directory ${{ github.workspace }}
-            ${{ inputs.command }}
-          "
-      shell: bash

.github/workflows/ci.yml

@@ -1,915 +0,0 @@
-name: CI
-on:
-  pull_request:
-  push:
-    branches:
-      - '**'
-    tags-ignore:
-      - '**'
-
-concurrency:
-  group: ${{ github.event_name != 'pull_request' && github.run_id || github.ref }}
-  cancel-in-progress: true
-
-env:
-  ### compiler options
-  HOST:
-  WRAPPER_CMD:
-  # Specific warnings can be disabled with -Wno-error=foo.
-  # -pedantic-errors is not equivalent to -Werror=pedantic and thus not implied by -Werror according to the GCC manual.
-  WERROR_CFLAGS: '-Werror -pedantic-errors'
-  MAKEFLAGS: '-j4'
-  BUILD: 'check'
-  ### secp256k1 config
-  ECMULTWINDOW: 'auto'
-  ECMULTGENPRECISION: 'auto'
-  ASM: 'no'
-  WIDEMUL: 'auto'
-  WITH_VALGRIND: 'yes'
-  EXTRAFLAGS:
-  ### secp256k1 modules
-  EXPERIMENTAL: 'no'
-  ECDH: 'no'
-  RECOVERY: 'no'
-  SCHNORRSIG: 'no'
-  ELLSWIFT: 'no'
-  ECDSA_S2C: 'no'
-  GENERATOR: 'no'
-  RANGEPROOF: 'no'
-  WHITELIST: 'no'
-  MUSIG: 'no'
-  ECDSAADAPTOR: 'no'
-  BPPP: 'no'
-  SCHNORRSIG_HALFAGG: 'no'
-  FROST: 'no'
-  ### test options
-  SECP256K1_TEST_ITERS:
-  BENCH: 'yes'
-  SECP256K1_BENCH_ITERS: 2
-  CTIMETESTS: 'yes'
-  # Compile and run the examples.
-  EXAMPLES: 'yes'
-
-jobs:
-  docker_cache:
-    name: "Build Docker image"
-    runs-on: ubuntu-latest
-    steps:
-      - name: Set up Docker Buildx
-        uses: docker/setup-buildx-action@v3
-        with:
-          # See: https://github.com/moby/buildkit/issues/3969.
-          driver-opts: |
-            network=host
-
-      - name: Build container
-        uses: docker/build-push-action@v5
-        with:
-          file: ./ci/linux-debian.Dockerfile
-          tags: linux-debian-image
-          cache-from: type=gha
-          cache-to: type=gha,mode=min
-
-  linux_debian:
-    name: "x86_64: Linux (Debian stable)"
-    runs-on: ubuntu-latest
-    needs: docker_cache
-
-    strategy:
-      fail-fast: false
-      matrix:
-        configuration:
-          - env_vars: { WIDEMUL: 'int64',  RECOVERY: 'yes' }
-          - env_vars: { WIDEMUL: 'int64',                   ECDH: 'yes', SCHNORRSIG: 'yes', ELLSWIFT: 'yes', EXPERIMENTAL: 'yes', ECDSA_S2C: 'yes',  RANGEPROOF: 'yes', WHITELIST: 'yes', GENERATOR: 'yes', MUSIG: 'yes', ECDSAADAPTOR: 'yes', BPPP: 'yes', SCHNORRSIG_HALFAGG: 'yes', FROST: 'yes' }
-          - env_vars: { WIDEMUL: 'int128' }
-          - env_vars: { WIDEMUL: 'int128_struct',                                           ELLSWIFT: 'yes' }
-          - env_vars: { WIDEMUL: 'int128', RECOVERY: 'yes',              SCHNORRSIG: 'yes', ELLSWIFT: 'yes' }
-          - env_vars: { WIDEMUL: 'int128',                  ECDH: 'yes', SCHNORRSIG: 'yes', EXPERIMENTAL: 'yes', ECDSA_S2C: 'yes', RANGEPROOF: 'yes', WHITELIST: 'yes', GENERATOR: 'yes', MUSIG: 'yes', ECDSAADAPTOR: 'yes', BPPP: 'yes', SCHNORRSIG_HALFAGG: 'yes', FROST: 'yes' }
-          - env_vars: { WIDEMUL: 'int128', ASM: 'x86_64',                                   ELLSWIFT: 'yes' }
-          - env_vars: {                    RECOVERY: 'yes',              SCHNORRSIG: 'yes', EXPERIMENTAL: 'yes', ECDSA_S2C: 'yes', RANGEPROOF: 'yes', WHITELIST: 'yes', GENERATOR: 'yes', MUSIG: 'yes', ECDSAADAPTOR: 'yes', BPPP: 'yes', SCHNORRSIG_HALFAGG: 'yes', FROST: 'yes' }
-          - env_vars: { CTIMETESTS: 'no',  RECOVERY: 'yes', ECDH: 'yes', SCHNORRSIG: 'yes', EXPERIMENTAL: 'yes', ECDSA_S2C: 'yes', RANGEPROOF: 'yes', WHITELIST: 'yes', GENERATOR: 'yes', MUSIG: 'yes', ECDSAADAPTOR: 'yes', BPPP: 'yes', SCHNORRSIG_HALFAGG: 'yes', FROST: 'yes', CPPFLAGS: '-DVERIFY' }
-          - env_vars: { BUILD: 'distcheck', WITH_VALGRIND: 'no', CTIMETESTS: 'no', BENCH: 'no' }
-          - env_vars: { CPPFLAGS: '-DDETERMINISTIC' }
-          - env_vars: { CFLAGS: '-O0', CTIMETESTS: 'no' }
-          - env_vars: { CFLAGS: '-O1',     RECOVERY: 'yes', ECDH: 'yes', SCHNORRSIG: 'yes', ELLSWIFT: 'yes' }
-          - env_vars: { ECMULTGENPRECISION: 2, ECMULTWINDOW: 2 }
-          - env_vars: { ECMULTGENPRECISION: 8, ECMULTWINDOW: 4 }
-        cc:
-          - 'gcc'
-          - 'clang'
-          - 'gcc-snapshot'
-          - 'clang-snapshot'
-
-    env:
-      CC: ${{ matrix.cc }}
-
-    steps:
-      - name: Checkout
-        uses: actions/checkout@v4
-
-      - name: CI script
-        env: ${{ matrix.configuration.env_vars }}
-        uses: ./.github/actions/run-in-docker-action
-        with:
-          dockerfile: ./ci/linux-debian.Dockerfile
-          tag: linux-debian-image
-
-      - run: cat tests.log || true
-        if: ${{ always() }}
-      - run: cat noverify_tests.log || true
-        if: ${{ always() }}
-      - run: cat exhaustive_tests.log || true
-        if: ${{ always() }}
-      - run: cat ctime_tests.log || true
-        if: ${{ always() }}
-      - run: cat bench.log || true
-        if: ${{ always() }}
-      - run: cat config.log || true
-        if: ${{ always() }}
-      - run: cat test_env.log || true
-        if: ${{ always() }}
-      - name: CI env
-        run: env
-        if: ${{ always() }}
-
-  i686_debian:
-    name: "i686: Linux (Debian stable)"
-    runs-on: ubuntu-latest
-    needs: docker_cache
-
-    strategy:
-      fail-fast: false
-      matrix:
-        cc:
-          - 'i686-linux-gnu-gcc'
-          - 'clang --target=i686-pc-linux-gnu -isystem /usr/i686-linux-gnu/include'
-
-    env:
-      HOST: 'i686-linux-gnu'
-      ECDH: 'yes'
-      RECOVERY: 'yes'
-      SCHNORRSIG: 'yes'
-      ELLSWIFT: 'yes'
-      EXPERIMENTAL: 'yes'
-      ECDSA_S2C: 'yes'
-      RANGEPROOF: 'yes'
-      WHITELIST: 'yes'
-      GENERATOR: 'yes'
-      MUSIG: 'yes'
-      ECDSAADAPTOR: 'yes'
-      BPPP: 'yes'
-      SCHNORRSIG_HALFAGG: 'yes'
-      FROST: 'yes'
-      CC: ${{ matrix.cc }}
-
-    steps:
-      - name: Checkout
-        uses: actions/checkout@v4
-
-      - name: CI script
-        uses: ./.github/actions/run-in-docker-action
-        with:
-          dockerfile: ./ci/linux-debian.Dockerfile
-          tag: linux-debian-image
-
-      - run: cat tests.log || true
-        if: ${{ always() }}
-      - run: cat noverify_tests.log || true
-        if: ${{ always() }}
-      - run: cat exhaustive_tests.log || true
-        if: ${{ always() }}
-      - run: cat ctime_tests.log || true
-        if: ${{ always() }}
-      - run: cat bench.log || true
-        if: ${{ always() }}
-      - run: cat config.log || true
-        if: ${{ always() }}
-      - run: cat test_env.log || true
-        if: ${{ always() }}
-      - name: CI env
-        run: env
-        if: ${{ always() }}
-
-  s390x_debian:
-    name: "s390x (big-endian): Linux (Debian stable, QEMU)"
-    runs-on: ubuntu-latest
-    needs: docker_cache
-
-    env:
-      WRAPPER_CMD: 'qemu-s390x'
-      SECP256K1_TEST_ITERS: 16
-      HOST: 's390x-linux-gnu'
-      WITH_VALGRIND: 'no'
-      ECDH: 'yes'
-      RECOVERY: 'yes'
-      SCHNORRSIG: 'yes'
-      ELLSWIFT: 'yes'
-      EXPERIMENTAL: 'yes'
-      ECDSA_S2C: 'yes'
-      RANGEPROOF: 'yes'
-      WHITELIST: 'yes'
-      GENERATOR: 'yes'
-      MUSIG: 'yes'
-      ECDSAADAPTOR: 'yes'
-      BPPP: 'yes'
-      SCHNORRSIG_HALFAGG: 'yes'
-      FROST: 'yes'
-      CTIMETESTS: 'no'
-
-    steps:
-      - name: Checkout
-        uses: actions/checkout@v4
-
-      - name: CI script
-        uses: ./.github/actions/run-in-docker-action
-        with:
-          dockerfile: ./ci/linux-debian.Dockerfile
-          tag: linux-debian-image
-
-      - run: cat tests.log || true
-        if: ${{ always() }}
-      - run: cat noverify_tests.log || true
-        if: ${{ always() }}
-      - run: cat exhaustive_tests.log || true
-        if: ${{ always() }}
-      - run: cat ctime_tests.log || true
-        if: ${{ always() }}
-      - run: cat bench.log || true
-        if: ${{ always() }}
-      - run: cat config.log || true
-        if: ${{ always() }}
-      - run: cat test_env.log || true
-        if: ${{ always() }}
-      - name: CI env
-        run: env
-        if: ${{ always() }}
-
-  arm32_debian:
-    name: "ARM32: Linux (Debian stable, QEMU)"
-    runs-on: ubuntu-latest
-    needs: docker_cache
-
-    strategy:
-      fail-fast: false
-      matrix:
-        configuration:
-          - env_vars: {}
-          - env_vars: { EXPERIMENTAL: 'yes', ASM: 'arm32' }
-
-    env:
-      WRAPPER_CMD: 'qemu-arm'
-      SECP256K1_TEST_ITERS: 16
-      HOST: 'arm-linux-gnueabihf'
-      WITH_VALGRIND: 'no'
-      ECDH: 'yes'
-      RECOVERY: 'yes'
-      SCHNORRSIG: 'yes'
-      ELLSWIFT: 'yes'
-      EXPERIMENTAL: 'yes'
-      ECDSA_S2C: 'yes'
-      GENERATOR: 'yes'
-      RANGEPROOF: 'yes'
-      WHITELIST: 'yes'
-      MUSIG: 'yes'
-      ECDSAADAPTOR: 'yes'
-      BPPP: 'yes'
-      SCHNORRSIG_HALFAGG: 'yes'
-      FROST: 'yes'
-      CTIMETESTS: 'no'
-
-    steps:
-      - name: Checkout
-        uses: actions/checkout@v4
-
-      - name: CI script
-        env: ${{ matrix.configuration.env_vars }}
-        uses: ./.github/actions/run-in-docker-action
-        with:
-          dockerfile: ./ci/linux-debian.Dockerfile
-          tag: linux-debian-image
-
-      - run: cat tests.log || true
-        if: ${{ always() }}
-      - run: cat noverify_tests.log || true
-        if: ${{ always() }}
-      - run: cat exhaustive_tests.log || true
-        if: ${{ always() }}
-      - run: cat ctime_tests.log || true
-        if: ${{ always() }}
-      - run: cat bench.log || true
-        if: ${{ always() }}
-      - run: cat config.log || true
-        if: ${{ always() }}
-      - run: cat test_env.log || true
-        if: ${{ always() }}
-      - name: CI env
-        run: env
-        if: ${{ always() }}
-
-  arm64_debian:
-    name: "ARM64: Linux (Debian stable, QEMU)"
-    runs-on: ubuntu-latest
-    needs: docker_cache
-
-    env:
-      WRAPPER_CMD: 'qemu-aarch64'
-      SECP256K1_TEST_ITERS: 16
-      HOST: 'aarch64-linux-gnu'
-      WITH_VALGRIND: 'no'
-      ECDH: 'yes'
-      RECOVERY: 'yes'
-      SCHNORRSIG: 'yes'
-      ELLSWIFT: 'yes'
-      EXPERIMENTAL: 'yes'
-      ECDSA_S2C: 'yes'
-      GENERATOR: 'yes'
-      RANGEPROOF: 'yes'
-      WHITELIST: 'yes'
-      MUSIG: 'yes'
-      ECDSAADAPTOR: 'yes'
-      BPPP: 'yes'
-      SCHNORRSIG_HALFAGG: 'yes'
-      FROST: 'yes'
-      CTIMETESTS: 'no'
-
-    strategy:
-      fail-fast: false
-      matrix:
-        configuration:
-          - env_vars: { } # gcc
-          - env_vars: # clang
-              CC: 'clang --target=aarch64-linux-gnu'
-          - env_vars: # clang-snapshot
-              CC: 'clang-snapshot --target=aarch64-linux-gnu'
-
-    steps:
-      - name: Checkout
-        uses: actions/checkout@v4
-
-      - name: CI script
-        env: ${{ matrix.configuration.env_vars }}
-        uses: ./.github/actions/run-in-docker-action
-        with:
-          dockerfile: ./ci/linux-debian.Dockerfile
-          tag: linux-debian-image
-
-      - run: cat tests.log || true
-        if: ${{ always() }}
-      - run: cat noverify_tests.log || true
-        if: ${{ always() }}
-      - run: cat exhaustive_tests.log || true
-        if: ${{ always() }}
-      - run: cat ctime_tests.log || true
-        if: ${{ always() }}
-      - run: cat bench.log || true
-        if: ${{ always() }}
-      - run: cat config.log || true
-        if: ${{ always() }}
-      - run: cat test_env.log || true
-        if: ${{ always() }}
-      - name: CI env
-        run: env
-        if: ${{ always() }}
-
-  ppc64le_debian:
-    name: "ppc64le: Linux (Debian stable, QEMU)"
-    runs-on: ubuntu-latest
-    needs: docker_cache
-
-    env:
-      WRAPPER_CMD: 'qemu-ppc64le'
-      SECP256K1_TEST_ITERS: 16
-      HOST: 'powerpc64le-linux-gnu'
-      WITH_VALGRIND: 'no'
-      ECDH: 'yes'
-      RECOVERY: 'yes'
-      SCHNORRSIG: 'yes'
-      ELLSWIFT: 'yes'
-      EXPERIMENTAL: 'yes'
-      ECDSA_S2C: 'yes'
-      GENERATOR: 'yes'
-      RANGEPROOF: 'yes'
-      WHITELIST: 'yes'
-      MUSIG: 'yes'
-      ECDSAADAPTOR: 'yes'
-      BPPP: 'yes'
-      SCHNORRSIG_HALFAGG: 'yes'
-      FROST: 'yes'
-      CTIMETESTS: 'no'
-
-    steps:
-      - name: Checkout
-        uses: actions/checkout@v4
-
-      - name: CI script
-        uses: ./.github/actions/run-in-docker-action
-        with:
-          dockerfile: ./ci/linux-debian.Dockerfile
-          tag: linux-debian-image
-
-      - run: cat tests.log || true
-        if: ${{ always() }}
-      - run: cat noverify_tests.log || true
-        if: ${{ always() }}
-      - run: cat exhaustive_tests.log || true
-        if: ${{ always() }}
-      - run: cat ctime_tests.log || true
-        if: ${{ always() }}
-      - run: cat bench.log || true
-        if: ${{ always() }}
-      - run: cat config.log || true
-        if: ${{ always() }}
-      - run: cat test_env.log || true
-        if: ${{ always() }}
-      - name: CI env
-        run: env
-        if: ${{ always() }}
-
-  valgrind_debian:
-    name: "Valgrind (memcheck)"
-    runs-on: ubuntu-latest
-    needs: docker_cache
-
-    strategy:
-      fail-fast: false
-      matrix:
-        configuration:
-          - env_vars: { CC: 'clang',                                      ASM: 'auto' }
-          - env_vars: { CC: 'i686-linux-gnu-gcc', HOST: 'i686-linux-gnu', ASM: 'auto' }
-          - env_vars: { CC: 'clang',                                      ASM: 'no', ECMULTGENPRECISION: 2, ECMULTWINDOW: 2 }
-          - env_vars: { CC: 'i686-linux-gnu-gcc', HOST: 'i686-linux-gnu', ASM: 'no', ECMULTGENPRECISION: 2, ECMULTWINDOW: 2 }
-
-    env:
-      # The `--error-exitcode` is required to make the test fail if valgrind found errors,
-      # otherwise it will return 0 (https://www.valgrind.org/docs/manual/manual-core.html).
-      WRAPPER_CMD: 'valgrind --error-exitcode=42'
-      ECDH: 'yes'
-      RECOVERY: 'yes'
-      SCHNORRSIG: 'yes'
-      ELLSWIFT: 'yes'
-      EXPERIMENTAL: 'yes'
-      ECDSA_S2C: 'yes'
-      GENERATOR: 'yes'
-      RANGEPROOF: 'yes'
-      WHITELIST: 'yes'
-      MUSIG: 'yes'
-      ECDSAADAPTOR: 'yes'
-      BPPP: 'yes'
-      SCHNORRSIG_HALFAGG: 'yes'
-      FROST: 'yes'
-      CTIMETESTS: 'no'
-      SECP256K1_TEST_ITERS: 2
-
-    steps:
-      - name: Checkout
-        uses: actions/checkout@v4
-
-      - name: CI script
-        env: ${{ matrix.configuration.env_vars }}
-        uses: ./.github/actions/run-in-docker-action
-        with:
-          dockerfile: ./ci/linux-debian.Dockerfile
-          tag: linux-debian-image
-
-      - run: cat tests.log || true
-        if: ${{ always() }}
-      - run: cat noverify_tests.log || true
-        if: ${{ always() }}
-      - run: cat exhaustive_tests.log || true
-        if: ${{ always() }}
-      - run: cat ctime_tests.log || true
-        if: ${{ always() }}
-      - run: cat bench.log || true
-        if: ${{ always() }}
-      - run: cat config.log || true
-        if: ${{ always() }}
-      - run: cat test_env.log || true
-        if: ${{ always() }}
-      - name: CI env
-        run: env
-        if: ${{ always() }}
-
-  sanitizers_debian:
-    name: "UBSan, ASan, LSan"
-    runs-on: ubuntu-latest
-    needs: docker_cache
-
-    strategy:
-      fail-fast: false
-      matrix:
-        configuration:
-          - env_vars: { CC: 'clang',                                      ASM: 'auto' }
-          - env_vars: { CC: 'i686-linux-gnu-gcc', HOST: 'i686-linux-gnu', ASM: 'auto' }
-          - env_vars: { CC: 'clang',                                      ASM: 'no', ECMULTGENPRECISION: 2, ECMULTWINDOW: 2 }
-          - env_vars: { CC: 'i686-linux-gnu-gcc', HOST: 'i686-linux-gnu', ASM: 'no', ECMULTGENPRECISION: 2, ECMULTWINDOW: 2 }
-
-    env:
-      ECDH: 'yes'
-      RECOVERY: 'yes'
-      SCHNORRSIG: 'yes'
-      ELLSWIFT: 'yes'
-      EXPERIMENTAL: 'yes'
-      ECDSA_S2C: 'yes'
-      GENERATOR: 'yes'
-      RANGEPROOF: 'yes'
-      WHITELIST: 'yes'
-      MUSIG: 'yes'
-      ECDSAADAPTOR: 'yes'
-      BPPP: 'yes'
-      SCHNORRSIG_HALFAGG: 'yes'
-      FROST: 'yes'
-      CTIMETESTS: 'no'
-      CFLAGS: '-fsanitize=undefined,address -g'
-      UBSAN_OPTIONS: 'print_stacktrace=1:halt_on_error=1'
-      ASAN_OPTIONS: 'strict_string_checks=1:detect_stack_use_after_return=1:detect_leaks=1'
-      LSAN_OPTIONS: 'use_unaligned=1'
-      SECP256K1_TEST_ITERS: 32
-
-    steps:
-      - name: Checkout
-        uses: actions/checkout@v4
-
-      - name: CI script
-        env: ${{ matrix.configuration.env_vars }}
-        uses: ./.github/actions/run-in-docker-action
-        with:
-          dockerfile: ./ci/linux-debian.Dockerfile
-          tag: linux-debian-image
-
-      - run: cat tests.log || true
-        if: ${{ always() }}
-      - run: cat noverify_tests.log || true
-        if: ${{ always() }}
-      - run: cat exhaustive_tests.log || true
-        if: ${{ always() }}
-      - run: cat ctime_tests.log || true
-        if: ${{ always() }}
-      - run: cat bench.log || true
-        if: ${{ always() }}
-      - run: cat config.log || true
-        if: ${{ always() }}
-      - run: cat test_env.log || true
-        if: ${{ always() }}
-      - name: CI env
-        run: env
-        if: ${{ always() }}
-
-  msan_debian:
-    name: "MSan"
-    runs-on: ubuntu-latest
-    needs: docker_cache
-
-    strategy:
-      fail-fast: false
-      matrix:
-        configuration:
-          - env_vars:
-              CFLAGS: '-fsanitize=memory -fsanitize-recover=memory -g'
-          - env_vars:
-              ECMULTGENPRECISION: 2
-              ECMULTWINDOW: 2
-              CFLAGS: '-fsanitize=memory -fsanitize-recover=memory -g -O3'
-
-    env:
-      ECDH: 'yes'
-      RECOVERY: 'yes'
-      SCHNORRSIG: 'yes'
-      ELLSWIFT: 'yes'
-      EXPERIMENTAL: 'yes'
-      ECDSA_S2C: 'yes'
-      GENERATOR: 'yes'
-      RANGEPROOF: 'yes'
-      WHITELIST: 'yes'
-      MUSIG: 'yes'
-      ECDSAADAPTOR: 'yes'
-      BPPP: 'yes'
-      SCHNORRSIG_HALFAGG: 'yes'
-      FROST: 'yes'
-      CTIMETESTS: 'yes'
-      CC: 'clang'
-      SECP256K1_TEST_ITERS: 32
-      ASM: 'no'
-      WITH_VALGRIND: 'no'
-
-    steps:
-      - name: Checkout
-        uses: actions/checkout@v4
-
-      - name: CI script
-        env: ${{ matrix.configuration.env_vars }}
-        uses: ./.github/actions/run-in-docker-action
-        with:
-          dockerfile: ./ci/linux-debian.Dockerfile
-          tag: linux-debian-image
-
-      - run: cat tests.log || true
-        if: ${{ always() }}
-      - run: cat noverify_tests.log || true
-        if: ${{ always() }}
-      - run: cat exhaustive_tests.log || true
-        if: ${{ always() }}
-      - run: cat ctime_tests.log || true
-        if: ${{ always() }}
-      - run: cat bench.log || true
-        if: ${{ always() }}
-      - run: cat config.log || true
-        if: ${{ always() }}
-      - run: cat test_env.log || true
-        if: ${{ always() }}
-      - name: CI env
-        run: env
-        if: ${{ always() }}
-
-  mingw_debian:
-    name: ${{ matrix.configuration.job_name }}
-    runs-on: ubuntu-latest
-    needs: docker_cache
-
-    env:
-      WRAPPER_CMD: 'wine'
-      WITH_VALGRIND: 'no'
-      ECDH: 'yes'
-      RECOVERY: 'yes'
-      SCHNORRSIG: 'yes'
-      ELLSWIFT: 'yes'
-      EXPERIMENTAL: 'yes'
-      ECDSA_S2C: 'yes'
-      GENERATOR: 'yes'
-      RANGEPROOF: 'yes'
-      WHITELIST: 'yes'
-      MUSIG: 'yes'
-      ECDSAADAPTOR: 'yes'
-      BPPP: 'yes'
-      SCHNORRSIG_HALFAGG: 'yes'
-      FROST: 'yes'
-      CTIMETESTS: 'no'
-
-    strategy:
-      fail-fast: false
-      matrix:
-        configuration:
-          - job_name: 'x86_64 (mingw32-w64): Windows (Debian stable, Wine)'
-            env_vars:
-              HOST: 'x86_64-w64-mingw32'
-          - job_name: 'i686 (mingw32-w64): Windows (Debian stable, Wine)'
-            env_vars:
-              HOST: 'i686-w64-mingw32'
-
-    steps:
-      - name: Checkout
-        uses: actions/checkout@v4
-
-      - name: CI script
-        env: ${{ matrix.configuration.env_vars }}
-        uses: ./.github/actions/run-in-docker-action
-        with:
-          dockerfile: ./ci/linux-debian.Dockerfile
-          tag: linux-debian-image
-
-      - run: cat tests.log || true
-        if: ${{ always() }}
-      - run: cat noverify_tests.log || true
-        if: ${{ always() }}
-      - run: cat exhaustive_tests.log || true
-        if: ${{ always() }}
-      - run: cat ctime_tests.log || true
-        if: ${{ always() }}
-      - run: cat bench.log || true
-        if: ${{ always() }}
-      - run: cat config.log || true
-        if: ${{ always() }}
-      - run: cat test_env.log || true
-        if: ${{ always() }}
-      - name: CI env
-        run: env
-        if: ${{ always() }}
-
-  macos-native:
-    name: "x86_64: macOS Monterey"
-    # See: https://github.com/actions/runner-images#available-images.
-    runs-on: macos-12 # Use M1 once available https://github.com/github/roadmap/issues/528
-
-    env:
-      CC: 'clang'
-      HOMEBREW_NO_AUTO_UPDATE: 1
-      HOMEBREW_NO_INSTALL_CLEANUP: 1
-
-    strategy:
-      fail-fast: false
-      matrix:
-        env_vars:
-          - { WIDEMUL: 'int64',  RECOVERY: 'yes', ECDH: 'yes', SCHNORRSIG: 'yes', ELLSWIFT: 'yes', EXPERIMENTAL: 'yes', ECDSA_S2C: 'yes', RANGEPROOF: 'yes', WHITELIST: 'yes', GENERATOR: 'yes', MUSIG: 'yes', ECDSAADAPTOR: 'yes', BPPP: 'yes', SCHNORRSIG_HALFAGG: 'yes', FROST: 'yes' }
-          - { WIDEMUL: 'int128_struct', ECMULTGENPRECISION: 2, ECMULTWINDOW: 4 }
-          - { WIDEMUL: 'int128',                  ECDH: 'yes', SCHNORRSIG: 'yes', ELLSWIFT: 'yes', EXPERIMENTAL: 'yes', ECDSA_S2C: 'yes', RANGEPROOF: 'yes', WHITELIST: 'yes', GENERATOR: 'yes', MUSIG: 'yes', ECDSAADAPTOR: 'yes', BPPP: 'yes', SCHNORRSIG_HALFAGG: 'yes', FROST: 'yes' }
-          - { WIDEMUL: 'int128', RECOVERY: 'yes' }
-          - { WIDEMUL: 'int128', RECOVERY: 'yes', ECDH: 'yes', SCHNORRSIG: 'yes', ELLSWIFT: 'yes', EXPERIMENTAL: 'yes', ECDSA_S2C: 'yes', RANGEPROOF: 'yes', WHITELIST: 'yes', GENERATOR: 'yes', MUSIG: 'yes', ECDSAADAPTOR: 'yes', BPPP: 'yes', SCHNORRSIG_HALFAGG: 'yes', FROST: 'yes' }
-          - { WIDEMUL: 'int128', RECOVERY: 'yes', ECDH: 'yes', SCHNORRSIG: 'yes', ELLSWIFT: 'yes', EXPERIMENTAL: 'yes', ECDSA_S2C: 'yes', RANGEPROOF: 'yes', WHITELIST: 'yes', GENERATOR: 'yes', MUSIG: 'yes', ECDSAADAPTOR: 'yes', BPPP: 'yes', SCHNORRSIG_HALFAGG: 'yes', CC: 'gcc', FROST: 'yes' }
-          - { WIDEMUL: 'int128', RECOVERY: 'yes', ECDH: 'yes', SCHNORRSIG: 'yes', ELLSWIFT: 'yes', EXPERIMENTAL: 'yes', ECDSA_S2C: 'yes', RANGEPROOF: 'yes', WHITELIST: 'yes', GENERATOR: 'yes', MUSIG: 'yes', ECDSAADAPTOR: 'yes', BPPP: 'yes', SCHNORRSIG_HALFAGG: 'yes', FROST: 'yes', WRAPPER_CMD: 'valgrind --error-exitcode=42', SECP256K1_TEST_ITERS: 2 }
-          - { WIDEMUL: 'int128', RECOVERY: 'yes', ECDH: 'yes', SCHNORRSIG: 'yes', ELLSWIFT: 'yes', EXPERIMENTAL: 'yes', ECDSA_S2C: 'yes', RANGEPROOF: 'yes', WHITELIST: 'yes', GENERATOR: 'yes', MUSIG: 'yes', ECDSAADAPTOR: 'yes', BPPP: 'yes', SCHNORRSIG_HALFAGG: 'yes', FROST: 'yes', CC: 'gcc', WRAPPER_CMD: 'valgrind --error-exitcode=42', SECP256K1_TEST_ITERS: 2 }
-          - { WIDEMUL: 'int128', RECOVERY: 'yes', ECDH: 'yes', SCHNORRSIG: 'yes', ELLSWIFT: 'yes', EXPERIMENTAL: 'yes', ECDSA_S2C: 'yes', RANGEPROOF: 'yes', WHITELIST: 'yes', GENERATOR: 'yes', MUSIG: 'yes', ECDSAADAPTOR: 'yes', BPPP: 'yes', SCHNORRSIG_HALFAGG: 'yes', FROST: 'yes', CPPFLAGS: '-DVERIFY', CTIMETESTS: 'no' }
-          - BUILD: 'distcheck'
-
-    steps:
-      - name: Checkout
-        uses: actions/checkout@v4
-
-      - name: Install Homebrew packages
-        run: |
-          brew install automake libtool gcc
-          ln -s $(brew --prefix gcc)/bin/gcc-?? /usr/local/bin/gcc
-
-      - name: Install and cache Valgrind
-        uses: ./.github/actions/install-homebrew-valgrind
-
-      - name: CI script
-        env: ${{ matrix.env_vars }}
-        run: ./ci/ci.sh
-
-      - run: cat tests.log || true
-        if: ${{ always() }}
-      - run: cat noverify_tests.log || true
-        if: ${{ always() }}
-      - run: cat exhaustive_tests.log || true
-        if: ${{ always() }}
-      - run: cat ctime_tests.log || true
-        if: ${{ always() }}
-      - run: cat bench.log || true
-        if: ${{ always() }}
-      - run: cat config.log || true
-        if: ${{ always() }}
-      - run: cat test_env.log || true
-        if: ${{ always() }}
-      - name: CI env
-        run: env
-        if: ${{ always() }}
-
-  win64-native:
-    name: ${{ matrix.configuration.job_name }}
-    # See: https://github.com/actions/runner-images#available-images.
-    runs-on: windows-2022
-
-    strategy:
-      fail-fast: false
-      matrix:
-        configuration:
-          - job_name: 'x64 (MSVC): Windows (VS 2022, shared)'
-            cmake_options: '-A x64 -DBUILD_SHARED_LIBS=ON'
-          - job_name: 'x64 (MSVC): Windows (VS 2022, static)'
-            cmake_options: '-A x64 -DBUILD_SHARED_LIBS=OFF'
-          - job_name: 'x64 (MSVC): Windows (VS 2022, int128_struct)'
-            cmake_options: '-A x64 -DSECP256K1_TEST_OVERRIDE_WIDE_MULTIPLY=int128_struct'
-          - job_name: 'x64 (MSVC): Windows (VS 2022, int128_struct with __(u)mulh)'
-            cmake_options: '-A x64 -DSECP256K1_TEST_OVERRIDE_WIDE_MULTIPLY=int128_struct'
-            cpp_flags: '/DSECP256K1_MSVC_MULH_TEST_OVERRIDE'
-          - job_name: 'x86 (MSVC): Windows (VS 2022)'
-            cmake_options: '-A Win32'
-
-    steps:
-      - name: Checkout
-        uses: actions/checkout@v4
-
-      - name: Generate buildsystem
-        run: cmake -E env CFLAGS="/WX ${{ matrix.configuration.cpp_flags }}" cmake -B build -DSECP256K1_ENABLE_MODULE_RECOVERY=ON -DSECP256K1_BUILD_EXAMPLES=ON ${{ matrix.configuration.cmake_options }}
-
-      - name: Build
-        run: cmake --build build --config RelWithDebInfo -- /p:UseMultiToolTask=true /maxCpuCount
-
-      - name: Binaries info
-        # Use the bash shell included with Git for Windows.
-        shell: bash
-        run: |
-          cd build/src/RelWithDebInfo && file *tests.exe bench*.exe libsecp256k1-*.dll || true
-
-      - name: Check
-        run: |
-          ctest -C RelWithDebInfo --test-dir build -j ([int]$env:NUMBER_OF_PROCESSORS + 1)
-          build\src\RelWithDebInfo\bench_ecmult.exe
-          build\src\RelWithDebInfo\bench_internal.exe
-          build\src\RelWithDebInfo\bench.exe
-
-  win64-native-headers:
-    name: "x64 (MSVC): C++ (public headers)"
-    # See: https://github.com/actions/runner-images#available-images.
-    runs-on: windows-2022
-
-    steps:
-      - name: Checkout
-        uses: actions/checkout@v4
-
-      - name: Add cl.exe to PATH
-        uses: ilammy/msvc-dev-cmd@v1
-
-      - name: C++ (public headers)
-        run: |
-          cl.exe -c -WX -TP include/*.h
-
-  cxx_fpermissive_debian:
-    name: "C++ -fpermissive (entire project)"
-    runs-on: ubuntu-latest
-    needs: docker_cache
-
-    env:
-      CC: 'g++'
-      CFLAGS: '-fpermissive -g'
-      CPPFLAGS: '-DSECP256K1_CPLUSPLUS_TEST_OVERRIDE'
-      WERROR_CFLAGS:
-      ECDH: 'yes'
-      RECOVERY: 'yes'
-      SCHNORRSIG: 'yes'
-      ELLSWIFT: 'yes'
-      EXPERIMENTAL: 'yes'
-      ECDSA_S2C: 'yes'
-      GENERATOR: 'yes'
-      RANGEPROOF: 'yes'
-      WHITELIST: 'yes'
-      MUSIG: 'yes'
-      ECDSAADAPTOR: 'yes'
-      BPPP: 'yes'
-      SCHNORRSIG_HALFAGG: 'yes'
-      FROST: 'yes'
-
-    steps:
-      - name: Checkout
-        uses: actions/checkout@v4
-
-      - name: CI script
-        uses: ./.github/actions/run-in-docker-action
-        with:
-          dockerfile: ./ci/linux-debian.Dockerfile
-          tag: linux-debian-image
-
-      - run: cat tests.log || true
-        if: ${{ always() }}
-      - run: cat noverify_tests.log || true
-        if: ${{ always() }}
-      - run: cat exhaustive_tests.log || true
-        if: ${{ always() }}
-      - run: cat ctime_tests.log || true
-        if: ${{ always() }}
-      - run: cat bench.log || true
-        if: ${{ always() }}
-      - run: cat config.log || true
-        if: ${{ always() }}
-      - run: cat test_env.log || true
-        if: ${{ always() }}
-      - name: CI env
-        run: env
-        if: ${{ always() }}
-
-  cxx_headers_debian:
-    name: "C++ (public headers)"
-    runs-on: ubuntu-latest
-    needs: docker_cache
-
-    steps:
-      - name: Checkout
-        uses: actions/checkout@v4
-
-      - name: CI script
-        uses: ./.github/actions/run-in-docker-action
-        with:
-          dockerfile: ./ci/linux-debian.Dockerfile
-          tag: linux-debian-image
-          command: |
-            g++ -Werror include/*.h
-            clang -Werror -x c++-header include/*.h
-
-  sage:
-    name: "SageMath prover"
-    runs-on: ubuntu-latest
-    container:
-      image: sagemath/sagemath:latest
-      options: --user root
-
-    steps:
-      - name: Checkout
-        uses: actions/checkout@v4
-
-      - name: CI script
-        run: |
-          cd sage
-          sage prove_group_implementations.sage
-
-  release:
-    runs-on: ubuntu-latest
-
-    steps:
-      - name: Checkout
-        uses: actions/checkout@v4
-
-      - run: ./autogen.sh && ./configure --enable-dev-mode && make distcheck
-
-      - name: Check installation with Autotools
-        env:
-          CI_INSTALL: ${{ runner.temp }}/${{ github.run_id }}${{ github.action }}/install
-        run: |
-          ./autogen.sh && ./configure --prefix=${{ env.CI_INSTALL }} && make clean && make install && ls -RlAh ${{ env.CI_INSTALL }}
-          gcc -o ecdsa examples/ecdsa.c $(PKG_CONFIG_PATH=${{ env.CI_INSTALL }}/lib/pkgconfig pkg-config --cflags --libs libsecp256k1) -Wl,-rpath,"${{ env.CI_INSTALL }}/lib" && ./ecdsa
-
-      - name: Check installation with CMake
-        env:
-          CI_BUILD: ${{ runner.temp }}/${{ github.run_id }}${{ github.action }}/build
-          CI_INSTALL: ${{ runner.temp }}/${{ github.run_id }}${{ github.action }}/install
-        run: |
-          cmake -B ${{ env.CI_BUILD }} -DCMAKE_INSTALL_PREFIX=${{ env.CI_INSTALL }} && cmake --build ${{ env.CI_BUILD }} --target install && ls -RlAh ${{ env.CI_INSTALL }}
-          gcc -o ecdsa examples/ecdsa.c -I ${{ env.CI_INSTALL }}/include -L ${{ env.CI_INSTALL }}/lib*/ -l secp256k1 -Wl,-rpath,"${{ env.CI_INSTALL }}/lib",-rpath,"${{ env.CI_INSTALL }}/lib64" && ./ecdsa

.gitignore

@@ -1,27 +1,17 @@
-bench
-bench_bppp
-bench_ecmult
-bench_generator
-bench_rangeproof
+bench_inv
+bench_ecdh
+bench_sign
+bench_verify
+bench_schnorr_verify
+bench_recover
 bench_internal
-bench_whitelist
-noverify_tests
 tests
-example_musig
 exhaustive_tests
-precompute_ecmult_gen
-precompute_ecmult
-ctime_tests
-ecdh_example
-ecdsa_example
-schnorr_example
+gen_context
 *.exe
 *.so
 *.a
-*.csv
-*.log
-*.trs
-*.sage.py
+!.gitignore
 
 Makefile
 configure
@@ -31,7 +21,6 @@ aclocal.m4
 autom4te.cache/
 config.log
 config.status
-conftest*
 *.tar.gz
 *.la
 libtool
@@ -40,15 +29,9 @@ libtool
 *.lo
 *.o
 *~
-
-coverage/
-coverage.html
-coverage.*.html
-*.gcda
-*.gcno
-*.gcov
-
-build-aux/ar-lib
+src/libsecp256k1-config.h
+src/libsecp256k1-config.h.in
+src/ecmult_static_context.h
 build-aux/config.guess
 build-aux/config.sub
 build-aux/depcomp
@@ -62,14 +45,5 @@ build-aux/m4/ltversion.m4
 build-aux/missing
 build-aux/compile
 build-aux/test-driver
+src/stamp-h1
 libsecp256k1.pc
-contrib/gh-pr-create.sh
-
-musig_example
-frost_example
-
-### CMake
-/CMakeUserPresets.json
-# Default CMake build directory.
-/build
-xconfigure.sh

.travis.yml

@@ -0,0 +1,69 @@
+language: c
+sudo: false
+addons:
+  apt:
+    packages: libgmp-dev
+compiler:
+  - clang
+  - gcc
+cache:
+  directories:
+  - src/java/guava/
+env:
+  global:
+    - FIELD=auto  BIGNUM=auto  SCALAR=auto  ENDOMORPHISM=no  STATICPRECOMPUTATION=yes  ASM=no  BUILD=check  EXTRAFLAGS=  HOST=  ECDH=no  RECOVERY=no  EXPERIMENTAL=no
+    - GUAVA_URL=https://search.maven.org/remotecontent?filepath=com/google/guava/guava/18.0/guava-18.0.jar GUAVA_JAR=src/java/guava/guava-18.0.jar
+  matrix:
+    - SCALAR=32bit    RECOVERY=yes
+    - SCALAR=32bit    FIELD=32bit       ECDH=yes  EXPERIMENTAL=yes
+    - SCALAR=64bit
+    - FIELD=64bit     RECOVERY=yes
+    - FIELD=64bit     ENDOMORPHISM=yes
+    - FIELD=64bit     ENDOMORPHISM=yes  ECDH=yes EXPERIMENTAL=yes
+    - FIELD=64bit                       ASM=x86_64
+    - FIELD=64bit     ENDOMORPHISM=yes  ASM=x86_64
+    - FIELD=32bit     ENDOMORPHISM=yes
+    - BIGNUM=no
+    - BIGNUM=no       ENDOMORPHISM=yes RECOVERY=yes EXPERIMENTAL=yes
+    - BIGNUM=no       STATICPRECOMPUTATION=no
+    - BUILD=distcheck
+    - EXTRAFLAGS=CPPFLAGS=-DDETERMINISTIC
+    - EXTRAFLAGS=CFLAGS=-O0
+    - BUILD=check-java ECDH=yes EXPERIMENTAL=yes
+matrix:
+  fast_finish: true
+  include:
+    - compiler: clang
+      env: HOST=i686-linux-gnu ENDOMORPHISM=yes
+      addons:
+        apt:
+          packages:
+            - gcc-multilib
+            - libgmp-dev:i386
+    - compiler: clang
+      env: HOST=i686-linux-gnu
+      addons:
+        apt:
+          packages:
+            - gcc-multilib
+    - compiler: gcc
+      env: HOST=i686-linux-gnu ENDOMORPHISM=yes
+      addons:
+        apt:
+          packages:
+            - gcc-multilib
+    - compiler: gcc
+      env: HOST=i686-linux-gnu
+      addons:
+        apt:
+          packages:
+            - gcc-multilib
+            - libgmp-dev:i386
+before_install: mkdir -p `dirname $GUAVA_JAR`
+install: if [ ! -f $GUAVA_JAR ]; then wget $GUAVA_URL -O $GUAVA_JAR; fi
+before_script: ./autogen.sh
+script:
+ - if [ -n "$HOST" ]; then export USE_HOST="--host=$HOST"; fi
+ - if [ "x$HOST" = "xi686-linux-gnu" ]; then export CC="$CC -m32"; fi
+ - ./configure --enable-experimental=$EXPERIMENTAL --enable-endomorphism=$ENDOMORPHISM --with-field=$FIELD --with-bignum=$BIGNUM --with-scalar=$SCALAR --enable-ecmult-static-precomputation=$STATICPRECOMPUTATION --enable-module-ecdh=$ECDH --enable-module-recovery=$RECOVERY $EXTRAFLAGS $USE_HOST && make -j2 $BUILD
+os: linux

CHANGELOG.md

@@ -1,128 +0,0 @@
-**This changelog is not the libsecp256k1-zkp's changelog.**
-Instead, it is the changelog of the upstream library [libsecp256k1](https://github.com/bitcoin-core/secp256k1).
-
-# Changelog
-
-All notable changes to this project will be documented in this file.
-
-The format is based on [Keep a Changelog](https://keepachangelog.com/en/1.0.0/),
-and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0.html).
-
-## [Unreleased]
-
-## [0.4.1] - 2023-12-21
-
-#### Changed
- - The point multiplication algorithm used for ECDH operations (module `ecdh`) was replaced with a slightly faster one.
- - Optional handwritten x86_64 assembly for field operations was removed because modern C compilers are able to output more efficient assembly. This change results in a significant speedup of some library functions when handwritten x86_64 assembly is enabled (`--with-asm=x86_64` in GNU Autotools, `-DSECP256K1_ASM=x86_64` in CMake), which is the default on x86_64. Benchmarks with GCC 10.5.0 show a 10% speedup for `secp256k1_ecdsa_verify` and `secp256k1_schnorrsig_verify`.
-
-#### ABI Compatibility
-The ABI is backward compatible with versions 0.4.0 and 0.3.x.
-
-## [0.4.0] - 2023-09-04
-
-#### Added
- - New module `ellswift` implements ElligatorSwift encoding for public keys and x-only Diffie-Hellman key exchange for them.
-   ElligatorSwift permits representing secp256k1 public keys as 64-byte arrays which cannot be distinguished from uniformly random. See:
-   - Header file `include/secp256k1_ellswift.h` which defines the new API.
-   - Document `doc/ellswift.md` which explains the mathematical background of the scheme.
-   - The [paper](https://eprint.iacr.org/2022/759) on which the scheme is based.
- - We now test the library with unreleased development snapshots of GCC and Clang. This gives us an early chance to catch miscompilations and constant-time issues introduced by the compiler (such as those that led to the previous two releases).
-
-#### Fixed
- - Fixed symbol visibility in Windows DLL builds, where three internal library symbols were wrongly exported.
-
-#### Changed
- - When consuming libsecp256k1 as a static library on Windows, the user must now define the `SECP256K1_STATIC` macro before including `secp256k1.h`.
-
-#### ABI Compatibility
-This release is backward compatible with the ABI of 0.3.0, 0.3.1, and 0.3.2. Symbol visibility is now believed to be handled properly on supported platforms and is now considered to be part of the ABI. Please report any improperly exported symbols as a bug.
-
-## [0.3.2] - 2023-05-13
-We strongly recommend updating to 0.3.2 if you use or plan to use GCC >=13 to compile libsecp256k1. When in doubt, check the GCC version using `gcc -v`.
-
-#### Security
- - Module `ecdh`: Fix "constant-timeness" issue with GCC 13.1 (and potentially future versions of GCC) that could leave applications using libsecp256k1's ECDH module vulnerable to a timing side-channel attack. The fix avoids secret-dependent control flow during ECDH computations when libsecp256k1 is compiled with GCC 13.1.
-
-#### Fixed
- - Fixed an old bug that permitted compilers to potentially output bad assembly code on x86_64. In theory, it could lead to a crash or a read of unrelated memory, but this has never been observed on any compilers so far.
-
-#### Changed
- - Various improvements and changes to CMake builds. CMake builds remain experimental.
-   - Made API versioning consistent with GNU Autotools builds.
-   - Switched to `BUILD_SHARED_LIBS` variable for controlling whether to build a static or a shared library.
-   - Added `SECP256K1_INSTALL` variable for the controlling whether to install the build artefacts.
- - Renamed asm build option `arm` to `arm32`. Use `--with-asm=arm32` instead of `--with-asm=arm` (GNU Autotools), and `-DSECP256K1_ASM=arm32` instead of `-DSECP256K1_ASM=arm` (CMake).
-
-#### ABI Compatibility
-The ABI is compatible with versions 0.3.0 and 0.3.1.
-
-## [0.3.1] - 2023-04-10
-We strongly recommend updating to 0.3.1 if you use or plan to use Clang >=14 to compile libsecp256k1, e.g., Xcode >=14 on macOS has Clang >=14. When in doubt, check the Clang version using `clang -v`.
-
-#### Security
- - Fix "constant-timeness" issue with Clang >=14 that could leave applications using libsecp256k1 vulnerable to a timing side-channel attack. The fix avoids secret-dependent control flow and secret-dependent memory accesses in conditional moves of memory objects when libsecp256k1 is compiled with Clang >=14.
-
-#### Added
-  - Added tests against [Project Wycheproof's](https://github.com/google/wycheproof/) set of ECDSA test vectors (Bitcoin "low-S" variant), a fixed set of test cases designed to trigger various edge cases.
-
-#### Changed
- - Increased minimum required CMake version to 3.13. CMake builds remain experimental.
-
-#### ABI Compatibility
-The ABI is compatible with version 0.3.0.
-
-## [0.3.0] - 2023-03-08
-
-#### Added
- - Added experimental support for CMake builds. Traditional GNU Autotools builds (`./configure` and `make`) remain fully supported.
- - Usage examples: Added a recommended method for securely clearing sensitive data, e.g., secret keys, from memory.
- - Tests: Added a new test binary `noverify_tests`. This binary runs the tests without some additional checks present in the ordinary `tests` binary and is thereby closer to production binaries. The `noverify_tests` binary is automatically run as part of the `make check` target.
-
-#### Fixed
- - Fixed declarations of API variables for MSVC (`__declspec(dllimport)`). This fixes MSVC builds of programs which link against a libsecp256k1 DLL dynamically and use API variables (and not only API functions). Unfortunately, the MSVC linker now will emit warning `LNK4217` when trying to link against libsecp256k1 statically. Pass `/ignore:4217` to the linker to suppress this warning.
-
-#### Changed
- - Forbade cloning or destroying `secp256k1_context_static`. Create a new context instead of cloning the static context. (If this change breaks your code, your code is probably wrong.)
- - Forbade randomizing (copies of) `secp256k1_context_static`. Randomizing a copy of `secp256k1_context_static` did not have any effect and did not provide defense-in-depth protection against side-channel attacks. Create a new context if you want to benefit from randomization.
-
-#### Removed
- - Removed the configuration header `src/libsecp256k1-config.h`. We recommend passing flags to `./configure` or `cmake` to set configuration options (see `./configure --help` or `cmake -LH`). If you cannot or do not want to use one of the supported build systems, pass configuration flags such as `-DSECP256K1_ENABLE_MODULE_SCHNORRSIG` manually to the compiler (see the file `configure.ac` for supported flags).
-
-#### ABI Compatibility
-Due to changes in the API regarding `secp256k1_context_static` described above, the ABI is *not* compatible with previous versions.
-
-## [0.2.0] - 2022-12-12
-
-#### Added
- - Added usage examples for common use cases in a new `examples/` directory.
- - Added `secp256k1_selftest`, to be used in conjunction with `secp256k1_context_static`.
- - Added support for 128-bit wide multiplication on MSVC for x86_64 and arm64, giving roughly a 20% speedup on those platforms.
-
-#### Changed
- - Enabled modules `schnorrsig`, `extrakeys` and `ecdh` by default in `./configure`.
- - The `secp256k1_nonce_function_rfc6979` nonce function, used by default by `secp256k1_ecdsa_sign`, now reduces the message hash modulo the group order to match the specification. This only affects improper use of ECDSA signing API.
-
-#### Deprecated
- - Deprecated context flags `SECP256K1_CONTEXT_VERIFY` and `SECP256K1_CONTEXT_SIGN`. Use `SECP256K1_CONTEXT_NONE` instead.
- - Renamed `secp256k1_context_no_precomp` to `secp256k1_context_static`.
- - Module `schnorrsig`: renamed `secp256k1_schnorrsig_sign` to `secp256k1_schnorrsig_sign32`.
-
-#### ABI Compatibility
-Since this is the first release, we do not compare application binary interfaces.
-However, there are earlier unreleased versions of libsecp256k1 that are *not* ABI compatible with this version.
-
-## [0.1.0] - 2013-03-05 to 2021-12-25
-
-This version was in fact never released.
-The number was given by the build system since the introduction of autotools in Jan 2014 (ea0fe5a5bf0c04f9cc955b2966b614f5f378c6f6).
-Therefore, this version number does not uniquely identify a set of source files.
-
-[unreleased]: https://github.com/bitcoin-core/secp256k1/compare/v0.4.1...HEAD
-[0.4.1]: https://github.com/bitcoin-core/secp256k1/compare/v0.4.0...v0.4.1
-[0.4.0]: https://github.com/bitcoin-core/secp256k1/compare/v0.3.2...v0.4.0
-[0.3.2]: https://github.com/bitcoin-core/secp256k1/compare/v0.3.1...v0.3.2
-[0.3.1]: https://github.com/bitcoin-core/secp256k1/compare/v0.3.0...v0.3.1
-[0.3.0]: https://github.com/bitcoin-core/secp256k1/compare/v0.2.0...v0.3.0
-[0.2.0]: https://github.com/bitcoin-core/secp256k1/compare/423b6d19d373f1224fd671a982584d7e7900bc93..v0.2.0
-[0.1.0]: https://github.com/bitcoin-core/secp256k1/commit/423b6d19d373f1224fd671a982584d7e7900bc93

CMakeLists.txt

@@ -1,430 +0,0 @@
-cmake_minimum_required(VERSION 3.13)
-
-if(CMAKE_VERSION VERSION_GREATER_EQUAL 3.15)
-  # MSVC runtime library flags are selected by the CMAKE_MSVC_RUNTIME_LIBRARY abstraction.
-  cmake_policy(SET CMP0091 NEW)
-  # MSVC warning flags are not in CMAKE_<LANG>_FLAGS by default.
-  cmake_policy(SET CMP0092 NEW)
-endif()
-
-project(libsecp256k1
-  # The package (a.k.a. release) version is based on semantic versioning 2.0.0 of
-  # the API. All changes in experimental modules are treated as
-  # backwards-compatible and therefore at most increase the minor version.
-  VERSION 0.4.2
-  DESCRIPTION "Optimized C library for ECDSA signatures and secret/public key operations on curve secp256k1."
-  HOMEPAGE_URL "https://github.com/bitcoin-core/secp256k1"
-  LANGUAGES C
-)
-
-if(CMAKE_VERSION VERSION_LESS 3.21)
-  get_directory_property(parent_directory PARENT_DIRECTORY)
-  if(parent_directory)
-    set(PROJECT_IS_TOP_LEVEL OFF CACHE INTERNAL "Emulates CMake 3.21+ behavior.")
-    set(${PROJECT_NAME}_IS_TOP_LEVEL OFF CACHE INTERNAL "Emulates CMake 3.21+ behavior.")
-  else()
-    set(PROJECT_IS_TOP_LEVEL ON CACHE INTERNAL "Emulates CMake 3.21+ behavior.")
-    set(${PROJECT_NAME}_IS_TOP_LEVEL ON CACHE INTERNAL "Emulates CMake 3.21+ behavior.")
-  endif()
-  unset(parent_directory)
-endif()
-
-# The library version is based on libtool versioning of the ABI. The set of
-# rules for updating the version can be found here:
-# https://www.gnu.org/software/libtool/manual/html_node/Updating-version-info.html
-# All changes in experimental modules are treated as if they don't affect the
-# interface and therefore only increase the revision.
-set(${PROJECT_NAME}_LIB_VERSION_CURRENT 3)
-set(${PROJECT_NAME}_LIB_VERSION_REVISION 2)
-set(${PROJECT_NAME}_LIB_VERSION_AGE 1)
-
-set(CMAKE_C_STANDARD 90)
-set(CMAKE_C_EXTENSIONS OFF)
-
-list(APPEND CMAKE_MODULE_PATH ${PROJECT_SOURCE_DIR}/cmake)
-
-option(BUILD_SHARED_LIBS "Build shared libraries." ON)
-option(SECP256K1_DISABLE_SHARED "Disable shared library. Overrides BUILD_SHARED_LIBS." OFF)
-if(SECP256K1_DISABLE_SHARED)
-  set(BUILD_SHARED_LIBS OFF)
-endif()
-
-option(SECP256K1_INSTALL "Enable installation." ${PROJECT_IS_TOP_LEVEL})
-
-## Modules
-
-# We declare all options before processing them, to make sure we can express
-# dependendencies while processing.
-option(SECP256K1_ENABLE_MODULE_ECDH "Enable ECDH module." ON)
-option(SECP256K1_ENABLE_MODULE_RECOVERY "Enable ECDSA pubkey recovery module." OFF)
-option(SECP256K1_ENABLE_MODULE_EXTRAKEYS "Enable extrakeys module." ON)
-option(SECP256K1_ENABLE_MODULE_SCHNORRSIG "Enable schnorrsig module." ON)
-option(SECP256K1_ENABLE_MODULE_ELLSWIFT "Enable ElligatorSwift module." ON)
-
-option(SECP256K1_ENABLE_MODULE_GENERATOR "Enable NUMS generator module." ON)
-option(SECP256K1_ENABLE_MODULE_RANGEPROOF "Enable Range proof module." ON)
-option(SECP256K1_ENABLE_MODULE_SURJECTIONPROOF "Enable Surjection proof module." ON)
-option(SECP256K1_ENABLE_MODULE_WHITELIST "Enable key whitelist module." ON)
-option(SECP256K1_ENABLE_MODULE_MUSIG "Enable MuSig module." ON)
-option(SECP256K1_ENABLE_MODULE_ECDSA_ADAPTOR "Enable ecdsa adaptor signatures module." ON)
-option(SECP256K1_ENABLE_MODULE_ECDSA_S2C "Enable ECDSA sign-to-contract module." ON)
-option(SECP256K1_ENABLE_MODULE_BPPP "Enable Bulletproofs++ module." ON)
-
-# Processing must be done in a topological sorting of the dependency graph
-# (dependent module first).
-if(SECP256K1_ENABLE_MODULE_BPPP)
-  if(DEFINED SECP256K1_ENABLE_MODULE_GENERATOR AND NOT SECP256K1_ENABLE_MODULE_GENERATOR)
-    message(FATAL_ERROR "Module dependency error: You have disabled the generator module explicitly, but it is required by the bppp module.")
-  endif()
-  set(SECP256K1_ENABLE_MODULE_GENERATOR ON)
-  add_compile_definitions(ENABLE_MODULE_BPPP=1)
-endif()
-
-if(SECP256K1_ENABLE_MODULE_ECDSA_S2C)
-  add_compile_definitions(ENABLE_MODULE_ECDSA_S2C=1)
-endif()
-
-if(SECP256K1_ENABLE_MODULE_ECDSA_ADAPTOR)
-  add_compile_definitions(ENABLE_MODULE_ECDSA_ADAPTOR=1)
-endif()
-
-if(SECP256K1_ENABLE_MODULE_MUSIG)
-  if(DEFINED SECP256K1_ENABLE_MODULE_SCHNORRSIG AND NOT SECP256K1_ENABLE_MODULE_SCHNORRSIG)
-    message(FATAL_ERROR "Module dependency error: You have disabled the schnorrsig module explicitly, but it is required by the musig module.")
-  endif()
-  set(SECP256K1_ENABLE_MODULE_SCHNORRSIG ON)
-  add_compile_definitions(ENABLE_MODULE_MUSIG=1)
-endif()
-
-if(SECP256K1_ENABLE_MODULE_WHITELIST)
-  if(DEFINED SECP256K1_ENABLE_MODULE_RANGEPROOF AND NOT SECP256K1_ENABLE_MODULE_RANGEPROOF)
-    message(FATAL_ERROR "Module dependency error: You have disabled the rangeproof module explicitly, but it is required by the whitelist module.")
-  endif()
-  set(SECP256K1_ENABLE_MODULE_RANGEPROOF ON)
-  add_compile_definitions(ENABLE_MODULE_WHITELIST=1)
-endif()
-
-if(SECP256K1_ENABLE_MODULE_SURJECTIONPROOF)
-  if(DEFINED SECP256K1_ENABLE_MODULE_RANGEPROOF AND NOT SECP256K1_ENABLE_MODULE_RANGEPROOF)
-    message(FATAL_ERROR "Module dependency error: You have disabled the rangeproof module explicitly, but it is required by the surjectionproof module.")
-  endif()
-  set(SECP256K1_ENABLE_MODULE_RANGEPROOF ON)
-  add_compile_definitions(ENABLE_MODULE_SURJECTIONPROOF=1)
-endif()
-
-if(SECP256K1_ENABLE_MODULE_RANGEPROOF)
-  if(DEFINED SECP256K1_ENABLE_MODULE_GENERATOR AND NOT SECP256K1_ENABLE_MODULE_GENERATOR)
-    message(FATAL_ERROR "Module dependency error: You have disabled the generator module explicitly, but it is required by the rangeproof module.")
-  endif()
-  set(SECP256K1_ENABLE_MODULE_GENERATOR ON)
-  add_compile_definitions(ENABLE_MODULE_RANGEPROOF=1)
-endif()
-
-if(SECP256K1_ENABLE_MODULE_GENERATOR)
-  add_compile_definitions(ENABLE_MODULE_GENERATOR=1)
-endif()
-
-
-if(SECP256K1_ENABLE_MODULE_ELLSWIFT)
-  add_compile_definitions(ENABLE_MODULE_ELLSWIFT=1)
-endif()
-
-if(SECP256K1_ENABLE_MODULE_SCHNORRSIG)
-  if(DEFINED SECP256K1_ENABLE_MODULE_EXTRAKEYS AND NOT SECP256K1_ENABLE_MODULE_EXTRAKEYS)
-    message(FATAL_ERROR "Module dependency error: You have disabled the extrakeys module explicitly, but it is required by the schnorrsig module.")
-  endif()
-  set(SECP256K1_ENABLE_MODULE_EXTRAKEYS ON)
-  add_compile_definitions(ENABLE_MODULE_SCHNORRSIG=1)
-endif()
-
-if(SECP256K1_ENABLE_MODULE_EXTRAKEYS)
-  add_compile_definitions(ENABLE_MODULE_EXTRAKEYS=1)
-endif()
-
-if(SECP256K1_ENABLE_MODULE_RECOVERY)
-  add_compile_definitions(ENABLE_MODULE_RECOVERY=1)
-endif()
-
-if(SECP256K1_ENABLE_MODULE_ECDH)
-  add_compile_definitions(ENABLE_MODULE_ECDH=1)
-endif()
-
-option(SECP256K1_USE_EXTERNAL_DEFAULT_CALLBACKS "Enable external default callback functions." OFF)
-if(SECP256K1_USE_EXTERNAL_DEFAULT_CALLBACKS)
-  add_compile_definitions(USE_EXTERNAL_DEFAULT_CALLBACKS=1)
-endif()
-
-set(SECP256K1_ECMULT_WINDOW_SIZE "AUTO" CACHE STRING "Window size for ecmult precomputation for verification, specified as integer in range [2..24]. \"AUTO\" is a reasonable setting for desktop machines (currently 15). [default=AUTO]")
-set_property(CACHE SECP256K1_ECMULT_WINDOW_SIZE PROPERTY STRINGS "AUTO" 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24)
-include(CheckStringOptionValue)
-check_string_option_value(SECP256K1_ECMULT_WINDOW_SIZE)
-if(SECP256K1_ECMULT_WINDOW_SIZE STREQUAL "AUTO")
-  set(SECP256K1_ECMULT_WINDOW_SIZE 15)
-endif()
-add_compile_definitions(ECMULT_WINDOW_SIZE=${SECP256K1_ECMULT_WINDOW_SIZE})
-
-set(SECP256K1_ECMULT_GEN_PREC_BITS "AUTO" CACHE STRING "Precision bits to tune the precomputed table size for signing, specified as integer 2, 4 or 8. \"AUTO\" is a reasonable setting for desktop machines (currently 4). [default=AUTO]")
-set_property(CACHE SECP256K1_ECMULT_GEN_PREC_BITS PROPERTY STRINGS "AUTO" 2 4 8)
-check_string_option_value(SECP256K1_ECMULT_GEN_PREC_BITS)
-if(SECP256K1_ECMULT_GEN_PREC_BITS STREQUAL "AUTO")
-  set(SECP256K1_ECMULT_GEN_PREC_BITS 4)
-endif()
-add_compile_definitions(ECMULT_GEN_PREC_BITS=${SECP256K1_ECMULT_GEN_PREC_BITS})
-
-set(SECP256K1_TEST_OVERRIDE_WIDE_MULTIPLY "OFF" CACHE STRING "Test-only override of the (autodetected by the C code) \"widemul\" setting. Legal values are: \"OFF\", \"int128_struct\", \"int128\" or \"int64\". [default=OFF]")
-set_property(CACHE SECP256K1_TEST_OVERRIDE_WIDE_MULTIPLY PROPERTY STRINGS "OFF" "int128_struct" "int128" "int64")
-check_string_option_value(SECP256K1_TEST_OVERRIDE_WIDE_MULTIPLY)
-if(SECP256K1_TEST_OVERRIDE_WIDE_MULTIPLY)
-  string(TOUPPER "${SECP256K1_TEST_OVERRIDE_WIDE_MULTIPLY}" widemul_upper_value)
-  add_compile_definitions(USE_FORCE_WIDEMUL_${widemul_upper_value}=1)
-endif()
-mark_as_advanced(FORCE SECP256K1_TEST_OVERRIDE_WIDE_MULTIPLY)
-
-set(SECP256K1_ASM "AUTO" CACHE STRING "Assembly to use: \"AUTO\", \"OFF\", \"x86_64\" or \"arm32\" (experimental). [default=AUTO]")
-set_property(CACHE SECP256K1_ASM PROPERTY STRINGS "AUTO" "OFF" "x86_64" "arm32")
-check_string_option_value(SECP256K1_ASM)
-if(SECP256K1_ASM STREQUAL "arm32")
-  enable_language(ASM)
-  include(CheckArm32Assembly)
-  check_arm32_assembly()
-  if(HAVE_ARM32_ASM)
-    add_compile_definitions(USE_EXTERNAL_ASM=1)
-  else()
-    message(FATAL_ERROR "ARM32 assembly requested but not available.")
-  endif()
-elseif(SECP256K1_ASM)
-  include(CheckX86_64Assembly)
-  check_x86_64_assembly()
-  if(HAVE_X86_64_ASM)
-    set(SECP256K1_ASM "x86_64")
-    add_compile_definitions(USE_ASM_X86_64=1)
-  elseif(SECP256K1_ASM STREQUAL "AUTO")
-    set(SECP256K1_ASM "OFF")
-  else()
-    message(FATAL_ERROR "x86_64 assembly requested but not available.")
-  endif()
-endif()
-
-option(SECP256K1_EXPERIMENTAL "Allow experimental configuration options." OFF)
-if(NOT SECP256K1_EXPERIMENTAL)
-  if(SECP256K1_ASM STREQUAL "arm32")
-    message(FATAL_ERROR "ARM32 assembly is experimental. Use -DSECP256K1_EXPERIMENTAL=ON to allow.")
-  endif()
-endif()
-
-set(SECP256K1_VALGRIND "AUTO" CACHE STRING "Build with extra checks for running inside Valgrind. [default=AUTO]")
-set_property(CACHE SECP256K1_VALGRIND PROPERTY STRINGS "AUTO" "OFF" "ON")
-check_string_option_value(SECP256K1_VALGRIND)
-if(SECP256K1_VALGRIND)
-  find_package(Valgrind MODULE)
-  if(Valgrind_FOUND)
-    set(SECP256K1_VALGRIND ON)
-    include_directories(${Valgrind_INCLUDE_DIR})
-    add_compile_definitions(VALGRIND)
-  elseif(SECP256K1_VALGRIND STREQUAL "AUTO")
-    set(SECP256K1_VALGRIND OFF)
-  else()
-    message(FATAL_ERROR "Valgrind support requested but valgrind/memcheck.h header not available.")
-  endif()
-endif()
-
-option(SECP256K1_BUILD_BENCHMARK "Build benchmarks." ON)
-option(SECP256K1_BUILD_TESTS "Build tests." ON)
-option(SECP256K1_BUILD_EXHAUSTIVE_TESTS "Build exhaustive tests." ON)
-option(SECP256K1_BUILD_CTIME_TESTS "Build constant-time tests." ${SECP256K1_VALGRIND})
-option(SECP256K1_BUILD_EXAMPLES "Build examples." OFF)
-
-# Redefine configuration flags.
-# We leave assertions on, because they are only used in the examples, and we want them always on there.
-if(MSVC)
-  string(REGEX REPLACE "/DNDEBUG[ \t\r\n]*" "" CMAKE_C_FLAGS_RELWITHDEBINFO "${CMAKE_C_FLAGS_RELWITHDEBINFO}")
-  string(REGEX REPLACE "/DNDEBUG[ \t\r\n]*" "" CMAKE_C_FLAGS_RELEASE "${CMAKE_C_FLAGS_RELEASE}")
-  string(REGEX REPLACE "/DNDEBUG[ \t\r\n]*" "" CMAKE_C_FLAGS_MINSIZEREL "${CMAKE_C_FLAGS_MINSIZEREL}")
-else()
-  string(REGEX REPLACE "-DNDEBUG[ \t\r\n]*" "" CMAKE_C_FLAGS_RELWITHDEBINFO "${CMAKE_C_FLAGS_RELWITHDEBINFO}")
-  string(REGEX REPLACE "-DNDEBUG[ \t\r\n]*" "" CMAKE_C_FLAGS_RELEASE "${CMAKE_C_FLAGS_RELEASE}")
-  string(REGEX REPLACE "-DNDEBUG[ \t\r\n]*" "" CMAKE_C_FLAGS_MINSIZEREL "${CMAKE_C_FLAGS_MINSIZEREL}")
-  # Prefer -O2 optimization level. (-O3 is CMake's default for Release for many compilers.)
-  string(REGEX REPLACE "-O3[ \t\r\n]*" "-O2" CMAKE_C_FLAGS_RELEASE "${CMAKE_C_FLAGS_RELEASE}")
-endif()
-
-# Define custom "Coverage" build type.
-set(CMAKE_C_FLAGS_COVERAGE "${CMAKE_C_FLAGS_RELWITHDEBINFO} -O0 -DCOVERAGE=1 --coverage" CACHE STRING
-  "Flags used by the C compiler during \"Coverage\" builds."
-  FORCE
-)
-set(CMAKE_EXE_LINKER_FLAGS_COVERAGE "${CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO} --coverage" CACHE STRING
-  "Flags used for linking binaries during \"Coverage\" builds."
-  FORCE
-)
-set(CMAKE_SHARED_LINKER_FLAGS_COVERAGE "${CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO} --coverage" CACHE STRING
-  "Flags used by the shared libraries linker during \"Coverage\" builds."
-  FORCE
-)
-mark_as_advanced(
-  CMAKE_C_FLAGS_COVERAGE
-  CMAKE_EXE_LINKER_FLAGS_COVERAGE
-  CMAKE_SHARED_LINKER_FLAGS_COVERAGE
-)
-
-get_property(is_multi_config GLOBAL PROPERTY GENERATOR_IS_MULTI_CONFIG)
-set(default_build_type "RelWithDebInfo")
-if(is_multi_config)
-  set(CMAKE_CONFIGURATION_TYPES "${default_build_type}" "Release" "Debug" "MinSizeRel" "Coverage" CACHE STRING
-    "Supported configuration types."
-    FORCE
-  )
-else()
-  set_property(CACHE CMAKE_BUILD_TYPE PROPERTY
-    STRINGS "${default_build_type}" "Release" "Debug" "MinSizeRel" "Coverage"
-  )
-  if(NOT CMAKE_BUILD_TYPE)
-    message(STATUS "Setting build type to \"${default_build_type}\" as none was specified")
-    set(CMAKE_BUILD_TYPE "${default_build_type}" CACHE STRING
-      "Choose the type of build."
-      FORCE
-    )
-  endif()
-endif()
-
-include(TryAppendCFlags)
-if(MSVC)
-  # Keep the following commands ordered lexicographically.
-  try_append_c_flags(/W3) # Production quality warning level.
-  try_append_c_flags(/wd4146) # Disable warning C4146 "unary minus operator applied to unsigned type, result still unsigned".
-  try_append_c_flags(/wd4244) # Disable warning C4244 "'conversion' conversion from 'type1' to 'type2', possible loss of data".
-  try_append_c_flags(/wd4267) # Disable warning C4267 "'var' : conversion from 'size_t' to 'type', possible loss of data".
-  # Eliminate deprecation warnings for the older, less secure functions.
-  add_compile_definitions(_CRT_SECURE_NO_WARNINGS)
-else()
-  # Keep the following commands ordered lexicographically.
-  try_append_c_flags(-pedantic)
-  try_append_c_flags(-Wall) # GCC >= 2.95 and probably many other compilers.
-  try_append_c_flags(-Wcast-align) # GCC >= 2.95.
-  try_append_c_flags(-Wcast-align=strict) # GCC >= 8.0.
-  try_append_c_flags(-Wconditional-uninitialized) # Clang >= 3.0 only.
-  try_append_c_flags(-Wextra) # GCC >= 3.4, this is the newer name of -W, which we don't use because older GCCs will warn about unused functions.
-  try_append_c_flags(-Wnested-externs)
-  try_append_c_flags(-Wno-long-long) # GCC >= 3.0, -Wlong-long is implied by -pedantic.
-  try_append_c_flags(-Wno-overlength-strings) # GCC >= 4.2, -Woverlength-strings is implied by -pedantic.
-  try_append_c_flags(-Wno-unused-function) # GCC >= 3.0, -Wunused-function is implied by -Wall.
-  try_append_c_flags(-Wreserved-identifier) # Clang >= 13.0 only.
-  try_append_c_flags(-Wshadow)
-  try_append_c_flags(-Wstrict-prototypes)
-  try_append_c_flags(-Wundef)
-endif()
-
-set(CMAKE_C_VISIBILITY_PRESET hidden)
-
-# Ask CTest to create a "check" target (e.g., make check) as alias for the "test" target.
-# CTEST_TEST_TARGET_ALIAS is not documented but supposed to be user-facing.
-# See: https://gitlab.kitware.com/cmake/cmake/-/commit/816c9d1aa1f2b42d40c81a991b68c96eb12b6d2
-set(CTEST_TEST_TARGET_ALIAS check)
-include(CTest)
-# We do not use CTest's BUILD_TESTING because a single toggle for all tests is too coarse for our needs.
-mark_as_advanced(BUILD_TESTING)
-if(SECP256K1_BUILD_BENCHMARK OR SECP256K1_BUILD_TESTS OR SECP256K1_BUILD_EXHAUSTIVE_TESTS OR SECP256K1_BUILD_CTIME_TESTS OR SECP256K1_BUILD_EXAMPLES)
-  enable_testing()
-endif()
-
-set(SECP256K1_LATE_CFLAGS "" CACHE STRING "Compiler flags that are added to the command line after all other flags added by the build system.")
-include(AllTargetsCompileOptions)
-
-add_subdirectory(src)
-all_targets_compile_options(src "${SECP256K1_LATE_CFLAGS}")
-if(SECP256K1_BUILD_EXAMPLES)
-  add_subdirectory(examples)
-  all_targets_compile_options(examples "${SECP256K1_LATE_CFLAGS}")
-endif()
-
-message("\n")
-message("secp256k1 configure summary")
-message("===========================")
-message("Build artifacts:")
-if(BUILD_SHARED_LIBS)
-  set(library_type "Shared")
-else()
-  set(library_type "Static")
-endif()
-
-message("  library type ........................ ${library_type}")
-message("Optional modules:")
-message("  ECDH ................................ ${SECP256K1_ENABLE_MODULE_ECDH}")
-message("  ECDSA pubkey recovery ............... ${SECP256K1_ENABLE_MODULE_RECOVERY}")
-message("  extrakeys ........................... ${SECP256K1_ENABLE_MODULE_EXTRAKEYS}")
-message("  schnorrsig .......................... ${SECP256K1_ENABLE_MODULE_SCHNORRSIG}")
-message("  ElligatorSwift ...................... ${SECP256K1_ENABLE_MODULE_ELLSWIFT}")
-message("  generator ........................... ${SECP256K1_ENABLE_MODULE_GENERATOR}")
-message("  rangeproof .......................... ${SECP256K1_ENABLE_MODULE_RANGEPROOF}")
-message("  surjectionproof ..................... ${SECP256K1_ENABLE_MODULE_SURJECTIONPROOF}")
-message("  whitelist ........................... ${SECP256K1_ENABLE_MODULE_WHITELIST}")
-message("  musig ............................... ${SECP256K1_ENABLE_MODULE_MUSIG}")
-message("  ecdsa-s2c ........................... ${SECP256K1_ENABLE_MODULE_ECDSA_S2C}")
-message("  ecdsa-adaptor ....................... ${SECP256K1_ENABLE_MODULE_ECDSA_ADAPTOR}")
-message("  bppp ................................ ${SECP256K1_ENABLE_MODULE_BPPP}")
-message("Parameters:")
-message("  ecmult window size .................. ${SECP256K1_ECMULT_WINDOW_SIZE}")
-message("  ecmult gen precision bits ........... ${SECP256K1_ECMULT_GEN_PREC_BITS}")
-message("Optional features:")
-message("  assembly ............................ ${SECP256K1_ASM}")
-message("  external callbacks .................. ${SECP256K1_USE_EXTERNAL_DEFAULT_CALLBACKS}")
-if(SECP256K1_TEST_OVERRIDE_WIDE_MULTIPLY)
-  message("  wide multiplication (test-only) ..... ${SECP256K1_TEST_OVERRIDE_WIDE_MULTIPLY}")
-endif()
-message("Optional binaries:")
-message("  benchmark ........................... ${SECP256K1_BUILD_BENCHMARK}")
-message("  noverify_tests ...................... ${SECP256K1_BUILD_TESTS}")
-set(tests_status "${SECP256K1_BUILD_TESTS}")
-if(CMAKE_BUILD_TYPE STREQUAL "Coverage")
-  set(tests_status OFF)
-endif()
-message("  tests ............................... ${tests_status}")
-message("  exhaustive tests .................... ${SECP256K1_BUILD_EXHAUSTIVE_TESTS}")
-message("  ctime_tests ......................... ${SECP256K1_BUILD_CTIME_TESTS}")
-message("  examples ............................ ${SECP256K1_BUILD_EXAMPLES}")
-message("")
-if(CMAKE_CROSSCOMPILING)
-  set(cross_status "TRUE, for ${CMAKE_SYSTEM_NAME}, ${CMAKE_SYSTEM_PROCESSOR}")
-else()
-  set(cross_status "FALSE")
-endif()
-message("Cross compiling ....................... ${cross_status}")
-message("Valgrind .............................. ${SECP256K1_VALGRIND}")
-get_directory_property(definitions COMPILE_DEFINITIONS)
-string(REPLACE ";" " " definitions "${definitions}")
-message("Preprocessor defined macros ........... ${definitions}")
-message("C compiler ............................ ${CMAKE_C_COMPILER}")
-message("CFLAGS ................................ ${CMAKE_C_FLAGS}")
-get_directory_property(compile_options COMPILE_OPTIONS)
-string(REPLACE ";" " " compile_options "${compile_options}")
-message("Compile options ....................... " ${compile_options})
-if(NOT is_multi_config)
-  message("Build type:")
-  message(" - CMAKE_BUILD_TYPE ................... ${CMAKE_BUILD_TYPE}")
-  string(TOUPPER "${CMAKE_BUILD_TYPE}" build_type)
-  message(" - CFLAGS ............................. ${CMAKE_C_FLAGS_${build_type}}")
-  message(" - LDFLAGS for executables ............ ${CMAKE_EXE_LINKER_FLAGS_${build_type}}")
-  message(" - LDFLAGS for shared libraries ....... ${CMAKE_SHARED_LINKER_FLAGS_${build_type}}")
-else()
-  message("Supported configurations .............. ${CMAKE_CONFIGURATION_TYPES}")
-  message("RelWithDebInfo configuration:")
-  message(" - CFLAGS ............................. ${CMAKE_C_FLAGS_RELWITHDEBINFO}")
-  message(" - LDFLAGS for executables ............ ${CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO}")
-  message(" - LDFLAGS for shared libraries ....... ${CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO}")
-  message("Debug configuration:")
-  message(" - CFLAGS ............................. ${CMAKE_C_FLAGS_DEBUG}")
-  message(" - LDFLAGS for executables ............ ${CMAKE_EXE_LINKER_FLAGS_DEBUG}")
-  message(" - LDFLAGS for shared libraries ....... ${CMAKE_SHARED_LINKER_FLAGS_DEBUG}")
-endif()
-if(SECP256K1_LATE_CFLAGS)
-  message("SECP256K1_LATE_CFLAGS ................. ${SECP256K1_LATE_CFLAGS}")
-endif()
-message("\n")
-if(SECP256K1_EXPERIMENTAL)
-  message(
-    "  ******\n"
-    "  WARNING: experimental build\n"
-    "  Experimental features do not have stable APIs or properties, and may not be safe for production use.\n"
-    "  ******\n"
-  )
-endif()

CMakePresets.json

@@ -1,19 +0,0 @@
-{
-  "cmakeMinimumRequired": {"major": 3, "minor": 21, "patch": 0}, 
-  "version": 3,
-  "configurePresets": [
-    {
-      "name": "dev-mode",
-      "displayName": "Development mode (intended only for developers of the library)",
-      "cacheVariables": {
-        "SECP256K1_EXPERIMENTAL": "ON",
-        "SECP256K1_ENABLE_MODULE_RECOVERY": "ON",
-        "SECP256K1_BUILD_EXAMPLES": "ON"
-      },
-      "warnings": {
-        "dev": true,
-        "uninitialized": true
-      }
-    }
-  ]
-}

CONTRIBUTING.md

@@ -1,107 +0,0 @@
-# Contributing to libsecp256k1
-
-## Scope
-
-libsecp256k1 is a library for elliptic curve cryptography on the curve secp256k1, not a general-purpose cryptography library.
-The library primarily serves the needs of the Bitcoin Core project but provides additional functionality for the benefit of the wider Bitcoin ecosystem.
-
-## Adding new functionality or modules
-
-The libsecp256k1 project welcomes contributions in the form of new functionality or modules, provided they are within the project's scope.
-
-It is the responsibility of the contributors to convince the maintainers that the proposed functionality is within the project's scope, high-quality and maintainable.
-Contributors are recommended to provide the following in addition to the new code:
-
-* **Specification:**
-    A specification can help significantly in reviewing the new code as it provides documentation and context.
-    It may justify various design decisions, give a motivation and outline security goals.
-    If the specification contains pseudocode, a reference implementation or test vectors, these can be used to compare with the proposed libsecp256k1 code.
-* **Security Arguments:**
-    In addition to a defining the security goals, it should be argued that the new functionality meets these goals.
-    Depending on the nature of the new functionality, a wide range of security arguments are acceptable, ranging from being "obviously secure" to rigorous proofs of security.
-* **Relevance Arguments:**
-    The relevance of the new functionality for the Bitcoin ecosystem should be argued by outlining clear use cases.
-
-These are not the only factors taken into account when considering to add new functionality.
-The proposed new libsecp256k1 code must be of high quality, including API documentation and tests, as well as featuring a misuse-resistant API design.
-
-We recommend reaching out to other contributors (see [Communication Channels](#communication-channels)) and get feedback before implementing new functionality.
-
-## Communication channels
-
-Most communication about libsecp256k1 occurs on the GitHub repository: in issues, pull request or on the discussion board.
-
-Additionally, there is an IRC channel dedicated to libsecp256k1, with biweekly meetings (see channel topic).
-The channel is `#secp256k1` on Libera Chat.
-The easiest way to participate on IRC is with the web client, [web.libera.chat](https://web.libera.chat/#secp256k1).
-Chat history logs can be found at https://gnusha.org/secp256k1/.
-
-## Contributor workflow & peer review
-
-The Contributor Workflow & Peer Review in libsecp256k1 are similar to Bitcoin Core's workflow and review processes described in its [CONTRIBUTING.md](https://github.com/bitcoin/bitcoin/blob/master/CONTRIBUTING.md).
-
-### Coding conventions
-
-In addition, libsecp256k1 tries to maintain the following coding conventions:
-
-* No runtime heap allocation (e.g., no `malloc`) unless explicitly requested by the caller (via `secp256k1_context_create` or `secp256k1_scratch_space_create`, for example). Moreover, it should be possible to use the library without any heap allocations.
-* The tests should cover all lines and branches of the library (see [Test coverage](#coverage)).
-* Operations involving secret data should be tested for being constant time with respect to the secrets (see [src/ctime_tests.c](src/ctime_tests.c)).
-* Local variables containing secret data should be cleared explicitly to try to delete secrets from memory.
-* Use `secp256k1_memcmp_var` instead of `memcmp` (see [#823](https://github.com/bitcoin-core/secp256k1/issues/823)).
-
-#### Style conventions
-
-* Commits should be atomic and diffs should be easy to read. For this reason, do not mix any formatting fixes or code moves with actual code changes. Make sure each individual commit is hygienic: that it builds successfully on its own without warnings, errors, regressions, or test failures.
-* New code should adhere to the style of existing, in particular surrounding, code. Other than that, we do not enforce strict rules for code formatting.
-* The code conforms to C89. Most notably, that means that only `/* ... */` comments are allowed (no `//` line comments). Moreover, any declarations in a `{ ... }` block (e.g., a function) must appear at the beginning of the block before any statements. When you would like to declare a variable in the middle of a block, you can open a new block:
-    ```C
-    void secp256k_foo(void) {
-        unsigned int x;              /* declaration */
-        int y = 2*x;                 /* declaration */
-        x = 17;                      /* statement */
-        {
-            int a, b;                /* declaration */
-            a = x + y;               /* statement */
-            secp256k_bar(x, &b);     /* statement */
-        }
-    }
-    ```
-* Use `unsigned int` instead of just `unsigned`.
-* Use `void *ptr` instead of `void* ptr`.
-* Arguments of the publicly-facing API must have a specific order defined in [include/secp256k1.h](include/secp256k1.h).
-* User-facing comment lines in headers should be limited to 80 chars if possible.
-* All identifiers in file scope should start with `secp256k1_`.
-* Avoid trailing whitespace.
-
-### Tests
-
-#### Coverage
-
-This library aims to have full coverage of reachable lines and branches.
-
-To create a test coverage report, configure with `--enable-coverage` (use of GCC is necessary):
-
-    $ ./configure --enable-coverage
-
-Run the tests:
-
-    $ make check
-
-To create a report, `gcovr` is recommended, as it includes branch coverage reporting:
-
-    $ gcovr --exclude 'src/bench*' --print-summary
-
-To create a HTML report with coloured and annotated source code:
-
-    $ mkdir -p coverage
-    $ gcovr --exclude 'src/bench*' --html --html-details -o coverage/coverage.html
-
-#### Exhaustive tests
-
-There are tests of several functions in which a small group replaces secp256k1.
-These tests are *exhaustive* since they provide all elements and scalars of the small group as input arguments (see [src/tests_exhaustive.c](src/tests_exhaustive.c)).
-
-### Benchmarks
-
-See `src/bench*.c` for examples of benchmarks.

Makefile.am

@@ -1,12 +1,13 @@
 ACLOCAL_AMFLAGS = -I build-aux/m4
 
-# AM_CFLAGS will be automatically prepended to CFLAGS by Automake when compiling some foo
-# which does not have an explicit foo_CFLAGS variable set.
-AM_CFLAGS = $(SECP_CFLAGS)
-
 lib_LTLIBRARIES = libsecp256k1.la
+if USE_JNI
+JNI_LIB = libsecp256k1_jni.la
+noinst_LTLIBRARIES = $(JNI_LIB)
+else
+JNI_LIB =
+endif
 include_HEADERS = include/secp256k1.h
-include_HEADERS += include/secp256k1_preallocated.h
 noinst_HEADERS =
 noinst_HEADERS += src/scalar.h
 noinst_HEADERS += src/scalar_4x64.h
@@ -18,46 +19,29 @@ noinst_HEADERS += src/scalar_8x32_impl.h
 noinst_HEADERS += src/scalar_low_impl.h
 noinst_HEADERS += src/group.h
 noinst_HEADERS += src/group_impl.h
-noinst_HEADERS += src/eccommit.h
-noinst_HEADERS += src/eccommit_impl.h
+noinst_HEADERS += src/num_gmp.h
+noinst_HEADERS += src/num_gmp_impl.h
 noinst_HEADERS += src/ecdsa.h
 noinst_HEADERS += src/ecdsa_impl.h
 noinst_HEADERS += src/eckey.h
 noinst_HEADERS += src/eckey_impl.h
 noinst_HEADERS += src/ecmult.h
 noinst_HEADERS += src/ecmult_impl.h
-noinst_HEADERS += src/ecmult_compute_table.h
-noinst_HEADERS += src/ecmult_compute_table_impl.h
 noinst_HEADERS += src/ecmult_const.h
 noinst_HEADERS += src/ecmult_const_impl.h
 noinst_HEADERS += src/ecmult_gen.h
 noinst_HEADERS += src/ecmult_gen_impl.h
-noinst_HEADERS += src/ecmult_gen_compute_table.h
-noinst_HEADERS += src/ecmult_gen_compute_table_impl.h
+noinst_HEADERS += src/num.h
+noinst_HEADERS += src/num_impl.h
 noinst_HEADERS += src/field_10x26.h
 noinst_HEADERS += src/field_10x26_impl.h
 noinst_HEADERS += src/field_5x52.h
 noinst_HEADERS += src/field_5x52_impl.h
 noinst_HEADERS += src/field_5x52_int128_impl.h
-noinst_HEADERS += src/modinv32.h
-noinst_HEADERS += src/modinv32_impl.h
-noinst_HEADERS += src/modinv64.h
-noinst_HEADERS += src/modinv64_impl.h
-noinst_HEADERS += src/precomputed_ecmult.h
-noinst_HEADERS += src/precomputed_ecmult_gen.h
-noinst_HEADERS += src/assumptions.h
-noinst_HEADERS += src/checkmem.h
-noinst_HEADERS += src/testutil.h
+noinst_HEADERS += src/field_5x52_asm_impl.h
+noinst_HEADERS += src/java/org_bitcoin_NativeSecp256k1.h
+noinst_HEADERS += src/java/org_bitcoin_Secp256k1Context.h
 noinst_HEADERS += src/util.h
-noinst_HEADERS += src/int128.h
-noinst_HEADERS += src/int128_impl.h
-noinst_HEADERS += src/int128_native.h
-noinst_HEADERS += src/int128_native_impl.h
-noinst_HEADERS += src/int128_struct.h
-noinst_HEADERS += src/int128_struct_impl.h
-noinst_HEADERS += src/scratch.h
-noinst_HEADERS += src/scratch_impl.h
-noinst_HEADERS += src/selftest.h
 noinst_HEADERS += src/testrand.h
 noinst_HEADERS += src/testrand_impl.h
 noinst_HEADERS += src/hash.h
@@ -65,26 +49,17 @@ noinst_HEADERS += src/hash_impl.h
 noinst_HEADERS += src/field.h
 noinst_HEADERS += src/field_impl.h
 noinst_HEADERS += src/bench.h
-noinst_HEADERS += src/wycheproof/ecdsa_secp256k1_sha256_bitcoin_test.h
 noinst_HEADERS += contrib/lax_der_parsing.h
 noinst_HEADERS += contrib/lax_der_parsing.c
 noinst_HEADERS += contrib/lax_der_privatekey_parsing.h
 noinst_HEADERS += contrib/lax_der_privatekey_parsing.c
-noinst_HEADERS += examples/examples_util.h
-
-PRECOMPUTED_LIB = libsecp256k1_precomputed.la
-noinst_LTLIBRARIES = $(PRECOMPUTED_LIB)
-libsecp256k1_precomputed_la_SOURCES =  src/precomputed_ecmult.c src/precomputed_ecmult_gen.c
-# We need `-I$(top_srcdir)/src` in VPATH builds if libsecp256k1_precomputed_la_SOURCES have been recreated in the build tree.
-# This helps users and packagers who insist on recreating the precomputed files (e.g., Gentoo).
-libsecp256k1_precomputed_la_CPPFLAGS = -I$(top_srcdir)/src $(SECP_CONFIG_DEFINES)
 
 if USE_EXTERNAL_ASM
 COMMON_LIB = libsecp256k1_common.la
+noinst_LTLIBRARIES = $(COMMON_LIB)
 else
 COMMON_LIB =
 endif
-noinst_LTLIBRARIES += $(COMMON_LIB)
 
 pkgconfigdir = $(libdir)/pkgconfig
 pkgconfig_DATA = libsecp256k1.pc
@@ -96,202 +71,107 @@ endif
 endif
 
 libsecp256k1_la_SOURCES = src/secp256k1.c
-libsecp256k1_la_CPPFLAGS = $(SECP_CONFIG_DEFINES)
-libsecp256k1_la_LIBADD = $(COMMON_LIB) $(PRECOMPUTED_LIB)
-libsecp256k1_la_LDFLAGS = -no-undefined -version-info $(LIB_VERSION_CURRENT):$(LIB_VERSION_REVISION):$(LIB_VERSION_AGE)
+libsecp256k1_la_CPPFLAGS = -DSECP256K1_BUILD -I$(top_srcdir)/include -I$(top_srcdir)/src $(SECP_INCLUDES)
+libsecp256k1_la_LIBADD = $(JNI_LIB) $(SECP_LIBS) $(COMMON_LIB)
+
+libsecp256k1_jni_la_SOURCES  = src/java/org_bitcoin_NativeSecp256k1.c src/java/org_bitcoin_Secp256k1Context.c
+libsecp256k1_jni_la_CPPFLAGS = -DSECP256K1_BUILD $(JNI_INCLUDES)
 
 noinst_PROGRAMS =
 if USE_BENCHMARK
-noinst_PROGRAMS += bench bench_internal bench_ecmult
-bench_SOURCES = src/bench.c
-bench_LDADD = libsecp256k1.la
-bench_CPPFLAGS = $(SECP_CONFIG_DEFINES)
+noinst_PROGRAMS += bench_verify bench_sign bench_internal
+bench_verify_SOURCES = src/bench_verify.c
+bench_verify_LDADD = libsecp256k1.la $(SECP_LIBS) $(SECP_TEST_LIBS) $(COMMON_LIB)
+bench_sign_SOURCES = src/bench_sign.c
+bench_sign_LDADD = libsecp256k1.la $(SECP_LIBS) $(SECP_TEST_LIBS) $(COMMON_LIB)
 bench_internal_SOURCES = src/bench_internal.c
-bench_internal_LDADD = $(COMMON_LIB) $(PRECOMPUTED_LIB)
-bench_internal_CPPFLAGS = $(SECP_CONFIG_DEFINES)
-bench_ecmult_SOURCES = src/bench_ecmult.c
-bench_ecmult_LDADD = $(COMMON_LIB) $(PRECOMPUTED_LIB)
-bench_ecmult_CPPFLAGS = $(SECP_CONFIG_DEFINES)
+bench_internal_LDADD = $(SECP_LIBS) $(COMMON_LIB)
+bench_internal_CPPFLAGS = -DSECP256K1_BUILD $(SECP_INCLUDES)
 endif
 
 TESTS =
 if USE_TESTS
-TESTS += noverify_tests
-noinst_PROGRAMS += noverify_tests
-noverify_tests_SOURCES = src/tests.c
-noverify_tests_CPPFLAGS = $(SECP_CONFIG_DEFINES)
-noverify_tests_LDADD = $(COMMON_LIB) $(PRECOMPUTED_LIB)
-noverify_tests_LDFLAGS = -static
-if !ENABLE_COVERAGE
-TESTS += tests
 noinst_PROGRAMS += tests
-tests_SOURCES  = $(noverify_tests_SOURCES)
-tests_CPPFLAGS = $(noverify_tests_CPPFLAGS) -DVERIFY
-tests_LDADD    = $(noverify_tests_LDADD)
-tests_LDFLAGS  = $(noverify_tests_LDFLAGS)
+tests_SOURCES = src/tests.c
+tests_CPPFLAGS = -DSECP256K1_BUILD -I$(top_srcdir)/src -I$(top_srcdir)/include $(SECP_INCLUDES) $(SECP_TEST_INCLUDES)
+if !ENABLE_COVERAGE
+tests_CPPFLAGS += -DVERIFY
 endif
-endif
-
-if USE_CTIME_TESTS
-noinst_PROGRAMS += ctime_tests
-ctime_tests_SOURCES = src/ctime_tests.c
-ctime_tests_LDADD = libsecp256k1.la
-ctime_tests_CPPFLAGS = $(SECP_CONFIG_DEFINES)
+tests_LDADD = $(SECP_LIBS) $(SECP_TEST_LIBS) $(COMMON_LIB)
+tests_LDFLAGS = -static
+TESTS += tests
 endif
 
 if USE_EXHAUSTIVE_TESTS
 noinst_PROGRAMS += exhaustive_tests
 exhaustive_tests_SOURCES = src/tests_exhaustive.c
-exhaustive_tests_CPPFLAGS = $(SECP_CONFIG_DEFINES)
+exhaustive_tests_CPPFLAGS = -DSECP256K1_BUILD -I$(top_srcdir)/src $(SECP_INCLUDES)
 if !ENABLE_COVERAGE
 exhaustive_tests_CPPFLAGS += -DVERIFY
 endif
-# Note: do not include $(PRECOMPUTED_LIB) in exhaustive_tests (it uses runtime-generated tables).
-exhaustive_tests_LDADD = $(COMMON_LIB)
+exhaustive_tests_LDADD = $(SECP_LIBS)
 exhaustive_tests_LDFLAGS = -static
 TESTS += exhaustive_tests
 endif
 
-if USE_EXAMPLES
-noinst_PROGRAMS += ecdsa_example
-ecdsa_example_SOURCES = examples/ecdsa.c
-ecdsa_example_CPPFLAGS = -I$(top_srcdir)/include -DSECP256K1_STATIC
-ecdsa_example_LDADD = libsecp256k1.la
-ecdsa_example_LDFLAGS = -static
-if BUILD_WINDOWS
-ecdsa_example_LDFLAGS += -lbcrypt
-endif
-TESTS += ecdsa_example
-if ENABLE_MODULE_ECDH
-noinst_PROGRAMS += ecdh_example
-ecdh_example_SOURCES = examples/ecdh.c
-ecdh_example_CPPFLAGS = -I$(top_srcdir)/include -DSECP256K1_STATIC
-ecdh_example_LDADD = libsecp256k1.la
-ecdh_example_LDFLAGS = -static
-if BUILD_WINDOWS
-ecdh_example_LDFLAGS += -lbcrypt
-endif
-TESTS += ecdh_example
-endif
-if ENABLE_MODULE_SCHNORRSIG
-noinst_PROGRAMS += schnorr_example
-schnorr_example_SOURCES = examples/schnorr.c
-schnorr_example_CPPFLAGS = -I$(top_srcdir)/include -DSECP256K1_STATIC
-schnorr_example_LDADD = libsecp256k1.la
-schnorr_example_LDFLAGS = -static
-if BUILD_WINDOWS
-schnorr_example_LDFLAGS += -lbcrypt
-endif
-TESTS += schnorr_example
-endif
-if ENABLE_MODULE_MUSIG
-noinst_PROGRAMS += musig_example
-musig_example_SOURCES = examples/musig.c
-musig_example_CPPFLAGS = -I$(top_srcdir)/include -DSECP256K1_STATIC
-musig_example_LDADD = libsecp256k1.la
-musig_example_LDFLAGS = -static
-if BUILD_WINDOWS
-musig_example_LDFLAGS += -lbcrypt
-endif
-TESTS += musig_example
-endif
-if ENABLE_MODULE_FROST
-noinst_PROGRAMS += frost_example
-frost_example_SOURCES = examples/frost.c
-frost_example_CPPFLAGS = -I$(top_srcdir)/include -DSECP256K1_STATIC
-frost_example_LDADD = libsecp256k1.la
-frost_example_LDFLAGS = -static
-if BUILD_WINDOWS
-frost_example_LDFLAGS += -lbcrypt
-endif
-TESTS += frost_example
+JAVAROOT=src/java
+JAVAORG=org/bitcoin
+JAVA_GUAVA=$(srcdir)/$(JAVAROOT)/guava/guava-18.0.jar
+CLASSPATH_ENV=CLASSPATH=$(JAVA_GUAVA)
+JAVA_FILES= \
+  $(JAVAROOT)/$(JAVAORG)/NativeSecp256k1.java \
+  $(JAVAROOT)/$(JAVAORG)/NativeSecp256k1Test.java \
+  $(JAVAROOT)/$(JAVAORG)/NativeSecp256k1Util.java \
+  $(JAVAROOT)/$(JAVAORG)/Secp256k1Context.java
+
+if USE_JNI
+
+$(JAVA_GUAVA):
+	@echo Guava is missing. Fetch it via: \
+	wget https://search.maven.org/remotecontent?filepath=com/google/guava/guava/18.0/guava-18.0.jar -O $(@)
+	@false
+
+.stamp-java: $(JAVA_FILES)
+	@echo   Compiling $^
+	$(AM_V_at)$(CLASSPATH_ENV) javac $^
+	@touch $@
+
+if USE_TESTS
+
+check-java: libsecp256k1.la $(JAVA_GUAVA) .stamp-java
+	$(AM_V_at)java -Djava.library.path="./:./src:./src/.libs:.libs/" -cp "$(JAVA_GUAVA):$(JAVAROOT)" $(JAVAORG)/NativeSecp256k1Test
+
 endif
 endif
 
-### Precomputed tables
-EXTRA_PROGRAMS = precompute_ecmult precompute_ecmult_gen
-CLEANFILES = $(EXTRA_PROGRAMS)
+if USE_ECMULT_STATIC_PRECOMPUTATION
+CPPFLAGS_FOR_BUILD +=-I$(top_srcdir)
+CFLAGS_FOR_BUILD += -Wall -Wextra -Wno-unused-function
 
-precompute_ecmult_SOURCES = src/precompute_ecmult.c
-precompute_ecmult_CPPFLAGS = $(SECP_CONFIG_DEFINES) -DVERIFY
-precompute_ecmult_LDADD = $(COMMON_LIB)
+gen_context_OBJECTS = gen_context.o
+gen_context_BIN = gen_context$(BUILD_EXEEXT)
+gen_%.o: src/gen_%.c
+	$(CC_FOR_BUILD) $(CPPFLAGS_FOR_BUILD) $(CFLAGS_FOR_BUILD) -c $< -o $@
 
-precompute_ecmult_gen_SOURCES = src/precompute_ecmult_gen.c
-precompute_ecmult_gen_CPPFLAGS = $(SECP_CONFIG_DEFINES) -DVERIFY
-precompute_ecmult_gen_LDADD = $(COMMON_LIB)
+$(gen_context_BIN): $(gen_context_OBJECTS)
+	$(CC_FOR_BUILD) $^ -o $@
 
-# See Automake manual, Section "Errors with distclean".
-# We don't list any dependencies for the prebuilt files here because
-# otherwise make's decision whether to rebuild them (even in the first
-# build by a normal user) depends on mtimes, and thus is very fragile.
-# This means that rebuilds of the prebuilt files always need to be
-# forced by deleting them.
-src/precomputed_ecmult.c:
-	$(MAKE) $(AM_MAKEFLAGS) precompute_ecmult$(EXEEXT)
-	./precompute_ecmult$(EXEEXT)
-src/precomputed_ecmult_gen.c:
-	$(MAKE) $(AM_MAKEFLAGS) precompute_ecmult_gen$(EXEEXT)
-	./precompute_ecmult_gen$(EXEEXT)
+$(libsecp256k1_la_OBJECTS): src/ecmult_static_context.h
+$(tests_OBJECTS): src/ecmult_static_context.h
+$(bench_internal_OBJECTS): src/ecmult_static_context.h
 
-PRECOMP = src/precomputed_ecmult_gen.c src/precomputed_ecmult.c
-precomp: $(PRECOMP)
+src/ecmult_static_context.h: $(gen_context_BIN)
+	./$(gen_context_BIN)
 
-# Ensure the prebuilt files will be build first (only if they don't exist,
-# e.g., after `make maintainer-clean`).
-BUILT_SOURCES = $(PRECOMP)
-
-.PHONY: clean-precomp
-clean-precomp:
-	rm -f $(PRECOMP)
-maintainer-clean-local: clean-precomp
-
-### Pregenerated test vectors
-### (see the comments in the previous section for detailed rationale)
-TESTVECTORS = src/wycheproof/ecdsa_secp256k1_sha256_bitcoin_test.h
-
-src/wycheproof/ecdsa_secp256k1_sha256_bitcoin_test.h:
-	mkdir -p $(@D)
-	python3 $(top_srcdir)/tools/tests_wycheproof_generate.py $(top_srcdir)/src/wycheproof/ecdsa_secp256k1_sha256_bitcoin_test.json > $@
-
-testvectors: $(TESTVECTORS)
-
-BUILT_SOURCES += $(TESTVECTORS)
-
-.PHONY: clean-testvectors
-clean-testvectors:
-	rm -f $(TESTVECTORS)
-maintainer-clean-local: clean-testvectors
-
-### Additional files to distribute
-EXTRA_DIST = autogen.sh CHANGELOG.md SECURITY.md
-EXTRA_DIST += doc/release-process.md doc/safegcd_implementation.md
-EXTRA_DIST += examples/EXAMPLES_COPYING
-EXTRA_DIST += sage/gen_exhaustive_groups.sage
-EXTRA_DIST += sage/gen_split_lambda_constants.sage
-EXTRA_DIST += sage/group_prover.sage
-EXTRA_DIST += sage/prove_group_implementations.sage
-EXTRA_DIST += sage/secp256k1_params.sage
-EXTRA_DIST += sage/weierstrass_prover.sage
-EXTRA_DIST += src/wycheproof/WYCHEPROOF_COPYING
-EXTRA_DIST += src/wycheproof/ecdsa_secp256k1_sha256_bitcoin_test.json
-EXTRA_DIST += tools/tests_wycheproof_generate.py
-
-if ENABLE_MODULE_SCHNORRSIG_HALFAGG
-include src/modules/schnorrsig_halfagg/Makefile.am.include
+CLEANFILES = $(gen_context_BIN) src/ecmult_static_context.h $(JAVAROOT)/$(JAVAORG)/*.class .stamp-java
 endif
 
-if ENABLE_MODULE_BPPP
-include src/modules/bppp/Makefile.am.include
-endif
+EXTRA_DIST = autogen.sh src/gen_context.c src/basic-config.h $(JAVA_FILES)
 
 if ENABLE_MODULE_ECDH
 include src/modules/ecdh/Makefile.am.include
 endif
 
-if ENABLE_MODULE_MUSIG
-include src/modules/musig/Makefile.am.include
-endif
-
 if ENABLE_MODULE_RECOVERY
 include src/modules/recovery/Makefile.am.include
 endif
@@ -311,27 +191,3 @@ endif
 if ENABLE_MODULE_SURJECTIONPROOF
 include src/modules/surjection/Makefile.am.include
 endif
-
-if ENABLE_MODULE_EXTRAKEYS
-include src/modules/extrakeys/Makefile.am.include
-endif
-
-if ENABLE_MODULE_SCHNORRSIG
-include src/modules/schnorrsig/Makefile.am.include
-endif
-
-if ENABLE_MODULE_ELLSWIFT
-include src/modules/ellswift/Makefile.am.include
-endif
-
-if ENABLE_MODULE_ECDSA_S2C
-include src/modules/ecdsa_s2c/Makefile.am.include
-endif
-
-if ENABLE_MODULE_ECDSA_ADAPTOR
-include src/modules/ecdsa_adaptor/Makefile.am.include
-endif
-
-if ENABLE_MODULE_FROST
-include src/modules/frost/Makefile.am.include
-endif

README.md

@@ -1,101 +1,61 @@
-libsecp256k1-zkp
-================
+libsecp256k1
+============
 
-![Dependencies: None](https://img.shields.io/badge/dependencies-none-success)
+[![Build Status](https://travis-ci.org/bitcoin-core/secp256k1.svg?branch=master)](https://travis-ci.org/bitcoin-core/secp256k1)
 
-A fork of [libsecp256k1](https://github.com/bitcoin-core/secp256k1) with support for advanced and experimental features such as Confidential Assets, MuSig2, and FROST. 
+Optimized C library for EC operations on curve secp256k1.
 
-Added features:
-* Experimental module for ECDSA adaptor signatures.
-* Experimental module for ECDSA sign-to-contract.
-* Experimental module for [MuSig2](src/modules/musig/musig.md).
-* Experimental module for Confidential Assets (Pedersen commitments, range proofs, and [surjection proofs](src/modules/surjection/surjection.md)).
-* Experimental module for Bulletproofs++ range proofs.
-* Experimental module for [address whitelisting](src/modules/whitelist/whitelist.md).
-* Experimental module for [FROST](src/modules/frost/frost.md).
+This library is a work in progress and is being used to research best practices. Use at your own risk.
 
-Experimental features are made available for testing and review by the community. The APIs of these features should not be considered stable.
+Features:
+* secp256k1 ECDSA signing/verification and key generation.
+* Adding/multiplying private/public keys.
+* Serialization/parsing of private keys, public keys, signatures.
+* Constant time, constant memory access signing and pubkey generation.
+* Derandomized DSA (via RFC6979 or with a caller provided function.)
+* Very efficient implementation.
+
+Implementation details
+----------------------
+
+* General
+  * No runtime heap allocation.
+  * Extensive testing infrastructure.
+  * Structured to facilitate review and analysis.
+  * Intended to be portable to any system with a C89 compiler and uint64_t support.
+  * Expose only higher level interfaces to minimize the API surface and improve application security. ("Be difficult to use insecurely.")
+* Field operations
+  * Optimized implementation of arithmetic modulo the curve's field size (2^256 - 0x1000003D1).
+    * Using 5 52-bit limbs (including hand-optimized assembly for x86_64, by Diederik Huys).
+    * Using 10 26-bit limbs.
+  * Field inverses and square roots using a sliding window over blocks of 1s (by Peter Dettman).
+* Scalar operations
+  * Optimized implementation without data-dependent branches of arithmetic modulo the curve's order.
+    * Using 4 64-bit limbs (relying on __int128 support in the compiler).
+    * Using 8 32-bit limbs.
+* Group operations
+  * Point addition formula specifically simplified for the curve equation (y^2 = x^3 + 7).
+  * Use addition between points in Jacobian and affine coordinates where possible.
+  * Use a unified addition/doubling formula where necessary to avoid data-dependent branches.
+  * Point/x comparison without a field inversion by comparison in the Jacobian coordinate space.
+* Point multiplication for verification (a*P + b*G).
+  * Use wNAF notation for point multiplicands.
+  * Use a much larger window for multiples of G, using precomputed multiples.
+  * Use Shamir's trick to do the multiplication with the public key and the generator simultaneously.
+  * Optionally (off by default) use secp256k1's efficiently-computable endomorphism to split the P multiplicand into 2 half-sized ones.
+* Point multiplication for signing
+  * Use a precomputed table of multiples of powers of 16 multiplied with the generator, so general multiplication becomes a series of additions.
+  * Access the table with branch-free conditional moves so memory access is uniform.
+  * No data-dependent branches
+  * The precomputed tables add and eventually subtract points for which no known scalar (private key) is known, preventing even an attacker with control over the private key used to control the data internally.
 
 Build steps
 -----------
 
-Building with Autotools
------------------------
+libsecp256k1 is built using autotools:
 
     $ ./autogen.sh
     $ ./configure
     $ make
-    $ make check  # run the test suite
+    $ ./tests
     $ sudo make install  # optional
-
-To compile optional modules (such as Schnorr signatures), you need to run `./configure` with additional flags (such as `--enable-module-schnorrsig`). Run `./configure --help` to see the full list of available flags. For experimental modules, you will also need `--enable-experimental` as well as a flag for each individual module, e.g. `--enable-module-musig`.
-
-Building with CMake (experimental)
-----------------------------------
-
-To maintain a pristine source tree, CMake encourages to perform an out-of-source build by using a separate dedicated build tree.
-
-### Building on POSIX systems
-
-    $ mkdir build && cd build
-    $ cmake ..
-    $ cmake --build .
-    $ ctest  # run the test suite
-    $ sudo cmake --build . --target install  # optional
-
-To compile optional modules (such as Schnorr signatures), you need to run `cmake` with additional flags (such as `-DSECP256K1_ENABLE_MODULE_SCHNORRSIG=ON`). Run `cmake .. -LH` to see the full list of available flags.
-
-### Cross compiling
-
-To alleviate issues with cross compiling, preconfigured toolchain files are available in the `cmake` directory.
-For example, to cross compile for Windows:
-
-    $ cmake .. -DCMAKE_TOOLCHAIN_FILE=../cmake/x86_64-w64-mingw32.toolchain.cmake
-
-To cross compile for Android with [NDK](https://developer.android.com/ndk/guides/cmake) (using NDK's toolchain file, and assuming the `ANDROID_NDK_ROOT` environment variable has been set):
-
-    $ cmake .. -DCMAKE_TOOLCHAIN_FILE="${ANDROID_NDK_ROOT}/build/cmake/android.toolchain.cmake" -DANDROID_ABI=arm64-v8a -DANDROID_PLATFORM=28
-
-### Building on Windows
-
-To build on Windows with Visual Studio, a proper [generator](https://cmake.org/cmake/help/latest/manual/cmake-generators.7.html#visual-studio-generators) must be specified for a new build tree.
-
-The following example assumes using of Visual Studio 2022 and CMake v3.21+.
-
-In "Developer Command Prompt for VS 2022":
-
-    >cmake -G "Visual Studio 17 2022" -A x64 -S . -B build
-    >cmake --build build --config RelWithDebInfo
-
-Usage examples
------------
-
-Usage examples can be found in the [examples](examples) directory. To compile them you need to configure with `--enable-examples`.
-  * [ECDSA example](examples/ecdsa.c)
-  * [Schnorr signatures example](examples/schnorr.c)
-  * [Deriving a shared secret (ECDH) example](examples/ecdh.c)
-  * [MuSig example](examples/musig.c)
-
-To compile the Schnorr signature, ECDH and MuSig examples, you need to enable the corresponding module by providing a flag to the `configure` script, for example `--enable-module-schnorrsig`.
-
-Benchmark
-------------
-If configured with `--enable-benchmark` (which is the default), binaries for benchmarking the libsecp256k1-zkp functions will be present in the root directory after the build.
-
-To print the benchmark result to the command line:
-
-    $ ./bench_name
-
-To create a CSV file for the benchmark result :
-
-    $ ./bench_name | sed '2d;s/ \{1,\}//g' > bench_name.csv
-
-Reporting a vulnerability
-------------
-
-See [SECURITY.md](SECURITY.md)
-
-Contributing to libsecp256k1
-------------
-
-See [CONTRIBUTING.md](CONTRIBUTING.md)

SECURITY.md

@@ -1,15 +0,0 @@
-# Security Policy
-
-## Reporting a Vulnerability
-
-To report security issues send an email to secp256k1-security@bitcoincore.org (not for support).
-
-The following keys may be used to communicate sensitive information to developers:
-
-| Name | Fingerprint |
-|------|-------------|
-| Pieter Wuille | 133E AC17 9436 F14A 5CF1  B794 860F EB80 4E66 9320 |
-| Jonas Nick | 36C7 1A37 C9D9 88BD E825  08D9 B1A7 0E4F 8DCD 0366 |
-| Tim Ruffing | 09E0 3F87 1092 E40E 106E  902B 33BC 86AB 80FF 5516 |
-
-You can import a key by running the following command with that individual’s fingerprint: `gpg --keyserver hkps://keys.openpgp.org --recv-keys "<fingerprint>"` Ensure that you put quotes around fingerprints containing spaces.

TODO

@@ -0,0 +1,3 @@
+* Unit tests for fieldelem/groupelem, including ones intended to
+  trigger fieldelem's boundary cases.
+* Complete constant-time operations for signing/keygen

build-aux/m4/ax_jni_include_dir.m4

@@ -0,0 +1,140 @@
+# ===========================================================================
+#    http://www.gnu.org/software/autoconf-archive/ax_jni_include_dir.html
+# ===========================================================================
+#
+# SYNOPSIS
+#
+#   AX_JNI_INCLUDE_DIR
+#
+# DESCRIPTION
+#
+#   AX_JNI_INCLUDE_DIR finds include directories needed for compiling
+#   programs using the JNI interface.
+#
+#   JNI include directories are usually in the Java distribution. This is
+#   deduced from the value of $JAVA_HOME, $JAVAC, or the path to "javac", in
+#   that order. When this macro completes, a list of directories is left in
+#   the variable JNI_INCLUDE_DIRS.
+#
+#   Example usage follows:
+#
+#     AX_JNI_INCLUDE_DIR
+#
+#     for JNI_INCLUDE_DIR in $JNI_INCLUDE_DIRS
+#     do
+#             CPPFLAGS="$CPPFLAGS -I$JNI_INCLUDE_DIR"
+#     done
+#
+#   If you want to force a specific compiler:
+#
+#   - at the configure.in level, set JAVAC=yourcompiler before calling
+#   AX_JNI_INCLUDE_DIR
+#
+#   - at the configure level, setenv JAVAC
+#
+#   Note: This macro can work with the autoconf M4 macros for Java programs.
+#   This particular macro is not part of the original set of macros.
+#
+# LICENSE
+#
+#   Copyright (c) 2008 Don Anderson <dda@sleepycat.com>
+#
+#   Copying and distribution of this file, with or without modification, are
+#   permitted in any medium without royalty provided the copyright notice
+#   and this notice are preserved. This file is offered as-is, without any
+#   warranty.
+
+#serial 10
+
+AU_ALIAS([AC_JNI_INCLUDE_DIR], [AX_JNI_INCLUDE_DIR])
+AC_DEFUN([AX_JNI_INCLUDE_DIR],[
+
+JNI_INCLUDE_DIRS=""
+
+if test "x$JAVA_HOME" != x; then
+	_JTOPDIR="$JAVA_HOME"
+else
+	if test "x$JAVAC" = x; then
+		JAVAC=javac
+	fi
+	AC_PATH_PROG([_ACJNI_JAVAC], [$JAVAC], [no])
+	if test "x$_ACJNI_JAVAC" = xno; then
+		AC_MSG_WARN([cannot find JDK; try setting \$JAVAC or \$JAVA_HOME])
+	fi
+	_ACJNI_FOLLOW_SYMLINKS("$_ACJNI_JAVAC")
+	_JTOPDIR=`echo "$_ACJNI_FOLLOWED" | sed -e 's://*:/:g' -e 's:/[[^/]]*$::'`
+fi
+
+case "$host_os" in
+        darwin*)        _JTOPDIR=`echo "$_JTOPDIR" | sed -e 's:/[[^/]]*$::'`
+                        _JINC="$_JTOPDIR/Headers";;
+        *)              _JINC="$_JTOPDIR/include";;
+esac
+_AS_ECHO_LOG([_JTOPDIR=$_JTOPDIR])
+_AS_ECHO_LOG([_JINC=$_JINC])
+
+# On Mac OS X 10.6.4, jni.h is a symlink:
+# /System/Library/Frameworks/JavaVM.framework/Versions/Current/Headers/jni.h
+# -> ../../CurrentJDK/Headers/jni.h.
+
+AC_CACHE_CHECK(jni headers, ac_cv_jni_header_path,
+[
+if test -f "$_JINC/jni.h"; then
+  ac_cv_jni_header_path="$_JINC"
+  JNI_INCLUDE_DIRS="$JNI_INCLUDE_DIRS $ac_cv_jni_header_path"
+else
+  _JTOPDIR=`echo "$_JTOPDIR" | sed -e 's:/[[^/]]*$::'`
+  if test -f "$_JTOPDIR/include/jni.h"; then
+    ac_cv_jni_header_path="$_JTOPDIR/include"
+    JNI_INCLUDE_DIRS="$JNI_INCLUDE_DIRS $ac_cv_jni_header_path"
+  else
+    ac_cv_jni_header_path=none
+  fi
+fi
+])
+
+
+
+# get the likely subdirectories for system specific java includes
+case "$host_os" in
+bsdi*)          _JNI_INC_SUBDIRS="bsdos";;
+darwin*)        _JNI_INC_SUBDIRS="darwin";;
+freebsd*)       _JNI_INC_SUBDIRS="freebsd";;
+linux*)         _JNI_INC_SUBDIRS="linux genunix";;
+osf*)           _JNI_INC_SUBDIRS="alpha";;
+solaris*)       _JNI_INC_SUBDIRS="solaris";;
+mingw*)		_JNI_INC_SUBDIRS="win32";;
+cygwin*)	_JNI_INC_SUBDIRS="win32";;
+*)              _JNI_INC_SUBDIRS="genunix";;
+esac
+
+if test "x$ac_cv_jni_header_path" != "xnone"; then
+  # add any subdirectories that are present
+  for JINCSUBDIR in $_JNI_INC_SUBDIRS
+  do
+      if test -d "$_JTOPDIR/include/$JINCSUBDIR"; then
+           JNI_INCLUDE_DIRS="$JNI_INCLUDE_DIRS $_JTOPDIR/include/$JINCSUBDIR"
+      fi
+  done
+fi
+])
+
+# _ACJNI_FOLLOW_SYMLINKS <path>
+# Follows symbolic links on <path>,
+# finally setting variable _ACJNI_FOLLOWED
+# ----------------------------------------
+AC_DEFUN([_ACJNI_FOLLOW_SYMLINKS],[
+# find the include directory relative to the javac executable
+_cur="$1"
+while ls -ld "$_cur" 2>/dev/null | grep " -> " >/dev/null; do
+        AC_MSG_CHECKING([symlink for $_cur])
+        _slink=`ls -ld "$_cur" | sed 's/.* -> //'`
+        case "$_slink" in
+        /*) _cur="$_slink";;
+        # 'X' avoids triggering unwanted echo options.
+        *) _cur=`echo "X$_cur" | sed -e 's/^X//' -e 's:[[^/]]*$::'`"$_slink";;
+        esac
+        AC_MSG_RESULT([$_cur])
+done
+_ACJNI_FOLLOWED="$_cur"
+])# _ACJNI

build-aux/m4/ax_prog_cc_for_build.m4

@@ -0,0 +1,125 @@
+# ===========================================================================
+#   http://www.gnu.org/software/autoconf-archive/ax_prog_cc_for_build.html
+# ===========================================================================
+#
+# SYNOPSIS
+#
+#   AX_PROG_CC_FOR_BUILD
+#
+# DESCRIPTION
+#
+#   This macro searches for a C compiler that generates native executables,
+#   that is a C compiler that surely is not a cross-compiler. This can be
+#   useful if you have to generate source code at compile-time like for
+#   example GCC does.
+#
+#   The macro sets the CC_FOR_BUILD and CPP_FOR_BUILD macros to anything
+#   needed to compile or link (CC_FOR_BUILD) and preprocess (CPP_FOR_BUILD).
+#   The value of these variables can be overridden by the user by specifying
+#   a compiler with an environment variable (like you do for standard CC).
+#
+#   It also sets BUILD_EXEEXT and BUILD_OBJEXT to the executable and object
+#   file extensions for the build platform, and GCC_FOR_BUILD to `yes' if
+#   the compiler we found is GCC. All these variables but GCC_FOR_BUILD are
+#   substituted in the Makefile.
+#
+# LICENSE
+#
+#   Copyright (c) 2008 Paolo Bonzini <bonzini@gnu.org>
+#
+#   Copying and distribution of this file, with or without modification, are
+#   permitted in any medium without royalty provided the copyright notice
+#   and this notice are preserved. This file is offered as-is, without any
+#   warranty.
+
+#serial 8
+
+AU_ALIAS([AC_PROG_CC_FOR_BUILD], [AX_PROG_CC_FOR_BUILD])
+AC_DEFUN([AX_PROG_CC_FOR_BUILD], [dnl
+AC_REQUIRE([AC_PROG_CC])dnl
+AC_REQUIRE([AC_PROG_CPP])dnl
+AC_REQUIRE([AC_EXEEXT])dnl
+AC_REQUIRE([AC_CANONICAL_HOST])dnl
+
+dnl Use the standard macros, but make them use other variable names
+dnl
+pushdef([ac_cv_prog_CPP], ac_cv_build_prog_CPP)dnl
+pushdef([ac_cv_prog_gcc], ac_cv_build_prog_gcc)dnl
+pushdef([ac_cv_prog_cc_works], ac_cv_build_prog_cc_works)dnl
+pushdef([ac_cv_prog_cc_cross], ac_cv_build_prog_cc_cross)dnl
+pushdef([ac_cv_prog_cc_g], ac_cv_build_prog_cc_g)dnl
+pushdef([ac_cv_exeext], ac_cv_build_exeext)dnl
+pushdef([ac_cv_objext], ac_cv_build_objext)dnl
+pushdef([ac_exeext], ac_build_exeext)dnl
+pushdef([ac_objext], ac_build_objext)dnl
+pushdef([CC], CC_FOR_BUILD)dnl
+pushdef([CPP], CPP_FOR_BUILD)dnl
+pushdef([CFLAGS], CFLAGS_FOR_BUILD)dnl
+pushdef([CPPFLAGS], CPPFLAGS_FOR_BUILD)dnl
+pushdef([LDFLAGS], LDFLAGS_FOR_BUILD)dnl
+pushdef([host], build)dnl
+pushdef([host_alias], build_alias)dnl
+pushdef([host_cpu], build_cpu)dnl
+pushdef([host_vendor], build_vendor)dnl
+pushdef([host_os], build_os)dnl
+pushdef([ac_cv_host], ac_cv_build)dnl
+pushdef([ac_cv_host_alias], ac_cv_build_alias)dnl
+pushdef([ac_cv_host_cpu], ac_cv_build_cpu)dnl
+pushdef([ac_cv_host_vendor], ac_cv_build_vendor)dnl
+pushdef([ac_cv_host_os], ac_cv_build_os)dnl
+pushdef([ac_cpp], ac_build_cpp)dnl
+pushdef([ac_compile], ac_build_compile)dnl
+pushdef([ac_link], ac_build_link)dnl
+
+save_cross_compiling=$cross_compiling
+save_ac_tool_prefix=$ac_tool_prefix
+cross_compiling=no
+ac_tool_prefix=
+
+AC_PROG_CC
+AC_PROG_CPP
+AC_EXEEXT
+
+ac_tool_prefix=$save_ac_tool_prefix
+cross_compiling=$save_cross_compiling
+
+dnl Restore the old definitions
+dnl
+popdef([ac_link])dnl
+popdef([ac_compile])dnl
+popdef([ac_cpp])dnl
+popdef([ac_cv_host_os])dnl
+popdef([ac_cv_host_vendor])dnl
+popdef([ac_cv_host_cpu])dnl
+popdef([ac_cv_host_alias])dnl
+popdef([ac_cv_host])dnl
+popdef([host_os])dnl
+popdef([host_vendor])dnl
+popdef([host_cpu])dnl
+popdef([host_alias])dnl
+popdef([host])dnl
+popdef([LDFLAGS])dnl
+popdef([CPPFLAGS])dnl
+popdef([CFLAGS])dnl
+popdef([CPP])dnl
+popdef([CC])dnl
+popdef([ac_objext])dnl
+popdef([ac_exeext])dnl
+popdef([ac_cv_objext])dnl
+popdef([ac_cv_exeext])dnl
+popdef([ac_cv_prog_cc_g])dnl
+popdef([ac_cv_prog_cc_cross])dnl
+popdef([ac_cv_prog_cc_works])dnl
+popdef([ac_cv_prog_gcc])dnl
+popdef([ac_cv_prog_CPP])dnl
+
+dnl Finally, set Makefile variables
+dnl
+BUILD_EXEEXT=$ac_build_exeext
+BUILD_OBJEXT=$ac_build_objext
+AC_SUBST(BUILD_EXEEXT)dnl
+AC_SUBST(BUILD_OBJEXT)dnl
+AC_SUBST([CFLAGS_FOR_BUILD])dnl
+AC_SUBST([CPPFLAGS_FOR_BUILD])dnl
+AC_SUBST([LDFLAGS_FOR_BUILD])dnl
+])

build-aux/m4/bitcoin_secp.m4

@@ -1,75 +1,69 @@
+dnl libsecp25k1 helper checks
+AC_DEFUN([SECP_INT128_CHECK],[
+has_int128=$ac_cv_type___int128
+])
+
 dnl escape "$0x" below using the m4 quadrigaph @S|@, and escape it again with a \ for the shell.
-AC_DEFUN([SECP_X86_64_ASM_CHECK],[
+AC_DEFUN([SECP_64BIT_ASM_CHECK],[
 AC_MSG_CHECKING(for x86_64 assembly availability)
-AC_LINK_IFELSE([AC_LANG_PROGRAM([[
+AC_COMPILE_IFELSE([AC_LANG_PROGRAM([[
   #include <stdint.h>]],[[
   uint64_t a = 11, tmp;
   __asm__ __volatile__("movq \@S|@0x100000000,%1; mulq %%rsi" : "+a"(a) : "S"(tmp) : "cc", "%rdx");
-  ]])], [has_x86_64_asm=yes], [has_x86_64_asm=no])
-AC_MSG_RESULT([$has_x86_64_asm])
+  ]])],[has_64bit_asm=yes],[has_64bit_asm=no])
+AC_MSG_RESULT([$has_64bit_asm])
 ])
 
-AC_DEFUN([SECP_ARM32_ASM_CHECK], [
-  AC_MSG_CHECKING(for ARM32 assembly availability)
-  SECP_ARM32_ASM_CHECK_CFLAGS_saved_CFLAGS="$CFLAGS"
-  CFLAGS="-x assembler"
-  AC_LINK_IFELSE([AC_LANG_SOURCE([[
-    .syntax unified
-    .eabi_attribute 24, 1
-    .eabi_attribute 25, 1
-    .text
-    .global main
-    main:
-      ldr r0, =0x002A
-      mov r7, #1
-      swi 0   
-    ]])], [has_arm32_asm=yes], [has_arm32_asm=no])
-  AC_MSG_RESULT([$has_arm32_asm])
-  CFLAGS="$SECP_ARM32_ASM_CHECK_CFLAGS_saved_CFLAGS"
-])
-
-AC_DEFUN([SECP_VALGRIND_CHECK],[
-AC_MSG_CHECKING([for valgrind support])
-if test x"$has_valgrind" != x"yes"; then
-  CPPFLAGS_TEMP="$CPPFLAGS"
-  CPPFLAGS="$VALGRIND_CPPFLAGS $CPPFLAGS"
+dnl
+AC_DEFUN([SECP_OPENSSL_CHECK],[
+  has_libcrypto=no
+  m4_ifdef([PKG_CHECK_MODULES],[
+    PKG_CHECK_MODULES([CRYPTO], [libcrypto], [has_libcrypto=yes],[has_libcrypto=no])
+    if test x"$has_libcrypto" = x"yes"; then
+      TEMP_LIBS="$LIBS"
+      LIBS="$LIBS $CRYPTO_LIBS"
+      AC_CHECK_LIB(crypto, main,[AC_DEFINE(HAVE_LIBCRYPTO,1,[Define this symbol if libcrypto is installed])],[has_libcrypto=no])
+      LIBS="$TEMP_LIBS"
+    fi
+  ])
+  if test x$has_libcrypto = xno; then
+    AC_CHECK_HEADER(openssl/crypto.h,[
+      AC_CHECK_LIB(crypto, main,[
+        has_libcrypto=yes
+        CRYPTO_LIBS=-lcrypto
+        AC_DEFINE(HAVE_LIBCRYPTO,1,[Define this symbol if libcrypto is installed])
+      ])
+    ])
+    LIBS=
+  fi
+if test x"$has_libcrypto" = x"yes" && test x"$has_openssl_ec" = x; then
+  AC_MSG_CHECKING(for EC functions in libcrypto)
   AC_COMPILE_IFELSE([AC_LANG_PROGRAM([[
-    #include <valgrind/memcheck.h>
-  ]], [[
-    #if defined(NVALGRIND)
-    #  error "Valgrind does not support this platform."
-    #endif
-  ]])], [has_valgrind=yes])
-  CPPFLAGS="$CPPFLAGS_TEMP"
+    #include <openssl/ec.h>
+    #include <openssl/ecdsa.h>
+    #include <openssl/obj_mac.h>]],[[
+    EC_KEY *eckey = EC_KEY_new_by_curve_name(NID_secp256k1);
+    ECDSA_sign(0, NULL, 0, NULL, NULL, eckey);
+    ECDSA_verify(0, NULL, 0, NULL, 0, eckey);
+    EC_KEY_free(eckey);
+    ECDSA_SIG *sig_openssl;
+    sig_openssl = ECDSA_SIG_new();
+    (void)sig_openssl->r;
+    ECDSA_SIG_free(sig_openssl);
+  ]])],[has_openssl_ec=yes],[has_openssl_ec=no])
+  AC_MSG_RESULT([$has_openssl_ec])
 fi
-AC_MSG_RESULT($has_valgrind)
 ])
 
-dnl SECP_TRY_APPEND_CFLAGS(flags, VAR)
-dnl Append flags to VAR if CC accepts them.
-AC_DEFUN([SECP_TRY_APPEND_CFLAGS], [
-  AC_MSG_CHECKING([if ${CC} supports $1])
-  SECP_TRY_APPEND_CFLAGS_saved_CFLAGS="$CFLAGS"
-  CFLAGS="$1 $CFLAGS"
-  AC_COMPILE_IFELSE([AC_LANG_SOURCE([[char foo;]])], [flag_works=yes], [flag_works=no])
-  AC_MSG_RESULT($flag_works)
-  CFLAGS="$SECP_TRY_APPEND_CFLAGS_saved_CFLAGS"
-  if test x"$flag_works" = x"yes"; then
-    $2="$$2 $1"
-  fi
-  unset flag_works
-  AC_SUBST($2)
-])
-
-dnl SECP_SET_DEFAULT(VAR, default, default-dev-mode)
-dnl Set VAR to default or default-dev-mode, depending on whether dev mode is enabled
-AC_DEFUN([SECP_SET_DEFAULT], [
-  if test "${enable_dev_mode+set}" != set; then
-    AC_MSG_ERROR([[Set enable_dev_mode before calling SECP_SET_DEFAULT]])
-  fi
-  if test x"$enable_dev_mode" = x"yes"; then
-    $1="$3"
-  else
-    $1="$2"
-  fi
+dnl
+AC_DEFUN([SECP_GMP_CHECK],[
+if test x"$has_gmp" != x"yes"; then
+  CPPFLAGS_TEMP="$CPPFLAGS"
+  CPPFLAGS="$GMP_CPPFLAGS $CPPFLAGS"
+  LIBS_TEMP="$LIBS"
+  LIBS="$GMP_LIBS $LIBS"
+  AC_CHECK_HEADER(gmp.h,[AC_CHECK_LIB(gmp, __gmpz_init,[has_gmp=yes; GMP_LIBS="$GMP_LIBS -lgmp"; AC_DEFINE(HAVE_LIBGMP,1,[Define this symbol if libgmp is installed])])])
+  CPPFLAGS="$CPPFLAGS_TEMP"
+  LIBS="$LIBS_TEMP"
+fi
 ])

ci/ci.sh

@@ -1,157 +0,0 @@
-#!/bin/sh
-
-set -eux
-
-export LC_ALL=C
-
-# Print commit and relevant CI environment to allow reproducing the job outside of CI.
-git show --no-patch
-print_environment() {
-    # Turn off -x because it messes up the output
-    set +x
-    # There are many ways to print variable names and their content. This one
-    # does not rely on bash.
-    for var in WERROR_CFLAGS MAKEFLAGS BUILD \
-            ECMULTWINDOW ECMULTGENPRECISION ASM WIDEMUL WITH_VALGRIND EXTRAFLAGS \
-            EXPERIMENTAL ECDH RECOVERY SCHNORRSIG SCHNORRSIG_HALFAGG ELLSWIFT \
-            ECDSA_S2C GENERATOR RANGEPROOF WHITELIST MUSIG ECDSAADAPTOR BPPP \
-            FROST SECP256K1_TEST_ITERS BENCH SECP256K1_BENCH_ITERS CTIMETESTS\
-            EXAMPLES \
-            HOST WRAPPER_CMD \
-            CC CFLAGS CPPFLAGS AR NM
-    do
-        eval "isset=\${$var+x}"
-        if [ -n "$isset" ]; then
-            eval "val=\${$var}"
-            # shellcheck disable=SC2154
-            printf '%s="%s" ' "$var" "$val"
-        fi
-    done
-    echo "$0"
-    set -x
-}
-print_environment
-
-env >> test_env.log
-
-# If gcc is requested, assert that it's in fact gcc (and not some symlinked Apple clang).
-case "${CC:-undefined}" in
-    *gcc*)
-        $CC -v 2>&1 | grep -q "gcc version" || exit 1;
-        ;;
-esac
-
-if [ -n "${CC+x}" ]; then
-    # The MSVC compiler "cl" doesn't understand "-v"
-    $CC -v || true
-fi
-if [ "$WITH_VALGRIND" = "yes" ]; then
-    valgrind --version
-fi
-if [ -n "$WRAPPER_CMD" ]; then
-    $WRAPPER_CMD --version
-fi
-
-# Workaround for https://bugs.kde.org/show_bug.cgi?id=452758 (fixed in valgrind 3.20.0).
-case "${CC:-undefined}" in
-    clang*)
-        if [ "$CTIMETESTS" = "yes" ] && [ "$WITH_VALGRIND" = "yes" ]
-        then
-            export CFLAGS="${CFLAGS:+$CFLAGS }-gdwarf-4"
-        else
-            case "$WRAPPER_CMD" in
-                valgrind*)
-                    export CFLAGS="${CFLAGS:+$CFLAGS }-gdwarf-4"
-                    ;;
-            esac
-        fi
-        ;;
-esac
-
-./autogen.sh
-
-./configure \
-    --enable-experimental="$EXPERIMENTAL" \
-    --with-test-override-wide-multiply="$WIDEMUL" --with-asm="$ASM" \
-    --with-ecmult-window="$ECMULTWINDOW" \
-    --with-ecmult-gen-precision="$ECMULTGENPRECISION" \
-    --enable-module-ecdh="$ECDH" --enable-module-recovery="$RECOVERY" \
-    --enable-module-ellswift="$ELLSWIFT" \
-    --enable-module-ecdsa-s2c="$ECDSA_S2C" \
-    --enable-module-bppp="$BPPP" \
-    --enable-module-rangeproof="$RANGEPROOF" --enable-module-whitelist="$WHITELIST" --enable-module-generator="$GENERATOR" \
-    --enable-module-schnorrsig="$SCHNORRSIG"  --enable-module-musig="$MUSIG" --enable-module-ecdsa-adaptor="$ECDSAADAPTOR" \
-    --enable-module-schnorrsig="$SCHNORRSIG" \
-    --enable-module-schnorrsig-halfagg="$SCHNORRSIG_HALFAGG" \
-    --enable-module-frost="$FROST" \
-    --enable-examples="$EXAMPLES" \
-    --enable-ctime-tests="$CTIMETESTS" \
-    --with-valgrind="$WITH_VALGRIND" \
-    --host="$HOST" $EXTRAFLAGS
-
-# We have set "-j<n>" in MAKEFLAGS.
-build_exit_code=0
-make > make.log 2>&1 || build_exit_code=$?
-cat make.log
-if [ $build_exit_code -ne 0 ]; then
-    case "${CC:-undefined}" in
-        *snapshot*)
-            # Ignore internal compiler errors in gcc-snapshot and clang-snapshot
-            grep -e "internal compiler error:" -e "PLEASE submit a bug report" make.log
-            return $?;
-            ;;
-        *)
-            return 1;
-            ;;
-    esac
-fi
-
-# Print information about binaries so that we can see that the architecture is correct
-file *tests* || true
-file bench* || true
-file .libs/* || true
-
-# This tells `make check` to wrap test invocations.
-export LOG_COMPILER="$WRAPPER_CMD"
-
-make "$BUILD"
-
-# Using the local `libtool` because on macOS the system's libtool has nothing to do with GNU libtool
-EXEC='./libtool --mode=execute'
-if [ -n "$WRAPPER_CMD" ]
-then
-    EXEC="$EXEC $WRAPPER_CMD"
-fi
-
-if [ "$BENCH" = "yes" ]
-then
-    {
-        $EXEC ./bench_ecmult
-        $EXEC ./bench_internal
-        $EXEC ./bench
-        if [ "$BPPP" = "yes" ]
-        then
-            $EXEC ./bench_bppp
-        fi
-    } >> bench.log 2>&1
-fi
-
-if [ "$CTIMETESTS" = "yes" ]
-then
-    if [ "$WITH_VALGRIND" = "yes" ]; then
-        ./libtool --mode=execute valgrind --error-exitcode=42 ./ctime_tests > ctime_tests.log 2>&1
-    else
-        $EXEC ./ctime_tests > ctime_tests.log 2>&1
-    fi
-fi
-
-# Rebuild precomputed files (if not cross-compiling).
-if [ -z "$HOST" ]
-then
-    make clean-precomp clean-testvectors
-    make precomp testvectors
-fi
-
-# Check that no repo files have been modified by the build.
-# (This fails for example if the precomp files need to be updated in the repo.)
-git diff --exit-code

ci/linux-debian.Dockerfile

@@ -1,79 +0,0 @@
-FROM debian:stable-slim
-
-SHELL ["/bin/bash", "-c"]
-
-WORKDIR /root
-
-# A too high maximum number of file descriptors (with the default value
-# inherited from the docker host) can cause issues with some of our tools:
-#  - sanitizers hanging: https://github.com/google/sanitizers/issues/1662 
-#  - valgrind crashing: https://stackoverflow.com/a/75293014
-# This is not be a problem on our CI hosts, but developers who run the image
-# on their machines may run into this (e.g., on Arch Linux), so warn them.
-# (Note that .bashrc is only executed in interactive bash shells.)
-RUN echo 'if [[ $(ulimit -n) -gt 200000 ]]; then echo "WARNING: Very high value reported by \"ulimit -n\". Consider passing \"--ulimit nofile=32768\" to \"docker run\"."; fi' >> /root/.bashrc
-
-RUN dpkg --add-architecture i386 && \
-    dpkg --add-architecture s390x && \
-    dpkg --add-architecture armhf && \
-    dpkg --add-architecture arm64 && \
-    dpkg --add-architecture ppc64el
-
-# dkpg-dev: to make pkg-config work in cross-builds
-# llvm: for llvm-symbolizer, which is used by clang's UBSan for symbolized stack traces
-RUN apt-get update && apt-get install --no-install-recommends -y \
-        git ca-certificates \
-        make automake libtool pkg-config dpkg-dev valgrind qemu-user \
-        gcc clang llvm libclang-rt-dev libc6-dbg \
-        g++ \
-        gcc-i686-linux-gnu libc6-dev-i386-cross libc6-dbg:i386 libubsan1:i386 libasan8:i386 \
-        gcc-s390x-linux-gnu libc6-dev-s390x-cross libc6-dbg:s390x \
-        gcc-arm-linux-gnueabihf libc6-dev-armhf-cross libc6-dbg:armhf \
-        gcc-powerpc64le-linux-gnu libc6-dev-ppc64el-cross libc6-dbg:ppc64el \
-        gcc-mingw-w64-x86-64-win32 wine64 wine \
-        gcc-mingw-w64-i686-win32 wine32 \
-        python3 && \
-        if ! ( dpkg --print-architecture | grep --quiet "arm64" ) ; then \
-         apt-get install --no-install-recommends -y \
-         gcc-aarch64-linux-gnu libc6-dev-arm64-cross libc6-dbg:arm64 ;\
-        fi && \
-        apt-get clean && rm -rf /var/lib/apt/lists/*
-
-# Build and install gcc snapshot
-ARG GCC_SNAPSHOT_MAJOR=14
-RUN apt-get update && apt-get install --no-install-recommends -y wget libgmp-dev libmpfr-dev libmpc-dev flex && \
-    mkdir gcc && cd gcc && \
-    wget --progress=dot:giga --https-only --recursive --accept '*.tar.xz' --level 1 --no-directories "https://gcc.gnu.org/pub/gcc/snapshots/LATEST-${GCC_SNAPSHOT_MAJOR}" && \
-    wget "https://gcc.gnu.org/pub/gcc/snapshots/LATEST-${GCC_SNAPSHOT_MAJOR}/sha512.sum" && \
-    sha512sum --check --ignore-missing sha512.sum && \
-    # We should have downloaded exactly one tar.xz file
-    ls && \
-    [ $(ls *.tar.xz | wc -l) -eq "1" ] && \
-    tar xf *.tar.xz && \
-    mkdir gcc-build && cd gcc-build && \
-    ../*/configure --prefix=/opt/gcc-snapshot --enable-languages=c --disable-bootstrap --disable-multilib --without-isl && \
-    make -j $(nproc) && \
-    make install && \
-    cd ../.. && rm -rf gcc && \
-    ln -s /opt/gcc-snapshot/bin/gcc /usr/bin/gcc-snapshot && \
-    apt-get autoremove -y wget libgmp-dev libmpfr-dev libmpc-dev flex && \
-    apt-get clean && rm -rf /var/lib/apt/lists/*
-
-# Install clang snapshot, see https://apt.llvm.org/
-RUN \
-    # Setup GPG keys of LLVM repository
-    apt-get update && apt-get install --no-install-recommends -y wget && \
-    wget -qO- https://apt.llvm.org/llvm-snapshot.gpg.key | tee /etc/apt/trusted.gpg.d/apt.llvm.org.asc && \
-    # Add repository for this Debian release
-    . /etc/os-release && echo "deb http://apt.llvm.org/${VERSION_CODENAME} llvm-toolchain-${VERSION_CODENAME} main" >> /etc/apt/sources.list && \
-    apt-get update && \
-    # Determine the version number of the LLVM development branch
-    LLVM_VERSION=$(apt-cache search --names-only '^clang-[0-9]+$' | sort -V | tail -1 | cut -f1 -d" " | cut -f2 -d"-" ) && \
-    # Install
-    apt-get install --no-install-recommends -y "clang-${LLVM_VERSION}" && \
-    # Create symlink
-    ln -s "/usr/bin/clang-${LLVM_VERSION}" /usr/bin/clang-snapshot && \
-    # Clean up
-    apt-get autoremove -y wget && \
-    apt-get clean && rm -rf /var/lib/apt/lists/*
-

cmake/AllTargetsCompileOptions.cmake

@@ -1,12 +0,0 @@
-# Add compile options to all targets added in the subdirectory.
-function(all_targets_compile_options dir options)
-  get_directory_property(targets DIRECTORY ${dir} BUILDSYSTEM_TARGETS)
-  separate_arguments(options)
-  set(compiled_target_types STATIC_LIBRARY SHARED_LIBRARY OBJECT_LIBRARY EXECUTABLE)
-  foreach(target ${targets})
-    get_target_property(type ${target} TYPE)
-    if(type IN_LIST compiled_target_types)
-      target_compile_options(${target} PRIVATE ${options})
-    endif()
-  endforeach()
-endfunction()

cmake/CheckArm32Assembly.cmake

@@ -1,6 +0,0 @@
-function(check_arm32_assembly)
-  try_compile(HAVE_ARM32_ASM
-    ${CMAKE_BINARY_DIR}/check_arm32_assembly
-    SOURCES ${CMAKE_SOURCE_DIR}/cmake/source_arm32.s
-  )
-endfunction()

cmake/CheckStringOptionValue.cmake

@@ -1,10 +0,0 @@
-function(check_string_option_value option)
-  get_property(expected_values CACHE ${option} PROPERTY STRINGS)
-  if(expected_values)
-    if(${option} IN_LIST expected_values)
-      return()
-    endif()
-    message(FATAL_ERROR "${option} value is \"${${option}}\", but must be one of ${expected_values}.")
-  endif()
-  message(AUTHOR_WARNING "The STRINGS property must be set before invoking `check_string_option_value' function.")
-endfunction()

cmake/CheckX86_64Assembly.cmake

@@ -1,14 +0,0 @@
-include(CheckCSourceCompiles)
-
-function(check_x86_64_assembly)
-  check_c_source_compiles("
-    #include <stdint.h>
-
-    int main()
-    {
-      uint64_t a = 11, tmp;
-      __asm__ __volatile__(\"movq $0x100000000,%1; mulq %%rsi\" : \"+a\"(a) : \"S\"(tmp) : \"cc\", \"%rdx\");
-    }
-  " HAVE_X86_64_ASM)
-  set(HAVE_X86_64_ASM ${HAVE_X86_64_ASM} PARENT_SCOPE)
-endfunction()

cmake/FindValgrind.cmake

@@ -1,41 +0,0 @@
-if(CMAKE_HOST_APPLE)
-  find_program(BREW_COMMAND brew)
-  execute_process(
-    COMMAND ${BREW_COMMAND} --prefix valgrind
-    OUTPUT_VARIABLE valgrind_brew_prefix
-    ERROR_QUIET
-    OUTPUT_STRIP_TRAILING_WHITESPACE
-  )
-endif()
-
-set(hints_paths)
-if(valgrind_brew_prefix)
-  set(hints_paths ${valgrind_brew_prefix}/include)
-endif()
-
-find_path(Valgrind_INCLUDE_DIR
-  NAMES valgrind/memcheck.h
-  HINTS ${hints_paths}
-)
-
-if(Valgrind_INCLUDE_DIR)
-  include(CheckCSourceCompiles)
-  set(CMAKE_REQUIRED_INCLUDES ${Valgrind_INCLUDE_DIR})
-  check_c_source_compiles("
-    #include <valgrind/memcheck.h>
-    #if defined(NVALGRIND)
-    #  error \"Valgrind does not support this platform.\"
-    #endif
-
-    int main() {}
-  " Valgrind_WORKS)
-endif()
-
-include(FindPackageHandleStandardArgs)
-find_package_handle_standard_args(Valgrind
-  REQUIRED_VARS Valgrind_INCLUDE_DIR Valgrind_WORKS
-)
-
-mark_as_advanced(
-  Valgrind_INCLUDE_DIR
-)

cmake/GeneratePkgConfigFile.cmake

@@ -1,8 +0,0 @@
-function(generate_pkg_config_file in_file)
-  set(prefix ${CMAKE_INSTALL_PREFIX})
-  set(exec_prefix \${prefix})
-  set(libdir \${exec_prefix}/${CMAKE_INSTALL_LIBDIR})
-  set(includedir \${prefix}/${CMAKE_INSTALL_INCLUDEDIR})
-  set(PACKAGE_VERSION ${PROJECT_VERSION})
-  configure_file(${in_file} ${PROJECT_NAME}.pc @ONLY)
-endfunction()

cmake/TryAppendCFlags.cmake

@@ -1,24 +0,0 @@
-include(CheckCCompilerFlag)
-
-function(secp256k1_check_c_flags_internal flags output)
-  string(MAKE_C_IDENTIFIER "${flags}" result)
-  string(TOUPPER "${result}" result)
-  set(result "C_SUPPORTS_${result}")
-  if(NOT MSVC)
-    set(CMAKE_REQUIRED_FLAGS "-Werror")
-  endif()
-
-  # This avoids running a linker.
-  set(CMAKE_TRY_COMPILE_TARGET_TYPE STATIC_LIBRARY)
-  check_c_compiler_flag("${flags}" ${result})
-
-  set(${output} ${${result}} PARENT_SCOPE)
-endfunction()
-
-# Append flags to the COMPILE_OPTIONS directory property if CC accepts them.
-macro(try_append_c_flags)
-  secp256k1_check_c_flags_internal("${ARGV}" result)
-  if(result)
-    add_compile_options(${ARGV})
-  endif()
-endmacro()

cmake/arm-linux-gnueabihf.toolchain.cmake

@@ -1,3 +0,0 @@
-set(CMAKE_SYSTEM_NAME Linux)
-set(CMAKE_SYSTEM_PROCESSOR arm)
-set(CMAKE_C_COMPILER arm-linux-gnueabihf-gcc)

cmake/config.cmake.in

@@ -1,5 +0,0 @@
-@PACKAGE_INIT@
-
-include("${CMAKE_CURRENT_LIST_DIR}/@PROJECT_NAME@-targets.cmake")
-
-check_required_components(@PROJECT_NAME@)

cmake/source_arm32.s

@@ -1,9 +0,0 @@
-.syntax unified
-.eabi_attribute 24, 1
-.eabi_attribute 25, 1
-.text
-.global main
-main:
-	ldr	r0, =0x002A
-	mov	r7, #1
-	swi	0   

cmake/x86_64-w64-mingw32.toolchain.cmake

@@ -1,3 +0,0 @@
-set(CMAKE_SYSTEM_NAME Windows)
-set(CMAKE_SYSTEM_PROCESSOR x86_64)
-set(CMAKE_C_COMPILER x86_64-w64-mingw32-gcc)

contrib/lax_der_parsing.c

@@ -1,10 +1,11 @@
-/***********************************************************************
- * Copyright (c) 2015 Pieter Wuille                                    *
- * Distributed under the MIT software license, see the accompanying    *
- * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
- ***********************************************************************/
+/**********************************************************************
+ * Copyright (c) 2015 Pieter Wuille                                   *
+ * Distributed under the MIT software license, see the accompanying   *
+ * file COPYING or http://www.opensource.org/licenses/mit-license.php.*
+ **********************************************************************/
 
 #include <string.h>
+#include <secp256k1.h>
 
 #include "lax_der_parsing.h"
 
@@ -31,7 +32,7 @@ int ecdsa_signature_parse_der_lax(const secp256k1_context* ctx, secp256k1_ecdsa_
     lenbyte = input[pos++];
     if (lenbyte & 0x80) {
         lenbyte -= 0x80;
-        if (lenbyte > inputlen - pos) {
+        if (pos + lenbyte > inputlen) {
             return 0;
         }
         pos += lenbyte;
@@ -50,7 +51,7 @@ int ecdsa_signature_parse_der_lax(const secp256k1_context* ctx, secp256k1_ecdsa_
     lenbyte = input[pos++];
     if (lenbyte & 0x80) {
         lenbyte -= 0x80;
-        if (lenbyte > inputlen - pos) {
+        if (pos + lenbyte > inputlen) {
             return 0;
         }
         while (lenbyte > 0 && input[pos] == 0) {
@@ -88,7 +89,7 @@ int ecdsa_signature_parse_der_lax(const secp256k1_context* ctx, secp256k1_ecdsa_
     lenbyte = input[pos++];
     if (lenbyte & 0x80) {
         lenbyte -= 0x80;
-        if (lenbyte > inputlen - pos) {
+        if (pos + lenbyte > inputlen) {
             return 0;
         }
         while (lenbyte > 0 && input[pos] == 0) {
@@ -111,6 +112,7 @@ int ecdsa_signature_parse_der_lax(const secp256k1_context* ctx, secp256k1_ecdsa_
         return 0;
     }
     spos = pos;
+    pos += slen;
 
     /* Ignore leading zeroes in R */
     while (rlen > 0 && input[rpos] == 0) {
@@ -120,7 +122,7 @@ int ecdsa_signature_parse_der_lax(const secp256k1_context* ctx, secp256k1_ecdsa_
     /* Copy R value */
     if (rlen > 32) {
         overflow = 1;
-    } else if (rlen) {
+    } else {
         memcpy(tmpsig + 32 - rlen, input + rpos, rlen);
     }
 
@@ -132,7 +134,7 @@ int ecdsa_signature_parse_der_lax(const secp256k1_context* ctx, secp256k1_ecdsa_
     /* Copy S value */
     if (slen > 32) {
         overflow = 1;
-    } else if (slen) {
+    } else {
         memcpy(tmpsig + 64 - slen, input + spos, slen);
     }
 

contrib/lax_der_parsing.h

@@ -1,8 +1,8 @@
-/***********************************************************************
- * Copyright (c) 2015 Pieter Wuille                                    *
- * Distributed under the MIT software license, see the accompanying    *
- * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
- ***********************************************************************/
+/**********************************************************************
+ * Copyright (c) 2015 Pieter Wuille                                   *
+ * Distributed under the MIT software license, see the accompanying   *
+ * file COPYING or http://www.opensource.org/licenses/mit-license.php.*
+ **********************************************************************/
 
 /****
  * Please do not link this file directly. It is not part of the libsecp256k1
@@ -48,27 +48,21 @@
  *   8.3.1.
  */
 
-#ifndef SECP256K1_CONTRIB_LAX_DER_PARSING_H
-#define SECP256K1_CONTRIB_LAX_DER_PARSING_H
+#ifndef _SECP256K1_CONTRIB_LAX_DER_PARSING_H_
+#define _SECP256K1_CONTRIB_LAX_DER_PARSING_H_
 
-/* #include secp256k1.h only when it hasn't been included yet.
-   This enables this file to be #included directly in other project
-   files (such as tests.c) without the need to set an explicit -I flag,
-   which would be necessary to locate secp256k1.h. */
-#ifndef SECP256K1_H
 #include <secp256k1.h>
-#endif
 
-#ifdef __cplusplus
+# ifdef __cplusplus
 extern "C" {
-#endif
+# endif
 
 /** Parse a signature in "lax DER" format
  *
  *  Returns: 1 when the signature could be parsed, 0 otherwise.
  *  Args: ctx:      a secp256k1 context object
- *  Out:  sig:      pointer to a signature object
- *  In:   input:    pointer to the signature to be parsed
+ *  Out:  sig:      a pointer to a signature object
+ *  In:   input:    a pointer to the signature to be parsed
  *        inputlen: the length of the array pointed to be input
  *
  *  This function will accept any valid DER encoded signature, even if the
@@ -94,4 +88,4 @@ int ecdsa_signature_parse_der_lax(
 }
 #endif
 
-#endif /* SECP256K1_CONTRIB_LAX_DER_PARSING_H */
+#endif

contrib/lax_der_privatekey_parsing.c

@@ -1,10 +1,11 @@
-/***********************************************************************
- * Copyright (c) 2014, 2015 Pieter Wuille                              *
- * Distributed under the MIT software license, see the accompanying    *
- * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
- ***********************************************************************/
+/**********************************************************************
+ * Copyright (c) 2014, 2015 Pieter Wuille                             *
+ * Distributed under the MIT software license, see the accompanying   *
+ * file COPYING or http://www.opensource.org/licenses/mit-license.php.*
+ **********************************************************************/
 
 #include <string.h>
+#include <secp256k1.h>
 
 #include "lax_der_privatekey_parsing.h"
 
@@ -44,7 +45,7 @@ int ec_privkey_import_der(const secp256k1_context* ctx, unsigned char *out32, co
     if (end < privkey+2 || privkey[0] != 0x04 || privkey[1] > 0x20 || end < privkey+2+privkey[1]) {
         return 0;
     }
-    if (privkey[1]) memcpy(out32 + 32 - privkey[1], privkey + 2, privkey[1]);
+    memcpy(out32 + 32 - privkey[1], privkey + 2, privkey[1]);
     if (!secp256k1_ec_seckey_verify(ctx, out32)) {
         memset(out32, 0, 32);
         return 0;

contrib/lax_der_privatekey_parsing.h

@@ -1,8 +1,8 @@
-/***********************************************************************
- * Copyright (c) 2014, 2015 Pieter Wuille                              *
- * Distributed under the MIT software license, see the accompanying    *
- * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
- ***********************************************************************/
+/**********************************************************************
+ * Copyright (c) 2014, 2015 Pieter Wuille                             *
+ * Distributed under the MIT software license, see the accompanying   *
+ * file COPYING or http://www.opensource.org/licenses/mit-license.php.*
+ **********************************************************************/
 
 /****
  * Please do not link this file directly. It is not part of the libsecp256k1
@@ -25,25 +25,20 @@
  * library are sufficient.
  */
 
-#ifndef SECP256K1_CONTRIB_BER_PRIVATEKEY_H
-#define SECP256K1_CONTRIB_BER_PRIVATEKEY_H
+#ifndef _SECP256K1_CONTRIB_BER_PRIVATEKEY_H_
+#define _SECP256K1_CONTRIB_BER_PRIVATEKEY_H_
 
-/* #include secp256k1.h only when it hasn't been included yet.
-   This enables this file to be #included directly in other project
-   files (such as tests.c) without the need to set an explicit -I flag,
-   which would be necessary to locate secp256k1.h. */
-#ifndef SECP256K1_H
 #include <secp256k1.h>
-#endif
 
-#ifdef __cplusplus
+# ifdef __cplusplus
 extern "C" {
-#endif
+# endif
 
 /** Export a private key in DER format.
  *
  *  Returns: 1 if the private key was valid.
- *  Args: ctx:        pointer to a context object (not secp256k1_context_static).
+ *  Args: ctx:        pointer to a context object, initialized for signing (cannot
+ *                    be NULL)
  *  Out: privkey:     pointer to an array for storing the private key in BER.
  *                    Should have space for 279 bytes, and cannot be NULL.
  *       privkeylen:  Pointer to an int where the length of the private key in
@@ -92,4 +87,4 @@ SECP256K1_WARN_UNUSED_RESULT int ec_privkey_import_der(
 }
 #endif
 
-#endif /* SECP256K1_CONTRIB_BER_PRIVATEKEY_H */
+#endif

contrib/musig2-vectors.py

@@ -1,656 +0,0 @@
-#!/usr/bin/env python3
-
-import sys
-import json
-import textwrap
-
-max_pubkeys = 0
-
-if len(sys.argv) < 2:
-    print(
-        "This script converts BIP MuSig2 test vectors in a given directory to a C file that can be used in the test framework."
-    )
-    print("Usage: %s <dir>" % sys.argv[0])
-    sys.exit(1)
-
-
-def hexstr_to_intarray(str):
-    return ", ".join([f"0x{b:02X}" for b in bytes.fromhex(str)])
-
-
-def create_init(name):
-    return """
-static const struct musig_%s_vector musig_%s_vector = {
-""" % (
-        name,
-        name,
-    )
-
-
-def init_array(key):
-    return textwrap.indent("{ %s },\n" % hexstr_to_intarray(data[key]), 4 * " ")
-
-
-def init_arrays(key):
-    s = textwrap.indent("{\n", 4 * " ")
-    s += textwrap.indent(
-        ",\n".join(["{ %s }" % hexstr_to_intarray(x) for x in data[key]]), 8 * " "
-    )
-    s += textwrap.indent("\n},\n", 4 * " ")
-    return s
-
-
-def init_indices(array):
-    return " %d, { %s }" % (
-        len(array),
-        ", ".join(map(str, array) if len(array) > 0 else "0"),
-    )
-
-
-def init_is_xonly(case):
-    if len(case["tweak_indices"]) > 0:
-        return ", ".join(map(lambda x: "1" if x else "0", case["is_xonly"]))
-    return "0"
-
-
-def init_optional_expected(case):
-    return hexstr_to_intarray(case["expected"]) if "expected" in case else 0
-
-
-def init_cases(cases, f):
-    s = textwrap.indent("{\n", 4 * " ")
-    for (i, case) in enumerate(cases):
-        s += textwrap.indent("%s\n" % f(case), 8 * " ")
-    s += textwrap.indent("},\n", 4 * " ")
-    return s
-
-
-def finish_init():
-    return "};\n"
-
-
-s = (
-    """/**
- * Automatically generated by %s.
- *
- * The test vectors for the KeySort function are included in this file. They can
- * be found in src/modules/extrakeys/tests_impl.h. */
-"""
-    % sys.argv[0]
-)
-
-
-s += """
-enum MUSIG_ERROR {
-    MUSIG_PUBKEY,
-    MUSIG_TWEAK,
-    MUSIG_PUBNONCE,
-    MUSIG_AGGNONCE,
-    MUSIG_SECNONCE,
-    MUSIG_SIG,
-    MUSIG_SIG_VERIFY,
-    MUSIG_OTHER
-};
-"""
-
-# key agg vectors
-with open(sys.argv[1] + "/key_agg_vectors.json", "r") as f:
-    data = json.load(f)
-
-    max_key_indices = max(
-        len(test_case["key_indices"]) for test_case in data["valid_test_cases"]
-    )
-    max_tweak_indices = max(
-        len(test_case["tweak_indices"]) for test_case in data["error_test_cases"]
-    )
-    num_pubkeys = len(data["pubkeys"])
-    max_pubkeys = max(num_pubkeys, max_pubkeys)
-    num_tweaks = len(data["tweaks"])
-    num_valid_cases = len(data["valid_test_cases"])
-    num_error_cases = len(data["error_test_cases"])
-
-    # Add structures for valid and error cases
-    s += (
-        """
-struct musig_key_agg_valid_test_case {
-    size_t key_indices_len;
-    size_t key_indices[%d];
-    unsigned char expected[32];
-};
-"""
-        % max_key_indices
-    )
-    s += """
-struct musig_key_agg_error_test_case {
-    size_t key_indices_len;
-    size_t key_indices[%d];
-    size_t tweak_indices_len;
-    size_t tweak_indices[%d];
-    int is_xonly[%d];
-    enum MUSIG_ERROR error;
-};
-""" % (
-        max_key_indices,
-        max_tweak_indices,
-        max_tweak_indices,
-    )
-
-    # Add structure for entire vector
-    s += """
-struct musig_key_agg_vector {
-    unsigned char pubkeys[%d][33];
-    unsigned char tweaks[%d][32];
-    struct musig_key_agg_valid_test_case valid_case[%d];
-    struct musig_key_agg_error_test_case error_case[%d];
-};
-""" % (
-        num_pubkeys,
-        num_tweaks,
-        num_valid_cases,
-        num_error_cases,
-    )
-
-    s += create_init("key_agg")
-    # Add pubkeys and tweaks to the vector
-    s += init_arrays("pubkeys")
-    s += init_arrays("tweaks")
-
-    # Add valid cases to the vector
-    s += init_cases(
-        data["valid_test_cases"],
-        lambda case: "{ %s, { %s }},"
-        % (init_indices(case["key_indices"]), hexstr_to_intarray(case["expected"])),
-    )
-
-    def comment_to_error(case):
-        comment = case["comment"]
-        if "public key" in comment.lower():
-            return "MUSIG_PUBKEY"
-        elif "tweak" in comment.lower():
-            return "MUSIG_TWEAK"
-        else:
-            sys.exit("Unknown error")
-
-    # Add error cases to the vector
-    s += init_cases(
-        data["error_test_cases"],
-        lambda case: "{ %s, %s, { %s }, %s },"
-        % (
-            init_indices(case["key_indices"]),
-            init_indices(case["tweak_indices"]),
-            init_is_xonly(case),
-            comment_to_error(case),
-        ),
-    )
-
-    s += finish_init()
-
-# nonce gen vectors
-with open(sys.argv[1] + "/nonce_gen_vectors.json", "r") as f:
-    data = json.load(f)
-
-    # The MuSig2 implementation only allows messages of length 32
-    data["test_cases"] = list(
-        filter(lambda c: c["msg"] is None or len(c["msg"]) == 64, data["test_cases"])
-    )
-
-    num_tests = len(data["test_cases"])
-
-    s += """
-struct musig_nonce_gen_test_case {
-    unsigned char rand_[32];
-    int has_sk;
-    unsigned char sk[32];
-    unsigned char pk[33];
-    int has_aggpk;
-    unsigned char aggpk[32];
-    int has_msg;
-    unsigned char msg[32];
-    int has_extra_in;
-    unsigned char extra_in[32];
-    unsigned char expected_secnonce[97];
-    unsigned char expected_pubnonce[66];
-};
-"""
-
-    s += (
-        """
-struct musig_nonce_gen_vector {
-    struct musig_nonce_gen_test_case test_case[%d];
-};
-"""
-        % num_tests
-    )
-
-    s += create_init("nonce_gen")
-
-    def init_array_maybe(array):
-        return "%d , { %s }" % (
-            0 if array is None else 1,
-            hexstr_to_intarray(array) if array is not None else 0,
-        )
-
-    s += init_cases(
-        data["test_cases"],
-        lambda case: "{ { %s },  %s, { %s }, %s, %s, %s, { %s }, { %s } },"
-        % (
-            hexstr_to_intarray(case["rand_"]),
-            init_array_maybe(case["sk"]),
-            hexstr_to_intarray(case["pk"]),
-            init_array_maybe(case["aggpk"]),
-            init_array_maybe(case["msg"]),
-            init_array_maybe(case["extra_in"]),
-            hexstr_to_intarray(case["expected_secnonce"]),
-            hexstr_to_intarray(case["expected_pubnonce"]),
-        ),
-    )
-
-    s += finish_init()
-
-# nonce agg vectors
-with open(sys.argv[1] + "/nonce_agg_vectors.json", "r") as f:
-    data = json.load(f)
-
-    num_pnonces = len(data["pnonces"])
-    num_valid_cases = len(data["valid_test_cases"])
-    num_error_cases = len(data["error_test_cases"])
-
-    pnonce_indices_len = 2
-    for case in data["valid_test_cases"] + data["error_test_cases"]:
-        assert len(case["pnonce_indices"]) == pnonce_indices_len
-
-    # Add structures for valid and error cases
-    s += """
-struct musig_nonce_agg_test_case {
-    size_t pnonce_indices[2];
-    /* if valid case */
-    unsigned char expected[66];
-    /* if error case */
-    int invalid_nonce_idx;
-};
-"""
-    # Add structure for entire vector
-    s += """
-struct musig_nonce_agg_vector {
-    unsigned char pnonces[%d][66];
-    struct musig_nonce_agg_test_case valid_case[%d];
-    struct musig_nonce_agg_test_case error_case[%d];
-};
-""" % (
-        num_pnonces,
-        num_valid_cases,
-        num_error_cases,
-    )
-
-    s += create_init("nonce_agg")
-    s += init_arrays("pnonces")
-
-    for cases in (data["valid_test_cases"], data["error_test_cases"]):
-        s += init_cases(
-            cases,
-            lambda case: "{ { %s }, { %s }, %d },"
-            % (
-                ", ".join(map(str, case["pnonce_indices"])),
-                init_optional_expected(case),
-                case["error"]["signer"] if "error" in case else 0,
-            ),
-        )
-    s += finish_init()
-
-# sign/verify vectors
-with open(sys.argv[1] + "/sign_verify_vectors.json", "r") as f:
-    data = json.load(f)
-
-    # The MuSig2 implementation only allows messages of length 32
-    assert list(filter(lambda x: len(x) == 64, data["msgs"]))[0] == data["msgs"][0]
-    data["msgs"] = [data["msgs"][0]]
-
-    def filter_msg32(k):
-        return list(filter(lambda x: x["msg_index"] == 0, data[k]))
-
-    data["valid_test_cases"] = filter_msg32("valid_test_cases")
-    data["sign_error_test_cases"] = filter_msg32("sign_error_test_cases")
-    data["verify_error_test_cases"] = filter_msg32("verify_error_test_cases")
-    data["verify_fail_test_cases"] = filter_msg32("verify_fail_test_cases")
-
-    num_pubkeys = len(data["pubkeys"])
-    max_pubkeys = max(num_pubkeys, max_pubkeys)
-    num_secnonces = len(data["secnonces"])
-    num_pubnonces = len(data["pnonces"])
-    num_aggnonces = len(data["aggnonces"])
-    num_msgs = len(data["msgs"])
-    num_valid_cases = len(data["valid_test_cases"])
-    num_sign_error_cases = len(data["sign_error_test_cases"])
-    num_verify_fail_cases = len(data["verify_fail_test_cases"])
-    num_verify_error_cases = len(data["verify_error_test_cases"])
-
-    all_cases = (
-        data["valid_test_cases"]
-        + data["sign_error_test_cases"]
-        + data["verify_error_test_cases"]
-        + data["verify_fail_test_cases"]
-    )
-    max_key_indices = max(len(test_case["key_indices"]) for test_case in all_cases)
-    max_nonce_indices = max(
-        len(test_case["nonce_indices"]) if "nonce_indices" in test_case else 0
-        for test_case in all_cases
-    )
-    # Add structures for valid and error cases
-    s += (
-        """
-/* Omit pubnonces in the test vectors because our partial signature verification
- * implementation is able to accept the aggnonce directly. */
-struct musig_valid_case {
-    size_t key_indices_len;
-    size_t key_indices[%d];
-    size_t aggnonce_index;
-    size_t msg_index;
-    size_t signer_index;
-    unsigned char expected[32];
-};
-"""
-        % max_key_indices
-    )
-
-    s += (
-        """
-struct musig_sign_error_case {
-    size_t key_indices_len;
-    size_t key_indices[%d];
-    size_t aggnonce_index;
-    size_t msg_index;
-    size_t secnonce_index;
-    enum MUSIG_ERROR error;
-};
-"""
-        % max_key_indices
-    )
-
-    s += """
-struct musig_verify_fail_error_case {
-    unsigned char sig[32];
-    size_t key_indices_len;
-    size_t key_indices[%d];
-    size_t nonce_indices_len;
-    size_t nonce_indices[%d];
-    size_t msg_index;
-    size_t signer_index;
-    enum MUSIG_ERROR error;
-};
-""" % (
-        max_key_indices,
-        max_nonce_indices,
-    )
-
-    # Add structure for entire vector
-    s += """
-struct musig_sign_verify_vector {
-    unsigned char sk[32];
-    unsigned char pubkeys[%d][33];
-    unsigned char secnonces[%d][194];
-    unsigned char pubnonces[%d][194];
-    unsigned char aggnonces[%d][66];
-    unsigned char msgs[%d][32];
-    struct musig_valid_case valid_case[%d];
-    struct musig_sign_error_case sign_error_case[%d];
-    struct musig_verify_fail_error_case verify_fail_case[%d];
-    struct musig_verify_fail_error_case verify_error_case[%d];
-};
-""" % (
-        num_pubkeys,
-        num_secnonces,
-        num_pubnonces,
-        num_aggnonces,
-        num_msgs,
-        num_valid_cases,
-        num_sign_error_cases,
-        num_verify_fail_cases,
-        num_verify_error_cases,
-    )
-
-    s += create_init("sign_verify")
-    s += init_array("sk")
-    s += init_arrays("pubkeys")
-    s += init_arrays("secnonces")
-    s += init_arrays("pnonces")
-    s += init_arrays("aggnonces")
-    s += init_arrays("msgs")
-
-    s += init_cases(
-        data["valid_test_cases"],
-        lambda case: "{ %s, %d, %d, %d, { %s }},"
-        % (
-            init_indices(case["key_indices"]),
-            case["aggnonce_index"],
-            case["msg_index"],
-            case["signer_index"],
-            init_optional_expected(case),
-        ),
-    )
-
-    def sign_error(case):
-        comment = case["comment"]
-        if "pubkey" in comment or "public key" in comment:
-            return "MUSIG_PUBKEY"
-        elif "Aggregate nonce" in comment:
-            return "MUSIG_AGGNONCE"
-        elif "Secnonce" in comment:
-            return "MUSIG_SECNONCE"
-        else:
-            sys.exit("Unknown sign error")
-
-    s += init_cases(
-        data["sign_error_test_cases"],
-        lambda case: "{ %s, %d, %d, %d, %s },"
-        % (
-            init_indices(case["key_indices"]),
-            case["aggnonce_index"],
-            case["msg_index"],
-            case["secnonce_index"],
-            sign_error(case),
-        ),
-    )
-
-    def verify_error(case):
-        comment = case["comment"]
-        if "exceeds" in comment:
-            return "MUSIG_SIG"
-        elif "Wrong signer" in comment or "Wrong signature" in comment:
-            return "MUSIG_SIG_VERIFY"
-        elif "pubnonce" in comment:
-            return "MUSIG_PUBNONCE"
-        elif "pubkey" in comment:
-            return "MUSIG_PUBKEY"
-        else:
-            sys.exit("Unknown verify error")
-
-    for cases in ("verify_fail_test_cases", "verify_error_test_cases"):
-        s += init_cases(
-            data[cases],
-            lambda case: "{ { %s }, %s, %s, %d, %d, %s },"
-            % (
-                hexstr_to_intarray(case["sig"]),
-                init_indices(case["key_indices"]),
-                init_indices(case["nonce_indices"]),
-                case["msg_index"],
-                case["signer_index"],
-                verify_error(case),
-            ),
-        )
-
-    s += finish_init()
-
-# tweak vectors
-with open(sys.argv[1] + "/tweak_vectors.json", "r") as f:
-    data = json.load(f)
-
-    num_pubkeys = len(data["pubkeys"])
-    max_pubkeys = max(num_pubkeys, max_pubkeys)
-    num_pubnonces = len(data["pnonces"])
-    num_tweaks = len(data["tweaks"])
-    num_valid_cases = len(data["valid_test_cases"])
-    num_error_cases = len(data["error_test_cases"])
-
-    all_cases = data["valid_test_cases"] + data["error_test_cases"]
-    max_key_indices = max(len(test_case["key_indices"]) for test_case in all_cases)
-    max_tweak_indices = max(len(test_case["tweak_indices"]) for test_case in all_cases)
-    max_nonce_indices = max(len(test_case["nonce_indices"]) for test_case in all_cases)
-    # Add structures for valid and error cases
-    s += """
-struct musig_tweak_case {
-    size_t key_indices_len;
-    size_t key_indices[%d];
-    size_t nonce_indices_len;
-    size_t nonce_indices[%d];
-    size_t tweak_indices_len;
-    size_t tweak_indices[%d];
-    int is_xonly[%d];
-    size_t signer_index;
-    unsigned char expected[32];
-};
-""" % (
-        max_key_indices,
-        max_nonce_indices,
-        max_tweak_indices,
-        max_tweak_indices,
-    )
-
-    # Add structure for entire vector
-    s += """
-struct musig_tweak_vector {
-    unsigned char sk[32];
-    unsigned char secnonce[97];
-    unsigned char aggnonce[66];
-    unsigned char msg[32];
-    unsigned char pubkeys[%d][33];
-    unsigned char pubnonces[%d][194];
-    unsigned char tweaks[%d][32];
-    struct musig_tweak_case valid_case[%d];
-    struct musig_tweak_case error_case[%d];
-};
-""" % (
-        num_pubkeys,
-        num_pubnonces,
-        num_tweaks,
-        num_valid_cases,
-        num_error_cases,
-    )
-    s += create_init("tweak")
-    s += init_array("sk")
-    s += init_array("secnonce")
-    s += init_array("aggnonce")
-    s += init_array("msg")
-    s += init_arrays("pubkeys")
-    s += init_arrays("pnonces")
-    s += init_arrays("tweaks")
-
-    s += init_cases(
-        data["valid_test_cases"],
-        lambda case: "{ %s, %s, %s, { %s }, %d, { %s }},"
-        % (
-            init_indices(case["key_indices"]),
-            init_indices(case["nonce_indices"]),
-            init_indices(case["tweak_indices"]),
-            init_is_xonly(case),
-            case["signer_index"],
-            init_optional_expected(case),
-        ),
-    )
-
-    s += init_cases(
-        data["error_test_cases"],
-        lambda case: "{ %s, %s, %s, { %s }, %d, { %s }},"
-        % (
-            init_indices(case["key_indices"]),
-            init_indices(case["nonce_indices"]),
-            init_indices(case["tweak_indices"]),
-            init_is_xonly(case),
-            case["signer_index"],
-            init_optional_expected(case),
-        ),
-    )
-
-    s += finish_init()
-
-# sigagg vectors
-with open(sys.argv[1] + "/sig_agg_vectors.json", "r") as f:
-    data = json.load(f)
-
-    num_pubkeys = len(data["pubkeys"])
-    max_pubkeys = max(num_pubkeys, max_pubkeys)
-    num_tweaks = len(data["tweaks"])
-    num_psigs = len(data["psigs"])
-    num_valid_cases = len(data["valid_test_cases"])
-    num_error_cases = len(data["error_test_cases"])
-
-    all_cases = data["valid_test_cases"] + data["error_test_cases"]
-    max_key_indices = max(len(test_case["key_indices"]) for test_case in all_cases)
-    max_tweak_indices = max(len(test_case["tweak_indices"]) for test_case in all_cases)
-    max_psig_indices = max(len(test_case["psig_indices"]) for test_case in all_cases)
-
-    # Add structures for valid and error cases
-    s += """
-/* Omit pubnonces in the test vectors because they're only needed for
- * implementations that do not directly accept an aggnonce. */
-struct musig_sig_agg_case {
-    size_t key_indices_len;
-    size_t key_indices[%d];
-    size_t tweak_indices_len;
-    size_t tweak_indices[%d];
-    int is_xonly[%d];
-    unsigned char aggnonce[66];
-    size_t psig_indices_len;
-    size_t psig_indices[%d];
-    /* if valid case */
-    unsigned char expected[64];
-    /* if error case */
-    int invalid_sig_idx;
-};
-""" % (
-        max_key_indices,
-        max_tweak_indices,
-        max_tweak_indices,
-        max_psig_indices,
-    )
-
-    # Add structure for entire vector
-    s += """
-struct musig_sig_agg_vector {
-    unsigned char pubkeys[%d][33];
-    unsigned char tweaks[%d][32];
-    unsigned char psigs[%d][32];
-    unsigned char msg[32];
-    struct musig_sig_agg_case valid_case[%d];
-    struct musig_sig_agg_case error_case[%d];
-};
-""" % (
-        num_pubkeys,
-        num_tweaks,
-        num_psigs,
-        num_valid_cases,
-        num_error_cases,
-    )
-
-    s += create_init("sig_agg")
-    s += init_arrays("pubkeys")
-    s += init_arrays("tweaks")
-    s += init_arrays("psigs")
-    s += init_array("msg")
-
-    for cases in (data["valid_test_cases"], data["error_test_cases"]):
-        s += init_cases(
-            cases,
-            lambda case: "{ %s, %s, { %s }, { %s }, %s, { %s }, %d },"
-            % (
-                init_indices(case["key_indices"]),
-                init_indices(case["tweak_indices"]),
-                init_is_xonly(case),
-                hexstr_to_intarray(case["aggnonce"]),
-                init_indices(case["psig_indices"]),
-                init_optional_expected(case),
-                case["error"]["signer"] if "error" in case else 0,
-            ),
-        )
-    s += finish_init()
-s += "enum { MUSIG_VECTORS_MAX_PUBKEYS = %d };" % max_pubkeys
-print(s)

contrib/sync-upstream.sh

@@ -1,140 +0,0 @@
-#!/usr/bin/env bash
-
-set -eou pipefail
-
-help() {
-    echo "$0 [-b <branch>] range [end]"
-    echo "    merges every merge commit present in upstream and missing in <branch> (default: master)."
-    echo "    If the optional [end] commit is provided, only merges up to [end]."
-    echo "    If the optional [-b branch] provided, then ."
-    echo
-    echo "$0 [-b <branch>] select <commit> ... <commit>"
-    echo "    merges every selected merge commit into <branch> (default: master)"
-    echo
-    echo "This tool creates a branch and a script that can be executed to create the"
-    echo "PR automatically. The script requires the github-cli tool (aka gh)."
-    echo ""
-    echo "Tip: \`git log --oneline upstream/master --merges\` shows merge commits."
-    exit 1
-}
-
-REMOTE=upstream
-REMOTE_BRANCH="$REMOTE/master"
-LOCAL_BRANCH="master"
-# Makes sure you have a remote "upstream" that is up-to-date
-setup() {
-    ret=0
-    git fetch "$REMOTE" &> /dev/null || ret="$?"
-    if [ ${ret} == 0 ]; then
-        return
-    fi
-    echo "Adding remote \"$REMOTE\" with URL git@github.com:bitcoin-core/secp256k1.git. Continue with y"
-    read -r yn
-    case $yn in
-        [Yy]* ) ;;
-        * ) exit 1;;
-    esac
-    git remote add "$REMOTE" git@github.com:bitcoin-core/secp256k1.git &> /dev/null
-    git fetch "$REMOTE" &> /dev/null
-}
-
-range() {
-    RANGESTART_COMMIT=$(git merge-base "$REMOTE_BRANCH" "$LOCAL_BRANCH")
-    RANGEEND_COMMIT=$(git rev-parse "$REMOTE_BRANCH")
-    if [ "$#" = 1 ]; then
-        RANGEEND_COMMIT=$1
-    fi
-
-    COMMITS=$(git --no-pager log --oneline --merges "$RANGESTART_COMMIT".."$RANGEEND_COMMIT")
-    COMMITS=$(echo "$COMMITS" | tac | awk '{ print $1 }' ORS=' ')
-    echo "Merging $COMMITS. Continue with y"
-    read -r yn
-    case $yn in
-        [Yy]* ) ;;
-        * ) exit 1;;
-    esac
-}
-
-# Process -b <branch> argument
-while getopts "b:" opt; do
-  case $opt in
-    b)
-      LOCAL_BRANCH=$OPTARG
-      ;;
-    \?)
-      echo "Invalid option: -$OPTARG" >&2
-      ;;
-  esac
-done
-
-# Shift off the processed options
-shift $((OPTIND -1))
-
-if [ "$#" -lt 1 ]; then
-    help
-fi
-
-case $1 in
-    range)
-        shift
-        setup
-        range "$@"
-        REPRODUCE_COMMAND="$0 -b $LOCAL_BRANCH range $RANGEEND_COMMIT"
-        ;;
-    select)
-        shift
-        setup
-        COMMITS=$*
-        REPRODUCE_COMMAND="$0 -b $LOCAL_BRANCH select $@"
-        ;;
-    help)
-        help
-        ;;
-    *)
-        help
-esac
-
-TITLE="Upstream PRs"
-BODY=""
-for COMMIT in $COMMITS
-do
-    PRNUM=$(git log -1 "$COMMIT" --pretty=format:%s | sed s/'Merge \(bitcoin-core\/secp256k1\)\?#\([0-9]*\).*'/'\2'/)
-    TITLE="$TITLE $PRNUM,"
-    BODY=$(printf "%s\n%s" "$BODY" "$(git log -1 "$COMMIT" --pretty=format:%s | sed s/'Merge \(bitcoin-core\/secp256k1\)\?#\([0-9]*\)'/'[bitcoin-core\/secp256k1#\2]'/)")
-done
-# Remove trailing ","
-TITLE=${TITLE%?}
-BODY=$(printf "%s\n\n%s\n%s" "$BODY" "This PR can be recreated with \`$REPRODUCE_COMMAND\`." "Tip: Use \`git show --remerge-diff\` to show the changes manually added to the merge commit.")
-
-echo "-----------------------------------"
-echo "$TITLE"
-echo "-----------------------------------"
-echo "$BODY"
-echo "-----------------------------------"
-# Create branch from PR commit and create PR
-git checkout "$LOCAL_BRANCH"
-git pull --autostash
-git checkout -b temp-merge-"$PRNUM"
-
-# Escape single quote
-# ' -> '\''
-quote() {
-    local quoted=${1//\'/\'\\\'\'}
-    printf "%s" "$quoted"
-}
-TITLE=$(quote "$TITLE")
-BODY=$(quote "$BODY")
-
-BASEDIR=$(dirname "$0")
-FNAME="$BASEDIR/gh-pr-create.sh"
-cat <<EOT > "$FNAME"
-#!/bin/sh
-gh pr create -t '$TITLE' -b '$BODY' --web
-# Remove temporary branch
-git checkout "$LOCAL_BRANCH"
-git branch -D temp-merge-"$PRNUM"
-EOT
-chmod +x "$FNAME"
-echo Run "$FNAME" after solving the merge conflicts
-
-git merge --no-edit -m "Merge commits '$COMMITS' into temp-merge-$PRNUM" $COMMITS

doc/ellswift.md

@@ -1,483 +0,0 @@
-# ElligatorSwift for secp256k1 explained
-
-In this document we explain how the `ellswift` module implementation is related to the
-construction in the
-["SwiftEC: Shallue–van de Woestijne Indifferentiable Function To Elliptic Curves"](https://eprint.iacr.org/2022/759)
-paper by Jorge Chávez-Saab, Francisco Rodríguez-Henríquez, and Mehdi Tibouchi.
-
-* [1. Introduction](#1-introduction)
-* [2. The decoding function](#2-the-decoding-function)
-  + [2.1 Decoding for `secp256k1`](#21-decoding-for-secp256k1)
-* [3. The encoding function](#3-the-encoding-function)
-  + [3.1 Switching to *v, w* coordinates](#31-switching-to-v-w-coordinates)
-  + [3.2 Avoiding computing all inverses](#32-avoiding-computing-all-inverses)
-  + [3.3 Finding the inverse](#33-finding-the-inverse)
-  + [3.4 Dealing with special cases](#34-dealing-with-special-cases)
-  + [3.5 Encoding for `secp256k1`](#35-encoding-for-secp256k1)
-* [4. Encoding and decoding full *(x, y)* coordinates](#4-encoding-and-decoding-full-x-y-coordinates)
-  + [4.1 Full *(x, y)* coordinates for `secp256k1`](#41-full-x-y-coordinates-for-secp256k1)
-
-## 1. Introduction
-
-The `ellswift` module effectively introduces a new 64-byte public key format, with the property
-that (uniformly random) public keys can be encoded as 64-byte arrays which are computationally
-indistinguishable from uniform byte arrays. The module provides functions to convert public keys
-from and to this format, as well as convenience functions for key generation and ECDH that operate
-directly on ellswift-encoded keys.
-
-The encoding consists of the concatenation of two (32-byte big endian) encoded field elements $u$
-and $t.$ Together they encode an x-coordinate on the curve $x$, or (see further) a full point $(x, y)$ on
-the curve.
-
-**Decoding** consists of decoding the field elements $u$ and $t$ (values above the field size $p$
-are taken modulo $p$), and then evaluating $F_u(t)$, which for every $u$ and $t$ results in a valid
-x-coordinate on the curve. The functions $F_u$ will be defined in [Section 2](#2-the-decoding-function).
-
-**Encoding** a given $x$ coordinate is conceptually done as follows:
-* Loop:
-  * Pick a uniformly random field element $u.$
-  * Compute the set $L = F_u^{-1}(x)$ of $t$ values for which $F_u(t) = x$, which may have up to *8* elements.
-  * With probability $1 - \dfrac{\\#L}{8}$, restart the loop.
-  * Select a uniformly random $t \in L$ and return $(u, t).$
-
-This is the *ElligatorSwift* algorithm, here given for just x-coordinates. An extension to full
-$(x, y)$ points will be given in [Section 4](#4-encoding-and-decoding-full-x-y-coordinates).
-The algorithm finds a uniformly random $(u, t)$ among (almost all) those
-for which $F_u(t) = x.$ Section 3.2 in the paper proves that the number of such encodings for
-almost all x-coordinates on the curve (all but at most 39) is close to two times the field size
-(specifically, it lies in the range $2q \pm (22\sqrt{q} + O(1))$, where $q$ is the size of the field).
-
-## 2. The decoding function
-
-First some definitions:
-* $\mathbb{F}$ is the finite field of size $q$, of characteristic 5 or more, and $q \equiv 1 \mod 3.$
-  * For `secp256k1`, $q = 2^{256} - 2^{32} - 977$, which satisfies that requirement.
-* Let $E$ be the elliptic curve of points $(x, y) \in \mathbb{F}^2$ for which $y^2 = x^3 + ax + b$, with $a$ and $b$
-  public constants, for which $\Delta_E = -16(4a^3 + 27b^2)$ is a square, and at least one of $(-b \pm \sqrt{-3 \Delta_E} / 36)/2$ is a square.
-  This implies that the order of $E$ is either odd, or a multiple of *4*.
-  If $a=0$, this condition is always fulfilled.
-  * For `secp256k1`, $a=0$ and $b=7.$
-* Let the function $g(x) = x^3 + ax + b$, so the $E$ curve equation is also $y^2 = g(x).$
-* Let the function $h(x) = 3x^3 + 4a.$
-* Define $V$ as the set of solutions $(x_1, x_2, x_3, z)$ to $z^2 = g(x_1)g(x_2)g(x_3).$
-* Define $S_u$ as the set of solutions $(X, Y)$ to $X^2 + h(u)Y^2 = -g(u)$ and $Y \neq 0.$
-* $P_u$ is a function from $\mathbb{F}$ to $S_u$ that will be defined below.
-* $\psi_u$ is a function from $S_u$ to $V$ that will be defined below.
-
-**Note**: In the paper:
-* $F_u$ corresponds to $F_{0,u}$ there.
-* $P_u(t)$ is called $P$ there.
-* All $S_u$ sets together correspond to $S$ there.
-* All $\psi_u$ functions together (operating on elements of $S$) correspond to $\psi$ there.
-
-Note that for $V$, the left hand side of the equation $z^2$ is square, and thus the right
-hand must also be square. As multiplying non-squares results in a square in $\mathbb{F}$,
-out of the three right-hand side factors an even number must be non-squares.
-This implies that exactly *1* or exactly *3* out of
-$\\{g(x_1), g(x_2), g(x_3)\\}$ must be square, and thus that for any $(x_1,x_2,x_3,z) \in V$,
-at least one of $\\{x_1, x_2, x_3\\}$ must be a valid x-coordinate on $E.$ There is one exception
-to this, namely when $z=0$, but even then one of the three values is a valid x-coordinate.
-
-**Define** the decoding function $F_u(t)$ as:
-* Let $(x_1, x_2, x_3, z) = \psi_u(P_u(t)).$
-* Return the first element $x$ of $(x_3, x_2, x_1)$ which is a valid x-coordinate on $E$ (i.e., $g(x)$ is square).
-
-$P_u(t) = (X(u, t), Y(u, t))$, where:
-
-$$
-\begin{array}{lcl}
-X(u, t) & = & \left\\{\begin{array}{ll}
-  \dfrac{g(u) - t^2}{2t} & a = 0 \\
-  \dfrac{g(u) + h(u)(Y_0(u) - X_0(u)t)^2}{X_0(u)(1 + h(u)t^2)} & a \neq 0
-\end{array}\right. \\
-Y(u, t) & = & \left\\{\begin{array}{ll}
-  \dfrac{X(u, t) + t}{u \sqrt{-3}} = \dfrac{g(u) + t^2}{2tu\sqrt{-3}} & a = 0 \\
-  Y_0(u) + t(X(u, t) - X_0(u)) & a \neq 0
-\end{array}\right.
-\end{array}
-$$
-
-$P_u(t)$ is defined:
-* For $a=0$, unless:
-  * $u = 0$ or $t = 0$ (division by zero)
-  * $g(u) = -t^2$ (would give $Y=0$).
-* For $a \neq 0$, unless:
-  * $X_0(u) = 0$ or $h(u)t^2 = -1$ (division by zero)
-  * $Y_0(u) (1 - h(u)t^2) = 2X_0(u)t$ (would give $Y=0$).
-
-The functions $X_0(u)$ and $Y_0(u)$ are defined in Appendix A of the paper, and depend on various properties of $E.$
-
-The function $\psi_u$ is the same for all curves: $\psi_u(X, Y) = (x_1, x_2, x_3, z)$, where:
-
-$$
-\begin{array}{lcl}
-  x_1 & = & \dfrac{X}{2Y} - \dfrac{u}{2} && \\
-  x_2 & = & -\dfrac{X}{2Y} - \dfrac{u}{2} && \\
-  x_3 & = & u + 4Y^2 && \\
-  z   & = & \dfrac{g(x_3)}{2Y}(u^2 + ux_1 + x_1^2 + a) = \dfrac{-g(u)g(x_3)}{8Y^3}
-\end{array}
-$$
-
-### 2.1 Decoding for `secp256k1`
-
-Put together and specialized for $a=0$ curves, decoding $(u, t)$ to an x-coordinate is:
-
-**Define** $F_u(t)$ as:
-* Let $X = \dfrac{u^3 + b - t^2}{2t}.$
-* Let $Y = \dfrac{X + t}{u\sqrt{-3}}.$
-* Return the first $x$ in $(u + 4Y^2, \dfrac{-X}{2Y} - \dfrac{u}{2}, \dfrac{X}{2Y} - \dfrac{u}{2})$ for which $g(x)$ is square.
-
-To make sure that every input decodes to a valid x-coordinate, we remap the inputs in case
-$P_u$ is not defined (when $u=0$, $t=0$, or $g(u) = -t^2$):
-
-**Define** $F_u(t)$ as:
-* Let $u'=u$ if $u \neq 0$; $1$ otherwise (guaranteeing $u' \neq 0$).
-* Let $t'=t$ if $t \neq 0$; $1$ otherwise (guaranteeing $t' \neq 0$).
-* Let $t''=t'$ if $g(u') \neq -t'^2$; $2t'$ otherwise (guaranteeing $t'' \neq 0$ and $g(u') \neq -t''^2$).
-* Let $X = \dfrac{u'^3 + b - t''^2}{2t''}.$
-* Let $Y = \dfrac{X + t''}{u'\sqrt{-3}}.$
-* Return the first $x$ in $(u' + 4Y^2, \dfrac{-X}{2Y} - \dfrac{u'}{2}, \dfrac{X}{2Y} - \dfrac{u'}{2})$ for which $x^3 + b$ is square.
-
-The choices here are not strictly necessary. Just returning a fixed constant in any of the undefined cases would suffice,
-but the approach here is simple enough and gives fairly uniform output even in these cases.
-
-**Note**: in the paper these conditions result in $\infty$ as output, due to the use of projective coordinates there.
-We wish to avoid the need for callers to deal with this special case.
-
-This is implemented in `secp256k1_ellswift_xswiftec_frac_var` (which decodes to an x-coordinate represented as a fraction), and
-in `secp256k1_ellswift_xswiftec_var` (which outputs the actual x-coordinate).
-
-## 3. The encoding function
-
-To implement $F_u^{-1}(x)$, the function to find the set of inverses $t$ for which $F_u(t) = x$, we have to reverse the process:
-* Find all the $(X, Y) \in S_u$ that could have given rise to $x$, through the $x_1$, $x_2$, or $x_3$ formulas in $\psi_u.$
-* Map those $(X, Y)$ solutions to $t$ values using $P_u^{-1}(X, Y).$
-* For each of the found $t$ values, verify that $F_u(t) = x.$
-* Return the remaining $t$ values.
-
-The function $P_u^{-1}$, which finds $t$ given $(X, Y) \in S_u$, is significantly simpler than $P_u:$
-
-$$
-P_u^{-1}(X, Y) = \left\\{\begin{array}{ll}
-Yu\sqrt{-3} - X & a = 0 \\
-\dfrac{Y-Y_0(u)}{X-X_0(u)} & a \neq 0 \land X \neq X_0(u) \\
-\dfrac{-X_0(u)}{h(u)Y_0(u)} & a \neq 0 \land X = X_0(u) \land Y = Y_0(u)
-\end{array}\right.
-$$
-
-The third step above, verifying that $F_u(t) = x$, is necessary because for the $(X, Y)$ values found through the $x_1$ and $x_2$ expressions,
-it is possible that decoding through $\psi_u(X, Y)$ yields a valid $x_3$ on the curve, which would take precedence over the
-$x_1$ or $x_2$ decoding. These $(X, Y)$ solutions must be rejected.
-
-Since we know that exactly one or exactly three out of $\\{x_1, x_2, x_3\\}$ are valid x-coordinates for any $t$,
-the case where either $x_1$ or $x_2$ is valid and in addition also $x_3$ is valid must mean that all three are valid.
-This means that instead of checking whether $x_3$ is on the curve, it is also possible to check whether the other one out of
-$x_1$ and $x_2$ is on the curve. This is significantly simpler, as it turns out.
-
-Observe that $\psi_u$ guarantees that $x_1 + x_2 = -u.$ So given either $x = x_1$ or $x = x_2$, the other one of the two can be computed as
-$-u - x.$ Thus, when encoding $x$ through the $x_1$ or $x_2$ expressions, one can simply check whether $g(-u-x)$ is a square,
-and if so, not include the corresponding $t$ values in the returned set. As this does not need $X$, $Y$, or $t$, this condition can be determined
-before those values are computed.
-
-It is not possible that an encoding found through the $x_1$ expression decodes to a different valid x-coordinate using $x_2$ (which would
-take precedence), for the same reason: if both $x_1$ and $x_2$ decodings were valid, $x_3$ would be valid as well, and thus take
-precedence over both. Because of this, the $g(-u-x)$ being square test for $x_1$ and $x_2$ is the only test necessary to guarantee the found $t$
-values round-trip back to the input $x$ correctly. This is the reason for choosing the $(x_3, x_2, x_1)$ precedence order in the decoder;
-any order which does not place $x_3$ first requires more complicated round-trip checks in the encoder.
-
-### 3.1 Switching to *v, w* coordinates
-
-Before working out the formulas for all this, we switch to different variables for $S_u.$ Let $v = (X/Y - u)/2$, and
-$w = 2Y.$ Or in the other direction, $X = w(u/2 + v)$ and $Y = w/2:$
-* $S_u'$ becomes the set of $(v, w)$ for which $w^2 (u^2 + uv + v^2 + a) = -g(u)$ and $w \neq 0.$
-* For $a=0$ curves, $P_u^{-1}$ can be stated for $(v,w)$ as $P_u^{'-1}(v, w) = w\left(\frac{\sqrt{-3}-1}{2}u - v\right).$
-* $\psi_u$ can be stated for $(v, w)$ as $\psi_u'(v, w) = (x_1, x_2, x_3, z)$, where
-
-$$
-\begin{array}{lcl}
-  x_1 & = & v \\
-  x_2 & = & -u - v \\
-  x_3 & = & u + w^2 \\
-  z   & = & \dfrac{g(x_3)}{w}(u^2 + uv + v^2 + a) = \dfrac{-g(u)g(x_3)}{w^3}
-\end{array}
-$$
-
-We can now write the expressions for finding $(v, w)$ given $x$ explicitly, by solving each of the $\\{x_1, x_2, x_3\\}$
-expressions for $v$ or $w$, and using the $S_u'$ equation to find the other variable:
-* Assuming $x = x_1$, we find $v = x$ and $w = \pm\sqrt{-g(u)/(u^2 + uv + v^2 + a)}$ (two solutions).
-* Assuming $x = x_2$, we find $v = -u-x$ and $w = \pm\sqrt{-g(u)/(u^2 + uv + v^2 + a)}$ (two solutions).
-* Assuming $x = x_3$, we find $w = \pm\sqrt{x-u}$ and $v = -u/2 \pm \sqrt{-w^2(4g(u) + w^2h(u))}/(2w^2)$ (four solutions).
-
-### 3.2 Avoiding computing all inverses
-
-The *ElligatorSwift* algorithm as stated in Section 1 requires the computation of $L = F_u^{-1}(x)$ (the
-set of all $t$ such that $(u, t)$ decode to $x$) in full. This is unnecessary.
-
-Observe that the procedure of restarting with probability $(1 - \frac{\\#L}{8})$ and otherwise returning a
-uniformly random element from $L$ is actually equivalent to always padding $L$ with $\bot$ values up to length 8,
-picking a uniformly random element from that, restarting whenever $\bot$ is picked:
-
-**Define** *ElligatorSwift(x)* as:
-* Loop:
-  * Pick a uniformly random field element $u.$
-  * Compute the set $L = F_u^{-1}(x).$
-  * Let $T$ be the 8-element vector consisting of the elements of $L$, plus $8 - \\#L$ times $\\{\bot\\}.$
-  * Select a uniformly random $t \in T.$
-  * If $t \neq \bot$, return $(u, t)$; restart loop otherwise.
-
-Now notice that the order of elements in $T$ does not matter, as all we do is pick a uniformly
-random element in it, so we do not need to have all $\bot$ values at the end.
-As we have 8 distinct formulas for finding $(v, w)$ (taking the variants due to $\pm$ into account),
-we can associate every index in $T$ with exactly one of those formulas, making sure that:
-* Formulas that yield no solutions (due to division by zero or non-existing square roots) or invalid solutions are made to return $\bot.$
-* For the $x_1$ and $x_2$ cases, if $g(-u-x)$ is a square, $\bot$ is returned instead (the round-trip check).
-* In case multiple formulas would return the same non- $\bot$ result, all but one of those must be turned into $\bot$ to avoid biasing those.
-
-The last condition above only occurs with negligible probability for cryptographically-sized curves, but is interesting
-to take into account as it allows exhaustive testing in small groups. See [Section 3.4](#34-dealing-with-special-cases)
-for an analysis of all the negligible cases.
-
-If we define $T = (G_{0,u}(x), G_{1,u}(x), \ldots, G_{7,u}(x))$, with each $G_{i,u}$ matching one of the formulas,
-the loop can be simplified to only compute one of the inverses instead of all of them:
-
-**Define** *ElligatorSwift(x)* as:
-* Loop:
-  * Pick a uniformly random field element $u.$
-  * Pick a uniformly random integer $c$ in $[0,8).$
-  * Let $t = G_{c,u}(x).$
-  * If $t \neq \bot$, return $(u, t)$; restart loop otherwise.
-
-This is implemented in `secp256k1_ellswift_xelligatorswift_var`.
-
-### 3.3 Finding the inverse
-
-To implement $G_{c,u}$, we map $c=0$ to the $x_1$ formula, $c=1$ to the $x_2$ formula, and $c=2$ and $c=3$ to the $x_3$ formula.
-Those are then repeated as $c=4$ through $c=7$ for the other sign of $w$ (noting that in each formula, $w$ is a square root of some expression).
-Ignoring the negligible cases, we get:
-
-**Define** $G_{c,u}(x)$ as:
-* If $c \in \\{0, 1, 4, 5\\}$ (for $x_1$ and $x_2$ formulas):
-  * If $g(-u-x)$ is square, return $\bot$ (as $x_3$ would be valid and take precedence).
-  * If $c \in \\{0, 4\\}$ (the $x_1$ formula) let $v = x$, otherwise let $v = -u-x$ (the $x_2$ formula)
-  * Let $s = -g(u)/(u^2 + uv + v^2 + a)$ (using $s = w^2$ in what follows).
-* Otherwise, when $c \in \\{2, 3, 6, 7\\}$ (for $x_3$ formulas):
-  * Let $s = x-u.$
-  * Let $r = \sqrt{-s(4g(u) + sh(u))}.$
-  * Let $v = (r/s - u)/2$ if $c \in \\{3, 7\\}$; $(-r/s - u)/2$ otherwise.
-* Let $w = \sqrt{s}.$
-* Depending on $c:$
-  * If $c \in \\{0, 1, 2, 3\\}:$ return $P_u^{'-1}(v, w).$
-  * If $c \in \\{4, 5, 6, 7\\}:$ return $P_u^{'-1}(v, -w).$
-
-Whenever a square root of a non-square is taken, $\bot$ is returned; for both square roots this happens with roughly
-50% on random inputs. Similarly, when a division by 0 would occur, $\bot$ is returned as well; this will only happen
-with negligible probability. A division by 0 in the first branch in fact cannot occur at all, because $u^2 + uv + v^2 + a = 0$
-implies $g(-u-x) = g(x)$ which would mean the $g(-u-x)$ is square condition has triggered
-and $\bot$ would have been returned already.
-
-**Note**: In the paper, the $case$ variable corresponds roughly to the $c$ above, but only takes on 4 possible values (1 to 4).
-The conditional negation of $w$ at the end is done randomly, which is equivalent, but makes testing harder. We choose to
-have the $G_{c,u}$ be deterministic, and capture all choices in $c.$
-
-Now observe that the $c \in \\{1, 5\\}$ and $c \in \\{3, 7\\}$ conditions effectively perform the same $v \rightarrow -u-v$
-transformation. Furthermore, that transformation has no effect on $s$ in the first branch
-as $u^2 + ux + x^2 + a = u^2 + u(-u-x) + (-u-x)^2 + a.$ Thus we can extract it out and move it down:
-
-**Define** $G_{c,u}(x)$ as:
-* If $c \in \\{0, 1, 4, 5\\}:$
-  * If $g(-u-x)$ is square, return $\bot.$
-  * Let $s = -g(u)/(u^2 + ux + x^2 + a).$
-  * Let $v = x.$
-* Otherwise, when $c \in \\{2, 3, 6, 7\\}:$
-  * Let $s = x-u.$
-  * Let $r = \sqrt{-s(4g(u) + sh(u))}.$
-  * Let $v = (r/s - u)/2.$
-* Let $w = \sqrt{s}.$
-* Depending on $c:$
-  * If $c \in \\{0, 2\\}:$ return $P_u^{'-1}(v, w).$
-  * If $c \in \\{1, 3\\}:$ return $P_u^{'-1}(-u-v, w).$
-  * If $c \in \\{4, 6\\}:$ return $P_u^{'-1}(v, -w).$
-  * If $c \in \\{5, 7\\}:$ return $P_u^{'-1}(-u-v, -w).$
-
-This shows there will always be exactly 0, 4, or 8 $t$ values for a given $(u, x)$ input.
-There can be 0, 1, or 2 $(v, w)$ pairs before invoking $P_u^{'-1}$, and each results in 4 distinct $t$ values.
-
-### 3.4 Dealing with special cases
-
-As mentioned before there are a few cases to deal with which only happen in a negligibly small subset of inputs.
-For cryptographically sized fields, if only random inputs are going to be considered, it is unnecessary to deal with these. Still, for completeness
-we analyse them here. They generally fall into two categories: cases in which the encoder would produce $t$ values that
-do not decode back to $x$ (or at least cannot guarantee that they do), and cases in which the encoder might produce the same
-$t$ value for multiple $c$ inputs (thereby biasing that encoding):
-
-* In the branch for $x_1$ and $x_2$ (where $c \in \\{0, 1, 4, 5\\}$):
-  * When $g(u) = 0$, we would have $s=w=Y=0$, which is not on $S_u.$ This is only possible on even-ordered curves.
-    Excluding this also removes the one condition under which the simplified check for $x_3$ on the curve
-    fails (namely when $g(x_1)=g(x_2)=0$ but $g(x_3)$ is not square).
-    This does exclude some valid encodings: when both $g(u)=0$ and $u^2+ux+x^2+a=0$ (also implying $g(x)=0$),
-    the $S_u'$ equation degenerates to $0 = 0$, and many valid $t$ values may exist. Yet, these cannot be targeted uniformly by the
-    encoder anyway as there will generally be more than 8.
-  * When $g(x) = 0$, the same $t$ would be produced as in the $x_3$ branch (where $c \in \\{2, 3, 6, 7\\}$) which we give precedence
-    as it can deal with $g(u)=0$.
-    This is again only possible on even-ordered curves.
-* In the branch for $x_3$ (where $c \in \\{2, 3, 6, 7\\}$):
-  * When $s=0$, a division by zero would occur.
-  * When $v = -u-v$ and $c \in \\{3, 7\\}$, the same $t$ would be returned as in the $c \in \\{2, 6\\}$ cases.
-    It is equivalent to checking whether $r=0$.
-    This cannot occur in the $x_1$ or $x_2$ branches, as it would trigger the $g(-u-x)$ is square condition.
-    A similar concern for $w = -w$ does not exist, as $w=0$ is already impossible in both branches: in the first
-    it requires $g(u)=0$ which is already outlawed on even-ordered curves and impossible on others; in the second it would trigger division by zero.
-* Curve-specific special cases also exist that need to be rejected, because they result in $(u,t)$ which is invalid to the decoder, or because of division by zero in the encoder:
-  * For $a=0$ curves, when $u=0$ or when $t=0$. The latter can only be reached by the encoder when $g(u)=0$, which requires an even-ordered curve.
-  * For $a \neq 0$ curves, when $X_0(u)=0$, when $h(u)t^2 = -1$, or when $w(u + 2v) = 2X_0(u)$ while also either $w \neq 2Y_0(u)$ or $h(u)=0$.
-
-**Define** a version of $G_{c,u}(x)$ which deals with all these cases:
-* If $a=0$ and $u=0$, return $\bot.$
-* If $a \neq 0$ and $X_0(u)=0$, return $\bot.$
-* If $c \in \\{0, 1, 4, 5\\}:$
-  * If $g(u) = 0$ or $g(x) = 0$, return $\bot$ (even curves only).
-  * If $g(-u-x)$ is square, return $\bot.$
-  * Let $s = -g(u)/(u^2 + ux + x^2 + a)$ (cannot cause division by zero).
-  * Let $v = x.$
-* Otherwise, when $c \in \\{2, 3, 6, 7\\}:$
-  * Let $s = x-u.$
-  * Let $r = \sqrt{-s(4g(u) + sh(u))}$; return $\bot$ if not square.
-  * If $c \in \\{3, 7\\}$ and $r=0$, return $\bot.$
-  * If $s = 0$, return $\bot.$
-  * Let $v = (r/s - u)/2.$
-* Let $w = \sqrt{s}$; return $\bot$ if not square.
-* If $a \neq 0$ and $w(u+2v) = 2X_0(u)$ and either $w \neq 2Y_0(u)$ or $h(u) = 0$, return $\bot.$
-* Depending on $c:$
-  * If $c \in \\{0, 2\\}$, let $t = P_u^{'-1}(v, w).$
-  * If $c \in \\{1, 3\\}$, let $t = P_u^{'-1}(-u-v, w).$
-  * If $c \in \\{4, 6\\}$, let $t = P_u^{'-1}(v, -w).$
-  * If $c \in \\{5, 7\\}$, let $t = P_u^{'-1}(-u-v, -w).$
-* If $a=0$ and $t=0$, return $\bot$ (even curves only).
-* If $a \neq 0$ and $h(u)t^2 = -1$, return $\bot.$
-* Return $t.$
-
-Given any $u$, using this algorithm over all $x$ and $c$ values, every $t$ value will be reached exactly once,
-for an $x$ for which $F_u(t) = x$ holds, except for these cases that will not be reached:
-* All cases where $P_u(t)$ is not defined:
-  * For $a=0$ curves, when $u=0$, $t=0$, or $g(u) = -t^2.$
-  * For $a \neq 0$ curves, when $h(u)t^2 = -1$, $X_0(u) = 0$, or $Y_0(u) (1 - h(u) t^2) = 2X_0(u)t.$
-* When $g(u)=0$, the potentially many $t$ values that decode to an $x$ satisfying $g(x)=0$ using the $x_2$ formula. These were excluded by the $g(u)=0$ condition in the $c \in \\{0, 1, 4, 5\\}$ branch.
-
-These cases form a negligible subset of all $(u, t)$ for cryptographically sized curves.
-
-### 3.5 Encoding for `secp256k1`
-
-Specialized for odd-ordered $a=0$ curves:
-
-**Define** $G_{c,u}(x)$ as:
-* If $u=0$, return $\bot.$
-* If $c \in \\{0, 1, 4, 5\\}:$
-  * If $(-u-x)^3 + b$ is square, return $\bot$
-  * Let $s = -(u^3 + b)/(u^2 + ux + x^2)$ (cannot cause division by 0).
-  * Let $v = x.$
-* Otherwise, when $c \in \\{2, 3, 6, 7\\}:$
-  * Let $s = x-u.$
-  * Let $r = \sqrt{-s(4(u^3 + b) + 3su^2)}$; return $\bot$ if not square.
-  * If $c \in \\{3, 7\\}$ and $r=0$, return $\bot.$
-  * If $s = 0$, return $\bot.$
-  * Let $v = (r/s - u)/2.$
-* Let $w = \sqrt{s}$; return $\bot$ if not square.
-* Depending on $c:$
-  * If $c \in \\{0, 2\\}:$ return $w(\frac{\sqrt{-3}-1}{2}u - v).$
-  * If $c \in \\{1, 3\\}:$ return $w(\frac{\sqrt{-3}+1}{2}u + v).$
-  * If $c \in \\{4, 6\\}:$ return $w(\frac{-\sqrt{-3}+1}{2}u + v).$
-  * If $c \in \\{5, 7\\}:$ return $w(\frac{-\sqrt{-3}-1}{2}u - v).$
-
-This is implemented in `secp256k1_ellswift_xswiftec_inv_var`.
-
-And the x-only ElligatorSwift encoding algorithm is still:
-
-**Define** *ElligatorSwift(x)* as:
-* Loop:
-  * Pick a uniformly random field element $u.$
-  * Pick a uniformly random integer $c$ in $[0,8).$
-  * Let $t = G_{c,u}(x).$
-  * If $t \neq \bot$, return $(u, t)$; restart loop otherwise.
-
-Note that this logic does not take the remapped $u=0$, $t=0$, and $g(u) = -t^2$ cases into account; it just avoids them.
-While it is not impossible to make the encoder target them, this would increase the maximum number of $t$ values for a given $(u, x)$
-combination beyond 8, and thereby slow down the ElligatorSwift loop proportionally, for a negligible gain in uniformity.
-
-## 4. Encoding and decoding full *(x, y)* coordinates
-
-So far we have only addressed encoding and decoding x-coordinates, but in some cases an encoding
-for full points with $(x, y)$ coordinates is desirable. It is possible to encode this information
-in $t$ as well.
-
-Note that for any $(X, Y) \in S_u$, $(\pm X, \pm Y)$ are all on $S_u.$ Moreover, all of these are
-mapped to the same x-coordinate. Negating $X$ or negating $Y$ just results in $x_1$ and $x_2$
-being swapped, and does not affect $x_3.$ This will not change the outcome x-coordinate as the order
-of $x_1$ and $x_2$ only matters if both were to be valid, and in that case $x_3$ would be used instead.
-
-Still, these four $(X, Y)$ combinations all correspond to distinct $t$ values, so we can encode
-the sign of the y-coordinate in the sign of $X$ or the sign of $Y.$ They correspond to the
-four distinct $P_u^{'-1}$ calls in the definition of $G_{u,c}.$
-
-**Note**: In the paper, the sign of the y coordinate is encoded in a separately-coded bit.
-
-To encode the sign of $y$ in the sign of $Y:$
-
-**Define** *Decode(u, t)* for full $(x, y)$ as:
-* Let $(X, Y) = P_u(t).$
-* Let $x$ be the first value in $(u + 4Y^2, \frac{-X}{2Y} - \frac{u}{2}, \frac{X}{2Y} - \frac{u}{2})$ for which $g(x)$ is square.
-* Let $y = \sqrt{g(x)}.$
-* If $sign(y) = sign(Y)$, return $(x, y)$; otherwise return $(x, -y).$
-
-And encoding would be done using a $G_{c,u}(x, y)$ function defined as:
-
-**Define** $G_{c,u}(x, y)$ as:
-* If $c \in \\{0, 1\\}:$
-  * If $g(u) = 0$ or $g(x) = 0$, return $\bot$ (even curves only).
-  * If $g(-u-x)$ is square, return $\bot.$
-  * Let $s = -g(u)/(u^2 + ux + x^2 + a)$ (cannot cause division by zero).
-  * Let $v = x.$
-* Otherwise, when $c \in \\{2, 3\\}:$
-  * Let $s = x-u.$
-  * Let $r = \sqrt{-s(4g(u) + sh(u))}$; return $\bot$ if not square.
-  * If $c = 3$ and $r = 0$, return $\bot.$
-  * Let $v = (r/s - u)/2.$
-* Let $w = \sqrt{s}$; return $\bot$ if not square.
-* Let $w' = w$ if $sign(w/2) = sign(y)$; $-w$ otherwise.
-* Depending on $c:$
-  * If $c \in \\{0, 2\\}:$ return $P_u^{'-1}(v, w').$
-  * If $c \in \\{1, 3\\}:$ return $P_u^{'-1}(-u-v, w').$
-
-Note that $c$ now only ranges $[0,4)$, as the sign of $w'$ is decided based on that of $y$, rather than on $c.$
-This change makes some valid encodings unreachable: when $y = 0$ and $sign(Y) \neq sign(0)$.
-
-In the above logic, $sign$ can be implemented in several ways, such as parity of the integer representation
-of the input field element (for prime-sized fields) or the quadratic residuosity (for fields where
-$-1$ is not square). The choice does not matter, as long as it only takes on two possible values, and for $x \neq 0$ it holds that $sign(x) \neq sign(-x)$.
-
-### 4.1 Full *(x, y)* coordinates for `secp256k1`
-
-For $a=0$ curves, there is another option. Note that for those,
-the $P_u(t)$ function translates negations of $t$ to negations of (both) $X$ and $Y.$ Thus, we can use $sign(t)$ to
-encode the y-coordinate directly. Combined with the earlier remapping to guarantee all inputs land on the curve, we get
-as decoder:
-
-**Define** *Decode(u, t)* as:
-* Let $u'=u$ if $u \neq 0$; $1$ otherwise.
-* Let $t'=t$ if $t \neq 0$; $1$ otherwise.
-* Let $t''=t'$ if $u'^3 + b + t'^2 \neq 0$; $2t'$ otherwise.
-* Let $X = \dfrac{u'^3 + b - t''^2}{2t''}.$
-* Let $Y = \dfrac{X + t''}{u'\sqrt{-3}}.$
-* Let $x$ be the first element of $(u' + 4Y^2, \frac{-X}{2Y} - \frac{u'}{2}, \frac{X}{2Y} - \frac{u'}{2})$ for which $g(x)$ is square.
-* Let $y = \sqrt{g(x)}.$
-* Return $(x, y)$ if $sign(y) = sign(t)$; $(x, -y)$ otherwise.
-
-This is implemented in `secp256k1_ellswift_swiftec_var`. The used $sign(x)$ function is the parity of $x$ when represented as in integer in $[0,q).$
-
-The corresponding encoder would invoke the x-only one, but negating the output $t$ if $sign(t) \neq sign(y).$
-
-This is implemented in `secp256k1_ellswift_elligatorswift_var`.
-
-Note that this is only intended for encoding points where both the x-coordinate and y-coordinate are unpredictable. When encoding x-only points
-where the y-coordinate is implicitly even (or implicitly square, or implicitly in $[0,q/2]$), the encoder in
-[Section 3.5](#35-encoding-for-secp256k1) must be used, or a bias is reintroduced that undoes all the benefit of using ElligatorSwift
-in the first place.

doc/musig-spec.mediawiki

@@ -1 +0,0 @@
-This document was moved to [https://github.com/jonasnick/bips/blob/musig2/bip-musig2.mediawiki https://github.com/jonasnick/bips/blob/musig2/bip-musig2.mediawiki].

doc/release-process.md

@@ -1,93 +0,0 @@
-# Release process
-
-This document outlines the process for releasing versions of the form `$MAJOR.$MINOR.$PATCH`.
-
-We distinguish between two types of releases: *regular* and *maintenance* releases.
-Regular releases are releases of a new major or minor version as well as patches of the most recent release.
-Maintenance releases, on the other hand, are required for patches of older releases.
-
-You should coordinate with the other maintainers on the release date, if possible.
-This date will be part of the release entry in [CHANGELOG.md](../CHANGELOG.md) and it should match the dates of the remaining steps in the release process (including the date of the tag and the GitHub release).
-It is best if the maintainers are present during the release, so they can help ensure that the process is followed correctly and, in the case of a regular release, they are aware that they should not modify the master branch between merging the PR in step 1 and the PR in step 3.
-
-This process also assumes that there will be no minor releases for old major releases.
-
-We aim to cut a regular release every 3-4 months, approximately twice as frequent as major Bitcoin Core releases. Every second release should be published one month before the feature freeze of the next major Bitcoin Core release, allowing sufficient time to update the library in Core.
-
-## Sanity checks
-Perform these checks when reviewing the release PR (see below):
-
-1. Ensure `make distcheck` doesn't fail.
-   ```shell
-   ./autogen.sh && ./configure --enable-dev-mode && make distcheck
-   ```
-2. Check installation with autotools:
-   ```shell
-   dir=$(mktemp -d)
-   ./autogen.sh && ./configure --prefix=$dir && make clean && make install && ls -RlAh $dir
-   gcc -o ecdsa examples/ecdsa.c $(PKG_CONFIG_PATH=$dir/lib/pkgconfig pkg-config --cflags --libs libsecp256k1) -Wl,-rpath,"$dir/lib" && ./ecdsa
-   ```
-3. Check installation with CMake:
-   ```shell
-   dir=$(mktemp -d)
-   build=$(mktemp -d)
-   cmake -B $build -DCMAKE_INSTALL_PREFIX=$dir && cmake --build $build --target install && ls -RlAh $dir
-   gcc -o ecdsa examples/ecdsa.c -I $dir/include -L $dir/lib*/ -l secp256k1 -Wl,-rpath,"$dir/lib",-rpath,"$dir/lib64" && ./ecdsa
-   ```
-4. Use the [`check-abi.sh`](/tools/check-abi.sh) tool to verify that there are no unexpected ABI incompatibilities and that the version number and the release notes accurately reflect all potential ABI changes. To run this tool, the `abi-dumper` and `abi-compliance-checker` packages are required.
-   ```shell
-   tools/check-abi.sh
-   ```
-
-## Regular release
-
-1. Open a PR to the master branch with a commit (using message `"release: prepare for $MAJOR.$MINOR.$PATCH"`, for example) that
-   * finalizes the release notes in [CHANGELOG.md](../CHANGELOG.md) by
-       * adding a section for the release (make sure that the version number is a link to a diff between the previous and new version),
-       * removing the `[Unreleased]` section header, and
-       * including an entry for `### ABI Compatibility` if it doesn't exist,
-   * sets `_PKG_VERSION_IS_RELEASE` to `true` in `configure.ac`, and,
-   * if this is not a patch release,
-       * updates `_PKG_VERSION_*` and `_LIB_VERSION_*`  in `configure.ac`, and
-       * updates `project(libsecp256k1 VERSION ...)` and `${PROJECT_NAME}_LIB_VERSION_*` in `CMakeLists.txt`.
-2. Perform the [sanity checks](#sanity-checks) on the PR branch.
-3. After the PR is merged, tag the commit, and push the tag:
-   ```
-   RELEASE_COMMIT=<merge commit of step 1>
-   git tag -s v$MAJOR.$MINOR.$PATCH -m "libsecp256k1 $MAJOR.$MINOR.$PATCH" $RELEASE_COMMIT
-   git push git@github.com:bitcoin-core/secp256k1.git v$MAJOR.$MINOR.$PATCH
-   ```
-4. Open a PR to the master branch with a commit (using message `"release cleanup: bump version after $MAJOR.$MINOR.$PATCH"`, for example) that
-   * sets `_PKG_VERSION_IS_RELEASE` to `false` and increments `_PKG_VERSION_PATCH` and `_LIB_VERSION_REVISION` in `configure.ac`,
-   * increments the `$PATCH` component of `project(libsecp256k1 VERSION ...)` and `${PROJECT_NAME}_LIB_VERSION_REVISION` in `CMakeLists.txt`, and
-   * adds an `[Unreleased]` section header to the [CHANGELOG.md](../CHANGELOG.md).
-
-   If other maintainers are not present to approve the PR, it can be merged without ACKs.
-5. Create a new GitHub release with a link to the corresponding entry in [CHANGELOG.md](../CHANGELOG.md).
-6. Send an announcement email to the bitcoin-dev mailing list.
-
-## Maintenance release
-
-Note that bug fixes need to be backported only to releases for which no compatible release without the bug exists.
-
-1. If there's no maintenance branch `$MAJOR.$MINOR`, create one:
-   ```
-   git checkout -b $MAJOR.$MINOR v$MAJOR.$MINOR.$((PATCH - 1))
-   git push git@github.com:bitcoin-core/secp256k1.git $MAJOR.$MINOR
-   ```
-2. Open a pull request to the `$MAJOR.$MINOR` branch that
-   * includes the bug fixes,
-   * finalizes the release notes similar to a regular release,
-   * increments `_PKG_VERSION_PATCH` and `_LIB_VERSION_REVISION` in `configure.ac`
-     and the `$PATCH` component of `project(libsecp256k1 VERSION ...)` and `${PROJECT_NAME}_LIB_VERSION_REVISION` in `CMakeLists.txt`
-     (with commit message `"release: bump versions for $MAJOR.$MINOR.$PATCH"`, for example).
-3. Perform the [sanity checks](#sanity-checks) on the PR branch.
-4. After the PRs are merged, update the release branch, tag the commit, and push the tag:
-   ```
-   git checkout $MAJOR.$MINOR && git pull
-   git tag -s v$MAJOR.$MINOR.$PATCH -m "libsecp256k1 $MAJOR.$MINOR.$PATCH"
-   git push git@github.com:bitcoin-core/secp256k1.git v$MAJOR.$MINOR.$PATCH
-   ```
-6. Create a new GitHub release with a link to the corresponding entry in [CHANGELOG.md](../CHANGELOG.md).
-7. Send an announcement email to the bitcoin-dev mailing list.
-8. Open PR to the master branch that includes a commit (with commit message `"release notes: add $MAJOR.$MINOR.$PATCH"`, for example) that adds release notes to [CHANGELOG.md](../CHANGELOG.md).

doc/safegcd_implementation.md

@@ -1,819 +0,0 @@
-# The safegcd implementation in libsecp256k1 explained
-
-This document explains the modular inverse and Jacobi symbol implementations in the `src/modinv*.h` files.
-It is based on the paper
-["Fast constant-time gcd computation and modular inversion"](https://gcd.cr.yp.to/papers.html#safegcd)
-by Daniel J. Bernstein and Bo-Yin Yang. The references below are for the Date: 2019.04.13 version.
-
-The actual implementation is in C of course, but for demonstration purposes Python3 is used here.
-Most implementation aspects and optimizations are explained, except those that depend on the specific
-number representation used in the C code.
-
-## 1. Computing the Greatest Common Divisor (GCD) using divsteps
-
-The algorithm from the paper (section 11), at a very high level, is this:
-
-```python
-def gcd(f, g):
-    """Compute the GCD of an odd integer f and another integer g."""
-    assert f & 1  # require f to be odd
-    delta = 1     # additional state variable
-    while g != 0:
-        assert f & 1  # f will be odd in every iteration
-        if delta > 0 and g & 1:
-            delta, f, g = 1 - delta, g, (g - f) // 2
-        elif g & 1:
-            delta, f, g = 1 + delta, f, (g + f) // 2
-        else:
-            delta, f, g = 1 + delta, f, (g    ) // 2
-    return abs(f)
-```
-
-It computes the greatest common divisor of an odd integer *f* and any integer *g*. Its inner loop
-keeps rewriting the variables *f* and *g* alongside a state variable *δ* that starts at *1*, until
-*g=0* is reached. At that point, *|f|* gives the GCD. Each of the transitions in the loop is called a
-"division step" (referred to as divstep in what follows).
-
-For example, *gcd(21, 14)* would be computed as:
-- Start with *δ=1 f=21 g=14*
-- Take the third branch: *δ=2 f=21 g=7*
-- Take the first branch: *δ=-1 f=7 g=-7*
-- Take the second branch: *δ=0 f=7 g=0*
-- The answer *|f| = 7*.
-
-Why it works:
-- Divsteps can be decomposed into two steps (see paragraph 8.2 in the paper):
-  - (a) If *g* is odd, replace *(f,g)* with *(g,g-f)* or (f,g+f), resulting in an even *g*.
-  - (b) Replace *(f,g)* with *(f,g/2)* (where *g* is guaranteed to be even).
-- Neither of those two operations change the GCD:
-  - For (a), assume *gcd(f,g)=c*, then it must be the case that *f=a c* and *g=b c* for some integers *a*
-    and *b*. As *(g,g-f)=(b c,(b-a)c)* and *(f,f+g)=(a c,(a+b)c)*, the result clearly still has
-    common factor *c*. Reasoning in the other direction shows that no common factor can be added by
-    doing so either.
-  - For (b), we know that *f* is odd, so *gcd(f,g)* clearly has no factor *2*, and we can remove
-    it from *g*.
-- The algorithm will eventually converge to *g=0*. This is proven in the paper (see theorem G.3).
-- It follows that eventually we find a final value *f'* for which *gcd(f,g) = gcd(f',0)*. As the
-  gcd of *f'* and *0* is *|f'|* by definition, that is our answer.
-
-Compared to more [traditional GCD algorithms](https://en.wikipedia.org/wiki/Euclidean_algorithm), this one has the property of only ever looking at
-the low-order bits of the variables to decide the next steps, and being easy to make
-constant-time (in more low-level languages than Python). The *δ* parameter is necessary to
-guide the algorithm towards shrinking the numbers' magnitudes without explicitly needing to look
-at high order bits.
-
-Properties that will become important later:
-- Performing more divsteps than needed is not a problem, as *f* does not change anymore after *g=0*.
-- Only even numbers are divided by *2*. This means that when reasoning about it algebraically we
-  do not need to worry about rounding.
-- At every point during the algorithm's execution the next *N* steps only depend on the bottom *N*
-  bits of *f* and *g*, and on *δ*.
-
-
-## 2. From GCDs to modular inverses
-
-We want an algorithm to compute the inverse *a* of *x* modulo *M*, i.e. the number a such that *a x=1
-mod M*. This inverse only exists if the GCD of *x* and *M* is *1*, but that is always the case if *M* is
-prime and *0 < x < M*. In what follows, assume that the modular inverse exists.
-It turns out this inverse can be computed as a side effect of computing the GCD by keeping track
-of how the internal variables can be written as linear combinations of the inputs at every step
-(see the [extended Euclidean algorithm](https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm)).
-Since the GCD is *1*, such an algorithm will compute numbers *a* and *b* such that a&thinsp;x + b&thinsp;M = 1*.
-Taking that expression *mod M* gives *a&thinsp;x mod M = 1*, and we see that *a* is the modular inverse of *x
-mod M*.
-
-A similar approach can be used to calculate modular inverses using the divsteps-based GCD
-algorithm shown above, if the modulus *M* is odd. To do so, compute *gcd(f=M,g=x)*, while keeping
-track of extra variables *d* and *e*, for which at every step *d = f/x (mod M)* and *e = g/x (mod M)*.
-*f/x* here means the number which multiplied with *x* gives *f mod M*. As *f* and *g* are initialized to *M*
-and *x* respectively, *d* and *e* just start off being *0* (*M/x mod M = 0/x mod M = 0*) and *1* (*x/x mod M
-= 1*).
-
-```python
-def div2(M, x):
-    """Helper routine to compute x/2 mod M (where M is odd)."""
-    assert M & 1
-    if x & 1: # If x is odd, make it even by adding M.
-        x += M
-    # x must be even now, so a clean division by 2 is possible.
-    return x // 2
-
-def modinv(M, x):
-    """Compute the inverse of x mod M (given that it exists, and M is odd)."""
-    assert M & 1
-    delta, f, g, d, e = 1, M, x, 0, 1
-    while g != 0:
-        # Note that while division by two for f and g is only ever done on even inputs, this is
-        # not true for d and e, so we need the div2 helper function.
-        if delta > 0 and g & 1:
-            delta, f, g, d, e = 1 - delta, g, (g - f) // 2, e, div2(M, e - d)
-        elif g & 1:
-            delta, f, g, d, e = 1 + delta, f, (g + f) // 2, d, div2(M, e + d)
-        else:
-            delta, f, g, d, e = 1 + delta, f, (g    ) // 2, d, div2(M, e    )
-        # Verify that the invariants d=f/x mod M, e=g/x mod M are maintained.
-        assert f % M == (d * x) % M
-        assert g % M == (e * x) % M
-    assert f == 1 or f == -1  # |f| is the GCD, it must be 1
-    # Because of invariant d = f/x (mod M), 1/x = d/f (mod M). As |f|=1, d/f = d*f.
-    return (d * f) % M
-```
-
-Also note that this approach to track *d* and *e* throughout the computation to determine the inverse
-is different from the paper. There (see paragraph 12.1 in the paper) a transition matrix for the
-entire computation is determined (see section 3 below) and the inverse is computed from that.
-The approach here avoids the need for 2x2 matrix multiplications of various sizes, and appears to
-be faster at the level of optimization we're able to do in C.
-
-
-## 3. Batching multiple divsteps
-
-Every divstep can be expressed as a matrix multiplication, applying a transition matrix *(1/2 t)*
-to both vectors *[f, g]* and *[d, e]* (see paragraph 8.1 in the paper):
-
-```
-  t = [ u,  v ]
-      [ q,  r ]
-
-  [ out_f ] = (1/2 * t) * [ in_f ]
-  [ out_g ] =             [ in_g ]
-
-  [ out_d ] = (1/2 * t) * [ in_d ]  (mod M)
-  [ out_e ]               [ in_e ]
-```
-
-where *(u, v, q, r)* is *(0, 2, -1, 1)*, *(2, 0, 1, 1)*, or *(2, 0, 0, 1)*, depending on which branch is
-taken. As above, the resulting *f* and *g* are always integers.
-
-Performing multiple divsteps corresponds to a multiplication with the product of all the
-individual divsteps' transition matrices. As each transition matrix consists of integers
-divided by *2*, the product of these matrices will consist of integers divided by *2<sup>N</sup>* (see also
-theorem 9.2 in the paper). These divisions are expensive when updating *d* and *e*, so we delay
-them: we compute the integer coefficients of the combined transition matrix scaled by *2<sup>N</sup>*, and
-do one division by *2<sup>N</sup>* as a final step:
-
-```python
-def divsteps_n_matrix(delta, f, g):
-    """Compute delta and transition matrix t after N divsteps (multiplied by 2^N)."""
-    u, v, q, r = 1, 0, 0, 1 # start with identity matrix
-    for _ in range(N):
-        if delta > 0 and g & 1:
-            delta, f, g, u, v, q, r = 1 - delta, g, (g - f) // 2, 2*q, 2*r, q-u, r-v
-        elif g & 1:
-            delta, f, g, u, v, q, r = 1 + delta, f, (g + f) // 2, 2*u, 2*v, q+u, r+v
-        else:
-            delta, f, g, u, v, q, r = 1 + delta, f, (g    ) // 2, 2*u, 2*v, q  , r
-    return delta, (u, v, q, r)
-```
-
-As the branches in the divsteps are completely determined by the bottom *N* bits of *f* and *g*, this
-function to compute the transition matrix only needs to see those bottom bits. Furthermore all
-intermediate results and outputs fit in *(N+1)*-bit numbers (unsigned for *f* and *g*; signed for *u*, *v*,
-*q*, and *r*) (see also paragraph 8.3 in the paper). This means that an implementation using 64-bit
-integers could set *N=62* and compute the full transition matrix for 62 steps at once without any
-big integer arithmetic at all. This is the reason why this algorithm is efficient: it only needs
-to update the full-size *f*, *g*, *d*, and *e* numbers once every *N* steps.
-
-We still need functions to compute:
-
-```
-  [ out_f ] = (1/2^N * [ u,  v ]) * [ in_f ]
-  [ out_g ]   (        [ q,  r ])   [ in_g ]
-
-  [ out_d ] = (1/2^N * [ u,  v ]) * [ in_d ]  (mod M)
-  [ out_e ]   (        [ q,  r ])   [ in_e ]
-```
-
-Because the divsteps transformation only ever divides even numbers by two, the result of *t&thinsp;[f,g]* is always even. When *t* is a composition of *N* divsteps, it follows that the resulting *f*
-and *g* will be multiple of *2<sup>N</sup>*, and division by *2<sup>N</sup>* is simply shifting them down:
-
-```python
-def update_fg(f, g, t):
-    """Multiply matrix t/2^N with [f, g]."""
-    u, v, q, r = t
-    cf, cg = u*f + v*g, q*f + r*g
-    # (t / 2^N) should cleanly apply to [f,g] so the result of t*[f,g] should have N zero
-    # bottom bits.
-    assert cf % 2**N == 0
-    assert cg % 2**N == 0
-    return cf >> N, cg >> N
-```
-
-The same is not true for *d* and *e*, and we need an equivalent of the `div2` function for division by *2<sup>N</sup> mod M*.
-This is easy if we have precomputed *1/M mod 2<sup>N</sup>* (which always exists for odd *M*):
-
-```python
-def div2n(M, Mi, x):
-    """Compute x/2^N mod M, given Mi = 1/M mod 2^N."""
-    assert (M * Mi) % 2**N == 1
-    # Find a factor m such that m*M has the same bottom N bits as x. We want:
-    #     (m * M) mod 2^N = x mod 2^N
-    # <=> m mod 2^N = (x / M) mod 2^N
-    # <=> m mod 2^N = (x * Mi) mod 2^N
-    m = (Mi * x) % 2**N
-    # Subtract that multiple from x, cancelling its bottom N bits.
-    x -= m * M
-    # Now a clean division by 2^N is possible.
-    assert x % 2**N == 0
-    return (x >> N) % M
-
-def update_de(d, e, t, M, Mi):
-    """Multiply matrix t/2^N with [d, e], modulo M."""
-    u, v, q, r = t
-    cd, ce = u*d + v*e, q*d + r*e
-    return div2n(M, Mi, cd), div2n(M, Mi, ce)
-```
-
-With all of those, we can write a version of `modinv` that performs *N* divsteps at once:
-
-```python3
-def modinv(M, Mi, x):
-    """Compute the modular inverse of x mod M, given Mi=1/M mod 2^N."""
-    assert M & 1
-    delta, f, g, d, e = 1, M, x, 0, 1
-    while g != 0:
-        # Compute the delta and transition matrix t for the next N divsteps (this only needs
-        # (N+1)-bit signed integer arithmetic).
-        delta, t = divsteps_n_matrix(delta, f % 2**N, g % 2**N)
-        # Apply the transition matrix t to [f, g]:
-        f, g = update_fg(f, g, t)
-        # Apply the transition matrix t to [d, e]:
-        d, e = update_de(d, e, t, M, Mi)
-    return (d * f) % M
-```
-
-This means that in practice we'll always perform a multiple of *N* divsteps. This is not a problem
-because once *g=0*, further divsteps do not affect *f*, *g*, *d*, or *e* anymore (only *&delta;* keeps
-increasing). For variable time code such excess iterations will be mostly optimized away in later
-sections.
-
-
-## 4. Avoiding modulus operations
-
-So far, there are two places where we compute a remainder of big numbers modulo *M*: at the end of
-`div2n` in every `update_de`, and at the very end of `modinv` after potentially negating *d* due to the
-sign of *f*. These are relatively expensive operations when done generically.
-
-To deal with the modulus operation in `div2n`, we simply stop requiring *d* and *e* to be in range
-*[0,M)* all the time. Let's start by inlining `div2n` into `update_de`, and dropping the modulus
-operation at the end:
-
-```python
-def update_de(d, e, t, M, Mi):
-    """Multiply matrix t/2^N with [d, e] mod M, given Mi=1/M mod 2^N."""
-    u, v, q, r = t
-    cd, ce = u*d + v*e, q*d + r*e
-    # Cancel out bottom N bits of cd and ce.
-    md = -((Mi * cd) % 2**N)
-    me = -((Mi * ce) % 2**N)
-    cd += md * M
-    ce += me * M
-    # And cleanly divide by 2**N.
-    return cd >> N, ce >> N
-```
-
-Let's look at bounds on the ranges of these numbers. It can be shown that *|u|+|v|* and *|q|+|r|*
-never exceed *2<sup>N</sup>* (see paragraph 8.3 in the paper), and thus a multiplication with *t* will have
-outputs whose absolute values are at most *2<sup>N</sup>* times the maximum absolute input value. In case the
-inputs *d* and *e* are in *(-M,M)*, which is certainly true for the initial values *d=0* and *e=1* assuming
-*M > 1*, the multiplication results in numbers in range *(-2<sup>N</sup>M,2<sup>N</sup>M)*. Subtracting less than *2<sup>N</sup>*
-times *M* to cancel out *N* bits brings that up to *(-2<sup>N+1</sup>M,2<sup>N</sup>M)*, and
-dividing by *2<sup>N</sup>* at the end takes it to *(-2M,M)*. Another application of `update_de` would take that
-to *(-3M,2M)*, and so forth. This progressive expansion of the variables' ranges can be
-counteracted by incrementing *d* and *e* by *M* whenever they're negative:
-
-```python
-    ...
-    if d < 0:
-        d += M
-    if e < 0:
-        e += M
-    cd, ce = u*d + v*e, q*d + r*e
-    # Cancel out bottom N bits of cd and ce.
-    ...
-```
-
-With inputs in *(-2M,M)*, they will first be shifted into range *(-M,M)*, which means that the
-output will again be in *(-2M,M)*, and this remains the case regardless of how many `update_de`
-invocations there are. In what follows, we will try to make this more efficient.
-
-Note that increasing *d* by *M* is equal to incrementing *cd* by *u&thinsp;M* and *ce* by *q&thinsp;M*. Similarly,
-increasing *e* by *M* is equal to incrementing *cd* by *v&thinsp;M* and *ce* by *r&thinsp;M*. So we could instead write:
-
-```python
-    ...
-    cd, ce = u*d + v*e, q*d + r*e
-    # Perform the equivalent of incrementing d, e by M when they're negative.
-    if d < 0:
-        cd += u*M
-        ce += q*M
-    if e < 0:
-        cd += v*M
-        ce += r*M
-    # Cancel out bottom N bits of cd and ce.
-    md = -((Mi * cd) % 2**N)
-    me = -((Mi * ce) % 2**N)
-    cd += md * M
-    ce += me * M
-    ...
-```
-
-Now note that we have two steps of corrections to *cd* and *ce* that add multiples of *M*: this
-increment, and the decrement that cancels out bottom bits. The second one depends on the first
-one, but they can still be efficiently combined by only computing the bottom bits of *cd* and *ce*
-at first, and using that to compute the final *md*, *me* values:
-
-```python
-def update_de(d, e, t, M, Mi):
-    """Multiply matrix t/2^N with [d, e], modulo M."""
-    u, v, q, r = t
-    md, me = 0, 0
-    # Compute what multiples of M to add to cd and ce.
-    if d < 0:
-        md += u
-        me += q
-    if e < 0:
-        md += v
-        me += r
-    # Compute bottom N bits of t*[d,e] + M*[md,me].
-    cd, ce = (u*d + v*e + md*M) % 2**N, (q*d + r*e + me*M) % 2**N
-    # Correct md and me such that the bottom N bits of t*[d,e] + M*[md,me] are zero.
-    md -= (Mi * cd) % 2**N
-    me -= (Mi * ce) % 2**N
-    # Do the full computation.
-    cd, ce = u*d + v*e + md*M, q*d + r*e + me*M
-    # And cleanly divide by 2**N.
-    return cd >> N, ce >> N
-```
-
-One last optimization: we can avoid the *md&thinsp;M* and *me&thinsp;M* multiplications in the bottom bits of *cd*
-and *ce* by moving them to the *md* and *me* correction:
-
-```python
-    ...
-    # Compute bottom N bits of t*[d,e].
-    cd, ce = (u*d + v*e) % 2**N, (q*d + r*e) % 2**N
-    # Correct md and me such that the bottom N bits of t*[d,e]+M*[md,me] are zero.
-    # Note that this is not the same as {md = (-Mi * cd) % 2**N} etc. That would also result in N
-    # zero bottom bits, but isn't guaranteed to be a reduction of [0,2^N) compared to the
-    # previous md and me values, and thus would violate our bounds analysis.
-    md -= (Mi*cd + md) % 2**N
-    me -= (Mi*ce + me) % 2**N
-    ...
-```
-
-The resulting function takes *d* and *e* in range *(-2M,M)* as inputs, and outputs values in the same
-range. That also means that the *d* value at the end of `modinv` will be in that range, while we want
-a result in *[0,M)*. To do that, we need a normalization function. It's easy to integrate the
-conditional negation of *d* (based on the sign of *f*) into it as well:
-
-```python
-def normalize(sign, v, M):
-    """Compute sign*v mod M, where v is in range (-2*M,M); output in [0,M)."""
-    assert sign == 1 or sign == -1
-    # v in (-2*M,M)
-    if v < 0:
-        v += M
-    # v in (-M,M). Now multiply v with sign (which can only be 1 or -1).
-    if sign == -1:
-        v = -v
-    # v in (-M,M)
-    if v < 0:
-        v += M
-    # v in [0,M)
-    return v
-```
-
-And calling it in `modinv` is simply:
-
-```python
-   ...
-   return normalize(f, d, M)
-```
-
-
-## 5. Constant-time operation
-
-The primary selling point of the algorithm is fast constant-time operation. What code flow still
-depends on the input data so far?
-
-- the number of iterations of the while *g &ne; 0* loop in `modinv`
-- the branches inside `divsteps_n_matrix`
-- the sign checks in `update_de`
-- the sign checks in `normalize`
-
-To make the while loop in `modinv` constant time it can be replaced with a constant number of
-iterations. The paper proves (Theorem 11.2) that *741* divsteps are sufficient for any *256*-bit
-inputs, and [safegcd-bounds](https://github.com/sipa/safegcd-bounds) shows that the slightly better bound *724* is
-sufficient even. Given that every loop iteration performs *N* divsteps, it will run a total of
-*&lceil;724/N&rceil;* times.
-
-To deal with the branches in `divsteps_n_matrix` we will replace them with constant-time bitwise
-operations (and hope the C compiler isn't smart enough to turn them back into branches; see
-`ctime_tests.c` for automated tests that this isn't the case). To do so, observe that a
-divstep can be written instead as (compare to the inner loop of `gcd` in section 1).
-
-```python
-    x = -f if delta > 0 else f         # set x equal to (input) -f or f
-    if g & 1:
-        g += x                         # set g to (input) g-f or g+f
-        if delta > 0:
-            delta = -delta
-            f += g                     # set f to (input) g (note that g was set to g-f before)
-    delta += 1
-    g >>= 1
-```
-
-To convert the above to bitwise operations, we rely on a trick to negate conditionally: per the
-definition of negative numbers in two's complement, (*-v == ~v + 1*) holds for every number *v*. As
-*-1* in two's complement is all *1* bits, bitflipping can be expressed as xor with *-1*. It follows
-that *-v == (v ^ -1) - (-1)*. Thus, if we have a variable *c* that takes on values *0* or *-1*, then
-*(v ^ c) - c* is *v* if *c=0* and *-v* if *c=-1*.
-
-Using this we can write:
-
-```python
-    x = -f if delta > 0 else f
-```
-
-in constant-time form as:
-
-```python
-    c1 = (-delta) >> 63
-    # Conditionally negate f based on c1:
-    x = (f ^ c1) - c1
-```
-
-To use that trick, we need a helper mask variable *c1* that resolves the condition *&delta;>0* to *-1*
-(if true) or *0* (if false). We compute *c1* using right shifting, which is equivalent to dividing by
-the specified power of *2* and rounding down (in Python, and also in C under the assumption of a typical two's complement system; see
-`assumptions.h` for tests that this is the case). Right shifting by *63* thus maps all
-numbers in range *[-2<sup>63</sup>,0)* to *-1*, and numbers in range *[0,2<sup>63</sup>)* to *0*.
-
-Using the facts that *x&0=0* and *x&(-1)=x* (on two's complement systems again), we can write:
-
-```python
-    if g & 1:
-        g += x
-```
-
-as:
-
-```python
-    # Compute c2=0 if g is even and c2=-1 if g is odd.
-    c2 = -(g & 1)
-    # This masks out x if g is even, and leaves x be if g is odd.
-    g += x & c2
-```
-
-Using the conditional negation trick again we can write:
-
-```python
-    if g & 1:
-        if delta > 0:
-            delta = -delta
-```
-
-as:
-
-```python
-    # Compute c3=-1 if g is odd and delta>0, and 0 otherwise.
-    c3 = c1 & c2
-    # Conditionally negate delta based on c3:
-    delta = (delta ^ c3) - c3
-```
-
-Finally:
-
-```python
-    if g & 1:
-        if delta > 0:
-            f += g
-```
-
-becomes:
-
-```python
-    f += g & c3
-```
-
-It turns out that this can be implemented more efficiently by applying the substitution
-*&eta;=-&delta;*. In this representation, negating *&delta;* corresponds to negating *&eta;*, and incrementing
-*&delta;* corresponds to decrementing *&eta;*. This allows us to remove the negation in the *c1*
-computation:
-
-```python
-    # Compute a mask c1 for eta < 0, and compute the conditional negation x of f:
-    c1 = eta >> 63
-    x = (f ^ c1) - c1
-    # Compute a mask c2 for odd g, and conditionally add x to g:
-    c2 = -(g & 1)
-    g += x & c2
-    # Compute a mask c for (eta < 0) and odd (input) g, and use it to conditionally negate eta,
-    # and add g to f:
-    c3 = c1 & c2
-    eta = (eta ^ c3) - c3
-    f += g & c3
-    # Incrementing delta corresponds to decrementing eta.
-    eta -= 1
-    g >>= 1
-```
-
-A variant of divsteps with better worst-case performance can be used instead: starting *&delta;* at
-*1/2* instead of *1*. This reduces the worst case number of iterations to *590* for *256*-bit inputs
-(which can be shown using convex hull analysis). In this case, the substitution *&zeta;=-(&delta;+1/2)*
-is used instead to keep the variable integral. Incrementing *&delta;* by *1* still translates to
-decrementing *&zeta;* by *1*, but negating *&delta;* now corresponds to going from *&zeta;* to *-(&zeta;+1)*, or
-*~&zeta;*. Doing that conditionally based on *c3* is simply:
-
-```python
-    ...
-    c3 = c1 & c2
-    zeta ^= c3
-    ...
-```
-
-By replacing the loop in `divsteps_n_matrix` with a variant of the divstep code above (extended to
-also apply all *f* operations to *u*, *v* and all *g* operations to *q*, *r*), a constant-time version of
-`divsteps_n_matrix` is obtained. The full code will be in section 7.
-
-These bit fiddling tricks can also be used to make the conditional negations and additions in
-`update_de` and `normalize` constant-time.
-
-
-## 6. Variable-time optimizations
-
-In section 5, we modified the `divsteps_n_matrix` function (and a few others) to be constant time.
-Constant time operations are only necessary when computing modular inverses of secret data. In
-other cases, it slows down calculations unnecessarily. In this section, we will construct a
-faster non-constant time `divsteps_n_matrix` function.
-
-To do so, first consider yet another way of writing the inner loop of divstep operations in
-`gcd` from section 1. This decomposition is also explained in the paper in section 8.2. We use
-the original version with initial *&delta;=1* and *&eta;=-&delta;* here.
-
-```python
-for _ in range(N):
-    if g & 1 and eta < 0:
-        eta, f, g = -eta, g, -f
-    if g & 1:
-        g += f
-    eta -= 1
-    g >>= 1
-```
-
-Whenever *g* is even, the loop only shifts *g* down and decreases *&eta;*. When *g* ends in multiple zero
-bits, these iterations can be consolidated into one step. This requires counting the bottom zero
-bits efficiently, which is possible on most platforms; it is abstracted here as the function
-`count_trailing_zeros`.
-
-```python
-def count_trailing_zeros(v):
-    """
-    When v is zero, consider all N zero bits as "trailing".
-    For a non-zero value v, find z such that v=(d<<z) for some odd d.
-    """
-    if v == 0:
-        return N
-    else:
-        return (v & -v).bit_length() - 1
-
-i = N # divsteps left to do
-while True:
-    # Get rid of all bottom zeros at once. In the first iteration, g may be odd and the following
-    # lines have no effect (until "if eta < 0").
-    zeros = min(i, count_trailing_zeros(g))
-    eta -= zeros
-    g >>= zeros
-    i -= zeros
-    if i == 0:
-        break
-    # We know g is odd now
-    if eta < 0:
-        eta, f, g = -eta, g, -f
-    g += f
-    # g is even now, and the eta decrement and g shift will happen in the next loop.
-```
-
-We can now remove multiple bottom *0* bits from *g* at once, but still need a full iteration whenever
-there is a bottom *1* bit. In what follows, we will get rid of multiple *1* bits simultaneously as
-well.
-
-Observe that as long as *&eta; &geq; 0*, the loop does not modify *f*. Instead, it cancels out bottom
-bits of *g* and shifts them out, and decreases *&eta;* and *i* accordingly - interrupting only when *&eta;*
-becomes negative, or when *i* reaches *0*. Combined, this is equivalent to adding a multiple of *f* to
-*g* to cancel out multiple bottom bits, and then shifting them out.
-
-It is easy to find what that multiple is: we want a number *w* such that *g+w&thinsp;f* has a few bottom
-zero bits. If that number of bits is *L*, we want *g+w&thinsp;f mod 2<sup>L</sup> = 0*, or *w = -g/f mod 2<sup>L</sup>*. Since *f*
-is odd, such a *w* exists for any *L*. *L* cannot be more than *i* steps (as we'd finish the loop before
-doing more) or more than *&eta;+1* steps (as we'd run `eta, f, g = -eta, g, -f` at that point), but
-apart from that, we're only limited by the complexity of computing *w*.
-
-This code demonstrates how to cancel up to 4 bits per step:
-
-```python
-NEGINV16 = [15, 5, 3, 9, 7, 13, 11, 1] # NEGINV16[n//2] = (-n)^-1 mod 16, for odd n
-i = N
-while True:
-    zeros = min(i, count_trailing_zeros(g))
-    eta -= zeros
-    g >>= zeros
-    i -= zeros
-    if i == 0:
-        break
-    # We know g is odd now
-    if eta < 0:
-        eta, f, g = -eta, g, -f
-    # Compute limit on number of bits to cancel
-    limit = min(min(eta + 1, i), 4)
-    # Compute w = -g/f mod 2**limit, using the table value for -1/f mod 2**4. Note that f is
-    # always odd, so its inverse modulo a power of two always exists.
-    w = (g * NEGINV16[(f & 15) // 2]) % (2**limit)
-    # As w = -g/f mod (2**limit), g+w*f mod 2**limit = 0 mod 2**limit.
-    g += w * f
-    assert g % (2**limit) == 0
-    # The next iteration will now shift out at least limit bottom zero bits from g.
-```
-
-By using a bigger table more bits can be cancelled at once. The table can also be implemented
-as a formula. Several formulas are known for computing modular inverses modulo powers of two;
-some can be found in Hacker's Delight second edition by Henry S. Warren, Jr. pages 245-247.
-Here we need the negated modular inverse, which is a simple transformation of those:
-
-- Instead of a 3-bit table:
-  - *-f* or *f ^ 6*
-- Instead of a 4-bit table:
-  - *1 - f(f + 1)*
-  - *-(f + (((f + 1) & 4) << 1))*
-- For larger tables the following technique can be used: if *w=-1/f mod 2<sup>L</sup>*, then *w(w&thinsp;f+2)* is
-  *-1/f mod 2<sup>2L</sup>*. This allows extending the previous formulas (or tables). In particular we
-  have this 6-bit function (based on the 3-bit function above):
-  - *f(f<sup>2</sup> - 2)*
-
-This loop, again extended to also handle *u*, *v*, *q*, and *r* alongside *f* and *g*, placed in
-`divsteps_n_matrix`, gives a significantly faster, but non-constant time version.
-
-
-## 7. Final Python version
-
-All together we need the following functions:
-
-- A way to compute the transition matrix in constant time, using the `divsteps_n_matrix` function
-  from section 2, but with its loop replaced by a variant of the constant-time divstep from
-  section 5, extended to handle *u*, *v*, *q*, *r*:
-
-```python
-def divsteps_n_matrix(zeta, f, g):
-    """Compute zeta and transition matrix t after N divsteps (multiplied by 2^N)."""
-    u, v, q, r = 1, 0, 0, 1 # start with identity matrix
-    for _ in range(N):
-        c1 = zeta >> 63
-        # Compute x, y, z as conditionally-negated versions of f, u, v.
-        x, y, z = (f ^ c1) - c1, (u ^ c1) - c1, (v ^ c1) - c1
-        c2 = -(g & 1)
-        # Conditionally add x, y, z to g, q, r.
-        g, q, r = g + (x & c2), q + (y & c2), r + (z & c2)
-        c1 &= c2                     # reusing c1 here for the earlier c3 variable
-        zeta = (zeta ^ c1) - 1       # inlining the unconditional zeta decrement here
-        # Conditionally add g, q, r to f, u, v.
-        f, u, v = f + (g & c1), u + (q & c1), v + (r & c1)
-        # When shifting g down, don't shift q, r, as we construct a transition matrix multiplied
-        # by 2^N. Instead, shift f's coefficients u and v up.
-        g, u, v = g >> 1, u << 1, v << 1
-    return zeta, (u, v, q, r)
-```
-
-- The functions to update *f* and *g*, and *d* and *e*, from section 2 and section 4, with the constant-time
-  changes to `update_de` from section 5:
-
-```python
-def update_fg(f, g, t):
-    """Multiply matrix t/2^N with [f, g]."""
-    u, v, q, r = t
-    cf, cg = u*f + v*g, q*f + r*g
-    return cf >> N, cg >> N
-
-def update_de(d, e, t, M, Mi):
-    """Multiply matrix t/2^N with [d, e], modulo M."""
-    u, v, q, r = t
-    d_sign, e_sign = d >> 257, e >> 257
-    md, me = (u & d_sign) + (v & e_sign), (q & d_sign) + (r & e_sign)
-    cd, ce = (u*d + v*e) % 2**N, (q*d + r*e) % 2**N
-    md -= (Mi*cd + md) % 2**N
-    me -= (Mi*ce + me) % 2**N
-    cd, ce = u*d + v*e + M*md, q*d + r*e + M*me
-    return cd >> N, ce >> N
-```
-
-- The `normalize` function from section 4, made constant time as well:
-
-```python
-def normalize(sign, v, M):
-    """Compute sign*v mod M, where v in (-2*M,M); output in [0,M)."""
-    v_sign = v >> 257
-    # Conditionally add M to v.
-    v += M & v_sign
-    c = (sign - 1) >> 1
-    # Conditionally negate v.
-    v = (v ^ c) - c
-    v_sign = v >> 257
-    # Conditionally add M to v again.
-    v += M & v_sign
-    return v
-```
-
-- And finally the `modinv` function too, adapted to use *&zeta;* instead of *&delta;*, and using the fixed
-  iteration count from section 5:
-
-```python
-def modinv(M, Mi, x):
-    """Compute the modular inverse of x mod M, given Mi=1/M mod 2^N."""
-    zeta, f, g, d, e = -1, M, x, 0, 1
-    for _ in range((590 + N - 1) // N):
-        zeta, t = divsteps_n_matrix(zeta, f % 2**N, g % 2**N)
-        f, g = update_fg(f, g, t)
-        d, e = update_de(d, e, t, M, Mi)
-    return normalize(f, d, M)
-```
-
-- To get a variable time version, replace the `divsteps_n_matrix` function with one that uses the
-  divsteps loop from section 5, and a `modinv` version that calls it without the fixed iteration
-  count:
-
-```python
-NEGINV16 = [15, 5, 3, 9, 7, 13, 11, 1] # NEGINV16[n//2] = (-n)^-1 mod 16, for odd n
-def divsteps_n_matrix_var(eta, f, g):
-    """Compute eta and transition matrix t after N divsteps (multiplied by 2^N)."""
-    u, v, q, r = 1, 0, 0, 1
-    i = N
-    while True:
-        zeros = min(i, count_trailing_zeros(g))
-        eta, i = eta - zeros, i - zeros
-        g, u, v = g >> zeros, u << zeros, v << zeros
-        if i == 0:
-            break
-        if eta < 0:
-            eta, f, u, v, g, q, r = -eta, g, q, r, -f, -u, -v
-        limit = min(min(eta + 1, i), 4)
-        w = (g * NEGINV16[(f & 15) // 2]) % (2**limit)
-        g, q, r = g + w*f, q + w*u, r + w*v
-    return eta, (u, v, q, r)
-
-def modinv_var(M, Mi, x):
-    """Compute the modular inverse of x mod M, given Mi = 1/M mod 2^N."""
-    eta, f, g, d, e = -1, M, x, 0, 1
-    while g != 0:
-        eta, t = divsteps_n_matrix_var(eta, f % 2**N, g % 2**N)
-        f, g = update_fg(f, g, t)
-        d, e = update_de(d, e, t, M, Mi)
-    return normalize(f, d, Mi)
-```
-
-## 8. From GCDs to Jacobi symbol
-
-We can also use a similar approach to calculate Jacobi symbol *(x | M)* by keeping track of an
-extra variable *j*, for which at every step *(x | M) = j (g | f)*. As we update *f* and *g*, we
-make corresponding updates to *j* using
-[properties of the Jacobi symbol](https://en.wikipedia.org/wiki/Jacobi_symbol#Properties):
-* *((g/2) | f)* is either *(g | f)* or *-(g | f)*, depending on the value of *f mod 8* (negating if it's *3* or *5*).
-* *(f | g)* is either *(g | f)* or *-(g | f)*, depending on *f mod 4* and *g mod 4* (negating if both are *3*).
-
-These updates depend only on the values of *f* and *g* modulo *4* or *8*, and can thus be applied
-very quickly, as long as we keep track of a few additional bits of *f* and *g*. Overall, this
-calculation is slightly simpler than the one for the modular inverse because we no longer need to
-keep track of *d* and *e*.
-
-However, one difficulty of this approach is that the Jacobi symbol *(a | n)* is only defined for
-positive odd integers *n*, whereas in the original safegcd algorithm, *f, g* can take negative
-values. We resolve this by using the following modified steps:
-
-```python
-        # Before
-        if delta > 0 and g & 1:
-            delta, f, g = 1 - delta, g, (g - f) // 2
-
-        # After
-        if delta > 0 and g & 1:
-            delta, f, g = 1 - delta, g, (g + f) // 2
-```
-
-The algorithm is still correct, since the changed divstep, called a "posdivstep" (see section 8.4
-and E.5 in the paper) preserves *gcd(f, g)*. However, there's no proof that the modified algorithm
-will converge. The justification for posdivsteps is completely empirical: in practice, it appears
-that the vast majority of nonzero inputs converge to *f=g=gcd(f<sub>0</sub>, g<sub>0</sub>)* in a
-number of steps proportional to their logarithm.
-
-Note that:
-- We require inputs to satisfy *gcd(x, M) = 1*, as otherwise *f=1* is not reached.
-- We require inputs *x &neq; 0*, because applying posdivstep with *g=0* has no effect.
-- We need to update the termination condition from *g=0* to *f=1*.
-
-We account for the possibility of nonconvergence by only performing a bounded number of
-posdivsteps, and then falling back to square-root based Jacobi calculation if a solution has not
-yet been found.
-
-The optimizations in sections 3-7 above are described in the context of the original divsteps, but
-in the C implementation we also adapt most of them (not including "avoiding modulus operations",
-since it's not necessary to track *d, e*, and "constant-time operation", since we never calculate
-Jacobi symbols for secret data) to the posdivsteps version.

examples/CMakeLists.txt

@@ -1,30 +0,0 @@
-function(add_example name)
-  set(target_name ${name}_example)
-  add_executable(${target_name} ${name}.c)
-  target_include_directories(${target_name} PRIVATE
-    ${PROJECT_SOURCE_DIR}/include
-  )
-  target_link_libraries(${target_name}
-    secp256k1
-    $<$<PLATFORM_ID:Windows>:bcrypt>
-  )
-  set(test_name ${name}_example)
-  add_test(NAME ${test_name} COMMAND ${target_name})
-  if(BUILD_SHARED_LIBS AND MSVC)
-    # The DLL must reside either in the same folder where the executable is
-    # or somewhere in PATH. Using the latter option.
-    set_tests_properties(${test_name} PROPERTIES
-      ENVIRONMENT "PATH=$<TARGET_FILE_DIR:secp256k1>;$ENV{PATH}"
-    )
-  endif()
-endfunction()
-
-add_example(ecdsa)
-
-if(SECP256K1_ENABLE_MODULE_ECDH)
-  add_example(ecdh)
-endif()
-
-if(SECP256K1_ENABLE_MODULE_SCHNORRSIG)
-  add_example(schnorr)
-endif()

examples/EXAMPLES_COPYING

@@ -1,121 +0,0 @@
-Creative Commons Legal Code
-
-CC0 1.0 Universal
-
-    CREATIVE COMMONS CORPORATION IS NOT A LAW FIRM AND DOES NOT PROVIDE
-    LEGAL SERVICES. DISTRIBUTION OF THIS DOCUMENT DOES NOT CREATE AN
-    ATTORNEY-CLIENT RELATIONSHIP. CREATIVE COMMONS PROVIDES THIS
-    INFORMATION ON AN "AS-IS" BASIS. CREATIVE COMMONS MAKES NO WARRANTIES
-    REGARDING THE USE OF THIS DOCUMENT OR THE INFORMATION OR WORKS
-    PROVIDED HEREUNDER, AND DISCLAIMS LIABILITY FOR DAMAGES RESULTING FROM
-    THE USE OF THIS DOCUMENT OR THE INFORMATION OR WORKS PROVIDED
-    HEREUNDER.
-
-Statement of Purpose
-
-The laws of most jurisdictions throughout the world automatically confer
-exclusive Copyright and Related Rights (defined below) upon the creator
-and subsequent owner(s) (each and all, an "owner") of an original work of
-authorship and/or a database (each, a "Work").
-
-Certain owners wish to permanently relinquish those rights to a Work for
-the purpose of contributing to a commons of creative, cultural and
-scientific works ("Commons") that the public can reliably and without fear
-of later claims of infringement build upon, modify, incorporate in other
-works, reuse and redistribute as freely as possible in any form whatsoever
-and for any purposes, including without limitation commercial purposes.
-These owners may contribute to the Commons to promote the ideal of a free
-culture and the further production of creative, cultural and scientific
-works, or to gain reputation or greater distribution for their Work in
-part through the use and efforts of others.
-
-For these and/or other purposes and motivations, and without any
-expectation of additional consideration or compensation, the person
-associating CC0 with a Work (the "Affirmer"), to the extent that he or she
-is an owner of Copyright and Related Rights in the Work, voluntarily
-elects to apply CC0 to the Work and publicly distribute the Work under its
-terms, with knowledge of his or her Copyright and Related Rights in the
-Work and the meaning and intended legal effect of CC0 on those rights.
-
-1. Copyright and Related Rights. A Work made available under CC0 may be
-protected by copyright and related or neighboring rights ("Copyright and
-Related Rights"). Copyright and Related Rights include, but are not
-limited to, the following:
-
-  i. the right to reproduce, adapt, distribute, perform, display,
-     communicate, and translate a Work;
- ii. moral rights retained by the original author(s) and/or performer(s);
-iii. publicity and privacy rights pertaining to a person's image or
-     likeness depicted in a Work;
- iv. rights protecting against unfair competition in regards to a Work,
-     subject to the limitations in paragraph 4(a), below;
-  v. rights protecting the extraction, dissemination, use and reuse of data
-     in a Work;
- vi. database rights (such as those arising under Directive 96/9/EC of the
-     European Parliament and of the Council of 11 March 1996 on the legal
-     protection of databases, and under any national implementation
-     thereof, including any amended or successor version of such
-     directive); and
-vii. other similar, equivalent or corresponding rights throughout the
-     world based on applicable law or treaty, and any national
-     implementations thereof.
-
-2. Waiver. To the greatest extent permitted by, but not in contravention
-of, applicable law, Affirmer hereby overtly, fully, permanently,
-irrevocably and unconditionally waives, abandons, and surrenders all of
-Affirmer's Copyright and Related Rights and associated claims and causes
-of action, whether now known or unknown (including existing as well as
-future claims and causes of action), in the Work (i) in all territories
-worldwide, (ii) for the maximum duration provided by applicable law or
-treaty (including future time extensions), (iii) in any current or future
-medium and for any number of copies, and (iv) for any purpose whatsoever,
-including without limitation commercial, advertising or promotional
-purposes (the "Waiver"). Affirmer makes the Waiver for the benefit of each
-member of the public at large and to the detriment of Affirmer's heirs and
-successors, fully intending that such Waiver shall not be subject to
-revocation, rescission, cancellation, termination, or any other legal or
-equitable action to disrupt the quiet enjoyment of the Work by the public
-as contemplated by Affirmer's express Statement of Purpose.
-
-3. Public License Fallback. Should any part of the Waiver for any reason
-be judged legally invalid or ineffective under applicable law, then the
-Waiver shall be preserved to the maximum extent permitted taking into
-account Affirmer's express Statement of Purpose. In addition, to the
-extent the Waiver is so judged Affirmer hereby grants to each affected
-person a royalty-free, non transferable, non sublicensable, non exclusive,
-irrevocable and unconditional license to exercise Affirmer's Copyright and
-Related Rights in the Work (i) in all territories worldwide, (ii) for the
-maximum duration provided by applicable law or treaty (including future
-time extensions), (iii) in any current or future medium and for any number
-of copies, and (iv) for any purpose whatsoever, including without
-limitation commercial, advertising or promotional purposes (the
-"License"). The License shall be deemed effective as of the date CC0 was
-applied by Affirmer to the Work. Should any part of the License for any
-reason be judged legally invalid or ineffective under applicable law, such
-partial invalidity or ineffectiveness shall not invalidate the remainder
-of the License, and in such case Affirmer hereby affirms that he or she
-will not (i) exercise any of his or her remaining Copyright and Related
-Rights in the Work or (ii) assert any associated claims and causes of
-action with respect to the Work, in either case contrary to Affirmer's
-express Statement of Purpose.
-
-4. Limitations and Disclaimers.
-
- a. No trademark or patent rights held by Affirmer are waived, abandoned,
-    surrendered, licensed or otherwise affected by this document.
- b. Affirmer offers the Work as-is and makes no representations or
-    warranties of any kind concerning the Work, express, implied,
-    statutory or otherwise, including without limitation warranties of
-    title, merchantability, fitness for a particular purpose, non
-    infringement, or the absence of latent or other defects, accuracy, or
-    the present or absence of errors, whether or not discoverable, all to
-    the greatest extent permissible under applicable law.
- c. Affirmer disclaims responsibility for clearing rights of other persons
-    that may apply to the Work or any use thereof, including without
-    limitation any person's Copyright and Related Rights in the Work.
-    Further, Affirmer disclaims responsibility for obtaining any necessary
-    consents, permissions or other rights required for any use of the
-    Work.
- d. Affirmer understands and acknowledges that Creative Commons is not a
-    party to this document and has no duty or obligation with respect to
-    this CC0 or use of the Work.

examples/ecdh.c

@@ -1,122 +0,0 @@
-/*************************************************************************
- * Written in 2020-2022 by Elichai Turkel                                *
- * To the extent possible under law, the author(s) have dedicated all    *
- * copyright and related and neighboring rights to the software in this  *
- * file to the public domain worldwide. This software is distributed     *
- * without any warranty. For the CC0 Public Domain Dedication, see       *
- * EXAMPLES_COPYING or https://creativecommons.org/publicdomain/zero/1.0 *
- *************************************************************************/
-
-#include <stdio.h>
-#include <assert.h>
-#include <string.h>
-
-#include <secp256k1.h>
-#include <secp256k1_ecdh.h>
-
-#include "examples_util.h"
-
-int main(void) {
-    unsigned char seckey1[32];
-    unsigned char seckey2[32];
-    unsigned char compressed_pubkey1[33];
-    unsigned char compressed_pubkey2[33];
-    unsigned char shared_secret1[32];
-    unsigned char shared_secret2[32];
-    unsigned char randomize[32];
-    int return_val;
-    size_t len;
-    secp256k1_pubkey pubkey1;
-    secp256k1_pubkey pubkey2;
-
-    /* Before we can call actual API functions, we need to create a "context". */
-    secp256k1_context* ctx = secp256k1_context_create(SECP256K1_CONTEXT_NONE);
-    if (!fill_random(randomize, sizeof(randomize))) {
-        printf("Failed to generate randomness\n");
-        return 1;
-    }
-    /* Randomizing the context is recommended to protect against side-channel
-     * leakage See `secp256k1_context_randomize` in secp256k1.h for more
-     * information about it. This should never fail. */
-    return_val = secp256k1_context_randomize(ctx, randomize);
-    assert(return_val);
-
-    /*** Key Generation ***/
-
-    /* If the secret key is zero or out of range (bigger than secp256k1's
-     * order), we try to sample a new key. Note that the probability of this
-     * happening is negligible. */
-    while (1) {
-        if (!fill_random(seckey1, sizeof(seckey1)) || !fill_random(seckey2, sizeof(seckey2))) {
-            printf("Failed to generate randomness\n");
-            return 1;
-        }
-        if (secp256k1_ec_seckey_verify(ctx, seckey1) && secp256k1_ec_seckey_verify(ctx, seckey2)) {
-            break;
-        }
-    }
-
-    /* Public key creation using a valid context with a verified secret key should never fail */
-    return_val = secp256k1_ec_pubkey_create(ctx, &pubkey1, seckey1);
-    assert(return_val);
-    return_val = secp256k1_ec_pubkey_create(ctx, &pubkey2, seckey2);
-    assert(return_val);
-
-    /* Serialize pubkey1 in a compressed form (33 bytes), should always return 1 */
-    len = sizeof(compressed_pubkey1);
-    return_val = secp256k1_ec_pubkey_serialize(ctx, compressed_pubkey1, &len, &pubkey1, SECP256K1_EC_COMPRESSED);
-    assert(return_val);
-    /* Should be the same size as the size of the output, because we passed a 33 byte array. */
-    assert(len == sizeof(compressed_pubkey1));
-
-    /* Serialize pubkey2 in a compressed form (33 bytes) */
-    len = sizeof(compressed_pubkey2);
-    return_val = secp256k1_ec_pubkey_serialize(ctx, compressed_pubkey2, &len, &pubkey2, SECP256K1_EC_COMPRESSED);
-    assert(return_val);
-    /* Should be the same size as the size of the output, because we passed a 33 byte array. */
-    assert(len == sizeof(compressed_pubkey2));
-
-    /*** Creating the shared secret ***/
-
-    /* Perform ECDH with seckey1 and pubkey2. Should never fail with a verified
-     * seckey and valid pubkey */
-    return_val = secp256k1_ecdh(ctx, shared_secret1, &pubkey2, seckey1, NULL, NULL);
-    assert(return_val);
-
-    /* Perform ECDH with seckey2 and pubkey1. Should never fail with a verified
-     * seckey and valid pubkey */
-    return_val = secp256k1_ecdh(ctx, shared_secret2, &pubkey1, seckey2, NULL, NULL);
-    assert(return_val);
-
-    /* Both parties should end up with the same shared secret */
-    return_val = memcmp(shared_secret1, shared_secret2, sizeof(shared_secret1));
-    assert(return_val == 0);
-
-    printf("Secret Key1: ");
-    print_hex(seckey1, sizeof(seckey1));
-    printf("Compressed Pubkey1: ");
-    print_hex(compressed_pubkey1, sizeof(compressed_pubkey1));
-    printf("\nSecret Key2: ");
-    print_hex(seckey2, sizeof(seckey2));
-    printf("Compressed Pubkey2: ");
-    print_hex(compressed_pubkey2, sizeof(compressed_pubkey2));
-    printf("\nShared Secret: ");
-    print_hex(shared_secret1, sizeof(shared_secret1));
-
-    /* This will clear everything from the context and free the memory */
-    secp256k1_context_destroy(ctx);
-
-    /* It's best practice to try to clear secrets from memory after using them.
-     * This is done because some bugs can allow an attacker to leak memory, for
-     * example through "out of bounds" array access (see Heartbleed), Or the OS
-     * swapping them to disk. Hence, we overwrite the secret key buffer with zeros.
-     *
-     * Here we are preventing these writes from being optimized out, as any good compiler
-     * will remove any writes that aren't used. */
-    secure_erase(seckey1, sizeof(seckey1));
-    secure_erase(seckey2, sizeof(seckey2));
-    secure_erase(shared_secret1, sizeof(shared_secret1));
-    secure_erase(shared_secret2, sizeof(shared_secret2));
-
-    return 0;
-}

examples/ecdsa.c

@@ -1,139 +0,0 @@
-/*************************************************************************
- * Written in 2020-2022 by Elichai Turkel                                *
- * To the extent possible under law, the author(s) have dedicated all    *
- * copyright and related and neighboring rights to the software in this  *
- * file to the public domain worldwide. This software is distributed     *
- * without any warranty. For the CC0 Public Domain Dedication, see       *
- * EXAMPLES_COPYING or https://creativecommons.org/publicdomain/zero/1.0 *
- *************************************************************************/
-
-#include <stdio.h>
-#include <assert.h>
-#include <string.h>
-
-#include <secp256k1.h>
-
-#include "examples_util.h"
-
-int main(void) {
-    /* Instead of signing the message directly, we must sign a 32-byte hash.
-     * Here the message is "Hello, world!" and the hash function was SHA-256.
-     * An actual implementation should just call SHA-256, but this example
-     * hardcodes the output to avoid depending on an additional library.
-     * See https://bitcoin.stackexchange.com/questions/81115/if-someone-wanted-to-pretend-to-be-satoshi-by-posting-a-fake-signature-to-defrau/81116#81116 */
-    unsigned char msg_hash[32] = {
-        0x31, 0x5F, 0x5B, 0xDB, 0x76, 0xD0, 0x78, 0xC4,
-        0x3B, 0x8A, 0xC0, 0x06, 0x4E, 0x4A, 0x01, 0x64,
-        0x61, 0x2B, 0x1F, 0xCE, 0x77, 0xC8, 0x69, 0x34,
-        0x5B, 0xFC, 0x94, 0xC7, 0x58, 0x94, 0xED, 0xD3,
-    };
-    unsigned char seckey[32];
-    unsigned char randomize[32];
-    unsigned char compressed_pubkey[33];
-    unsigned char serialized_signature[64];
-    size_t len;
-    int is_signature_valid, is_signature_valid2;
-    int return_val;
-    secp256k1_pubkey pubkey;
-    secp256k1_ecdsa_signature sig;
-    /* Before we can call actual API functions, we need to create a "context". */
-    secp256k1_context* ctx = secp256k1_context_create(SECP256K1_CONTEXT_NONE);
-    if (!fill_random(randomize, sizeof(randomize))) {
-        printf("Failed to generate randomness\n");
-        return 1;
-    }
-    /* Randomizing the context is recommended to protect against side-channel
-     * leakage See `secp256k1_context_randomize` in secp256k1.h for more
-     * information about it. This should never fail. */
-    return_val = secp256k1_context_randomize(ctx, randomize);
-    assert(return_val);
-
-    /*** Key Generation ***/
-
-    /* If the secret key is zero or out of range (bigger than secp256k1's
-     * order), we try to sample a new key. Note that the probability of this
-     * happening is negligible. */
-    while (1) {
-        if (!fill_random(seckey, sizeof(seckey))) {
-            printf("Failed to generate randomness\n");
-            return 1;
-        }
-        if (secp256k1_ec_seckey_verify(ctx, seckey)) {
-            break;
-        }
-    }
-
-    /* Public key creation using a valid context with a verified secret key should never fail */
-    return_val = secp256k1_ec_pubkey_create(ctx, &pubkey, seckey);
-    assert(return_val);
-
-    /* Serialize the pubkey in a compressed form(33 bytes). Should always return 1. */
-    len = sizeof(compressed_pubkey);
-    return_val = secp256k1_ec_pubkey_serialize(ctx, compressed_pubkey, &len, &pubkey, SECP256K1_EC_COMPRESSED);
-    assert(return_val);
-    /* Should be the same size as the size of the output, because we passed a 33 byte array. */
-    assert(len == sizeof(compressed_pubkey));
-
-    /*** Signing ***/
-
-    /* Generate an ECDSA signature `noncefp` and `ndata` allows you to pass a
-     * custom nonce function, passing `NULL` will use the RFC-6979 safe default.
-     * Signing with a valid context, verified secret key
-     * and the default nonce function should never fail. */
-    return_val = secp256k1_ecdsa_sign(ctx, &sig, msg_hash, seckey, NULL, NULL);
-    assert(return_val);
-
-    /* Serialize the signature in a compact form. Should always return 1
-     * according to the documentation in secp256k1.h. */
-    return_val = secp256k1_ecdsa_signature_serialize_compact(ctx, serialized_signature, &sig);
-    assert(return_val);
-
-
-    /*** Verification ***/
-
-    /* Deserialize the signature. This will return 0 if the signature can't be parsed correctly. */
-    if (!secp256k1_ecdsa_signature_parse_compact(ctx, &sig, serialized_signature)) {
-        printf("Failed parsing the signature\n");
-        return 1;
-    }
-
-    /* Deserialize the public key. This will return 0 if the public key can't be parsed correctly. */
-    if (!secp256k1_ec_pubkey_parse(ctx, &pubkey, compressed_pubkey, sizeof(compressed_pubkey))) {
-        printf("Failed parsing the public key\n");
-        return 1;
-    }
-
-    /* Verify a signature. This will return 1 if it's valid and 0 if it's not. */
-    is_signature_valid = secp256k1_ecdsa_verify(ctx, &sig, msg_hash, &pubkey);
-
-    printf("Is the signature valid? %s\n", is_signature_valid ? "true" : "false");
-    printf("Secret Key: ");
-    print_hex(seckey, sizeof(seckey));
-    printf("Public Key: ");
-    print_hex(compressed_pubkey, sizeof(compressed_pubkey));
-    printf("Signature: ");
-    print_hex(serialized_signature, sizeof(serialized_signature));
-
-    /* This will clear everything from the context and free the memory */
-    secp256k1_context_destroy(ctx);
-
-    /* Bonus example: if all we need is signature verification (and no key
-       generation or signing), we don't need to use a context created via
-       secp256k1_context_create(). We can simply use the static (i.e., global)
-       context secp256k1_context_static. See its description in
-       include/secp256k1.h for details. */
-    is_signature_valid2 = secp256k1_ecdsa_verify(secp256k1_context_static,
-                                                 &sig, msg_hash, &pubkey);
-    assert(is_signature_valid2 == is_signature_valid);
-
-    /* It's best practice to try to clear secrets from memory after using them.
-     * This is done because some bugs can allow an attacker to leak memory, for
-     * example through "out of bounds" array access (see Heartbleed), Or the OS
-     * swapping them to disk. Hence, we overwrite the secret key buffer with zeros.
-     *
-     * Here we are preventing these writes from being optimized out, as any good compiler
-     * will remove any writes that aren't used. */
-    secure_erase(seckey, sizeof(seckey));
-
-    return 0;
-}

examples/examples_util.h

@@ -1,108 +0,0 @@
-/*************************************************************************
- * Copyright (c) 2020-2021 Elichai Turkel                                *
- * Distributed under the CC0 software license, see the accompanying file *
- * EXAMPLES_COPYING or https://creativecommons.org/publicdomain/zero/1.0 *
- *************************************************************************/
-
-/*
- * This file is an attempt at collecting best practice methods for obtaining randomness with different operating systems.
- * It may be out-of-date. Consult the documentation of the operating system before considering to use the methods below.
- *
- * Platform randomness sources:
- * Linux   -> `getrandom(2)`(`sys/random.h`), if not available `/dev/urandom` should be used. http://man7.org/linux/man-pages/man2/getrandom.2.html, https://linux.die.net/man/4/urandom
- * macOS   -> `getentropy(2)`(`sys/random.h`), if not available `/dev/urandom` should be used. https://www.unix.com/man-page/mojave/2/getentropy, https://opensource.apple.com/source/xnu/xnu-517.12.7/bsd/man/man4/random.4.auto.html
- * FreeBSD -> `getrandom(2)`(`sys/random.h`), if not available `kern.arandom` should be used. https://www.freebsd.org/cgi/man.cgi?query=getrandom, https://www.freebsd.org/cgi/man.cgi?query=random&sektion=4
- * OpenBSD -> `getentropy(2)`(`unistd.h`), if not available `/dev/urandom` should be used. https://man.openbsd.org/getentropy, https://man.openbsd.org/urandom
- * Windows -> `BCryptGenRandom`(`bcrypt.h`). https://docs.microsoft.com/en-us/windows/win32/api/bcrypt/nf-bcrypt-bcryptgenrandom
- */
-
-#if defined(_WIN32)
-/*
- * The defined WIN32_NO_STATUS macro disables return code definitions in
- * windows.h, which avoids "macro redefinition" MSVC warnings in ntstatus.h.
- */
-#define WIN32_NO_STATUS
-#include <windows.h>
-#undef WIN32_NO_STATUS
-#include <ntstatus.h>
-#include <bcrypt.h>
-#elif defined(__linux__) || defined(__APPLE__) || defined(__FreeBSD__)
-#include <sys/random.h>
-#elif defined(__OpenBSD__)
-#include <unistd.h>
-#else
-#error "Couldn't identify the OS"
-#endif
-
-#include <stddef.h>
-#include <limits.h>
-#include <stdio.h>
-
-
-/* Returns 1 on success, and 0 on failure. */
-static int fill_random(unsigned char* data, size_t size) {
-#if defined(_WIN32)
-    NTSTATUS res = BCryptGenRandom(NULL, data, size, BCRYPT_USE_SYSTEM_PREFERRED_RNG);
-    if (res != STATUS_SUCCESS || size > ULONG_MAX) {
-        return 0;
-    } else {
-        return 1;
-    }
-#elif defined(__linux__) || defined(__FreeBSD__)
-    /* If `getrandom(2)` is not available you should fallback to /dev/urandom */
-    ssize_t res = getrandom(data, size, 0);
-    if (res < 0 || (size_t)res != size ) {
-        return 0;
-    } else {
-        return 1;
-    }
-#elif defined(__APPLE__) || defined(__OpenBSD__)
-    /* If `getentropy(2)` is not available you should fallback to either
-     * `SecRandomCopyBytes` or /dev/urandom */
-    int res = getentropy(data, size);
-    if (res == 0) {
-        return 1;
-    } else {
-        return 0;
-    }
-#endif
-    return 0;
-}
-
-static void print_hex(unsigned char* data, size_t size) {
-    size_t i;
-    printf("0x");
-    for (i = 0; i < size; i++) {
-        printf("%02x", data[i]);
-    }
-    printf("\n");
-}
-
-#if defined(_MSC_VER)
-// For SecureZeroMemory
-#include <Windows.h>
-#endif
-/* Cleanses memory to prevent leaking sensitive info. Won't be optimized out. */
-static void secure_erase(void *ptr, size_t len) {
-#if defined(_MSC_VER)
-    /* SecureZeroMemory is guaranteed not to be optimized out by MSVC. */
-    SecureZeroMemory(ptr, len);
-#elif defined(__GNUC__)
-    /* We use a memory barrier that scares the compiler away from optimizing out the memset.
-     *
-     * Quoting Adam Langley <agl@google.com> in commit ad1907fe73334d6c696c8539646c21b11178f20f
-     * in BoringSSL (ISC License):
-     *    As best as we can tell, this is sufficient to break any optimisations that
-     *    might try to eliminate "superfluous" memsets.
-     * This method used in memzero_explicit() the Linux kernel, too. Its advantage is that it is
-     * pretty efficient, because the compiler can still implement the memset() efficiently,
-     * just not remove it entirely. See "Dead Store Elimination (Still) Considered Harmful" by
-     * Yang et al. (USENIX Security 2017) for more background.
-     */
-    memset(ptr, 0, len);
-    __asm__ __volatile__("" : : "r"(ptr) : "memory");
-#else
-    void *(*volatile const volatile_memset)(void *, int, size_t) = memset;
-    volatile_memset(ptr, 0, len);
-#endif
-}

examples/frost.c

@@ -1,294 +0,0 @@
-/***********************************************************************
- * Copyright (c) 2021-2024  Jesse Posner                               *
- * Distributed under the MIT software license, see the accompanying    *
- * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
- ***********************************************************************/
-
-/**
- * This file demonstrates how to use the FROST module to create a threshold
- * signature. Additionally, see the documentation in include/secp256k1_frost.h.
- */
-
-#include <stdio.h>
-#include <assert.h>
-#include <string.h>
-
-#include <secp256k1.h>
-#include <secp256k1_schnorrsig.h>
-#include <secp256k1_frost.h>
-
-#include "examples_util.h"
-/* Number of public keys involved in creating the aggregate signature */
-#define N_SIGNERS 5
-
-/* Threshold required in creating the aggregate signature */
-#define THRESHOLD 3
-
-struct signer_secrets {
-    secp256k1_keypair keypair;
-    secp256k1_frost_share agg_share;
-    secp256k1_frost_secnonce secnonce;
-    unsigned char seed[32];
-};
-
-struct signer {
-    secp256k1_pubkey pubshare;
-    secp256k1_frost_pubnonce pubnonce;
-    secp256k1_frost_session session;
-    secp256k1_frost_partial_sig partial_sig;
-    secp256k1_pubkey vss_commitment[THRESHOLD];
-    unsigned char vss_hash[32];
-    unsigned char pok[64];
-    unsigned char id[33];
-};
-
-/* Create a key pair and store it in seckey and pubkey */
-int create_keypair_and_seed(const secp256k1_context* ctx, struct signer_secrets *signer_secrets, struct signer *signer) {
-    unsigned char seckey[32];
-    secp256k1_pubkey pubkey_tmp;
-    size_t size = 33;
-
-    while (1) {
-        if (!fill_random(seckey, sizeof(seckey))) {
-            printf("Failed to generate randomness\n");
-            return 1;
-        }
-        if (secp256k1_keypair_create(ctx, &signer_secrets->keypair, seckey)) {
-            break;
-        }
-    }
-    if (!secp256k1_keypair_pub(ctx, &pubkey_tmp, &signer_secrets->keypair)) {
-        return 0;
-    }
-    if (!secp256k1_ec_pubkey_serialize(ctx, signer->id, &size, &pubkey_tmp, SECP256K1_EC_COMPRESSED)) {
-        return 0;
-    }
-    if (!fill_random(signer_secrets->seed, sizeof(signer_secrets->seed))) {
-        return 0;
-    }
-    return 1;
-}
-
-/* Create shares and coefficient commitments */
-int create_shares(const secp256k1_context* ctx, struct signer_secrets *signer_secrets, struct signer *signer, secp256k1_xonly_pubkey *pk) {
-    int i, j;
-    secp256k1_frost_share shares[N_SIGNERS][N_SIGNERS];
-    const secp256k1_pubkey *vss_commitments[N_SIGNERS];
-    const unsigned char *ids[N_SIGNERS];
-
-    for (i = 0; i < N_SIGNERS; i++) {
-        vss_commitments[i] = signer[i].vss_commitment;
-        ids[i] = signer[i].id;
-    }
-
-    for (i = 0; i < N_SIGNERS; i++) {
-        /* Generate a polynomial share for the participants */
-        if (!secp256k1_frost_shares_gen(ctx, shares[i], signer[i].vss_commitment, signer[i].pok, signer_secrets[i].seed, THRESHOLD, N_SIGNERS, ids)) {
-            return 0;
-        }
-    }
-
-    /* KeyGen communication round 1: exchange shares and coefficient
-     * commitments */
-    for (i = 0; i < N_SIGNERS; i++) {
-        const secp256k1_frost_share *assigned_shares[N_SIGNERS];
-
-        /* Each participant receives a share from each participant (including
-         * themselves) corresponding to their index. */
-        for (j = 0; j < N_SIGNERS; j++) {
-            assigned_shares[j] = &shares[j][i];
-        }
-        /* Each participant aggregates the shares they received. */
-        if (!secp256k1_frost_share_agg(ctx, &signer_secrets[i].agg_share, pk, assigned_shares, vss_commitments, N_SIGNERS, THRESHOLD, signer[i].id)) {
-            return 0;
-        }
-        for (j = 0; j < N_SIGNERS; j++) {
-            /* Each participant verifies their shares. share_agg calls this
-             * internally, so it is only neccessary to call this function if
-             * share_agg returns an error, to determine which participant(s)
-             * submitted faulty data. */
-            if (!secp256k1_frost_share_verify(ctx, THRESHOLD, signer[i].id, assigned_shares[j], &vss_commitments[j])) {
-                return 0;
-            }
-            /* Each participant generates public verification shares that are
-             * used for verifying partial signatures. */
-            if (!secp256k1_frost_compute_pubshare(ctx, &signer[j].pubshare, THRESHOLD, signer[j].id, vss_commitments, N_SIGNERS)) {
-                return 0;
-            }
-        }
-    }
-
-    return 1;
-}
-
-/* Tweak the pubkey corresponding to the provided tweak cache, update the cache
- * and return the tweaked aggregate pk. */
-int tweak(const secp256k1_context* ctx, secp256k1_xonly_pubkey *pk, secp256k1_frost_tweak_cache *cache) {
-    secp256k1_pubkey output_pk;
-    unsigned char ordinary_tweak[32] = "this could be a BIP32 tweak....";
-    unsigned char xonly_tweak[32] = "this could be a taproot tweak..";
-
-    if (!secp256k1_frost_pubkey_tweak(ctx, cache, pk)) {
-        return 0;
-    }
-
-    /* Ordinary tweaking which, for example, allows deriving multiple child
-     * public keys from a single aggregate key using BIP32 */
-    if (!secp256k1_frost_pubkey_ec_tweak_add(ctx, NULL, cache, ordinary_tweak)) {
-        return 0;
-    }
-    /* If one is not interested in signing, the same output_pk can be obtained
-     * by calling `secp256k1_frost_pubkey_get` right after key aggregation to
-     * get the full pubkey and then call `secp256k1_ec_pubkey_tweak_add`. */
-
-    /* Xonly tweaking which, for example, allows creating taproot commitments */
-    if (!secp256k1_frost_pubkey_xonly_tweak_add(ctx, &output_pk, cache, xonly_tweak)) {
-        return 0;
-    }
-    /* Note that if we wouldn't care about signing, we can arrive at the same
-     * output_pk by providing the untweaked public key to
-     * `secp256k1_xonly_pubkey_tweak_add` (after converting it to an xonly pubkey
-     * if necessary with `secp256k1_xonly_pubkey_from_pubkey`). */
-
-    /* Now we convert the output_pk to an xonly pubkey to allow to later verify
-     * the Schnorr signature against it. For this purpose we can ignore the
-     * `pk_parity` output argument; we would need it if we would have to open
-     * the taproot commitment. */
-    if (!secp256k1_xonly_pubkey_from_pubkey(ctx, pk, NULL, &output_pk)) {
-        return 0;
-    }
-    return 1;
-}
-
-/* Sign a message hash with the given threshold and aggregate shares and store
- * the result in sig */
-int sign(const secp256k1_context* ctx, struct signer_secrets *signer_secrets, struct signer *signer, const unsigned char* msg32, secp256k1_xonly_pubkey *pk, unsigned char *sig64, const secp256k1_frost_tweak_cache *cache) {
-    int i;
-    int signer_id = 0;
-    int signers[THRESHOLD];
-    int is_signer[N_SIGNERS];
-    const secp256k1_frost_pubnonce *pubnonces[THRESHOLD];
-    const unsigned char *ids[THRESHOLD];
-    const secp256k1_frost_partial_sig *partial_sigs[THRESHOLD];
-
-    for (i = 0; i < N_SIGNERS; i++) {
-        unsigned char session_id[32];
-        /* Create random session ID. It is absolutely necessary that the session ID
-         * is unique for every call of secp256k1_frost_nonce_gen. Otherwise
-         * it's trivial for an attacker to extract the secret key! */
-        if (!fill_random(session_id, sizeof(session_id))) {
-            return 0;
-        }
-        /* Initialize session and create secret nonce for signing and public
-         * nonce to send to the other signers. */
-        if (!secp256k1_frost_nonce_gen(ctx, &signer_secrets[i].secnonce, &signer[i].pubnonce, session_id, &signer_secrets[i].agg_share, msg32, pk, NULL)) {
-            return 0;
-        }
-        is_signer[i] = 0; /* Initialize is_signer */
-    }
-    /* Select a random subset of signers */
-    for (i = 0; i < THRESHOLD; i++) {
-        unsigned int subset_seed;
-
-        while (1) {
-            if (!fill_random((unsigned char*)&subset_seed, sizeof(subset_seed))) {
-                return 0;
-            }
-            signer_id = subset_seed % N_SIGNERS;
-            /* Check if signer has already been assigned */
-            if (!is_signer[signer_id]) {
-                is_signer[signer_id] = 1;
-                signers[i] = signer_id;
-                break;
-            }
-        }
-        /* Mark signer as assigned */
-        pubnonces[i] = &signer[signer_id].pubnonce;
-        /* pubkeys[i] = &signer[signer_id].pubkey; */
-        ids[i] = signer[signer_id].id;
-    }
-    /* Signing communication round 1: Exchange nonces */
-    for (i = 0; i < THRESHOLD; i++) {
-        signer_id = signers[i];
-        if (!secp256k1_frost_nonce_process(ctx, &signer[signer_id].session, pubnonces, THRESHOLD, msg32, pk, signer[signer_id].id, ids, cache, NULL)) {
-            return 0;
-        }
-        /* partial_sign will clear the secnonce by setting it to 0. That's because
-         * you must _never_ reuse the secnonce (or use the same session_id to
-         * create a secnonce). If you do, you effectively reuse the nonce and
-         * leak the secret key. */
-        if (!secp256k1_frost_partial_sign(ctx, &signer[signer_id].partial_sig, &signer_secrets[signer_id].secnonce, &signer_secrets[signer_id].agg_share, &signer[signer_id].session, cache)) {
-            return 0;
-        }
-        partial_sigs[i] = &signer[signer_id].partial_sig;
-    }
-    /* Communication round 2: A production system would exchange
-     * partial signatures here before moving on. */
-    for (i = 0; i < THRESHOLD; i++) {
-        signer_id = signers[i];
-        /* To check whether signing was successful, it suffices to either verify
-         * the aggregate signature with the aggregate public key using
-         * secp256k1_schnorrsig_verify, or verify all partial signatures of all
-         * signers individually. Verifying the aggregate signature is cheaper but
-         * verifying the individual partial signatures has the advantage that it
-         * can be used to determine which of the partial signatures are invalid
-         * (if any), i.e., which of the partial signatures cause the aggregate
-         * signature to be invalid and thus the protocol run to fail. It's also
-         * fine to first verify the aggregate sig, and only verify the individual
-         * sigs if it does not work.
-         */
-        if (!secp256k1_frost_partial_sig_verify(ctx, &signer[signer_id].partial_sig, &signer[signer_id].pubnonce, &signer[signer_id].pubshare, &signer[signer_id].session, cache)) {
-            return 0;
-        }
-    }
-    return secp256k1_frost_partial_sig_agg(ctx, sig64, &signer[signer_id].session, partial_sigs, THRESHOLD);
-}
-
-int main(void) {
-    secp256k1_context* ctx;
-    int i;
-    struct signer_secrets signer_secrets[N_SIGNERS];
-    struct signer signers[N_SIGNERS];
-    secp256k1_xonly_pubkey pk;
-    secp256k1_frost_tweak_cache cache;
-    unsigned char msg[32] = "this_could_be_the_hash_of_a_msg!";
-    unsigned char sig[64];
-
-    /* Create a context for signing and verification */
-    ctx = secp256k1_context_create(SECP256K1_CONTEXT_NONE);
-    printf("Creating key pairs......");
-    for (i = 0; i < N_SIGNERS; i++) {
-        if (!create_keypair_and_seed(ctx, &signer_secrets[i], &signers[i])) {
-            printf("FAILED\n");
-            return 1;
-        }
-    }
-    printf("ok\n");
-    printf("Creating shares.........");
-    if (!create_shares(ctx, signer_secrets, signers, &pk)) {
-        printf("FAILED\n");
-        return 1;
-    }
-    printf("ok\n");
-    printf("Tweaking................");
-    /* Optionally tweak the aggregate key */
-    if (!tweak(ctx, &pk, &cache)) {
-        printf("FAILED\n");
-        return 1;
-    }
-    printf("ok\n");
-    printf("Signing message.........");
-    if (!sign(ctx, signer_secrets, signers, msg, &pk, sig, &cache)) {
-        printf("FAILED\n");
-        return 1;
-    }
-    printf("ok\n");
-    printf("Verifying signature.....");
-    if (!secp256k1_schnorrsig_verify(ctx, sig, msg, 32, &pk)) {
-        printf("FAILED\n");
-        return 1;
-    }
-    printf("ok\n");
-    secp256k1_context_destroy(ctx);
-    return 0;
-}

examples/musig.c

@@ -1,214 +0,0 @@
-/*************************************************************************
- * Written in 2018 by Jonas Nick                                         *
- * To the extent possible under law, the author(s) have dedicated all    *
- * copyright and related and neighboring rights to the software in this  *
- * file to the public domain worldwide. This software is distributed     *
- * without any warranty. For the CC0 Public Domain Dedication, see       *
- * EXAMPLES_COPYING or https://creativecommons.org/publicdomain/zero/1.0 *
- *************************************************************************/
-
-/** This file demonstrates how to use the MuSig module to create a
- *  3-of-3 multisignature. Additionally, see the documentation in
- *  include/secp256k1_musig.h and src/modules/musig/musig.md.
- */
-
-#include <stdio.h>
-#include <assert.h>
-#include <string.h>
-
-#include <secp256k1.h>
-#include <secp256k1_schnorrsig.h>
-#include <secp256k1_musig.h>
-
-#include "examples_util.h"
-
-struct signer_secrets {
-    secp256k1_keypair keypair;
-    secp256k1_musig_secnonce secnonce;
-};
-
-struct signer {
-    secp256k1_pubkey pubkey;
-    secp256k1_musig_pubnonce pubnonce;
-    secp256k1_musig_partial_sig partial_sig;
-};
-
- /* Number of public keys involved in creating the aggregate signature */
-#define N_SIGNERS 3
-/* Create a key pair, store it in signer_secrets->keypair and signer->pubkey */
-static int create_keypair(const secp256k1_context* ctx, struct signer_secrets *signer_secrets, struct signer *signer) {
-    unsigned char seckey[32];
-    while (1) {
-        if (!fill_random(seckey, sizeof(seckey))) {
-            printf("Failed to generate randomness\n");
-            return 1;
-        }
-        if (secp256k1_keypair_create(ctx, &signer_secrets->keypair, seckey)) {
-            break;
-        }
-    }
-    if (!secp256k1_keypair_pub(ctx, &signer->pubkey, &signer_secrets->keypair)) {
-        return 0;
-    }
-    return 1;
-}
-
-/* Tweak the pubkey corresponding to the provided keyagg cache, update the cache
- * and return the tweaked aggregate pk. */
-static int tweak(const secp256k1_context* ctx, secp256k1_xonly_pubkey *agg_pk, secp256k1_musig_keyagg_cache *cache) {
-    secp256k1_pubkey output_pk;
-    unsigned char plain_tweak[32] = "this could be a BIP32 tweak....";
-    unsigned char xonly_tweak[32] = "this could be a taproot tweak..";
-
-
-    /* Plain tweaking which, for example, allows deriving multiple child
-     * public keys from a single aggregate key using BIP32 */
-    if (!secp256k1_musig_pubkey_ec_tweak_add(ctx, NULL, cache, plain_tweak)) {
-        return 0;
-    }
-    /* Note that we did not provided an output_pk argument, because the
-     * resulting pk is also saved in the cache and so if one is just interested
-     * in signing the output_pk argument is unnecessary. On the other hand, if
-     * one is not interested in signing, the same output_pk can be obtained by
-     * calling `secp256k1_musig_pubkey_get` right after key aggregation to get
-     * the full pubkey and then call `secp256k1_ec_pubkey_tweak_add`. */
-
-    /* Xonly tweaking which, for example, allows creating taproot commitments */
-    if (!secp256k1_musig_pubkey_xonly_tweak_add(ctx, &output_pk, cache, xonly_tweak)) {
-        return 0;
-    }
-    /* Note that if we wouldn't care about signing, we can arrive at the same
-     * output_pk by providing the untweaked public key to
-     * `secp256k1_xonly_pubkey_tweak_add` (after converting it to an xonly pubkey
-     * if necessary with `secp256k1_xonly_pubkey_from_pubkey`). */
-
-    /* Now we convert the output_pk to an xonly pubkey to allow to later verify
-     * the Schnorr signature against it. For this purpose we can ignore the
-     * `pk_parity` output argument; we would need it if we would have to open
-     * the taproot commitment. */
-    if (!secp256k1_xonly_pubkey_from_pubkey(ctx, agg_pk, NULL, &output_pk)) {
-        return 0;
-    }
-    return 1;
-}
-
-/* Sign a message hash with the given key pairs and store the result in sig */
-static int sign(const secp256k1_context* ctx, struct signer_secrets *signer_secrets, struct signer *signer, const secp256k1_musig_keyagg_cache *cache, const unsigned char *msg32, unsigned char *sig64) {
-    int i;
-    const secp256k1_musig_pubnonce *pubnonces[N_SIGNERS];
-    const secp256k1_musig_partial_sig *partial_sigs[N_SIGNERS];
-    /* The same for all signers */
-    secp256k1_musig_session session;
-
-    for (i = 0; i < N_SIGNERS; i++) {
-        unsigned char seckey[32];
-        unsigned char session_id[32];
-        /* Create random session ID. It is absolutely necessary that the session ID
-         * is unique for every call of secp256k1_musig_nonce_gen. Otherwise
-         * it's trivial for an attacker to extract the secret key! */
-        if (!fill_random(session_id, sizeof(session_id))) {
-            return 0;
-        }
-        if (!secp256k1_keypair_sec(ctx, seckey, &signer_secrets[i].keypair)) {
-            return 0;
-        }
-        /* Initialize session and create secret nonce for signing and public
-         * nonce to send to the other signers. */
-        if (!secp256k1_musig_nonce_gen(ctx, &signer_secrets[i].secnonce, &signer[i].pubnonce, session_id, seckey, &signer[i].pubkey, msg32, NULL, NULL)) {
-            return 0;
-        }
-        pubnonces[i] = &signer[i].pubnonce;
-    }
-    /* Communication round 1: A production system would exchange public nonces
-     * here before moving on. */
-    for (i = 0; i < N_SIGNERS; i++) {
-        secp256k1_musig_aggnonce agg_pubnonce;
-
-        /* Create aggregate nonce and initialize the session */
-        if (!secp256k1_musig_nonce_agg(ctx, &agg_pubnonce, pubnonces, N_SIGNERS)) {
-            return 0;
-        }
-        if (!secp256k1_musig_nonce_process(ctx, &session, &agg_pubnonce, msg32, cache, NULL)) {
-            return 0;
-        }
-        /* partial_sign will clear the secnonce by setting it to 0. That's because
-         * you must _never_ reuse the secnonce (or use the same session_id to
-         * create a secnonce). If you do, you effectively reuse the nonce and
-         * leak the secret key. */
-        if (!secp256k1_musig_partial_sign(ctx, &signer[i].partial_sig, &signer_secrets[i].secnonce, &signer_secrets[i].keypair, cache, &session)) {
-            return 0;
-        }
-        partial_sigs[i] = &signer[i].partial_sig;
-    }
-    /* Communication round 2: A production system would exchange
-     * partial signatures here before moving on. */
-    for (i = 0; i < N_SIGNERS; i++) {
-        /* To check whether signing was successful, it suffices to either verify
-         * the aggregate signature with the aggregate public key using
-         * secp256k1_schnorrsig_verify, or verify all partial signatures of all
-         * signers individually. Verifying the aggregate signature is cheaper but
-         * verifying the individual partial signatures has the advantage that it
-         * can be used to determine which of the partial signatures are invalid
-         * (if any), i.e., which of the partial signatures cause the aggregate
-         * signature to be invalid and thus the protocol run to fail. It's also
-         * fine to first verify the aggregate sig, and only verify the individual
-         * sigs if it does not work.
-         */
-        if (!secp256k1_musig_partial_sig_verify(ctx, &signer[i].partial_sig, &signer[i].pubnonce, &signer[i].pubkey, cache, &session)) {
-            return 0;
-        }
-    }
-    return secp256k1_musig_partial_sig_agg(ctx, sig64, &session, partial_sigs, N_SIGNERS);
-}
-
- int main(void) {
-    secp256k1_context* ctx;
-    int i;
-    struct signer_secrets signer_secrets[N_SIGNERS];
-    struct signer signers[N_SIGNERS];
-    const secp256k1_pubkey *pubkeys_ptr[N_SIGNERS];
-    secp256k1_xonly_pubkey agg_pk;
-    secp256k1_musig_keyagg_cache cache;
-    unsigned char msg[32] = "this_could_be_the_hash_of_a_msg!";
-    unsigned char sig[64];
-
-    /* Create a secp256k1 context */
-    ctx = secp256k1_context_create(SECP256K1_CONTEXT_NONE);
-    printf("Creating key pairs......");
-    for (i = 0; i < N_SIGNERS; i++) {
-        if (!create_keypair(ctx, &signer_secrets[i], &signers[i])) {
-            printf("FAILED\n");
-            return 1;
-        }
-        pubkeys_ptr[i] = &signers[i].pubkey;
-    }
-    printf("ok\n");
-    printf("Combining public keys...");
-    /* If you just want to aggregate and not sign the cache can be NULL */
-    if (!secp256k1_musig_pubkey_agg(ctx, NULL, &agg_pk, &cache, pubkeys_ptr, N_SIGNERS)) {
-        printf("FAILED\n");
-        return 1;
-    }
-    printf("ok\n");
-    printf("Tweaking................");
-    /* Optionally tweak the aggregate key */
-    if (!tweak(ctx, &agg_pk, &cache)) {
-        printf("FAILED\n");
-        return 1;
-    }
-    printf("ok\n");
-    printf("Signing message.........");
-    if (!sign(ctx, signer_secrets, signers, &cache, msg, sig)) {
-        printf("FAILED\n");
-        return 1;
-    }
-    printf("ok\n");
-    printf("Verifying signature.....");
-    if (!secp256k1_schnorrsig_verify(ctx, sig, msg, 32, &agg_pk)) {
-        printf("FAILED\n");
-        return 1;
-    }
-    printf("ok\n");
-    secp256k1_context_destroy(ctx);
-    return 0;
-}

examples/schnorr.c

@@ -1,156 +0,0 @@
-/*************************************************************************
- * Written in 2020-2022 by Elichai Turkel                                *
- * To the extent possible under law, the author(s) have dedicated all    *
- * copyright and related and neighboring rights to the software in this  *
- * file to the public domain worldwide. This software is distributed     *
- * without any warranty. For the CC0 Public Domain Dedication, see       *
- * EXAMPLES_COPYING or https://creativecommons.org/publicdomain/zero/1.0 *
- *************************************************************************/
-
-#include <stdio.h>
-#include <assert.h>
-#include <string.h>
-
-#include <secp256k1.h>
-#include <secp256k1_extrakeys.h>
-#include <secp256k1_schnorrsig.h>
-
-#include "examples_util.h"
-
-int main(void) {
-    unsigned char msg[12] = "Hello World!";
-    unsigned char msg_hash[32];
-    unsigned char tag[17] = "my_fancy_protocol";
-    unsigned char seckey[32];
-    unsigned char randomize[32];
-    unsigned char auxiliary_rand[32];
-    unsigned char serialized_pubkey[32];
-    unsigned char signature[64];
-    int is_signature_valid, is_signature_valid2;
-    int return_val;
-    secp256k1_xonly_pubkey pubkey;
-    secp256k1_keypair keypair;
-    /* Before we can call actual API functions, we need to create a "context". */
-    secp256k1_context* ctx = secp256k1_context_create(SECP256K1_CONTEXT_NONE);
-    if (!fill_random(randomize, sizeof(randomize))) {
-        printf("Failed to generate randomness\n");
-        return 1;
-    }
-    /* Randomizing the context is recommended to protect against side-channel
-     * leakage See `secp256k1_context_randomize` in secp256k1.h for more
-     * information about it. This should never fail. */
-    return_val = secp256k1_context_randomize(ctx, randomize);
-    assert(return_val);
-
-    /*** Key Generation ***/
-
-    /* If the secret key is zero or out of range (bigger than secp256k1's
-     * order), we try to sample a new key. Note that the probability of this
-     * happening is negligible. */
-    while (1) {
-        if (!fill_random(seckey, sizeof(seckey))) {
-            printf("Failed to generate randomness\n");
-            return 1;
-        }
-        /* Try to create a keypair with a valid context, it should only fail if
-         * the secret key is zero or out of range. */
-        if (secp256k1_keypair_create(ctx, &keypair, seckey)) {
-            break;
-        }
-    }
-
-    /* Extract the X-only public key from the keypair. We pass NULL for
-     * `pk_parity` as the parity isn't needed for signing or verification.
-     * `secp256k1_keypair_xonly_pub` supports returning the parity for
-     * other use cases such as tests or verifying Taproot tweaks.
-     * This should never fail with a valid context and public key. */
-    return_val = secp256k1_keypair_xonly_pub(ctx, &pubkey, NULL, &keypair);
-    assert(return_val);
-
-    /* Serialize the public key. Should always return 1 for a valid public key. */
-    return_val = secp256k1_xonly_pubkey_serialize(ctx, serialized_pubkey, &pubkey);
-    assert(return_val);
-
-    /*** Signing ***/
-
-    /* Instead of signing (possibly very long) messages directly, we sign a
-     * 32-byte hash of the message in this example.
-     *
-     * We use secp256k1_tagged_sha256 to create this hash. This function expects
-     * a context-specific "tag", which restricts the context in which the signed
-     * messages should be considered valid. For example, if protocol A mandates
-     * to use the tag "my_fancy_protocol" and protocol B mandates to use the tag
-     * "my_boring_protocol", then signed messages from protocol A will never be
-     * valid in protocol B (and vice versa), even if keys are reused across
-     * protocols. This implements "domain separation", which is considered good
-     * practice. It avoids attacks in which users are tricked into signing a
-     * message that has intended consequences in the intended context (e.g.,
-     * protocol A) but would have unintended consequences if it were valid in
-     * some other context (e.g., protocol B). */
-    return_val = secp256k1_tagged_sha256(ctx, msg_hash, tag, sizeof(tag), msg, sizeof(msg));
-    assert(return_val);
-
-    /* Generate 32 bytes of randomness to use with BIP-340 schnorr signing. */
-    if (!fill_random(auxiliary_rand, sizeof(auxiliary_rand))) {
-        printf("Failed to generate randomness\n");
-        return 1;
-    }
-
-    /* Generate a Schnorr signature.
-     *
-     * We use the secp256k1_schnorrsig_sign32 function that provides a simple
-     * interface for signing 32-byte messages (which in our case is a hash of
-     * the actual message). BIP-340 recommends passing 32 bytes of randomness
-     * to the signing function to improve security against side-channel attacks.
-     * Signing with a valid context, a 32-byte message, a verified keypair, and
-     * any 32 bytes of auxiliary random data should never fail. */
-    return_val = secp256k1_schnorrsig_sign32(ctx, signature, msg_hash, &keypair, auxiliary_rand);
-    assert(return_val);
-
-    /*** Verification ***/
-
-    /* Deserialize the public key. This will return 0 if the public key can't
-     * be parsed correctly */
-    if (!secp256k1_xonly_pubkey_parse(ctx, &pubkey, serialized_pubkey)) {
-        printf("Failed parsing the public key\n");
-        return 1;
-    }
-
-    /* Compute the tagged hash on the received messages using the same tag as the signer. */
-    return_val = secp256k1_tagged_sha256(ctx, msg_hash, tag, sizeof(tag), msg, sizeof(msg));
-    assert(return_val);
-
-    /* Verify a signature. This will return 1 if it's valid and 0 if it's not. */
-    is_signature_valid = secp256k1_schnorrsig_verify(ctx, signature, msg_hash, 32, &pubkey);
-
-
-    printf("Is the signature valid? %s\n", is_signature_valid ? "true" : "false");
-    printf("Secret Key: ");
-    print_hex(seckey, sizeof(seckey));
-    printf("Public Key: ");
-    print_hex(serialized_pubkey, sizeof(serialized_pubkey));
-    printf("Signature: ");
-    print_hex(signature, sizeof(signature));
-
-    /* This will clear everything from the context and free the memory */
-    secp256k1_context_destroy(ctx);
-
-    /* Bonus example: if all we need is signature verification (and no key
-       generation or signing), we don't need to use a context created via
-       secp256k1_context_create(). We can simply use the static (i.e., global)
-       context secp256k1_context_static. See its description in
-       include/secp256k1.h for details. */
-    is_signature_valid2 = secp256k1_schnorrsig_verify(secp256k1_context_static,
-                                                      signature, msg_hash, 32, &pubkey);
-    assert(is_signature_valid2 == is_signature_valid);
-
-    /* It's best practice to try to clear secrets from memory after using them.
-     * This is done because some bugs can allow an attacker to leak memory, for
-     * example through "out of bounds" array access (see Heartbleed), Or the OS
-     * swapping them to disk. Hence, we overwrite the secret key buffer with zeros.
-     *
-     * Here we are preventing these writes from being optimized out, as any good compiler
-     * will remove any writes that aren't used. */
-    secure_erase(seckey, sizeof(seckey));
-    return 0;
-}

include/secp256k1_bppp.h

@@ -1,73 +0,0 @@
-#ifndef SECP256K1_BPPP_H
-# define SECP256K1_BPPP_H
-
-# include "secp256k1.h"
-
-# ifdef __cplusplus
-extern "C" {
-# endif
-
-#include <stdint.h>
-
-/** Opaque structure representing a large number of NUMS generators */
-typedef struct secp256k1_bppp_generators secp256k1_bppp_generators;
-
-/** Allocates and initializes a list of NUMS generators.
- *  Returns a list of generators, or calls the error callback if the allocation fails.
- *  Args:          ctx: pointer to a context object
- *                   n: number of NUMS generators to produce.
- *
- * TODO: In a followup range-proof PR, this is would still require 16 + 8 = 24 NUMS
- * points. We will later use G = H0(required for compatibility with pedersen_commitment DS)
- * in a separate commit to make review easier.
- */
-SECP256K1_API secp256k1_bppp_generators *secp256k1_bppp_generators_create(
-    const secp256k1_context *ctx,
-    size_t n
-) SECP256K1_ARG_NONNULL(1);
-
-/** Allocates a list of generators from a static array
- *  Returns a list of generators or NULL in case of failure.
- *  Args:      ctx: pointer to a context object
- *  In:       data: data that came from `secp256k1_bppp_generators_serialize`
- *        data_len: the length of the `data` buffer
- */
-SECP256K1_API secp256k1_bppp_generators *secp256k1_bppp_generators_parse(
-    const secp256k1_context *ctx,
-    const unsigned char *data,
-    size_t data_len
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2);
-
-/** Serializes a list of generators to an array
- *  Returns 1 on success, 0 if the provided array was not large enough
- *  Args:        ctx: pointer to a context object
- *               gen: pointer to the generator set to be serialized
- *  Out:        data: pointer to buffer into which the generators will be serialized
- *  In/Out: data_len: the length of the `data` buffer. Should be at least
- *                    k = 33 * num_gens. Will be set to k on successful return
- *
- * TODO: For ease of review, this setting G = H0 is not included in this commit. We will
- * add it in the follow-up rangeproof PR.
- */
-SECP256K1_API int secp256k1_bppp_generators_serialize(
-    const secp256k1_context *ctx,
-    const secp256k1_bppp_generators *gen,
-    unsigned char *data,
-    size_t *data_len
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4);
-
-/** Destroys a list of NUMS generators, freeing allocated memory
- *  Args:   ctx: pointer to a context object
- *          gen: pointer to the generator set to be destroyed
- *               (can be NULL, in which case this function is a no-op)
- */
-SECP256K1_API void secp256k1_bppp_generators_destroy(
-    const secp256k1_context *ctx,
-    secp256k1_bppp_generators *gen
-) SECP256K1_ARG_NONNULL(1);
-
-# ifdef __cplusplus
-}
-# endif
-
-#endif

include/secp256k1_ecdh.h

@@ -1,63 +1,31 @@
-#ifndef SECP256K1_ECDH_H
-#define SECP256K1_ECDH_H
+#ifndef _SECP256K1_ECDH_
+# define _SECP256K1_ECDH_
 
-#include "secp256k1.h"
+# include "secp256k1.h"
 
-#ifdef __cplusplus
+# ifdef __cplusplus
 extern "C" {
-#endif
-
-/** A pointer to a function that hashes an EC point to obtain an ECDH secret
- *
- *  Returns: 1 if the point was successfully hashed.
- *           0 will cause secp256k1_ecdh to fail and return 0.
- *           Other return values are not allowed, and the behaviour of
- *           secp256k1_ecdh is undefined for other return values.
- *  Out:     output:     pointer to an array to be filled by the function
- *  In:      x32:        pointer to a 32-byte x coordinate
- *           y32:        pointer to a 32-byte y coordinate
- *           data:       arbitrary data pointer that is passed through
- */
-typedef int (*secp256k1_ecdh_hash_function)(
-  unsigned char *output,
-  const unsigned char *x32,
-  const unsigned char *y32,
-  void *data
-);
-
-/** An implementation of SHA256 hash function that applies to compressed public key.
- * Populates the output parameter with 32 bytes. */
-SECP256K1_API const secp256k1_ecdh_hash_function secp256k1_ecdh_hash_function_sha256;
-
-/** A default ECDH hash function (currently equal to secp256k1_ecdh_hash_function_sha256).
- * Populates the output parameter with 32 bytes. */
-SECP256K1_API const secp256k1_ecdh_hash_function secp256k1_ecdh_hash_function_default;
+# endif
 
 /** Compute an EC Diffie-Hellman secret in constant time
- *
  *  Returns: 1: exponentiation was successful
- *           0: scalar was invalid (zero or overflow) or hashfp returned 0
- *  Args:    ctx:        pointer to a context object.
- *  Out:     output:     pointer to an array to be filled by hashfp.
- *  In:      pubkey:     pointer to a secp256k1_pubkey containing an initialized public key.
- *           seckey:     a 32-byte scalar with which to multiply the point.
- *           hashfp:     pointer to a hash function. If NULL,
- *                       secp256k1_ecdh_hash_function_sha256 is used
- *                       (in which case, 32 bytes will be written to output).
- *           data:       arbitrary data pointer that is passed through to hashfp
- *                       (can be NULL for secp256k1_ecdh_hash_function_sha256).
+ *           0: scalar was invalid (zero or overflow)
+ *  Args:    ctx:        pointer to a context object (cannot be NULL)
+ *  Out:     result:     a 32-byte array which will be populated by an ECDH
+ *                       secret computed from the point and scalar
+ *  In:      pubkey:     a pointer to a secp256k1_pubkey containing an
+ *                       initialized public key
+ *           privkey:    a 32-byte scalar with which to multiply the point
  */
 SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_ecdh(
-  const secp256k1_context *ctx,
-  unsigned char *output,
+  const secp256k1_context* ctx,
+  unsigned char *result,
   const secp256k1_pubkey *pubkey,
-  const unsigned char *seckey,
-  secp256k1_ecdh_hash_function hashfp,
-  void *data
+  const unsigned char *privkey
 ) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4);
 
-#ifdef __cplusplus
+# ifdef __cplusplus
 }
-#endif
+# endif
 
-#endif /* SECP256K1_ECDH_H */
+#endif

include/secp256k1_ecdsa_adaptor.h

@@ -1,164 +0,0 @@
-#ifndef SECP256K1_ECDSA_ADAPTOR_H
-#define SECP256K1_ECDSA_ADAPTOR_H
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-#include "secp256k1.h"
-
-/** This module implements single signer ECDSA adaptor signatures following
- *  "One-Time Verifiably Encrypted Signatures A.K.A. Adaptor Signatures" by
- *  Lloyd Fournier
- *  (https://lists.linuxfoundation.org/pipermail/lightning-dev/2019-November/002316.html
- *  and https://github.com/LLFourn/one-time-VES/blob/master/main.pdf).
- *
- *  WARNING! DANGER AHEAD!
- *  As mentioned in Lloyd Fournier's paper, the adaptor signature leaks the
- *  Elliptic-curve Diffie–Hellman (ECDH) key between the signing key and the
- *  encryption key. This is not a problem for ECDSA adaptor signatures
- *  themselves, but may result in a complete loss of security when they are
- *  composed with other schemes. More specifically, let us refer to the
- *  signer's public key as X = x*G, and to the encryption key as Y = y*G.
- *  Given X, Y and the adaptor signature, it is trivial to compute Y^x = X^y.
- *
- *  A defense is to not reuse the signing key of ECDSA adaptor signatures in
- *  protocols that rely on the hardness of the CDH problem, e.g., Diffie-Hellman
- *  key exchange and ElGamal encryption. In general, it is a well-established
- *  cryptographic practice to seperate keys for different purposes whenever
- *  possible.
- */
-
-/** A pointer to a function to deterministically generate a nonce.
- *
- *  Same as secp256k1_nonce_function_hardened with the exception of using the
- *  compressed 33-byte encoding for the pubkey argument.
- *
- *  Returns: 1 if a nonce was successfully generated. 0 will cause signing to
- *           return an error.
- *  Out:     nonce32:   pointer to a 32-byte array to be filled by the function
- *  In:        msg32:   the 32-byte message hash being verified
- *             key32:   pointer to a 32-byte secret key
- *              pk33:   the 33-byte serialized pubkey corresponding to key32
- *              algo:   pointer to an array describing the signature algorithm
- *           algolen:   the length of the algo array
- *              data:   arbitrary data pointer that is passed through
- *
- *  Except for test cases, this function should compute some cryptographic hash of
- *  the message, the key, the pubkey, the algorithm description, and data.
- */
-typedef int (*secp256k1_nonce_function_hardened_ecdsa_adaptor)(
-    unsigned char *nonce32,
-    const unsigned char *msg32,
-    const unsigned char *key32,
-    const unsigned char *pk33,
-    const unsigned char *algo,
-    size_t algolen,
-    void *data
-);
-
-/** A modified BIP-340 nonce generation function. If a data pointer is passed, it is
- *  assumed to be a pointer to 32 bytes of auxiliary random data as defined in BIP-340.
- *  The hash will be tagged with algo after removing all terminating null bytes.
- */
-SECP256K1_API const secp256k1_nonce_function_hardened_ecdsa_adaptor secp256k1_nonce_function_ecdsa_adaptor;
-
-/** Encrypted Signing
- *
- *  Creates an adaptor signature, which includes a proof to verify the adaptor
- *  signature.
- *  WARNING: Make sure you have read and understood the WARNING at the top of
- *  this file and applied the suggested countermeasures.
- *
- *  Returns: 1 on success, 0 on failure
- *  Args:             ctx: pointer to a context object (not secp256k1_context_static)
- *  Out:   adaptor_sig162: pointer to 162 byte to store the returned signature
- *  In:          seckey32: pointer to 32 byte secret key that will be used for
- *                         signing
- *                 enckey: pointer to the encryption public key
- *                  msg32: pointer to the 32-byte message hash to sign
- *                noncefp: pointer to a nonce generation function. If NULL,
- *                         secp256k1_nonce_function_ecdsa_adaptor is used
- *                  ndata: pointer to arbitrary data used by the nonce generation
- *                         function (can be NULL). If it is non-NULL and
- *                         secp256k1_nonce_function_ecdsa_adaptor is used, then
- *                         ndata must be a pointer to 32-byte auxiliary randomness
- *                         as per BIP-340.
- */
-SECP256K1_API int secp256k1_ecdsa_adaptor_encrypt(
-    const secp256k1_context *ctx,
-    unsigned char *adaptor_sig162,
-    unsigned char *seckey32,
-    const secp256k1_pubkey *enckey,
-    const unsigned char *msg32,
-    secp256k1_nonce_function_hardened_ecdsa_adaptor noncefp,
-    void *ndata
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4) SECP256K1_ARG_NONNULL(5);
-
-/** Encryption Verification
- *
- *  Verifies that the adaptor decryption key can be extracted from the adaptor signature
- *  and the completed ECDSA signature.
- *
- *  Returns: 1 on success, 0 on failure
- *  Args:            ctx: pointer to a context object
- *  In:   adaptor_sig162: pointer to 162-byte signature to verify
- *                pubkey: pointer to the public key corresponding to the secret key
- *                        used for signing
- *                 msg32: pointer to the 32-byte message hash being verified
- *                enckey: pointer to the adaptor encryption public key
- */
-SECP256K1_API int secp256k1_ecdsa_adaptor_verify(
-    const secp256k1_context *ctx,
-    const unsigned char *adaptor_sig162,
-    const secp256k1_pubkey *pubkey,
-    const unsigned char *msg32,
-    const secp256k1_pubkey *enckey
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4) SECP256K1_ARG_NONNULL(5);
-
-/** Signature Decryption
- *
- *  Derives an ECDSA signature from an adaptor signature and an adaptor decryption key.
- *
- *  Returns: 1 on success, 0 on failure
- *  Args:              ctx: pointer to a context object
- *  Out:               sig: pointer to the ECDSA signature to create
- *  In:           deckey32: pointer to 32-byte decryption secret key for the adaptor
- *                          encryption public key
- *          adaptor_sig162: pointer to 162-byte adaptor sig
- */
-SECP256K1_API int secp256k1_ecdsa_adaptor_decrypt(
-    const secp256k1_context *ctx,
-    secp256k1_ecdsa_signature *sig,
-    const unsigned char *deckey32,
-    const unsigned char *adaptor_sig162
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4);
-
-/** Decryption Key Recovery
- *
- *  Extracts the adaptor decryption key from the complete signature and the adaptor
- *  signature.
- *
- *  Returns: 1 on success, 0 on failure
- *  Args:             ctx: pointer to a context object (not secp256k1_context_static)
- *  Out:         deckey32: pointer to 32-byte adaptor decryption key for the adaptor
- *                         encryption public key
- *  In:               sig: pointer to ECDSA signature to recover the adaptor decryption
- *                         key from
- *         adaptor_sig162: pointer to adaptor signature to recover the adaptor
- *                         decryption key from
- *                 enckey: pointer to the adaptor encryption public key
- */
-SECP256K1_API int secp256k1_ecdsa_adaptor_recover(
-    const secp256k1_context *ctx,
-    unsigned char *deckey32,
-    const secp256k1_ecdsa_signature *sig,
-    const unsigned char *adaptor_sig162,
-    const secp256k1_pubkey *enckey
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4) SECP256K1_ARG_NONNULL(5);
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif /* SECP256K1_ECDSA_ADAPTOR_H */

include/secp256k1_ecdsa_s2c.h

@@ -1,234 +0,0 @@
-#ifndef SECP256K1_ECDSA_S2C_H
-#define SECP256K1_ECDSA_S2C_H
-
-#include "secp256k1.h"
-
-/** This module implements the sign-to-contract scheme for ECDSA signatures, as
- *  well as the "ECDSA Anti-Exfil Protocol" that is based on sign-to-contract
- *  and is specified further down. The sign-to-contract scheme allows creating a
- *  signature that also commits to some data. This works by offsetting the public
- *  nonce point of the signature R by hash(R, data)*G where G is the secp256k1
- *  group generator.
- */
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/** Data structure that holds a sign-to-contract ("s2c") opening information.
- *  Sign-to-contract allows a signer to commit to some data as part of a signature. It
- *  can be used as an Out-argument in certain signing functions.
- *
- *  The exact representation of data inside is implementation defined and not
- *  guaranteed to be portable between different platforms or versions. It is
- *  however guaranteed to be 64 bytes in size, and can be safely copied/moved.
- *  If you need to convert to a format suitable for storage, transmission, or
- *  comparison, use secp256k1_ecdsa_s2c_opening_serialize and secp256k1_ecdsa_s2c_opening_parse.
- */
-typedef struct {
-    unsigned char data[64];
-} secp256k1_ecdsa_s2c_opening;
-
-/** Parse a sign-to-contract opening.
- *
- *  Returns: 1 if the opening could be parsed
- *           0 if the opening could not be parsed
- *  Args:    ctx: pointer to a context object
- *  Out: opening: pointer to an opening object. If 1 is returned, it is set to a
- *                parsed version of input. If not, its value is unspecified.
- *  In:  input33: pointer to 33-byte array with a serialized opening
- *
- */
-SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_ecdsa_s2c_opening_parse(
-    const secp256k1_context *ctx,
-    secp256k1_ecdsa_s2c_opening *opening,
-    const unsigned char *input33
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
-
-/** Serialize a sign-to-contract opening into a byte sequence.
- *
- *  Returns: 1 if the opening was successfully serialized.
- *           0 if the opening could not be serialized
- *  Args:     ctx: pointer to a context object
- *  Out: output33: pointer to a 33-byte array to place the serialized opening in
- *  In:   opening: pointer to an initialized `secp256k1_ecdsa_s2c_opening`
- */
-SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_ecdsa_s2c_opening_serialize(
-    const secp256k1_context *ctx,
-    unsigned char *output33,
-    const secp256k1_ecdsa_s2c_opening *opening
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
-
-/** Same as secp256k1_ecdsa_sign, but s2c_data32 is committed to inside the nonce
- *
- *  Returns: 1: signature created
- *           0: the nonce generation function failed, or the private key was invalid.
- *  Args:    ctx: pointer to a context object (not secp256k1_context_static)
- *  Out:     sig: pointer to an array where the signature will be placed (cannot be NULL)
- *   s2c_opening: if non-NULL, pointer to an secp256k1_ecdsa_s2c_opening structure to populate
- *  In:    msg32: the 32-byte message hash being signed (cannot be NULL)
- *        seckey: pointer to a 32-byte secret key (cannot be NULL)
- *    s2c_data32: pointer to a 32-byte data to commit to in the nonce (cannot be NULL)
- */
-SECP256K1_API int secp256k1_ecdsa_s2c_sign(
-    const secp256k1_context *ctx,
-    secp256k1_ecdsa_signature *sig,
-    secp256k1_ecdsa_s2c_opening *s2c_opening,
-    const unsigned char *msg32,
-    const unsigned char *seckey,
-    const unsigned char *s2c_data32
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(4) SECP256K1_ARG_NONNULL(5) SECP256K1_ARG_NONNULL(6);
-
-/** Verify a sign-to-contract commitment.
- *
- *  Returns: 1: the signature contains a commitment to data32 (though it does
- *              not necessarily need to be a valid siganture!)
- *           0: incorrect opening
- *  Args:    ctx: pointer to a context object
- *  In:      sig: the signature containing the sign-to-contract commitment (cannot be NULL)
- *        data32: the 32-byte data that was committed to (cannot be NULL)
- *       opening: pointer to the opening created during signing (cannot be NULL)
- */
-SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_ecdsa_s2c_verify_commit(
-    const secp256k1_context *ctx,
-    const secp256k1_ecdsa_signature *sig,
-    const unsigned char *data32,
-    const secp256k1_ecdsa_s2c_opening *opening
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4);
-
-
-/** ECDSA Anti-Exfil Protocol
- *
- *  The ecdsa_anti_exfil_* functions can be used to prevent a signing device from
- *  exfiltrating the secret signing keys through biased signature nonces. The general
- *  idea is that a host provides additional randomness to the signing device client
- *  and the client commits to the randomness in the nonce using sign-to-contract.
- *
- *  The following scheme is described by Stepan Snigirev here:
- *    https://lists.linuxfoundation.org/pipermail/bitcoin-dev/2020-February/017655.html
- *  and by Pieter Wuille (as "Scheme 6") here:
- *    https://lists.linuxfoundation.org/pipermail/bitcoin-dev/2020-March/017667.html
- *
- *  In order to ensure the host cannot trick the signing device into revealing its
- *  keys, or the signing device to bias the nonce despite the host's contributions,
- *  the host and client must engage in a commit-reveal protocol as follows:
- *  1. The host draws randomness `rho` and computes a sha256 commitment to it using
- *     `secp256k1_ecdsa_anti_exfil_host_commit`. It sends this to the signing device.
- *  2. The signing device computes a public nonce `R` using the host's commitment
- *     as auxiliary randomness, using `secp256k1_ecdsa_anti_exfil_signer_commit`.
- *     The signing device sends the resulting `R` to the host as a s2c_opening.
- *
- *     If, at any point from this step onward, the hardware device fails, it is
- *     okay to restart the protocol using **exactly the same `rho`** and checking
- *     that the hardware device proposes **exactly the same** `R`. Otherwise, the
- *     hardware device may be selectively aborting and thereby biasing the set of
- *     nonces that are used in actual signatures.
- *
- *     It takes many (>100) such aborts before there is a plausible attack, given
- *     current knowledge in 2020. However such aborts accumulate even across a total
- *     replacement of all relevant devices (but not across replacement of the actual
- *     signing keys with new independently random ones).
- *
- *     In case the hardware device cannot be made to sign with the given `rho`, `R`
- *     pair, wallet authors should alert the user and present a very scary message
- *     implying that if this happens more than even a few times, say 20 or more times
- *     EVER, they should change hardware vendors and perhaps sweep their coins.
- *
- *  3. The host replies with `rho` generated in step 1.
- *  4. The device signs with `secp256k1_anti_exfil_sign`, using `rho` as `host_data32`,
- *     and sends the signature to the host.
- *  5. The host verifies that the signature's public nonce matches the opening from
- *     step 2 and its original randomness `rho`, using `secp256k1_anti_exfil_host_verify`.
- *
- *  Rationale:
- *      - The reason for having a host commitment is to allow the signing device to
- *        deterministically derive a unique nonce even if the host restarts the protocol
- *        using the same message and keys. Otherwise the signer might reuse the original
- *        nonce in two iterations of the protocol with different `rho`, which leaks the
- *        the secret key.
- *      - The signer does not need to check that the host commitment matches the host's
- *        claimed `rho`. Instead it re-derives the commitment (and its original `R`) from
- *        the provided `rho`. If this differs from the original commitment, the result
- *        will be an invalid `s2c_opening`, but since `R` was unique there is no risk to
- *        the signer's secret keys. Because of this, the signing device does not need to
- *        maintain any state about the progress of the protocol.
- */
-
-/** Create the initial host commitment to `rho`. Part of the ECDSA Anti-Exfil Protocol.
- *
- *  Returns 1 on success, 0 on failure.
- *  Args:              ctx: pointer to a context object (cannot be NULL)
- *  Out: rand_commitment32: pointer to 32-byte array to store the returned commitment (cannot be NULL)
- *  In:             rand32: the 32-byte randomness to commit to (cannot be NULL). It must come from
- *                          a cryptographically secure RNG. As per the protocol, this value must not
- *                          be revealed to the client until after the host has received the client
- *                          commitment.
- */
-SECP256K1_API int secp256k1_ecdsa_anti_exfil_host_commit(
-    const secp256k1_context *ctx,
-    unsigned char *rand_commitment32,
-    const unsigned char *rand32
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
-
-/** Compute signer's original nonce. Part of the ECDSA Anti-Exfil Protocol.
- *
- *  Returns 1 on success, 0 on failure.
- *  Args:           ctx: pointer to a context object (not secp256k1_context_static)
- *  Out:    s2c_opening: pointer to an s2c_opening where the signer's public nonce will be
- *                       placed. (cannot be NULL)
- *  In:           msg32: the 32-byte message hash to be signed (cannot be NULL)
- *             seckey32: the 32-byte secret key used for signing (cannot be NULL)
- *    rand_commitment32: the 32-byte randomness commitment from the host (cannot be NULL)
- */
-SECP256K1_API int secp256k1_ecdsa_anti_exfil_signer_commit(
-    const secp256k1_context *ctx,
-    secp256k1_ecdsa_s2c_opening *s2c_opening,
-    const unsigned char *msg32,
-    const unsigned char *seckey32,
-    const unsigned char *rand_commitment32
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4) SECP256K1_ARG_NONNULL(5);
-
-/** Same as secp256k1_ecdsa_sign, but commits to host randomness in the nonce. Part of the
- *  ECDSA Anti-Exfil Protocol.
- *
- *  Returns: 1: signature created
- *           0: the nonce generation function failed, or the private key was invalid.
- *  Args:    ctx: pointer to a context object (not secp256k1_context_static)
- *  Out:     sig: pointer to an array where the signature will be placed (cannot be NULL)
- *  In:    msg32: the 32-byte message hash being signed (cannot be NULL)
- *        seckey: pointer to a 32-byte secret key (cannot be NULL)
- *   host_data32: pointer to 32-byte host-provided randomness (cannot be NULL)
- */
-SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_anti_exfil_sign(
-    const secp256k1_context *ctx,
-    secp256k1_ecdsa_signature *sig,
-    const unsigned char *msg32,
-    const unsigned char *seckey,
-    const unsigned char *host_data32
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4) SECP256K1_ARG_NONNULL(5);
-
-/** Verify a signature was correctly constructed using the ECDSA Anti-Exfil Protocol.
- *
- *  Returns: 1: the signature is valid and contains a commitment to host_data32
- *           0: incorrect opening
- *  Args:    ctx: pointer to a context object
- *  In:      sig: the signature produced by the signer (cannot be NULL)
- *     msghash32: the 32-byte message hash being verified (cannot be NULL)
- *        pubkey: pointer to the signer's public key (cannot be NULL)
- *   host_data32: the 32-byte data provided by the host (cannot be NULL)
- *       opening: the s2c opening provided by the signer (cannot be NULL)
- */
-SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_anti_exfil_host_verify(
-    const secp256k1_context *ctx,
-    const secp256k1_ecdsa_signature *sig,
-    const unsigned char *msg32,
-    const secp256k1_pubkey *pubkey,
-    const unsigned char *host_data32,
-    const secp256k1_ecdsa_s2c_opening *opening
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4) SECP256K1_ARG_NONNULL(5) SECP256K1_ARG_NONNULL(6);
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif /* SECP256K1_ECDSA_S2C_H */

include/secp256k1_ellswift.h

@@ -1,200 +0,0 @@
-#ifndef SECP256K1_ELLSWIFT_H
-#define SECP256K1_ELLSWIFT_H
-
-#include "secp256k1.h"
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/* This module provides an implementation of ElligatorSwift as well as a
- * version of x-only ECDH using it (including compatibility with BIP324).
- *
- * ElligatorSwift is described in https://eprint.iacr.org/2022/759 by
- * Chavez-Saab, Rodriguez-Henriquez, and Tibouchi. It permits encoding
- * uniformly chosen public keys as 64-byte arrays which are indistinguishable
- * from uniformly random arrays.
- *
- * Let f be the function from pairs of field elements to point X coordinates,
- * defined as follows (all operations modulo p = 2^256 - 2^32 - 977)
- * f(u,t):
- * - Let C = 0xa2d2ba93507f1df233770c2a797962cc61f6d15da14ecd47d8d27ae1cd5f852,
- *   a square root of -3.
- * - If u=0, set u=1 instead.
- * - If t=0, set t=1 instead.
- * - If u^3 + t^2 + 7 = 0, multiply t by 2.
- * - Let X = (u^3 + 7 - t^2) / (2 * t)
- * - Let Y = (X + t) / (C * u)
- * - Return the first in [u + 4 * Y^2, (-X/Y - u) / 2, (X/Y - u) / 2] that is an
- *   X coordinate on the curve (at least one of them is, for any u and t).
- *
- * Then an ElligatorSwift encoding of x consists of the 32-byte big-endian
- * encodings of field elements u and t concatenated, where f(u,t) = x.
- * The encoding algorithm is described in the paper, and effectively picks a
- * uniformly random pair (u,t) among those which encode x.
- *
- * If the Y coordinate is relevant, it is given the same parity as t.
- *
- * Changes w.r.t. the the paper:
- * - The u=0, t=0, and u^3+t^2+7=0 conditions result in decoding to the point
- *   at infinity in the paper. Here they are remapped to finite points.
- * - The paper uses an additional encoding bit for the parity of y. Here the
- *   parity of t is used (negating t does not affect the decoded x coordinate,
- *   so this is possible).
- *
- * For mathematical background about the scheme, see the doc/ellswift.md file.
- */
-
-/** A pointer to a function used by secp256k1_ellswift_xdh to hash the shared X
- *  coordinate along with the encoded public keys to a uniform shared secret.
- *
- *  Returns: 1 if a shared secret was successfully computed.
- *           0 will cause secp256k1_ellswift_xdh to fail and return 0.
- *           Other return values are not allowed, and the behaviour of
- *           secp256k1_ellswift_xdh is undefined for other return values.
- *  Out:     output:     pointer to an array to be filled by the function
- *  In:      x32:        pointer to the 32-byte serialized X coordinate
- *                       of the resulting shared point (will not be NULL)
- *           ell_a64:    pointer to the 64-byte encoded public key of party A
- *                       (will not be NULL)
- *           ell_b64:    pointer to the 64-byte encoded public key of party B
- *                       (will not be NULL)
- *           data:       arbitrary data pointer that is passed through
- */
-typedef int (*secp256k1_ellswift_xdh_hash_function)(
-    unsigned char *output,
-    const unsigned char *x32,
-    const unsigned char *ell_a64,
-    const unsigned char *ell_b64,
-    void *data
-);
-
-/** An implementation of an secp256k1_ellswift_xdh_hash_function which uses
- *  SHA256(prefix64 || ell_a64 || ell_b64 || x32), where prefix64 is the 64-byte
- *  array pointed to by data. */
-SECP256K1_API const secp256k1_ellswift_xdh_hash_function secp256k1_ellswift_xdh_hash_function_prefix;
-
-/** An implementation of an secp256k1_ellswift_xdh_hash_function compatible with
- *  BIP324. It returns H_tag(ell_a64 || ell_b64 || x32), where H_tag is the
- *  BIP340 tagged hash function with tag "bip324_ellswift_xonly_ecdh". Equivalent
- *  to secp256k1_ellswift_xdh_hash_function_prefix with prefix64 set to
- *  SHA256("bip324_ellswift_xonly_ecdh")||SHA256("bip324_ellswift_xonly_ecdh").
- *  The data argument is ignored. */
-SECP256K1_API const secp256k1_ellswift_xdh_hash_function secp256k1_ellswift_xdh_hash_function_bip324;
-
-/** Construct a 64-byte ElligatorSwift encoding of a given pubkey.
- *
- *  Returns: 1 always.
- *  Args:    ctx:        pointer to a context object
- *  Out:     ell64:      pointer to a 64-byte array to be filled
- *  In:      pubkey:     pointer to a secp256k1_pubkey containing an
- *                       initialized public key
- *           rnd32:      pointer to 32 bytes of randomness
- *
- * It is recommended that rnd32 consists of 32 uniformly random bytes, not
- * known to any adversary trying to detect whether public keys are being
- * encoded, though 16 bytes of randomness (padded to an array of 32 bytes,
- * e.g., with zeros) suffice to make the result indistinguishable from
- * uniform. The randomness in rnd32 must not be a deterministic function of
- * the pubkey (it can be derived from the private key, though).
- *
- * It is not guaranteed that the computed encoding is stable across versions
- * of the library, even if all arguments to this function (including rnd32)
- * are the same.
- *
- * This function runs in variable time.
- */
-SECP256K1_API int secp256k1_ellswift_encode(
-    const secp256k1_context *ctx,
-    unsigned char *ell64,
-    const secp256k1_pubkey *pubkey,
-    const unsigned char *rnd32
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4);
-
-/** Decode a 64-bytes ElligatorSwift encoded public key.
- *
- *  Returns: always 1
- *  Args:    ctx:        pointer to a context object
- *  Out:     pubkey:     pointer to a secp256k1_pubkey that will be filled
- *  In:      ell64:      pointer to a 64-byte array to decode
- *
- * This function runs in variable time.
- */
-SECP256K1_API int secp256k1_ellswift_decode(
-    const secp256k1_context *ctx,
-    secp256k1_pubkey *pubkey,
-    const unsigned char *ell64
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
-
-/** Compute an ElligatorSwift public key for a secret key.
- *
- *  Returns: 1: secret was valid, public key was stored.
- *           0: secret was invalid, try again.
- *  Args:    ctx:        pointer to a context object
- *  Out:     ell64:      pointer to a 64-byte array to receive the ElligatorSwift
- *                       public key
- *  In:      seckey32:   pointer to a 32-byte secret key
- *           auxrnd32:   (optional) pointer to 32 bytes of randomness
- *
- * Constant time in seckey and auxrnd32, but not in the resulting public key.
- *
- * It is recommended that auxrnd32 contains 32 uniformly random bytes, though
- * it is optional (and does result in encodings that are indistinguishable from
- * uniform even without any auxrnd32). It differs from the (mandatory) rnd32
- * argument to secp256k1_ellswift_encode in this regard.
- *
- * This function can be used instead of calling secp256k1_ec_pubkey_create
- * followed by secp256k1_ellswift_encode. It is safer, as it uses the secret
- * key as entropy for the encoding (supplemented with auxrnd32, if provided).
- *
- * Like secp256k1_ellswift_encode, this function does not guarantee that the
- * computed encoding is stable across versions of the library, even if all
- * arguments (including auxrnd32) are the same.
- */
-SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_ellswift_create(
-    const secp256k1_context *ctx,
-    unsigned char *ell64,
-    const unsigned char *seckey32,
-    const unsigned char *auxrnd32
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
-
-/** Given a private key, and ElligatorSwift public keys sent in both directions,
- *  compute a shared secret using x-only Elliptic Curve Diffie-Hellman (ECDH).
- *
- *  Returns: 1: shared secret was successfully computed
- *           0: secret was invalid or hashfp returned 0
- *  Args:    ctx:       pointer to a context object.
- *  Out:     output:    pointer to an array to be filled by hashfp.
- *  In:      ell_a64:   pointer to the 64-byte encoded public key of party A
- *                      (will not be NULL)
- *           ell_b64:   pointer to the 64-byte encoded public key of party B
- *                      (will not be NULL)
- *           seckey32:  pointer to our 32-byte secret key
- *           party:     boolean indicating which party we are: zero if we are
- *                      party A, non-zero if we are party B. seckey32 must be
- *                      the private key corresponding to that party's ell_?64.
- *                      This correspondence is not checked.
- *           hashfp:    pointer to a hash function.
- *           data:      arbitrary data pointer passed through to hashfp.
- *
- * Constant time in seckey32.
- *
- * This function is more efficient than decoding the public keys, and performing
- * ECDH on them.
- */
-SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_ellswift_xdh(
-  const secp256k1_context *ctx,
-  unsigned char *output,
-  const unsigned char *ell_a64,
-  const unsigned char *ell_b64,
-  const unsigned char *seckey32,
-  int party,
-  secp256k1_ellswift_xdh_hash_function hashfp,
-  void *data
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4) SECP256K1_ARG_NONNULL(5) SECP256K1_ARG_NONNULL(7);
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif /* SECP256K1_ELLSWIFT_H */

include/secp256k1_extrakeys.h

@@ -1,262 +0,0 @@
-#ifndef SECP256K1_EXTRAKEYS_H
-#define SECP256K1_EXTRAKEYS_H
-
-#include "secp256k1.h"
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/** Opaque data structure that holds a parsed and valid "x-only" public key.
- *  An x-only pubkey encodes a point whose Y coordinate is even. It is
- *  serialized using only its X coordinate (32 bytes). See BIP-340 for more
- *  information about x-only pubkeys.
- *
- *  The exact representation of data inside is implementation defined and not
- *  guaranteed to be portable between different platforms or versions. It is
- *  however guaranteed to be 64 bytes in size, and can be safely copied/moved.
- *  If you need to convert to a format suitable for storage, transmission, use
- *  use secp256k1_xonly_pubkey_serialize and secp256k1_xonly_pubkey_parse. To
- *  compare keys, use secp256k1_xonly_pubkey_cmp.
- */
-typedef struct {
-    unsigned char data[64];
-} secp256k1_xonly_pubkey;
-
-/** Opaque data structure that holds a keypair consisting of a secret and a
- *  public key.
- *
- *  The exact representation of data inside is implementation defined and not
- *  guaranteed to be portable between different platforms or versions. It is
- *  however guaranteed to be 96 bytes in size, and can be safely copied/moved.
- */
-typedef struct {
-    unsigned char data[96];
-} secp256k1_keypair;
-
-/** Parse a 32-byte sequence into a xonly_pubkey object.
- *
- *  Returns: 1 if the public key was fully valid.
- *           0 if the public key could not be parsed or is invalid.
- *
- *  Args:   ctx: pointer to a context object.
- *  Out: pubkey: pointer to a pubkey object. If 1 is returned, it is set to a
- *               parsed version of input. If not, it's set to an invalid value.
- *  In: input32: pointer to a serialized xonly_pubkey.
- */
-SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_xonly_pubkey_parse(
-    const secp256k1_context *ctx,
-    secp256k1_xonly_pubkey *pubkey,
-    const unsigned char *input32
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
-
-/** Serialize an xonly_pubkey object into a 32-byte sequence.
- *
- *  Returns: 1 always.
- *
- *  Args:     ctx: pointer to a context object.
- *  Out: output32: pointer to a 32-byte array to place the serialized key in.
- *  In:    pubkey: pointer to a secp256k1_xonly_pubkey containing an initialized public key.
- */
-SECP256K1_API int secp256k1_xonly_pubkey_serialize(
-    const secp256k1_context *ctx,
-    unsigned char *output32,
-    const secp256k1_xonly_pubkey *pubkey
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
-
-/** Compare two x-only public keys using lexicographic order
- *
- *  Returns: <0 if the first public key is less than the second
- *           >0 if the first public key is greater than the second
- *           0 if the two public keys are equal
- *  Args: ctx:      pointer to a context object.
- *  In:   pubkey1:  first public key to compare
- *        pubkey2:  second public key to compare
- */
-SECP256K1_API int secp256k1_xonly_pubkey_cmp(
-    const secp256k1_context *ctx,
-    const secp256k1_xonly_pubkey *pk1,
-    const secp256k1_xonly_pubkey *pk2
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
-
-/** Converts a secp256k1_pubkey into a secp256k1_xonly_pubkey.
- *
- *  Returns: 1 always.
- *
- *  Args:         ctx: pointer to a context object.
- *  Out: xonly_pubkey: pointer to an x-only public key object for placing the converted public key.
- *          pk_parity: Ignored if NULL. Otherwise, pointer to an integer that
- *                     will be set to 1 if the point encoded by xonly_pubkey is
- *                     the negation of the pubkey and set to 0 otherwise.
- *  In:        pubkey: pointer to a public key that is converted.
- */
-SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_xonly_pubkey_from_pubkey(
-    const secp256k1_context *ctx,
-    secp256k1_xonly_pubkey *xonly_pubkey,
-    int *pk_parity,
-    const secp256k1_pubkey *pubkey
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(4);
-
-/** Tweak an x-only public key by adding the generator multiplied with tweak32
- *  to it.
- *
- *  Note that the resulting point can not in general be represented by an x-only
- *  pubkey because it may have an odd Y coordinate. Instead, the output_pubkey
- *  is a normal secp256k1_pubkey.
- *
- *  Returns: 0 if the arguments are invalid or the resulting public key would be
- *           invalid (only when the tweak is the negation of the corresponding
- *           secret key). 1 otherwise.
- *
- *  Args:           ctx: pointer to a context object.
- *  Out:  output_pubkey: pointer to a public key to store the result. Will be set
- *                       to an invalid value if this function returns 0.
- *  In: internal_pubkey: pointer to an x-only pubkey to apply the tweak to.
- *              tweak32: pointer to a 32-byte tweak, which must be valid
- *                       according to secp256k1_ec_seckey_verify or 32 zero
- *                       bytes. For uniformly random 32-byte tweaks, the chance of
- *                       being invalid is negligible (around 1 in 2^128).
- */
-SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_xonly_pubkey_tweak_add(
-    const secp256k1_context *ctx,
-    secp256k1_pubkey *output_pubkey,
-    const secp256k1_xonly_pubkey *internal_pubkey,
-    const unsigned char *tweak32
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4);
-
-/** Checks that a tweaked pubkey is the result of calling
- *  secp256k1_xonly_pubkey_tweak_add with internal_pubkey and tweak32.
- *
- *  The tweaked pubkey is represented by its 32-byte x-only serialization and
- *  its pk_parity, which can both be obtained by converting the result of
- *  tweak_add to a secp256k1_xonly_pubkey.
- *
- *  Note that this alone does _not_ verify that the tweaked pubkey is a
- *  commitment. If the tweak is not chosen in a specific way, the tweaked pubkey
- *  can easily be the result of a different internal_pubkey and tweak.
- *
- *  Returns: 0 if the arguments are invalid or the tweaked pubkey is not the
- *           result of tweaking the internal_pubkey with tweak32. 1 otherwise.
- *  Args:            ctx: pointer to a context object.
- *  In: tweaked_pubkey32: pointer to a serialized xonly_pubkey.
- *     tweaked_pk_parity: the parity of the tweaked pubkey (whose serialization
- *                        is passed in as tweaked_pubkey32). This must match the
- *                        pk_parity value that is returned when calling
- *                        secp256k1_xonly_pubkey with the tweaked pubkey, or
- *                        this function will fail.
- *       internal_pubkey: pointer to an x-only public key object to apply the tweak to.
- *               tweak32: pointer to a 32-byte tweak.
- */
-SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_xonly_pubkey_tweak_add_check(
-    const secp256k1_context *ctx,
-    const unsigned char *tweaked_pubkey32,
-    int tweaked_pk_parity,
-    const secp256k1_xonly_pubkey *internal_pubkey,
-    const unsigned char *tweak32
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(4) SECP256K1_ARG_NONNULL(5);
-
-/** Compute the keypair for a secret key.
- *
- *  Returns: 1: secret was valid, keypair is ready to use
- *           0: secret was invalid, try again with a different secret
- *  Args:    ctx: pointer to a context object (not secp256k1_context_static).
- *  Out: keypair: pointer to the created keypair.
- *  In:   seckey: pointer to a 32-byte secret key.
- */
-SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_keypair_create(
-    const secp256k1_context *ctx,
-    secp256k1_keypair *keypair,
-    const unsigned char *seckey
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
-
-/** Get the secret key from a keypair.
- *
- *  Returns: 1 always.
- *  Args:   ctx: pointer to a context object.
- *  Out: seckey: pointer to a 32-byte buffer for the secret key.
- *  In: keypair: pointer to a keypair.
- */
-SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_keypair_sec(
-    const secp256k1_context *ctx,
-    unsigned char *seckey,
-    const secp256k1_keypair *keypair
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
-
-/** Get the public key from a keypair.
- *
- *  Returns: 1 always.
- *  Args:   ctx: pointer to a context object.
- *  Out: pubkey: pointer to a pubkey object, set to the keypair public key.
- *  In: keypair: pointer to a keypair.
- */
-SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_keypair_pub(
-    const secp256k1_context *ctx,
-    secp256k1_pubkey *pubkey,
-    const secp256k1_keypair *keypair
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
-
-/** Get the x-only public key from a keypair.
- *
- *  This is the same as calling secp256k1_keypair_pub and then
- *  secp256k1_xonly_pubkey_from_pubkey.
- *
- *  Returns: 1 always.
- *  Args:   ctx: pointer to a context object.
- *  Out: pubkey: pointer to an xonly_pubkey object, set to the keypair
- *               public key after converting it to an xonly_pubkey.
- *    pk_parity: Ignored if NULL. Otherwise, pointer to an integer that will be set to the
- *               pk_parity argument of secp256k1_xonly_pubkey_from_pubkey.
- *  In: keypair: pointer to a keypair.
- */
-SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_keypair_xonly_pub(
-    const secp256k1_context *ctx,
-    secp256k1_xonly_pubkey *pubkey,
-    int *pk_parity,
-    const secp256k1_keypair *keypair
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(4);
-
-/** Tweak a keypair by adding tweak32 to the secret key and updating the public
- *  key accordingly.
- *
- *  Calling this function and then secp256k1_keypair_pub results in the same
- *  public key as calling secp256k1_keypair_xonly_pub and then
- *  secp256k1_xonly_pubkey_tweak_add.
- *
- *  Returns: 0 if the arguments are invalid or the resulting keypair would be
- *           invalid (only when the tweak is the negation of the keypair's
- *           secret key). 1 otherwise.
- *
- *  Args:       ctx: pointer to a context object.
- *  In/Out: keypair: pointer to a keypair to apply the tweak to. Will be set to
- *                   an invalid value if this function returns 0.
- *  In:     tweak32: pointer to a 32-byte tweak, which must be valid according to
- *                   secp256k1_ec_seckey_verify or 32 zero bytes. For uniformly
- *                   random 32-byte tweaks, the chance of being invalid is
- *                   negligible (around 1 in 2^128).
- */
-SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_keypair_xonly_tweak_add(
-    const secp256k1_context *ctx,
-    secp256k1_keypair *keypair,
-    const unsigned char *tweak32
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
-
-/** Sort public keys using lexicographic order of their compressed
- *  serialization.
- *
- *  Returns: 0 if the arguments are invalid. 1 otherwise.
- *
- *  Args:     ctx: pointer to a context object
- *  In:   pubkeys: array of pointers to pubkeys to sort
- *      n_pubkeys: number of elements in the pubkeys array
- */
-SECP256K1_API int secp256k1_pubkey_sort(
-    const secp256k1_context *ctx,
-    const secp256k1_pubkey **pubkeys,
-    size_t n_pubkeys
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2);
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif /* SECP256K1_EXTRAKEYS_H */

include/secp256k1_frost.h

@@ -1,695 +0,0 @@
-#ifndef SECP256K1_FROST_H
-#define SECP256K1_FROST_H
-
-#include "secp256k1_extrakeys.h"
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-#include <stdint.h>
-
-/** This code is currently a work in progress. It's not secure nor stable.
- * IT IS EXTREMELY DANGEROUS AND RECKLESS TO USE THIS MODULE IN PRODUCTION!
- *
- * This module implements a variant of Flexible Round-Optimized Schnorr
- * Threshold Signatures (FROST) by Chelsea Komlo and Ian Goldberg
- * (https://crysp.uwaterloo.ca/software/frost/). Signatures are compatible with
- * BIP-340 ("Schnorr"). There's an example C source file in the module's
- * directory (examples/frost.c) that demonstrates how it can be used.
- *
- * The module also supports BIP-341 ("Taproot") and BIP-32 ("ordinary") public
- * key tweaking, and adaptor signatures.
- *
- * It is recommended to read the documentation in this include file carefully.
- * Further notes on API usage can be found in src/modules/frost/frost.md
- *
- * Following the convention used in the MuSig module, the API uses the singular
- * term "nonce" to refer to the two "nonces" used by the FROST scheme.
- */
-
-/** Opaque data structures
- *
- *  The exact representation of data inside is implementation defined and not
- *  guaranteed to be portable between different platforms or versions. If you
- *  need to convert to a format suitable for storage, transmission, or
- *  comparison, use the corresponding serialization and parsing functions.
- */
-
-/** Opaque data structure that caches information about key tweaking.
- *
- *  Guaranteed to be 101 bytes in size. It can be safely copied/moved. No
- *  serialization and parsing functions.
- */
-typedef struct {
-    unsigned char data[101];
-} secp256k1_frost_tweak_cache;
-
-/** Opaque data structure that holds a signer's _secret_ share.
- *
- *  Guaranteed to be 36 bytes in size. Serialized and parsed with
- *  `frost_share_serialize` and `frost_share_parse`.
- */
-typedef struct {
-    unsigned char data[36];
-} secp256k1_frost_share;
-
-/** Opaque data structure that holds a signer's _secret_ nonce.
- *
- *  Guaranteed to be 68 bytes in size.
- *
- *  WARNING: This structure MUST NOT be copied or read or written to directly.
- *  A signer who is online throughout the whole process and can keep this
- *  structure in memory can use the provided API functions for a safe standard
- *  workflow. See
- *  https://blockstream.com/2019/02/18/musig-a-new-multisignature-standard/ for
- *  more details about the risks associated with serializing or deserializing
- *  this structure.
- *
- *  We repeat, copying this data structure can result in nonce reuse which will
- *  leak the secret signing key.
- */
-typedef struct {
-    unsigned char data[68];
-} secp256k1_frost_secnonce;
-
-/** Opaque data structure that holds a signer's public nonce.
-*
-*  Guaranteed to be 132 bytes in size. It can be safely copied/moved.
-*  Serialized and parsed with `frost_pubnonce_serialize` and
-*  `frost_pubnonce_parse`.
-*/
-typedef struct {
-    unsigned char data[132];
-} secp256k1_frost_pubnonce;
-
-/** Opaque data structure that holds a FROST session.
- *
- *  This structure is not required to be kept secret for the signing protocol
- *  to be secure. Guaranteed to be 133 bytes in size. It can be safely
- *  copied/moved. No serialization and parsing functions.
- */
-typedef struct {
-    unsigned char data[133];
-} secp256k1_frost_session;
-
-/** Opaque data structure that holds a partial FROST signature.
- *
- *  Guaranteed to be 36 bytes in size. Serialized and parsed with
- *  `frost_partial_sig_serialize` and `frost_partial_sig_parse`.
- */
-typedef struct {
-    unsigned char data[36];
-} secp256k1_frost_partial_sig;
-
-/** Parse a signer's public nonce.
- *
- *  Returns: 1 when the nonce could be parsed, 0 otherwise.
- *  Args:    ctx: pointer to a context object
- *  Out:   nonce: pointer to a nonce object
- *  In:     in66: pointer to the 66-byte nonce to be parsed
- */
-SECP256K1_API int secp256k1_frost_pubnonce_parse(
-    const secp256k1_context *ctx,
-    secp256k1_frost_pubnonce *nonce,
-    const unsigned char *in66
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
-
-/** Serialize a signer's public nonce
- *
- *  Returns: 1 when the nonce could be serialized, 0 otherwise
- *  Args:    ctx: pointer to a context object
- *  Out:   out66: pointer to a 66-byte array to store the serialized nonce
- *  In:    nonce: pointer to the nonce
- */
-SECP256K1_API int secp256k1_frost_pubnonce_serialize(
-    const secp256k1_context *ctx,
-    unsigned char *out66,
-    const secp256k1_frost_pubnonce *nonce
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
-
-/** Serialize a FROST partial signature
- *
- *  Returns: 1 when the signature could be serialized, 0 otherwise
- *  Args:    ctx: pointer to a context object
- *  Out:   out32: pointer to a 32-byte array to store the serialized signature
- *  In:      sig: pointer to the signature
- */
-SECP256K1_API int secp256k1_frost_partial_sig_serialize(
-    const secp256k1_context *ctx,
-    unsigned char *out32,
-    const secp256k1_frost_partial_sig *sig
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
-
-/** Parse a FROST partial signature.
- *
- *  Returns: 1 when the signature could be parsed, 0 otherwise.
- *  Args:    ctx: pointer to a context object
- *  Out:     sig: pointer to a signature object
- *  In:     in32: pointer to the 32-byte signature to be parsed
- *
- *  After the call, sig will always be initialized. If parsing failed or the
- *  encoded numbers are out of range, signature verification with it is
- *  guaranteed to fail for every message and public key.
- */
-SECP256K1_API int secp256k1_frost_partial_sig_parse(
-    const secp256k1_context *ctx,
-    secp256k1_frost_partial_sig *sig,
-    const unsigned char *in32
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
-
-/** Serialize a FROST share
- *
- *  Returns: 1 when the share could be serialized, 0 otherwise
- *  Args:    ctx: pointer to a context object
- *  Out:   out32: pointer to a 32-byte array to store the serialized share
- *  In:    share: pointer to the share
- */
-SECP256K1_API int secp256k1_frost_share_serialize(
-    const secp256k1_context *ctx,
-    unsigned char *out32,
-    const secp256k1_frost_share *share
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
-
-/** Parse a FROST share.
- *
- *  Returns: 1 when the share could be parsed, 0 otherwise.
- *  Args:    ctx: pointer to a context object
- *  Out:   share: pointer to a share object
- *  In:     in32: pointer to the 32-byte share to be parsed
- */
-SECP256K1_API int secp256k1_frost_share_parse(
-    const secp256k1_context *ctx,
-    secp256k1_frost_share *share,
-    const unsigned char *in32
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
-
-/** Creates key shares
- *
- *  To generate a key, each participant generates a share for each other
- *  participant. For example, in the case of 2 particpants, Alice and Bob, they
- *  each generate 2 shares, distribute 1 share to each other using a secure
- *  channel, and keep 1 for themselves.
- *
- *  Each participant must transmit shares over secure channels to each other
- *  participant.
- *
- *  Each call to this function must have a UNIQUE and uniformly RANDOM seed32
- *  that must that must NOT BE REUSED in subsequent calls to this function and
- *  must be KEPT SECRET (even from other participants).
- *
- *  Returns: 0 if the arguments are invalid, 1 otherwise
- *  Args:            ctx: pointer to a context object
- *  Out:          shares: pointer to the key shares
- *        vss_commitment: pointer to the VSS commitment
- *                 pok64: pointer to the proof of knowledge
- *   In:          seed32: 32-byte random seed as explained above. Must be
- *                        unique to this call to secp256k1_frost_shares_gen
- *                        and must be uniformly random.
- *             threshold: the minimum number of signers required to produce a
- *                        signature
- *        n_participants: the total number of participants
- *                 ids33: array of 33-byte participant IDs
- */
-SECP256K1_API int secp256k1_frost_shares_gen(
-    const secp256k1_context *ctx,
-    secp256k1_frost_share *shares,
-    secp256k1_pubkey *vss_commitment,
-    unsigned char *pok64,
-    const unsigned char *seed32,
-    size_t threshold,
-    size_t n_participants,
-    const unsigned char * const* ids33
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4) SECP256K1_ARG_NONNULL(5) SECP256K1_ARG_NONNULL(8);
-
-/** Aggregates shares
- *
- *  As part of the key generation protocol, each participant receives a share
- *  from each participant, including a share they "receive" from themselves.
- *  This function verifies those shares against their VSS commitments,
- *  aggregates the shares, and then aggregates the commitments to each
- *  participant's first polynomial coefficient to derive the aggregate public
- *  key.
- *
- *  If this function returns an error, `secp256k1_frost_share_verify` can be
- *  called on each share to determine which participants submitted faulty
- *  shares.
- *
- *  Returns: 0 if the arguments are invalid, 1 otherwise (which does NOT mean
- *           the resulting signature verifies).
- *  Args:         ctx: pointer to a context object
- *  Out:    agg_share: the aggregated share
- *             agg_pk: the aggregated x-only public key
- *  In:        shares: all key generation shares for the partcipant's index
- *    vss_commitments: coefficient commitments of all participants ordered by
- *                     the x-only pubkeys of the participants
- *           n_shares: the total number of shares
- *          threshold: the minimum number of shares required to produce a
- *                     signature
- *               id33: the 33-byte ID of the participant whose shares are being
- *                     aggregated
- */
-SECP256K1_API int secp256k1_frost_share_agg(
-    const secp256k1_context *ctx,
-    secp256k1_frost_share *agg_share,
-    secp256k1_xonly_pubkey *agg_pk,
-    const secp256k1_frost_share * const *shares,
-    const secp256k1_pubkey * const *vss_commitments,
-    size_t n_shares,
-    size_t threshold,
-    const unsigned char *id33
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4) SECP256K1_ARG_NONNULL(5) SECP256K1_ARG_NONNULL(8);
-
-/** Verifies a share received during a key generation session
- *
- *  The signature is verified against the VSS commitment received with the
- *  share. This is only useful for purposes of determining which share(s) are
- *  invalid if share_agg returns an error.
- *
- *  Returns: 0 if the arguments are invalid or the share does not verify, 1
- *           otherwise
- *  Args         ctx: pointer to a context object
- *  In:    threshold: the minimum number of signers required to produce a
- *                    signature
- *              id33: the 33-byte participant ID of the share recipient
- *             share: pointer to a key generation share
- *    vss_commitment: the VSS commitment associated with the share
- */
-SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_frost_share_verify(
-    const secp256k1_context *ctx,
-    size_t threshold,
-    const unsigned char *id33,
-    const secp256k1_frost_share *share,
-    const secp256k1_pubkey * const *vss_commitment
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4) SECP256K1_ARG_NONNULL(5);
-
-/** Computes a public verification share used for verifying partial signatures
- *
- *  Returns: 0 if the arguments are invalid, 1 otherwise
- *  Args:        ctx: pointer to a context object
- *  Out:    pubshare: pointer to a struct to store the public verification
- *                    share
- *  In:    threshold: the minimum number of signers required to produce a
- *                    signature
- *              id33: the 33-byte participant ID of the participant whose
- *                    partial signature will be verified with the pubshare
- *   vss_commitments: coefficient commitments of all participants
- *    n_participants: the total number of participants
- */
-SECP256K1_API int secp256k1_frost_compute_pubshare(
-    const secp256k1_context *ctx,
-    secp256k1_pubkey *pubshare,
-    size_t threshold,
-    const unsigned char *id33,
-    const secp256k1_pubkey * const *vss_commitments,
-    size_t n_participants
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(4) SECP256K1_ARG_NONNULL(5);
-
-/** Obtain the aggregate public key from a FROST x-only aggregate public key.
- *
- *  This is only useful if you need the non-xonly public key, in particular for
- *  ordinary (non-xonly) tweaking or batch-verifying multiple key aggregations
- *  (not implemented).
- *
- *  Returns: 0 if the arguments are invalid, 1 otherwise
- *  Args:        ctx: pointer to a context object
- *  Out:   ec_agg_pk: the FROST-aggregated public key.
- *  In: xonly_agg_pk: the aggregated x-only public key that is the output of
- *                    `secp256k1_frost_share_agg`
- */
-SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_frost_pubkey_get(
-    const secp256k1_context *ctx,
-    secp256k1_pubkey *ec_agg_pk,
-    const secp256k1_xonly_pubkey *xonly_agg_pk
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
-
-/** Initializes a tweak cache used for applying tweaks to a FROST key
- *
- *  Returns: 0 if the arguments are invalid, 1 otherwise
- *  Args:        ctx: pointer to a context object
- *  Out: tweak_cache: pointer to a frost_tweak_cache struct that is required
- *                    for key tweaking
- *  In:       agg_pk: the aggregated x-only public key that is the output of
- *                    `secp256k1_frost_share_agg`
- */
-SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_frost_pubkey_tweak(
-    const secp256k1_context *ctx,
-    secp256k1_frost_tweak_cache *tweak_cache,
-    const secp256k1_xonly_pubkey *agg_pk
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
-
-/** Apply ordinary "EC" tweaking to a public key in a given tweak_cache by
- *  adding the generator multiplied with `tweak32` to it. This is useful for
- *  deriving child keys from an aggregate public key via BIP32.
- *
- *  The tweaking method is the same as `secp256k1_ec_pubkey_tweak_add`. So after
- *  the following pseudocode buf and buf2 have identical contents (absent
- *  earlier failures).
- *
- *  secp256k1_frost_share_agg(..., xonly_agg_pk, ...)
- *  secp256k1_frost_pubkey_tweak(..., tweak_cache, xonly_agg_pk)
- *  secp256k1_frost_pubkey_ec_tweak_add(..., output_pk, tweak_cache, tweak32)
- *  secp256k1_ec_pubkey_serialize(..., buf, output_pk)
- *  secp256k1_frost_pubkey_get(..., ec_agg_pk, xonly_agg_pk)
- *  secp256k1_ec_pubkey_tweak_add(..., ec_agg_pk, tweak32)
- *  secp256k1_ec_pubkey_serialize(..., buf2, ec_agg_pk)
- *
- *  This function is required if you want to _sign_ for a tweaked aggregate key.
- *  On the other hand, if you are only computing a public key, but not intending
- *  to create a signature for it, you can just use
- *  `secp256k1_ec_pubkey_tweak_add`.
- *
- *  Returns: 0 if the arguments are invalid or the resulting public key would be
- *           invalid (only when the tweak is the negation of the corresponding
- *           secret key). 1 otherwise.
- *  Args:            ctx: pointer to a context object
- *  Out:   output_pubkey: pointer to a public key to store the result. Will be set
- *                        to an invalid value if this function returns 0. If you
- *                        do not need it, this arg can be NULL.
- *  In/Out:  tweak_cache: pointer to a `frost_tweak_cache` struct initialized by
- *                       `frost_pubkey_tweak`
- *  In:          tweak32: pointer to a 32-byte tweak. If the tweak is invalid
- *                        according to `secp256k1_ec_seckey_verify`, this function
- *                        returns 0. For uniformly random 32-byte arrays the
- *                        chance of being invalid is negligible (around 1 in
- *                        2^128).
- */
-SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_frost_pubkey_ec_tweak_add(
-    const secp256k1_context *ctx,
-    secp256k1_pubkey *output_pubkey,
-    secp256k1_frost_tweak_cache *tweak_cache,
-    const unsigned char *tweak32
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4);
-
-/** Apply x-only tweaking to a public key in a given tweak_cache by adding the
- *  generator multiplied with `tweak32` to it. This is useful for creating
- *  Taproot outputs.
- *
- *  The tweaking method is the same as `secp256k1_xonly_pubkey_tweak_add`. So in
- *  the following pseudocode xonly_pubkey_tweak_add_check (absent earlier
- *  failures) returns 1.
- *
- *  secp256k1_frost_share_agg(..., agg_pk, ...)
- *  secp256k1_frost_pubkey_tweak(..., tweak_cache, agg_pk)
- *  secp256k1_frost_pubkey_xonly_tweak_add(..., output_pk, tweak_cache, tweak32)
- *  secp256k1_xonly_pubkey_serialize(..., buf, output_pk)
- *  secp256k1_xonly_pubkey_tweak_add_check(..., buf, ..., agg_pk, tweak32)
- *
- *  This function is required if you want to _sign_ for a tweaked aggregate key.
- *  On the other hand, if you are only computing a public key, but not intending
- *  to create a signature for it, you can just use
- *  `secp256k1_xonly_pubkey_tweak_add`.
- *
- *  Returns: 0 if the arguments are invalid or the resulting public key would be
- *           invalid (only when the tweak is the negation of the corresponding
- *           secret key). 1 otherwise.
- *  Args:            ctx: pointer to a context object
- *  Out:   output_pubkey: pointer to a public key to store the result. Will be set
- *                        to an invalid value if this function returns 0. If you
- *                        do not need it, this arg can be NULL.
- *  In/Out:  tweak_cache: pointer to a `frost_tweak_cache` struct initialized by
- *                       `frost_pubkey_tweak`
- *  In:          tweak32: pointer to a 32-byte tweak. If the tweak is invalid
- *                        according to secp256k1_ec_seckey_verify, this function
- *                        returns 0. For uniformly random 32-byte arrays the
- *                        chance of being invalid is negligible (around 1 in
- *                        2^128).
- */
-SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_frost_pubkey_xonly_tweak_add(
-    const secp256k1_context *ctx,
-    secp256k1_pubkey *output_pubkey,
-    secp256k1_frost_tweak_cache *tweak_cache,
-    const unsigned char *tweak32
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4);
-
-/** Starts a signing session by generating a nonce
- *
- *  This function outputs a secret nonce that will be required for signing and a
- *  corresponding public nonce that is intended to be sent to other signers.
- *
- *  FROST, like MuSig, differs from regular Schnorr signing in that
- *  implementers _must_ take special care to not reuse a nonce. This can be
- *  ensured by following these rules:
- *
- *  1. Each call to this function must have a UNIQUE session_id32 that must NOT BE
- *     REUSED in subsequent calls to this function.
- *     If you do not provide a seckey, session_id32 _must_ be UNIFORMLY RANDOM
- *     AND KEPT SECRET (even from other signers). If you do provide a seckey,
- *     session_id32 can instead be a counter (that must never repeat!). However,
- *     it is recommended to always choose session_id32 uniformly at random.
- *  2. If you already know the seckey, message or aggregate public key, they
- *     can be optionally provided to derive the nonce and increase
- *     misuse-resistance. The extra_input32 argument can be used to provide
- *     additional data that does not repeat in normal scenarios, such as the
- *     current time.
- *  3. Avoid copying (or serializing) the secnonce. This reduces the possibility
- *     that it is used more than once for signing.
- *
- *  Remember that nonce reuse will leak the secret key!
- *  Note that using the same agg_share for multiple FROST sessions is fine.
- *
- *  Returns: 0 if the arguments are invalid and 1 otherwise
- *  Args:         ctx: pointer to a context object (not secp256k1_context_static)
- *  Out:     secnonce: pointer to a structure to store the secret nonce
- *           pubnonce: pointer to a structure to store the public nonce
- *  In:  session_id32: a 32-byte session_id32 as explained above. Must be
- *                     unique to this call to secp256k1_frost_nonce_gen and
- *                     must be uniformly random unless you really know what you
- *                     are doing.
- *          agg_share: the aggregated share that will later be used for
- *                     signing, if already known (can be NULL)
- *              msg32: the 32-byte message that will later be signed, if
- *                     already known (can be NULL)
- *             agg_pk: the FROST-aggregated public key (can be NULL)
- *      extra_input32: an optional 32-byte array that is input to the nonce
- *                     derivation function (can be NULL)
- */
-SECP256K1_API int secp256k1_frost_nonce_gen(
-    const secp256k1_context *ctx,
-    secp256k1_frost_secnonce *secnonce,
-    secp256k1_frost_pubnonce *pubnonce,
-    const unsigned char *session_id32,
-    const secp256k1_frost_share *agg_share,
-    const unsigned char *msg32,
-    const secp256k1_xonly_pubkey *agg_pk,
-    const unsigned char *extra_input32
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4);
-
-/** Takes the public nonces of all signers and computes a session that is
- *  required for signing and verification of partial signatures. The participant
- *  IDs can be sorted before combining, but the corresponding pubnonces must be
- *  resorted as well. All signers must use the same sorting of pubnonces,
- *  otherwise signing will fail.
- *
- *  Returns: 0 if the arguments are invalid or if some signer sent invalid
- *           pubnonces, 1 otherwise
- *  Args:          ctx: pointer to a context object
- *  Out:       session: pointer to a struct to store the session
- *  In:      pubnonces: array of pointers to public nonces sent by the signers
- *         n_pubnonces: number of elements in the pubnonces array. Must be
- *                      greater than 0.
- *               msg32: the 32-byte message to sign
- *              agg_pk: the FROST-aggregated public key
- *            myd_id33: the 33-byte ID of the participant who will use the
- *                      session for signing
- *               ids33: array of the 33-byte participant IDs of the signers
- *         tweak_cache: pointer to frost_tweak_cache struct (can be NULL)
- *             adaptor: optional pointer to an adaptor point encoded as a
- *                      public key if this signing session is part of an
- *                      adaptor signature protocol (can be NULL)
- */
-SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_frost_nonce_process(
-    const secp256k1_context *ctx,
-    secp256k1_frost_session *session,
-    const secp256k1_frost_pubnonce * const *pubnonces,
-    size_t n_pubnonces,
-    const unsigned char *msg32,
-    const secp256k1_xonly_pubkey *agg_pk,
-    const unsigned char *my_id33,
-    const unsigned char * const* ids33,
-    const secp256k1_frost_tweak_cache *tweak_cache,
-    const secp256k1_pubkey *adaptor
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(5) SECP256K1_ARG_NONNULL(6) SECP256K1_ARG_NONNULL(7) SECP256K1_ARG_NONNULL(8);
-
-/** Produces a partial signature
- *
- *  This function overwrites the given secnonce with zeros and will abort if given a
- *  secnonce that is all zeros. This is a best effort attempt to protect against nonce
- *  reuse. However, this is of course easily defeated if the secnonce has been
- *  copied (or serialized). Remember that nonce reuse will leak the secret key!
- *
- *  Returns: 0 if the arguments are invalid or the provided secnonce has already
- *           been used for signing, 1 otherwise
- *  Args:         ctx: pointer to a context object
- *  Out:  partial_sig: pointer to struct to store the partial signature
- *  In/Out:  secnonce: pointer to the secnonce struct created in
- *                     frost_nonce_gen that has been never used in a
- *                     partial_sign call before
- *  In:     agg_share: the aggregated share
- *            session: pointer to the session that was created with
- *                     frost_nonce_process
- *        tweak_cache: pointer to frost_tweak_cache struct (can be NULL)
- */
-SECP256K1_API int secp256k1_frost_partial_sign(
-    const secp256k1_context *ctx,
-    secp256k1_frost_partial_sig *partial_sig,
-    secp256k1_frost_secnonce *secnonce,
-    const secp256k1_frost_share *agg_share,
-    const secp256k1_frost_session *session,
-    const secp256k1_frost_tweak_cache *tweak_cache
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4) SECP256K1_ARG_NONNULL(5);
-
-/** Verifies an individual signer's partial signature
- *
- *  The signature is verified for a specific signing session. In order to avoid
- *  accidentally verifying a signature from a different or non-existing signing
- *  session, you must ensure the following:
- *    1. The `tweak_cache` argument is identical to the one used to create the
- *       `session` with `frost_nonce_process`.
- *    2. The `pubshare` argument must be the output of
- *       `secp256k1_frost_compute_pubshare` for the signer's ID.
- *    3. The `pubnonce` argument must be identical to the one sent by the
- *       signer and used to create the `session` with `frost_nonce_process`.
- *
- *  This function can be used to assign blame for a failed signature.
- *
- *  Returns: 0 if the arguments are invalid or the partial signature does not
- *           verify, 1 otherwise
- *  Args         ctx: pointer to a context object
- *  In:  partial_sig: pointer to partial signature to verify, sent by
- *                    the signer associated with `pubnonce` and `pubkey`
- *          pubnonce: public nonce of the signer in the signing session
- *          pubshare: public verification share of the signer in the signing
- *                    session that is the output of
- *                    `secp256k1_frost_compute_pubshare`
- *           session: pointer to the session that was created with
- *                    `frost_nonce_process`
- *       tweak_cache: pointer to frost_tweak_cache struct (can be NULL)
- */
-SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_frost_partial_sig_verify(
-    const secp256k1_context *ctx,
-    const secp256k1_frost_partial_sig *partial_sig,
-    const secp256k1_frost_pubnonce *pubnonce,
-    const secp256k1_pubkey *pubshare,
-    const secp256k1_frost_session *session,
-    const secp256k1_frost_tweak_cache *tweak_cache
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4) SECP256K1_ARG_NONNULL(5);
-
-/** Aggregates partial signatures
- *
- *  Returns: 0 if the arguments are invalid, 1 otherwise (which does NOT mean
- *           the resulting signature verifies).
- *  Args:         ctx: pointer to a context object
- *  Out:        sig64: complete (but possibly invalid) Schnorr signature
- *  In:       session: pointer to the session that was created with
- *                     frost_nonce_process
- *       partial_sigs: array of pointers to partial signatures to aggregate
- *             n_sigs: number of elements in the partial_sigs array. Must be
- *                     greater than 0.
- */
-SECP256K1_API int secp256k1_frost_partial_sig_agg(
-    const secp256k1_context *ctx,
-    unsigned char *sig64,
-    const secp256k1_frost_session *session,
-    const secp256k1_frost_partial_sig * const *partial_sigs,
-    size_t n_sigs
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4);
-
-/** Extracts the nonce_parity bit from a session
- *
- *  This is used for adaptor signatures.
- *
- *  Returns: 0 if the arguments are invalid, 1 otherwise
- *  Args:         ctx: pointer to a context object
- *  Out: nonce_parity: pointer to an integer that indicates the parity
- *                     of the aggregate public nonce. Used for adaptor
- *                     signatures.
- *  In:       session: pointer to the session that was created with
- *                     frost_nonce_process
- */
-SECP256K1_API int secp256k1_frost_nonce_parity(
-    const secp256k1_context *ctx,
-    int *nonce_parity,
-    const secp256k1_frost_session *session
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
-
-/** Verifies that the adaptor can be extracted by combining the adaptor
- *  pre-signature and the completed signature.
- *
- *  Returns: 0 if the arguments are invalid or the adaptor signature does not
- *           verify, 1 otherwise
- *  Args:         ctx: pointer to a context object
- *  In:     pre_sig64: 64-byte pre-signature
- *              msg32: the 32-byte message being verified
- *             pubkey: pointer to an x-only public key to verify with
- *            adaptor: pointer to the adaptor point being verified
- *       nonce_parity: the output of `frost_nonce_parity` called with the
- *                     session used for producing the pre-signature
- */
-SECP256K1_API int secp256k1_frost_verify_adaptor(
-    const secp256k1_context *ctx,
-    const unsigned char *pre_sig64,
-    const unsigned char *msg32,
-    const secp256k1_xonly_pubkey *pubkey,
-    const secp256k1_pubkey *adaptor,
-    int nonce_parity
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4) SECP256K1_ARG_NONNULL(5);
-
-/** Creates a signature from a pre-signature and an adaptor.
- *
- *  If the sec_adaptor32 argument is incorrect, the output signature will be
- *  invalid. This function does not verify the signature.
- *
- *  Returns: 0 if the arguments are invalid, or pre_sig64 or sec_adaptor32 contain
- *           invalid (overflowing) values. 1 otherwise (which does NOT mean the
- *           signature or the adaptor are valid!)
- *  Args:         ctx: pointer to a context object
- *  Out:        sig64: 64-byte signature. This pointer may point to the same
- *                     memory area as `pre_sig`.
- *  In:     pre_sig64: 64-byte pre-signature
- *      sec_adaptor32: 32-byte secret adaptor to add to the pre-signature
- *       nonce_parity: the output of `frost_nonce_parity` called with the
- *                     session used for producing the pre-signature
- */
-SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_frost_adapt(
-    const secp256k1_context *ctx,
-    unsigned char *sig64,
-    const unsigned char *pre_sig64,
-    const unsigned char *sec_adaptor32,
-    int nonce_parity
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4);
-
-/** Extracts a secret adaptor from a FROST pre-signature and corresponding
- *  signature
- *
- *  This function will not fail unless given grossly invalid data; if it is
- *  merely given signatures that do not verify, the returned value will be
- *  nonsense. It is therefore important that all data be verified at earlier
- *  steps of any protocol that uses this function. In particular, this includes
- *  verifying all partial signatures that were aggregated into pre_sig64.
- *
- *  Returns: 0 if the arguments are NULL, or sig64 or pre_sig64 contain
- *           grossly invalid (overflowing) values. 1 otherwise (which does NOT
- *           mean the signatures or the adaptor are valid!)
- *  Args:         ctx: pointer to a context object
- *  Out:sec_adaptor32: 32-byte secret adaptor
- *  In:         sig64: complete, valid 64-byte signature
- *          pre_sig64: the pre-signature corresponding to sig64, i.e., the
- *                     aggregate of partial signatures without the secret
- *                     adaptor
- *       nonce_parity: the output of `frost_nonce_parity` called with the
- *                     session used for producing sig64
- */
-SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_frost_extract_adaptor(
-    const secp256k1_context *ctx,
-    unsigned char *sec_adaptor32,
-    const unsigned char *sig64,
-    const unsigned char *pre_sig64,
-    int nonce_parity
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4);
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif

include/secp256k1_generator.h

@@ -1,5 +1,5 @@
-#ifndef SECP256K1_GENERATOR_H
-# define SECP256K1_GENERATOR_H
+#ifndef _SECP256K1_GENERATOR_
+# define _SECP256K1_GENERATOR_
 
 # include "secp256k1.h"
 
@@ -13,61 +13,59 @@ extern "C" {
  *
  *  The exact representation of data inside is implementation defined and not
  *  guaranteed to be portable between different platforms or versions. It is
- *  however guaranteed to be 64 bytes in size, and can be safely copied/moved.
- *  If you need to convert to a format suitable for storage, transmission, or
- *  comparison, use secp256k1_generator_serialize and secp256k1_generator_parse.
+ *  however guaranteed to be 33 bytes in size, and can be safely copied/moved.
+ *  If you need to convert to a format suitable for storage or transmission, use
+ *  the secp256k1_generator_serialize_*.
+ *
+ *  Furthermore, it is guaranteed to identical points will have identical
+ *  representation, so they can be memcmp'ed.
  */
 typedef struct {
-    unsigned char data[64];
+    unsigned char data[33];
 } secp256k1_generator;
 
-/**
- * Static constant generator 'h' maintained for historical reasons.
- */
-SECP256K1_API const secp256k1_generator *secp256k1_generator_h;
-
 /** Parse a 33-byte generator byte sequence into a generator object.
  *
  *  Returns: 1 if input contains a valid generator.
- *  Args: ctx:      pointer to a context object
- *  Out:  gen:      pointer to the output generator object
+ *  Args: ctx:      a secp256k1 context object.
+ *  Out:  commit:   pointer to the output generator object
  *  In:   input:    pointer to a 33-byte serialized generator
  */
 SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_generator_parse(
-    const secp256k1_context *ctx,
-    secp256k1_generator *gen,
+    const secp256k1_context* ctx,
+    secp256k1_generator* commit,
     const unsigned char *input
 ) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
 
 /** Serialize a 33-byte generator into a serialized byte sequence.
  *
  *  Returns: 1 always.
- *  Args:   ctx:        pointer to a context object
- *  Out:    output:     pointer to a 33-byte byte array
- *  In:     gen:        pointer to a generator object
+ *  Args:   ctx:        a secp256k1 context object.
+ *  Out:    output:     a pointer to a 33-byte byte array
+ *  In:     commit:     a pointer to a generator
  */
 SECP256K1_API int secp256k1_generator_serialize(
-    const secp256k1_context *ctx,
+    const secp256k1_context* ctx,
     unsigned char *output,
-    const secp256k1_generator *gen
+    const secp256k1_generator* commit
 ) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
 
 /** Generate a generator for the curve.
  *
  *  Returns: 0 in the highly unlikely case the seed is not acceptable,
  *           1 otherwise.
- *  Args: ctx:     pointer to a context object
- *  Out:  gen:     pointer to a the new generator object
- *  In:   seed32:  32-byte seed
+ *  Args: ctx:     a secp256k1 context object
+ *  Out:  gen:     a generator object
+ *  In:   seed32:  a 32-byte seed
  *
- *  If successful a valid generator will be placed in gen. The produced
+ *  If succesful, a valid generator will be placed in gen. The produced
  *  generators are distributed uniformly over the curve, and will not have a
- *  known discrete logarithm with respect to any other generator produced,
+ *  known dicrete logarithm with respect to any other generator produced,
  *  or to the base generator G.
  */
 SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_generator_generate(
-    const secp256k1_context *ctx,
-    secp256k1_generator *gen,
+    const secp256k1_context* ctx,
+    secp256k1_generator* gen,
     const unsigned char *seed32
 ) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
 
@@ -75,165 +73,22 @@ SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_generator_generate(
  *
  *  Returns: 0 in the highly unlikely case the seed is not acceptable or when
  *           blind is out of range. 1 otherwise.
- *  Args: ctx:     pointer to a context object (not secp256k1_context_static)
- *  Out:  gen:     pointer to a generator object
- *  In:   seed32:  32-byte seed
- *        blind32: 32-byte secret value to blind the generator with.
+ *  Args: ctx:     a secp256k1 context object, initialized for signing
+ *  Out:  gen:     a generator object
+ *  In:   seed32:  a 32-byte seed
+ *        blind32: a 32-byte secret value to blind the generator with.
  *
  *  The result is equivalent to first calling secp256k1_generator_generate,
  *  converting the result to a public key, calling secp256k1_ec_pubkey_tweak_add,
  *  and then converting back to generator form.
  */
 SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_generator_generate_blinded(
-    const secp256k1_context *ctx,
-    secp256k1_generator *gen,
-    const unsigned char *seed32,
+    const secp256k1_context* ctx,
+    secp256k1_generator* gen,
+    const unsigned char *key32,
     const unsigned char *blind32
 ) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4);
 
-/** Opaque data structure that stores a Pedersen commitment
- *
- *  The exact representation of data inside is implementation defined and not
- *  guaranteed to be portable between different platforms or versions. It is
- *  however guaranteed to be 64 bytes in size, and can be safely copied/moved.
- *  If you need to convert to a format suitable for storage, transmission, or
- *  comparison, use secp256k1_pedersen_commitment_serialize and
- *  secp256k1_pedersen_commitment_parse.
- */
-typedef struct {
-    unsigned char data[64];
-} secp256k1_pedersen_commitment;
-
-/** Parse a 33-byte commitment into a commitment object.
- *
- *  Returns: 1 if input contains a valid commitment.
- *  Args: ctx:      pointer to a context object
- *  Out:  commit:   pointer to the output commitment object
- *  In:   input:    pointer to a 33-byte serialized commitment key
- */
-SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_pedersen_commitment_parse(
-    const secp256k1_context *ctx,
-    secp256k1_pedersen_commitment *commit,
-    const unsigned char *input
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
-
-/** Serialize a commitment object into a serialized byte sequence.
- *
- *  Returns: 1 always.
- *  Args:   ctx:        pointer to a context object
- *  Out:    output:     pointer to a 33-byte byte array
- *  In:     commit:     pointer to a secp256k1_pedersen_commitment containing an
- *                      initialized commitment
- */
-SECP256K1_API int secp256k1_pedersen_commitment_serialize(
-    const secp256k1_context *ctx,
-    unsigned char *output,
-    const secp256k1_pedersen_commitment *commit
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
-
-/** Generate a pedersen commitment.
- *  Returns 1: Commitment successfully created.
- *          0: Error. The blinding factor is larger than the group order
- *             (probability for random 32 byte number < 2^-127) or results in the
- *             point at infinity. Retry with a different factor.
- *  In:     ctx:        pointer to a context object (not secp256k1_context_static)
- *          blind:      pointer to a 32-byte blinding factor (cannot be NULL)
- *          value:      unsigned 64-bit integer value to commit to.
- *          gen:        additional generator 'h'
- *  Out:    commit:     pointer to the commitment (cannot be NULL)
- *
- *  Blinding factors can be generated and verified in the same way as secp256k1 private keys for ECDSA.
- */
-SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_pedersen_commit(
-  const secp256k1_context *ctx,
-  secp256k1_pedersen_commitment *commit,
-  const unsigned char *blind,
-  uint64_t value,
-  const secp256k1_generator *gen
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(5);
-
-/** Computes the sum of multiple positive and negative blinding factors.
- *  Returns 1: Sum successfully computed.
- *          0: Error. A blinding factor is larger than the group order
- *             (probability for random 32 byte number < 2^-127). Retry with
- *             different factors.
- *  In:     ctx:        pointer to a context object (cannot be NULL)
- *          blinds:     pointer to pointers to 32-byte character arrays for blinding factors. (cannot be NULL)
- *          n:          number of factors pointed to by blinds.
- *          npositive:       how many of the initial factors should be treated with a positive sign.
- *  Out:    blind_out:  pointer to a 32-byte array for the sum (cannot be NULL)
- */
-SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_pedersen_blind_sum(
-  const secp256k1_context *ctx,
-  unsigned char *blind_out,
-  const unsigned char * const *blinds,
-  size_t n,
-  size_t npositive
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
-
-/** Verify a tally of pedersen commitments
- * Returns 1: commitments successfully sum to zero.
- *         0: Commitments do not sum to zero or other error.
- * In:     ctx:        pointer to a context object (cannot be NULL)
- *         commits:    pointer to array of pointers to the commitments. (cannot be NULL if pcnt is non-zero)
- *         pcnt:       number of commitments pointed to by commits.
- *         ncommits:   pointer to array of pointers to the negative commitments. (cannot be NULL if ncnt is non-zero)
- *         ncnt:       number of commitments pointed to by ncommits.
- *
- * This computes sum(commit[0..pcnt)) - sum(ncommit[0..ncnt)) == 0.
- *
- * A pedersen commitment is xG + vA where G and A are generators for the secp256k1 group and x is a blinding factor,
- * while v is the committed value. For a collection of commitments to sum to zero, for each distinct generator
- * A all blinding factors and all values must sum to zero.
- *
- */
-SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_pedersen_verify_tally(
-  const secp256k1_context *ctx,
-  const secp256k1_pedersen_commitment * const *commits,
-  size_t pcnt,
-  const secp256k1_pedersen_commitment * const *ncommits,
-  size_t ncnt
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(4);
-
-/** Sets the final Pedersen blinding factor correctly when the generators themselves
- *  have blinding factors.
- *
- * Consider a generator of the form A' = A + rG, where A is the "real" generator
- * but A' is the generator provided to verifiers. Then a Pedersen commitment
- * P = vA' + r'G really has the form vA + (vr + r')G. To get all these (vr + r')
- * to sum to zero for multiple commitments, we take three arrays consisting of
- * the `v`s, `r`s, and `r'`s, respectively called `value`s, `generator_blind`s
- * and `blinding_factor`s, and sum them.
- *
- * The function then subtracts the sum of all (vr + r') from the last element
- * of the `blinding_factor` array, setting the total sum to zero.
- *
- * Returns 1: Blinding factor successfully computed.
- *         0: Error. A blinding_factor or generator_blind are larger than the group
- *            order (probability for random 32 byte number < 2^-127). Retry with
- *            different values.
- *
- * In:                 ctx: pointer to a context object
- *                   value: array of asset values, `v` in the above paragraph.
- *                          May not be NULL unless `n_total` is 0.
- *         generator_blind: array of asset blinding factors, `r` in the above paragraph
- *                          May not be NULL unless `n_total` is 0.
- *                 n_total: Total size of the above arrays
- *                n_inputs: How many of the initial array elements represent commitments that
- *                          will be negated in the final sum
- * In/Out: blinding_factor: array of commitment blinding factors, `r'` in the above paragraph
- *                          May not be NULL unless `n_total` is 0.
- *                          the last value will be modified to get the total sum to zero.
- */
-SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_pedersen_blind_generator_blind_sum(
-  const secp256k1_context *ctx,
-  const uint64_t *value,
-  const unsigned char * const *generator_blind,
-  unsigned char * const *blinding_factor,
-  size_t n_total,
-  size_t n_inputs
-);
-
 # ifdef __cplusplus
 }
 # endif

include/secp256k1_musig.h

@@ -1,609 +0,0 @@
-#ifndef SECP256K1_MUSIG_H
-#define SECP256K1_MUSIG_H
-
-#include "secp256k1_extrakeys.h"
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-#include <stddef.h>
-
-/** This module implements BIP 327 "MuSig2 for BIP340-compatible
- * Multi-Signatures"
- * (https://github.com/bitcoin/bips/blob/master/bip-0327.mediawiki)
- * v1.0.0. You can find an example demonstrating the musig module in
- * examples/musig.c.
- *
- * The module also supports BIP-341 ("Taproot") public key tweaking and adaptor
- * signatures as described in
- * https://github.com/ElementsProject/scriptless-scripts/pull/24.
- *
- * It is recommended to read the documentation in this include file carefully.
- * Further notes on API usage can be found in src/modules/musig/musig.md
- *
- * Since the first version of MuSig is essentially replaced by MuSig2, we use
- * MuSig, musig and MuSig2 synonymously unless noted otherwise.
- */
-
-/** Opaque data structures
- *
- *  The exact representation of data inside is implementation defined and not
- *  guaranteed to be portable between different platforms or versions. If you
- *  need to convert to a format suitable for storage, transmission, or
- *  comparison, use the corresponding serialization and parsing functions.
- */
-
-/** Opaque data structure that caches information about public key aggregation.
- *
- *  Guaranteed to be 197 bytes in size. It can be safely copied/moved. No
- *  serialization and parsing functions (yet).
- */
-typedef struct {
-    unsigned char data[197];
-} secp256k1_musig_keyagg_cache;
-
-/** Opaque data structure that holds a signer's _secret_ nonce.
- *
- *  Guaranteed to be 132 bytes in size.
- *
- *  WARNING: This structure MUST NOT be copied or read or written to directly. A
- *  signer who is online throughout the whole process and can keep this
- *  structure in memory can use the provided API functions for a safe standard
- *  workflow. See
- *  https://blockstream.com/2019/02/18/musig-a-new-multisignature-standard/ for
- *  more details about the risks associated with serializing or deserializing
- *  this structure.
- *
- *  We repeat, copying this data structure can result in nonce reuse which will
- *  leak the secret signing key.
- */
-typedef struct {
-    unsigned char data[132];
-} secp256k1_musig_secnonce;
-
-/** Opaque data structure that holds a signer's public nonce.
-*
-*  Guaranteed to be 132 bytes in size. It can be safely copied/moved. Serialized
-*  and parsed with `musig_pubnonce_serialize` and `musig_pubnonce_parse`.
-*/
-typedef struct {
-    unsigned char data[132];
-} secp256k1_musig_pubnonce;
-
-/** Opaque data structure that holds an aggregate public nonce.
- *
- *  Guaranteed to be 132 bytes in size. It can be safely copied/moved.
- *  Serialized and parsed with `musig_aggnonce_serialize` and
- *  `musig_aggnonce_parse`.
- */
-typedef struct {
-    unsigned char data[132];
-} secp256k1_musig_aggnonce;
-
-/** Opaque data structure that holds a MuSig session.
- *
- *  This structure is not required to be kept secret for the signing protocol to
- *  be secure. Guaranteed to be 133 bytes in size. It can be safely
- *  copied/moved. No serialization and parsing functions (yet).
- */
-typedef struct {
-    unsigned char data[133];
-} secp256k1_musig_session;
-
-/** Opaque data structure that holds a partial MuSig signature.
- *
- *  Guaranteed to be 36 bytes in size. Serialized and parsed with
- *  `musig_partial_sig_serialize` and `musig_partial_sig_parse`.
- */
-typedef struct {
-    unsigned char data[36];
-} secp256k1_musig_partial_sig;
-
-/** Parse a signer's public nonce.
- *
- *  Returns: 1 when the nonce could be parsed, 0 otherwise.
- *  Args:    ctx: pointer to a context object
- *  Out:   nonce: pointer to a nonce object
- *  In:     in66: pointer to the 66-byte nonce to be parsed
- */
-SECP256K1_API int secp256k1_musig_pubnonce_parse(
-    const secp256k1_context *ctx,
-    secp256k1_musig_pubnonce *nonce,
-    const unsigned char *in66
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
-
-/** Serialize a signer's public nonce
- *
- *  Returns: 1 when the nonce could be serialized, 0 otherwise
- *  Args:    ctx: pointer to a context object
- *  Out:   out66: pointer to a 66-byte array to store the serialized nonce
- *  In:    nonce: pointer to the nonce
- */
-SECP256K1_API int secp256k1_musig_pubnonce_serialize(
-    const secp256k1_context *ctx,
-    unsigned char *out66,
-    const secp256k1_musig_pubnonce *nonce
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
-
-/** Parse an aggregate public nonce.
- *
- *  Returns: 1 when the nonce could be parsed, 0 otherwise.
- *  Args:    ctx: pointer to a context object
- *  Out:   nonce: pointer to a nonce object
- *  In:     in66: pointer to the 66-byte nonce to be parsed
- */
-SECP256K1_API int secp256k1_musig_aggnonce_parse(
-    const secp256k1_context *ctx,
-    secp256k1_musig_aggnonce *nonce,
-    const unsigned char *in66
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
-
-/** Serialize an aggregate public nonce
- *
- *  Returns: 1 when the nonce could be serialized, 0 otherwise
- *  Args:    ctx: pointer to a context object
- *  Out:   out66: pointer to a 66-byte array to store the serialized nonce
- *  In:    nonce: pointer to the nonce
- */
-SECP256K1_API int secp256k1_musig_aggnonce_serialize(
-    const secp256k1_context *ctx,
-    unsigned char *out66,
-    const secp256k1_musig_aggnonce *nonce
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
-
-/** Serialize a MuSig partial signature
- *
- *  Returns: 1 when the signature could be serialized, 0 otherwise
- *  Args:    ctx: pointer to a context object
- *  Out:   out32: pointer to a 32-byte array to store the serialized signature
- *  In:      sig: pointer to the signature
- */
-SECP256K1_API int secp256k1_musig_partial_sig_serialize(
-    const secp256k1_context *ctx,
-    unsigned char *out32,
-    const secp256k1_musig_partial_sig *sig
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
-
-/** Parse a MuSig partial signature.
- *
- *  Returns: 1 when the signature could be parsed, 0 otherwise.
- *  Args:    ctx: pointer to a context object
- *  Out:     sig: pointer to a signature object
- *  In:     in32: pointer to the 32-byte signature to be parsed
- *
- *  After the call, sig will always be initialized. If parsing failed or the
- *  encoded numbers are out of range, signature verification with it is
- *  guaranteed to fail for every message and public key.
- */
-SECP256K1_API int secp256k1_musig_partial_sig_parse(
-    const secp256k1_context *ctx,
-    secp256k1_musig_partial_sig *sig,
-    const unsigned char *in32
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
-
-/** Computes an aggregate public key and uses it to initialize a keyagg_cache
- *
- *  Different orders of `pubkeys` result in different `agg_pk`s.
- *
- *  Before aggregating, the pubkeys can be sorted with `secp256k1_pubkey_sort`
- *  which ensures the same `agg_pk` result for the same multiset of pubkeys.
- *  This is useful to do before `pubkey_agg`, such that the order of pubkeys
- *  does not affect the aggregate public key.
- *
- *  Returns: 0 if the arguments are invalid, 1 otherwise
- *  Args:        ctx: pointer to a context object
- *           scratch: should be NULL because it is not yet implemented. If it
- *                    was implemented then the scratch space would be used to
- *                    compute the aggregate pubkey by multiexponentiation.
- *                    Generally, the larger the scratch space, the faster this
- *                    function. However, the returns of providing a larger
- *                    scratch space are diminishing. If NULL, an inefficient
- *                    algorithm is used.
- *  Out:      agg_pk: the MuSig-aggregated x-only public key. If you do not need it,
- *                    this arg can be NULL.
- *      keyagg_cache: if non-NULL, pointer to a musig_keyagg_cache struct that
- *                    is required for signing (or observing the signing session
- *                    and verifying partial signatures).
- *   In:     pubkeys: input array of pointers to public keys to aggregate. The order
- *                    is important; a different order will result in a different
- *                    aggregate public key.
- *         n_pubkeys: length of pubkeys array. Must be greater than 0.
- */
-SECP256K1_API int secp256k1_musig_pubkey_agg(
-    const secp256k1_context *ctx,
-    secp256k1_scratch_space *scratch,
-    secp256k1_xonly_pubkey *agg_pk,
-    secp256k1_musig_keyagg_cache *keyagg_cache,
-    const secp256k1_pubkey * const *pubkeys,
-    size_t n_pubkeys
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(5);
-
-/** Obtain the aggregate public key from a keyagg_cache.
- *
- *  This is only useful if you need the non-xonly public key, in particular for
- *  plain (non-xonly) tweaking or batch-verifying multiple key aggregations
- *  (not implemented).
- *
- *  Returns: 0 if the arguments are invalid, 1 otherwise
- *  Args:        ctx: pointer to a context object
- *  Out:      agg_pk: the MuSig-aggregated public key.
- *  In: keyagg_cache: pointer to a `musig_keyagg_cache` struct initialized by
- *                    `musig_pubkey_agg`
- */
-SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_musig_pubkey_get(
-    const secp256k1_context *ctx,
-    secp256k1_pubkey *agg_pk,
-    const secp256k1_musig_keyagg_cache *keyagg_cache
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
-
-/** Apply plain "EC" tweaking to a public key in a given keyagg_cache by
- *  adding the generator multiplied with `tweak32` to it. This is useful for
- *  deriving child keys from an aggregate public key via BIP32.
- *
- *  The tweaking method is the same as `secp256k1_ec_pubkey_tweak_add`. So after
- *  the following pseudocode buf and buf2 have identical contents (absent
- *  earlier failures).
- *
- *  secp256k1_musig_pubkey_agg(..., keyagg_cache, pubkeys, ...)
- *  secp256k1_musig_pubkey_get(..., agg_pk, keyagg_cache)
- *  secp256k1_musig_pubkey_ec_tweak_add(..., output_pk, tweak32, keyagg_cache)
- *  secp256k1_ec_pubkey_serialize(..., buf, output_pk)
- *  secp256k1_ec_pubkey_tweak_add(..., agg_pk, tweak32)
- *  secp256k1_ec_pubkey_serialize(..., buf2, agg_pk)
- *
- *  This function is required if you want to _sign_ for a tweaked aggregate key.
- *  On the other hand, if you are only computing a public key, but not intending
- *  to create a signature for it, you can just use
- *  `secp256k1_ec_pubkey_tweak_add`.
- *
- *  Returns: 0 if the arguments are invalid or the resulting public key would be
- *           invalid (only when the tweak is the negation of the corresponding
- *           secret key). 1 otherwise.
- *  Args:            ctx: pointer to a context object
- *  Out:   output_pubkey: pointer to a public key to store the result. Will be set
- *                        to an invalid value if this function returns 0. If you
- *                        do not need it, this arg can be NULL.
- *  In/Out: keyagg_cache: pointer to a `musig_keyagg_cache` struct initialized by
- *                       `musig_pubkey_agg`
- *  In:          tweak32: pointer to a 32-byte tweak. If the tweak is invalid
- *                        according to `secp256k1_ec_seckey_verify`, this function
- *                        returns 0. For uniformly random 32-byte arrays the
- *                        chance of being invalid is negligible (around 1 in
- *                        2^128).
- */
-SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_musig_pubkey_ec_tweak_add(
-    const secp256k1_context *ctx,
-    secp256k1_pubkey *output_pubkey,
-    secp256k1_musig_keyagg_cache *keyagg_cache,
-    const unsigned char *tweak32
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4);
-
-/** Apply x-only tweaking to a public key in a given keyagg_cache by adding the
- *  generator multiplied with `tweak32` to it. This is useful for creating
- *  Taproot outputs.
- *
- *  The tweaking method is the same as `secp256k1_xonly_pubkey_tweak_add`. So in
- *  the following pseudocode xonly_pubkey_tweak_add_check (absent earlier
- *  failures) returns 1.
- *
- *  secp256k1_musig_pubkey_agg(..., agg_pk, keyagg_cache, pubkeys, ...)
- *  secp256k1_musig_pubkey_xonly_tweak_add(..., output_pk, tweak32, keyagg_cache)
- *  secp256k1_xonly_pubkey_serialize(..., buf, output_pk)
- *  secp256k1_xonly_pubkey_tweak_add_check(..., buf, ..., agg_pk, tweak32)
- *
- *  This function is required if you want to _sign_ for a tweaked aggregate key.
- *  On the other hand, if you are only computing a public key, but not intending
- *  to create a signature for it, you can just use
- *  `secp256k1_xonly_pubkey_tweak_add`.
- *
- *  Returns: 0 if the arguments are invalid or the resulting public key would be
- *           invalid (only when the tweak is the negation of the corresponding
- *           secret key). 1 otherwise.
- *  Args:            ctx: pointer to a context object
- *  Out:   output_pubkey: pointer to a public key to store the result. Will be set
- *                        to an invalid value if this function returns 0. If you
- *                        do not need it, this arg can be NULL.
- *  In/Out: keyagg_cache: pointer to a `musig_keyagg_cache` struct initialized by
- *                       `musig_pubkey_agg`
- *  In:          tweak32: pointer to a 32-byte tweak. If the tweak is invalid
- *                        according to secp256k1_ec_seckey_verify, this function
- *                        returns 0. For uniformly random 32-byte arrays the
- *                        chance of being invalid is negligible (around 1 in
- *                        2^128).
- */
-SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_musig_pubkey_xonly_tweak_add(
-    const secp256k1_context *ctx,
-    secp256k1_pubkey *output_pubkey,
-    secp256k1_musig_keyagg_cache *keyagg_cache,
-    const unsigned char *tweak32
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4);
-
-/** Starts a signing session by generating a nonce
- *
- *  This function outputs a secret nonce that will be required for signing and a
- *  corresponding public nonce that is intended to be sent to other signers.
- *
- *  MuSig differs from regular Schnorr signing in that implementers _must_ take
- *  special care to not reuse a nonce. This can be ensured by following these rules:
- *
- *  1. Each call to this function must have a UNIQUE session_id32 that must NOT BE
- *     REUSED in subsequent calls to this function.
- *     If you do not provide a seckey, session_id32 _must_ be UNIFORMLY RANDOM
- *     AND KEPT SECRET (even from other signers). If you do provide a seckey,
- *     session_id32 can instead be a counter (that must never repeat!). However,
- *     it is recommended to always choose session_id32 uniformly at random.
- *  2. If you already know the seckey, message or aggregate public key
- *     cache, they can be optionally provided to derive the nonce and increase
- *     misuse-resistance. The extra_input32 argument can be used to provide
- *     additional data that does not repeat in normal scenarios, such as the
- *     current time.
- *  3. Avoid copying (or serializing) the secnonce. This reduces the possibility
- *     that it is used more than once for signing.
- *
- *  Remember that nonce reuse will leak the secret key!
- *  Note that using the same seckey for multiple MuSig sessions is fine.
- *
- *  Returns: 0 if the arguments are invalid and 1 otherwise
- *  Args:         ctx: pointer to a context object (not secp256k1_context_static)
- *  Out:     secnonce: pointer to a structure to store the secret nonce
- *           pubnonce: pointer to a structure to store the public nonce
- *  In:  session_id32: a 32-byte session_id32 as explained above. Must be unique to this
- *                     call to secp256k1_musig_nonce_gen and must be uniformly random
- *                     unless you really know what you are doing.
- *             seckey: the 32-byte secret key that will later be used for signing, if
- *                     already known (can be NULL)
- *             pubkey: public key of the signer creating the nonce. The secnonce
- *                     output of this function cannot be used to sign for any
- *                     other public key.
- *              msg32: the 32-byte message that will later be signed, if already known
- *                     (can be NULL)
- *       keyagg_cache: pointer to the keyagg_cache that was used to create the aggregate
- *                     (and potentially tweaked) public key if already known
- *                     (can be NULL)
- *      extra_input32: an optional 32-byte array that is input to the nonce
- *                     derivation function (can be NULL)
- */
-SECP256K1_API int secp256k1_musig_nonce_gen(
-    const secp256k1_context *ctx,
-    secp256k1_musig_secnonce *secnonce,
-    secp256k1_musig_pubnonce *pubnonce,
-    const unsigned char *session_id32,
-    const unsigned char *seckey,
-    const secp256k1_pubkey *pubkey,
-    const unsigned char *msg32,
-    const secp256k1_musig_keyagg_cache *keyagg_cache,
-    const unsigned char *extra_input32
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4) SECP256K1_ARG_NONNULL(6);
-
-/** Aggregates the nonces of all signers into a single nonce
- *
- *  This can be done by an untrusted party to reduce the communication
- *  between signers. Instead of everyone sending nonces to everyone else, there
- *  can be one party receiving all nonces, aggregating the nonces with this
- *  function and then sending only the aggregate nonce back to the signers.
- *
- *  Returns: 0 if the arguments are invalid, 1 otherwise
- *  Args:           ctx: pointer to a context object
- *  Out:       aggnonce: pointer to an aggregate public nonce object for
- *                       musig_nonce_process
- *  In:       pubnonces: array of pointers to public nonces sent by the
- *                       signers
- *          n_pubnonces: number of elements in the pubnonces array. Must be
- *                       greater than 0.
- */
-SECP256K1_API int secp256k1_musig_nonce_agg(
-    const secp256k1_context *ctx,
-    secp256k1_musig_aggnonce  *aggnonce,
-    const secp256k1_musig_pubnonce * const *pubnonces,
-    size_t n_pubnonces
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
-
-/** Takes the public nonces of all signers and computes a session that is
- *  required for signing and verification of partial signatures.
- *
- *  If the adaptor argument is non-NULL, then the output of
- *  musig_partial_sig_agg will be a pre-signature which is not a valid Schnorr
- *  signature. In order to create a valid signature, the pre-signature and the
- *  secret adaptor must be provided to `musig_adapt`.
- *
- *  Returns: 0 if the arguments are invalid or if some signer sent invalid
- *           pubnonces, 1 otherwise
- *  Args:          ctx: pointer to a context object
- *  Out:       session: pointer to a struct to store the session
- *  In:       aggnonce: pointer to an aggregate public nonce object that is the
- *                      output of musig_nonce_agg
- *              msg32:  the 32-byte message to sign
- *       keyagg_cache:  pointer to the keyagg_cache that was used to create the
- *                      aggregate (and potentially tweaked) pubkey
- *            adaptor:  optional pointer to an adaptor point encoded as a public
- *                      key if this signing session is part of an adaptor
- *                      signature protocol (can be NULL)
- */
-SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_musig_nonce_process(
-    const secp256k1_context *ctx,
-    secp256k1_musig_session *session,
-    const secp256k1_musig_aggnonce  *aggnonce,
-    const unsigned char *msg32,
-    const secp256k1_musig_keyagg_cache *keyagg_cache,
-    const secp256k1_pubkey *adaptor
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4) SECP256K1_ARG_NONNULL(5);
-
-/** Produces a partial signature
- *
- *  This function overwrites the given secnonce with zeros and will abort if given a
- *  secnonce that is all zeros. This is a best effort attempt to protect against nonce
- *  reuse. However, this is of course easily defeated if the secnonce has been
- *  copied (or serialized). Remember that nonce reuse will leak the secret key!
- *
- *  For signing to succeed, the secnonce provided to this function must have
- *  been generated for the provided keypair. This means that when signing for a
- *  keypair consisting of a seckey and pubkey, the secnonce must have been
- *  created by calling musig_nonce_gen with that pubkey. Otherwise, the
- *  illegal_callback is called.
- *
- *  This function does not verify the output partial signature, deviating from
- *  the BIP 327 specification. It is recommended to verify the output partial
- *  signature with `secp256k1_musig_partial_sig_verify` to prevent random or
- *  adversarially provoked computation errors.
- *
- *  Returns: 0 if the arguments are invalid or the provided secnonce has already
- *           been used for signing, 1 otherwise
- *  Args:         ctx: pointer to a context object
- *  Out:  partial_sig: pointer to struct to store the partial signature
- *  In/Out:  secnonce: pointer to the secnonce struct created in
- *                     musig_nonce_gen that has been never used in a
- *                     partial_sign call before and has been created for the
- *                     keypair
- *  In:       keypair: pointer to keypair to sign the message with
- *       keyagg_cache: pointer to the keyagg_cache that was output when the
- *                     aggregate public key for this session
- *            session: pointer to the session that was created with
- *                     musig_nonce_process
- */
-SECP256K1_API int secp256k1_musig_partial_sign(
-    const secp256k1_context *ctx,
-    secp256k1_musig_partial_sig *partial_sig,
-    secp256k1_musig_secnonce *secnonce,
-    const secp256k1_keypair *keypair,
-    const secp256k1_musig_keyagg_cache *keyagg_cache,
-    const secp256k1_musig_session *session
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4) SECP256K1_ARG_NONNULL(5) SECP256K1_ARG_NONNULL(6);
-
-/** Verifies an individual signer's partial signature
- *
- *  The signature is verified for a specific signing session. In order to avoid
- *  accidentally verifying a signature from a different or non-existing signing
- *  session, you must ensure the following:
- *    1. The `keyagg_cache` argument is identical to the one used to create the
- *       `session` with `musig_nonce_process`.
- *    2. The `pubkey` argument must be identical to the one sent by the signer
- *       before aggregating it with `musig_pubkey_agg` to create the
- *       `keyagg_cache`.
- *    3. The `pubnonce` argument must be identical to the one sent by the signer
- *       before aggregating it with `musig_nonce_agg` and using the result to
- *       create the `session` with `musig_nonce_process`.
- *
- *  This function is essential when using protocols with adaptor signatures.
- *  However, it is not essential for regular MuSig sessions, in the sense that if any
- *  partial signature does not verify, the full signature will not verify either, so the
- *  problem will be caught. But this function allows determining the specific party
- *  who produced an invalid signature.
- *
- *  Returns: 0 if the arguments are invalid or the partial signature does not
- *           verify, 1 otherwise
- *  Args         ctx: pointer to a context object
- *  In:  partial_sig: pointer to partial signature to verify, sent by
- *                    the signer associated with `pubnonce` and `pubkey`
- *          pubnonce: public nonce of the signer in the signing session
- *            pubkey: public key of the signer in the signing session
- *      keyagg_cache: pointer to the keyagg_cache that was output when the
- *                    aggregate public key for this signing session
- *           session: pointer to the session that was created with
- *                    `musig_nonce_process`
- */
-SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_musig_partial_sig_verify(
-    const secp256k1_context *ctx,
-    const secp256k1_musig_partial_sig *partial_sig,
-    const secp256k1_musig_pubnonce *pubnonce,
-    const secp256k1_pubkey *pubkey,
-    const secp256k1_musig_keyagg_cache *keyagg_cache,
-    const secp256k1_musig_session *session
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4) SECP256K1_ARG_NONNULL(5) SECP256K1_ARG_NONNULL(6);
-
-/** Aggregates partial signatures
- *
- *  Returns: 0 if the arguments are invalid, 1 otherwise (which does NOT mean
- *           the resulting signature verifies).
- *  Args:         ctx: pointer to a context object
- *  Out:        sig64: complete (but possibly invalid) Schnorr signature
- *  In:       session: pointer to the session that was created with
- *                     musig_nonce_process
- *       partial_sigs: array of pointers to partial signatures to aggregate
- *             n_sigs: number of elements in the partial_sigs array. Must be
- *                     greater than 0.
- */
-SECP256K1_API int secp256k1_musig_partial_sig_agg(
-    const secp256k1_context *ctx,
-    unsigned char *sig64,
-    const secp256k1_musig_session *session,
-    const secp256k1_musig_partial_sig * const *partial_sigs,
-    size_t n_sigs
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4);
-
-/** Extracts the nonce_parity bit from a session
- *
- *  This is used for adaptor signatures.
- *
- *  Returns: 0 if the arguments are invalid, 1 otherwise
- *  Args:         ctx: pointer to a context object
- *  Out: nonce_parity: pointer to an integer that indicates the parity
- *                     of the aggregate public nonce. Used for adaptor
- *                     signatures.
- *  In:       session: pointer to the session that was created with
- *                     musig_nonce_process
- */
-SECP256K1_API int secp256k1_musig_nonce_parity(
-    const secp256k1_context *ctx,
-    int *nonce_parity,
-    const secp256k1_musig_session *session
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
-
-/** Creates a signature from a pre-signature and an adaptor.
- *
- *  If the sec_adaptor32 argument is incorrect, the output signature will be
- *  invalid. This function does not verify the signature.
- *
- *  Returns: 0 if the arguments are invalid, or pre_sig64 or sec_adaptor32 contain
- *           invalid (overflowing) values. 1 otherwise (which does NOT mean the
- *           signature or the adaptor are valid!)
- *  Args:         ctx: pointer to a context object
- *  Out:        sig64: 64-byte signature. This pointer may point to the same
- *                     memory area as `pre_sig`.
- *  In:     pre_sig64: 64-byte pre-signature
- *      sec_adaptor32: 32-byte secret adaptor to add to the pre-signature
- *       nonce_parity: the output of `musig_nonce_parity` called with the
- *                     session used for producing the pre-signature
- */
-SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_musig_adapt(
-    const secp256k1_context *ctx,
-    unsigned char *sig64,
-    const unsigned char *pre_sig64,
-    const unsigned char *sec_adaptor32,
-    int nonce_parity
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4);
-
-/** Extracts a secret adaptor from a MuSig pre-signature and corresponding
- *  signature
- *
- *  This function will not fail unless given grossly invalid data; if it is
- *  merely given signatures that do not verify, the returned value will be
- *  nonsense. It is therefore important that all data be verified at earlier
- *  steps of any protocol that uses this function. In particular, this includes
- *  verifying all partial signatures that were aggregated into pre_sig64.
- *
- *  Returns: 0 if the arguments are NULL, or sig64 or pre_sig64 contain
- *           grossly invalid (overflowing) values. 1 otherwise (which does NOT
- *           mean the signatures or the adaptor are valid!)
- *  Args:         ctx: pointer to a context object
- *  Out:sec_adaptor32: 32-byte secret adaptor
- *  In:         sig64: complete, valid 64-byte signature
- *          pre_sig64: the pre-signature corresponding to sig64, i.e., the
- *                     aggregate of partial signatures without the secret
- *                     adaptor
- *       nonce_parity: the output of `musig_nonce_parity` called with the
- *                     session used for producing sig64
- */
-SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_musig_extract_adaptor(
-    const secp256k1_context *ctx,
-    unsigned char *sec_adaptor32,
-    const unsigned char *sig64,
-    const unsigned char *pre_sig64,
-    int nonce_parity
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4);
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif

include/secp256k1_preallocated.h

@@ -1,134 +0,0 @@
-#ifndef SECP256K1_PREALLOCATED_H
-#define SECP256K1_PREALLOCATED_H
-
-#include "secp256k1.h"
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/* The module provided by this header file is intended for settings in which it
- * is not possible or desirable to rely on dynamic memory allocation. It provides
- * functions for creating, cloning, and destroying secp256k1 context objects in a
- * contiguous fixed-size block of memory provided by the caller.
- *
- * Context objects created by functions in this module can be used like contexts
- * objects created by functions in secp256k1.h, i.e., they can be passed to any
- * API function that expects a context object (see secp256k1.h for details). The
- * only exception is that context objects created by functions in this module
- * must be destroyed using secp256k1_context_preallocated_destroy (in this
- * module) instead of secp256k1_context_destroy (in secp256k1.h).
- *
- * It is guaranteed that functions in this module will not call malloc or its
- * friends realloc, calloc, and free.
- */
-
-/** Determine the memory size of a secp256k1 context object to be created in
- *  caller-provided memory.
- *
- *  The purpose of this function is to determine how much memory must be provided
- *  to secp256k1_context_preallocated_create.
- *
- *  Returns: the required size of the caller-provided memory block
- *  In:      flags:    which parts of the context to initialize.
- */
-SECP256K1_API size_t secp256k1_context_preallocated_size(
-    unsigned int flags
-) SECP256K1_WARN_UNUSED_RESULT;
-
-/** Create a secp256k1 context object in caller-provided memory.
- *
- *  The caller must provide a pointer to a rewritable contiguous block of memory
- *  of size at least secp256k1_context_preallocated_size(flags) bytes, suitably
- *  aligned to hold an object of any type.
- *
- *  The block of memory is exclusively owned by the created context object during
- *  the lifetime of this context object, which begins with the call to this
- *  function and ends when a call to secp256k1_context_preallocated_destroy
- *  (which destroys the context object again) returns. During the lifetime of the
- *  context object, the caller is obligated not to access this block of memory,
- *  i.e., the caller may not read or write the memory, e.g., by copying the memory
- *  contents to a different location or trying to create a second context object
- *  in the memory. In simpler words, the prealloc pointer (or any pointer derived
- *  from it) should not be used during the lifetime of the context object.
- *
- *  Returns: pointer to newly created context object.
- *  In:      prealloc: pointer to a rewritable contiguous block of memory of
- *                     size at least secp256k1_context_preallocated_size(flags)
- *                     bytes, as detailed above.
- *           flags:    which parts of the context to initialize.
- *
- *  See secp256k1_context_create (in secp256k1.h) for further details.
- *
- *  See also secp256k1_context_randomize (in secp256k1.h)
- *  and secp256k1_context_preallocated_destroy.
- */
-SECP256K1_API secp256k1_context *secp256k1_context_preallocated_create(
-    void *prealloc,
-    unsigned int flags
-) SECP256K1_ARG_NONNULL(1) SECP256K1_WARN_UNUSED_RESULT;
-
-/** Determine the memory size of a secp256k1 context object to be copied into
- *  caller-provided memory.
- *
- *  Returns: the required size of the caller-provided memory block.
- *  In:      ctx: pointer to a context to copy.
- */
-SECP256K1_API size_t secp256k1_context_preallocated_clone_size(
-    const secp256k1_context *ctx
-) SECP256K1_ARG_NONNULL(1) SECP256K1_WARN_UNUSED_RESULT;
-
-/** Copy a secp256k1 context object into caller-provided memory.
- *
- *  The caller must provide a pointer to a rewritable contiguous block of memory
- *  of size at least secp256k1_context_preallocated_size(flags) bytes, suitably
- *  aligned to hold an object of any type.
- *
- *  The block of memory is exclusively owned by the created context object during
- *  the lifetime of this context object, see the description of
- *  secp256k1_context_preallocated_create for details.
- *
- *  Cloning secp256k1_context_static is not possible, and should not be emulated by
- *  the caller (e.g., using memcpy). Create a new context instead.
- *
- *  Returns: pointer to a newly created context object.
- *  Args:    ctx:      pointer to a context to copy (not secp256k1_context_static).
- *  In:      prealloc: pointer to a rewritable contiguous block of memory of
- *                     size at least secp256k1_context_preallocated_size(flags)
- *                     bytes, as detailed above.
- */
-SECP256K1_API secp256k1_context *secp256k1_context_preallocated_clone(
-    const secp256k1_context *ctx,
-    void *prealloc
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_WARN_UNUSED_RESULT;
-
-/** Destroy a secp256k1 context object that has been created in
- *  caller-provided memory.
- *
- *  The context pointer may not be used afterwards.
- *
- *  The context to destroy must have been created using
- *  secp256k1_context_preallocated_create or secp256k1_context_preallocated_clone.
- *  If the context has instead been created using secp256k1_context_create or
- *  secp256k1_context_clone, the behaviour is undefined. In that case,
- *  secp256k1_context_destroy must be used instead.
- *
- *  If required, it is the responsibility of the caller to deallocate the block
- *  of memory properly after this function returns, e.g., by calling free on the
- *  preallocated pointer given to secp256k1_context_preallocated_create or
- *  secp256k1_context_preallocated_clone.
- *
- *  Args:   ctx: pointer to a context to destroy, constructed using
- *               secp256k1_context_preallocated_create or
- *               secp256k1_context_preallocated_clone
- *               (i.e., not secp256k1_context_static).
- */
-SECP256K1_API void secp256k1_context_preallocated_destroy(
-    secp256k1_context *ctx
-) SECP256K1_ARG_NONNULL(1);
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif /* SECP256K1_PREALLOCATED_H */

include/secp256k1_rangeproof.h

@@ -1,5 +1,5 @@
-#ifndef SECP256K1_RANGEPROOF_H
-# define SECP256K1_RANGEPROOF_H
+#ifndef _SECP256K1_RANGEPROOF_
+# define _SECP256K1_RANGEPROOF_
 
 # include "secp256k1.h"
 # include "secp256k1_generator.h"
@@ -10,19 +10,166 @@ extern "C" {
 
 #include <stdint.h>
 
-/** Length of a message that can be embedded into a maximally-sized rangeproof
+/** Opaque data structure that stores a Pedersen commitment
  *
- * It is not be possible to fit a message of this size into a non-maximally-sized
- * rangeproof, but it is guaranteed that any embeddable message can fit into an
- * array of this size. This constant is intended to be used for memory allocations
- * and sanity checks.
+ *  The exact representation of data inside is implementation defined and not
+ *  guaranteed to be portable between different platforms or versions. It is
+ *  however guaranteed to be 33 bytes in size, and can be safely copied/moved.
+ *  If you need to convert to a format suitable for storage or transmission, use
+ *  secp256k1_pedersen_commitment_serialize and secp256k1_pedersen_commitment_parse.
+ *
+ *  Furthermore, it is guaranteed to identical signatures will have identical
+ *  representation, so they can be memcmp'ed.
  */
-#define SECP256K1_RANGEPROOF_MAX_MESSAGE_LEN 3968
+typedef struct {
+    unsigned char data[33];
+} secp256k1_pedersen_commitment;
+
+/**
+ * Static constant generator 'h' maintained for historical reasons.
+ */
+extern const secp256k1_generator *secp256k1_generator_h;
+
+/** Parse a 33-byte commitment into a commitment object.
+ *
+ *  Returns: 1 if input contains a valid commitment.
+ *  Args: ctx:      a secp256k1 context object.
+ *  Out:  commit:   pointer to the output commitment object
+ *  In:   input:    pointer to a 33-byte serialized commitment key
+ */
+SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_pedersen_commitment_parse(
+    const secp256k1_context* ctx,
+    secp256k1_pedersen_commitment* commit,
+    const unsigned char *input
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
+
+/** Serialize a commitment object into a serialized byte sequence.
+ *
+ *  Returns: 1 always.
+ *  Args:   ctx:        a secp256k1 context object.
+ *  Out:    output:     a pointer to a 33-byte byte array
+ *  In:     commit:     a pointer to a secp256k1_pedersen_commitment containing an
+ *                      initialized commitment
+ */
+SECP256K1_API int secp256k1_pedersen_commitment_serialize(
+    const secp256k1_context* ctx,
+    unsigned char *output,
+    const secp256k1_pedersen_commitment* commit
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
+
+/** Initialize a context for usage with Pedersen commitments. */
+void secp256k1_pedersen_context_initialize(secp256k1_context* ctx);
+
+/** Generate a pedersen commitment.
+ *  Returns 1: Commitment successfully created.
+ *          0: Error. The blinding factor is larger than the group order
+ *             (probability for random 32 byte number < 2^-127) or results in the
+ *             point at infinity. Retry with a different factor.
+ *  In:     ctx:        pointer to a context object, initialized for signing and Pedersen commitment (cannot be NULL)
+ *          blind:      pointer to a 32-byte blinding factor (cannot be NULL)
+ *          value:      unsigned 64-bit integer value to commit to.
+ *          gen:        additional generator 'h'
+ *  Out:    commit:     pointer to the commitment (cannot be NULL)
+ *
+ *  Blinding factors can be generated and verified in the same way as secp256k1 private keys for ECDSA.
+ */
+SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_pedersen_commit(
+  const secp256k1_context* ctx,
+  secp256k1_pedersen_commitment *commit,
+  const unsigned char *blind,
+  uint64_t value,
+  const secp256k1_generator *gen
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(5);
+
+/** Computes the sum of multiple positive and negative blinding factors.
+ *  Returns 1: Sum successfully computed.
+ *          0: Error. A blinding factor is larger than the group order
+ *             (probability for random 32 byte number < 2^-127). Retry with
+ *             different factors.
+ *  In:     ctx:        pointer to a context object (cannot be NULL)
+ *          blinds:     pointer to pointers to 32-byte character arrays for blinding factors. (cannot be NULL)
+ *          n:          number of factors pointed to by blinds.
+ *          npositive:       how many of the initial factors should be treated with a positive sign.
+ *  Out:    blind_out:  pointer to a 32-byte array for the sum (cannot be NULL)
+ */
+SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_pedersen_blind_sum(
+  const secp256k1_context* ctx,
+  unsigned char *blind_out,
+  const unsigned char * const *blinds,
+  size_t n,
+  size_t npositive
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
+
+/** Verify a tally of pedersen commitments
+ * Returns 1: commitments successfully sum to zero.
+ *         0: Commitments do not sum to zero or other error.
+ * In:     ctx:        pointer to a context object (cannot be NULL)
+ *         commits:    pointer to array of pointers to the commitments. (cannot be NULL if pcnt is non-zero)
+ *         pcnt:       number of commitments pointed to by commits.
+ *         ncommits:   pointer to array of pointers to the negative commitments. (cannot be NULL if ncnt is non-zero)
+ *         ncnt:       number of commitments pointed to by ncommits.
+ *
+ * This computes sum(commit[0..pcnt)) - sum(ncommit[0..ncnt)) == 0.
+ *
+ * A pedersen commitment is xG + vA where G and A are generators for the secp256k1 group and x is a blinding factor,
+ * while v is the committed value. For a collection of commitments to sum to zero, for each distinct generator
+ * A all blinding factors and all values must sum to zero.
+ *
+ */
+SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_pedersen_verify_tally(
+  const secp256k1_context* ctx,
+  const secp256k1_pedersen_commitment * const* commits,
+  size_t pcnt,
+  const secp256k1_pedersen_commitment * const* ncommits,
+  size_t ncnt
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(4);
+
+/** Sets the final Pedersen blinding factor correctly when the generators themselves
+ *  have blinding factors.
+ *
+ * Consider a generator of the form A' = A + rG, where A is the "real" generator
+ * but A' is the generator provided to verifiers. Then a Pedersen commitment
+ * P = vA' + r'G really has the form vA + (vr + r')G. To get all these (vr + r')
+ * to sum to zero for multiple commitments, we take three arrays consisting of
+ * the `v`s, `r`s, and `r'`s, respectively called `value`s, `generator_blind`s
+ * and `blinding_factor`s, and sum them.
+ *
+ * The function then subtracts the sum of all (vr + r') from the last element
+ * of the `blinding_factor` array, setting the total sum to zero.
+ *
+ * Returns 1: Blinding factor successfully computed.
+ *         0: Error. A blinding_factor or generator_blind are larger than the group
+ *            order (probability for random 32 byte number < 2^-127). Retry with
+ *            different values.
+ *
+ * In:                 ctx: pointer to a context object
+ *                   value: array of asset values, `v` in the above paragraph.
+ *                          May not be NULL unless `n_total` is 0.
+ *         generator_blind: array of asset blinding factors, `r` in the above paragraph
+ *                          May not be NULL unless `n_total` is 0.
+ *                 n_total: Total size of the above arrays
+ *                n_inputs: How many of the initial array elements represent commitments that
+ *                          will be negated in the final sum
+ * In/Out: blinding_factor: array of commitment blinding factors, `r'` in the above paragraph
+ *                          May not be NULL unless `n_total` is 0.
+ *                          the last value will be modified to get the total sum to zero.
+ */
+SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_pedersen_blind_generator_blind_sum(
+  const secp256k1_context* ctx,
+  const uint64_t *value,
+  const unsigned char* const* generator_blind,
+  unsigned char* const* blinding_factor,
+  size_t n_total,
+  size_t n_inputs
+);
+
+/** Initialize a context for usage with Pedersen commitments. */
+void secp256k1_rangeproof_context_initialize(secp256k1_context* ctx);
 
 /** Verify a proof that a committed value is within a range.
  * Returns 1: Value is within the range [0..2^64), the specifically proven range is in the min/max value outputs.
  *         0: Proof failed or other error.
- * In:   ctx: pointer to a context object (not secp256k1_context_static)
+ * In:   ctx: pointer to a context object, initialized for range-proof and commitment (cannot be NULL)
  *       commit: the commitment being proved. (cannot be NULL)
  *       proof: pointer to character array with the proof. (cannot be NULL)
  *       plen: length of proof in bytes.
@@ -33,7 +180,7 @@ extern "C" {
  *       max_value: pointer to a unsigned int64 which will be updated with the maximum value that commit could have. (cannot be NULL)
  */
 SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_rangeproof_verify(
-  const secp256k1_context *ctx,
+  const secp256k1_context* ctx,
   uint64_t *min_value,
   uint64_t *max_value,
   const secp256k1_pedersen_commitment *commit,
@@ -41,13 +188,13 @@ SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_rangeproof_verify(
   size_t plen,
   const unsigned char *extra_commit,
   size_t extra_commit_len,
-  const secp256k1_generator *gen
+  const secp256k1_generator* gen
 ) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4) SECP256K1_ARG_NONNULL(5) SECP256K1_ARG_NONNULL(9);
 
 /** Verify a range proof proof and rewind the proof to recover information sent by its author.
  *  Returns 1: Value is within the range [0..2^64), the specifically proven range is in the min/max value outputs, and the value and blinding were recovered.
  *          0: Proof failed, rewind failed, or other error.
- *  In:   ctx: pointer to a context object (not secp256k1_context_static)
+ *  In:   ctx: pointer to a context object, initialized for range-proof and Pedersen commitment (cannot be NULL)
  *        commit: the commitment being proved. (cannot be NULL)
  *        proof: pointer to character array with the proof. (cannot be NULL)
  *        plen: length of proof in bytes.
@@ -58,14 +205,12 @@ SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_rangeproof_verify(
  *  In/Out: blind_out: storage for the 32-byte blinding factor used for the commitment
  *        value_out: pointer to an unsigned int64 which has the exact value of the commitment.
  *        message_out: pointer to a 4096 byte character array to receive message data from the proof author.
- *        outlen: length of message data written to message_out. This is generally not equal to the
- *                msg_len used by the signer. However, for all i with msg_len <= i < outlen, it is
- *                guaranteed that message_out[i] == 0.
+ *        outlen:  length of message data written to message_out.
  *        min_value: pointer to an unsigned int64 which will be updated with the minimum value that commit could have. (cannot be NULL)
  *        max_value: pointer to an unsigned int64 which will be updated with the maximum value that commit could have. (cannot be NULL)
  */
 SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_rangeproof_rewind(
-  const secp256k1_context *ctx,
+  const secp256k1_context* ctx,
   unsigned char *blind_out,
   uint64_t *value_out,
   unsigned char *message_out,
@@ -84,12 +229,11 @@ SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_rangeproof_rewind(
 /** Author a proof that a committed value is within a range.
  *  Returns 1: Proof successfully created.
  *          0: Error
- *  In:     ctx:    pointer to a context object (not secp256k1_context_static)
+ *  In:     ctx:    pointer to a context object, initialized for range-proof, signing, and Pedersen commitment (cannot be NULL)
  *          proof:  pointer to array to receive the proof, can be up to 5134 bytes. (cannot be NULL)
  *          min_value: constructs a proof where the verifer can tell the minimum value is at least the specified amount.
  *          commit: the commitment being proved.
- *          blind:  32-byte blinding factor used by commit. The blinding factor may be all-zeros as long as min_bits is set to 3 or greater.
- *                  This is a side-effect of the underlying crypto, not a deliberate API choice, but it may be useful when balancing CT transactions.
+ *          blind:  32-byte blinding factor used by commit.
  *          nonce:  32-byte secret nonce used to initialize the proof (value can be reverse-engineered out of the proof if this secret is known.)
  *          exp:    Base-10 exponent. Digits below above will be made public, but the proof will be made smaller. Allowed range is -1 to 18.
  *                  (-1 is a special case that makes the value public. 0 is the most private.)
@@ -110,7 +254,7 @@ SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_rangeproof_rewind(
  *
  */
 SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_rangeproof_sign(
-  const secp256k1_context *ctx,
+  const secp256k1_context* ctx,
   unsigned char *proof,
   size_t *plen,
   uint64_t min_value,
@@ -139,7 +283,7 @@ SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_rangeproof_sign(
  *        max_value: pointer to an unsigned int64 which will be updated with the maximum value that commit could have. (cannot be NULL)
  */
 SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_rangeproof_info(
-  const secp256k1_context *ctx,
+  const secp256k1_context* ctx,
   int *exp,
   int *mantissa,
   uint64_t *min_value,
@@ -148,33 +292,6 @@ SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_rangeproof_info(
   size_t plen
 ) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4) SECP256K1_ARG_NONNULL(5);
 
-/** Returns an upper bound on the size of a rangeproof with the given parameters
- *
- * An actual rangeproof may be smaller, for example if the actual value
- * is less than both the provided `max_value` and 2^`min_bits`, or if
- * the `exp` parameter to `secp256k1_rangeproof_sign` is set such that
- * the proven range is compressed. In particular this function will always
- * overestimate the size of single-value proofs. Also, if `min_value`
- * is set to 0 in the proof, the result will usually, but not always,
- * be 8 bytes smaller than if a nonzero value had been passed.
- *
- * The goal of this function is to provide a useful upper bound for
- * memory allocation or fee estimation purposes, without requiring
- * too many parameters be fixed in advance.
- *
- * To obtain the size of largest possible proof, set `max_value` to
- * `UINT64_MAX` (and `min_bits` to any valid value such as 0).
- *
- *  In:       ctx: pointer to a context object
- *      max_value: the maximum value that might be passed for `value` for the proof.
- *       min_bits: the value that will be passed as `min_bits` for the proof.
- */
-SECP256K1_API SECP256K1_WARN_UNUSED_RESULT size_t secp256k1_rangeproof_max_size(
-  const secp256k1_context *ctx,
-  uint64_t max_value,
-  int min_bits
-) SECP256K1_ARG_NONNULL(1);
-
 # ifdef __cplusplus
 }
 # endif

include/secp256k1_recovery.h

@@ -1,11 +1,11 @@
-#ifndef SECP256K1_RECOVERY_H
-#define SECP256K1_RECOVERY_H
+#ifndef _SECP256K1_RECOVERY_
+# define _SECP256K1_RECOVERY_
 
-#include "secp256k1.h"
+# include "secp256k1.h"
 
-#ifdef __cplusplus
+# ifdef __cplusplus
 extern "C" {
-#endif
+# endif
 
 /** Opaque data structured that holds a parsed ECDSA signature,
  *  supporting pubkey recovery.
@@ -28,14 +28,14 @@ typedef struct {
 /** Parse a compact ECDSA signature (64 bytes + recovery id).
  *
  *  Returns: 1 when the signature could be parsed, 0 otherwise
- *  Args: ctx:     pointer to a context object
- *  Out:  sig:     pointer to a signature object
- *  In:   input64: pointer to a 64-byte compact signature
+ *  Args: ctx:     a secp256k1 context object
+ *  Out:  sig:     a pointer to a signature object
+ *  In:   input64: a pointer to a 64-byte compact signature
  *        recid:   the recovery id (0, 1, 2 or 3)
  */
 SECP256K1_API int secp256k1_ecdsa_recoverable_signature_parse_compact(
-    const secp256k1_context *ctx,
-    secp256k1_ecdsa_recoverable_signature *sig,
+    const secp256k1_context* ctx,
+    secp256k1_ecdsa_recoverable_signature* sig,
     const unsigned char *input64,
     int recid
 ) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
@@ -43,48 +43,45 @@ SECP256K1_API int secp256k1_ecdsa_recoverable_signature_parse_compact(
 /** Convert a recoverable signature into a normal signature.
  *
  *  Returns: 1
- *  Args: ctx:    pointer to a context object.
- *  Out:  sig:    pointer to a normal signature.
- *  In:   sigin:  pointer to a recoverable signature.
+ *  Out: sig:    a pointer to a normal signature (cannot be NULL).
+ *  In:  sigin:  a pointer to a recoverable signature (cannot be NULL).
  */
 SECP256K1_API int secp256k1_ecdsa_recoverable_signature_convert(
-    const secp256k1_context *ctx,
-    secp256k1_ecdsa_signature *sig,
-    const secp256k1_ecdsa_recoverable_signature *sigin
+    const secp256k1_context* ctx,
+    secp256k1_ecdsa_signature* sig,
+    const secp256k1_ecdsa_recoverable_signature* sigin
 ) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
 
 /** Serialize an ECDSA signature in compact format (64 bytes + recovery id).
  *
  *  Returns: 1
- *  Args: ctx:      pointer to a context object.
- *  Out:  output64: pointer to a 64-byte array of the compact signature.
- *        recid:    pointer to an integer to hold the recovery id.
- *  In:   sig:      pointer to an initialized signature object.
+ *  Args: ctx:      a secp256k1 context object
+ *  Out:  output64: a pointer to a 64-byte array of the compact signature (cannot be NULL)
+ *        recid:    a pointer to an integer to hold the recovery id (can be NULL).
+ *  In:   sig:      a pointer to an initialized signature object (cannot be NULL)
  */
 SECP256K1_API int secp256k1_ecdsa_recoverable_signature_serialize_compact(
-    const secp256k1_context *ctx,
+    const secp256k1_context* ctx,
     unsigned char *output64,
     int *recid,
-    const secp256k1_ecdsa_recoverable_signature *sig
+    const secp256k1_ecdsa_recoverable_signature* sig
 ) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4);
 
 /** Create a recoverable ECDSA signature.
  *
  *  Returns: 1: signature created
- *           0: the nonce generation function failed, or the secret key was invalid.
- *  Args:    ctx:       pointer to a context object (not secp256k1_context_static).
- *  Out:     sig:       pointer to an array where the signature will be placed.
- *  In:      msghash32: the 32-byte message hash being signed.
- *           seckey:    pointer to a 32-byte secret key.
- *           noncefp:   pointer to a nonce generation function. If NULL,
- *                      secp256k1_nonce_function_default is used.
- *           ndata:     pointer to arbitrary data used by the nonce generation function
- *                      (can be NULL for secp256k1_nonce_function_default).
+ *           0: the nonce generation function failed, or the private key was invalid.
+ *  Args:    ctx:    pointer to a context object, initialized for signing (cannot be NULL)
+ *  Out:     sig:    pointer to an array where the signature will be placed (cannot be NULL)
+ *  In:      msg32:  the 32-byte message hash being signed (cannot be NULL)
+ *           seckey: pointer to a 32-byte secret key (cannot be NULL)
+ *           noncefp:pointer to a nonce generation function. If NULL, secp256k1_nonce_function_default is used
+ *           ndata:  pointer to arbitrary data used by the nonce generation function (can be NULL)
  */
 SECP256K1_API int secp256k1_ecdsa_sign_recoverable(
-    const secp256k1_context *ctx,
+    const secp256k1_context* ctx,
     secp256k1_ecdsa_recoverable_signature *sig,
-    const unsigned char *msghash32,
+    const unsigned char *msg32,
     const unsigned char *seckey,
     secp256k1_nonce_function noncefp,
     const void *ndata
@@ -94,20 +91,20 @@ SECP256K1_API int secp256k1_ecdsa_sign_recoverable(
  *
  *  Returns: 1: public key successfully recovered (which guarantees a correct signature).
  *           0: otherwise.
- *  Args:    ctx:       pointer to a context object.
- *  Out:     pubkey:    pointer to the recovered public key.
- *  In:      sig:       pointer to initialized signature that supports pubkey recovery.
- *           msghash32: the 32-byte message hash assumed to be signed.
+ *  Args:    ctx:        pointer to a context object, initialized for verification (cannot be NULL)
+ *  Out:     pubkey:     pointer to the recovered public key (cannot be NULL)
+ *  In:      sig:        pointer to initialized signature that supports pubkey recovery (cannot be NULL)
+ *           msg32:      the 32-byte message hash assumed to be signed (cannot be NULL)
  */
 SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_ecdsa_recover(
-    const secp256k1_context *ctx,
+    const secp256k1_context* ctx,
     secp256k1_pubkey *pubkey,
     const secp256k1_ecdsa_recoverable_signature *sig,
-    const unsigned char *msghash32
+    const unsigned char *msg32
 ) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4);
 
-#ifdef __cplusplus
+# ifdef __cplusplus
 }
-#endif
+# endif
 
-#endif /* SECP256K1_RECOVERY_H */
+#endif

include/secp256k1_schnorrsig.h

@@ -1,190 +0,0 @@
-#ifndef SECP256K1_SCHNORRSIG_H
-#define SECP256K1_SCHNORRSIG_H
-
-#include "secp256k1.h"
-#include "secp256k1_extrakeys.h"
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/** This module implements a variant of Schnorr signatures compliant with
- *  Bitcoin Improvement Proposal 340 "Schnorr Signatures for secp256k1"
- *  (https://github.com/bitcoin/bips/blob/master/bip-0340.mediawiki).
- */
-
-/** A pointer to a function to deterministically generate a nonce.
- *
- *  Same as secp256k1_nonce function with the exception of accepting an
- *  additional pubkey argument and not requiring an attempt argument. The pubkey
- *  argument can protect signature schemes with key-prefixed challenge hash
- *  inputs against reusing the nonce when signing with the wrong precomputed
- *  pubkey.
- *
- *  Returns: 1 if a nonce was successfully generated. 0 will cause signing to
- *           return an error.
- *  Out:  nonce32: pointer to a 32-byte array to be filled by the function
- *  In:       msg: the message being verified. Is NULL if and only if msglen
- *                 is 0.
- *         msglen: the length of the message
- *          key32: pointer to a 32-byte secret key (will not be NULL)
- *     xonly_pk32: the 32-byte serialized xonly pubkey corresponding to key32
- *                 (will not be NULL)
- *           algo: pointer to an array describing the signature
- *                 algorithm (will not be NULL)
- *        algolen: the length of the algo array
- *           data: arbitrary data pointer that is passed through
- *
- *  Except for test cases, this function should compute some cryptographic hash of
- *  the message, the key, the pubkey, the algorithm description, and data.
- */
-typedef int (*secp256k1_nonce_function_hardened)(
-    unsigned char *nonce32,
-    const unsigned char *msg,
-    size_t msglen,
-    const unsigned char *key32,
-    const unsigned char *xonly_pk32,
-    const unsigned char *algo,
-    size_t algolen,
-    void *data
-);
-
-/** An implementation of the nonce generation function as defined in Bitcoin
- *  Improvement Proposal 340 "Schnorr Signatures for secp256k1"
- *  (https://github.com/bitcoin/bips/blob/master/bip-0340.mediawiki).
- *
- *  If a data pointer is passed, it is assumed to be a pointer to 32 bytes of
- *  auxiliary random data as defined in BIP-340. If the data pointer is NULL,
- *  the nonce derivation procedure follows BIP-340 by setting the auxiliary
- *  random data to zero. The algo argument must be non-NULL, otherwise the
- *  function will fail and return 0. The hash will be tagged with algo.
- *  Therefore, to create BIP-340 compliant signatures, algo must be set to
- *  "BIP0340/nonce" and algolen to 13.
- */
-SECP256K1_API const secp256k1_nonce_function_hardened secp256k1_nonce_function_bip340;
-
-/** Data structure that contains additional arguments for schnorrsig_sign_custom.
- *
- *  A schnorrsig_extraparams structure object can be initialized correctly by
- *  setting it to SECP256K1_SCHNORRSIG_EXTRAPARAMS_INIT.
- *
- *  Members:
- *      magic: set to SECP256K1_SCHNORRSIG_EXTRAPARAMS_MAGIC at initialization
- *             and has no other function than making sure the object is
- *             initialized.
- *    noncefp: pointer to a nonce generation function. If NULL,
- *             secp256k1_nonce_function_bip340 is used
- *      ndata: pointer to arbitrary data used by the nonce generation function
- *             (can be NULL). If it is non-NULL and
- *             secp256k1_nonce_function_bip340 is used, then ndata must be a
- *             pointer to 32-byte auxiliary randomness as per BIP-340.
- */
-typedef struct {
-    unsigned char magic[4];
-    secp256k1_nonce_function_hardened noncefp;
-    void *ndata;
-} secp256k1_schnorrsig_extraparams;
-
-#define SECP256K1_SCHNORRSIG_EXTRAPARAMS_MAGIC { 0xda, 0x6f, 0xb3, 0x8c }
-#define SECP256K1_SCHNORRSIG_EXTRAPARAMS_INIT {\
-    SECP256K1_SCHNORRSIG_EXTRAPARAMS_MAGIC,\
-    NULL,\
-    NULL\
-}
-
-/** Create a Schnorr signature.
- *
- *  Does _not_ strictly follow BIP-340 because it does not verify the resulting
- *  signature. Instead, you can manually use secp256k1_schnorrsig_verify and
- *  abort if it fails.
- *
- *  This function only signs 32-byte messages. If you have messages of a
- *  different size (or the same size but without a context-specific tag
- *  prefix), it is recommended to create a 32-byte message hash with
- *  secp256k1_tagged_sha256 and then sign the hash. Tagged hashing allows
- *  providing an context-specific tag for domain separation. This prevents
- *  signatures from being valid in multiple contexts by accident.
- *
- *  Returns 1 on success, 0 on failure.
- *  Args:    ctx: pointer to a context object (not secp256k1_context_static).
- *  Out:   sig64: pointer to a 64-byte array to store the serialized signature.
- *  In:    msg32: the 32-byte message being signed.
- *       keypair: pointer to an initialized keypair.
- *    aux_rand32: 32 bytes of fresh randomness. While recommended to provide
- *                this, it is only supplemental to security and can be NULL. A
- *                NULL argument is treated the same as an all-zero one. See
- *                BIP-340 "Default Signing" for a full explanation of this
- *                argument and for guidance if randomness is expensive.
- */
-SECP256K1_API int secp256k1_schnorrsig_sign32(
-    const secp256k1_context *ctx,
-    unsigned char *sig64,
-    const unsigned char *msg32,
-    const secp256k1_keypair *keypair,
-    const unsigned char *aux_rand32
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4);
-
-/** Same as secp256k1_schnorrsig_sign32, but DEPRECATED. Will be removed in
- *  future versions. */
-SECP256K1_API int secp256k1_schnorrsig_sign(
-    const secp256k1_context *ctx,
-    unsigned char *sig64,
-    const unsigned char *msg32,
-    const secp256k1_keypair *keypair,
-    const unsigned char *aux_rand32
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4)
-  SECP256K1_DEPRECATED("Use secp256k1_schnorrsig_sign32 instead");
-
-/** Create a Schnorr signature with a more flexible API.
- *
- *  Same arguments as secp256k1_schnorrsig_sign except that it allows signing
- *  variable length messages and accepts a pointer to an extraparams object that
- *  allows customizing signing by passing additional arguments.
- *
- *  Equivalent to secp256k1_schnorrsig_sign32(..., aux_rand32) if msglen is 32
- *  and extraparams is initialized as follows:
- *  ```
- *  secp256k1_schnorrsig_extraparams extraparams = SECP256K1_SCHNORRSIG_EXTRAPARAMS_INIT;
- *  extraparams.ndata = (unsigned char*)aux_rand32;
- *  ```
- *
- *  Returns 1 on success, 0 on failure.
- *  Args:   ctx: pointer to a context object (not secp256k1_context_static).
- *  Out:  sig64: pointer to a 64-byte array to store the serialized signature.
- *  In:     msg: the message being signed. Can only be NULL if msglen is 0.
- *       msglen: length of the message.
- *      keypair: pointer to an initialized keypair.
- *  extraparams: pointer to an extraparams object (can be NULL).
- */
-SECP256K1_API int secp256k1_schnorrsig_sign_custom(
-    const secp256k1_context *ctx,
-    unsigned char *sig64,
-    const unsigned char *msg,
-    size_t msglen,
-    const secp256k1_keypair *keypair,
-    secp256k1_schnorrsig_extraparams *extraparams
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(5);
-
-/** Verify a Schnorr signature.
- *
- *  Returns: 1: correct signature
- *           0: incorrect signature
- *  Args:    ctx: pointer to a context object.
- *  In:    sig64: pointer to the 64-byte signature to verify.
- *           msg: the message being verified. Can only be NULL if msglen is 0.
- *        msglen: length of the message
- *        pubkey: pointer to an x-only public key to verify with
- */
-SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_schnorrsig_verify(
-    const secp256k1_context *ctx,
-    const unsigned char *sig64,
-    const unsigned char *msg,
-    size_t msglen,
-    const secp256k1_xonly_pubkey *pubkey
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(5);
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif /* SECP256K1_SCHNORRSIG_H */

include/secp256k1_schnorrsig_halfagg.h

@@ -1,107 +0,0 @@
-#ifndef SECP256K1_SCHNORRSIG_HALFAGG_H
-#define SECP256K1_SCHNORRSIG_HALFAGG_H
-
-#include "secp256k1.h"
-#include "secp256k1_extrakeys.h"
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-
-/** Incrementally (Half-)Aggregate a sequence of Schnorr
- *  signatures to an existing half-aggregate signature.
- *
- *  Returns 1 on success, 0 on failure.
- *  Args:           ctx: a secp256k1 context object.
- *  In/Out:      aggsig: pointer to the serialized aggregate signature
- *                       that is input. The first 32*(n_before+1) of this
- *                       array should hold the input aggsig. It will be
- *                       overwritten by the new serialized aggregate signature.
- *                       It should be large enough for that, see aggsig_len.
- *           aggsig_len: size of aggsig array in bytes.
- *                       Should be large enough to hold the new
- *                       serialized aggregate signature, i.e.,
- *                       should satisfy aggsig_size >= 32*(n_before+n_new+1).
- *                       It will be overwritten to be the exact size of the
- *                       resulting aggsig.
- *  In:     all_pubkeys: Array of (n_before + n_new) many x-only public keys,
- *                       including both the ones for the already aggregated signature
- *                       and the ones for the signatures that should be added.
- *                       Can only be NULL if n_before + n_new is 0.
- *           all_msgs32: Array of (n_before + n_new) many 32-byte messages,
- *                       including both the ones for the already aggregated signature
- *                       and the ones for the signatures that should be added.
- *                       Can only be NULL if n_before + n_new is 0.
- *           new_sigs64: Array of n_new many 64-byte signatures, containing the new
- *                       signatures that should be added. Can only be NULL if n_new is 0.
- *             n_before: Number of signatures that have already been aggregated
- *                       in the input aggregate signature.
- *                n_new: Number of signatures that should now be added
- *                       to the aggregate signature.
- */
-SECP256K1_API int secp256k1_schnorrsig_inc_aggregate(
-    const secp256k1_context *ctx,
-    unsigned char *aggsig,
-    size_t *aggsig_len,
-    const secp256k1_xonly_pubkey* all_pubkeys,
-    const unsigned char *all_msgs32,
-    const unsigned char *new_sigs64,
-    size_t n_before,
-    size_t n_new
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
-
-/** (Half-)Aggregate a sequence of Schnorr signatures.
- *
- *  Returns 1 on success, 0 on failure.
- *  Args:           ctx: a secp256k1 context object.
- *  Out:         aggsig: pointer to an array of aggsig_len many bytes to
- *                       store the serialized aggregate signature.
- *  In/Out:  aggsig_len: size of the aggsig array that is passed in bytes;
- *                       will be overwritten to be the exact size of aggsig.
- *  In:         pubkeys: Array of n many x-only public keys.
- *                       Can only be NULL if n is 0.
- *               msgs32: Array of n many 32-byte messages.
- *                       Can only be NULL if n is 0.
- *               sigs64: Array of n many 64-byte signatures.
- *                       Can only be NULL if n is 0.
- *                    n: number of signatures to be aggregated.
- */
-SECP256K1_API int secp256k1_schnorrsig_aggregate(
-    const secp256k1_context *ctx,
-    unsigned char *aggsig,
-    size_t *aggsig_len,
-    const secp256k1_xonly_pubkey *pubkeys,
-    const unsigned char *msgs32,
-    const unsigned char *sigs64,
-    size_t n
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
-
-/** Verify a (Half-)aggregate Schnorr signature.
- *
- *  Returns:          1: correct signature.
- *                    0: incorrect signature.
- *  Args:           ctx: a secp256k1 context object.
- *  In:         pubkeys: Array of n many x-only public keys. Can only be NULL if n is 0.
- *               msgs32: Array of n many 32-byte messages. Can only be NULL if n is 0.
- *                    n: number of signatures to that have been aggregated.
- *               aggsig: Pointer to an array of aggsig_size many bytes
- *                       containing the serialized aggregate
- *                       signature to be verified.
- *           aggsig_len: Size of the aggregate signature in bytes.
- *                       Should be aggsig_len = 32*(n+1)
- */
-SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_schnorrsig_aggverify(
-    const secp256k1_context *ctx,
-    const secp256k1_xonly_pubkey *pubkeys,
-    const unsigned char *msgs32,
-    size_t n,
-    const unsigned char *aggsig,
-    size_t aggsig_len
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(5);
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif /* SECP256K1_SCHNORRSIG_HALFAGG_H */

include/secp256k1_surjectionproof.h

@@ -1,5 +1,5 @@
-#ifndef SECP256K1_SURJECTIONPROOF_H
-#define SECP256K1_SURJECTIONPROOF_H
+#ifndef _SECP256K1_SURJECTIONPROOF_
+#define _SECP256K1_SURJECTIONPROOF_
 
 #include "secp256k1.h"
 #include "secp256k1_rangeproof.h"
@@ -11,9 +11,6 @@ extern "C" {
 /** Maximum number of inputs that may be given in a surjection proof */
 #define SECP256K1_SURJECTIONPROOF_MAX_N_INPUTS 256
 
-/** Maximum number of inputs that may be used in a surjection proof */
-#define SECP256K1_SURJECTIONPROOF_MAX_USED_INPUTS 256
-
 /** Number of bytes a serialized surjection proof requires given the
  *  number of inputs and the number of used inputs.
  */
@@ -22,7 +19,7 @@ extern "C" {
 
 /** Maximum number of bytes a serialized surjection proof requires. */
 #define SECP256K1_SURJECTIONPROOF_SERIALIZATION_BYTES_MAX \
-    SECP256K1_SURJECTIONPROOF_SERIALIZATION_BYTES(SECP256K1_SURJECTIONPROOF_MAX_N_INPUTS, SECP256K1_SURJECTIONPROOF_MAX_USED_INPUTS)
+    SECP256K1_SURJECTIONPROOF_SERIALIZATION_BYTES(SECP256K1_SURJECTIONPROOF_MAX_N_INPUTS, SECP256K1_SURJECTIONPROOF_MAX_N_INPUTS)
 
 /** Opaque data structure that holds a parsed surjection proof
  *
@@ -49,16 +46,15 @@ typedef struct {
     /** Bitmap of which input tags are used in the surjection proof */
     unsigned char used_inputs[SECP256K1_SURJECTIONPROOF_MAX_N_INPUTS / 8];
     /** Borromean signature: e0, scalars */
-    unsigned char data[32 * (1 + SECP256K1_SURJECTIONPROOF_MAX_USED_INPUTS)];
+    unsigned char data[32 * (1 + SECP256K1_SURJECTIONPROOF_MAX_N_INPUTS)];
 } secp256k1_surjectionproof;
 
-#ifndef USE_REDUCED_SURJECTION_PROOF_SIZE
 /** Parse a surjection proof
  *
  *  Returns: 1 when the proof could be parsed, 0 otherwise.
- *  Args: ctx:      pointer to a context object
- *  Out:  proof:    pointer to a proof object
- *  In:   input:    pointer to the array to parse
+ *  Args: ctx:    a secp256k1 context object
+ *  Out:  proof:  a pointer to a proof object
+ *  In:   input:  a pointer to the array to parse
  *        inputlen: length of the array pointed to by input
  *
  *  The proof must consist of:
@@ -69,26 +65,26 @@ typedef struct {
  *      is the number of set bits in the bitmap
  */
 SECP256K1_API int secp256k1_surjectionproof_parse(
-  const secp256k1_context *ctx,
+  const secp256k1_context* ctx,
   secp256k1_surjectionproof *proof,
   const unsigned char *input,
   size_t inputlen
 ) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
-#endif
 
 /** Serialize a surjection proof
  *
  *  Returns: 1 if enough space was available to serialize, 0 otherwise
- *  Args:   ctx:        pointer to a context object
- *  Out:    output:     pointer to an array to store the serialization
- *  In/Out: outputlen:  pointer to an integer which is initially set to the size
- *                      of output, and is overwritten with the written size.
- *  In:     proof:      pointer to an initialized proof object
+ *  Args:   ctx:        a secp256k1 context object
+ *  Out:    output:     a pointer to an array to store the serialization
+ *  In/Out: outputlen:  a pointer to an integer which is initially set to the
+ *                      size of output, and is overwritten with the written
+ *                      size.
+ *  In:     proof:      a pointer to an initialized proof object
  *
  *  See secp256k1_surjectionproof_parse for details about the encoding.
  */
 SECP256K1_API int secp256k1_surjectionproof_serialize(
-  const secp256k1_context *ctx,
+  const secp256k1_context* ctx,
   unsigned char *output,
   size_t *outputlen,
   const secp256k1_surjectionproof *proof
@@ -108,37 +104,36 @@ typedef struct {
  *
  * Returns: the number of inputs for the given proof
  * In:   ctx: pointer to a context object
- *     proof: pointer to a proof object
+ *     proof: a pointer to a proof object
  */
 SECP256K1_API size_t secp256k1_surjectionproof_n_total_inputs(
-  const secp256k1_context *ctx,
-  const secp256k1_surjectionproof *proof
+  const secp256k1_context* ctx,
+  const secp256k1_surjectionproof* proof
 ) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2);
 
 /** Returns the actual number of inputs that a proof uses
  *
  * Returns: the number of inputs for the given proof
  * In:   ctx: pointer to a context object
- *     proof: pointer to a proof object
+ *     proof: a pointer to a proof object
  */
 SECP256K1_API size_t secp256k1_surjectionproof_n_used_inputs(
-  const secp256k1_context *ctx,
-  const secp256k1_surjectionproof *proof
+  const secp256k1_context* ctx,
+  const secp256k1_surjectionproof* proof
 ) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2);
 
 /** Returns the total size this proof would take, in bytes, when serialized
  *
  * Returns: the total size
  * In:   ctx: pointer to a context object
- *     proof: pointer to a proof object
+ *     proof: a pointer to a proof object
  */
 SECP256K1_API size_t secp256k1_surjectionproof_serialized_size(
-  const secp256k1_context *ctx,
-  const secp256k1_surjectionproof *proof
+  const secp256k1_context* ctx,
+  const secp256k1_surjectionproof* proof
 ) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2);
 
 /** Surjection proof initialization function; decides on inputs to use
- *  To be used to initialize stack-allocated secp256k1_surjectionproof struct
  * Returns 0: inputs could not be selected
  *         n: inputs were selected after n iterations of random selection
  *
@@ -147,81 +142,31 @@ SECP256K1_API size_t secp256k1_surjectionproof_serialized_size(
  *                        e.g. in a coinjoin with others' inputs, an ephemeral tag can be given;
  *                        this won't match the output tag but might be used in the anonymity set.)
  *          n_input_tags: the number of entries in the fixed_input_tags array
- *   n_input_tags_to_use: the number of inputs to select randomly to put in the anonymity set
- *                        Must be <= SECP256K1_SURJECTIONPROOF_MAX_USED_INPUTS
+ *      n_input_tags_to_use: the number of inputs to select randomly to put in the anonymity set
  *      fixed_output_tag: fixed output tag
- *      max_n_iterations: the maximum number of iterations to do before giving up. Because the
- *                        maximum number of inputs (SECP256K1_SURJECTIONPROOF_MAX_N_INPUTS) is
- *                        limited to 256 the probability of giving up is smaller than
- *                        (255/256)^(n_input_tags_to_use*max_n_iterations).
- *
- *         random_seed32: random seed to be used for input selection
+ *      max_n_iterations: the maximum number of iterations to do before giving up
+ *         random_seed32: a random seed to be used for input selection
  * Out:            proof: The proof whose bitvector will be initialized. In case of failure,
  *                        the state of the proof is undefined.
  *          input_index: The index of the actual input that is secretly mapped to the output
  */
 SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_surjectionproof_initialize(
-  const secp256k1_context *ctx,
-  secp256k1_surjectionproof *proof,
+  const secp256k1_context* ctx,
+  secp256k1_surjectionproof* proof,
   size_t *input_index,
-  const secp256k1_fixed_asset_tag *fixed_input_tags,
+  const secp256k1_fixed_asset_tag* fixed_input_tags,
   const size_t n_input_tags,
   const size_t n_input_tags_to_use,
-  const secp256k1_fixed_asset_tag *fixed_output_tag,
+  const secp256k1_fixed_asset_tag* fixed_output_tag,
   const size_t n_max_iterations,
   const unsigned char *random_seed32
 ) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4) SECP256K1_ARG_NONNULL(7);
 
-
-/** Surjection proof allocation and initialization function; decides on inputs to use
- * Returns 0: inputs could not be selected, or malloc failure
- *         n: inputs were selected after n iterations of random selection
- *
- * In:               ctx: pointer to a context object
- *           proof_out_p: pointer to a pointer to `secp256k1_surjectionproof*`.
- *                        The newly-allocated struct pointer will be saved here.
- *      fixed_input_tags: fixed input tags `A_i` for all inputs. (If the fixed tag is not known,
- *                        e.g. in a coinjoin with others' inputs, an ephemeral tag can be given;
- *                        this won't match the output tag but might be used in the anonymity set.)
- *          n_input_tags: the number of entries in the fixed_input_tags array
- *      n_input_tags_to_use: the number of inputs to select randomly to put in the anonymity set
- *      fixed_output_tag: fixed output tag
- *      max_n_iterations: the maximum number of iterations to do before giving up. Because the
- *                        maximum number of inputs (SECP256K1_SURJECTIONPROOF_MAX_N_INPUTS) is
- *                        limited to 256 the probability of giving up is smaller than
- *                        (255/256)^(n_input_tags_to_use*max_n_iterations).
- *
- *         random_seed32: random seed to be used for input selection
- * Out:      proof_out_p: pointer to newly-allocated proof whose bitvector will be initialized.
- *                        In case of failure, the pointer will be NULL.
- *          input_index: The index of the actual input that is secretly mapped to the output
- */
-SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_surjectionproof_allocate_initialized(
-        const secp256k1_context *ctx,
-        secp256k1_surjectionproof **proof_out_p,
-        size_t *input_index,
-        const secp256k1_fixed_asset_tag *fixed_input_tags,
-        const size_t n_input_tags,
-        const size_t n_input_tags_to_use,
-        const secp256k1_fixed_asset_tag *fixed_output_tag,
-        const size_t n_max_iterations,
-        const unsigned char *random_seed32
-) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4) SECP256K1_ARG_NONNULL(7);
-
-/** Surjection proof destroy function
- *  deallocates the struct that was allocated with secp256k1_surjectionproof_allocate_initialized
- *
- * In:               proof: pointer to secp256k1_surjectionproof struct
- */
-SECP256K1_API void secp256k1_surjectionproof_destroy(
-        secp256k1_surjectionproof *proof
-) SECP256K1_ARG_NONNULL(1);
-
 /** Surjection proof generation function
  * Returns 0: proof could not be created
  *         1: proof was successfully created
  *
- * In:                   ctx: pointer to a context object (not secp256k1_context_static)
+ * In:                   ctx: pointer to a context object, initialized for signing and verification
  *      ephemeral_input_tags: the ephemeral asset tag of all inputs
  *    n_ephemeral_input_tags: the number of entries in the ephemeral_input_tags array
  *      ephemeral_output_tag: the ephemeral asset tag of the output
@@ -231,36 +176,34 @@ SECP256K1_API void secp256k1_surjectionproof_destroy(
  * In/Out: proof: The produced surjection proof. Must have already gone through `secp256k1_surjectionproof_initialize`
  */
 SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_surjectionproof_generate(
-  const secp256k1_context *ctx,
-  secp256k1_surjectionproof *proof,
-  const secp256k1_generator *ephemeral_input_tags,
+  const secp256k1_context* ctx,
+  secp256k1_surjectionproof* proof,
+  const secp256k1_generator* ephemeral_input_tags,
   size_t n_ephemeral_input_tags,
-  const secp256k1_generator *ephemeral_output_tag,
+  const secp256k1_generator* ephemeral_output_tag,
   size_t input_index,
   const unsigned char *input_blinding_key,
   const unsigned char *output_blinding_key
 ) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(5) SECP256K1_ARG_NONNULL(7) SECP256K1_ARG_NONNULL(8);
 
 
-#ifndef USE_REDUCED_SURJECTION_PROOF_SIZE
 /** Surjection proof verification function
  * Returns 0: proof was invalid
  *         1: proof was valid
  *
- * In:     ctx: pointer to a context object (not secp256k1_context_static)
+ * In:     ctx: pointer to a context object, initialized for signing and verification
  *         proof: proof to be verified
  *      ephemeral_input_tags: the ephemeral asset tag of all inputs
  *    n_ephemeral_input_tags: the number of entries in the ephemeral_input_tags array
  *      ephemeral_output_tag: the ephemeral asset tag of the output
  */
 SECP256K1_API int secp256k1_surjectionproof_verify(
-  const secp256k1_context *ctx,
-  const secp256k1_surjectionproof *proof,
-  const secp256k1_generator *ephemeral_input_tags,
+  const secp256k1_context* ctx,
+  const secp256k1_surjectionproof* proof,
+  const secp256k1_generator* ephemeral_input_tags,
   size_t n_ephemeral_input_tags,
-  const secp256k1_generator *ephemeral_output_tag
+  const secp256k1_generator* ephemeral_output_tag
 ) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(5);
-#endif
 
 #ifdef __cplusplus
 }

include/secp256k1_whitelist.h

@@ -4,8 +4,8 @@
  * file COPYING or http://www.opensource.org/licenses/mit-license.php.*
  **********************************************************************/
 
-#ifndef SECP256K1_WHITELIST_H
-#define SECP256K1_WHITELIST_H
+#ifndef _SECP256K1_WHITELIST_
+#define _SECP256K1_WHITELIST_
 
 #include "secp256k1.h"
 
@@ -13,7 +13,7 @@
 extern "C" {
 #endif
 
-#define SECP256K1_WHITELIST_MAX_N_KEYS 255
+#define SECP256K1_WHITELIST_MAX_N_KEYS	256
 
 /** Opaque data structure that holds a parsed whitelist proof
  *
@@ -40,9 +40,9 @@ typedef struct {
 /** Parse a whitelist signature
  *
  *  Returns: 1 when the signature could be parsed, 0 otherwise.
- *  Args: ctx:    pointer to a context object
- *  Out:  sig:    pointer to a signature object
- *  In:   input:  pointer to the array to parse
+ *  Args: ctx:    a secp256k1 context object
+ *  Out:  sig:    a pointer to a signature object
+ *  In:   input:  a pointer to the array to parse
  *    input_len:  the length of the above array
  *
  *  The signature must consist of a 1-byte n_keys value, followed by a 32-byte
@@ -58,7 +58,7 @@ typedef struct {
  *  to fail validation for any set of keys.
  */
 SECP256K1_API int secp256k1_whitelist_signature_parse(
-    const secp256k1_context *ctx,
+    const secp256k1_context* ctx,
     secp256k1_whitelist_signature *sig,
     const unsigned char *input,
     size_t input_len
@@ -67,7 +67,7 @@ SECP256K1_API int secp256k1_whitelist_signature_parse(
 /** Returns the number of keys a signature expects to have.
  *
  *  Returns: the number of keys for the given signature
- *  In: sig: pointer to a signature object
+ *  In: sig: a pointer to a signature object
  */
 SECP256K1_API size_t secp256k1_whitelist_signature_n_keys(
     const secp256k1_whitelist_signature *sig
@@ -76,15 +76,15 @@ SECP256K1_API size_t secp256k1_whitelist_signature_n_keys(
 /** Serialize a whitelist signature
  *
  *  Returns: 1
- *  Args:   ctx:        pointer to a context object
- *  Out:    output64:   pointer to an array to store the serialization
+ *  Args:   ctx:        a secp256k1 context object
+ *  Out:    output64:   a pointer to an array to store the serialization
  *  In/Out: output_len: length of the above array, updated with the actual serialized length
- *  In:     sig:        pointer to an initialized signature object
+ *  In:     sig:        a pointer to an initialized signature object
  *
  *  See secp256k1_whitelist_signature_parse for details about the encoding.
  */
 SECP256K1_API int secp256k1_whitelist_signature_serialize(
-    const secp256k1_context *ctx,
+    const secp256k1_context* ctx,
     unsigned char *output,
     size_t *output_len,
     const secp256k1_whitelist_signature *sig
@@ -93,7 +93,7 @@ SECP256K1_API int secp256k1_whitelist_signature_serialize(
 /** Compute a whitelist signature
  * Returns 1: signature was successfully created
  *         0: signature was not successfully created
- * In:     ctx: pointer to a context object (not secp256k1_context_static)
+ * In:     ctx: pointer to a context object, initialized for signing and verification
  *         online_pubkeys: list of all online pubkeys
  *         offline_pubkeys: list of all offline pubkeys
  *         n_keys: the number of entries in each of the above two arrays
@@ -101,6 +101,8 @@ SECP256K1_API int secp256k1_whitelist_signature_serialize(
  *         online_seckey: the secret key to the signer's online pubkey
  *         summed_seckey: the secret key to the sum of (whitelisted key, signer's offline pubkey)
  *         index: the signer's index in the lists of keys
+ *         noncefp:pointer to a nonce generation function. If NULL, secp256k1_nonce_function_default is used
+ *         ndata:  pointer to arbitrary data used by the nonce generation function (can be NULL)
  * Out:    sig: The produced signature.
  *
  * The signatures are of the list of all passed pubkeys in the order
@@ -111,21 +113,23 @@ SECP256K1_API int secp256k1_whitelist_signature_serialize(
  * compressed serialization of the key.
  */
 SECP256K1_API int secp256k1_whitelist_sign(
-  const secp256k1_context *ctx,
+  const secp256k1_context* ctx,
   secp256k1_whitelist_signature *sig,
   const secp256k1_pubkey *online_pubkeys,
   const secp256k1_pubkey *offline_pubkeys,
   const size_t n_keys,
   const secp256k1_pubkey *sub_pubkey,
   const unsigned char *online_seckey,
-  const unsigned char *summed_seckeyx,
-  const size_t index
+  const unsigned char *summed_seckey,
+  const size_t index,
+  secp256k1_nonce_function noncefp,
+  const void *noncedata
 ) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4) SECP256K1_ARG_NONNULL(6) SECP256K1_ARG_NONNULL(7) SECP256K1_ARG_NONNULL(8);
 
 /** Verify a whitelist signature
  * Returns 1: signature is valid
  *         0: signature is not valid
- * In:     ctx: pointer to a context object (not secp256k1_context_static)
+ * In:     ctx: pointer to a context object, initialized for signing and verification
  *         sig: the signature to be verified
  *         online_pubkeys: list of all online pubkeys
  *         offline_pubkeys: list of all offline pubkeys
@@ -133,7 +137,7 @@ SECP256K1_API int secp256k1_whitelist_sign(
  *         sub_pubkey: the key to be whitelisted
  */
 SECP256K1_API int secp256k1_whitelist_verify(
-  const secp256k1_context *ctx,
+  const secp256k1_context* ctx,
   const secp256k1_whitelist_signature *sig,
   const secp256k1_pubkey *online_pubkeys,
   const secp256k1_pubkey *offline_pubkeys,

libsecp256k1.pc.in

@@ -8,5 +8,6 @@ Description: Optimized C library for EC operations on curve secp256k1
 URL: https://github.com/bitcoin-core/secp256k1
 Version: @PACKAGE_VERSION@
 Cflags: -I${includedir}
+Libs.private: @SECP_LIBS@
 Libs: -L${libdir} -lsecp256k1
 

sage/gen_exhaustive_groups.sage

@@ -1,156 +0,0 @@
-load("secp256k1_params.sage")
-
-MAX_ORDER = 1000
-
-# Set of (curve) orders we have encountered so far.
-orders_done = set()
-
-# Map from (subgroup) orders to [b, int(gen.x), int(gen.y), gen, lambda] for those subgroups.
-solutions = {}
-
-# Iterate over curves of the form y^2 = x^3 + B.
-for b in range(1, P):
-    # There are only 6 curves (up to isomorphism) of the form y^2 = x^3 + B. Stop once we have tried all.
-    if len(orders_done) == 6:
-        break
-
-    E = EllipticCurve(F, [0, b])
-    print("Analyzing curve y^2 = x^3 + %i" % b)
-    n = E.order()
-
-    # Skip curves with an order we've already tried
-    if n in orders_done:
-        print("- Isomorphic to earlier curve")
-        print()
-        continue
-    orders_done.add(n)
-
-    # Skip curves isomorphic to the real secp256k1
-    if n.is_pseudoprime():
-        assert E.is_isomorphic(C)
-        print("- Isomorphic to secp256k1")
-        print()
-        continue
-
-    print("- Finding prime subgroups")
-
-    # Map from group_order to a set of independent generators for that order.
-    curve_gens = {}
-
-    for g in E.gens():
-        # Find what prime subgroups of group generated by g exist.
-        g_order = g.order()
-        for f, _ in g.order().factor():
-            # Skip subgroups that have bad size.
-            if f < 4:
-                print(f"  - Subgroup of size {f}: too small")
-                continue
-            if f > MAX_ORDER:
-                print(f"  - Subgroup of size {f}: too large")
-                continue
-
-            # Construct a generator for that subgroup.
-            gen = g * (g_order // f)
-            assert(gen.order() == f)
-
-            # Add to set the minimal multiple of gen.
-            curve_gens.setdefault(f, set()).add(min([j*gen for j in range(1, f)]))
-            print(f"  - Subgroup of size {f}: ok")
-
-    for f in sorted(curve_gens.keys()):
-        print(f"- Constructing group of order {f}")
-        cbrts = sorted([int(c) for c in Integers(f)(1).nth_root(3, all=true) if c != 1])
-        gens = list(curve_gens[f])
-        sol_count = 0
-        no_endo_count = 0
-
-        # Consider all non-zero linear combinations of the independent generators.
-        for j in range(1, f**len(gens)):
-            gen = sum(gens[k] * ((j // f**k) % f) for k in range(len(gens)))
-            assert not gen.is_zero()
-            assert (f*gen).is_zero()
-
-            # Find lambda for endomorphism. Skip if none can be found.
-            lam = None
-            for l in cbrts:
-                if l*gen == E(BETA*gen[0], gen[1]):
-                    lam = l
-                    break
-
-            if lam is None:
-                no_endo_count += 1
-            else:
-                sol_count += 1
-                solutions.setdefault(f, []).append((b, int(gen[0]), int(gen[1]), gen, lam))
-
-        print(f"  - Found {sol_count} generators (plus {no_endo_count} without endomorphism)")
-
-    print()
-
-def output_generator(g, name):
-    print(f"#define {name} SECP256K1_GE_CONST(\\")
-    print("    0x%08x, 0x%08x, 0x%08x, 0x%08x,\\" % tuple((int(g[0]) >> (32 * (7 - i))) & 0xffffffff for i in range(4)))
-    print("    0x%08x, 0x%08x, 0x%08x, 0x%08x,\\" % tuple((int(g[0]) >> (32 * (7 - i))) & 0xffffffff for i in range(4, 8)))
-    print("    0x%08x, 0x%08x, 0x%08x, 0x%08x,\\" % tuple((int(g[1]) >> (32 * (7 - i))) & 0xffffffff for i in range(4)))
-    print("    0x%08x, 0x%08x, 0x%08x, 0x%08x\\" % tuple((int(g[1]) >> (32 * (7 - i))) & 0xffffffff for i in range(4, 8)))
-    print(")")
-
-def output_b(b):
-    print(f"#define SECP256K1_B {int(b)}")
-
-print()
-print("To be put in src/group_impl.h:")
-print()
-print("/* Begin of section generated by sage/gen_exhaustive_groups.sage. */")
-for f in sorted(solutions.keys()):
-    # Use as generator/2 the one with lowest b, and lowest (x, y) generator (interpreted as non-negative integers).
-    b, _, _, HALF_G, lam = min(solutions[f])
-    output_generator(2 * HALF_G, f"SECP256K1_G_ORDER_{f}")
-print("/** Generator for secp256k1, value 'g' defined in")
-print(" *  \"Standards for Efficient Cryptography\" (SEC2) 2.7.1.")
-print(" */")
-output_generator(G, "SECP256K1_G")
-print("/* These exhaustive group test orders and generators are chosen such that:")
-print(" * - The field size is equal to that of secp256k1, so field code is the same.")
-print(" * - The curve equation is of the form y^2=x^3+B for some small constant B.")
-print(" * - The subgroup has a generator 2*P, where P.x is as small as possible.")
-print(f" * - The subgroup has size less than {MAX_ORDER} to permit exhaustive testing.")
-print(" * - The subgroup admits an endomorphism of the form lambda*(x,y) == (beta*x,y).")
-print(" */")
-print("#if defined(EXHAUSTIVE_TEST_ORDER)")
-first = True
-for f in sorted(solutions.keys()):
-    b, _, _, _, lam = min(solutions[f])
-    print(f"#  {'if' if first else 'elif'} EXHAUSTIVE_TEST_ORDER == {f}")
-    first = False
-    print()
-    print(f"static const secp256k1_ge secp256k1_ge_const_g = SECP256K1_G_ORDER_{f};")
-    output_b(b)
-    print()
-print("#  else")
-print("#    error No known generator for the specified exhaustive test group order.")
-print("#  endif")
-print("#else")
-print()
-print("static const secp256k1_ge secp256k1_ge_const_g = SECP256K1_G;")
-output_b(7)
-print()
-print("#endif")
-print("/* End of section generated by sage/gen_exhaustive_groups.sage. */")
-
-
-print()
-print()
-print("To be put in src/scalar_impl.h:")
-print()
-print("/* Begin of section generated by sage/gen_exhaustive_groups.sage. */")
-first = True
-for f in sorted(solutions.keys()):
-    _, _, _, _, lam = min(solutions[f])
-    print("#  %s EXHAUSTIVE_TEST_ORDER == %i" % ("if" if first else "elif", f))
-    first = False
-    print("#    define EXHAUSTIVE_TEST_LAMBDA %i" % lam)
-print("#  else")
-print("#    error No known lambda for the specified exhaustive test group order.")
-print("#  endif")
-print("/* End of section generated by sage/gen_exhaustive_groups.sage. */")

sage/gen_split_lambda_constants.sage

@@ -1,114 +0,0 @@
-""" Generates the constants used in secp256k1_scalar_split_lambda.
-
-See the comments for secp256k1_scalar_split_lambda in src/scalar_impl.h for detailed explanations.
-"""
-
-load("secp256k1_params.sage")
-
-def inf_norm(v):
-    """Returns the infinity norm of a vector."""
-    return max(map(abs, v))
-
-def gauss_reduction(i1, i2):
-    v1, v2 = i1.copy(), i2.copy()
-    while True:
-        if inf_norm(v2) < inf_norm(v1):
-            v1, v2 = v2, v1
-        # This is essentially
-        #    m = round((v1[0]*v2[0] + v1[1]*v2[1]) / (inf_norm(v1)**2))
-        # (rounding to the nearest integer) without relying on floating point arithmetic.
-        m = ((v1[0]*v2[0] + v1[1]*v2[1]) + (inf_norm(v1)**2) // 2) // (inf_norm(v1)**2)
-        if m == 0:
-            return v1, v2
-        v2[0] -= m*v1[0]
-        v2[1] -= m*v1[1]
-
-def find_split_constants_gauss():
-    """Find constants for secp256k1_scalar_split_lamdba using gauss reduction."""
-    (v11, v12), (v21, v22) = gauss_reduction([0, N], [1, int(LAMBDA)])
-
-    # We use related vectors in secp256k1_scalar_split_lambda.
-    A1, B1 = -v21, -v11
-    A2, B2 = v22, -v21
-
-    return A1, B1, A2, B2
-
-def find_split_constants_explicit_tof():
-    """Find constants for secp256k1_scalar_split_lamdba using the trace of Frobenius.
-
-    See Benjamin Smith: "Easy scalar decompositions for efficient scalar multiplication on
-    elliptic curves and genus 2 Jacobians" (https://eprint.iacr.org/2013/672), Example 2
-    """
-    assert P % 3 == 1 # The paper says P % 3 == 2 but that appears to be a mistake, see [10].
-    assert C.j_invariant() == 0
-
-    t = C.trace_of_frobenius()
-
-    c = Integer(sqrt((4*P - t**2)/3))
-    A1 = Integer((t - c)/2 - 1)
-    B1 = c
-
-    A2 = Integer((t + c)/2 - 1)
-    B2 = Integer(1 - (t - c)/2)
-
-    # We use a negated b values in secp256k1_scalar_split_lambda.
-    B1, B2 = -B1, -B2
-
-    return A1, B1, A2, B2
-
-A1, B1, A2, B2 = find_split_constants_explicit_tof()
-
-# For extra fun, use an independent method to recompute the constants.
-assert (A1, B1, A2, B2) == find_split_constants_gauss()
-
-# PHI : Z[l] -> Z_n where phi(a + b*l) == a + b*lambda mod n.
-def PHI(a,b):
-    return Z(a + LAMBDA*b)
-
-# Check that (A1, B1) and (A2, B2) are in the kernel of PHI.
-assert PHI(A1, B1) == Z(0)
-assert PHI(A2, B2) == Z(0)
-
-# Check that the parallelogram generated by (A1, A2) and (B1, B2)
-# is a fundamental domain by containing exactly N points.
-# Since the LHS is the determinant and N != 0, this also checks that
-# (A1, A2) and (B1, B2) are linearly independent. By the previous
-# assertions, (A1, A2) and (B1, B2) are a basis of the kernel.
-assert A1*B2 - B1*A2 == N
-
-# Check that their components are short enough.
-assert (A1 + A2)/2 < sqrt(N)
-assert B1 < sqrt(N)
-assert B2 < sqrt(N)
-
-G1 = round((2**384)*B2/N)
-G2 = round((2**384)*(-B1)/N)
-
-def rnddiv2(v):
-    if v & 1:
-        v += 1
-    return v >> 1
-
-def scalar_lambda_split(k):
-    """Equivalent to secp256k1_scalar_lambda_split()."""
-    c1 = rnddiv2((k * G1) >> 383)
-    c2 = rnddiv2((k * G2) >> 383)
-    c1 = (c1 * -B1) % N
-    c2 = (c2 * -B2) % N
-    r2 = (c1 + c2) % N
-    r1 = (k + r2 * -LAMBDA) % N
-    return (r1, r2)
-
-# The result of scalar_lambda_split can depend on the representation of k (mod n).
-SPECIAL = (2**383) // G2 + 1
-assert scalar_lambda_split(SPECIAL) != scalar_lambda_split(SPECIAL + N)
-
-print('  A1     =', hex(A1))
-print(' -B1     =', hex(-B1))
-print('  A2     =', hex(A2))
-print(' -B2     =', hex(-B2))
-print('         =', hex(Z(-B2)))
-print(' -LAMBDA =', hex(-LAMBDA))
-
-print('  G1     =', hex(G1))
-print('  G2     =', hex(G2))

sage/group_prover.sage

@@ -3,7 +3,7 @@
 # to independently set assumptions on input or intermediary variables.
 #
 # The general approach is:
-# * A constraint is a tuple of two sets of symbolic expressions:
+# * A constraint is a tuple of two sets of of symbolic expressions:
 #   the first of which are required to evaluate to zero, the second of which
 #   are required to evaluate to nonzero.
 #   - A constraint is said to be conflicting if any of its nonzero expressions
@@ -17,7 +17,7 @@
 #   - A constraint describing the requirements of the law, called "require"
 # * Implementations are transliterated into functions that operate as well on
 #   algebraic input points, and are called once per combination of branches
-#   executed. Each execution returns:
+#   exectured. Each execution returns:
 #   - A constraint describing the assumptions this implementation requires
 #     (such as Z1=1), called "assumeFormula"
 #   - A constraint describing the assumptions this specific branch requires,
@@ -42,7 +42,7 @@
 #     as we assume that all constraints in it are complementary with each other.
 #
 # Based on the sage verification scripts used in the Explicit-Formulas Database
-# by Tanja Lange and others, see https://hyperelliptic.org/EFD
+# by Tanja Lange and others, see http://hyperelliptic.org/EFD
 
 class fastfrac:
   """Fractions over rings."""
@@ -65,7 +65,7 @@ class fastfrac:
     return self.top in I and self.bot not in I
 
   def reduce(self,assumeZero):
-    zero = self.R.ideal(list(map(numerator, assumeZero)))
+    zero = self.R.ideal(map(numerator, assumeZero))
     return fastfrac(self.R, zero.reduce(self.top)) / fastfrac(self.R, zero.reduce(self.bot))
 
   def __add__(self,other):
@@ -100,7 +100,7 @@ class fastfrac:
     """Multiply something else with a fraction."""
     return self.__mul__(other)
 
-  def __truediv__(self,other):
+  def __div__(self,other):
     """Divide two fractions."""
     if parent(other) == ZZ:
       return fastfrac(self.R,self.top,self.bot * other)
@@ -108,11 +108,6 @@ class fastfrac:
       return fastfrac(self.R,self.top * other.bot,self.bot * other.top)
     return NotImplemented
 
-  # Compatibility wrapper for Sage versions based on Python 2
-  def __div__(self,other):
-     """Divide two fractions."""
-     return self.__truediv__(other)
-
   def __pow__(self,other):
     """Compute a power of a fraction."""
     if parent(other) == ZZ:
@@ -164,9 +159,6 @@ class constraints:
   def negate(self):
     return constraints(zero=self.nonzero, nonzero=self.zero)
 
-  def map(self, fun):
-    return constraints(zero={fun(k): v for k, v in self.zero.items()}, nonzero={fun(k): v for k, v in self.nonzero.items()})
-
   def __add__(self, other):
     zero = self.zero.copy()
     zero.update(other.zero)
@@ -180,34 +172,10 @@ class constraints:
   def __repr__(self):
     return "%s" % self
 
-def normalize_factor(p):
-  """Normalizes the sign of primitive polynomials (as returned by factor())
-
-  This function ensures that the polynomial has a positive leading coefficient.
-
-  This is necessary because recent sage versions (starting with v9.3 or v9.4,
-  we don't know) are inconsistent about the placement of the minus sign in
-  polynomial factorizations:
-  ```
-  sage: R.<ax,bx,ay,by,Az,Bz,Ai,Bi> = PolynomialRing(QQ,8,order='invlex')
-  sage: R((-2 * (bx - ax)) ^ 1).factor()
-  (-2) * (bx - ax)
-  sage: R((-2 * (bx - ax)) ^ 2).factor()
-  (4) * (-bx + ax)^2
-  sage: R((-2 * (bx - ax)) ^ 3).factor()
-  (8) * (-bx + ax)^3
-  ```
-  """
-  # Assert p is not 0 and that its non-zero coefficients are coprime.
-  # (We could just work with the primitive part p/p.content() but we want to be
-  # aware if factor() does not return a primitive part in future sage versions.)
-  assert p.content() == 1
-  # Ensure that the first non-zero coefficient is positive.
-  return p if p.lc() > 0 else -p
 
 def conflicts(R, con):
   """Check whether any of the passed non-zero assumptions is implied by the zero assumptions"""
-  zero = R.ideal(list(map(numerator, con.zero)))
+  zero = R.ideal(map(numerator, con.zero))
   if 1 in zero:
     return True
   # First a cheap check whether any of the individual nonzero terms conflict on
@@ -227,20 +195,20 @@ def conflicts(R, con):
 
 def get_nonzero_set(R, assume):
   """Calculate a simple set of nonzero expressions"""
-  zero = R.ideal(list(map(numerator, assume.zero)))
+  zero = R.ideal(map(numerator, assume.zero))
   nonzero = set()
   for nz in map(numerator, assume.nonzero):
     for (f,n) in nz.factor():
-      nonzero.add(normalize_factor(f))
+      nonzero.add(f)
     rnz = zero.reduce(nz)
     for (f,n) in rnz.factor():
-      nonzero.add(normalize_factor(f))
+      nonzero.add(f)
   return nonzero
 
 
 def prove_nonzero(R, exprs, assume):
   """Check whether an expression is provably nonzero, given assumptions"""
-  zero = R.ideal(list(map(numerator, assume.zero)))
+  zero = R.ideal(map(numerator, assume.zero))
   nonzero = get_nonzero_set(R, assume)
   expl = set()
   ok = True
@@ -249,27 +217,27 @@ def prove_nonzero(R, exprs, assume):
       return (False, [exprs[expr]])
   allexprs = reduce(lambda a,b: numerator(a)*numerator(b), exprs, 1)
   for (f, n) in allexprs.factor():
-    if normalize_factor(f) not in nonzero:
+    if f not in nonzero:
       ok = False
   if ok:
     return (True, None)
   ok = True
-  for (f, n) in zero.reduce(allexprs).factor():
-    if normalize_factor(f) not in nonzero:
+  for (f, n) in zero.reduce(numerator(allexprs)).factor():
+    if f not in nonzero:
       ok = False
   if ok:
     return (True, None)
   ok = True
   for expr in exprs:
     for (f,n) in numerator(expr).factor():
-      if normalize_factor(f) not in nonzero:
+      if f not in nonzero:
         ok = False
   if ok:
     return (True, None)
   ok = True
   for expr in exprs:
     for (f,n) in zero.reduce(numerator(expr)).factor():
-      if normalize_factor(f) not in nonzero:
+      if f not in nonzero:
         expl.add(exprs[expr])
   if expl:
     return (False, list(expl))
@@ -281,8 +249,8 @@ def prove_zero(R, exprs, assume):
   """Check whether all of the passed expressions are provably zero, given assumptions"""
   r, e = prove_nonzero(R, dict(map(lambda x: (fastfrac(R, x.bot, 1), exprs[x]), exprs)), assume)
   if not r:
-    return (False, list(map(lambda x: "Possibly zero denominator: %s" % x, e)))
-  zero = R.ideal(list(map(numerator, assume.zero)))
+    return (False, map(lambda x: "Possibly zero denominator: %s" % x, e))
+  zero = R.ideal(map(numerator, assume.zero))
   nonzero = prod(x for x in assume.nonzero)
   expl = []
   for expr in exprs:
@@ -297,8 +265,8 @@ def describe_extra(R, assume, assumeExtra):
   """Describe what assumptions are added, given existing assumptions"""
   zerox = assume.zero.copy()
   zerox.update(assumeExtra.zero)
-  zero = R.ideal(list(map(numerator, assume.zero)))
-  zeroextra = R.ideal(list(map(numerator, zerox)))
+  zero = R.ideal(map(numerator, assume.zero))
+  zeroextra = R.ideal(map(numerator, zerox))
   nonzero = get_nonzero_set(R, assume)
   ret = set()
   # Iterate over the extra zero expressions
@@ -306,8 +274,8 @@ def describe_extra(R, assume, assumeExtra):
     if base not in zero:
       add = []
       for (f, n) in numerator(base).factor():
-        if normalize_factor(f) not in nonzero:
-          add += ["%s" % normalize_factor(f)]
+        if f not in nonzero:
+          add += ["%s" % f]
       if add:
         ret.add((" * ".join(add)) + " = 0 [%s]" % assumeExtra.zero[base])
   # Iterate over the extra nonzero expressions
@@ -315,8 +283,8 @@ def describe_extra(R, assume, assumeExtra):
     nzr = zeroextra.reduce(numerator(nz))
     if nzr not in zeroextra:
       for (f,n) in nzr.factor():
-        if normalize_factor(zeroextra.reduce(f)) not in nonzero:
-          ret.add("%s != 0" % normalize_factor(zeroextra.reduce(f)))
+        if zeroextra.reduce(f) not in nonzero:
+          ret.add("%s != 0" % zeroextra.reduce(f))
   return ", ".join(x for x in ret)
 
 
@@ -326,21 +294,22 @@ def check_symbolic(R, assumeLaw, assumeAssert, assumeBranch, require):
 
   if conflicts(R, assume):
     # This formula does not apply
-    return (True, None)
+    return None
 
   describe = describe_extra(R, assumeLaw + assumeBranch, assumeAssert)
-  if describe != "":
-    describe = " (assuming " + describe + ")"
 
   ok, msg = prove_zero(R, require.zero, assume)
   if not ok:
-    return (False, "FAIL, %s fails%s" % (str(msg), describe))
+    return "FAIL, %s fails (assuming %s)" % (str(msg), describe)
 
   res, expl = prove_nonzero(R, require.nonzero, assume)
   if not res:
-    return (False, "FAIL, %s fails%s" % (str(expl), describe))
+    return "FAIL, %s fails (assuming %s)" % (str(expl), describe)
 
-  return (True, "OK%s" % describe)
+  if describe != "":
+    return "OK (assuming %s)" % describe
+  else:
+    return "OK"
 
 
 def concrete_verify(c):

sage/secp256k1.sage

@@ -8,20 +8,25 @@ load("weierstrass_prover.sage")
 def formula_secp256k1_gej_double_var(a):
   """libsecp256k1's secp256k1_gej_double_var, used by various addition functions"""
   rz = a.Z * a.Y
-  s = a.Y^2
-  l = a.X^2
-  l = l * 3
-  l = l / 2
-  t = -s
-  t = t * a.X
-  rx = l^2
-  rx = rx + t
-  rx = rx + t
-  s = s^2
-  t = t + rx
-  ry = t * l
-  ry = ry + s
-  ry = -ry
+  rz = rz * 2
+  t1 = a.X^2
+  t1 = t1 * 3
+  t2 = t1^2
+  t3 = a.Y^2
+  t3 = t3 * 2
+  t4 = t3^2
+  t4 = t4 * 2
+  t3 = t3 * a.X
+  rx = t3
+  rx = rx * 4
+  rx = -rx
+  rx = rx + t2
+  t2 = -t2
+  t3 = t3 * 6
+  t3 = t3 + t2
+  ry = t1 * t3
+  t2 = -t4
+  ry = ry + t2
   return jacobianpoint(rx, ry, rz)
 
 def formula_secp256k1_gej_add_var(branch, a, b):
@@ -40,26 +45,29 @@ def formula_secp256k1_gej_add_var(branch, a, b):
   s2 = s2 * a.Z
   h = -u1
   h = h + u2
-  i = -s2
-  i = i + s1
+  i = -s1
+  i = i + s2
   if branch == 2:
     r = formula_secp256k1_gej_double_var(a)
     return (constraints(), constraints(zero={h : 'h=0', i : 'i=0', a.Infinity : 'a_finite', b.Infinity : 'b_finite'}), r)
   if branch == 3:
     return (constraints(), constraints(zero={h : 'h=0', a.Infinity : 'a_finite', b.Infinity : 'b_finite'}, nonzero={i : 'i!=0'}), point_at_infinity())
-  t = h * b.Z
-  rz = a.Z * t
+  i2 = i^2
   h2 = h^2
-  h2 = -h2
   h3 = h2 * h
+  h = h * b.Z
+  rz = a.Z * h
   t = u1 * h2
-  rx = i^2
+  rx = t
+  rx = rx * 2
   rx = rx + h3
-  rx = rx + t
-  rx = rx + t
-  t = t + rx
-  ry = t * i
+  rx = -rx
+  rx = rx + i2
+  ry = -rx
+  ry = ry + t
+  ry = ry * i
   h3 = h3 * s1
+  h3 = -h3
   ry = ry + h3
   return (constraints(), constraints(zero={a.Infinity : 'a_finite', b.Infinity : 'b_finite'}, nonzero={h : 'h!=0'}), jacobianpoint(rx, ry, rz))
 
@@ -77,25 +85,28 @@ def formula_secp256k1_gej_add_ge_var(branch, a, b):
   s2 = s2 * a.Z
   h = -u1
   h = h + u2
-  i = -s2
-  i = i + s1
+  i = -s1
+  i = i + s2
   if (branch == 2):
     r = formula_secp256k1_gej_double_var(a)
     return (constraints(zero={b.Z - 1 : 'b.z=1'}), constraints(zero={a.Infinity : 'a_finite', b.Infinity : 'b_finite', h : 'h=0', i : 'i=0'}), r)
   if (branch == 3):
     return (constraints(zero={b.Z - 1 : 'b.z=1'}), constraints(zero={a.Infinity : 'a_finite', b.Infinity : 'b_finite', h : 'h=0'}, nonzero={i : 'i!=0'}), point_at_infinity())
-  rz = a.Z * h
+  i2 = i^2
   h2 = h^2
-  h2 = -h2
-  h3 = h2 * h
+  h3 = h * h2
+  rz = a.Z * h
   t = u1 * h2
-  rx = i^2
+  rx = t
+  rx = rx * 2
   rx = rx + h3
-  rx = rx + t
-  rx = rx + t
-  t = t + rx
-  ry = t * i
+  rx = -rx
+  rx = rx + i2
+  ry = -rx
+  ry = ry + t
+  ry = ry * i
   h3 = h3 * s1
+  h3 = -h3
   ry = ry + h3
   return (constraints(zero={b.Z - 1 : 'b.z=1'}), constraints(zero={a.Infinity : 'a_finite', b.Infinity : 'b_finite'}, nonzero={h : 'h!=0'}), jacobianpoint(rx, ry, rz))
 
@@ -103,15 +114,14 @@ def formula_secp256k1_gej_add_zinv_var(branch, a, b):
   """libsecp256k1's secp256k1_gej_add_zinv_var"""
   bzinv = b.Z^(-1)
   if branch == 0:
-    rinf = b.Infinity
+    return (constraints(), constraints(nonzero={b.Infinity : 'b_infinite'}), a)
+  if branch == 1:
     bzinv2 = bzinv^2
     bzinv3 = bzinv2 * bzinv
     rx = b.X * bzinv2
     ry = b.Y * bzinv3
     rz = 1
-    return (constraints(), constraints(nonzero={a.Infinity : 'a_infinite'}), jacobianpoint(rx, ry, rz, rinf))
-  if branch == 1:
-    return (constraints(), constraints(zero={a.Infinity : 'a_finite'}, nonzero={b.Infinity : 'b_infinite'}), a)
+    return (constraints(), constraints(zero={b.Infinity : 'b_finite'}, nonzero={a.Infinity : 'a_infinite'}), jacobianpoint(rx, ry, rz))
   azz = a.Z * bzinv
   z12 = azz^2
   u1 = a.X
@@ -121,25 +131,29 @@ def formula_secp256k1_gej_add_zinv_var(branch, a, b):
   s2 = s2 * azz
   h = -u1
   h = h + u2
-  i = -s2
-  i = i + s1
+  i = -s1
+  i = i + s2
   if branch == 2:
     r = formula_secp256k1_gej_double_var(a)
     return (constraints(), constraints(zero={a.Infinity : 'a_finite', b.Infinity : 'b_finite', h : 'h=0', i : 'i=0'}), r)
   if branch == 3:
     return (constraints(), constraints(zero={a.Infinity : 'a_finite', b.Infinity : 'b_finite', h : 'h=0'}, nonzero={i : 'i!=0'}), point_at_infinity())
-  rz = a.Z * h
+  i2 = i^2
   h2 = h^2
-  h2 = -h2
-  h3 = h2 * h
+  h3 = h * h2
+  rz = a.Z
+  rz = rz * h
   t = u1 * h2
-  rx = i^2
+  rx = t
+  rx = rx * 2
   rx = rx + h3
-  rx = rx + t
-  rx = rx + t
-  t = t + rx
-  ry = t * i
+  rx = -rx
+  rx = rx + i2
+  ry = -rx
+  ry = ry + t
+  ry = ry * i
   h3 = h3 * s1
+  h3 = -h3
   ry = ry + h3
   return (constraints(), constraints(zero={a.Infinity : 'a_finite', b.Infinity : 'b_finite'}, nonzero={h : 'h!=0'}), jacobianpoint(rx, ry, rz))
 
@@ -148,7 +162,7 @@ def formula_secp256k1_gej_add_ge(branch, a, b):
   zeroes = {}
   nonzeroes = {}
   a_infinity = False
-  if (branch & 2) != 0:
+  if (branch & 4) != 0:
     nonzeroes.update({a.Infinity : 'a_infinite'})
     a_infinity = True
   else:
@@ -167,11 +181,15 @@ def formula_secp256k1_gej_add_ge(branch, a, b):
   m_alt = -u2
   tt = u1 * m_alt
   rr = rr + tt
-  degenerate = (branch & 1) != 0
-  if degenerate:
+  degenerate = (branch & 3) == 3
+  if (branch & 1) != 0:
     zeroes.update({m : 'm_zero'})
   else:
     nonzeroes.update({m : 'm_nonzero'})
+  if (branch & 2) != 0:
+    zeroes.update({rr : 'rr_zero'})
+  else:
+    nonzeroes.update({rr : 'rr_nonzero'})
   rr_alt = s1
   rr_alt = rr_alt * 2
   m_alt = m_alt + u1
@@ -179,13 +197,21 @@ def formula_secp256k1_gej_add_ge(branch, a, b):
     rr_alt = rr
     m_alt = m
   n = m_alt^2
-  q = -t
-  q = q * n
+  q = n * t
   n = n^2
   if degenerate:
     n = m
   t = rr_alt^2
   rz = a.Z * m_alt
+  infinity = False
+  if (branch & 8) != 0:
+    if not a_infinity:
+      infinity = True
+    zeroes.update({rz : 'r.z=0'})
+  else:
+    nonzeroes.update({rz : 'r.z!=0'})
+  rz = rz * 2
+  q = -q
   t = t + q
   rx = t
   t = t * 2
@@ -193,16 +219,14 @@ def formula_secp256k1_gej_add_ge(branch, a, b):
   t = t * rr_alt
   t = t + n
   ry = -t
-  ry = ry / 2
+  rx = rx * 4
+  ry = ry * 4
   if a_infinity:
     rx = b.X
     ry = b.Y
     rz = 1
-  if (branch & 4) != 0:
-    zeroes.update({rz : 'r.z = 0'})
+  if infinity:
     return (constraints(zero={b.Z - 1 : 'b.z=1', b.Infinity : 'b_finite'}), constraints(zero=zeroes, nonzero=nonzeroes), point_at_infinity())
-  else:
-    nonzeroes.update({rz : 'r.z != 0'})
   return (constraints(zero={b.Z - 1 : 'b.z=1', b.Infinity : 'b_finite'}), constraints(zero=zeroes, nonzero=nonzeroes), jacobianpoint(rx, ry, rz))
 
 def formula_secp256k1_gej_add_ge_old(branch, a, b):
@@ -268,18 +292,15 @@ def formula_secp256k1_gej_add_ge_old(branch, a, b):
   return (constraints(zero={b.Z - 1 : 'b.z=1', b.Infinity : 'b_finite'}), constraints(zero=zero, nonzero=nonzero), jacobianpoint(rx, ry, rz))
 
 if __name__ == "__main__":
-  success = True
-  success = success & check_symbolic_jacobian_weierstrass("secp256k1_gej_add_var", 0, 7, 5, formula_secp256k1_gej_add_var)
-  success = success & check_symbolic_jacobian_weierstrass("secp256k1_gej_add_ge_var", 0, 7, 5, formula_secp256k1_gej_add_ge_var)
-  success = success & check_symbolic_jacobian_weierstrass("secp256k1_gej_add_zinv_var", 0, 7, 5, formula_secp256k1_gej_add_zinv_var)
-  success = success & check_symbolic_jacobian_weierstrass("secp256k1_gej_add_ge", 0, 7, 8, formula_secp256k1_gej_add_ge)
-  success = success & (not check_symbolic_jacobian_weierstrass("secp256k1_gej_add_ge_old [should fail]", 0, 7, 4, formula_secp256k1_gej_add_ge_old))
+  check_symbolic_jacobian_weierstrass("secp256k1_gej_add_var", 0, 7, 5, formula_secp256k1_gej_add_var)
+  check_symbolic_jacobian_weierstrass("secp256k1_gej_add_ge_var", 0, 7, 5, formula_secp256k1_gej_add_ge_var)
+  check_symbolic_jacobian_weierstrass("secp256k1_gej_add_zinv_var", 0, 7, 5, formula_secp256k1_gej_add_zinv_var)
+  check_symbolic_jacobian_weierstrass("secp256k1_gej_add_ge", 0, 7, 16, formula_secp256k1_gej_add_ge)
+  check_symbolic_jacobian_weierstrass("secp256k1_gej_add_ge_old [should fail]", 0, 7, 4, formula_secp256k1_gej_add_ge_old)
 
   if len(sys.argv) >= 2 and sys.argv[1] == "--exhaustive":
-    success = success & check_exhaustive_jacobian_weierstrass("secp256k1_gej_add_var", 0, 7, 5, formula_secp256k1_gej_add_var, 43)
-    success = success & check_exhaustive_jacobian_weierstrass("secp256k1_gej_add_ge_var", 0, 7, 5, formula_secp256k1_gej_add_ge_var, 43)
-    success = success & check_exhaustive_jacobian_weierstrass("secp256k1_gej_add_zinv_var", 0, 7, 5, formula_secp256k1_gej_add_zinv_var, 43)
-    success = success & check_exhaustive_jacobian_weierstrass("secp256k1_gej_add_ge", 0, 7, 8, formula_secp256k1_gej_add_ge, 43)
-    success = success & (not check_exhaustive_jacobian_weierstrass("secp256k1_gej_add_ge_old [should fail]", 0, 7, 4, formula_secp256k1_gej_add_ge_old, 43))
-
-  sys.exit(int(not success))
+    check_exhaustive_jacobian_weierstrass("secp256k1_gej_add_var", 0, 7, 5, formula_secp256k1_gej_add_var, 43)
+    check_exhaustive_jacobian_weierstrass("secp256k1_gej_add_ge_var", 0, 7, 5, formula_secp256k1_gej_add_ge_var, 43)
+    check_exhaustive_jacobian_weierstrass("secp256k1_gej_add_zinv_var", 0, 7, 5, formula_secp256k1_gej_add_zinv_var, 43)
+    check_exhaustive_jacobian_weierstrass("secp256k1_gej_add_ge", 0, 7, 16, formula_secp256k1_gej_add_ge, 43)
+    check_exhaustive_jacobian_weierstrass("secp256k1_gej_add_ge_old [should fail]", 0, 7, 4, formula_secp256k1_gej_add_ge_old, 43)

sage/secp256k1_params.sage

@@ -1,39 +0,0 @@
-"""Prime order of finite field underlying secp256k1 (2^256 - 2^32 - 977)"""
-P = 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F
-
-"""Finite field underlying secp256k1"""
-F = FiniteField(P)
-
-"""Elliptic curve secp256k1: y^2 = x^3 + 7"""
-C = EllipticCurve([F(0), F(7)])
-
-"""Base point of secp256k1"""
-G = C.lift_x(0x79BE667EF9DCBBAC55A06295CE870B07029BFCDB2DCE28D959F2815B16F81798)
-if int(G[1]) & 1:
-    # G.y is even
-    G = -G
-
-"""Prime order of secp256k1"""
-N = C.order()
-
-"""Finite field of scalars of secp256k1"""
-Z = FiniteField(N)
-
-""" Beta value of secp256k1 non-trivial endomorphism: lambda * (x, y) = (beta * x, y)"""
-BETA = F(2)^((P-1)/3)
-
-""" Lambda value of secp256k1 non-trivial endomorphism: lambda * (x, y) = (beta * x, y)"""
-LAMBDA = Z(3)^((N-1)/3)
-
-assert is_prime(P)
-assert is_prime(N)
-
-assert BETA != F(1)
-assert BETA^3 == F(1)
-assert BETA^2 + BETA + 1 == 0
-
-assert LAMBDA != Z(1)
-assert LAMBDA^3 == Z(1)
-assert LAMBDA^2 + LAMBDA + 1 == 0
-
-assert Integer(LAMBDA)*G == C(BETA*G[0], G[1])

sage/weierstrass_prover.sage

@@ -175,25 +175,24 @@ laws_jacobian_weierstrass = {
 def check_exhaustive_jacobian_weierstrass(name, A, B, branches, formula, p):
   """Verify an implementation of addition of Jacobian points on a Weierstrass curve, by executing and validating the result for every possible addition in a prime field"""
   F = Integers(p)
-  print("Formula %s on Z%i:" % (name, p))
+  print "Formula %s on Z%i:" % (name, p)
   points = []
-  for x in range(0, p):
-    for y in range(0, p):
+  for x in xrange(0, p):
+    for y in xrange(0, p):
       point = affinepoint(F(x), F(y))
       r, e = concrete_verify(on_weierstrass_curve(A, B, point))
       if r:
         points.append(point)
 
-  ret = True
-  for za in range(1, p):
-    for zb in range(1, p):
+  for za in xrange(1, p):
+    for zb in xrange(1, p):
       for pa in points:
         for pb in points:
-          for ia in range(2):
-            for ib in range(2):
+          for ia in xrange(2):
+            for ib in xrange(2):
               pA = jacobianpoint(pa.x * F(za)^2, pa.y * F(za)^3, F(za), ia)
               pB = jacobianpoint(pb.x * F(zb)^2, pb.y * F(zb)^3, F(zb), ib)
-              for branch in range(0, branches):
+              for branch in xrange(0, branches):
                 assumeAssert, assumeBranch, pC = formula(branch, pA, pB)
                 pC.X = F(pC.X)
                 pC.Y = F(pC.Y)
@@ -207,16 +206,13 @@ def check_exhaustive_jacobian_weierstrass(name, A, B, branches, formula, p):
                     r, e = concrete_verify(assumeLaw)
                     if r:
                       if match:
-                        print("  multiple branches for (%s,%s,%s,%s) + (%s,%s,%s,%s)" % (pA.X, pA.Y, pA.Z, pA.Infinity, pB.X, pB.Y, pB.Z, pB.Infinity))
+                        print "  multiple branches for (%s,%s,%s,%s) + (%s,%s,%s,%s)" % (pA.X, pA.Y, pA.Z, pA.Infinity, pB.X, pB.Y, pB.Z, pB.Infinity)
                       else:
                         match = True
                       r, e = concrete_verify(require)
                       if not r:
-                        ret = False
-                        print("  failure in branch %i for (%s,%s,%s,%s) + (%s,%s,%s,%s) = (%s,%s,%s,%s): %s" % (branch, pA.X, pA.Y, pA.Z, pA.Infinity, pB.X, pB.Y, pB.Z, pB.Infinity, pC.X, pC.Y, pC.Z, pC.Infinity, e))
-
-  print()
-  return ret
+                        print "  failure in branch %i for (%s,%s,%s,%s) + (%s,%s,%s,%s) = (%s,%s,%s,%s): %s" % (branch, pA.X, pA.Y, pA.Z, pA.Infinity, pB.X, pB.Y, pB.Z, pB.Infinity, pC.X, pC.Y, pC.Z, pC.Infinity, e)
+  print
 
 
 def check_symbolic_function(R, assumeAssert, assumeBranch, f, A, B, pa, pb, pA, pB, pC):
@@ -246,30 +242,23 @@ def check_symbolic_jacobian_weierstrass(name, A, B, branches, formula):
   for key in laws_jacobian_weierstrass:
     res[key] = []
 
-  print("Formula " + name + ":")
+  print ("Formula " + name + ":")
   count = 0
-  ret = True
-  for branch in range(branches):
+  for branch in xrange(branches):
     assumeFormula, assumeBranch, pC = formula(branch, pA, pB)
-    assumeBranch = assumeBranch.map(lift)
-    assumeFormula = assumeFormula.map(lift)
     pC.X = lift(pC.X)
     pC.Y = lift(pC.Y)
     pC.Z = lift(pC.Z)
     pC.Infinity = lift(pC.Infinity)
 
     for key in laws_jacobian_weierstrass:
-      success, msg = check_symbolic_function(R, assumeFormula, assumeBranch, laws_jacobian_weierstrass[key], A, B, pa, pb, pA, pB, pC)
-      if not success:
-        ret = False
-      res[key].append((msg, branch))
+      res[key].append((check_symbolic_function(R, assumeFormula, assumeBranch, laws_jacobian_weierstrass[key], A, B, pa, pb, pA, pB, pC), branch))
 
   for key in res:
-    print("  %s:" % key)
+    print "  %s:" % key
     val = res[key]
     for x in val:
       if x[0] is not None:
-        print("    branch %i: %s" % (x[1], x[0]))
+        print "    branch %i: %s" % (x[1], x[0])
 
-  print()
-  return ret
+  print

src/CMakeLists.txt

@@ -1,198 +0,0 @@
-# Must be included before CMAKE_INSTALL_INCLUDEDIR is used.
-include(GNUInstallDirs)
-
-add_library(secp256k1_precomputed OBJECT EXCLUDE_FROM_ALL
-  precomputed_ecmult.c
-  precomputed_ecmult_gen.c
-)
-
-# Add objects explicitly rather than linking to the object libs to keep them
-# from being exported.
-add_library(secp256k1 secp256k1.c $<TARGET_OBJECTS:secp256k1_precomputed>)
-
-add_library(secp256k1_asm INTERFACE)
-if(SECP256K1_ASM STREQUAL "arm32")
-  add_library(secp256k1_asm_arm OBJECT EXCLUDE_FROM_ALL)
-  target_sources(secp256k1_asm_arm PUBLIC
-    asm/field_10x26_arm.s
-  )
-  target_sources(secp256k1 PRIVATE $<TARGET_OBJECTS:secp256k1_asm_arm>)
-  target_link_libraries(secp256k1_asm INTERFACE secp256k1_asm_arm)
-endif()
-
-if(WIN32)
-  # Define our export symbol only for shared libs.
-  set_target_properties(secp256k1 PROPERTIES DEFINE_SYMBOL SECP256K1_DLL_EXPORT)
-  target_compile_definitions(secp256k1 INTERFACE $<$<NOT:$<BOOL:${BUILD_SHARED_LIBS}>>:SECP256K1_STATIC>)
-endif()
-
-# Object libs don't know if they're being built for a shared or static lib.
-# Grab the PIC property from secp256k1 which knows.
-get_target_property(use_pic secp256k1 POSITION_INDEPENDENT_CODE)
-set_target_properties(secp256k1_precomputed PROPERTIES POSITION_INDEPENDENT_CODE ${use_pic})
-
-target_include_directories(secp256k1 INTERFACE
-  # Add the include path for parent projects so that they don't have to manually add it.
-  $<BUILD_INTERFACE:$<$<NOT:$<BOOL:${PROJECT_IS_TOP_LEVEL}>>:${PROJECT_SOURCE_DIR}/include>>
-  $<INSTALL_INTERFACE:${CMAKE_INSTALL_INCLUDEDIR}>
-)
-
-# This emulates Libtool to make sure Libtool and CMake agree on the ABI version,
-# see below "Calculate the version variables" in build-aux/ltmain.sh.
-math(EXPR ${PROJECT_NAME}_soversion "${${PROJECT_NAME}_LIB_VERSION_CURRENT} - ${${PROJECT_NAME}_LIB_VERSION_AGE}")
-set_target_properties(secp256k1 PROPERTIES
-  SOVERSION ${${PROJECT_NAME}_soversion}
-)
-if(CMAKE_SYSTEM_NAME STREQUAL "Linux")
-  set_target_properties(secp256k1 PROPERTIES
-    VERSION ${${PROJECT_NAME}_soversion}.${${PROJECT_NAME}_LIB_VERSION_AGE}.${${PROJECT_NAME}_LIB_VERSION_REVISION}
-  )
-elseif(APPLE)
-  if(CMAKE_VERSION VERSION_GREATER_EQUAL 3.17)
-    math(EXPR ${PROJECT_NAME}_compatibility_version "${${PROJECT_NAME}_LIB_VERSION_CURRENT} + 1")
-    set_target_properties(secp256k1 PROPERTIES
-      MACHO_COMPATIBILITY_VERSION ${${PROJECT_NAME}_compatibility_version}
-      MACHO_CURRENT_VERSION ${${PROJECT_NAME}_compatibility_version}.${${PROJECT_NAME}_LIB_VERSION_REVISION}
-    )
-    unset(${PROJECT_NAME}_compatibility_version)
-  elseif(BUILD_SHARED_LIBS)
-    message(WARNING
-      "The 'compatibility version' and 'current version' values of the DYLIB "
-      "will diverge from the values set by the GNU Libtool. To ensure "
-      "compatibility, it is recommended to upgrade CMake to at least version 3.17."
-    )
-  endif()
-elseif(CMAKE_SYSTEM_NAME STREQUAL "Windows")
-  set(${PROJECT_NAME}_windows "secp256k1")
-  if(MSVC)
-    set(${PROJECT_NAME}_windows "${PROJECT_NAME}")
-  endif()
-  set_target_properties(secp256k1 PROPERTIES
-    ARCHIVE_OUTPUT_NAME "${${PROJECT_NAME}_windows}"
-    RUNTIME_OUTPUT_NAME "${${PROJECT_NAME}_windows}-${${PROJECT_NAME}_soversion}"
-  )
-  unset(${PROJECT_NAME}_windows)
-endif()
-unset(${PROJECT_NAME}_soversion)
-
-if(SECP256K1_BUILD_BENCHMARK)
-  add_executable(bench bench.c)
-  target_link_libraries(bench secp256k1)
-  add_executable(bench_internal bench_internal.c)
-  target_link_libraries(bench_internal secp256k1_precomputed secp256k1_asm)
-  add_executable(bench_ecmult bench_ecmult.c)
-  target_link_libraries(bench_ecmult secp256k1_precomputed secp256k1_asm)
-endif()
-
-if(SECP256K1_BUILD_TESTS)
-  add_executable(noverify_tests tests.c)
-  target_link_libraries(noverify_tests secp256k1_precomputed secp256k1_asm)
-  add_test(NAME noverify_tests COMMAND noverify_tests)
-  if(NOT CMAKE_BUILD_TYPE STREQUAL "Coverage")
-    add_executable(tests tests.c)
-    target_compile_definitions(tests PRIVATE VERIFY)
-    target_link_libraries(tests secp256k1_precomputed secp256k1_asm)
-    add_test(NAME tests COMMAND tests)
-  endif()
-endif()
-
-if(SECP256K1_BUILD_EXHAUSTIVE_TESTS)
-  # Note: do not include secp256k1_precomputed in exhaustive_tests (it uses runtime-generated tables).
-  add_executable(exhaustive_tests tests_exhaustive.c)
-  target_link_libraries(exhaustive_tests secp256k1_asm)
-  target_compile_definitions(exhaustive_tests PRIVATE $<$<NOT:$<CONFIG:Coverage>>:VERIFY>)
-  add_test(NAME exhaustive_tests COMMAND exhaustive_tests)
-endif()
-
-if(SECP256K1_BUILD_CTIME_TESTS)
-  add_executable(ctime_tests ctime_tests.c)
-  target_link_libraries(ctime_tests secp256k1)
-endif()
-
-if(SECP256K1_INSTALL)
-  install(TARGETS secp256k1
-    EXPORT ${PROJECT_NAME}-targets
-    RUNTIME DESTINATION ${CMAKE_INSTALL_BINDIR}
-    LIBRARY DESTINATION ${CMAKE_INSTALL_LIBDIR}
-    ARCHIVE DESTINATION ${CMAKE_INSTALL_LIBDIR}
-  )
-  set(${PROJECT_NAME}_headers
-    "${PROJECT_SOURCE_DIR}/include/secp256k1.h"
-    "${PROJECT_SOURCE_DIR}/include/secp256k1_preallocated.h"
-  )
-  if(SECP256K1_ENABLE_MODULE_BPPP)
-    list(APPEND ${PROJECT_NAME}_headers "${PROJECT_SOURCE_DIR}/include/secp256k1_bppp.h")
-  endif()
-  if(SECP256K1_ENABLE_MODULE_ECDSA_S2C)
-    list(APPEND ${PROJECT_NAME}_headers "${PROJECT_SOURCE_DIR}/include/secp256k1_ecdsa_s2c.h")
-  endif()
-  if(SECP256K1_ENABLE_MODULE_ECDSA_ADAPTOR)
-    list(APPEND ${PROJECT_NAME}_headers "${PROJECT_SOURCE_DIR}/include/secp256k1_ecdsa_adaptor.h")
-  endif()
-  if(SECP256K1_ENABLE_MODULE_MUSIG)
-    list(APPEND ${PROJECT_NAME}_headers "${PROJECT_SOURCE_DIR}/include/secp256k1_musig.h")
-  endif()
-  if(SECP256K1_ENABLE_MODULE_WHITELIST)
-    list(APPEND ${PROJECT_NAME}_headers "${PROJECT_SOURCE_DIR}/include/secp256k1_whitelist.h")
-  endif()
-  if(SECP256K1_ENABLE_MODULE_SURJECTIONPROOF)
-    list(APPEND ${PROJECT_NAME}_headers "${PROJECT_SOURCE_DIR}/include/secp256k1_surjectionproof.h")
-  endif()
-  if(SECP256K1_ENABLE_MODULE_RANGEPROOF)
-    list(APPEND ${PROJECT_NAME}_headers "${PROJECT_SOURCE_DIR}/include/secp256k1_rangeproof.h")
-  endif()
-  if(SECP256K1_ENABLE_MODULE_GENERATOR)
-    list(APPEND ${PROJECT_NAME}_headers "${PROJECT_SOURCE_DIR}/include/secp256k1_generator.h")
-  endif()
-
-  if(SECP256K1_ENABLE_MODULE_ECDH)
-    list(APPEND ${PROJECT_NAME}_headers "${PROJECT_SOURCE_DIR}/include/secp256k1_ecdh.h")
-  endif()
-  if(SECP256K1_ENABLE_MODULE_RECOVERY)
-    list(APPEND ${PROJECT_NAME}_headers "${PROJECT_SOURCE_DIR}/include/secp256k1_recovery.h")
-  endif()
-  if(SECP256K1_ENABLE_MODULE_EXTRAKEYS)
-    list(APPEND ${PROJECT_NAME}_headers "${PROJECT_SOURCE_DIR}/include/secp256k1_extrakeys.h")
-  endif()
-  if(SECP256K1_ENABLE_MODULE_SCHNORRSIG)
-    list(APPEND ${PROJECT_NAME}_headers "${PROJECT_SOURCE_DIR}/include/secp256k1_schnorrsig.h")
-  endif()
-  if(SECP256K1_ENABLE_MODULE_ELLSWIFT)
-    list(APPEND ${PROJECT_NAME}_headers "${PROJECT_SOURCE_DIR}/include/secp256k1_ellswift.h")
-  endif()
-  install(FILES ${${PROJECT_NAME}_headers}
-    DESTINATION ${CMAKE_INSTALL_INCLUDEDIR}
-  )
-
-  install(EXPORT ${PROJECT_NAME}-targets
-    FILE ${PROJECT_NAME}-targets.cmake
-    NAMESPACE ${PROJECT_NAME}::
-    DESTINATION ${CMAKE_INSTALL_LIBDIR}/cmake/${PROJECT_NAME}
-  )
-
-  include(CMakePackageConfigHelpers)
-  configure_package_config_file(
-    ${PROJECT_SOURCE_DIR}/cmake/config.cmake.in
-    ${PROJECT_NAME}-config.cmake
-    INSTALL_DESTINATION ${CMAKE_INSTALL_LIBDIR}/cmake/${PROJECT_NAME}
-    NO_SET_AND_CHECK_MACRO
-  )
-  write_basic_package_version_file(${PROJECT_NAME}-config-version.cmake
-    COMPATIBILITY SameMinorVersion
-  )
-
-  install(
-    FILES
-      ${CMAKE_CURRENT_BINARY_DIR}/${PROJECT_NAME}-config.cmake
-      ${CMAKE_CURRENT_BINARY_DIR}/${PROJECT_NAME}-config-version.cmake
-    DESTINATION ${CMAKE_INSTALL_LIBDIR}/cmake/${PROJECT_NAME}
-  )
-
-  include(GeneratePkgConfigFile)
-  generate_pkg_config_file(${PROJECT_SOURCE_DIR}/libsecp256k1.pc.in)
-  install(
-    FILES
-      ${CMAKE_CURRENT_BINARY_DIR}/${PROJECT_NAME}.pc
-    DESTINATION ${CMAKE_INSTALL_LIBDIR}/pkgconfig
-  )
-endif()

src/asm/field_10x26_arm.s

@@ -1,9 +1,9 @@
 @ vim: set tabstop=8 softtabstop=8 shiftwidth=8 noexpandtab syntax=armasm:
-/***********************************************************************
- * Copyright (c) 2014 Wladimir J. van der Laan                         *
- * Distributed under the MIT software license, see the accompanying    *
- * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
- ***********************************************************************/
+/**********************************************************************
+ * Copyright (c) 2014 Wladimir J. van der Laan                        *
+ * Distributed under the MIT software license, see the accompanying   *
+ * file COPYING or http://www.opensource.org/licenses/mit-license.php.*
+ **********************************************************************/
 /*
 ARM implementation of field_10x26 inner loops.
 
@@ -11,14 +11,20 @@ Note:
 
 - To avoid unnecessary loads and make use of available registers, two
   'passes' have every time been interleaved, with the odd passes accumulating c' and d' 
-  which will be added to c and d respectively in the even passes
+  which will be added to c and d respectively in the the even passes
 
 */
 
 	.syntax unified
+	.arch armv7-a
 	@ eabi attributes - see readelf -A
+	.eabi_attribute 8, 1  @ Tag_ARM_ISA_use = yes
+	.eabi_attribute 9, 0  @ Tag_Thumb_ISA_use = no
+	.eabi_attribute 10, 0 @ Tag_FP_arch = none
 	.eabi_attribute 24, 1 @ Tag_ABI_align_needed = 8-byte
 	.eabi_attribute 25, 1 @ Tag_ABI_align_preserved = 8-byte, except leaf SP
+	.eabi_attribute 30, 2 @ Tag_ABI_optimization_goals = Agressive Speed
+	.eabi_attribute 34, 1 @ Tag_CPU_unaligned_access = v6
 	.text
 
 	@ Field constants
@@ -29,7 +35,6 @@ Note:
 	.align	2
 	.global secp256k1_fe_mul_inner
 	.type	secp256k1_fe_mul_inner, %function
-	.hidden secp256k1_fe_mul_inner
 	@ Arguments:
 	@  r0  r      Restrict: can overlap with a, not with b
 	@  r1  a
@@ -517,7 +522,6 @@ secp256k1_fe_mul_inner:
 	.align	2
 	.global secp256k1_fe_sqr_inner
 	.type	secp256k1_fe_sqr_inner, %function
-	.hidden secp256k1_fe_sqr_inner
 	@ Arguments:
 	@  r0  r	 Can overlap with a
 	@  r1  a
@@ -913,4 +917,3 @@ secp256k1_fe_sqr_inner:
 	ldmfd	sp!, {r4, r5, r6, r7, r8, r9, r10, r11, pc}
 	.size	secp256k1_fe_sqr_inner, .-secp256k1_fe_sqr_inner
 
-	.section .note.GNU-stack,"",%progbits

src/assumptions.h

@@ -1,87 +0,0 @@
-/***********************************************************************
- * Copyright (c) 2020 Pieter Wuille                                    *
- * Distributed under the MIT software license, see the accompanying    *
- * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
- ***********************************************************************/
-
-#ifndef SECP256K1_ASSUMPTIONS_H
-#define SECP256K1_ASSUMPTIONS_H
-
-#include <limits.h>
-
-#include "util.h"
-#if defined(SECP256K1_INT128_NATIVE)
-#include "int128_native.h"
-#endif
-
-/* This library, like most software, relies on a number of compiler implementation defined (but not undefined)
-   behaviours. Although the behaviours we require are essentially universal we test them specifically here to
-   reduce the odds of experiencing an unwelcome surprise.
-*/
-
-#if defined(__has_attribute)
-# if __has_attribute(__unavailable__)
-__attribute__((__unavailable__("Don't call this function. It only exists because STATIC_ASSERT cannot be used outside a function.")))
-# endif
-#endif
-static void secp256k1_assumption_checker(void) {
-    /* Bytes are 8 bits. */
-    STATIC_ASSERT(CHAR_BIT == 8);
-
-    /* No integer promotion for uint32_t. This ensures that we can multiply uintXX_t values where XX >= 32
-       without signed overflow, which would be undefined behaviour. */
-    STATIC_ASSERT(UINT_MAX <= UINT32_MAX);
-
-    /* Conversions from unsigned to signed outside of the bounds of the signed type are
-       implementation-defined. Verify that they function as reinterpreting the lower
-       bits of the input in two's complement notation. Do this for conversions:
-       - from uint(N)_t to int(N)_t with negative result
-       - from uint(2N)_t to int(N)_t with negative result
-       - from int(2N)_t to int(N)_t with negative result
-       - from int(2N)_t to int(N)_t with positive result */
-
-    /* To int8_t. */
-    STATIC_ASSERT(((int8_t)(uint8_t)0xAB == (int8_t)-(int8_t)0x55));
-    STATIC_ASSERT((int8_t)(uint16_t)0xABCD == (int8_t)-(int8_t)0x33);
-    STATIC_ASSERT((int8_t)(int16_t)(uint16_t)0xCDEF == (int8_t)(uint8_t)0xEF);
-    STATIC_ASSERT((int8_t)(int16_t)(uint16_t)0x9234 == (int8_t)(uint8_t)0x34);
-
-    /* To int16_t. */
-    STATIC_ASSERT((int16_t)(uint16_t)0xBCDE == (int16_t)-(int16_t)0x4322);
-    STATIC_ASSERT((int16_t)(uint32_t)0xA1B2C3D4 == (int16_t)-(int16_t)0x3C2C);
-    STATIC_ASSERT((int16_t)(int32_t)(uint32_t)0xC1D2E3F4 == (int16_t)(uint16_t)0xE3F4);
-    STATIC_ASSERT((int16_t)(int32_t)(uint32_t)0x92345678 == (int16_t)(uint16_t)0x5678);
-
-    /* To int32_t. */
-    STATIC_ASSERT((int32_t)(uint32_t)0xB2C3D4E5 == (int32_t)-(int32_t)0x4D3C2B1B);
-    STATIC_ASSERT((int32_t)(uint64_t)0xA123B456C789D012ULL == (int32_t)-(int32_t)0x38762FEE);
-    STATIC_ASSERT((int32_t)(int64_t)(uint64_t)0xC1D2E3F4A5B6C7D8ULL == (int32_t)(uint32_t)0xA5B6C7D8);
-    STATIC_ASSERT((int32_t)(int64_t)(uint64_t)0xABCDEF0123456789ULL == (int32_t)(uint32_t)0x23456789);
-
-    /* To int64_t. */
-    STATIC_ASSERT((int64_t)(uint64_t)0xB123C456D789E012ULL == (int64_t)-(int64_t)0x4EDC3BA928761FEEULL);
-#if defined(SECP256K1_INT128_NATIVE)
-    STATIC_ASSERT((int64_t)(((uint128_t)0xA1234567B8901234ULL << 64) + 0xC5678901D2345678ULL) == (int64_t)-(int64_t)0x3A9876FE2DCBA988ULL);
-    STATIC_ASSERT(((int64_t)(int128_t)(((uint128_t)0xB1C2D3E4F5A6B7C8ULL << 64) + 0xD9E0F1A2B3C4D5E6ULL)) == (int64_t)(uint64_t)0xD9E0F1A2B3C4D5E6ULL);
-    STATIC_ASSERT(((int64_t)(int128_t)(((uint128_t)0xABCDEF0123456789ULL << 64) + 0x0123456789ABCDEFULL)) == (int64_t)(uint64_t)0x0123456789ABCDEFULL);
-
-    /* To int128_t. */
-    STATIC_ASSERT((int128_t)(((uint128_t)0xB1234567C8901234ULL << 64) + 0xD5678901E2345678ULL) == (int128_t)(-(int128_t)0x8E1648B3F50E80DCULL * 0x8E1648B3F50E80DDULL + 0x5EA688D5482F9464ULL));
-#endif
-
-    /* Right shift on negative signed values is implementation defined. Verify that it
-       acts as a right shift in two's complement with sign extension (i.e duplicating
-       the top bit into newly added bits). */
-    STATIC_ASSERT((((int8_t)0xE8) >> 2) == (int8_t)(uint8_t)0xFA);
-    STATIC_ASSERT((((int16_t)0xE9AC) >> 4) == (int16_t)(uint16_t)0xFE9A);
-    STATIC_ASSERT((((int32_t)0x937C918A) >> 9) == (int32_t)(uint32_t)0xFFC9BE48);
-    STATIC_ASSERT((((int64_t)0xA8B72231DF9CF4B9ULL) >> 19) == (int64_t)(uint64_t)0xFFFFF516E4463BF3ULL);
-#if defined(SECP256K1_INT128_NATIVE)
-    STATIC_ASSERT((((int128_t)(((uint128_t)0xCD833A65684A0DBCULL << 64) + 0xB349312F71EA7637ULL)) >> 39) == (int128_t)(((uint128_t)0xFFFFFFFFFF9B0674ULL << 64) + 0xCAD0941B79669262ULL));
-#endif
-
-    /* This function is not supposed to be called. */
-    VERIFY_CHECK(0);
-}
-
-#endif /* SECP256K1_ASSUMPTIONS_H */

src/basic-config.h

@@ -0,0 +1,32 @@
+/**********************************************************************
+ * Copyright (c) 2013, 2014 Pieter Wuille                             *
+ * Distributed under the MIT software license, see the accompanying   *
+ * file COPYING or http://www.opensource.org/licenses/mit-license.php.*
+ **********************************************************************/
+
+#ifndef _SECP256K1_BASIC_CONFIG_
+#define _SECP256K1_BASIC_CONFIG_
+
+#ifdef USE_BASIC_CONFIG
+
+#undef USE_ASM_X86_64
+#undef USE_ENDOMORPHISM
+#undef USE_FIELD_10X26
+#undef USE_FIELD_5X52
+#undef USE_FIELD_INV_BUILTIN
+#undef USE_FIELD_INV_NUM
+#undef USE_NUM_GMP
+#undef USE_NUM_NONE
+#undef USE_SCALAR_4X64
+#undef USE_SCALAR_8X32
+#undef USE_SCALAR_INV_BUILTIN
+#undef USE_SCALAR_INV_NUM
+
+#define USE_NUM_NONE 1
+#define USE_FIELD_INV_BUILTIN 1
+#define USE_SCALAR_INV_BUILTIN 1
+#define USE_FIELD_10X26 1
+#define USE_SCALAR_8X32 1
+
+#endif // USE_BASIC_CONFIG
+#endif // _SECP256K1_BASIC_CONFIG_

src/bench.c

@@ -1,279 +0,0 @@
-/***********************************************************************
- * Copyright (c) 2014 Pieter Wuille                                    *
- * Distributed under the MIT software license, see the accompanying    *
- * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
- ***********************************************************************/
-
-#include <stdio.h>
-#include <string.h>
-
-#include "../include/secp256k1.h"
-#include "util.h"
-#include "bench.h"
-
-static void help(int default_iters) {
-    printf("Benchmarks the following algorithms:\n");
-    printf("    - ECDSA signing/verification\n");
-
-#ifdef ENABLE_MODULE_ECDH
-    printf("    - ECDH key exchange (optional module)\n");
-#endif
-
-#ifdef ENABLE_MODULE_RECOVERY
-    printf("    - Public key recovery (optional module)\n");
-#endif
-
-#ifdef ENABLE_MODULE_SCHNORRSIG
-    printf("    - Schnorr signatures (optional module)\n");
-#endif
-
-    printf("\n");
-    printf("The default number of iterations for each benchmark is %d. This can be\n", default_iters);
-    printf("customized using the SECP256K1_BENCH_ITERS environment variable.\n");
-    printf("\n");
-    printf("Usage: ./bench [args]\n");
-    printf("By default, all benchmarks will be run.\n");
-    printf("args:\n");
-    printf("    help              : display this help and exit\n");
-    printf("    ecdsa             : all ECDSA algorithms--sign, verify, recovery (if enabled)\n");
-    printf("    ecdsa_sign        : ECDSA siging algorithm\n");
-    printf("    ecdsa_verify      : ECDSA verification algorithm\n");
-    printf("    ec                : all EC public key algorithms (keygen)\n");
-    printf("    ec_keygen         : EC public key generation\n");
-
-#ifdef ENABLE_MODULE_RECOVERY
-    printf("    ecdsa_recover     : ECDSA public key recovery algorithm\n");
-#endif
-
-#ifdef ENABLE_MODULE_ECDH
-    printf("    ecdh              : ECDH key exchange algorithm\n");
-#endif
-
-#ifdef ENABLE_MODULE_SCHNORRSIG
-    printf("    schnorrsig        : all Schnorr signature algorithms (sign, verify)\n");
-    printf("    schnorrsig_sign   : Schnorr sigining algorithm\n");
-    printf("    schnorrsig_verify : Schnorr verification algorithm\n");
-#endif
-
-#ifdef ENABLE_MODULE_ELLSWIFT
-    printf("    ellswift          : all ElligatorSwift benchmarks (encode, decode, keygen, ecdh)\n");
-    printf("    ellswift_encode   : ElligatorSwift encoding\n");
-    printf("    ellswift_decode   : ElligatorSwift decoding\n");
-    printf("    ellswift_keygen   : ElligatorSwift key generation\n");
-    printf("    ellswift_ecdh     : ECDH on ElligatorSwift keys\n");
-#endif
-
-    printf("\n");
-}
-
-typedef struct {
-    secp256k1_context *ctx;
-    unsigned char msg[32];
-    unsigned char key[32];
-    unsigned char sig[72];
-    size_t siglen;
-    unsigned char pubkey[33];
-    size_t pubkeylen;
-} bench_data;
-
-static void bench_verify(void* arg, int iters) {
-    int i;
-    bench_data* data = (bench_data*)arg;
-
-    for (i = 0; i < iters; i++) {
-        secp256k1_pubkey pubkey;
-        secp256k1_ecdsa_signature sig;
-        data->sig[data->siglen - 1] ^= (i & 0xFF);
-        data->sig[data->siglen - 2] ^= ((i >> 8) & 0xFF);
-        data->sig[data->siglen - 3] ^= ((i >> 16) & 0xFF);
-        CHECK(secp256k1_ec_pubkey_parse(data->ctx, &pubkey, data->pubkey, data->pubkeylen) == 1);
-        CHECK(secp256k1_ecdsa_signature_parse_der(data->ctx, &sig, data->sig, data->siglen) == 1);
-        CHECK(secp256k1_ecdsa_verify(data->ctx, &sig, data->msg, &pubkey) == (i == 0));
-        data->sig[data->siglen - 1] ^= (i & 0xFF);
-        data->sig[data->siglen - 2] ^= ((i >> 8) & 0xFF);
-        data->sig[data->siglen - 3] ^= ((i >> 16) & 0xFF);
-    }
-}
-
-static void bench_sign_setup(void* arg) {
-    int i;
-    bench_data *data = (bench_data*)arg;
-
-    for (i = 0; i < 32; i++) {
-        data->msg[i] = i + 1;
-    }
-    for (i = 0; i < 32; i++) {
-        data->key[i] = i + 65;
-    }
-}
-
-static void bench_sign_run(void* arg, int iters) {
-    int i;
-    bench_data *data = (bench_data*)arg;
-
-    unsigned char sig[74];
-    for (i = 0; i < iters; i++) {
-        size_t siglen = 74;
-        int j;
-        secp256k1_ecdsa_signature signature;
-        CHECK(secp256k1_ecdsa_sign(data->ctx, &signature, data->msg, data->key, NULL, NULL));
-        CHECK(secp256k1_ecdsa_signature_serialize_der(data->ctx, sig, &siglen, &signature));
-        for (j = 0; j < 32; j++) {
-            data->msg[j] = sig[j];
-            data->key[j] = sig[j + 32];
-        }
-    }
-}
-
-static void bench_keygen_setup(void* arg) {
-    int i;
-    bench_data *data = (bench_data*)arg;
-
-    for (i = 0; i < 32; i++) {
-        data->key[i] = i + 65;
-    }
-}
-
-static void bench_keygen_run(void *arg, int iters) {
-    int i;
-    bench_data *data = (bench_data*)arg;
-
-    for (i = 0; i < iters; i++) {
-        unsigned char pub33[33];
-        size_t len = 33;
-        secp256k1_pubkey pubkey;
-        CHECK(secp256k1_ec_pubkey_create(data->ctx, &pubkey, data->key));
-        CHECK(secp256k1_ec_pubkey_serialize(data->ctx, pub33, &len, &pubkey, SECP256K1_EC_COMPRESSED));
-        memcpy(data->key, pub33 + 1, 32);
-    }
-}
-
-
-#ifdef ENABLE_MODULE_ECDH
-# include "modules/ecdh/bench_impl.h"
-#endif
-
-#ifdef ENABLE_MODULE_RECOVERY
-# include "modules/recovery/bench_impl.h"
-#endif
-
-#ifdef ENABLE_MODULE_SCHNORRSIG
-# include "modules/schnorrsig/bench_impl.h"
-#endif
-
-#ifdef ENABLE_MODULE_ELLSWIFT
-# include "modules/ellswift/bench_impl.h"
-#endif
-
-int main(int argc, char** argv) {
-    int i;
-    secp256k1_pubkey pubkey;
-    secp256k1_ecdsa_signature sig;
-    bench_data data;
-
-    int d = argc == 1;
-    int default_iters = 20000;
-    int iters = get_iters(default_iters);
-
-    /* Check for invalid user arguments */
-    char* valid_args[] = {"ecdsa", "verify", "ecdsa_verify", "sign", "ecdsa_sign", "ecdh", "recover",
-                         "ecdsa_recover", "schnorrsig", "schnorrsig_verify", "schnorrsig_sign", "ec",
-                         "keygen", "ec_keygen", "ellswift", "encode", "ellswift_encode", "decode",
-                         "ellswift_decode", "ellswift_keygen", "ellswift_ecdh"};
-    size_t valid_args_size = sizeof(valid_args)/sizeof(valid_args[0]);
-    int invalid_args = have_invalid_args(argc, argv, valid_args, valid_args_size);
-
-    if (argc > 1) {
-        if (have_flag(argc, argv, "-h")
-           || have_flag(argc, argv, "--help")
-           || have_flag(argc, argv, "help")) {
-            help(default_iters);
-            return 0;
-        } else if (invalid_args) {
-            fprintf(stderr, "./bench: unrecognized argument.\n\n");
-            help(default_iters);
-            return 1;
-        }
-    }
-
-/* Check if the user tries to benchmark optional module without building it */
-#ifndef ENABLE_MODULE_ECDH
-    if (have_flag(argc, argv, "ecdh")) {
-        fprintf(stderr, "./bench: ECDH module not enabled.\n");
-        fprintf(stderr, "Use ./configure --enable-module-ecdh.\n\n");
-        return 1;
-    }
-#endif
-
-#ifndef ENABLE_MODULE_RECOVERY
-    if (have_flag(argc, argv, "recover") || have_flag(argc, argv, "ecdsa_recover")) {
-        fprintf(stderr, "./bench: Public key recovery module not enabled.\n");
-        fprintf(stderr, "Use ./configure --enable-module-recovery.\n\n");
-        return 1;
-    }
-#endif
-
-#ifndef ENABLE_MODULE_SCHNORRSIG
-    if (have_flag(argc, argv, "schnorrsig") || have_flag(argc, argv, "schnorrsig_sign") || have_flag(argc, argv, "schnorrsig_verify")) {
-        fprintf(stderr, "./bench: Schnorr signatures module not enabled.\n");
-        fprintf(stderr, "Use ./configure --enable-module-schnorrsig.\n\n");
-        return 1;
-    }
-#endif
-
-#ifndef ENABLE_MODULE_ELLSWIFT
-    if (have_flag(argc, argv, "ellswift") || have_flag(argc, argv, "ellswift_encode") || have_flag(argc, argv, "ellswift_decode") ||
-        have_flag(argc, argv, "encode") || have_flag(argc, argv, "decode") || have_flag(argc, argv, "ellswift_keygen") ||
-        have_flag(argc, argv, "ellswift_ecdh")) {
-        fprintf(stderr, "./bench: ElligatorSwift module not enabled.\n");
-        fprintf(stderr, "Use ./configure --enable-module-ellswift.\n\n");
-        return 1;
-    }
-#endif
-
-    /* ECDSA benchmark */
-    data.ctx = secp256k1_context_create(SECP256K1_CONTEXT_NONE);
-
-    for (i = 0; i < 32; i++) {
-        data.msg[i] = 1 + i;
-    }
-    for (i = 0; i < 32; i++) {
-        data.key[i] = 33 + i;
-    }
-    data.siglen = 72;
-    CHECK(secp256k1_ecdsa_sign(data.ctx, &sig, data.msg, data.key, NULL, NULL));
-    CHECK(secp256k1_ecdsa_signature_serialize_der(data.ctx, data.sig, &data.siglen, &sig));
-    CHECK(secp256k1_ec_pubkey_create(data.ctx, &pubkey, data.key));
-    data.pubkeylen = 33;
-    CHECK(secp256k1_ec_pubkey_serialize(data.ctx, data.pubkey, &data.pubkeylen, &pubkey, SECP256K1_EC_COMPRESSED) == 1);
-
-    print_output_table_header_row();
-    if (d || have_flag(argc, argv, "ecdsa") || have_flag(argc, argv, "verify") || have_flag(argc, argv, "ecdsa_verify")) run_benchmark("ecdsa_verify", bench_verify, NULL, NULL, &data, 10, iters);
-
-    if (d || have_flag(argc, argv, "ecdsa") || have_flag(argc, argv, "sign") || have_flag(argc, argv, "ecdsa_sign")) run_benchmark("ecdsa_sign", bench_sign_run, bench_sign_setup, NULL, &data, 10, iters);
-    if (d || have_flag(argc, argv, "ec") || have_flag(argc, argv, "keygen") || have_flag(argc, argv, "ec_keygen")) run_benchmark("ec_keygen", bench_keygen_run, bench_keygen_setup, NULL, &data, 10, iters);
-
-    secp256k1_context_destroy(data.ctx);
-
-#ifdef ENABLE_MODULE_ECDH
-    /* ECDH benchmarks */
-    run_ecdh_bench(iters, argc, argv);
-#endif
-
-#ifdef ENABLE_MODULE_RECOVERY
-    /* ECDSA recovery benchmarks */
-    run_recovery_bench(iters, argc, argv);
-#endif
-
-#ifdef ENABLE_MODULE_SCHNORRSIG
-    /* Schnorr signature benchmarks */
-    run_schnorrsig_bench(iters, argc, argv);
-#endif
-
-#ifdef ENABLE_MODULE_ELLSWIFT
-    /* ElligatorSwift benchmarks */
-    run_ellswift_bench(iters, argc, argv);
-#endif
-
-    return 0;
-}

src/bench.h

@@ -1,115 +1,50 @@
-/***********************************************************************
- * Copyright (c) 2014 Pieter Wuille                                    *
- * Distributed under the MIT software license, see the accompanying    *
- * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
- ***********************************************************************/
+/**********************************************************************
+ * Copyright (c) 2014 Pieter Wuille                                   *
+ * Distributed under the MIT software license, see the accompanying   *
+ * file COPYING or http://www.opensource.org/licenses/mit-license.php.*
+ **********************************************************************/
 
-#ifndef SECP256K1_BENCH_H
-#define SECP256K1_BENCH_H
+#ifndef _SECP256K1_BENCH_H_
+#define _SECP256K1_BENCH_H_
 
-#include <stdlib.h>
-#include <stdint.h>
 #include <stdio.h>
-#include <string.h>
+#include <math.h>
+#include "sys/time.h"
 
-#if (defined(_MSC_VER) && _MSC_VER >= 1900)
-#  include <time.h>
-#else
-#  include <sys/time.h>
-#endif
-
-static int64_t gettime_i64(void) {
-#if (defined(_MSC_VER) && _MSC_VER >= 1900)
-    /* C11 way to get wallclock time */
-    struct timespec tv;
-    if (!timespec_get(&tv, TIME_UTC)) {
-        fputs("timespec_get failed!", stderr);
-        exit(1);
-    }
-    return (int64_t)tv.tv_nsec / 1000 + (int64_t)tv.tv_sec * 1000000LL;
-#else
+static double gettimedouble(void) {
     struct timeval tv;
     gettimeofday(&tv, NULL);
-    return (int64_t)tv.tv_usec + (int64_t)tv.tv_sec * 1000000LL;
-#endif
+    return tv.tv_usec * 0.000001 + tv.tv_sec;
 }
 
-#define FP_EXP (6)
-#define FP_MULT (1000000LL)
-
-/* Format fixed point number. */
-static void print_number(const int64_t x) {
-    int64_t x_abs, y;
-    int c, i, rounding, g; /* g = integer part size, c = fractional part size */
-    size_t ptr;
-    char buffer[30];
-
-    if (x == INT64_MIN) {
-        /* Prevent UB. */
-        printf("ERR");
-        return;
+void print_number(double x) {
+    double y = x;
+    int c = 0;
+    if (y < 0.0) {
+        y = -y;
     }
-    x_abs = x < 0 ? -x : x;
-
-    /* Determine how many decimals we want to show (more than FP_EXP makes no
-     * sense). */
-    y = x_abs;
-    c = 0;
-    while (y > 0LL && y < 100LL * FP_MULT && c < FP_EXP) {
-        y *= 10LL;
+    while (y < 100.0) {
+        y *= 10.0;
         c++;
     }
-
-    /* Round to 'c' decimals. */
-    y = x_abs;
-    rounding = 0;
-    for (i = c; i < FP_EXP; ++i) {
-        rounding = (y % 10) >= 5;
-        y /= 10;
-    }
-    y += rounding;
-
-    /* Format and print the number. */
-    ptr = sizeof(buffer) - 1;
-    buffer[ptr] = 0;
-    g = 0;
-    if (c != 0) { /* non zero fractional part */
-        for (i = 0; i < c; ++i) {
-            buffer[--ptr] = '0' + (y % 10);
-            y /= 10;
-        }
-    } else if (c == 0) { /* fractional part is 0 */
-        buffer[--ptr] = '0'; 
-    }
-    buffer[--ptr] = '.';
-    do {
-        buffer[--ptr] = '0' + (y % 10);
-        y /= 10;
-        g++;
-    } while (y != 0);
-    if (x < 0) {
-        buffer[--ptr] = '-';
-        g++;
-    }
-    printf("%5.*s", g, &buffer[ptr]); /* Prints integer part */
-    printf("%-*s", FP_EXP, &buffer[ptr + g]); /* Prints fractional part */
+    printf("%.*f", c, x);
 }
 
-static void run_benchmark(char *name, void (*benchmark)(void*, int), void (*setup)(void*), void (*teardown)(void*, int), void* data, int count, int iter) {
+void run_benchmark(char *name, void (*benchmark)(void*), void (*setup)(void*), void (*teardown)(void*), void* data, int count, int iter) {
     int i;
-    int64_t min = INT64_MAX;
-    int64_t sum = 0;
-    int64_t max = 0;
+    double min = HUGE_VAL;
+    double sum = 0.0;
+    double max = 0.0;
     for (i = 0; i < count; i++) {
-        int64_t begin, total;
+        double begin, total;
         if (setup != NULL) {
             setup(data);
         }
-        begin = gettime_i64();
-        benchmark(data, iter);
-        total = gettime_i64() - begin;
+        begin = gettimedouble();
+        benchmark(data);
+        total = gettimedouble() - begin;
         if (teardown != NULL) {
-            teardown(data, iter);
+            teardown(data);
         }
         if (total < min) {
             min = total;
@@ -119,70 +54,13 @@ static void run_benchmark(char *name, void (*benchmark)(void*, int), void (*setu
         }
         sum += total;
     }
-    /* ',' is used as a column delimiter */
-    printf("%-30s, ", name);
-    print_number(min * FP_MULT / iter);
-    printf("   , ");
-    print_number(((sum * FP_MULT) / count) / iter);
-    printf("   , ");
-    print_number(max * FP_MULT / iter);
-    printf("\n");
+    printf("%s: min ", name);
+    print_number(min * 1000000.0 / iter);
+    printf("us / avg ");
+    print_number((sum / count) * 1000000.0 / iter);
+    printf("us / max ");
+    print_number(max * 1000000.0 / iter);
+    printf("us\n");
 }
 
-static int have_flag(int argc, char** argv, char *flag) {
-    char** argm = argv + argc;
-    argv++;
-    while (argv != argm) {
-        if (strcmp(*argv, flag) == 0) {
-            return 1;
-        }
-        argv++;
-    }
-    return 0;
-}
-
-/* takes an array containing the arguments that the user is allowed to enter on the command-line
-   returns:
-      - 1 if the user entered an invalid argument
-      - 0 if all the user entered arguments are valid */
-static int have_invalid_args(int argc, char** argv, char** valid_args, size_t n) {
-    size_t i;
-    int found_valid;
-    char** argm = argv + argc;
-    argv++;
-
-    while (argv != argm) {
-        found_valid = 0;
-        for (i = 0; i < n; i++) {
-            if (strcmp(*argv, valid_args[i]) == 0) {
-                found_valid = 1; /* user entered a valid arg from the list */
-                break;
-            }
-        }
-        if (found_valid == 0) {
-            return 1; /* invalid arg found */
-        }
-        argv++;
-    }
-    return 0;
-}
-
-static int get_iters(int default_iters) {
-    char* env = getenv("SECP256K1_BENCH_ITERS");
-    if (env) {
-        return strtol(env, NULL, 0);
-    } else {
-        return default_iters;
-    }
-}
-
-static void print_output_table_header_row(void) {
-    char* bench_str = "Benchmark";     /* left justified */
-    char* min_str = "    Min(us)    "; /* center alignment */
-    char* avg_str = "    Avg(us)    ";
-    char* max_str = "    Max(us)    ";
-    printf("%-30s,%-15s,%-15s,%-15s\n", bench_str, min_str, avg_str, max_str);
-    printf("\n");
-}
-
-#endif /* SECP256K1_BENCH_H */
+#endif

src/bench_bppp.c

@@ -1,38 +0,0 @@
-/**********************************************************************
- * Copyright (c) 2020 Andrew Poelstra                                 *
- * Distributed under the MIT software license, see the accompanying   *
- * file COPYING or http://www.opensource.org/licenses/mit-license.php.*
- **********************************************************************/
-
-#include <stdint.h>
-
-#include "../include/secp256k1_bppp.h"
-#include "util.h"
-#include "bench.h"
-
-typedef struct {
-    secp256k1_context* ctx;
-} bench_bppp_data;
-
-static void bench_bppp_setup(void* arg) {
-    (void) arg;
-}
-
-static void bench_bppp(void* arg, int iters) {
-    bench_bppp_data *data = (bench_bppp_data*)arg;
-
-    (void) data;
-    (void) iters;
-}
-
-int main(void) {
-    bench_bppp_data data;
-    int iters = get_iters(32);
-
-    data.ctx = secp256k1_context_create(SECP256K1_CONTEXT_NONE);
-
-    run_benchmark("bppp_verify_bit", bench_bppp, bench_bppp_setup, NULL, &data, 10, iters);
-
-    secp256k1_context_destroy(data.ctx);
-    return 0;
-}

src/bench_ecdh.c

@@ -1,23 +1,25 @@
-/***********************************************************************
- * Copyright (c) 2015 Pieter Wuille, Andrew Poelstra                   *
- * Distributed under the MIT software license, see the accompanying    *
- * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
- ***********************************************************************/
+/**********************************************************************
+ * Copyright (c) 2015 Pieter Wuille, Andrew Poelstra                  *
+ * Distributed under the MIT software license, see the accompanying   *
+ * file COPYING or http://www.opensource.org/licenses/mit-license.php.*
+ **********************************************************************/
 
-#ifndef SECP256K1_MODULE_ECDH_BENCH_H
-#define SECP256K1_MODULE_ECDH_BENCH_H
+#include <string.h>
 
-#include "../../../include/secp256k1_ecdh.h"
+#include "include/secp256k1.h"
+#include "include/secp256k1_ecdh.h"
+#include "util.h"
+#include "bench.h"
 
 typedef struct {
     secp256k1_context *ctx;
     secp256k1_pubkey point;
     unsigned char scalar[32];
-} bench_ecdh_data;
+} bench_ecdh_t;
 
 static void bench_ecdh_setup(void* arg) {
     int i;
-    bench_ecdh_data *data = (bench_ecdh_data*)arg;
+    bench_ecdh_t *data = (bench_ecdh_t*)arg;
     const unsigned char point[] = {
         0x03,
         0x54, 0x94, 0xc1, 0x5d, 0x32, 0x09, 0x97, 0x06,
@@ -26,32 +28,27 @@ static void bench_ecdh_setup(void* arg) {
         0xa2, 0xba, 0xd1, 0x84, 0xf8, 0x83, 0xc6, 0x9f
     };
 
+    /* create a context with no capabilities */
+    data->ctx = secp256k1_context_create(SECP256K1_FLAGS_TYPE_CONTEXT);
     for (i = 0; i < 32; i++) {
         data->scalar[i] = i + 1;
     }
     CHECK(secp256k1_ec_pubkey_parse(data->ctx, &data->point, point, sizeof(point)) == 1);
 }
 
-static void bench_ecdh(void* arg, int iters) {
+static void bench_ecdh(void* arg) {
     int i;
     unsigned char res[32];
-    bench_ecdh_data *data = (bench_ecdh_data*)arg;
+    bench_ecdh_t *data = (bench_ecdh_t*)arg;
 
-    for (i = 0; i < iters; i++) {
-        CHECK(secp256k1_ecdh(data->ctx, res, &data->point, data->scalar, NULL, NULL) == 1);
+    for (i = 0; i < 20000; i++) {
+        CHECK(secp256k1_ecdh(data->ctx, res, &data->point, data->scalar) == 1);
     }
 }
 
-static void run_ecdh_bench(int iters, int argc, char** argv) {
-    bench_ecdh_data data;
-    int d = argc == 1;
+int main(void) {
+    bench_ecdh_t data;
 
-    /* create a context with no capabilities */
-    data.ctx = secp256k1_context_create(SECP256K1_FLAGS_TYPE_CONTEXT);
-
-    if (d || have_flag(argc, argv, "ecdh")) run_benchmark("ecdh", bench_ecdh, bench_ecdh_setup, NULL, &data, 10, iters);
-
-    secp256k1_context_destroy(data.ctx);
+    run_benchmark("ecdh", bench_ecdh, bench_ecdh_setup, NULL, &data, 10, 20000);
+    return 0;
 }
-
-#endif /* SECP256K1_MODULE_ECDH_BENCH_H */

src/bench_ecmult.c

@@ -1,367 +0,0 @@
-/***********************************************************************
- * Copyright (c) 2017 Pieter Wuille                                    *
- * Distributed under the MIT software license, see the accompanying    *
- * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
- ***********************************************************************/
-#include <stdio.h>
-
-#include "secp256k1.c"
-#include "../include/secp256k1.h"
-
-#include "util.h"
-#include "hash_impl.h"
-#include "field_impl.h"
-#include "group_impl.h"
-#include "scalar_impl.h"
-#include "ecmult_impl.h"
-#include "bench.h"
-
-#define POINTS 32768
-
-static void help(char **argv) {
-    printf("Benchmark EC multiplication algorithms\n");
-    printf("\n");
-    printf("Usage: %s <help|pippenger_wnaf|strauss_wnaf|simple>\n", argv[0]);
-    printf("The output shows the number of multiplied and summed points right after the\n");
-    printf("function name. The letter 'g' indicates that one of the points is the generator.\n");
-    printf("The benchmarks are divided by the number of points.\n");
-    printf("\n");
-    printf("default (ecmult_multi): picks pippenger_wnaf or strauss_wnaf depending on the\n");
-    printf("                        batch size\n");
-    printf("pippenger_wnaf:         for all batch sizes\n");
-    printf("strauss_wnaf:           for all batch sizes\n");
-    printf("simple:                 multiply and sum each point individually\n");
-}
-
-typedef struct {
-    /* Setup once in advance */
-    secp256k1_context* ctx;
-    secp256k1_scratch_space* scratch;
-    secp256k1_scalar* scalars;
-    secp256k1_ge* pubkeys;
-    secp256k1_gej* pubkeys_gej;
-    secp256k1_scalar* seckeys;
-    secp256k1_gej* expected_output;
-    secp256k1_ecmult_multi_func ecmult_multi;
-
-    /* Changes per benchmark */
-    size_t count;
-    int includes_g;
-
-    /* Changes per benchmark iteration, used to pick different scalars and pubkeys
-     * in each run. */
-    size_t offset1;
-    size_t offset2;
-
-    /* Benchmark output. */
-    secp256k1_gej* output;
-} bench_data;
-
-/* Hashes x into [0, POINTS) twice and store the result in offset1 and offset2. */
-static void hash_into_offset(bench_data* data, size_t x) {
-    data->offset1 = (x * 0x537b7f6f + 0x8f66a481) % POINTS;
-    data->offset2 = (x * 0x7f6f537b + 0x6a1a8f49) % POINTS;
-}
-
-/* Check correctness of the benchmark by computing
- * sum(outputs) ?= (sum(scalars_gen) + sum(seckeys)*sum(scalars))*G */
-static void bench_ecmult_teardown_helper(bench_data* data, size_t* seckey_offset, size_t* scalar_offset, size_t* scalar_gen_offset, int iters) {
-    int i;
-    secp256k1_gej sum_output, tmp;
-    secp256k1_scalar sum_scalars;
-
-    secp256k1_gej_set_infinity(&sum_output);
-    secp256k1_scalar_clear(&sum_scalars);
-    for (i = 0; i < iters; ++i) {
-        secp256k1_gej_add_var(&sum_output, &sum_output, &data->output[i], NULL);
-        if (scalar_gen_offset != NULL) {
-            secp256k1_scalar_add(&sum_scalars, &sum_scalars, &data->scalars[(*scalar_gen_offset+i) % POINTS]);
-        }
-        if (seckey_offset != NULL) {
-            secp256k1_scalar s = data->seckeys[(*seckey_offset+i) % POINTS];
-            secp256k1_scalar_mul(&s, &s, &data->scalars[(*scalar_offset+i) % POINTS]);
-            secp256k1_scalar_add(&sum_scalars, &sum_scalars, &s);
-        }
-    }
-    secp256k1_ecmult_gen(&data->ctx->ecmult_gen_ctx, &tmp, &sum_scalars);
-    CHECK(secp256k1_gej_eq_var(&tmp, &sum_output));
-}
-
-static void bench_ecmult_setup(void* arg) {
-    bench_data* data = (bench_data*)arg;
-    /* Re-randomize offset to ensure that we're using different scalars and
-     * group elements in each run. */
-    hash_into_offset(data, data->offset1);
-}
-
-static void bench_ecmult_gen(void* arg, int iters) {
-    bench_data* data = (bench_data*)arg;
-    int i;
-
-    for (i = 0; i < iters; ++i) {
-        secp256k1_ecmult_gen(&data->ctx->ecmult_gen_ctx, &data->output[i], &data->scalars[(data->offset1+i) % POINTS]);
-    }
-}
-
-static void bench_ecmult_gen_teardown(void* arg, int iters) {
-    bench_data* data = (bench_data*)arg;
-    bench_ecmult_teardown_helper(data, NULL, NULL, &data->offset1, iters);
-}
-
-static void bench_ecmult_const(void* arg, int iters) {
-    bench_data* data = (bench_data*)arg;
-    int i;
-
-    for (i = 0; i < iters; ++i) {
-        secp256k1_ecmult_const(&data->output[i], &data->pubkeys[(data->offset1+i) % POINTS], &data->scalars[(data->offset2+i) % POINTS]);
-    }
-}
-
-static void bench_ecmult_const_teardown(void* arg, int iters) {
-    bench_data* data = (bench_data*)arg;
-    bench_ecmult_teardown_helper(data, &data->offset1, &data->offset2, NULL, iters);
-}
-
-static void bench_ecmult_1p(void* arg, int iters) {
-    bench_data* data = (bench_data*)arg;
-    int i;
-
-    for (i = 0; i < iters; ++i) {
-        secp256k1_ecmult(&data->output[i], &data->pubkeys_gej[(data->offset1+i) % POINTS], &data->scalars[(data->offset2+i) % POINTS], NULL);
-    }
-}
-
-static void bench_ecmult_1p_teardown(void* arg, int iters) {
-    bench_data* data = (bench_data*)arg;
-    bench_ecmult_teardown_helper(data, &data->offset1, &data->offset2, NULL, iters);
-}
-
-static void bench_ecmult_0p_g(void* arg, int iters) {
-    bench_data* data = (bench_data*)arg;
-    int i;
-
-    for (i = 0; i < iters; ++i) {
-        secp256k1_ecmult(&data->output[i], NULL, &secp256k1_scalar_zero, &data->scalars[(data->offset1+i) % POINTS]);
-    }
-}
-
-static void bench_ecmult_0p_g_teardown(void* arg, int iters) {
-    bench_data* data = (bench_data*)arg;
-    bench_ecmult_teardown_helper(data, NULL, NULL, &data->offset1, iters);
-}
-
-static void bench_ecmult_1p_g(void* arg, int iters) {
-    bench_data* data = (bench_data*)arg;
-    int i;
-
-    for (i = 0; i < iters/2; ++i) {
-        secp256k1_ecmult(&data->output[i], &data->pubkeys_gej[(data->offset1+i) % POINTS], &data->scalars[(data->offset2+i) % POINTS], &data->scalars[(data->offset1+i) % POINTS]);
-    }
-}
-
-static void bench_ecmult_1p_g_teardown(void* arg, int iters) {
-    bench_data* data = (bench_data*)arg;
-    bench_ecmult_teardown_helper(data, &data->offset1, &data->offset2, &data->offset1, iters/2);
-}
-
-static void run_ecmult_bench(bench_data* data, int iters) {
-    char str[32];
-    sprintf(str, "ecmult_gen");
-    run_benchmark(str, bench_ecmult_gen, bench_ecmult_setup, bench_ecmult_gen_teardown, data, 10, iters);
-    sprintf(str, "ecmult_const");
-    run_benchmark(str, bench_ecmult_const, bench_ecmult_setup, bench_ecmult_const_teardown, data, 10, iters);
-    /* ecmult with non generator point */
-    sprintf(str, "ecmult_1p");
-    run_benchmark(str, bench_ecmult_1p, bench_ecmult_setup, bench_ecmult_1p_teardown, data, 10, iters);
-    /* ecmult with generator point */
-    sprintf(str, "ecmult_0p_g");
-    run_benchmark(str, bench_ecmult_0p_g, bench_ecmult_setup, bench_ecmult_0p_g_teardown, data, 10, iters);
-    /* ecmult with generator and non-generator point. The reported time is per point. */
-    sprintf(str, "ecmult_1p_g");
-    run_benchmark(str, bench_ecmult_1p_g, bench_ecmult_setup, bench_ecmult_1p_g_teardown, data, 10, 2*iters);
-}
-
-static int bench_ecmult_multi_callback(secp256k1_scalar* sc, secp256k1_ge* ge, size_t idx, void* arg) {
-    bench_data* data = (bench_data*)arg;
-    if (data->includes_g) ++idx;
-    if (idx == 0) {
-        *sc = data->scalars[data->offset1];
-        *ge = secp256k1_ge_const_g;
-    } else {
-        *sc = data->scalars[(data->offset1 + idx) % POINTS];
-        *ge = data->pubkeys[(data->offset2 + idx - 1) % POINTS];
-    }
-    return 1;
-}
-
-static void bench_ecmult_multi(void* arg, int iters) {
-    bench_data* data = (bench_data*)arg;
-
-    int includes_g = data->includes_g;
-    int iter;
-    int count = data->count;
-    iters = iters / data->count;
-
-    for (iter = 0; iter < iters; ++iter) {
-        data->ecmult_multi(&data->ctx->error_callback, data->scratch, &data->output[iter], data->includes_g ? &data->scalars[data->offset1] : NULL, bench_ecmult_multi_callback, arg, count - includes_g);
-        data->offset1 = (data->offset1 + count) % POINTS;
-        data->offset2 = (data->offset2 + count - 1) % POINTS;
-    }
-}
-
-static void bench_ecmult_multi_setup(void* arg) {
-    bench_data* data = (bench_data*)arg;
-    hash_into_offset(data, data->count);
-}
-
-static void bench_ecmult_multi_teardown(void* arg, int iters) {
-    bench_data* data = (bench_data*)arg;
-    int iter;
-    iters = iters / data->count;
-    /* Verify the results in teardown, to avoid doing comparisons while benchmarking. */
-    for (iter = 0; iter < iters; ++iter) {
-        secp256k1_gej tmp;
-        secp256k1_gej_add_var(&tmp, &data->output[iter], &data->expected_output[iter], NULL);
-        CHECK(secp256k1_gej_is_infinity(&tmp));
-    }
-}
-
-static void generate_scalar(uint32_t num, secp256k1_scalar* scalar) {
-    secp256k1_sha256 sha256;
-    unsigned char c[10] = {'e', 'c', 'm', 'u', 'l', 't', 0, 0, 0, 0};
-    unsigned char buf[32];
-    int overflow = 0;
-    c[6] = num;
-    c[7] = num >> 8;
-    c[8] = num >> 16;
-    c[9] = num >> 24;
-    secp256k1_sha256_initialize(&sha256);
-    secp256k1_sha256_write(&sha256, c, sizeof(c));
-    secp256k1_sha256_finalize(&sha256, buf);
-    secp256k1_scalar_set_b32(scalar, buf, &overflow);
-    CHECK(!overflow);
-}
-
-static void run_ecmult_multi_bench(bench_data* data, size_t count, int includes_g, int num_iters) {
-    char str[32];
-    size_t iters = 1 + num_iters / count;
-    size_t iter;
-
-    data->count = count;
-    data->includes_g = includes_g;
-
-    /* Compute (the negation of) the expected results directly. */
-    hash_into_offset(data, data->count);
-    for (iter = 0; iter < iters; ++iter) {
-        secp256k1_scalar tmp;
-        secp256k1_scalar total = data->scalars[(data->offset1++) % POINTS];
-        size_t i = 0;
-        for (i = 0; i + 1 < count; ++i) {
-            secp256k1_scalar_mul(&tmp, &data->seckeys[(data->offset2++) % POINTS], &data->scalars[(data->offset1++) % POINTS]);
-            secp256k1_scalar_add(&total, &total, &tmp);
-        }
-        secp256k1_scalar_negate(&total, &total);
-        secp256k1_ecmult(&data->expected_output[iter], NULL, &secp256k1_scalar_zero, &total);
-    }
-
-    /* Run the benchmark. */
-    if (includes_g) {
-        sprintf(str, "ecmult_multi_%ip_g", (int)count - 1);
-    } else {
-        sprintf(str, "ecmult_multi_%ip", (int)count);
-    }
-    run_benchmark(str, bench_ecmult_multi, bench_ecmult_multi_setup, bench_ecmult_multi_teardown, data, 10, count * iters);
-}
-
-int main(int argc, char **argv) {
-    bench_data data;
-    int i, p;
-    size_t scratch_size;
-
-    int iters = get_iters(10000);
-
-    data.ecmult_multi = secp256k1_ecmult_multi_var;
-
-    if (argc > 1) {
-        if(have_flag(argc, argv, "-h")
-           || have_flag(argc, argv, "--help")
-           || have_flag(argc, argv, "help")) {
-            help(argv);
-            return 0;
-        } else if(have_flag(argc, argv, "pippenger_wnaf")) {
-            printf("Using pippenger_wnaf:\n");
-            data.ecmult_multi = secp256k1_ecmult_pippenger_batch_single;
-        } else if(have_flag(argc, argv, "strauss_wnaf")) {
-            printf("Using strauss_wnaf:\n");
-            data.ecmult_multi = secp256k1_ecmult_strauss_batch_single;
-        } else if(have_flag(argc, argv, "simple")) {
-            printf("Using simple algorithm:\n");
-        } else {
-            fprintf(stderr, "%s: unrecognized argument '%s'.\n\n", argv[0], argv[1]);
-            help(argv);
-            return 1;
-        }
-    }
-
-    data.ctx = secp256k1_context_create(SECP256K1_CONTEXT_NONE);
-    scratch_size = secp256k1_strauss_scratch_size(POINTS) + STRAUSS_SCRATCH_OBJECTS*16;
-    if (!have_flag(argc, argv, "simple")) {
-        data.scratch = secp256k1_scratch_space_create(data.ctx, scratch_size);
-    } else {
-        data.scratch = NULL;
-    }
-
-    /* Allocate stuff */
-    data.scalars = malloc(sizeof(secp256k1_scalar) * POINTS);
-    data.seckeys = malloc(sizeof(secp256k1_scalar) * POINTS);
-    data.pubkeys = malloc(sizeof(secp256k1_ge) * POINTS);
-    data.pubkeys_gej = malloc(sizeof(secp256k1_gej) * POINTS);
-    data.expected_output = malloc(sizeof(secp256k1_gej) * (iters + 1));
-    data.output = malloc(sizeof(secp256k1_gej) * (iters + 1));
-
-    /* Generate a set of scalars, and private/public keypairs. */
-    secp256k1_gej_set_ge(&data.pubkeys_gej[0], &secp256k1_ge_const_g);
-    secp256k1_scalar_set_int(&data.seckeys[0], 1);
-    for (i = 0; i < POINTS; ++i) {
-        generate_scalar(i, &data.scalars[i]);
-        if (i) {
-            secp256k1_gej_double_var(&data.pubkeys_gej[i], &data.pubkeys_gej[i - 1], NULL);
-            secp256k1_scalar_add(&data.seckeys[i], &data.seckeys[i - 1], &data.seckeys[i - 1]);
-        }
-    }
-    secp256k1_ge_set_all_gej_var(data.pubkeys, data.pubkeys_gej, POINTS);
-
-
-    print_output_table_header_row();
-    /* Initialize offset1 and offset2 */
-    hash_into_offset(&data, 0);
-    run_ecmult_bench(&data, iters);
-
-    for (i = 1; i <= 8; ++i) {
-        run_ecmult_multi_bench(&data, i, 1, iters);
-    }
-
-    /* This is disabled with low count of iterations because the loop runs 77 times even with iters=1
-    * and the higher it goes the longer the computation takes(more points)
-    * So we don't run this benchmark with low iterations to prevent slow down */
-     if (iters > 2) {
-        for (p = 0; p <= 11; ++p) {
-            for (i = 9; i <= 16; ++i) {
-                run_ecmult_multi_bench(&data, i << p, 1, iters);
-            }
-        }
-    }
-
-    if (data.scratch != NULL) {
-        secp256k1_scratch_space_destroy(data.ctx, data.scratch);
-    }
-    secp256k1_context_destroy(data.ctx);
-    free(data.scalars);
-    free(data.pubkeys);
-    free(data.pubkeys_gej);
-    free(data.seckeys);
-    free(data.output);
-    free(data.expected_output);
-
-    return(0);
-}

src/bench_generator.c

@@ -7,7 +7,7 @@
 #include <stdint.h>
 #include <string.h>
 
-#include "../include/secp256k1_generator.h"
+#include "include/secp256k1_generator.h"
 #include "util.h"
 #include "bench.h"
 
@@ -23,22 +23,22 @@ static void bench_generator_setup(void* arg) {
     memset(data->blind, 0x13, 32);
 }
 
-static void bench_generator_generate(void* arg, int iters) {
+static void bench_generator_generate(void* arg) {
     int i;
     bench_generator_t *data = (bench_generator_t*)arg;
 
-    for (i = 0; i < iters; i++) {
+    for (i = 0; i < 20000; i++) {
         secp256k1_generator gen;
         CHECK(secp256k1_generator_generate(data->ctx, &gen, data->key));
         data->key[i & 31]++;
     }
 }
 
-static void bench_generator_generate_blinded(void* arg, int iters) {
+static void bench_generator_generate_blinded(void* arg) {
     int i;
     bench_generator_t *data = (bench_generator_t*)arg;
 
-    for (i = 0; i < iters; i++) {
+    for (i = 0; i < 20000; i++) {
         secp256k1_generator gen;
         CHECK(secp256k1_generator_generate_blinded(data->ctx, &gen, data->key, data->blind));
         data->key[1 + (i & 30)]++;
@@ -48,12 +48,11 @@ static void bench_generator_generate_blinded(void* arg, int iters) {
 
 int main(void) {
     bench_generator_t data;
-    int iters = get_iters(20000);
 
-    data.ctx = secp256k1_context_create(SECP256K1_CONTEXT_NONE);
+    data.ctx = secp256k1_context_create(SECP256K1_CONTEXT_SIGN | SECP256K1_CONTEXT_VERIFY);
 
-    run_benchmark("generator_generate", bench_generator_generate, bench_generator_setup, NULL, &data, 10, iters);
-    run_benchmark("generator_generate_blinded", bench_generator_generate_blinded, bench_generator_setup, NULL, &data, 10, iters);
+    run_benchmark("generator_generate", bench_generator_generate, bench_generator_setup, NULL, &data, 10, 20000);
+    run_benchmark("generator_generate_blinded", bench_generator_generate_blinded, bench_generator_setup, NULL, &data, 10, 20000);
 
     secp256k1_context_destroy(data.ctx);
     return 0;

src/bench_internal.c

@@ -1,465 +1,382 @@
-/***********************************************************************
- * Copyright (c) 2014-2015 Pieter Wuille                               *
- * Distributed under the MIT software license, see the accompanying    *
- * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
- ***********************************************************************/
+/**********************************************************************
+ * Copyright (c) 2014-2015 Pieter Wuille                              *
+ * Distributed under the MIT software license, see the accompanying   *
+ * file COPYING or http://www.opensource.org/licenses/mit-license.php.*
+ **********************************************************************/
 #include <stdio.h>
 
-#include "secp256k1.c"
-#include "../include/secp256k1.h"
+#include "include/secp256k1.h"
 
-#include "assumptions.h"
 #include "util.h"
 #include "hash_impl.h"
+#include "num_impl.h"
 #include "field_impl.h"
 #include "group_impl.h"
 #include "scalar_impl.h"
+#include "ecmult_const_impl.h"
 #include "ecmult_impl.h"
 #include "bench.h"
-
-static void help(int default_iters) {
-    printf("Benchmarks various internal routines.\n");
-    printf("\n");
-    printf("The default number of iterations for each benchmark is %d. This can be\n", default_iters);
-    printf("customized using the SECP256K1_BENCH_ITERS environment variable.\n");
-    printf("\n");
-    printf("Usage: ./bench_internal [args]\n");
-    printf("By default, all benchmarks will be run.\n");
-    printf("args:\n");
-    printf("    help       : display this help and exit\n");
-    printf("    scalar     : all scalar operations (add, half, inverse, mul, negate, split)\n");
-    printf("    field      : all field operations (half, inverse, issquare, mul, normalize, sqr, sqrt)\n");
-    printf("    group      : all group operations (add, double, to_affine)\n");
-    printf("    ecmult     : all point multiplication operations (ecmult_wnaf) \n");
-    printf("    hash       : all hash algorithms (hmac, rng6979, sha256)\n");
-    printf("    context    : all context object operations (context_create)\n");
-    printf("\n");
-}
+#include "secp256k1.c"
 
 typedef struct {
-    secp256k1_scalar scalar[2];
-    secp256k1_fe fe[4];
-    secp256k1_ge ge[2];
-    secp256k1_gej gej[2];
+    secp256k1_scalar scalar_x, scalar_y;
+    secp256k1_fe fe_x, fe_y;
+    secp256k1_ge ge_x, ge_y;
+    secp256k1_gej gej_x, gej_y;
     unsigned char data[64];
     int wnaf[256];
-} bench_inv;
+} bench_inv_t;
 
-static void bench_setup(void* arg) {
-    bench_inv *data = (bench_inv*)arg;
+void bench_setup(void* arg) {
+    bench_inv_t *data = (bench_inv_t*)arg;
 
-    static const unsigned char init[4][32] = {
-        /* Initializer for scalar[0], fe[0], first half of data, the X coordinate of ge[0],
-           and the (implied affine) X coordinate of gej[0]. */
-        {
-            0x02, 0x03, 0x05, 0x07, 0x0b, 0x0d, 0x11, 0x13,
-            0x17, 0x1d, 0x1f, 0x25, 0x29, 0x2b, 0x2f, 0x35,
-            0x3b, 0x3d, 0x43, 0x47, 0x49, 0x4f, 0x53, 0x59,
-            0x61, 0x65, 0x67, 0x6b, 0x6d, 0x71, 0x7f, 0x83
-        },
-        /* Initializer for scalar[1], fe[1], first half of data, the X coordinate of ge[1],
-           and the (implied affine) X coordinate of gej[1]. */
-        {
-            0x82, 0x83, 0x85, 0x87, 0x8b, 0x8d, 0x81, 0x83,
-            0x97, 0xad, 0xaf, 0xb5, 0xb9, 0xbb, 0xbf, 0xc5,
-            0xdb, 0xdd, 0xe3, 0xe7, 0xe9, 0xef, 0xf3, 0xf9,
-            0x11, 0x15, 0x17, 0x1b, 0x1d, 0xb1, 0xbf, 0xd3
-        },
-        /* Initializer for fe[2] and the Z coordinate of gej[0]. */
-        {
-            0x3d, 0x2d, 0xef, 0xf4, 0x25, 0x98, 0x4f, 0x5d,
-            0xe2, 0xca, 0x5f, 0x41, 0x3f, 0x3f, 0xce, 0x44,
-            0xaa, 0x2c, 0x53, 0x8a, 0xc6, 0x59, 0x1f, 0x38,
-            0x38, 0x23, 0xe4, 0x11, 0x27, 0xc6, 0xa0, 0xe7
-        },
-        /* Initializer for fe[3] and the Z coordinate of gej[1]. */
-        {
-            0xbd, 0x21, 0xa5, 0xe1, 0x13, 0x50, 0x73, 0x2e,
-            0x52, 0x98, 0xc8, 0x9e, 0xab, 0x00, 0xa2, 0x68,
-            0x43, 0xf5, 0xd7, 0x49, 0x80, 0x72, 0xa7, 0xf3,
-            0xd7, 0x60, 0xe6, 0xab, 0x90, 0x92, 0xdf, 0xc5
-        }
+    static const unsigned char init_x[32] = {
+        0x02, 0x03, 0x05, 0x07, 0x0b, 0x0d, 0x11, 0x13,
+        0x17, 0x1d, 0x1f, 0x25, 0x29, 0x2b, 0x2f, 0x35,
+        0x3b, 0x3d, 0x43, 0x47, 0x49, 0x4f, 0x53, 0x59,
+        0x61, 0x65, 0x67, 0x6b, 0x6d, 0x71, 0x7f, 0x83
     };
 
-    secp256k1_scalar_set_b32(&data->scalar[0], init[0], NULL);
-    secp256k1_scalar_set_b32(&data->scalar[1], init[1], NULL);
-    secp256k1_fe_set_b32_limit(&data->fe[0], init[0]);
-    secp256k1_fe_set_b32_limit(&data->fe[1], init[1]);
-    secp256k1_fe_set_b32_limit(&data->fe[2], init[2]);
-    secp256k1_fe_set_b32_limit(&data->fe[3], init[3]);
-    CHECK(secp256k1_ge_set_xo_var(&data->ge[0], &data->fe[0], 0));
-    CHECK(secp256k1_ge_set_xo_var(&data->ge[1], &data->fe[1], 1));
-    secp256k1_gej_set_ge(&data->gej[0], &data->ge[0]);
-    secp256k1_gej_rescale(&data->gej[0], &data->fe[2]);
-    secp256k1_gej_set_ge(&data->gej[1], &data->ge[1]);
-    secp256k1_gej_rescale(&data->gej[1], &data->fe[3]);
-    memcpy(data->data, init[0], 32);
-    memcpy(data->data + 32, init[1], 32);
+    static const unsigned char init_y[32] = {
+        0x82, 0x83, 0x85, 0x87, 0x8b, 0x8d, 0x81, 0x83,
+        0x97, 0xad, 0xaf, 0xb5, 0xb9, 0xbb, 0xbf, 0xc5,
+        0xdb, 0xdd, 0xe3, 0xe7, 0xe9, 0xef, 0xf3, 0xf9,
+        0x11, 0x15, 0x17, 0x1b, 0x1d, 0xb1, 0xbf, 0xd3
+    };
+
+    secp256k1_scalar_set_b32(&data->scalar_x, init_x, NULL);
+    secp256k1_scalar_set_b32(&data->scalar_y, init_y, NULL);
+    secp256k1_fe_set_b32(&data->fe_x, init_x);
+    secp256k1_fe_set_b32(&data->fe_y, init_y);
+    CHECK(secp256k1_ge_set_xo_var(&data->ge_x, &data->fe_x, 0));
+    CHECK(secp256k1_ge_set_xo_var(&data->ge_y, &data->fe_y, 1));
+    secp256k1_gej_set_ge(&data->gej_x, &data->ge_x);
+    secp256k1_gej_set_ge(&data->gej_y, &data->ge_y);
+    memcpy(data->data, init_x, 32);
+    memcpy(data->data + 32, init_y, 32);
 }
 
-static void bench_scalar_add(void* arg, int iters) {
-    int i, j = 0;
-    bench_inv *data = (bench_inv*)arg;
-
-    for (i = 0; i < iters; i++) {
-        j += secp256k1_scalar_add(&data->scalar[0], &data->scalar[0], &data->scalar[1]);
-    }
-    CHECK(j <= iters);
-}
-
-static void bench_scalar_negate(void* arg, int iters) {
+void bench_scalar_add(void* arg) {
     int i;
-    bench_inv *data = (bench_inv*)arg;
+    bench_inv_t *data = (bench_inv_t*)arg;
 
-    for (i = 0; i < iters; i++) {
-        secp256k1_scalar_negate(&data->scalar[0], &data->scalar[0]);
+    for (i = 0; i < 2000000; i++) {
+        secp256k1_scalar_add(&data->scalar_x, &data->scalar_x, &data->scalar_y);
     }
 }
 
-static void bench_scalar_sqr(void* arg, int iters) {
+void bench_scalar_negate(void* arg) {
     int i;
-    bench_inv *data = (bench_inv*)arg;
+    bench_inv_t *data = (bench_inv_t*)arg;
 
-    for (i = 0; i < iters; i++) {
-        secp256k1_scalar_sqr(&data->scalar[0], &data->scalar[0]);
+    for (i = 0; i < 2000000; i++) {
+        secp256k1_scalar_negate(&data->scalar_x, &data->scalar_x);
     }
 }
 
-static void bench_scalar_half(void* arg, int iters) {
+void bench_scalar_sqr(void* arg) {
     int i;
-    bench_inv *data = (bench_inv*)arg;
-    secp256k1_scalar s = data->scalar[0];
+    bench_inv_t *data = (bench_inv_t*)arg;
 
-    for (i = 0; i < iters; i++) {
-        secp256k1_scalar_half(&s, &s);
+    for (i = 0; i < 200000; i++) {
+        secp256k1_scalar_sqr(&data->scalar_x, &data->scalar_x);
     }
-
-    data->scalar[0] = s;
 }
 
-static void bench_scalar_mul(void* arg, int iters) {
+void bench_scalar_mul(void* arg) {
     int i;
-    bench_inv *data = (bench_inv*)arg;
+    bench_inv_t *data = (bench_inv_t*)arg;
 
-    for (i = 0; i < iters; i++) {
-        secp256k1_scalar_mul(&data->scalar[0], &data->scalar[0], &data->scalar[1]);
+    for (i = 0; i < 200000; i++) {
+        secp256k1_scalar_mul(&data->scalar_x, &data->scalar_x, &data->scalar_y);
     }
 }
 
-static void bench_scalar_split(void* arg, int iters) {
-    int i, j = 0;
-    bench_inv *data = (bench_inv*)arg;
-    secp256k1_scalar tmp;
-
-    for (i = 0; i < iters; i++) {
-        secp256k1_scalar_split_lambda(&tmp, &data->scalar[1], &data->scalar[0]);
-        j += secp256k1_scalar_add(&data->scalar[0], &tmp, &data->scalar[1]);
-    }
-    CHECK(j <= iters);
-}
-
-static void bench_scalar_inverse(void* arg, int iters) {
-    int i, j = 0;
-    bench_inv *data = (bench_inv*)arg;
-
-    for (i = 0; i < iters; i++) {
-        secp256k1_scalar_inverse(&data->scalar[0], &data->scalar[0]);
-        j += secp256k1_scalar_add(&data->scalar[0], &data->scalar[0], &data->scalar[1]);
-    }
-    CHECK(j <= iters);
-}
-
-static void bench_scalar_inverse_var(void* arg, int iters) {
-    int i, j = 0;
-    bench_inv *data = (bench_inv*)arg;
-
-    for (i = 0; i < iters; i++) {
-        secp256k1_scalar_inverse_var(&data->scalar[0], &data->scalar[0]);
-        j += secp256k1_scalar_add(&data->scalar[0], &data->scalar[0], &data->scalar[1]);
-    }
-    CHECK(j <= iters);
-}
-
-static void bench_field_half(void* arg, int iters) {
+#ifdef USE_ENDOMORPHISM
+void bench_scalar_split(void* arg) {
     int i;
-    bench_inv *data = (bench_inv*)arg;
+    bench_inv_t *data = (bench_inv_t*)arg;
 
-    for (i = 0; i < iters; i++) {
-        secp256k1_fe_half(&data->fe[0]);
+    for (i = 0; i < 20000; i++) {
+        secp256k1_scalar l, r;
+        secp256k1_scalar_split_lambda(&l, &r, &data->scalar_x);
+        secp256k1_scalar_add(&data->scalar_x, &data->scalar_x, &data->scalar_y);
     }
 }
+#endif
 
-static void bench_field_normalize(void* arg, int iters) {
+void bench_scalar_inverse(void* arg) {
     int i;
-    bench_inv *data = (bench_inv*)arg;
+    bench_inv_t *data = (bench_inv_t*)arg;
 
-    for (i = 0; i < iters; i++) {
-        secp256k1_fe_normalize(&data->fe[0]);
+    for (i = 0; i < 2000; i++) {
+        secp256k1_scalar_inverse(&data->scalar_x, &data->scalar_x);
+        secp256k1_scalar_add(&data->scalar_x, &data->scalar_x, &data->scalar_y);
     }
 }
 
-static void bench_field_normalize_weak(void* arg, int iters) {
+void bench_scalar_inverse_var(void* arg) {
     int i;
-    bench_inv *data = (bench_inv*)arg;
+    bench_inv_t *data = (bench_inv_t*)arg;
 
-    for (i = 0; i < iters; i++) {
-        secp256k1_fe_normalize_weak(&data->fe[0]);
+    for (i = 0; i < 2000; i++) {
+        secp256k1_scalar_inverse_var(&data->scalar_x, &data->scalar_x);
+        secp256k1_scalar_add(&data->scalar_x, &data->scalar_x, &data->scalar_y);
     }
 }
 
-static void bench_field_mul(void* arg, int iters) {
+void bench_field_normalize(void* arg) {
     int i;
-    bench_inv *data = (bench_inv*)arg;
+    bench_inv_t *data = (bench_inv_t*)arg;
 
-    for (i = 0; i < iters; i++) {
-        secp256k1_fe_mul(&data->fe[0], &data->fe[0], &data->fe[1]);
+    for (i = 0; i < 2000000; i++) {
+        secp256k1_fe_normalize(&data->fe_x);
     }
 }
 
-static void bench_field_sqr(void* arg, int iters) {
+void bench_field_normalize_weak(void* arg) {
     int i;
-    bench_inv *data = (bench_inv*)arg;
+    bench_inv_t *data = (bench_inv_t*)arg;
 
-    for (i = 0; i < iters; i++) {
-        secp256k1_fe_sqr(&data->fe[0], &data->fe[0]);
+    for (i = 0; i < 2000000; i++) {
+        secp256k1_fe_normalize_weak(&data->fe_x);
     }
 }
 
-static void bench_field_inverse(void* arg, int iters) {
+void bench_field_mul(void* arg) {
     int i;
-    bench_inv *data = (bench_inv*)arg;
+    bench_inv_t *data = (bench_inv_t*)arg;
 
-    for (i = 0; i < iters; i++) {
-        secp256k1_fe_inv(&data->fe[0], &data->fe[0]);
-        secp256k1_fe_add(&data->fe[0], &data->fe[1]);
+    for (i = 0; i < 200000; i++) {
+        secp256k1_fe_mul(&data->fe_x, &data->fe_x, &data->fe_y);
     }
 }
 
-static void bench_field_inverse_var(void* arg, int iters) {
+void bench_field_sqr(void* arg) {
     int i;
-    bench_inv *data = (bench_inv*)arg;
+    bench_inv_t *data = (bench_inv_t*)arg;
 
-    for (i = 0; i < iters; i++) {
-        secp256k1_fe_inv_var(&data->fe[0], &data->fe[0]);
-        secp256k1_fe_add(&data->fe[0], &data->fe[1]);
+    for (i = 0; i < 200000; i++) {
+        secp256k1_fe_sqr(&data->fe_x, &data->fe_x);
     }
 }
 
-static void bench_field_sqrt(void* arg, int iters) {
-    int i, j = 0;
-    bench_inv *data = (bench_inv*)arg;
-    secp256k1_fe t;
-
-    for (i = 0; i < iters; i++) {
-        t = data->fe[0];
-        j += secp256k1_fe_sqrt(&data->fe[0], &t);
-        secp256k1_fe_add(&data->fe[0], &data->fe[1]);
-    }
-    CHECK(j <= iters);
-}
-
-static void bench_field_is_square_var(void* arg, int iters) {
-    int i, j = 0;
-    bench_inv *data = (bench_inv*)arg;
-    secp256k1_fe t = data->fe[0];
-
-    for (i = 0; i < iters; i++) {
-        j += secp256k1_fe_is_square_var(&t);
-        secp256k1_fe_add(&t, &data->fe[1]);
-        secp256k1_fe_normalize_var(&t);
-    }
-    CHECK(j <= iters);
-}
-
-static void bench_group_double_var(void* arg, int iters) {
+void bench_field_inverse(void* arg) {
     int i;
-    bench_inv *data = (bench_inv*)arg;
+    bench_inv_t *data = (bench_inv_t*)arg;
 
-    for (i = 0; i < iters; i++) {
-        secp256k1_gej_double_var(&data->gej[0], &data->gej[0], NULL);
+    for (i = 0; i < 20000; i++) {
+        secp256k1_fe_inv(&data->fe_x, &data->fe_x);
+        secp256k1_fe_add(&data->fe_x, &data->fe_y);
     }
 }
 
-static void bench_group_add_var(void* arg, int iters) {
+void bench_field_inverse_var(void* arg) {
     int i;
-    bench_inv *data = (bench_inv*)arg;
+    bench_inv_t *data = (bench_inv_t*)arg;
 
-    for (i = 0; i < iters; i++) {
-        secp256k1_gej_add_var(&data->gej[0], &data->gej[0], &data->gej[1], NULL);
+    for (i = 0; i < 20000; i++) {
+        secp256k1_fe_inv_var(&data->fe_x, &data->fe_x);
+        secp256k1_fe_add(&data->fe_x, &data->fe_y);
     }
 }
 
-static void bench_group_add_affine(void* arg, int iters) {
+void bench_field_sqrt(void* arg) {
     int i;
-    bench_inv *data = (bench_inv*)arg;
+    bench_inv_t *data = (bench_inv_t*)arg;
 
-    for (i = 0; i < iters; i++) {
-        secp256k1_gej_add_ge(&data->gej[0], &data->gej[0], &data->ge[1]);
+    for (i = 0; i < 20000; i++) {
+        secp256k1_fe_sqrt(&data->fe_x, &data->fe_x);
+        secp256k1_fe_add(&data->fe_x, &data->fe_y);
     }
 }
 
-static void bench_group_add_affine_var(void* arg, int iters) {
+void bench_group_double_var(void* arg) {
     int i;
-    bench_inv *data = (bench_inv*)arg;
+    bench_inv_t *data = (bench_inv_t*)arg;
 
-    for (i = 0; i < iters; i++) {
-        secp256k1_gej_add_ge_var(&data->gej[0], &data->gej[0], &data->ge[1], NULL);
+    for (i = 0; i < 200000; i++) {
+        secp256k1_gej_double_var(&data->gej_x, &data->gej_x, NULL);
     }
 }
 
-static void bench_group_jacobi_var(void* arg, int iters) {
-    int i, j = 0;
-    bench_inv *data = (bench_inv*)arg;
-
-    for (i = 0; i < iters; i++) {
-        j += secp256k1_gej_has_quad_y_var(&data->gej[0]);
-        /* Vary the Y and Z coordinates of the input (the X coordinate doesn't matter to
-           secp256k1_gej_has_quad_y_var). Note that the resulting coordinates will
-           generally not correspond to a point on the curve, but this is not a problem
-           for the code being benchmarked here. Adding and normalizing have less
-           overhead than EC operations (which could guarantee the point remains on the
-           curve). */
-        secp256k1_fe_add(&data->gej[0].y, &data->fe[1]);
-        secp256k1_fe_add(&data->gej[0].z, &data->fe[2]);
-        secp256k1_fe_normalize_var(&data->gej[0].y);
-        secp256k1_fe_normalize_var(&data->gej[0].z);
-    }
-    CHECK(j <= iters);
-}
-
-static void bench_group_add_zinv_var(void* arg, int iters) {
+void bench_group_add_var(void* arg) {
     int i;
-    bench_inv *data = (bench_inv*)arg;
+    bench_inv_t *data = (bench_inv_t*)arg;
 
-    for (i = 0; i < iters; i++) {
-        secp256k1_gej_add_zinv_var(&data->gej[0], &data->gej[0], &data->ge[1], &data->gej[0].y);
+    for (i = 0; i < 200000; i++) {
+        secp256k1_gej_add_var(&data->gej_x, &data->gej_x, &data->gej_y, NULL);
     }
 }
 
-static void bench_group_to_affine_var(void* arg, int iters) {
+void bench_group_add_affine(void* arg) {
     int i;
-    bench_inv *data = (bench_inv*)arg;
+    bench_inv_t *data = (bench_inv_t*)arg;
 
-    for (i = 0; i < iters; ++i) {
-        secp256k1_ge_set_gej_var(&data->ge[1], &data->gej[0]);
-        /* Use the output affine X/Y coordinates to vary the input X/Y/Z coordinates.
-           Similar to bench_group_jacobi_var, this approach does not result in
-           coordinates of points on the curve. */
-        secp256k1_fe_add(&data->gej[0].x, &data->ge[1].y);
-        secp256k1_fe_add(&data->gej[0].y, &data->fe[2]);
-        secp256k1_fe_add(&data->gej[0].z, &data->ge[1].x);
-        secp256k1_fe_normalize_var(&data->gej[0].x);
-        secp256k1_fe_normalize_var(&data->gej[0].y);
-        secp256k1_fe_normalize_var(&data->gej[0].z);
+    for (i = 0; i < 200000; i++) {
+        secp256k1_gej_add_ge(&data->gej_x, &data->gej_x, &data->ge_y);
     }
 }
 
-static void bench_ecmult_wnaf(void* arg, int iters) {
-    int i, bits = 0, overflow = 0;
-    bench_inv *data = (bench_inv*)arg;
-
-    for (i = 0; i < iters; i++) {
-        bits += secp256k1_ecmult_wnaf(data->wnaf, 256, &data->scalar[0], WINDOW_A);
-        overflow += secp256k1_scalar_add(&data->scalar[0], &data->scalar[0], &data->scalar[1]);
-    }
-    CHECK(overflow >= 0);
-    CHECK(bits <= 256*iters);
-}
-
-static void bench_sha256(void* arg, int iters) {
+void bench_group_add_affine_var(void* arg) {
     int i;
-    bench_inv *data = (bench_inv*)arg;
-    secp256k1_sha256 sha;
+    bench_inv_t *data = (bench_inv_t*)arg;
 
-    for (i = 0; i < iters; i++) {
+    for (i = 0; i < 200000; i++) {
+        secp256k1_gej_add_ge_var(&data->gej_x, &data->gej_x, &data->ge_y, NULL);
+    }
+}
+
+void bench_group_jacobi_var(void* arg) {
+    int i;
+    bench_inv_t *data = (bench_inv_t*)arg;
+
+    for (i = 0; i < 20000; i++) {
+        secp256k1_gej_has_quad_y_var(&data->gej_x);
+    }
+}
+
+void bench_ecmult_wnaf(void* arg) {
+    int i;
+    bench_inv_t *data = (bench_inv_t*)arg;
+
+    for (i = 0; i < 20000; i++) {
+        secp256k1_ecmult_wnaf(data->wnaf, 256, &data->scalar_x, WINDOW_A);
+        secp256k1_scalar_add(&data->scalar_x, &data->scalar_x, &data->scalar_y);
+    }
+}
+
+void bench_wnaf_const(void* arg) {
+    int i;
+    bench_inv_t *data = (bench_inv_t*)arg;
+
+    for (i = 0; i < 20000; i++) {
+        secp256k1_wnaf_const(data->wnaf, data->scalar_x, WINDOW_A, 256, 1);
+        secp256k1_scalar_add(&data->scalar_x, &data->scalar_x, &data->scalar_y);
+    }
+}
+
+
+void bench_sha256(void* arg) {
+    int i;
+    bench_inv_t *data = (bench_inv_t*)arg;
+    secp256k1_sha256_t sha;
+
+    for (i = 0; i < 20000; i++) {
         secp256k1_sha256_initialize(&sha);
         secp256k1_sha256_write(&sha, data->data, 32);
         secp256k1_sha256_finalize(&sha, data->data);
     }
 }
 
-static void bench_hmac_sha256(void* arg, int iters) {
+void bench_hmac_sha256(void* arg) {
     int i;
-    bench_inv *data = (bench_inv*)arg;
-    secp256k1_hmac_sha256 hmac;
+    bench_inv_t *data = (bench_inv_t*)arg;
+    secp256k1_hmac_sha256_t hmac;
 
-    for (i = 0; i < iters; i++) {
+    for (i = 0; i < 20000; i++) {
         secp256k1_hmac_sha256_initialize(&hmac, data->data, 32);
         secp256k1_hmac_sha256_write(&hmac, data->data, 32);
         secp256k1_hmac_sha256_finalize(&hmac, data->data);
     }
 }
 
-static void bench_rfc6979_hmac_sha256(void* arg, int iters) {
+void bench_rfc6979_hmac_sha256(void* arg) {
     int i;
-    bench_inv *data = (bench_inv*)arg;
-    secp256k1_rfc6979_hmac_sha256 rng;
+    bench_inv_t *data = (bench_inv_t*)arg;
+    secp256k1_rfc6979_hmac_sha256_t rng;
 
-    for (i = 0; i < iters; i++) {
+    for (i = 0; i < 20000; i++) {
         secp256k1_rfc6979_hmac_sha256_initialize(&rng, data->data, 64);
         secp256k1_rfc6979_hmac_sha256_generate(&rng, data->data, 32);
     }
 }
 
-static void bench_context(void* arg, int iters) {
+void bench_context_verify(void* arg) {
     int i;
     (void)arg;
-    for (i = 0; i < iters; i++) {
-        secp256k1_context_destroy(secp256k1_context_create(SECP256K1_CONTEXT_NONE));
+    for (i = 0; i < 20; i++) {
+        secp256k1_context_destroy(secp256k1_context_create(SECP256K1_CONTEXT_VERIFY));
     }
 }
 
+void bench_context_sign(void* arg) {
+    int i;
+    (void)arg;
+    for (i = 0; i < 200; i++) {
+        secp256k1_context_destroy(secp256k1_context_create(SECP256K1_CONTEXT_SIGN));
+    }
+}
+
+#ifndef USE_NUM_NONE
+void bench_num_jacobi(void* arg) {
+    int i;
+    bench_inv_t *data = (bench_inv_t*)arg;
+    secp256k1_num nx, norder;
+
+    secp256k1_scalar_get_num(&nx, &data->scalar_x);
+    secp256k1_scalar_order_get_num(&norder);
+    secp256k1_scalar_get_num(&norder, &data->scalar_y);
+
+    for (i = 0; i < 200000; i++) {
+        secp256k1_num_jacobi(&nx, &norder);
+    }
+}
+#endif
+
+int have_flag(int argc, char** argv, char *flag) {
+    char** argm = argv + argc;
+    argv++;
+    if (argv == argm) {
+        return 1;
+    }
+    while (argv != NULL && argv != argm) {
+        if (strcmp(*argv, flag) == 0) {
+            return 1;
+        }
+        argv++;
+    }
+    return 0;
+}
+
 int main(int argc, char **argv) {
-    bench_inv data;
-    int default_iters = 20000;
-    int iters = get_iters(default_iters);
-    int d = argc == 1; /* default */
+    bench_inv_t data;
+    if (have_flag(argc, argv, "scalar") || have_flag(argc, argv, "add")) run_benchmark("scalar_add", bench_scalar_add, bench_setup, NULL, &data, 10, 2000000);
+    if (have_flag(argc, argv, "scalar") || have_flag(argc, argv, "negate")) run_benchmark("scalar_negate", bench_scalar_negate, bench_setup, NULL, &data, 10, 2000000);
+    if (have_flag(argc, argv, "scalar") || have_flag(argc, argv, "sqr")) run_benchmark("scalar_sqr", bench_scalar_sqr, bench_setup, NULL, &data, 10, 200000);
+    if (have_flag(argc, argv, "scalar") || have_flag(argc, argv, "mul")) run_benchmark("scalar_mul", bench_scalar_mul, bench_setup, NULL, &data, 10, 200000);
+#ifdef USE_ENDOMORPHISM
+    if (have_flag(argc, argv, "scalar") || have_flag(argc, argv, "split")) run_benchmark("scalar_split", bench_scalar_split, bench_setup, NULL, &data, 10, 20000);
+#endif
+    if (have_flag(argc, argv, "scalar") || have_flag(argc, argv, "inverse")) run_benchmark("scalar_inverse", bench_scalar_inverse, bench_setup, NULL, &data, 10, 2000);
+    if (have_flag(argc, argv, "scalar") || have_flag(argc, argv, "inverse")) run_benchmark("scalar_inverse_var", bench_scalar_inverse_var, bench_setup, NULL, &data, 10, 2000);
 
-    if (argc > 1) {
-        if (have_flag(argc, argv, "-h")
-           || have_flag(argc, argv, "--help")
-           || have_flag(argc, argv, "help")) {
-            help(default_iters);
-            return 0;
-        }
-    }
+    if (have_flag(argc, argv, "field") || have_flag(argc, argv, "normalize")) run_benchmark("field_normalize", bench_field_normalize, bench_setup, NULL, &data, 10, 2000000);
+    if (have_flag(argc, argv, "field") || have_flag(argc, argv, "normalize")) run_benchmark("field_normalize_weak", bench_field_normalize_weak, bench_setup, NULL, &data, 10, 2000000);
+    if (have_flag(argc, argv, "field") || have_flag(argc, argv, "sqr")) run_benchmark("field_sqr", bench_field_sqr, bench_setup, NULL, &data, 10, 200000);
+    if (have_flag(argc, argv, "field") || have_flag(argc, argv, "mul")) run_benchmark("field_mul", bench_field_mul, bench_setup, NULL, &data, 10, 200000);
+    if (have_flag(argc, argv, "field") || have_flag(argc, argv, "inverse")) run_benchmark("field_inverse", bench_field_inverse, bench_setup, NULL, &data, 10, 20000);
+    if (have_flag(argc, argv, "field") || have_flag(argc, argv, "inverse")) run_benchmark("field_inverse_var", bench_field_inverse_var, bench_setup, NULL, &data, 10, 20000);
+    if (have_flag(argc, argv, "field") || have_flag(argc, argv, "sqrt")) run_benchmark("field_sqrt", bench_field_sqrt, bench_setup, NULL, &data, 10, 20000);
 
-    print_output_table_header_row();
+    if (have_flag(argc, argv, "group") || have_flag(argc, argv, "double")) run_benchmark("group_double_var", bench_group_double_var, bench_setup, NULL, &data, 10, 200000);
+    if (have_flag(argc, argv, "group") || have_flag(argc, argv, "add")) run_benchmark("group_add_var", bench_group_add_var, bench_setup, NULL, &data, 10, 200000);
+    if (have_flag(argc, argv, "group") || have_flag(argc, argv, "add")) run_benchmark("group_add_affine", bench_group_add_affine, bench_setup, NULL, &data, 10, 200000);
+    if (have_flag(argc, argv, "group") || have_flag(argc, argv, "add")) run_benchmark("group_add_affine_var", bench_group_add_affine_var, bench_setup, NULL, &data, 10, 200000);
+    if (have_flag(argc, argv, "group") || have_flag(argc, argv, "jacobi")) run_benchmark("group_jacobi_var", bench_group_jacobi_var, bench_setup, NULL, &data, 10, 20000);
 
-    if (d || have_flag(argc, argv, "scalar") || have_flag(argc, argv, "half")) run_benchmark("scalar_half", bench_scalar_half, bench_setup, NULL, &data, 10, iters*100);
-    if (d || have_flag(argc, argv, "scalar") || have_flag(argc, argv, "add")) run_benchmark("scalar_add", bench_scalar_add, bench_setup, NULL, &data, 10, iters*100);
-    if (d || have_flag(argc, argv, "scalar") || have_flag(argc, argv, "negate")) run_benchmark("scalar_negate", bench_scalar_negate, bench_setup, NULL, &data, 10, iters*100);
-    if (d || have_flag(argc, argv, "scalar") || have_flag(argc, argv, "sqr")) run_benchmark("scalar_sqr", bench_scalar_sqr, bench_setup, NULL, &data, 10, iters*10);
-    if (d || have_flag(argc, argv, "scalar") || have_flag(argc, argv, "mul")) run_benchmark("scalar_mul", bench_scalar_mul, bench_setup, NULL, &data, 10, iters*10);
-    if (d || have_flag(argc, argv, "scalar") || have_flag(argc, argv, "split")) run_benchmark("scalar_split", bench_scalar_split, bench_setup, NULL, &data, 10, iters);
-    if (d || have_flag(argc, argv, "scalar") || have_flag(argc, argv, "inverse")) run_benchmark("scalar_inverse", bench_scalar_inverse, bench_setup, NULL, &data, 10, iters);
-    if (d || have_flag(argc, argv, "scalar") || have_flag(argc, argv, "inverse")) run_benchmark("scalar_inverse_var", bench_scalar_inverse_var, bench_setup, NULL, &data, 10, iters);
+    if (have_flag(argc, argv, "ecmult") || have_flag(argc, argv, "wnaf")) run_benchmark("wnaf_const", bench_wnaf_const, bench_setup, NULL, &data, 10, 20000);
+    if (have_flag(argc, argv, "ecmult") || have_flag(argc, argv, "wnaf")) run_benchmark("ecmult_wnaf", bench_ecmult_wnaf, bench_setup, NULL, &data, 10, 20000);
 
-    if (d || have_flag(argc, argv, "field") || have_flag(argc, argv, "half")) run_benchmark("field_half", bench_field_half, bench_setup, NULL, &data, 10, iters*100);
-    if (d || have_flag(argc, argv, "field") || have_flag(argc, argv, "normalize")) run_benchmark("field_normalize", bench_field_normalize, bench_setup, NULL, &data, 10, iters*100);
-    if (d || have_flag(argc, argv, "field") || have_flag(argc, argv, "normalize")) run_benchmark("field_normalize_weak", bench_field_normalize_weak, bench_setup, NULL, &data, 10, iters*100);
-    if (d || have_flag(argc, argv, "field") || have_flag(argc, argv, "sqr")) run_benchmark("field_sqr", bench_field_sqr, bench_setup, NULL, &data, 10, iters*10);
-    if (d || have_flag(argc, argv, "field") || have_flag(argc, argv, "mul")) run_benchmark("field_mul", bench_field_mul, bench_setup, NULL, &data, 10, iters*10);
-    if (d || have_flag(argc, argv, "field") || have_flag(argc, argv, "inverse")) run_benchmark("field_inverse", bench_field_inverse, bench_setup, NULL, &data, 10, iters);
-    if (d || have_flag(argc, argv, "field") || have_flag(argc, argv, "inverse")) run_benchmark("field_inverse_var", bench_field_inverse_var, bench_setup, NULL, &data, 10, iters);
-    if (d || have_flag(argc, argv, "field") || have_flag(argc, argv, "issquare")) run_benchmark("field_is_square_var", bench_field_is_square_var, bench_setup, NULL, &data, 10, iters);
-    if (d || have_flag(argc, argv, "field") || have_flag(argc, argv, "sqrt")) run_benchmark("field_sqrt", bench_field_sqrt, bench_setup, NULL, &data, 10, iters);
+    if (have_flag(argc, argv, "hash") || have_flag(argc, argv, "sha256")) run_benchmark("hash_sha256", bench_sha256, bench_setup, NULL, &data, 10, 20000);
+    if (have_flag(argc, argv, "hash") || have_flag(argc, argv, "hmac")) run_benchmark("hash_hmac_sha256", bench_hmac_sha256, bench_setup, NULL, &data, 10, 20000);
+    if (have_flag(argc, argv, "hash") || have_flag(argc, argv, "rng6979")) run_benchmark("hash_rfc6979_hmac_sha256", bench_rfc6979_hmac_sha256, bench_setup, NULL, &data, 10, 20000);
 
-    if (d || have_flag(argc, argv, "group") || have_flag(argc, argv, "double")) run_benchmark("group_double_var", bench_group_double_var, bench_setup, NULL, &data, 10, iters*10);
-    if (d || have_flag(argc, argv, "group") || have_flag(argc, argv, "add")) run_benchmark("group_add_var", bench_group_add_var, bench_setup, NULL, &data, 10, iters*10);
-    if (d || have_flag(argc, argv, "group") || have_flag(argc, argv, "add")) run_benchmark("group_add_affine", bench_group_add_affine, bench_setup, NULL, &data, 10, iters*10);
-    if (d || have_flag(argc, argv, "group") || have_flag(argc, argv, "add")) run_benchmark("group_add_affine_var", bench_group_add_affine_var, bench_setup, NULL, &data, 10, iters*10);
-    if (d || have_flag(argc, argv, "group") || have_flag(argc, argv, "jacobi")) run_benchmark("group_jacobi_var", bench_group_jacobi_var, bench_setup, NULL, &data, 10, iters);
-    if (d || have_flag(argc, argv, "group") || have_flag(argc, argv, "add")) run_benchmark("group_add_zinv_var", bench_group_add_zinv_var, bench_setup, NULL, &data, 10, iters*10);
-    if (d || have_flag(argc, argv, "group") || have_flag(argc, argv, "to_affine")) run_benchmark("group_to_affine_var", bench_group_to_affine_var, bench_setup, NULL, &data, 10, iters);
-
-    if (d || have_flag(argc, argv, "ecmult") || have_flag(argc, argv, "wnaf")) run_benchmark("ecmult_wnaf", bench_ecmult_wnaf, bench_setup, NULL, &data, 10, iters);
-
-    if (d || have_flag(argc, argv, "hash") || have_flag(argc, argv, "sha256")) run_benchmark("hash_sha256", bench_sha256, bench_setup, NULL, &data, 10, iters);
-    if (d || have_flag(argc, argv, "hash") || have_flag(argc, argv, "hmac")) run_benchmark("hash_hmac_sha256", bench_hmac_sha256, bench_setup, NULL, &data, 10, iters);
-    if (d || have_flag(argc, argv, "hash") || have_flag(argc, argv, "rng6979")) run_benchmark("hash_rfc6979_hmac_sha256", bench_rfc6979_hmac_sha256, bench_setup, NULL, &data, 10, iters);
-
-    if (d || have_flag(argc, argv, "context")) run_benchmark("context_create", bench_context, bench_setup, NULL, &data, 10, iters);
+    if (have_flag(argc, argv, "context") || have_flag(argc, argv, "verify")) run_benchmark("context_verify", bench_context_verify, bench_setup, NULL, &data, 10, 20);
+    if (have_flag(argc, argv, "context") || have_flag(argc, argv, "sign")) run_benchmark("context_sign", bench_context_sign, bench_setup, NULL, &data, 10, 200);
 
+#ifndef USE_NUM_NONE
+    if (have_flag(argc, argv, "num") || have_flag(argc, argv, "jacobi")) run_benchmark("num_jacobi", bench_num_jacobi, bench_setup, NULL, &data, 10, 200000);
+#endif
     return 0;
 }

src/bench_rangeproof.c

@@ -6,7 +6,7 @@
 
 #include <stdint.h>
 
-#include "../include/secp256k1_rangeproof.h"
+#include "include/secp256k1_rangeproof.h"
 #include "util.h"
 #include "bench.h"
 
@@ -34,11 +34,11 @@ static void bench_rangeproof_setup(void* arg) {
     CHECK(secp256k1_rangeproof_verify(data->ctx, &minv, &maxv, &data->commit, data->proof, data->len, NULL, 0, secp256k1_generator_h));
 }
 
-static void bench_rangeproof(void* arg, int iters) {
+static void bench_rangeproof(void* arg) {
     int i;
     bench_rangeproof_t *data = (bench_rangeproof_t*)arg;
 
-    for (i = 0; i < iters/data->min_bits; i++) {
+    for (i = 0; i < 1000; i++) {
         int j;
         uint64_t minv;
         uint64_t maxv;
@@ -51,14 +51,12 @@ static void bench_rangeproof(void* arg, int iters) {
 
 int main(void) {
     bench_rangeproof_t data;
-    int iters;
 
-    data.ctx = secp256k1_context_create(SECP256K1_CONTEXT_NONE);
+    data.ctx = secp256k1_context_create(SECP256K1_CONTEXT_SIGN | SECP256K1_CONTEXT_VERIFY);
 
     data.min_bits = 32;
-    iters = data.min_bits*get_iters(32);
 
-    run_benchmark("rangeproof_verify_bit", bench_rangeproof, bench_rangeproof_setup, NULL, &data, 10, iters);
+    run_benchmark("rangeproof_verify_bit", bench_rangeproof, bench_rangeproof_setup, NULL, &data, 10, 1000 * data.min_bits);
 
     secp256k1_context_destroy(data.ctx);
     return 0;

src/bench_recover.c

@@ -1,27 +1,27 @@
-/***********************************************************************
- * Copyright (c) 2014-2015 Pieter Wuille                               *
- * Distributed under the MIT software license, see the accompanying    *
- * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
- ***********************************************************************/
+/**********************************************************************
+ * Copyright (c) 2014-2015 Pieter Wuille                              *
+ * Distributed under the MIT software license, see the accompanying   *
+ * file COPYING or http://www.opensource.org/licenses/mit-license.php.*
+ **********************************************************************/
 
-#ifndef SECP256K1_MODULE_RECOVERY_BENCH_H
-#define SECP256K1_MODULE_RECOVERY_BENCH_H
-
-#include "../../../include/secp256k1_recovery.h"
+#include "include/secp256k1.h"
+#include "include/secp256k1_recovery.h"
+#include "util.h"
+#include "bench.h"
 
 typedef struct {
     secp256k1_context *ctx;
     unsigned char msg[32];
     unsigned char sig[64];
-} bench_recover_data;
+} bench_recover_t;
 
-static void bench_recover(void* arg, int iters) {
+void bench_recover(void* arg) {
     int i;
-    bench_recover_data *data = (bench_recover_data*)arg;
+    bench_recover_t *data = (bench_recover_t*)arg;
     secp256k1_pubkey pubkey;
     unsigned char pubkeyc[33];
 
-    for (i = 0; i < iters; i++) {
+    for (i = 0; i < 20000; i++) {
         int j;
         size_t pubkeylen = 33;
         secp256k1_ecdsa_recoverable_signature sig;
@@ -36,9 +36,9 @@ static void bench_recover(void* arg, int iters) {
     }
 }
 
-static void bench_recover_setup(void* arg) {
+void bench_recover_setup(void* arg) {
     int i;
-    bench_recover_data *data = (bench_recover_data*)arg;
+    bench_recover_t *data = (bench_recover_t*)arg;
 
     for (i = 0; i < 32; i++) {
         data->msg[i] = 1 + i;
@@ -48,15 +48,13 @@ static void bench_recover_setup(void* arg) {
     }
 }
 
-static void run_recovery_bench(int iters, int argc, char** argv) {
-    bench_recover_data data;
-    int d = argc == 1;
+int main(void) {
+    bench_recover_t data;
 
-    data.ctx = secp256k1_context_create(SECP256K1_CONTEXT_NONE);
+    data.ctx = secp256k1_context_create(SECP256K1_CONTEXT_VERIFY);
 
-    if (d || have_flag(argc, argv, "ecdsa") || have_flag(argc, argv, "recover") || have_flag(argc, argv, "ecdsa_recover")) run_benchmark("ecdsa_recover", bench_recover, bench_recover_setup, NULL, &data, 10, iters);
+    run_benchmark("ecdsa_recover", bench_recover, bench_recover_setup, NULL, &data, 10, 20000);
 
     secp256k1_context_destroy(data.ctx);
+    return 0;
 }
-
-#endif /* SECP256K1_MODULE_RECOVERY_BENCH_H */

src/bench_schnorr_verify.c

@@ -0,0 +1,73 @@
+/**********************************************************************
+ * Copyright (c) 2014 Pieter Wuille                                   *
+ * Distributed under the MIT software license, see the accompanying   *
+ * file COPYING or http://www.opensource.org/licenses/mit-license.php.*
+ **********************************************************************/
+
+#include <stdio.h>
+#include <string.h>
+
+#include "include/secp256k1.h"
+#include "include/secp256k1_schnorr.h"
+#include "util.h"
+#include "bench.h"
+
+typedef struct {
+    unsigned char key[32];
+    unsigned char sig[64];
+    unsigned char pubkey[33];
+    size_t pubkeylen;
+} benchmark_schnorr_sig_t;
+
+typedef struct {
+    secp256k1_context *ctx;
+    unsigned char msg[32];
+    benchmark_schnorr_sig_t sigs[64];
+    int numsigs;
+} benchmark_schnorr_verify_t;
+
+static void benchmark_schnorr_init(void* arg) {
+    int i, k;
+    benchmark_schnorr_verify_t* data = (benchmark_schnorr_verify_t*)arg;
+
+    for (i = 0; i < 32; i++) {
+        data->msg[i] = 1 + i;
+    }
+    for (k = 0; k < data->numsigs; k++) {
+        secp256k1_pubkey pubkey;
+        for (i = 0; i < 32; i++) {
+            data->sigs[k].key[i] = 33 + i + k;
+        }
+        secp256k1_schnorr_sign(data->ctx, data->sigs[k].sig, data->msg, data->sigs[k].key, NULL, NULL);
+        data->sigs[k].pubkeylen = 33;
+        CHECK(secp256k1_ec_pubkey_create(data->ctx, &pubkey, data->sigs[k].key));
+        CHECK(secp256k1_ec_pubkey_serialize(data->ctx, data->sigs[k].pubkey, &data->sigs[k].pubkeylen, &pubkey, SECP256K1_EC_COMPRESSED));
+    }
+}
+
+static void benchmark_schnorr_verify(void* arg) {
+    int i;
+    benchmark_schnorr_verify_t* data = (benchmark_schnorr_verify_t*)arg;
+
+    for (i = 0; i < 20000 / data->numsigs; i++) {
+        secp256k1_pubkey pubkey;
+        data->sigs[0].sig[(i >> 8) % 64] ^= (i & 0xFF);
+        CHECK(secp256k1_ec_pubkey_parse(data->ctx, &pubkey, data->sigs[0].pubkey, data->sigs[0].pubkeylen));
+        CHECK(secp256k1_schnorr_verify(data->ctx, data->sigs[0].sig, data->msg, &pubkey) == ((i & 0xFF) == 0));
+        data->sigs[0].sig[(i >> 8) % 64] ^= (i & 0xFF);
+    }
+}
+
+
+
+int main(void) {
+    benchmark_schnorr_verify_t data;
+
+    data.ctx = secp256k1_context_create(SECP256K1_CONTEXT_SIGN | SECP256K1_CONTEXT_VERIFY);
+
+    data.numsigs = 1;
+    run_benchmark("schnorr_verify", benchmark_schnorr_verify, benchmark_schnorr_init, NULL, &data, 10, 20000);
+
+    secp256k1_context_destroy(data.ctx);
+    return 0;
+}

src/bench_sign.c

@@ -0,0 +1,56 @@
+/**********************************************************************
+ * Copyright (c) 2014 Pieter Wuille                                   *
+ * Distributed under the MIT software license, see the accompanying   *
+ * file COPYING or http://www.opensource.org/licenses/mit-license.php.*
+ **********************************************************************/
+
+#include "include/secp256k1.h"
+#include "util.h"
+#include "bench.h"
+
+typedef struct {
+    secp256k1_context* ctx;
+    unsigned char msg[32];
+    unsigned char key[32];
+} bench_sign_t;
+
+static void bench_sign_setup(void* arg) {
+    int i;
+    bench_sign_t *data = (bench_sign_t*)arg;
+
+    for (i = 0; i < 32; i++) {
+        data->msg[i] = i + 1;
+    }
+    for (i = 0; i < 32; i++) {
+        data->key[i] = i + 65;
+    }
+}
+
+static void bench_sign(void* arg) {
+    int i;
+    bench_sign_t *data = (bench_sign_t*)arg;
+
+    unsigned char sig[74];
+    for (i = 0; i < 20000; i++) {
+        size_t siglen = 74;
+        int j;
+        secp256k1_ecdsa_signature signature;
+        CHECK(secp256k1_ecdsa_sign(data->ctx, &signature, data->msg, data->key, NULL, NULL));
+        CHECK(secp256k1_ecdsa_signature_serialize_der(data->ctx, sig, &siglen, &signature));
+        for (j = 0; j < 32; j++) {
+            data->msg[j] = sig[j];
+            data->key[j] = sig[j + 32];
+        }
+    }
+}
+
+int main(void) {
+    bench_sign_t data;
+
+    data.ctx = secp256k1_context_create(SECP256K1_CONTEXT_SIGN);
+
+    run_benchmark("ecdsa_sign", bench_sign, bench_sign_setup, NULL, &data, 10, 20000);
+
+    secp256k1_context_destroy(data.ctx);
+    return 0;
+}

src/bench_verify.c

@@ -0,0 +1,112 @@
+/**********************************************************************
+ * Copyright (c) 2014 Pieter Wuille                                   *
+ * Distributed under the MIT software license, see the accompanying   *
+ * file COPYING or http://www.opensource.org/licenses/mit-license.php.*
+ **********************************************************************/
+
+#include <stdio.h>
+#include <string.h>
+
+#include "include/secp256k1.h"
+#include "util.h"
+#include "bench.h"
+
+#ifdef ENABLE_OPENSSL_TESTS
+#include <openssl/bn.h>
+#include <openssl/ecdsa.h>
+#include <openssl/obj_mac.h>
+#endif
+
+typedef struct {
+    secp256k1_context *ctx;
+    unsigned char msg[32];
+    unsigned char key[32];
+    unsigned char sig[72];
+    size_t siglen;
+    unsigned char pubkey[33];
+    size_t pubkeylen;
+#ifdef ENABLE_OPENSSL_TESTS
+    EC_GROUP* ec_group;
+#endif
+} benchmark_verify_t;
+
+static void benchmark_verify(void* arg) {
+    int i;
+    benchmark_verify_t* data = (benchmark_verify_t*)arg;
+
+    for (i = 0; i < 20000; i++) {
+        secp256k1_pubkey pubkey;
+        secp256k1_ecdsa_signature sig;
+        data->sig[data->siglen - 1] ^= (i & 0xFF);
+        data->sig[data->siglen - 2] ^= ((i >> 8) & 0xFF);
+        data->sig[data->siglen - 3] ^= ((i >> 16) & 0xFF);
+        CHECK(secp256k1_ec_pubkey_parse(data->ctx, &pubkey, data->pubkey, data->pubkeylen) == 1);
+        CHECK(secp256k1_ecdsa_signature_parse_der(data->ctx, &sig, data->sig, data->siglen) == 1);
+        CHECK(secp256k1_ecdsa_verify(data->ctx, &sig, data->msg, &pubkey) == (i == 0));
+        data->sig[data->siglen - 1] ^= (i & 0xFF);
+        data->sig[data->siglen - 2] ^= ((i >> 8) & 0xFF);
+        data->sig[data->siglen - 3] ^= ((i >> 16) & 0xFF);
+    }
+}
+
+#ifdef ENABLE_OPENSSL_TESTS
+static void benchmark_verify_openssl(void* arg) {
+    int i;
+    benchmark_verify_t* data = (benchmark_verify_t*)arg;
+
+    for (i = 0; i < 20000; i++) {
+        data->sig[data->siglen - 1] ^= (i & 0xFF);
+        data->sig[data->siglen - 2] ^= ((i >> 8) & 0xFF);
+        data->sig[data->siglen - 3] ^= ((i >> 16) & 0xFF);
+        {
+            EC_KEY *pkey = EC_KEY_new();
+            const unsigned char *pubkey = &data->pubkey[0];
+            int result;
+
+            CHECK(pkey != NULL);
+            result = EC_KEY_set_group(pkey, data->ec_group);
+            CHECK(result);
+            result = (o2i_ECPublicKey(&pkey, &pubkey, data->pubkeylen)) != NULL;
+            CHECK(result);
+            result = ECDSA_verify(0, &data->msg[0], sizeof(data->msg), &data->sig[0], data->siglen, pkey) == (i == 0);
+            CHECK(result);
+            EC_KEY_free(pkey);
+        }
+        data->sig[data->siglen - 1] ^= (i & 0xFF);
+        data->sig[data->siglen - 2] ^= ((i >> 8) & 0xFF);
+        data->sig[data->siglen - 3] ^= ((i >> 16) & 0xFF);
+    }
+}
+#endif
+
+int main(void) {
+    int i;
+    secp256k1_pubkey pubkey;
+    secp256k1_ecdsa_signature sig;
+    benchmark_verify_t data;
+
+    data.ctx = secp256k1_context_create(SECP256K1_CONTEXT_SIGN | SECP256K1_CONTEXT_VERIFY);
+
+    for (i = 0; i < 32; i++) {
+        data.msg[i] = 1 + i;
+    }
+    for (i = 0; i < 32; i++) {
+        data.key[i] = 33 + i;
+    }
+    data.siglen = 72;
+    CHECK(secp256k1_ecdsa_sign(data.ctx, &sig, data.msg, data.key, NULL, NULL));
+    CHECK(secp256k1_ecdsa_signature_serialize_der(data.ctx, data.sig, &data.siglen, &sig));
+    CHECK(secp256k1_ec_pubkey_create(data.ctx, &pubkey, data.key));
+    data.pubkeylen = 33;
+    CHECK(secp256k1_ec_pubkey_serialize(data.ctx, data.pubkey, &data.pubkeylen, &pubkey, SECP256K1_EC_COMPRESSED) == 1);
+
+    run_benchmark("ecdsa_verify", benchmark_verify, NULL, NULL, &data, 10, 20000);
+#ifdef ENABLE_OPENSSL_TESTS
+    data.ec_group = EC_GROUP_new_by_curve_name(NID_secp256k1);
+    run_benchmark("ecdsa_verify_openssl", benchmark_verify_openssl, NULL, NULL, &data, 10, 20000);
+    EC_GROUP_free(data.ec_group);
+#endif
+
+    secp256k1_context_destroy(data.ctx);
+    return 0;
+}

src/bench_whitelist.c

@@ -1,108 +0,0 @@
-/**********************************************************************
- * Copyright (c) 2017 Jonas Nick                                      *
- * Distributed under the MIT software license, see the accompanying   *
- * file COPYING or http://www.opensource.org/licenses/mit-license.php.*
- **********************************************************************/
-#include <stdio.h>
-
-#include "../include/secp256k1.h"
-
-#include "../include/secp256k1_whitelist.h"
-#include "util.h"
-#include "bench.h"
-#include "hash_impl.h"
-#include "int128_impl.h"
-#include "scalar_impl.h"
-#include "testrand_impl.h"
-
-#define MAX_N_KEYS 30
-
-typedef struct {
-    secp256k1_context* ctx;
-    unsigned char online_seckey[MAX_N_KEYS][32];
-    unsigned char summed_seckey[MAX_N_KEYS][32];
-    secp256k1_pubkey online_pubkeys[MAX_N_KEYS];
-    secp256k1_pubkey offline_pubkeys[MAX_N_KEYS];
-    unsigned char csub[32];
-    secp256k1_pubkey sub_pubkey;
-    secp256k1_whitelist_signature sig;
-    size_t n_keys;
-} bench_data;
-
-static void bench_whitelist(void* arg, int iters) {
-    bench_data* data = (bench_data*)arg;
-    int i;
-    for (i = 0; i < iters; i++) {
-        CHECK(secp256k1_whitelist_verify(data->ctx, &data->sig, data->online_pubkeys, data->offline_pubkeys, data->n_keys, &data->sub_pubkey) == 1);
-    }
-}
-
-static void bench_whitelist_setup(void* arg) {
-    bench_data* data = (bench_data*)arg;
-    int i = 0;
-    CHECK(secp256k1_whitelist_sign(data->ctx, &data->sig, data->online_pubkeys, data->offline_pubkeys, data->n_keys, &data->sub_pubkey, data->online_seckey[i], data->summed_seckey[i], i));
-}
-
-static void run_test(bench_data* data, int iters) {
-    char str[32];
-    sprintf(str, "whitelist_%i", (int)data->n_keys);
-    run_benchmark(str, bench_whitelist, bench_whitelist_setup, NULL, data, 100, iters);
-}
-
-static void random_scalar_order(secp256k1_scalar *num) {
-    do {
-        unsigned char b32[32];
-        int overflow = 0;
-        secp256k1_testrand256(b32);
-        secp256k1_scalar_set_b32(num, b32, &overflow);
-        if (overflow || secp256k1_scalar_is_zero(num)) {
-            continue;
-        }
-        break;
-    } while(1);
-}
-
-int main(void) {
-    bench_data data;
-    size_t i;
-    size_t n_keys = 30;
-    secp256k1_scalar ssub;
-    int iters = get_iters(5);
-
-    data.ctx = secp256k1_context_create(SECP256K1_CONTEXT_NONE);
-
-    /* Start with subkey */
-    random_scalar_order(&ssub);
-    secp256k1_scalar_get_b32(data.csub, &ssub);
-    CHECK(secp256k1_ec_seckey_verify(data.ctx, data.csub) == 1);
-    CHECK(secp256k1_ec_pubkey_create(data.ctx, &data.sub_pubkey, data.csub) == 1);
-    /* Then offline and online whitelist keys */
-    for (i = 0; i < n_keys; i++) {
-        secp256k1_scalar son, soff;
-
-        /* Create two keys */
-        random_scalar_order(&son);
-        secp256k1_scalar_get_b32(data.online_seckey[i], &son);
-        CHECK(secp256k1_ec_seckey_verify(data.ctx, data.online_seckey[i]) == 1);
-        CHECK(secp256k1_ec_pubkey_create(data.ctx, &data.online_pubkeys[i], data.online_seckey[i]) == 1);
-
-        random_scalar_order(&soff);
-        secp256k1_scalar_get_b32(data.summed_seckey[i], &soff);
-        CHECK(secp256k1_ec_seckey_verify(data.ctx, data.summed_seckey[i]) == 1);
-        CHECK(secp256k1_ec_pubkey_create(data.ctx, &data.offline_pubkeys[i], data.summed_seckey[i]) == 1);
-
-        /* Make summed_seckey correspond to the sum of offline_pubkey and sub_pubkey */
-        secp256k1_scalar_add(&soff, &soff, &ssub);
-        secp256k1_scalar_get_b32(data.summed_seckey[i], &soff);
-        CHECK(secp256k1_ec_seckey_verify(data.ctx, data.summed_seckey[i]) == 1);
-    }
-
-    /* Run test */
-    for (i = 1; i <= n_keys; ++i) {
-        data.n_keys = i;
-        run_test(&data, iters);
-    }
-
-    secp256k1_context_destroy(data.ctx);
-    return(0);
-}

src/checkmem.h

@@ -1,95 +0,0 @@
-/***********************************************************************
- * Copyright (c) 2022 Pieter Wuille                                    *
- * Distributed under the MIT software license, see the accompanying    *
- * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
- ***********************************************************************/
-
-/* The code here is inspired by Kris Kwiatkowski's approach in
- * https://github.com/kriskwiatkowski/pqc/blob/main/src/common/ct_check.h
- * to provide a general interface for memory-checking mechanisms, primarily
- * for constant-time checking.
- */
-
-/* These macros are defined by this header file:
- *
- * - SECP256K1_CHECKMEM_ENABLED:
- *   - 1 if memory-checking integration is available, 0 otherwise.
- *     This is just a compile-time macro. Use the next macro to check it is actually
- *     available at runtime.
- * - SECP256K1_CHECKMEM_RUNNING():
- *   - Acts like a function call, returning 1 if memory checking is available
- *     at runtime.
- * - SECP256K1_CHECKMEM_CHECK(p, len):
- *   - Assert or otherwise fail in case the len-byte memory block pointed to by p is
- *     not considered entirely defined.
- * - SECP256K1_CHECKMEM_CHECK_VERIFY(p, len):
- *   - Like SECP256K1_CHECKMEM_CHECK, but only works in VERIFY mode.
- * - SECP256K1_CHECKMEM_UNDEFINE(p, len):
- *   - marks the len-byte memory block pointed to by p as undefined data (secret data,
- *     in the context of constant-time checking).
- * - SECP256K1_CHECKMEM_DEFINE(p, len):
- *   - marks the len-byte memory pointed to by p as defined data (public data, in the
- *     context of constant-time checking).
- *
- */
-
-#ifndef SECP256K1_CHECKMEM_H
-#define SECP256K1_CHECKMEM_H
-
-/* Define a statement-like macro that ignores the arguments. */
-#define SECP256K1_CHECKMEM_NOOP(p, len) do { (void)(p); (void)(len); } while(0)
-
-/* If compiling under msan, map the SECP256K1_CHECKMEM_* functionality to msan.
- * Choose this preferentially, even when VALGRIND is defined, as msan-compiled
- * binaries can't be run under valgrind anyway. */
-#if defined(__has_feature)
-#  if __has_feature(memory_sanitizer)
-#    include <sanitizer/msan_interface.h>
-#    define SECP256K1_CHECKMEM_ENABLED 1
-#    define SECP256K1_CHECKMEM_UNDEFINE(p, len) __msan_allocated_memory((p), (len))
-#    define SECP256K1_CHECKMEM_DEFINE(p, len) __msan_unpoison((p), (len))
-#    define SECP256K1_CHECKMEM_CHECK(p, len) __msan_check_mem_is_initialized((p), (len))
-#    define SECP256K1_CHECKMEM_RUNNING() (1)
-#  endif
-#endif
-
-/* If valgrind integration is desired (through the VALGRIND define), implement the
- * SECP256K1_CHECKMEM_* macros using valgrind. */
-#if !defined SECP256K1_CHECKMEM_ENABLED
-#  if defined VALGRIND
-#    include <stddef.h>
-#  if defined(__clang__) && defined(__APPLE__)
-#    pragma clang diagnostic push
-#    pragma clang diagnostic ignored "-Wreserved-identifier"
-#  endif
-#    include <valgrind/memcheck.h>
-#  if defined(__clang__) && defined(__APPLE__)
-#    pragma clang diagnostic pop
-#  endif
-#    define SECP256K1_CHECKMEM_ENABLED 1
-#    define SECP256K1_CHECKMEM_UNDEFINE(p, len) VALGRIND_MAKE_MEM_UNDEFINED((p), (len))
-#    define SECP256K1_CHECKMEM_DEFINE(p, len) VALGRIND_MAKE_MEM_DEFINED((p), (len))
-#    define SECP256K1_CHECKMEM_CHECK(p, len) VALGRIND_CHECK_MEM_IS_DEFINED((p), (len))
-     /* VALGRIND_MAKE_MEM_DEFINED returns 0 iff not running on memcheck.
-      * This is more precise than the RUNNING_ON_VALGRIND macro, which
-      * checks for valgrind in general instead of memcheck specifically. */
-#    define SECP256K1_CHECKMEM_RUNNING() (VALGRIND_MAKE_MEM_DEFINED(NULL, 0) != 0)
-#  endif
-#endif
-
-/* As a fall-back, map these macros to dummy statements. */
-#if !defined SECP256K1_CHECKMEM_ENABLED
-#  define SECP256K1_CHECKMEM_ENABLED 0
-#  define SECP256K1_CHECKMEM_UNDEFINE(p, len) SECP256K1_CHECKMEM_NOOP((p), (len))
-#  define SECP256K1_CHECKMEM_DEFINE(p, len) SECP256K1_CHECKMEM_NOOP((p), (len))
-#  define SECP256K1_CHECKMEM_CHECK(p, len) SECP256K1_CHECKMEM_NOOP((p), (len))
-#  define SECP256K1_CHECKMEM_RUNNING() (0)
-#endif
-
-#if defined VERIFY
-#define SECP256K1_CHECKMEM_CHECK_VERIFY(p, len) SECP256K1_CHECKMEM_CHECK((p), (len))
-#else
-#define SECP256K1_CHECKMEM_CHECK_VERIFY(p, len) SECP256K1_CHECKMEM_NOOP((p), (len))
-#endif
-
-#endif /* SECP256K1_CHECKMEM_H */

src/ctime_tests.c

@@ -1,471 +0,0 @@
-/***********************************************************************
- * Copyright (c) 2020 Gregory Maxwell                                  *
- * Distributed under the MIT software license, see the accompanying    *
- * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
- ***********************************************************************/
-
-#include <stdio.h>
-#include <string.h>
-
-#include "../include/secp256k1.h"
-#include "assumptions.h"
-#include "checkmem.h"
-
-#if !SECP256K1_CHECKMEM_ENABLED
-#  error "This tool cannot be compiled without memory-checking interface (valgrind or msan)"
-#endif
-
-#ifdef ENABLE_MODULE_ECDH
-# include "../include/secp256k1_ecdh.h"
-#endif
-
-#ifdef ENABLE_MODULE_RECOVERY
-# include "../include/secp256k1_recovery.h"
-#endif
-
-#ifdef ENABLE_MODULE_EXTRAKEYS
-# include "../include/secp256k1_extrakeys.h"
-#endif
-
-#ifdef ENABLE_MODULE_SCHNORRSIG
-#include "../include/secp256k1_schnorrsig.h"
-#endif
-
-#ifdef ENABLE_MODULE_ELLSWIFT
-#include "../include/secp256k1_ellswift.h"
-#endif
-
-#ifdef ENABLE_MODULE_ECDSA_S2C
-#include "../include/secp256k1_ecdsa_s2c.h"
-#endif
-
-#ifdef ENABLE_MODULE_ECDSA_ADAPTOR
-#include "../include/secp256k1_ecdsa_adaptor.h"
-#endif
-
-#ifdef ENABLE_MODULE_MUSIG
-#include "../include/secp256k1_musig.h"
-#endif
-
-#ifdef ENABLE_MODULE_FROST
-#include "include/secp256k1_frost.h"
-#endif
-
-static void run_tests(secp256k1_context *ctx, unsigned char *key);
-
-int main(void) {
-    secp256k1_context* ctx;
-    unsigned char key[32];
-    int ret, i;
-
-    if (!SECP256K1_CHECKMEM_RUNNING()) {
-        fprintf(stderr, "This test can only usefully be run inside valgrind because it was not compiled under msan.\n");
-        fprintf(stderr, "Usage: libtool --mode=execute valgrind ./ctime_tests\n");
-        return 1;
-    }
-    ctx = secp256k1_context_create(SECP256K1_CONTEXT_DECLASSIFY);
-    /** In theory, testing with a single secret input should be sufficient:
-     *  If control flow depended on secrets the tool would generate an error.
-     */
-    for (i = 0; i < 32; i++) {
-        key[i] = i + 65;
-    }
-
-    run_tests(ctx, key);
-
-    /* Test context randomisation. Do this last because it leaves the context
-     * tainted. */
-    SECP256K1_CHECKMEM_UNDEFINE(key, 32);
-    ret = secp256k1_context_randomize(ctx, key);
-    SECP256K1_CHECKMEM_DEFINE(&ret, sizeof(ret));
-    CHECK(ret);
-
-    secp256k1_context_destroy(ctx);
-    return 0;
-}
-
-static void run_tests(secp256k1_context *ctx, unsigned char *key) {
-    secp256k1_ecdsa_signature signature;
-    secp256k1_pubkey pubkey;
-    size_t siglen = 74;
-    size_t outputlen = 33;
-    int i;
-    int ret;
-    unsigned char msg[32];
-    unsigned char sig[74];
-    unsigned char spubkey[33];
-#ifdef ENABLE_MODULE_RECOVERY
-    secp256k1_ecdsa_recoverable_signature recoverable_signature;
-    int recid;
-#endif
-#ifdef ENABLE_MODULE_EXTRAKEYS
-    secp256k1_keypair keypair;
-#endif
-#ifdef ENABLE_MODULE_ELLSWIFT
-    unsigned char ellswift[64];
-    static const unsigned char prefix[64] = {'t', 'e', 's', 't'};
-#endif
-
-    for (i = 0; i < 32; i++) {
-        msg[i] = i + 1;
-    }
-
-    /* Test keygen. */
-    SECP256K1_CHECKMEM_UNDEFINE(key, 32);
-    ret = secp256k1_ec_pubkey_create(ctx, &pubkey, key);
-    SECP256K1_CHECKMEM_DEFINE(&pubkey, sizeof(secp256k1_pubkey));
-    SECP256K1_CHECKMEM_DEFINE(&ret, sizeof(ret));
-    CHECK(ret);
-    CHECK(secp256k1_ec_pubkey_serialize(ctx, spubkey, &outputlen, &pubkey, SECP256K1_EC_COMPRESSED) == 1);
-
-    /* Test signing. */
-    SECP256K1_CHECKMEM_UNDEFINE(key, 32);
-    ret = secp256k1_ecdsa_sign(ctx, &signature, msg, key, NULL, NULL);
-    SECP256K1_CHECKMEM_DEFINE(&signature, sizeof(secp256k1_ecdsa_signature));
-    SECP256K1_CHECKMEM_DEFINE(&ret, sizeof(ret));
-    CHECK(ret);
-    CHECK(secp256k1_ecdsa_signature_serialize_der(ctx, sig, &siglen, &signature));
-
-#ifdef ENABLE_MODULE_ECDH
-    /* Test ECDH. */
-    SECP256K1_CHECKMEM_UNDEFINE(key, 32);
-    ret = secp256k1_ecdh(ctx, msg, &pubkey, key, NULL, NULL);
-    SECP256K1_CHECKMEM_DEFINE(&ret, sizeof(ret));
-    CHECK(ret == 1);
-#endif
-
-#ifdef ENABLE_MODULE_RECOVERY
-    /* Test signing a recoverable signature. */
-    SECP256K1_CHECKMEM_UNDEFINE(key, 32);
-    ret = secp256k1_ecdsa_sign_recoverable(ctx, &recoverable_signature, msg, key, NULL, NULL);
-    SECP256K1_CHECKMEM_DEFINE(&recoverable_signature, sizeof(recoverable_signature));
-    SECP256K1_CHECKMEM_DEFINE(&ret, sizeof(ret));
-    CHECK(ret);
-    CHECK(secp256k1_ecdsa_recoverable_signature_serialize_compact(ctx, sig, &recid, &recoverable_signature));
-    CHECK(recid >= 0 && recid <= 3);
-#endif
-
-    SECP256K1_CHECKMEM_UNDEFINE(key, 32);
-    ret = secp256k1_ec_seckey_verify(ctx, key);
-    SECP256K1_CHECKMEM_DEFINE(&ret, sizeof(ret));
-    CHECK(ret == 1);
-
-    SECP256K1_CHECKMEM_UNDEFINE(key, 32);
-    ret = secp256k1_ec_seckey_negate(ctx, key);
-    SECP256K1_CHECKMEM_DEFINE(&ret, sizeof(ret));
-    CHECK(ret == 1);
-
-    SECP256K1_CHECKMEM_UNDEFINE(key, 32);
-    SECP256K1_CHECKMEM_UNDEFINE(msg, 32);
-    ret = secp256k1_ec_seckey_tweak_add(ctx, key, msg);
-    SECP256K1_CHECKMEM_DEFINE(&ret, sizeof(ret));
-    CHECK(ret == 1);
-
-    SECP256K1_CHECKMEM_UNDEFINE(key, 32);
-    SECP256K1_CHECKMEM_UNDEFINE(msg, 32);
-    ret = secp256k1_ec_seckey_tweak_mul(ctx, key, msg);
-    SECP256K1_CHECKMEM_DEFINE(&ret, sizeof(ret));
-    CHECK(ret == 1);
-
-    /* Test keypair_create and keypair_xonly_tweak_add. */
-#ifdef ENABLE_MODULE_EXTRAKEYS
-    SECP256K1_CHECKMEM_UNDEFINE(key, 32);
-    ret = secp256k1_keypair_create(ctx, &keypair, key);
-    SECP256K1_CHECKMEM_DEFINE(&ret, sizeof(ret));
-    CHECK(ret == 1);
-
-    /* The tweak is not treated as a secret in keypair_tweak_add */
-    SECP256K1_CHECKMEM_DEFINE(msg, 32);
-    ret = secp256k1_keypair_xonly_tweak_add(ctx, &keypair, msg);
-    SECP256K1_CHECKMEM_DEFINE(&ret, sizeof(ret));
-    CHECK(ret == 1);
-
-    SECP256K1_CHECKMEM_UNDEFINE(key, 32);
-    SECP256K1_CHECKMEM_UNDEFINE(&keypair, sizeof(keypair));
-    ret = secp256k1_keypair_sec(ctx, key, &keypair);
-    SECP256K1_CHECKMEM_DEFINE(&ret, sizeof(ret));
-    CHECK(ret == 1);
-#endif
-
-#ifdef ENABLE_MODULE_SCHNORRSIG
-    SECP256K1_CHECKMEM_UNDEFINE(key, 32);
-    ret = secp256k1_keypair_create(ctx, &keypair, key);
-    SECP256K1_CHECKMEM_DEFINE(&ret, sizeof(ret));
-    CHECK(ret == 1);
-    ret = secp256k1_schnorrsig_sign32(ctx, sig, msg, &keypair, NULL);
-    SECP256K1_CHECKMEM_DEFINE(&ret, sizeof(ret));
-    CHECK(ret == 1);
-#endif
-
-#ifdef ENABLE_MODULE_ELLSWIFT
-    SECP256K1_CHECKMEM_UNDEFINE(key, 32);
-    ret = secp256k1_ellswift_create(ctx, ellswift, key, NULL);
-    SECP256K1_CHECKMEM_DEFINE(&ret, sizeof(ret));
-    CHECK(ret == 1);
-
-    SECP256K1_CHECKMEM_UNDEFINE(key, 32);
-    ret = secp256k1_ellswift_create(ctx, ellswift, key, ellswift);
-    SECP256K1_CHECKMEM_DEFINE(&ret, sizeof(ret));
-    CHECK(ret == 1);
-
-    for (i = 0; i < 2; i++) {
-        SECP256K1_CHECKMEM_UNDEFINE(key, 32);
-        SECP256K1_CHECKMEM_DEFINE(&ellswift, sizeof(ellswift));
-        ret = secp256k1_ellswift_xdh(ctx, msg, ellswift, ellswift, key, i, secp256k1_ellswift_xdh_hash_function_bip324, NULL);
-        SECP256K1_CHECKMEM_DEFINE(&ret, sizeof(ret));
-        CHECK(ret == 1);
-
-        SECP256K1_CHECKMEM_UNDEFINE(key, 32);
-        SECP256K1_CHECKMEM_DEFINE(&ellswift, sizeof(ellswift));
-        ret = secp256k1_ellswift_xdh(ctx, msg, ellswift, ellswift, key, i, secp256k1_ellswift_xdh_hash_function_prefix, (void *)prefix);
-        SECP256K1_CHECKMEM_DEFINE(&ret, sizeof(ret));
-        CHECK(ret == 1);
-    }
-#endif
-
-#ifdef ENABLE_MODULE_ECDSA_S2C
-    {
-        unsigned char s2c_data[32] = {0};
-        unsigned char s2c_data_comm[32] = {0};
-        secp256k1_ecdsa_s2c_opening s2c_opening;
-
-        SECP256K1_CHECKMEM_UNDEFINE(key, 32);
-        SECP256K1_CHECKMEM_UNDEFINE(s2c_data, 32);
-        ret = secp256k1_ecdsa_s2c_sign(ctx, &signature, &s2c_opening, msg, key, s2c_data);
-        SECP256K1_CHECKMEM_DEFINE(&ret, sizeof(ret));
-        CHECK(ret == 1);
-
-        SECP256K1_CHECKMEM_UNDEFINE(s2c_data, 32);
-        ret = secp256k1_ecdsa_anti_exfil_host_commit(ctx, s2c_data_comm, s2c_data);
-        SECP256K1_CHECKMEM_DEFINE(&ret, sizeof(ret));
-        CHECK(ret == 1);
-
-        SECP256K1_CHECKMEM_UNDEFINE(key, 32);
-        SECP256K1_CHECKMEM_UNDEFINE(s2c_data, 32);
-        ret = secp256k1_ecdsa_anti_exfil_signer_commit(ctx, &s2c_opening, msg, key, s2c_data);
-        SECP256K1_CHECKMEM_DEFINE(&ret, sizeof(ret));
-        CHECK(ret == 1);
-    }
-#endif
-
-#ifdef ENABLE_MODULE_ECDSA_ADAPTOR
-    {
-        unsigned char adaptor_sig[162];
-        unsigned char deckey[32];
-        unsigned char expected_deckey[32];
-        secp256k1_pubkey enckey;
-
-        for (i = 0; i < 32; i++) {
-            deckey[i] = i + 2;
-        }
-
-        ret = secp256k1_ec_pubkey_create(ctx, &enckey, deckey);
-        CHECK(ret == 1);
-
-        SECP256K1_CHECKMEM_UNDEFINE(key, 32);
-        ret = secp256k1_ecdsa_adaptor_encrypt(ctx, adaptor_sig, key, &enckey, msg, NULL, NULL);
-        SECP256K1_CHECKMEM_DEFINE(adaptor_sig, sizeof(adaptor_sig));
-        SECP256K1_CHECKMEM_DEFINE(&ret, sizeof(ret));
-        CHECK(ret == 1);
-
-        SECP256K1_CHECKMEM_UNDEFINE(deckey, 32);
-        ret = secp256k1_ecdsa_adaptor_decrypt(ctx, &signature, deckey, adaptor_sig);
-        SECP256K1_CHECKMEM_DEFINE(&ret, sizeof(ret));
-        CHECK(ret == 1);
-
-        SECP256K1_CHECKMEM_UNDEFINE(&signature, 32);
-        ret = secp256k1_ecdsa_adaptor_recover(ctx, expected_deckey, &signature, adaptor_sig, &enckey);
-        SECP256K1_CHECKMEM_DEFINE(expected_deckey, sizeof(expected_deckey));
-        SECP256K1_CHECKMEM_DEFINE(&ret, sizeof(ret));
-        CHECK(ret == 1);
-
-        SECP256K1_CHECKMEM_DEFINE(deckey, sizeof(deckey));
-        ret = secp256k1_memcmp_var(deckey, expected_deckey, sizeof(expected_deckey));
-        SECP256K1_CHECKMEM_DEFINE(&ret, sizeof(ret));
-        CHECK(ret == 0);
-    }
-#endif
-
-#ifdef ENABLE_MODULE_MUSIG
-    {
-        secp256k1_pubkey pk;
-        const secp256k1_pubkey *pk_ptr[1];
-        secp256k1_xonly_pubkey agg_pk;
-        unsigned char session_id[32];
-        secp256k1_musig_secnonce secnonce;
-        secp256k1_musig_pubnonce pubnonce;
-        const secp256k1_musig_pubnonce *pubnonce_ptr[1];
-        secp256k1_musig_aggnonce aggnonce;
-        secp256k1_musig_keyagg_cache cache;
-        secp256k1_musig_session session;
-        secp256k1_musig_partial_sig partial_sig;
-        const secp256k1_musig_partial_sig *partial_sig_ptr[1];
-        unsigned char extra_input[32];
-        unsigned char sec_adaptor[32];
-        secp256k1_pubkey adaptor;
-        unsigned char pre_sig[64];
-        int nonce_parity;
-
-        pk_ptr[0] = &pk;
-        pubnonce_ptr[0] = &pubnonce;
-        SECP256K1_CHECKMEM_DEFINE(key, 32);
-        memcpy(session_id, key, sizeof(session_id));
-        session_id[0] = session_id[0] + 1;
-        memcpy(extra_input, key, sizeof(extra_input));
-        extra_input[0] = extra_input[0] + 2;
-        memcpy(sec_adaptor, key, sizeof(sec_adaptor));
-        sec_adaptor[0] = extra_input[0] + 3;
-        partial_sig_ptr[0] = &partial_sig;
-
-        CHECK(secp256k1_keypair_create(ctx, &keypair, key));
-        CHECK(secp256k1_keypair_pub(ctx, &pk, &keypair));
-        CHECK(secp256k1_musig_pubkey_agg(ctx, NULL, &agg_pk, &cache, pk_ptr, 1));
-        CHECK(secp256k1_ec_pubkey_create(ctx, &adaptor, sec_adaptor));
-        SECP256K1_CHECKMEM_UNDEFINE(key, 32);
-        SECP256K1_CHECKMEM_UNDEFINE(session_id, sizeof(session_id));
-        SECP256K1_CHECKMEM_UNDEFINE(extra_input, sizeof(extra_input));
-        SECP256K1_CHECKMEM_UNDEFINE(sec_adaptor, sizeof(sec_adaptor));
-        ret = secp256k1_musig_nonce_gen(ctx, &secnonce, &pubnonce, session_id, key, &pk, msg, &cache, extra_input);
-        SECP256K1_CHECKMEM_DEFINE(&ret, sizeof(ret));
-        CHECK(ret == 1);
-        CHECK(secp256k1_musig_nonce_agg(ctx, &aggnonce, pubnonce_ptr, 1));
-        /* Make sure that previous tests don't undefine msg. It's not used as a secret here. */
-        SECP256K1_CHECKMEM_DEFINE(msg, sizeof(msg));
-        CHECK(secp256k1_musig_nonce_process(ctx, &session, &aggnonce, msg, &cache, &adaptor) == 1);
-
-        ret = secp256k1_keypair_create(ctx, &keypair, key);
-        SECP256K1_CHECKMEM_DEFINE(&ret, sizeof(ret));
-        CHECK(ret == 1);
-        ret = secp256k1_musig_partial_sign(ctx, &partial_sig, &secnonce, &keypair, &cache, &session);
-        SECP256K1_CHECKMEM_DEFINE(&ret, sizeof(ret));
-        CHECK(ret == 1);
-
-        SECP256K1_CHECKMEM_DEFINE(&partial_sig, sizeof(partial_sig));
-        CHECK(secp256k1_musig_partial_sig_agg(ctx, pre_sig, &session, partial_sig_ptr, 1));
-        SECP256K1_CHECKMEM_DEFINE(pre_sig, sizeof(pre_sig));
-
-        CHECK(secp256k1_musig_nonce_parity(ctx, &nonce_parity, &session));
-        ret = secp256k1_musig_adapt(ctx, sig, pre_sig, sec_adaptor, nonce_parity);
-        SECP256K1_CHECKMEM_DEFINE(&ret, sizeof(ret));
-        CHECK(ret == 1);
-        ret = secp256k1_musig_extract_adaptor(ctx, sec_adaptor, sig, pre_sig, nonce_parity);
-        SECP256K1_CHECKMEM_DEFINE(&ret, sizeof(ret));
-        CHECK(ret == 1);
-    }
-#endif
-
-#ifdef ENABLE_MODULE_FROST
-    {
-        secp256k1_pubkey pk[2];
-        secp256k1_xonly_pubkey agg_pk;
-        unsigned char session_id[32];
-        unsigned char seed[2][32];
-        secp256k1_frost_secnonce secnonce[2];
-        secp256k1_frost_pubnonce pubnonce[2];
-        const secp256k1_frost_pubnonce *pubnonce_ptr[2];
-        secp256k1_frost_tweak_cache cache;
-        secp256k1_frost_session session;
-        secp256k1_frost_partial_sig partial_sig;
-        const secp256k1_frost_partial_sig *partial_sig_ptr[1];
-        unsigned char extra_input[32];
-        unsigned char sec_adaptor[32];
-        secp256k1_pubkey adaptor;
-        unsigned char pre_sig[64];
-        int nonce_parity;
-        secp256k1_frost_share shares[2][2];
-        const secp256k1_frost_share *share_ptr[2];
-        secp256k1_frost_share agg_share;
-        const secp256k1_pubkey *vss_ptr[2];
-        unsigned char pok[2][64];
-        secp256k1_pubkey vss_commitment[2][2];
-        unsigned char key2[32];
-        secp256k1_keypair keypair2;
-        unsigned char id[2][33];
-        const unsigned char *id_ptr[2];
-        size_t size = 33;
-
-        id_ptr[0] = id[0];
-        id_ptr[1] = id[1];
-        pubnonce_ptr[0] = &pubnonce[0];
-        pubnonce_ptr[1] = &pubnonce[1];
-        SECP256K1_CHECKMEM_DEFINE(key, 32);
-        memcpy(seed[0], key, 32);
-        seed[0][0] = seed[0][0] + 1;
-        memcpy(seed[0], key, 32);
-        seed[1][0] = seed[1][0] + 2;
-        memcpy(extra_input, key, sizeof(extra_input));
-        extra_input[0] = extra_input[0] + 3;
-        memcpy(sec_adaptor, key, sizeof(sec_adaptor));
-        sec_adaptor[0] = extra_input[0] + 4;
-        memcpy(key2, key, sizeof(key2));
-        key2[0] = key2[0] + 5;
-        memcpy(session_id, key, sizeof(session_id));
-        session_id[0] = session_id[0] + 6;
-        partial_sig_ptr[0] = &partial_sig;
-        share_ptr[0] = &shares[0][0];
-        share_ptr[1] = &shares[1][0];
-        vss_ptr[0] = vss_commitment[0];
-        vss_ptr[1] = vss_commitment[1];
-
-        CHECK(secp256k1_keypair_create(ctx, &keypair, key));
-        CHECK(secp256k1_keypair_create(ctx, &keypair2, key2));
-        CHECK(secp256k1_keypair_pub(ctx, &pk[0], &keypair));
-        CHECK(secp256k1_keypair_pub(ctx, &pk[1], &keypair2));
-        CHECK(secp256k1_ec_pubkey_serialize(ctx, id[0], &size, &pk[0], SECP256K1_EC_COMPRESSED));
-        CHECK(secp256k1_ec_pubkey_serialize(ctx, id[1], &size, &pk[1], SECP256K1_EC_COMPRESSED));
-
-        /* shares_gen */
-        SECP256K1_CHECKMEM_UNDEFINE(key, 32);
-        SECP256K1_CHECKMEM_UNDEFINE(key2, 32);
-        SECP256K1_CHECKMEM_UNDEFINE(seed[0], 32);
-        SECP256K1_CHECKMEM_UNDEFINE(seed[1], 32);
-        ret = secp256k1_frost_shares_gen(ctx, shares[0], vss_commitment[0], pok[0], seed[0], 2, 2, id_ptr);
-        SECP256K1_CHECKMEM_DEFINE(&ret, sizeof(ret));
-        CHECK(ret == 1);
-        ret = secp256k1_frost_shares_gen(ctx, shares[1], vss_commitment[1], pok[1], seed[1], 2, 2, id_ptr);
-        SECP256K1_CHECKMEM_DEFINE(&ret, sizeof(ret));
-        CHECK(ret == 1);
-        /* share_agg */
-        SECP256K1_CHECKMEM_DEFINE(&vss_commitment[0][0], sizeof(secp256k1_pubkey));
-        SECP256K1_CHECKMEM_DEFINE(&vss_commitment[0][1], sizeof(secp256k1_pubkey));
-        SECP256K1_CHECKMEM_DEFINE(&vss_commitment[1][0], sizeof(secp256k1_pubkey));
-        SECP256K1_CHECKMEM_DEFINE(&vss_commitment[1][1], sizeof(secp256k1_pubkey));
-        SECP256K1_CHECKMEM_DEFINE(pok[0], 64);
-        ret = secp256k1_frost_share_agg(ctx, &agg_share, &agg_pk, share_ptr, vss_ptr, 2, 2, id_ptr[0]);
-        SECP256K1_CHECKMEM_DEFINE(&ret, sizeof(ret));
-        CHECK(ret == 1);
-        /* nonce_gen */
-        SECP256K1_CHECKMEM_UNDEFINE(session_id, sizeof(session_id));
-        CHECK(secp256k1_ec_pubkey_create(ctx, &adaptor, sec_adaptor));
-        SECP256K1_CHECKMEM_UNDEFINE(extra_input, sizeof(extra_input));
-        SECP256K1_CHECKMEM_UNDEFINE(sec_adaptor, sizeof(sec_adaptor));
-        CHECK(secp256k1_frost_pubkey_tweak(ctx, &cache, &agg_pk) == 1);
-        ret = secp256k1_frost_nonce_gen(ctx, &secnonce[0], &pubnonce[0], session_id, &agg_share, msg, &agg_pk, extra_input);
-        SECP256K1_CHECKMEM_DEFINE(&ret, sizeof(ret));
-        CHECK(ret == 1);
-        ret = secp256k1_frost_nonce_gen(ctx, &secnonce[1], &pubnonce[1], session_id, &agg_share, msg, &agg_pk, extra_input);
-        SECP256K1_CHECKMEM_DEFINE(&ret, sizeof(ret));
-        CHECK(ret == 1);
-        /* partial_sign */
-        CHECK(secp256k1_frost_nonce_process(ctx, &session, pubnonce_ptr, 2, msg, &agg_pk, id_ptr[0], id_ptr, &cache, &adaptor) == 1);
-        ret = secp256k1_keypair_create(ctx, &keypair, key);
-        SECP256K1_CHECKMEM_DEFINE(&ret, sizeof(ret));
-        CHECK(ret == 1);
-        ret = secp256k1_frost_partial_sign(ctx, &partial_sig, &secnonce[0], &agg_share, &session, &cache);
-        SECP256K1_CHECKMEM_DEFINE(&ret, sizeof(ret));
-        CHECK(ret == 1);
-        /* adapt */
-        SECP256K1_CHECKMEM_DEFINE(&partial_sig, sizeof(partial_sig));
-        CHECK(secp256k1_frost_partial_sig_agg(ctx, pre_sig, &session, partial_sig_ptr, 1));
-        SECP256K1_CHECKMEM_DEFINE(pre_sig, sizeof(pre_sig));
-        CHECK(secp256k1_frost_nonce_parity(ctx, &nonce_parity, &session));
-        ret = secp256k1_frost_adapt(ctx, sig, pre_sig, sec_adaptor, nonce_parity);
-        SECP256K1_CHECKMEM_DEFINE(&ret, sizeof(ret));
-        CHECK(ret == 1);
-        /* extract_adaptor */
-        ret = secp256k1_frost_extract_adaptor(ctx, sec_adaptor, sig, pre_sig, nonce_parity);
-        SECP256K1_CHECKMEM_DEFINE(&ret, sizeof(ret));
-        CHECK(ret == 1); 
-    }
-#endif
-}

src/eccommit.h

@@ -1,28 +0,0 @@
-/**********************************************************************
- * Copyright (c) 2020 The libsecp256k1-zkp Developers                 *
- * Distributed under the MIT software license, see the accompanying   *
- * file COPYING or http://www.opensource.org/licenses/mit-license.php.*
- **********************************************************************/
-
-#ifndef SECP256K1_ECCOMMIT_H
-#define SECP256K1_ECCOMMIT_H
-
-/** Helper function to add a 32-byte value to a scalar */
-static int secp256k1_ec_seckey_tweak_add_helper(secp256k1_scalar *sec, const unsigned char *tweak);
-/** Helper function to add a 32-byte value, times G, to an EC point */
-static int secp256k1_ec_pubkey_tweak_add_helper(const secp256k1_ecmult_context* ecmult_ctx, secp256k1_ge *p, const unsigned char *tweak);
-
-/** Serializes elem as a 33 byte array. This is non-constant time with respect to
- *  whether pubp is the point at infinity. Thus, you may need to declassify
- *  pubp->infinity before calling this function. */
-static int secp256k1_ec_commit_pubkey_serialize_const(secp256k1_ge *pubp, unsigned char *buf33);
-/** Compute an ec commitment tweak as hash(pubkey, data). */
-static int secp256k1_ec_commit_tweak(unsigned char *tweak32, secp256k1_ge* pubp, secp256k1_sha256* sha, const unsigned char *data, size_t data_size);
-/** Compute an ec commitment as pubkey + hash(pubkey, data)*G. */
-static int secp256k1_ec_commit(const secp256k1_ecmult_context* ecmult_ctx, secp256k1_ge* commitp, const secp256k1_ge* pubp, secp256k1_sha256* sha, const unsigned char *data, size_t data_size);
-/** Compute a secret key commitment as seckey + hash(pubkey, data). */
-static int secp256k1_ec_commit_seckey(const secp256k1_ecmult_gen_context* ecmult_gen_ctx, secp256k1_scalar* seckey, secp256k1_ge* pubp, secp256k1_sha256* sha, const unsigned char *data, size_t data_size);
-/** Verify an ec commitment as pubkey + hash(pubkey, data)*G ?= commitment. */
-static int secp256k1_ec_commit_verify(const secp256k1_ecmult_context* ecmult_ctx, const secp256k1_ge* commitp, const secp256k1_ge* pubp, secp256k1_sha256* sha, const unsigned char *data, size_t data_size);
-
-#endif /* SECP256K1_ECCOMMIT_H */

src/eccommit_impl.h

@@ -1,73 +0,0 @@
-/**********************************************************************
- * Copyright (c) 2020 The libsecp256k1 Developers                     *
- * Distributed under the MIT software license, see the accompanying   *
- * file COPYING or http://www.opensource.org/licenses/mit-license.php.*
- **********************************************************************/
-
-#include <stddef.h>
-
-#include "eckey.h"
-#include "hash.h"
-
-/* from secp256k1.c */
-static int secp256k1_ec_seckey_tweak_add_helper(secp256k1_scalar *sec, const unsigned char *tweak);
-static int secp256k1_ec_pubkey_tweak_add_helper(secp256k1_ge *pubp, const unsigned char *tweak);
-
-static int secp256k1_ec_commit_pubkey_serialize_const(secp256k1_ge *pubp, unsigned char *buf33) {
-    if (secp256k1_ge_is_infinity(pubp)) {
-        return 0;
-    }
-    secp256k1_fe_normalize(&pubp->x);
-    secp256k1_fe_normalize(&pubp->y);
-    secp256k1_fe_get_b32(&buf33[1], &pubp->x);
-    buf33[0] = secp256k1_fe_is_odd(&pubp->y) ? SECP256K1_TAG_PUBKEY_ODD : SECP256K1_TAG_PUBKEY_EVEN;
-    return 1;
-}
-
-/* Compute an ec commitment tweak as hash(pubp, data). */
-static int secp256k1_ec_commit_tweak(unsigned char *tweak32, secp256k1_ge* pubp, secp256k1_sha256* sha, const unsigned char *data, size_t data_size)
-{
-    unsigned char rbuf[33];
-
-    if (!secp256k1_ec_commit_pubkey_serialize_const(pubp, rbuf)) {
-        return 0;
-    }
-    secp256k1_sha256_write(sha, rbuf, sizeof(rbuf));
-    secp256k1_sha256_write(sha, data, data_size);
-    secp256k1_sha256_finalize(sha, tweak32);
-    return 1;
-}
-
-/* Compute an ec commitment as pubp + hash(pubp, data)*G. */
-static int secp256k1_ec_commit(secp256k1_ge* commitp, const secp256k1_ge* pubp, secp256k1_sha256* sha, const unsigned char *data, size_t data_size) {
-    unsigned char tweak[32];
-
-    *commitp = *pubp;
-    return secp256k1_ec_commit_tweak(tweak, commitp, sha, data, data_size)
-           && secp256k1_ec_pubkey_tweak_add_helper(commitp, tweak);
-}
-
-/* Compute the seckey of an ec commitment from the original secret key of the pubkey as seckey +
- * hash(pubp, data). */
-static int secp256k1_ec_commit_seckey(secp256k1_scalar* seckey, secp256k1_ge* pubp, secp256k1_sha256* sha, const unsigned char *data, size_t data_size) {
-    unsigned char tweak[32];
-    return secp256k1_ec_commit_tweak(tweak, pubp, sha, data, data_size)
-           && secp256k1_ec_seckey_tweak_add_helper(seckey, tweak);
-}
-
-/* Verify an ec commitment as pubp + hash(pubp, data)*G ?= commitment. */
-static int secp256k1_ec_commit_verify(const secp256k1_ge* commitp, const secp256k1_ge* pubp, secp256k1_sha256* sha, const unsigned char *data, size_t data_size) {
-    secp256k1_gej pj;
-    secp256k1_ge p;
-
-    if (!secp256k1_ec_commit(&p, pubp, sha, data, data_size)) {
-        return 0;
-    }
-
-    /* Return p == commitp */
-    secp256k1_ge_neg(&p, &p);
-    secp256k1_gej_set_ge(&pj, &p);
-    secp256k1_gej_add_ge_var(&pj, &pj, commitp, NULL);
-    return secp256k1_gej_is_infinity(&pj);
-}
-

src/ecdsa.h

@@ -1,11 +1,11 @@
-/***********************************************************************
- * Copyright (c) 2013, 2014 Pieter Wuille                              *
- * Distributed under the MIT software license, see the accompanying    *
- * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
- ***********************************************************************/
+/**********************************************************************
+ * Copyright (c) 2013, 2014 Pieter Wuille                             *
+ * Distributed under the MIT software license, see the accompanying   *
+ * file COPYING or http://www.opensource.org/licenses/mit-license.php.*
+ **********************************************************************/
 
-#ifndef SECP256K1_ECDSA_H
-#define SECP256K1_ECDSA_H
+#ifndef _SECP256K1_ECDSA_
+#define _SECP256K1_ECDSA_
 
 #include <stddef.h>
 
@@ -15,7 +15,7 @@
 
 static int secp256k1_ecdsa_sig_parse(secp256k1_scalar *r, secp256k1_scalar *s, const unsigned char *sig, size_t size);
 static int secp256k1_ecdsa_sig_serialize(unsigned char *sig, size_t *size, const secp256k1_scalar *r, const secp256k1_scalar *s);
-static int secp256k1_ecdsa_sig_verify(const secp256k1_scalar* r, const secp256k1_scalar* s, const secp256k1_ge *pubkey, const secp256k1_scalar *message);
+static int secp256k1_ecdsa_sig_verify(const secp256k1_ecmult_context *ctx, const secp256k1_scalar* r, const secp256k1_scalar* s, const secp256k1_ge *pubkey, const secp256k1_scalar *message);
 static int secp256k1_ecdsa_sig_sign(const secp256k1_ecmult_gen_context *ctx, secp256k1_scalar* r, secp256k1_scalar* s, const secp256k1_scalar *seckey, const secp256k1_scalar *message, const secp256k1_scalar *nonce, int *recid);
 
-#endif /* SECP256K1_ECDSA_H */
+#endif

src/ecdsa_impl.h

@@ -1,12 +1,12 @@
-/***********************************************************************
- * Copyright (c) 2013-2015 Pieter Wuille                               *
- * Distributed under the MIT software license, see the accompanying    *
- * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
- ***********************************************************************/
+/**********************************************************************
+ * Copyright (c) 2013-2015 Pieter Wuille                              *
+ * Distributed under the MIT software license, see the accompanying   *
+ * file COPYING or http://www.opensource.org/licenses/mit-license.php.*
+ **********************************************************************/
 
 
-#ifndef SECP256K1_ECDSA_IMPL_H
-#define SECP256K1_ECDSA_IMPL_H
+#ifndef _SECP256K1_ECDSA_IMPL_H_
+#define _SECP256K1_ECDSA_IMPL_H_
 
 #include "scalar.h"
 #include "field.h"
@@ -16,8 +16,17 @@
 #include "ecdsa.h"
 
 /** Group order for secp256k1 defined as 'n' in "Standards for Efficient Cryptography" (SEC2) 2.7.1
- *  $ sage -c 'load("secp256k1_params.sage"); print(hex(N))'
- *  0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141
+ *  sage: for t in xrange(1023, -1, -1):
+ *     ..   p = 2**256 - 2**32 - t
+ *     ..   if p.is_prime():
+ *     ..     print '%x'%p
+ *     ..     break
+ *   'fffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f'
+ *  sage: a = 0
+ *  sage: b = 7
+ *  sage: F = FiniteField (p)
+ *  sage: '%x' % (EllipticCurve ([F (a), F (b)]).order())
+ *   'fffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141'
  */
 static const secp256k1_fe secp256k1_ecdsa_const_order_as_fe = SECP256K1_FE_CONST(
     0xFFFFFFFFUL, 0xFFFFFFFFUL, 0xFFFFFFFFUL, 0xFFFFFFFEUL,
@@ -26,81 +35,81 @@ static const secp256k1_fe secp256k1_ecdsa_const_order_as_fe = SECP256K1_FE_CONST
 
 /** Difference between field and order, values 'p' and 'n' values defined in
  *  "Standards for Efficient Cryptography" (SEC2) 2.7.1.
- *  $ sage -c 'load("secp256k1_params.sage"); print(hex(P-N))'
- *  0x14551231950b75fc4402da1722fc9baee
+ *  sage: p = 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F
+ *  sage: a = 0
+ *  sage: b = 7
+ *  sage: F = FiniteField (p)
+ *  sage: '%x' % (p - EllipticCurve ([F (a), F (b)]).order())
+ *   '14551231950b75fc4402da1722fc9baee'
  */
 static const secp256k1_fe secp256k1_ecdsa_const_p_minus_order = SECP256K1_FE_CONST(
     0, 0, 0, 1, 0x45512319UL, 0x50B75FC4UL, 0x402DA172UL, 0x2FC9BAEEUL
 );
 
-static int secp256k1_der_read_len(size_t *len, const unsigned char **sigp, const unsigned char *sigend) {
-    size_t lenleft;
-    unsigned char b1;
-    VERIFY_CHECK(len != NULL);
-    *len = 0;
+static int secp256k1_der_read_len(const unsigned char **sigp, const unsigned char *sigend) {
+    int lenleft, b1;
+    size_t ret = 0;
     if (*sigp >= sigend) {
-        return 0;
+        return -1;
     }
     b1 = *((*sigp)++);
     if (b1 == 0xFF) {
         /* X.690-0207 8.1.3.5.c the value 0xFF shall not be used. */
-        return 0;
+        return -1;
     }
     if ((b1 & 0x80) == 0) {
         /* X.690-0207 8.1.3.4 short form length octets */
-        *len = b1;
-        return 1;
+        return b1;
     }
     if (b1 == 0x80) {
         /* Indefinite length is not allowed in DER. */
-        return 0;
+        return -1;
     }
     /* X.690-207 8.1.3.5 long form length octets */
-    lenleft = b1 & 0x7F; /* lenleft is at least 1 */
-    if (lenleft > (size_t)(sigend - *sigp)) {
-        return 0;
+    lenleft = b1 & 0x7F;
+    if (lenleft > sigend - *sigp) {
+        return -1;
     }
     if (**sigp == 0) {
         /* Not the shortest possible length encoding. */
-        return 0;
+        return -1;
     }
-    if (lenleft > sizeof(size_t)) {
+    if ((size_t)lenleft > sizeof(size_t)) {
         /* The resulting length would exceed the range of a size_t, so
-         * it is certainly longer than the passed array size. */
-        return 0;
+         * certainly longer than the passed array size.
+         */
+        return -1;
     }
     while (lenleft > 0) {
-        *len = (*len << 8) | **sigp;
+        if ((ret >> ((sizeof(size_t) - 1) * 8)) != 0) {
+        }
+        ret = (ret << 8) | **sigp;
+        if (ret + lenleft > (size_t)(sigend - *sigp)) {
+            /* Result exceeds the length of the passed array. */
+            return -1;
+        }
         (*sigp)++;
         lenleft--;
     }
-    if (*len > (size_t)(sigend - *sigp)) {
-        /* Result exceeds the length of the passed array.
-           (Checking this is the responsibility of the caller but it
-           can't hurt do it here, too.) */
-        return 0;
-    }
-    if (*len < 128) {
+    if (ret < 128) {
         /* Not the shortest possible length encoding. */
-        return 0;
+        return -1;
     }
-    return 1;
+    return ret;
 }
 
 static int secp256k1_der_parse_integer(secp256k1_scalar *r, const unsigned char **sig, const unsigned char *sigend) {
     int overflow = 0;
     unsigned char ra[32] = {0};
-    size_t rlen;
+    int rlen;
 
     if (*sig == sigend || **sig != 0x02) {
         /* Not a primitive integer (X.690-0207 8.3.1). */
         return 0;
     }
     (*sig)++;
-    if (secp256k1_der_read_len(&rlen, sig, sigend) == 0) {
-        return 0;
-    }
-    if (rlen == 0 || rlen > (size_t)(sigend - *sig)) {
+    rlen = secp256k1_der_read_len(sig, sigend);
+    if (rlen <= 0 || (*sig) + rlen > sigend) {
         /* Exceeds bounds or not at least length 1 (X.690-0207 8.3.1).  */
         return 0;
     }
@@ -116,11 +125,8 @@ static int secp256k1_der_parse_integer(secp256k1_scalar *r, const unsigned char
         /* Negative. */
         overflow = 1;
     }
-    /* There is at most one leading zero byte:
-     * if there were two leading zero bytes, we would have failed and returned 0
-     * because of excessive 0x00 padding already. */
-    if (rlen > 0 && **sig == 0) {
-        /* Skip leading zero byte */
+    while (rlen > 0 && **sig == 0) {
+        /* Skip leading zero bytes */
         rlen--;
         (*sig)++;
     }
@@ -128,7 +134,7 @@ static int secp256k1_der_parse_integer(secp256k1_scalar *r, const unsigned char
         overflow = 1;
     }
     if (!overflow) {
-        if (rlen) memcpy(ra + 32 - rlen, *sig, rlen);
+        memcpy(ra + 32 - rlen, *sig, rlen);
         secp256k1_scalar_set_b32(r, ra, &overflow);
     }
     if (overflow) {
@@ -140,16 +146,18 @@ static int secp256k1_der_parse_integer(secp256k1_scalar *r, const unsigned char
 
 static int secp256k1_ecdsa_sig_parse(secp256k1_scalar *rr, secp256k1_scalar *rs, const unsigned char *sig, size_t size) {
     const unsigned char *sigend = sig + size;
-    size_t rlen;
+    int rlen;
     if (sig == sigend || *(sig++) != 0x30) {
         /* The encoding doesn't start with a constructed sequence (X.690-0207 8.9.1). */
         return 0;
     }
-    if (secp256k1_der_read_len(&rlen, &sig, sigend) == 0) {
+    rlen = secp256k1_der_read_len(&sig, sigend);
+    if (rlen < 0 || sig + rlen > sigend) {
+        /* Tuple exceeds bounds */
         return 0;
     }
-    if (rlen != (size_t)(sigend - sig)) {
-        /* Tuple exceeds bounds or garage after tuple. */
+    if (sig + rlen != sigend) {
+        /* Garbage after tuple. */
         return 0;
     }
 
@@ -192,7 +200,7 @@ static int secp256k1_ecdsa_sig_serialize(unsigned char *sig, size_t *size, const
     return 1;
 }
 
-static int secp256k1_ecdsa_sig_verify(const secp256k1_scalar *sigr, const secp256k1_scalar *sigs, const secp256k1_ge *pubkey, const secp256k1_scalar *message) {
+static int secp256k1_ecdsa_sig_verify(const secp256k1_ecmult_context *ctx, const secp256k1_scalar *sigr, const secp256k1_scalar *sigs, const secp256k1_ge *pubkey, const secp256k1_scalar *message) {
     unsigned char c[32];
     secp256k1_scalar sn, u1, u2;
 #if !defined(EXHAUSTIVE_TEST_ORDER)
@@ -209,7 +217,7 @@ static int secp256k1_ecdsa_sig_verify(const secp256k1_scalar *sigr, const secp25
     secp256k1_scalar_mul(&u1, &sn, message);
     secp256k1_scalar_mul(&u2, &sn, sigr);
     secp256k1_gej_set_ge(&pubkeyj, pubkey);
-    secp256k1_ecmult(&pr, &pubkeyj, &u2, &u1);
+    secp256k1_ecmult(ctx, &pr, &pubkeyj, &u2, &u1);
     if (secp256k1_gej_is_infinity(&pr)) {
         return 0;
     }
@@ -227,8 +235,7 @@ static int secp256k1_ecdsa_sig_verify(const secp256k1_scalar *sigr, const secp25
 }
 #else
     secp256k1_scalar_get_b32(c, sigr);
-    /* we can ignore the fe_set_b32_limit return value, because we know the input is in range */
-    (void)secp256k1_fe_set_b32_limit(&xr, c);
+    secp256k1_fe_set_b32(&xr, c);
 
     /** We now have the recomputed R point in pr, and its claimed x coordinate (modulo n)
      *  in xr. Naively, we would extract the x coordinate from pr (requiring a inversion modulo p),
@@ -269,7 +276,6 @@ static int secp256k1_ecdsa_sig_sign(const secp256k1_ecmult_gen_context *ctx, sec
     secp256k1_ge r;
     secp256k1_scalar n;
     int overflow = 0;
-    int high;
 
     secp256k1_ecmult_gen(ctx, &rp, nonce);
     secp256k1_ge_set_gej(&r, &rp);
@@ -277,11 +283,15 @@ static int secp256k1_ecdsa_sig_sign(const secp256k1_ecmult_gen_context *ctx, sec
     secp256k1_fe_normalize(&r.y);
     secp256k1_fe_get_b32(b, &r.x);
     secp256k1_scalar_set_b32(sigr, b, &overflow);
+    /* These two conditions should be checked before calling */
+    VERIFY_CHECK(!secp256k1_scalar_is_zero(sigr));
+    VERIFY_CHECK(overflow == 0);
+
     if (recid) {
         /* The overflow condition is cryptographically unreachable as hitting it requires finding the discrete log
          * of some P where P.x >= order, and only 1 in about 2^127 points meet this criteria.
          */
-        *recid = (overflow << 1) | secp256k1_fe_is_odd(&r.y);
+        *recid = (overflow ? 2 : 0) | (secp256k1_fe_is_odd(&r.y) ? 1 : 0);
     }
     secp256k1_scalar_mul(&n, sigr, seckey);
     secp256k1_scalar_add(&n, &n, message);
@@ -290,15 +300,16 @@ static int secp256k1_ecdsa_sig_sign(const secp256k1_ecmult_gen_context *ctx, sec
     secp256k1_scalar_clear(&n);
     secp256k1_gej_clear(&rp);
     secp256k1_ge_clear(&r);
-    high = secp256k1_scalar_is_high(sigs);
-    secp256k1_scalar_cond_negate(sigs, high);
-    if (recid) {
-        *recid ^= high;
+    if (secp256k1_scalar_is_zero(sigs)) {
+        return 0;
     }
-    /* P.x = order is on the curve, so technically sig->r could end up being zero, which would be an invalid signature.
-     * This is cryptographically unreachable as hitting it requires finding the discrete log of P.x = N.
-     */
-    return (int)(!secp256k1_scalar_is_zero(sigr)) & (int)(!secp256k1_scalar_is_zero(sigs));
+    if (secp256k1_scalar_is_high(sigs)) {
+        secp256k1_scalar_negate(sigs, sigs);
+        if (recid) {
+            *recid ^= 1;
+        }
+    }
+    return 1;
 }
 
-#endif /* SECP256K1_ECDSA_IMPL_H */
+#endif

src/eckey.h

@@ -1,11 +1,11 @@
-/***********************************************************************
- * Copyright (c) 2013, 2014 Pieter Wuille                              *
- * Distributed under the MIT software license, see the accompanying    *
- * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
- ***********************************************************************/
+/**********************************************************************
+ * Copyright (c) 2013, 2014 Pieter Wuille                             *
+ * Distributed under the MIT software license, see the accompanying   *
+ * file COPYING or http://www.opensource.org/licenses/mit-license.php.*
+ **********************************************************************/
 
-#ifndef SECP256K1_ECKEY_H
-#define SECP256K1_ECKEY_H
+#ifndef _SECP256K1_ECKEY_
+#define _SECP256K1_ECKEY_
 
 #include <stddef.h>
 
@@ -18,8 +18,8 @@ static int secp256k1_eckey_pubkey_parse(secp256k1_ge *elem, const unsigned char
 static int secp256k1_eckey_pubkey_serialize(secp256k1_ge *elem, unsigned char *pub, size_t *size, int compressed);
 
 static int secp256k1_eckey_privkey_tweak_add(secp256k1_scalar *key, const secp256k1_scalar *tweak);
-static int secp256k1_eckey_pubkey_tweak_add(secp256k1_ge *key, const secp256k1_scalar *tweak);
+static int secp256k1_eckey_pubkey_tweak_add(const secp256k1_ecmult_context *ctx, secp256k1_ge *key, const secp256k1_scalar *tweak);
 static int secp256k1_eckey_privkey_tweak_mul(secp256k1_scalar *key, const secp256k1_scalar *tweak);
-static int secp256k1_eckey_pubkey_tweak_mul(secp256k1_ge *key, const secp256k1_scalar *tweak);
+static int secp256k1_eckey_pubkey_tweak_mul(const secp256k1_ecmult_context *ctx, secp256k1_ge *key, const secp256k1_scalar *tweak);
 
-#endif /* SECP256K1_ECKEY_H */
+#endif

src/eckey_impl.h

@@ -1,11 +1,11 @@
-/***********************************************************************
- * Copyright (c) 2013, 2014 Pieter Wuille                              *
- * Distributed under the MIT software license, see the accompanying    *
- * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
- ***********************************************************************/
+/**********************************************************************
+ * Copyright (c) 2013, 2014 Pieter Wuille                             *
+ * Distributed under the MIT software license, see the accompanying   *
+ * file COPYING or http://www.opensource.org/licenses/mit-license.php.*
+ **********************************************************************/
 
-#ifndef SECP256K1_ECKEY_IMPL_H
-#define SECP256K1_ECKEY_IMPL_H
+#ifndef _SECP256K1_ECKEY_IMPL_H_
+#define _SECP256K1_ECKEY_IMPL_H_
 
 #include "eckey.h"
 
@@ -15,17 +15,16 @@
 #include "ecmult_gen.h"
 
 static int secp256k1_eckey_pubkey_parse(secp256k1_ge *elem, const unsigned char *pub, size_t size) {
-    if (size == 33 && (pub[0] == SECP256K1_TAG_PUBKEY_EVEN || pub[0] == SECP256K1_TAG_PUBKEY_ODD)) {
+    if (size == 33 && (pub[0] == 0x02 || pub[0] == 0x03)) {
         secp256k1_fe x;
-        return secp256k1_fe_set_b32_limit(&x, pub+1) && secp256k1_ge_set_xo_var(elem, &x, pub[0] == SECP256K1_TAG_PUBKEY_ODD);
-    } else if (size == 65 && (pub[0] == SECP256K1_TAG_PUBKEY_UNCOMPRESSED || pub[0] == SECP256K1_TAG_PUBKEY_HYBRID_EVEN || pub[0] == SECP256K1_TAG_PUBKEY_HYBRID_ODD)) {
+        return secp256k1_fe_set_b32(&x, pub+1) && secp256k1_ge_set_xo_var(elem, &x, pub[0] == 0x03);
+    } else if (size == 65 && (pub[0] == 0x04 || pub[0] == 0x06 || pub[0] == 0x07)) {
         secp256k1_fe x, y;
-        if (!secp256k1_fe_set_b32_limit(&x, pub+1) || !secp256k1_fe_set_b32_limit(&y, pub+33)) {
+        if (!secp256k1_fe_set_b32(&x, pub+1) || !secp256k1_fe_set_b32(&y, pub+33)) {
             return 0;
         }
         secp256k1_ge_set_xy(elem, &x, &y);
-        if ((pub[0] == SECP256K1_TAG_PUBKEY_HYBRID_EVEN || pub[0] == SECP256K1_TAG_PUBKEY_HYBRID_ODD) &&
-            secp256k1_fe_is_odd(&y) != (pub[0] == SECP256K1_TAG_PUBKEY_HYBRID_ODD)) {
+        if ((pub[0] == 0x06 || pub[0] == 0x07) && secp256k1_fe_is_odd(&y) != (pub[0] == 0x07)) {
             return 0;
         }
         return secp256k1_ge_is_valid_var(elem);
@@ -43,10 +42,10 @@ static int secp256k1_eckey_pubkey_serialize(secp256k1_ge *elem, unsigned char *p
     secp256k1_fe_get_b32(&pub[1], &elem->x);
     if (compressed) {
         *size = 33;
-        pub[0] = secp256k1_fe_is_odd(&elem->y) ? SECP256K1_TAG_PUBKEY_ODD : SECP256K1_TAG_PUBKEY_EVEN;
+        pub[0] = 0x02 | (secp256k1_fe_is_odd(&elem->y) ? 0x01 : 0x00);
     } else {
         *size = 65;
-        pub[0] = SECP256K1_TAG_PUBKEY_UNCOMPRESSED;
+        pub[0] = 0x04;
         secp256k1_fe_get_b32(&pub[33], &elem->y);
     }
     return 1;
@@ -54,13 +53,18 @@ static int secp256k1_eckey_pubkey_serialize(secp256k1_ge *elem, unsigned char *p
 
 static int secp256k1_eckey_privkey_tweak_add(secp256k1_scalar *key, const secp256k1_scalar *tweak) {
     secp256k1_scalar_add(key, key, tweak);
-    return !secp256k1_scalar_is_zero(key);
+    if (secp256k1_scalar_is_zero(key)) {
+        return 0;
+    }
+    return 1;
 }
 
-static int secp256k1_eckey_pubkey_tweak_add(secp256k1_ge *key, const secp256k1_scalar *tweak) {
+static int secp256k1_eckey_pubkey_tweak_add(const secp256k1_ecmult_context *ctx, secp256k1_ge *key, const secp256k1_scalar *tweak) {
     secp256k1_gej pt;
+    secp256k1_scalar one;
     secp256k1_gej_set_ge(&pt, key);
-    secp256k1_ecmult(&pt, &pt, &secp256k1_scalar_one, tweak);
+    secp256k1_scalar_set_int(&one, 1);
+    secp256k1_ecmult(ctx, &pt, &pt, &one, tweak);
 
     if (secp256k1_gej_is_infinity(&pt)) {
         return 0;
@@ -70,23 +74,26 @@ static int secp256k1_eckey_pubkey_tweak_add(secp256k1_ge *key, const secp256k1_s
 }
 
 static int secp256k1_eckey_privkey_tweak_mul(secp256k1_scalar *key, const secp256k1_scalar *tweak) {
-    int ret;
-    ret = !secp256k1_scalar_is_zero(tweak);
+    if (secp256k1_scalar_is_zero(tweak)) {
+        return 0;
+    }
 
     secp256k1_scalar_mul(key, key, tweak);
-    return ret;
+    return 1;
 }
 
-static int secp256k1_eckey_pubkey_tweak_mul(secp256k1_ge *key, const secp256k1_scalar *tweak) {
+static int secp256k1_eckey_pubkey_tweak_mul(const secp256k1_ecmult_context *ctx, secp256k1_ge *key, const secp256k1_scalar *tweak) {
+    secp256k1_scalar zero;
     secp256k1_gej pt;
     if (secp256k1_scalar_is_zero(tweak)) {
         return 0;
     }
 
+    secp256k1_scalar_set_int(&zero, 0);
     secp256k1_gej_set_ge(&pt, key);
-    secp256k1_ecmult(&pt, &pt, tweak, &secp256k1_scalar_zero);
+    secp256k1_ecmult(ctx, &pt, &pt, tweak, &zero);
     secp256k1_ge_set_gej(key, &pt);
     return 1;
 }
 
-#endif /* SECP256K1_ECKEY_IMPL_H */
+#endif