Files
chia-blockchain/chia/util/keychain.py
Matt HauffandGitHub 40db4635a8 [LABS-245] Enable PEP604 Ruff rules (#20269)
* Enable PEP604 Ruff rules

* Fix harcoded signature in test

* Hack CLVMStreamable test with note to fast follow
2025-11-18 12:34:00 -08:00

674 lines
25 KiB
Python

# Package: utils
from __future__ import annotations
import sys
import unicodedata
from collections.abc import Iterator
from dataclasses import dataclass
from hashlib import pbkdf2_hmac
from pathlib import Path
from typing import Any, Literal, overload
import importlib_resources
from bitstring import BitArray # pyright: reportMissingImports=false
from chia_rs import AugSchemeMPL, G1Element, PrivateKey # pyright: reportMissingImports=false
from chia_rs.sized_bytes import bytes32
from chia_rs.sized_ints import uint32
from typing_extensions import final
from chia.util.bech32m import bech32_decode, convertbits
from chia.util.byte_types import hexstr_to_bytes
from chia.util.errors import (
KeychainException,
KeychainFingerprintExists,
KeychainFingerprintNotFound,
KeychainKeyDataMismatch,
KeychainNotSet,
KeychainSecretsMissing,
KeychainUserNotFound,
)
from chia.util.file_keyring import Key
from chia.util.hash import std_hash
from chia.util.keyring_wrapper import KeyringWrapper
from chia.util.streamable import Streamable, streamable
CURRENT_KEY_VERSION = "1.8"
DEFAULT_USER = f"user-chia-{CURRENT_KEY_VERSION}" # e.g. user-chia-1.8
DEFAULT_SERVICE = f"chia-{DEFAULT_USER}" # e.g. chia-user-chia-1.8
MAX_KEYS = 101
MIN_PASSPHRASE_LEN = 8
def supports_os_passphrase_storage() -> bool:
return sys.platform in {"darwin", "win32", "cygwin"}
def passphrase_requirements() -> dict[str, Any]:
"""
Returns a dictionary specifying current passphrase requirements
"""
return {"is_optional": True, "min_length": MIN_PASSPHRASE_LEN} # lgtm [py/clear-text-logging-sensitive-data]
def set_keys_root_path(keys_root_path: Path) -> None:
"""
Used to set the keys_root_path prior to instantiating the KeyringWrapper shared instance.
"""
KeyringWrapper.set_keys_root_path(keys_root_path)
def bip39_word_list() -> str:
word_list_path = importlib_resources.files(__name__.rpartition(".")[0]).joinpath("english.txt")
contents: str = word_list_path.read_text(encoding="utf-8")
return contents
def generate_mnemonic() -> str:
mnemonic_bytes = bytes32.secret()
mnemonic = bytes_to_mnemonic(mnemonic_bytes)
return mnemonic
def bytes_to_mnemonic(mnemonic_bytes: bytes) -> str:
if len(mnemonic_bytes) not in {16, 20, 24, 28, 32}:
raise ValueError(
f"Data length should be one of the following: [16, 20, 24, 28, 32], but it is {len(mnemonic_bytes)}."
)
word_list = bip39_word_list().splitlines()
CS = len(mnemonic_bytes) // 4
checksum = BitArray(bytes(std_hash(mnemonic_bytes)))[:CS]
bitarray = BitArray(mnemonic_bytes) + checksum
mnemonics = []
assert len(bitarray) % 11 == 0
for i in range(len(bitarray) // 11):
start = i * 11
end = start + 11
bits = bitarray[start:end]
m_word_position = bits.uint
m_word = word_list[m_word_position]
mnemonics.append(m_word)
return " ".join(mnemonics)
def check_mnemonic_validity(mnemonic_str: str) -> bool:
mnemonic: list[str] = mnemonic_str.split(" ")
return len(mnemonic) in {12, 15, 18, 21, 24}
def mnemonic_from_short_words(mnemonic_str: str) -> str:
"""
Since the first 4 letters of each word is unique (or the full word, if less than 4 characters), and its common
practice to only store the first 4 letters of each word in many offline storage solutions, also support looking
up words by the first 4 characters
"""
mnemonic: list[str] = mnemonic_str.split(" ")
if len(mnemonic) not in {12, 15, 18, 21, 24}:
raise ValueError("Invalid mnemonic length")
four_char_dict = {word[:4]: word for word in bip39_word_list().splitlines()}
full_words: list[str] = []
for word in mnemonic:
full_word = four_char_dict.get(word[:4])
if full_word is None:
raise ValueError(f"{word!r} is not in the mnemonic dictionary; may be misspelled")
full_words.append(full_word)
return " ".join(full_words)
def bytes_from_mnemonic(mnemonic_str: str) -> bytes:
full_mnemonic_str = mnemonic_from_short_words(mnemonic_str)
mnemonic: list[str] = full_mnemonic_str.split(" ")
word_list = {word: i for i, word in enumerate(bip39_word_list().splitlines())}
bit_array = BitArray()
for i in range(len(mnemonic)):
word = mnemonic[i]
if word not in word_list:
raise ValueError(f"'{word}' is not in the mnemonic dictionary; may be misspelled")
value = word_list[word]
bit_array.append(BitArray(uint=value, length=11))
CS: int = len(mnemonic) // 3
ENT: int = len(mnemonic) * 11 - CS
assert len(bit_array) == len(mnemonic) * 11
assert ENT % 32 == 0
# mypy doesn't seem to understand the `property()` call used not as a decorator
entropy_bytes: bytes = bit_array[:ENT].bytes
checksum_bytes = bit_array[ENT:]
checksum = BitArray(std_hash(entropy_bytes))[:CS]
assert len(checksum_bytes) == CS
if checksum != checksum_bytes:
raise ValueError("Invalid order of mnemonic words")
return entropy_bytes
def mnemonic_to_seed(mnemonic: str) -> bytes:
"""
Uses BIP39 standard to derive a seed from entropy bytes.
"""
# If there are only ASCII characters (as typically expected in a seed phrase), we can check if its just shortened
# 4 letter versions of each word
if not any(ord(c) >= 128 for c in mnemonic):
mnemonic = mnemonic_from_short_words(mnemonic)
salt_str: str = "mnemonic"
salt = unicodedata.normalize("NFKD", salt_str).encode("utf-8")
mnemonic_normalized = unicodedata.normalize("NFKD", mnemonic).encode("utf-8")
seed = pbkdf2_hmac("sha512", mnemonic_normalized, salt, 2048)
assert len(seed) == 64
return seed
def default_keychain_user() -> str:
return DEFAULT_USER
def default_keychain_service() -> str:
return DEFAULT_SERVICE
def get_private_key_user(user: str, index: int) -> str:
"""
Returns the keychain user string for a key index.
"""
return f"wallet-{user}-{index}"
@final
@streamable
@dataclass(frozen=True)
class KeyDataSecrets(Streamable):
mnemonic: list[str]
entropy: bytes
private_key: PrivateKey
def __post_init__(self) -> None:
# This is redundant if `from_*` methods are used but its to make sure there can't be an `KeyDataSecrets`
# instance with an attribute mismatch for calculated cached values. Should be ok since we don't handle a lot of
# keys here.
mnemonic_str = self.mnemonic_str()
try:
bytes_from_mnemonic(mnemonic_str)
except Exception as e:
raise KeychainKeyDataMismatch("mnemonic") from e
if bytes_from_mnemonic(mnemonic_str) != self.entropy:
raise KeychainKeyDataMismatch("entropy")
if AugSchemeMPL.key_gen(mnemonic_to_seed(mnemonic_str)) != self.private_key:
raise KeychainKeyDataMismatch("private_key")
@classmethod
def from_mnemonic(cls, mnemonic: str) -> KeyDataSecrets:
return cls(
mnemonic=mnemonic.split(),
entropy=bytes_from_mnemonic(mnemonic),
private_key=AugSchemeMPL.key_gen(mnemonic_to_seed(mnemonic)),
)
@classmethod
def from_entropy(cls, entropy: bytes) -> KeyDataSecrets:
return cls.from_mnemonic(bytes_to_mnemonic(entropy))
@classmethod
def generate(cls) -> KeyDataSecrets:
return cls.from_mnemonic(generate_mnemonic())
def mnemonic_str(self) -> str:
return " ".join(self.mnemonic)
@final
@streamable
@dataclass(frozen=True)
class KeyData(Streamable):
fingerprint: uint32
public_key: G1Element
label: str | None
secrets: KeyDataSecrets | None
def __post_init__(self) -> None:
# This is redundant if `from_*` methods are used but its to make sure there can't be an `KeyData` instance with
# an attribute mismatch for calculated cached values. Should be ok since we don't handle a lot of keys here.
if self.secrets is not None and self.public_key != self.private_key.get_g1():
raise KeychainKeyDataMismatch("public_key")
if uint32(self.public_key.get_fingerprint()) != self.fingerprint:
raise KeychainKeyDataMismatch("fingerprint")
@classmethod
def from_mnemonic(cls, mnemonic: str, label: str | None = None) -> KeyData:
private_key = AugSchemeMPL.key_gen(mnemonic_to_seed(mnemonic))
return cls(
fingerprint=uint32(private_key.get_g1().get_fingerprint()),
public_key=private_key.get_g1(),
label=label,
secrets=KeyDataSecrets.from_mnemonic(mnemonic),
)
@classmethod
def from_entropy(cls, entropy: bytes, label: str | None = None) -> KeyData:
return cls.from_mnemonic(bytes_to_mnemonic(entropy), label)
@classmethod
def generate(cls, label: str | None = None) -> KeyData:
return cls.from_mnemonic(generate_mnemonic(), label)
@property
def mnemonic(self) -> list[str]:
if self.secrets is None:
raise KeychainSecretsMissing
return self.secrets.mnemonic
def mnemonic_str(self) -> str:
if self.secrets is None:
raise KeychainSecretsMissing
return self.secrets.mnemonic_str()
@property
def entropy(self) -> bytes:
if self.secrets is None:
raise KeychainSecretsMissing
return self.secrets.entropy
@property
def private_key(self) -> PrivateKey:
if self.secrets is None:
raise KeychainSecretsMissing
return self.secrets.private_key
class Keychain:
"""
The keychain stores two types of keys: private keys, which are PrivateKeys from blspy,
and private key seeds, which are bytes objects that are used as a seed to construct
PrivateKeys. Private key seeds are converted to mnemonics when shown to users.
Both types of keys are stored as hex strings in the python keyring, and the implementation of
the keyring depends on OS. Both types of keys can be added, and get_private_keys returns a
list of all keys.
"""
def __init__(self, user: str | None = None, service: str | None = None):
self.user = user if user is not None else default_keychain_user()
self.service = service if service is not None else default_keychain_service()
keyring_wrapper: KeyringWrapper | None = KeyringWrapper.get_shared_instance()
if keyring_wrapper is None:
raise KeychainNotSet("KeyringWrapper not set")
self.keyring_wrapper = keyring_wrapper
def _get_key_data(self, index: int, include_secrets: bool = True) -> KeyData:
"""
Returns the parsed keychain contents for a specific 'user' (key index). The content
is represented by the class `KeyData`.
"""
user = get_private_key_user(self.user, index)
key = self.keyring_wrapper.keyring.get_key(self.service, user)
if key is None or len(key.secret) == 0:
raise KeychainUserNotFound(self.service, user)
str_bytes = key.secret
public_key = G1Element.from_bytes(str_bytes[: G1Element.SIZE])
fingerprint = public_key.get_fingerprint()
if len(str_bytes) > G1Element.SIZE:
entropy = str_bytes[G1Element.SIZE : G1Element.SIZE + 32]
else:
entropy = None
return KeyData(
fingerprint=uint32(fingerprint),
public_key=public_key,
label=self.keyring_wrapper.keyring.get_label(fingerprint),
secrets=KeyDataSecrets.from_entropy(entropy) if include_secrets and entropy is not None else None,
)
def _get_free_private_key_index(self) -> int:
"""
Get the index of the first free spot in the keychain.
"""
index = 0
while True:
try:
self._get_key_data(index)
index += 1
except KeychainUserNotFound:
return index
@overload
def add_key(self, mnemonic_or_pk: str) -> PrivateKey: ...
@overload
def add_key(self, mnemonic_or_pk: str, label: str | None) -> PrivateKey: ...
@overload
def add_key(self, mnemonic_or_pk: str, label: str | None, private: Literal[True]) -> PrivateKey: ...
@overload
def add_key(self, mnemonic_or_pk: str, label: str | None, private: Literal[False]) -> G1Element: ...
@overload
def add_key(self, mnemonic_or_pk: str, label: str | None, private: bool) -> PrivateKey | G1Element: ...
def add_key(self, mnemonic_or_pk: str, label: str | None = None, private: bool = True) -> PrivateKey | G1Element:
"""
Adds a key to the keychain. The keychain itself will store the public key, and the entropy bytes (if given),
but not the passphrase.
"""
key: PrivateKey | G1Element
if private:
seed = mnemonic_to_seed(mnemonic_or_pk)
entropy = bytes_from_mnemonic(mnemonic_or_pk)
index = self._get_free_private_key_index()
key = AugSchemeMPL.key_gen(seed)
assert isinstance(key, PrivateKey)
pk = key.get_g1()
key_data = Key(bytes(pk) + entropy)
fingerprint = pk.get_fingerprint()
else:
index = self._get_free_private_key_index()
if mnemonic_or_pk.startswith("bls1238"):
_, data = bech32_decode(mnemonic_or_pk, max_length=94)
assert data is not None
pk_bytes = bytes(convertbits(data, 5, 8, False))
else:
pk_bytes = hexstr_to_bytes(mnemonic_or_pk)
key = G1Element.from_bytes(pk_bytes)
assert isinstance(key, G1Element)
key_data = Key(pk_bytes)
fingerprint = key.get_fingerprint()
if fingerprint in [pk.get_fingerprint() for pk in self.get_all_public_keys()]:
# Prevents duplicate add
raise KeychainFingerprintExists(fingerprint)
# Try to set the label first, it may fail if the label is invalid or already exists.
# This can probably just be moved into `FileKeyring.set_passphrase` after the legacy keyring stuff was dropped.
if label is not None:
self.keyring_wrapper.keyring.set_label(fingerprint, label)
try:
self.keyring_wrapper.keyring.set_key(
self.service,
get_private_key_user(self.user, index),
key_data,
)
except Exception:
if label is not None:
self.keyring_wrapper.keyring.delete_label(fingerprint)
raise
return key
def set_label(self, fingerprint: int, label: str) -> None:
"""
Assigns the given label to the first key with the given fingerprint.
"""
self.get_key(fingerprint) # raise if the fingerprint doesn't exist
self.keyring_wrapper.keyring.set_label(fingerprint, label)
def delete_label(self, fingerprint: int) -> None:
"""
Removes the label assigned to the key with the given fingerprint.
"""
self.keyring_wrapper.keyring.delete_label(fingerprint)
def _iterate_through_key_datas(
self, include_secrets: bool = True, skip_public_only: bool = False
) -> Iterator[KeyData]:
for index in range(MAX_KEYS):
try:
key_data = self._get_key_data(index, include_secrets=include_secrets)
if key_data is None or (skip_public_only and key_data.secrets is None):
continue
yield key_data
except KeychainUserNotFound:
pass
return None
def get_first_private_key(self) -> tuple[PrivateKey, bytes] | None:
"""
Returns the first key in the keychain that has one of the passed in passphrases.
"""
for key_data in self._iterate_through_key_datas(skip_public_only=True):
return key_data.private_key, key_data.entropy
return None
def get_private_key_by_fingerprint(self, fingerprint: int) -> tuple[PrivateKey, bytes] | None:
"""
Return first private key which have the given public key fingerprint.
"""
for key_data in self._iterate_through_key_datas(skip_public_only=True):
if key_data.fingerprint == fingerprint:
return key_data.private_key, key_data.entropy
return None
def get_all_private_keys(self) -> list[tuple[PrivateKey, bytes]]:
"""
Returns all private keys which can be retrieved, with the given passphrases.
A tuple of key, and entropy bytes (i.e. mnemonic) is returned for each key.
"""
all_keys: list[tuple[PrivateKey, bytes]] = []
for key_data in self._iterate_through_key_datas(skip_public_only=True):
all_keys.append((key_data.private_key, key_data.entropy))
return all_keys
def get_key(self, fingerprint: int, include_secrets: bool = False) -> KeyData:
"""
Return the KeyData of the first key which has the given public key fingerprint.
"""
for key_data in self._iterate_through_key_datas(include_secrets=include_secrets, skip_public_only=False):
if key_data.public_key.get_fingerprint() == fingerprint:
return key_data
raise KeychainFingerprintNotFound(fingerprint)
def get_keys(self, include_secrets: bool = False) -> list[KeyData]:
"""
Returns the KeyData of all keys which can be retrieved.
"""
all_keys: list[KeyData] = []
for key_data in self._iterate_through_key_datas(include_secrets=include_secrets, skip_public_only=False):
all_keys.append(key_data)
return all_keys
def get_all_public_keys(self) -> list[G1Element]:
"""
Returns all public keys.
"""
all_keys: list[G1Element] = []
for key_data in self._iterate_through_key_datas(skip_public_only=False):
all_keys.append(key_data.public_key)
return all_keys
def get_first_public_key(self) -> G1Element | None:
"""
Returns the first public key.
"""
key_data = self.get_first_private_key()
return None if key_data is None else key_data[0].get_g1()
def delete_key_by_fingerprint(self, fingerprint: int) -> int:
"""
Deletes all keys which have the given public key fingerprint and returns how many keys were removed.
"""
removed = 0
# We duplicate ._iterate_through_key_datas due to needing the index
for index in range(MAX_KEYS):
try:
key_data = self._get_key_data(index, include_secrets=False)
if key_data is not None and key_data.fingerprint == fingerprint:
try:
self.keyring_wrapper.keyring.delete_label(key_data.fingerprint)
except (KeychainException, NotImplementedError):
# Just try to delete the label and move on if there wasn't one
pass
try:
self.keyring_wrapper.keyring.delete_key(self.service, get_private_key_user(self.user, index))
removed += 1
except Exception:
pass
except KeychainUserNotFound:
pass
return removed
def delete_keys(self, keys_to_delete: list[tuple[PrivateKey, bytes]]) -> None:
"""
Deletes all keys in the list.
"""
remaining_fingerprints = {x[0].get_g1().get_fingerprint() for x in keys_to_delete}
remaining_removals = len(remaining_fingerprints)
while len(remaining_fingerprints) > 0:
key_to_delete = remaining_fingerprints.pop()
if self.delete_key_by_fingerprint(key_to_delete) > 0:
remaining_removals -= 1
if remaining_removals > 0:
raise ValueError(f"{remaining_removals} keys could not be found for deletion")
def delete_all_keys(self) -> None:
"""
Deletes all keys from the keychain.
"""
for key_data in self._iterate_through_key_datas(include_secrets=False, skip_public_only=False):
self.delete_key_by_fingerprint(key_data.fingerprint)
@staticmethod
def is_keyring_locked() -> bool:
"""
Returns whether the keyring is in a locked state. If the keyring doesn't have a master passphrase set,
or if a master passphrase is set and the cached passphrase is valid, the keyring is "unlocked"
"""
# Unlocked: If a master passphrase isn't set, or if the cached passphrase is valid
if not Keychain.has_master_passphrase():
return False
passphrase = Keychain.get_cached_master_passphrase()
if passphrase is None:
return True
if Keychain.master_passphrase_is_valid(passphrase):
return False
# Locked: Everything else
return True
@staticmethod
def passphrase_is_optional() -> bool:
"""
Returns whether a user-supplied passphrase is optional, as specified by the passphrase requirements.
"""
return passphrase_requirements().get("is_optional", False) # type: ignore[no-any-return]
@staticmethod
def minimum_passphrase_length() -> int:
"""
Returns the minimum passphrase length, as specified by the passphrase requirements.
"""
return passphrase_requirements().get("min_length", 0) # type: ignore[no-any-return]
@staticmethod
def passphrase_meets_requirements(passphrase: str | None) -> bool:
"""
Returns whether the provided passphrase satisfies the passphrase requirements.
"""
# Passphrase is not required and None was provided
if (passphrase is None or passphrase == "") and Keychain.passphrase_is_optional():
return True
# Passphrase meets the minimum length requirement
if passphrase is not None and len(passphrase) >= Keychain.minimum_passphrase_length():
return True
return False
@staticmethod
def has_master_passphrase() -> bool:
"""
Returns a bool indicating whether the underlying keyring data
is secured by a passphrase.
"""
return KeyringWrapper.get_shared_instance().has_master_passphrase()
@staticmethod
def master_passphrase_is_valid(passphrase: str, force_reload: bool = False) -> bool:
"""
Checks whether the provided passphrase can unlock the keyring. If force_reload
is true, the keyring payload will be re-read from the backing file. If false,
the passphrase will be checked against the in-memory payload.
"""
return KeyringWrapper.get_shared_instance().master_passphrase_is_valid(passphrase, force_reload=force_reload)
@staticmethod
def has_cached_passphrase() -> bool:
"""
Returns whether the master passphrase has been cached (it may need to be validated)
"""
return KeyringWrapper.get_shared_instance().has_cached_master_passphrase()
@staticmethod
def get_cached_master_passphrase() -> str | None:
"""
Returns the cached master passphrase
"""
passphrase, _ = KeyringWrapper.get_shared_instance().get_cached_master_passphrase()
return passphrase
@staticmethod
def set_cached_master_passphrase(passphrase: str | None) -> None:
"""
Caches the provided master passphrase
"""
KeyringWrapper.get_shared_instance().set_cached_master_passphrase(passphrase)
@staticmethod
def set_master_passphrase(
current_passphrase: str | None,
new_passphrase: str,
*,
passphrase_hint: str | None = None,
save_passphrase: bool = False,
) -> None:
"""
Encrypts the keyring contents to new passphrase, provided that the current
passphrase can decrypt the contents
"""
KeyringWrapper.get_shared_instance().set_master_passphrase(
current_passphrase,
new_passphrase,
passphrase_hint=passphrase_hint,
save_passphrase=save_passphrase,
)
@staticmethod
def remove_master_passphrase(current_passphrase: str | None) -> None:
"""
Removes the user-provided master passphrase, and replaces it with the default
master passphrase. The keyring contents will remain encrypted, but to the
default passphrase.
"""
KeyringWrapper.get_shared_instance().remove_master_passphrase(current_passphrase)
@staticmethod
def get_master_passphrase_hint() -> str | None:
"""
Returns the passphrase hint from the keyring
"""
return KeyringWrapper.get_shared_instance().get_master_passphrase_hint()
@staticmethod
def set_master_passphrase_hint(current_passphrase: str, passphrase_hint: str | None) -> None:
"""
Convenience method for setting/removing the passphrase hint. Requires the current
passphrase, as the passphrase hint is written as part of a passphrase update.
"""
Keychain.set_master_passphrase(current_passphrase, current_passphrase, passphrase_hint=passphrase_hint)