I am finding it difficult to figure out how to properly multiply the key-pairs with the challenges. privkey1, pubkey1 = generate_key_pair(sha256(b'key0')) privkey2, pubkey2 = generate_key_pair(sha256(b'key1')) privkey3, pubkey3 = generate_key_pair(sha256(b'key2')) pubkeys = [pubkey1, pubkey2, pubkey3] # Compute key challenges # Method: use generate_musig_key() on the list of pubkeys. # generate_musig_key() returns a challenge map and the aggregate public key. c_map, pubkey_agg = generate_musig_key(pubkeys)# TODO: implement print("Aggregated Public Key is {}\n".format(pubkey_agg.get_bytes().hex())) # Multiply key pairs by challenge factor The diagram shows that tweaked private key di' = ci * di This made me think to do something like: privkey1_c = int.from_bytes(c_map[pubkey1], "big") * int.from_bytes(privkey1.get_bytes(), "big") (cant multiply bytes directly) But this results in a number far too large and since SECP25...