# How to determine first byte (recovery ID) for signatures (message signing)?

I do realize that in bitcoin when we return the signature result for signing a message the first byte includes information for recovering the public key required for verification using a formula like this:

``````27 + (4 if comp. 0 if not) + (0<=num<=3)
``````

What I am struggling with is how do we determine that `num` number? According to section 4.1.6 of SEC:1 for recovering public keys:

1. `x = r + jn`
2. Calculate `Q` based on `R` if invalid move to next
3. Calculate `Q` based on `-R`

Since j (cofactor of secp256k1) is 0 and 1 and there are two values for R. So there should be 4 possible public keys. Is `num` the number of public keys that we rejected before reaching the correct one? Because that is the only explanation that I can come up with based on comparisons I have made between signatures generated using Electrum and public key recovery I have done myself using SEC1.

Bonus question: Why was 27 chosen?

• I'm not sure what `num` means there either, but I wrote this a while ago which might interest you. It explains exactly how to encode and decode the recid byte : github.com/fivepiece/sign-verify-message/blob/master/… – arubi Dec 19 '18 at 12:34
• @arubi Thanks for the reply. Based on your comment and another answer I've received on bitcointalk, I believe the main cause of my confusion is that I was thinking you find that `num` after signing and finding `r,s`. But it seems like you must find it during using the y coordinate of `r` which is discarded and doesn't come out of sign function. Now I am trying to figure out the details... – Coding Enthusiast Dec 19 '18 at 13:03
• – dave_thompson_085 Dec 19 '18 at 22:58

## 1 Answer

FWIW this is what I have found regarding this question. Basically there are two ways of finding what libraries call "recid" or recovery ID. Most of them use the first method but there is another way:

# Method 1:

• Only requires `r` and `s` so it can be performed by anyone as long as you have the signature and the "message" that was signed.
• It is so much slower because it has 3 scalar multiplication and based on cofactor of the elliptic curve used the whole operation may be repeated 2*(h+1) times, which is up to 4 times for bitcoin with secp256k1 curve (99% of the time it is 1 or 2 times).

The steps are explained in section 4.1.6 of SEC:1, I won't repeat them here.

To find `recid` you check the calculated public key with the given public key or hash of it and report number of rejected public keys as `recid`. For example if `x=r+(0*order)` and `Q` was used then `recid=0` and if `-Q` was used then `recid=1` and so on.

# method 2:

• It requires full `r` or `R=(xR, yR)` so it can only be done while signing (requires having the private key).
• It is much faster because there is no additional calculations. It just needs value checks which are fast.
• This is usually referred to as `v` in libraries

`byte v = if(R.X > curve.N) then 2 else 0) | (if R.Y.IsEven then 0 else 1);`

Basically it is check to see if `xR` is bigger than curve order (N) and whether `yR` is even or odd. Something that should not be forgotten is a "flip" that is performed based on `s` and whether `s` was used in the signature or `-s`

`if s > curve.N/2 then v^=1 else do nothing`

** Note that in the end you need to calculate the following:
`recid = 27 + v + (if compressed 4 else 0)`

• IMO you should also accept this as the answer – arubi Dec 22 '18 at 11:16