proofs/crypto/secp256k1/laws_sign.bend
1import Base
2import bend-collections-laws-crypto@1.0.0.0/src/crypto/secp256k1.bend as K
3import bend-collections-laws-crypto@1.0.0.0/spec/crypto/secp256k1/ecdsa.bend as ES
4import bend-collections-laws-crypto@1.0.0.0/spec/crypto/secp256k1/schnorr.bend as SS
5
6# The clauses of src/crypto/secp256k1.bend: every function is its
7# specification (spec/crypto/secp256k1/, over the natural numbers, from
8# SEC 1 v2, SEC 2, RFC 6979, BIP-340 and the Ethereum yellow paper) for
9# every input (any byte lists, any Bool). The specification takes `one`,
10# the number 1 kept symbolic (h1: one == 1), so that its 256-bit constants
11# p, n and G are never expanded by the checker; every clause holds for the
12# one `one` there is.
13#
14# The clauses are in five files, each proved by its own root (so that
15# each root checks alone): laws.bend (keys and addresses, proof.bend),
16# laws_sign.bend (proof_sign.bend), laws_verify.bend (proof_verify.bend),
17# laws_recover.bend (proof_recover.bend) and laws_schnorr.bend
18# (proof_schnorr.bend). This file: proof_sign.bend.
19
20# ECDSA signing: RFC 6979 nonce, low s, recovery id; r || s || v
21law Sign.correct:
22 for +one: Nat
23 for +h1: {one == 1n : Nat}
24 for +sk: List<&2, U32>
25 for +h: List<&2, U32>
26 {K.sign_compact(sk, h) == ES.sign(one, sk, h) : Maybe<&2, List<&2, U32>>}