Skip to main content

lexe_common/
root_seed.rs

1use std::{fmt, num::NonZeroU32, str::FromStr};
2
3use anyhow::{Context, bail, ensure};
4use bitcoin::{
5    bip32::{self, ChildNumber},
6    secp256k1,
7};
8use lexe_crypto::{
9    aes::{self, AesMasterKey},
10    ed25519, password,
11    rng::{Crng, RngExt},
12};
13use lexe_hex::hex;
14use lexe_std::array;
15use secrecy::{ExposeSecret, Secret, SecretVec, Zeroize};
16use serde::{Deserialize, Deserializer, Serialize, Serializer, de};
17
18use crate::{
19    api::user::{NodePk, UserPk},
20    ln::network::Network,
21    secp256k1_ctx::SECP256K1,
22};
23
24// TODO(phlip9): [perf] consider storing extracted `Prk` alongside seed to
25//               reduce key derivation time by ~60-70% : )
26
27/// The user's 32-byte root seed, from which all keys and credentials are
28/// derived (user keypair, node keypair, TLS certificates, etc.).
29// We intentionally don't implement ByteArray because it makes it too easy
30// to access the secret.
31pub struct RootSeed(Secret<[u8; Self::LENGTH]>);
32
33impl RootSeed {
34    pub const LENGTH: usize = 32;
35
36    /// An HKDF can't extract more than `255 * hash_output_size` bytes for a
37    /// single secret.
38    const HKDF_MAX_OUT_LEN: usize = 8160 /* 255*32 */;
39
40    /// We salt the HKDF for domain separation purposes.
41    const HKDF_SALT: [u8; 32] = array::pad(*b"LEXE-REALM::RootSeed");
42
43    /// Buffer size for writing a BIP39 mnemonic sentence.
44    /// 24 words * max 8 chars + 23 spaces = 215 <= 216 bytes max
45    const BIP39_MNEMONIC_BUF_SIZE: usize = 216;
46
47    pub fn new(bytes: Secret<[u8; Self::LENGTH]>) -> Self {
48        Self(bytes)
49    }
50
51    /// Quickly create a `RootSeed` for tests.
52    #[cfg(any(test, feature = "test-utils"))]
53    pub fn from_u64(v: u64) -> Self {
54        let mut seed = [0u8; 32];
55        seed[0..8].copy_from_slice(&v.to_le_bytes());
56        Self::new(Secret::new(seed))
57    }
58
59    pub fn from_rng<R: Crng>(rng: &mut R) -> Self {
60        Self(Secret::new(rng.gen_bytes()))
61    }
62
63    // --- BIP39 Mnemonics --- //
64
65    /// Creates a [`bip39::Mnemonic`] from this [`RootSeed`]. Use
66    /// [`bip39::Mnemonic`]'s `Display` / `FromStr` impls to convert from / to
67    /// user-facing strings.
68    pub fn to_mnemonic(&self) -> bip39::Mnemonic {
69        bip39::Mnemonic::from_entropy_in(
70            bip39::Language::English,
71            self.0.expose_secret().as_slice(),
72        )
73        .expect("Always succeeds for 256 bits")
74    }
75
76    /// Derives the BIP39-compatible 64-byte seed from this [`RootSeed`].
77    ///
78    /// This uses the standard BIP39 derivation:
79    /// `PBKDF2(password=mnemonic, salt="mnemonic", 2048 rounds, HMAC-SHA512)`
80    ///
81    /// The resulting seed is compatible with standard wallets when used to
82    /// derive a BIP32 master xpriv.
83    ///
84    /// New Lexe wallets created > node-v0.9.1 use this to derive their
85    /// on-chain wallet BIP32 master xprivs.
86    ///
87    /// Old Lexe on-chain wallets use the [`Self::derive_legacy_master_xprv`]
88    /// instead.
89    pub fn derive_bip39_seed(&self) -> Secret<[u8; 64]> {
90        // RootSeed ("entropy") -> mnemonic
91        let mnemonic = self.to_mnemonic();
92
93        // Write out mnemonic words separated by spaces. Do it on the stack
94        // to avoid allocations.
95        let mut buf = [0u8; Self::BIP39_MNEMONIC_BUF_SIZE];
96        let mut len = 0;
97        for (i, word) in mnemonic.words().enumerate() {
98            if i > 0 {
99                buf[len] = b' ';
100                len += 1;
101            }
102            let word_bytes = word.as_bytes();
103            buf[len..len + word_bytes.len()].copy_from_slice(word_bytes);
104            len += word_bytes.len();
105        }
106        let mnemonic_bytes = &buf[..len];
107
108        // BIP39 salt is "mnemonic" + passphrase (empty for standard wallets)
109        let salt = b"mnemonic";
110
111        // mnemonic -- PBKDF2 -> BIP39 seed
112        let mut seed = [0u8; 64];
113        ring::pbkdf2::derive(
114            ring::pbkdf2::PBKDF2_HMAC_SHA512,
115            const { NonZeroU32::new(2048).unwrap() },
116            salt,
117            mnemonic_bytes,
118            &mut seed,
119        );
120
121        // Zeroize the temporary buffer
122        buf.zeroize();
123
124        Secret::new(seed)
125    }
126
127    // --- Key derivations --- //
128
129    fn extract(&self) -> ring::hkdf::Prk {
130        let salted_hkdf = ring::hkdf::Salt::new(
131            ring::hkdf::HKDF_SHA256,
132            Self::HKDF_SALT.as_slice(),
133        );
134        salted_hkdf.extract(self.0.expose_secret().as_slice())
135    }
136
137    /// Derive a new child secret with `label` into a prepared buffer `out`.
138    pub fn derive_to_slice(&self, label: &[&[u8]], out: &mut [u8]) {
139        struct OkmLength(usize);
140
141        impl ring::hkdf::KeyType for OkmLength {
142            fn len(&self) -> usize {
143                self.0
144            }
145        }
146
147        assert!(out.len() <= Self::HKDF_MAX_OUT_LEN);
148
149        self.extract()
150            .expand(label, OkmLength(out.len()))
151            .expect("should not fail")
152            .fill(out)
153            .expect("should not fail")
154    }
155
156    /// Derive a new child secret with `label` to a hash-output-sized buffer.
157    pub fn derive(&self, label: &[&[u8]]) -> Secret<[u8; 32]> {
158        let mut out = [0u8; 32];
159        self.derive_to_slice(label, &mut out);
160        Secret::new(out)
161    }
162
163    /// Convenience method to derive a new child secret with `label` into a
164    /// `Vec<u8>` of size `out_len`.
165    pub fn derive_vec(&self, label: &[&[u8]], out_len: usize) -> SecretVec<u8> {
166        let mut out = vec![0u8; out_len];
167        self.derive_to_slice(label, &mut out);
168        SecretVec::new(out)
169    }
170
171    /// Derive the keypair for the "ephemeral issuing" CA that endorses
172    /// client and server certs under the "shared seed" mTLS construction.
173    pub fn derive_ephemeral_issuing_ca_key_pair(&self) -> ed25519::KeyPair {
174        // TODO(max): Ideally rename to "ephemeral issuing ca key pair", but
175        // need to ensure backwards compatibility. Both client and server need
176        // to trust the old + new CAs before the old CA can be removed.
177        let seed = self.derive(&[b"shared seed tls ca key pair"]);
178        ed25519::KeyPair::from_seed(seed.expose_secret())
179    }
180
181    /// Derive the keypair for the "revocable issuing" CA that endorses
182    /// client and server certs under the "shared seed" mTLS construction.
183    pub fn derive_revocable_issuing_ca_key_pair(&self) -> ed25519::KeyPair {
184        let seed = self.derive(&[b"revocable issuing ca key pair"]);
185        ed25519::KeyPair::from_seed(seed.expose_secret())
186    }
187
188    /// Derive the user key pair, which is the key behind the [`UserPk`]. This
189    /// key pair is also used to sign up and authenticate as the user against
190    /// the lexe backend.
191    ///
192    /// [`UserPk`]: crate::api::user::UserPk
193    pub fn derive_user_key_pair(&self) -> ed25519::KeyPair {
194        let seed = self.derive(&[b"user key pair"]);
195        ed25519::KeyPair::from_seed(seed.expose_secret())
196    }
197
198    /// Convenience function to derive the [`UserPk`].
199    pub fn derive_user_pk(&self) -> UserPk {
200        UserPk::new(self.derive_user_key_pair().public_key().into_inner())
201    }
202
203    /// Derive the BIP32 master xpriv using the BIP39-compatible derived 64-byte
204    /// seed.
205    ///
206    /// This is used for new Lexe on-chain wallets created > node-v0.9.1.
207    /// Wallets created before then use the [`Self::derive_legacy_master_xprv`].
208    ///
209    /// This produces keys compatible with standard wallets that follow the
210    /// BIP39 spec.
211    pub fn derive_bip32_master_xprv(&self, network: Network) -> bip32::Xpriv {
212        let bip39_seed = self.derive_bip39_seed();
213        bip32::Xpriv::new_master(
214            network.to_bitcoin(),
215            bip39_seed.expose_secret(),
216        )
217        .expect("Should never fail")
218    }
219
220    /// Derive the "legacy" BIP32 master xpriv by feeding the 32-byte
221    /// [`RootSeed`] directly into BIP32's HMAC-SHA512.
222    ///
223    /// This is used for LDK seed derivation (via [`Self::derive_ldk_seed`]) and
224    /// for existing on-chain wallets created before BIP39 compatibility.
225    ///
226    /// It's called "legacy" because standard BIP39 wallets derive the master
227    /// xpriv from a 64-byte seed (produced by PBKDF2), not the original 32-byte
228    /// entropy. This makes Lexe's old on-chain addresses incompatible with
229    /// external wallets. New on-chain wallets use the BIP39-compatible
230    /// derivation instead.
231    pub fn derive_legacy_master_xprv(&self, network: Network) -> bip32::Xpriv {
232        bip32::Xpriv::new_master(network.to_bitcoin(), self.0.expose_secret())
233            .expect("Should never fail")
234    }
235
236    /// Derives the root seed used in LDK. The `KeysManager` is initialized
237    /// using this seed, and `secp256k1` keys are derived from this seed.
238    pub fn derive_ldk_seed(&self) -> Secret<[u8; 32]> {
239        // The [u8; 32] output will be the same regardless of the network the
240        // master_xprv uses, as tested in `when_does_network_matter`
241        let master_xprv = self.derive_legacy_master_xprv(Network::Mainnet);
242
243        // Derive the hardened child key at `m/535h`, where 535 is T9 for "LDK"
244        let m_535h =
245            ChildNumber::from_hardened_idx(535).expect("Is within [0, 2^31-1]");
246        let ldk_xprv = master_xprv
247            .derive_priv(&SECP256K1, &m_535h)
248            .expect("Should always succeed");
249
250        Secret::new(ldk_xprv.private_key.secret_bytes())
251    }
252
253    /// Derive the Lightning node key pair without needing to derive all the
254    /// other auxiliary node secrets used in the `KeysManager`.
255    pub fn derive_node_key_pair(&self) -> secp256k1::Keypair {
256        // Derive the LDK seed first.
257        let ldk_seed = self.derive_ldk_seed();
258
259        // When deriving a secp256k1 key, the network doesn't matter.
260        // This is checked in when_does_network_matter.
261        let ldk_xprv = bip32::Xpriv::new_master(
262            bitcoin::Network::Bitcoin,
263            ldk_seed.expose_secret(),
264        )
265        .expect("should never fail; the sizes match up");
266
267        let m_0h = ChildNumber::from_hardened_idx(0)
268            .expect("should never fail; index is in range");
269        let node_sk = ldk_xprv
270            .derive_priv(&SECP256K1, &m_0h)
271            .expect("should never fail")
272            .private_key;
273
274        secp256k1::Keypair::from_secret_key(&SECP256K1, &node_sk)
275    }
276
277    /// Convenience function to derive the Lightning node pubkey.
278    pub fn derive_node_pk(&self) -> NodePk {
279        NodePk(self.derive_node_key_pair().public_key())
280    }
281
282    /// A secret key used by LDK to authenticate message contexts in received
283    /// `BlindedMessagePath`s.
284    ///
285    /// Used within LDK to create BOLT12 offers with a `BlindedMessagePath`.
286    ///
287    /// This method lets us derive this key without needing to derive all the
288    /// other auxiliary node secrets used in the LDK `KeysManager`.
289    //
290    // See: <https://github.com/lightningdevkit/rust-lightning/blob/714777567be2cfc3dc3a041fcaaff2a7f75b533c/lightning/src/sign/mod.rs#L2015>
291    // for how this is derived upstream.
292    #[cfg(any(test, feature = "test-utils"))]
293    pub fn derive_receive_auth_key(&self) -> [u8; 32] {
294        // Derive the LDK seed first.
295        let ldk_seed = self.derive_ldk_seed();
296
297        // When deriving a secp256k1 key, the network doesn't matter.
298        // This is checked in when_does_network_matter.
299        let ldk_xprv = bip32::Xpriv::new_master(
300            bitcoin::Network::Bitcoin,
301            ldk_seed.expose_secret(),
302        )
303        .expect("should never fail; the sizes match up");
304
305        let m_7h = ChildNumber::from_hardened_idx(7)
306            .expect("should never fail; index is in range");
307        let sk = ldk_xprv
308            .derive_priv(&SECP256K1, &m_7h)
309            .expect("should never fail")
310            .private_key;
311
312        sk.secret_bytes()
313    }
314
315    pub fn derive_vfs_master_key(&self) -> AesMasterKey {
316        let secret = self.derive(&[b"vfs master key"]);
317        AesMasterKey::new(secret.expose_secret())
318    }
319
320    #[cfg(any(test, feature = "test-utils"))]
321    pub fn as_bytes(&self) -> &[u8] {
322        self.0.expose_secret().as_slice()
323    }
324
325    // --- Password encryption --- //
326
327    /// Attempts to encrypt this root seed under the given password.
328    ///
329    /// The password must have at least [`MIN_PASSWORD_LENGTH`] characters and
330    /// must not have any more than [`MAX_PASSWORD_LENGTH`] characters.
331    ///
332    /// Returns a [`Vec<u8>`] which can be persisted and later decrypted using
333    /// only the given password.
334    ///
335    /// [`MIN_PASSWORD_LENGTH`]: lexe_crypto::password::MIN_PASSWORD_LENGTH
336    /// [`MAX_PASSWORD_LENGTH`]: lexe_crypto::password::MAX_PASSWORD_LENGTH
337    pub fn password_encrypt(
338        &self,
339        rng: &mut impl Crng,
340        password: &str,
341    ) -> anyhow::Result<Vec<u8>> {
342        // Sample a completely random salt for maximum security.
343        let salt = rng.gen_bytes();
344
345        // Obtain the password-encrypted AES ciphertext.
346        let mut aes_ciphertext =
347            password::encrypt(rng, password, &salt, self.0.expose_secret())
348                .context("Password encryption failed")?;
349
350        // Final persistable value is `salt || aes_ciphertext`
351        let mut combined = Vec::from(salt);
352        combined.append(&mut aes_ciphertext);
353
354        // Sanity check the length of the combined salt + aes_ciphertext.
355        // Combined length is 32 bytes (salt) + encrypted length of 32 byte seed
356        let expected_combined_len = 32 + aes::encrypted_len(32);
357        assert!(combined.len() == expected_combined_len);
358
359        Ok(combined)
360    }
361
362    /// Attempts to construct a [`RootSeed`] given a decryption password and the
363    /// [`Vec<u8>`] returned from a previous call to [`password_encrypt`].
364    ///
365    /// [`password_encrypt`]: Self::password_encrypt
366    pub fn password_decrypt(
367        password: &str,
368        mut combined: Vec<u8>,
369    ) -> anyhow::Result<Self> {
370        // Combined length is 32 bytes (salt) + encrypted length of 32 byte seed
371        let expected_combined_len = 32 + aes::encrypted_len(32);
372        ensure!(
373            combined.len() == expected_combined_len,
374            "Combined bytes had the wrong length"
375        );
376
377        // Split `salt || aes_ciphertext` into component parts
378        let aes_ciphertext = combined.split_off(32);
379        let unsized_salt = combined.into_boxed_slice();
380        let salt = Box::<[u8; 32]>::try_from(unsized_salt)
381            .expect("We split off at 32, so there are exactly 32 bytes");
382
383        // Password-decrypt.
384        let root_seed_bytes =
385            password::decrypt(password, &salt, aes_ciphertext)
386                .map(Secret::new)
387                .context("Password decryption failed")?;
388
389        // Construct the RootSeed
390        Self::try_from(root_seed_bytes.expose_secret().as_slice())
391    }
392}
393
394impl ExposeSecret<[u8; Self::LENGTH]> for RootSeed {
395    fn expose_secret(&self) -> &[u8; Self::LENGTH] {
396        self.0.expose_secret()
397    }
398}
399
400impl FromStr for RootSeed {
401    type Err = hex::DecodeError;
402
403    fn from_str(hex: &str) -> Result<Self, Self::Err> {
404        let mut bytes = [0u8; Self::LENGTH];
405        hex::decode_to_slice(hex, bytes.as_mut_slice())
406            .map(|()| Self::new(Secret::new(bytes)))
407    }
408}
409
410impl fmt::Debug for RootSeed {
411    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
412        // Avoid formatting secrets.
413        f.write_str("RootSeed(..)")
414    }
415}
416
417impl TryFrom<&[u8]> for RootSeed {
418    type Error = anyhow::Error;
419
420    fn try_from(bytes: &[u8]) -> Result<Self, Self::Error> {
421        if bytes.len() != Self::LENGTH {
422            bail!("input must be {} bytes", Self::LENGTH);
423        }
424        let mut out = [0u8; Self::LENGTH];
425        out[..].copy_from_slice(bytes);
426        Ok(Self::new(Secret::new(out)))
427    }
428}
429
430impl TryFrom<bip39::Mnemonic> for RootSeed {
431    type Error = anyhow::Error;
432
433    fn try_from(mnemonic: bip39::Mnemonic) -> Result<Self, Self::Error> {
434        use lexe_std::array::ArrayExt;
435
436        // to_entropy_array() returns [u8; 33]
437        let (entropy, entropy_len) = mnemonic.to_entropy_array();
438        let entropy = secrecy::zeroize::Zeroizing::new(entropy);
439
440        ensure!(entropy_len == 32, "Should contain exactly 32 bytes");
441
442        let (seed_buf, _remainder) = entropy.split_array_ref_stable::<32>();
443
444        Ok(Self(Secret::new(*seed_buf)))
445    }
446}
447
448struct RootSeedVisitor;
449
450impl de::Visitor<'_> for RootSeedVisitor {
451    type Value = RootSeed;
452
453    fn expecting(&self, f: &mut fmt::Formatter) -> fmt::Result {
454        f.write_str("hex-encoded RootSeed or raw bytes")
455    }
456
457    fn visit_str<E>(self, v: &str) -> Result<Self::Value, E>
458    where
459        E: de::Error,
460    {
461        RootSeed::from_str(v).map_err(serde::de::Error::custom)
462    }
463
464    fn visit_bytes<E>(self, b: &[u8]) -> Result<Self::Value, E>
465    where
466        E: de::Error,
467    {
468        RootSeed::try_from(b).map_err(de::Error::custom)
469    }
470}
471
472impl<'de> Deserialize<'de> for RootSeed {
473    fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
474    where
475        D: Deserializer<'de>,
476    {
477        if deserializer.is_human_readable() {
478            deserializer.deserialize_str(RootSeedVisitor)
479        } else {
480            deserializer.deserialize_bytes(RootSeedVisitor)
481        }
482    }
483}
484
485impl Serialize for RootSeed {
486    fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
487    where
488        S: Serializer,
489    {
490        if serializer.is_human_readable() {
491            let hex_str = hex::encode(self.0.expose_secret());
492            serializer.serialize_str(&hex_str)
493        } else {
494            serializer.serialize_bytes(self.0.expose_secret())
495        }
496    }
497}
498
499#[cfg(any(test, feature = "test-utils"))]
500mod test_impls {
501    use proptest::{
502        arbitrary::{Arbitrary, any},
503        strategy::{BoxedStrategy, Strategy},
504    };
505
506    use super::*;
507
508    impl Arbitrary for RootSeed {
509        type Strategy = BoxedStrategy<Self>;
510        type Parameters = ();
511
512        fn arbitrary_with(_args: Self::Parameters) -> Self::Strategy {
513            any::<[u8; 32]>()
514                .prop_map(|buf| Self::new(Secret::new(buf)))
515                .no_shrink()
516                .boxed()
517        }
518    }
519
520    // only impl PartialEq in tests; not safe to compare root seeds w/o constant
521    // time comparison.
522    impl PartialEq for RootSeed {
523        fn eq(&self, other: &Self) -> bool {
524            self.expose_secret() == other.expose_secret()
525        }
526    }
527}
528
529#[cfg(test)]
530mod test {
531    use std::path::Path;
532
533    use bitcoin::NetworkKind;
534    use lexe_crypto::rng::FastRng;
535    use lexe_sha256::sha256;
536    use proptest::{
537        arbitrary::any, collection::vec, prop_assert_eq, proptest,
538        strategy::Strategy, test_runner::Config,
539    };
540
541    use super::*;
542    use crate::ln::network::Network;
543
544    // simple implementations of some crypto functions for equivalence testing
545
546    // an inefficient impl of HMAC-SHA256 for equivalence testing
547    fn hmac_sha256(key: &[u8], msg: &[u8]) -> sha256::Hash {
548        let h_key = sha256::digest(key);
549        let mut zero_pad_key = [0u8; 64];
550
551        // make key match the internal block size
552        let key = match key.len() {
553            len if len > 64 => h_key.as_ref(),
554            _ => key,
555        };
556        zero_pad_key[..key.len()].copy_from_slice(key);
557        let key = zero_pad_key.as_slice();
558        assert_eq!(key.len(), 64);
559
560        // o_key := [ key_i ^ 0x5c ]_{i in 0..64}
561        let mut o_key = [0u8; 64];
562        for (o_key_i, key_i) in o_key.iter_mut().zip(key) {
563            *o_key_i = key_i ^ 0x5c;
564        }
565
566        // i_key := [ key_i ^ 0x36 ]_{i in 0..64}
567        let mut i_key = [0u8; 64];
568        for (i_key_i, key_i) in i_key.iter_mut().zip(key) {
569            *i_key_i = key_i ^ 0x36;
570        }
571
572        // h_i := H(i_key || msg)
573        let h_i = sha256::digest_many(&[&i_key, msg]);
574
575        // output := H(o_key || H(i_key || msg))
576        sha256::digest_many(&[&o_key, h_i.as_ref()])
577    }
578
579    // an inefficient impl of HKDF-SHA256 for equivalence testing
580    fn hkdf_sha256(
581        ikm: &[u8],
582        salt: &[u8],
583        info: &[&[u8]],
584        out_len: usize,
585    ) -> Vec<u8> {
586        let prk = hmac_sha256(salt, ikm);
587
588        // N := ceil(out_len / block_size)
589        //   := (out_len.saturating_sub(1) / block_size) + 1
590        let n = (out_len.saturating_sub(1) / 32) + 1;
591        let n = u8::try_from(n).expect("out_len too large");
592
593        // T := T(1) | T(2) | .. | T(N)
594        // T(0) := b"" (empty byte string)
595        // T(i+1) := hmac_sha256(prk, T(i) || info || [ i+1 ])
596
597        let mut t_i = [0u8; 32];
598        let mut out = Vec::new();
599
600        for i in 1..=n {
601            // m_i := T(i-1) || info || [ i ]
602            let mut m_i = if i == 1 { Vec::new() } else { t_i.to_vec() };
603            for info_part in info {
604                m_i.extend_from_slice(info_part);
605            }
606            m_i.extend_from_slice(&[i]);
607
608            let h_i = hmac_sha256(prk.as_ref(), &m_i);
609            t_i.copy_from_slice(h_i.as_ref());
610
611            if i < n {
612                out.extend_from_slice(&t_i[..]);
613            } else {
614                let l = 32 - (((n as usize) * 32) - out_len);
615                out.extend_from_slice(&t_i[..l]);
616            }
617        }
618
619        out
620    }
621
622    /// ```bash
623    /// $ cargo test -p common -- dump_root_seed --ignored --show-output
624    /// ```
625    #[ignore]
626    #[test]
627    fn dump_root_seed() {
628        let root_seed = RootSeed::from_u64(20240506);
629        let root_seed_hex = hex::encode(root_seed.expose_secret());
630        let user_pk = root_seed.derive_user_pk();
631        let node_pk = root_seed.derive_node_pk();
632
633        println!(
634            "root_seed: '{root_seed_hex}', \
635             user_pk: '{user_pk}', node_pk: '{node_pk}'"
636        );
637    }
638
639    #[test]
640    fn test_root_seed_serde() {
641        let input =
642            "7f83b1657ff1fc53b92dc18148a1d65dfc2d4b1fa3d677284addd200126d9069";
643        let input_json = format!("\"{input}\"");
644        let seed_bytes = hex::decode(input).unwrap();
645
646        let seed = RootSeed::from_str(input).unwrap();
647        assert_eq!(seed.as_bytes(), &seed_bytes);
648
649        let seed2: RootSeed = serde_json::from_str(&input_json).unwrap();
650        assert_eq!(seed2.as_bytes(), &seed_bytes);
651
652        #[derive(Deserialize)]
653        struct Foo {
654            x: u32,
655            seed: RootSeed,
656            y: String,
657        }
658
659        let foo_json = format!(
660            "{{\n\
661            \"x\": 123,\n\
662            \"seed\": \"{input}\",\n\
663            \"y\": \"asdf\"\n\
664        }}"
665        );
666
667        let foo2: Foo = serde_json::from_str(&foo_json).unwrap();
668        assert_eq!(foo2.x, 123);
669        assert_eq!(foo2.seed.as_bytes(), &seed_bytes);
670        assert_eq!(foo2.y, "asdf");
671    }
672
673    #[test]
674    fn test_root_seed_derive() {
675        let seed = RootSeed::from_u64(0x42);
676
677        let out8 = seed.derive_vec(&[b"very cool secret"], 8);
678        let out16 = seed.derive_vec(&[b"very cool secret"], 16);
679        let out32 = seed.derive_vec(&[b"very cool secret"], 32);
680        let out32_2 = seed.derive(&[b"very cool secret"]);
681
682        assert_eq!("c724f46ae4c48017", hex::encode(out8.expose_secret()));
683        assert_eq!(
684            "c724f46ae4c480172a75cf775dbb64b1",
685            hex::encode(out16.expose_secret())
686        );
687        assert_eq!(
688            "c724f46ae4c480172a75cf775dbb64b160beb74137eb7d0cef72fde0523674de",
689            hex::encode(out32.expose_secret())
690        );
691        assert_eq!(out32.expose_secret(), out32_2.expose_secret());
692    }
693
694    // Fuzz our KDF against a basic, readable implementation of HKDF-SHA256.
695    #[test]
696    fn test_root_seed_derive_equiv() {
697        let arb_seed = any::<RootSeed>();
698        let arb_label = vec(vec(any::<u8>(), 0..=64), 0..=4);
699        let arb_len = 0_usize..=1024;
700
701        proptest!(|(seed in arb_seed, label in arb_label, len in arb_len)| {
702            let label = label
703                .iter()
704                .map(|x| x.as_slice())
705                .collect::<Vec<_>>();
706
707            let expected = hkdf_sha256(
708                seed.as_bytes(),
709                RootSeed::HKDF_SALT.as_slice(),
710                &label,
711                len,
712            );
713
714            let actual = seed.derive_vec(&label, len);
715
716            assert_eq!(&expected, actual.expose_secret());
717        });
718    }
719
720    /// A series of tests that demonstrate when the [`Network`] affects the
721    /// partial equality of key material at various stages of derivation.
722    /// This helps determine whether our APIs should take a [`Network`] as a
723    /// parameter, or if setting a default would be sufficient.
724    #[test]
725    fn when_does_network_matter() {
726        proptest!(|(
727            root_seed in any::<RootSeed>(),
728            network1 in any::<Network>(),
729            network2 in any::<Network>(),
730        )| {
731            let network_kind1 = NetworkKind::from(network1.to_bitcoin());
732            let network_kind2 = NetworkKind::from(network2.to_bitcoin());
733
734            // Network DOES matter for master xprvs (and all xprvs in general),
735            // but only to the extent that their `NetworkKind` is different.
736            // i.e. a `Signet` and `Testnet` xprv may be considered the same.
737            let master_xprv1 = root_seed.derive_legacy_master_xprv(network1);
738            let master_xprv2 = root_seed.derive_legacy_master_xprv(network2);
739            // Assert: "master xprvs are equal iff network kinds are equal"
740            let master_xprvs_equal = master_xprv1 == master_xprv2;
741            let network_kinds_equal = network_kind1 == network_kind2;
742            prop_assert_eq!(master_xprvs_equal, network_kinds_equal);
743
744            // Test derive_ldk_seed(): The [u8; 32] LDK seed should be the same
745            // regardless of the network of the master_xprv it was based on
746            let m_535h = ChildNumber::from_hardened_idx(535)
747                .expect("Is within [0, 2^31-1]");
748            let ldk_seed1 = master_xprv1
749                .derive_priv(&SECP256K1, &m_535h)
750                .expect("Should always succeed")
751                .private_key
752                .secret_bytes();
753            let ldk_seed2 = master_xprv2
754                .derive_priv(&SECP256K1, &m_535h)
755                .expect("Should always succeed")
756                .private_key
757                .secret_bytes();
758            prop_assert_eq!(ldk_seed1, ldk_seed2);
759            let ldk_seed = ldk_seed1;
760
761            // Test derive_node_key_pair() and derive_node_pk(): The outputted
762            // secp256k1::Keypair should be the same regardless of the network
763            // of the ldk_xprv it was based on
764            let ldk_xprv1 = bip32::Xpriv::new_master(network1.to_bitcoin(), &ldk_seed)
765                .expect("Should never fail");
766            let ldk_xprv2 = bip32::Xpriv::new_master(network2.to_bitcoin(), &ldk_seed)
767                .expect("Should never fail");
768            // Assert: "ldk_xprvs are equal iff network kinds are equal"
769            let ldk_xprvs_equal = ldk_xprv1 == ldk_xprv2;
770            prop_assert_eq!(ldk_xprvs_equal, network_kinds_equal);
771            // First check the node_sks
772            let m_0h = ChildNumber::from_hardened_idx(0)
773                .expect("should never fail; index is in range");
774            let node_sk1 = ldk_xprv1
775                .derive_priv(&SECP256K1, &m_0h)
776                .expect("should never fail")
777                .private_key;
778            let node_sk2 = ldk_xprv2
779                .derive_priv(&SECP256K1, &m_0h)
780                .expect("should never fail")
781                .private_key;
782            prop_assert_eq!(node_sk1, node_sk2);
783            // Then check the keypairs
784            let keypair1 =
785                secp256k1::Keypair::from_secret_key(&SECP256K1, &node_sk1);
786            let keypair2 =
787                secp256k1::Keypair::from_secret_key(&SECP256K1, &node_sk2);
788            prop_assert_eq!(keypair1, keypair2);
789            // Then check the node_pks
790            let node_pk1 = NodePk(secp256k1::PublicKey::from(keypair1));
791            let node_pk2 = NodePk(secp256k1::PublicKey::from(keypair2));
792            prop_assert_eq!(node_pk1, node_pk2);
793            // Then check the serialized node_pks
794            let node_pk1_str = node_pk1.to_string();
795            let node_pk2_str = node_pk2.to_string();
796            prop_assert_eq!(node_pk1_str, node_pk2_str);
797        });
798    }
799
800    #[test]
801    fn password_encryption_roundtrip() {
802        use password::{MAX_PASSWORD_LENGTH, MIN_PASSWORD_LENGTH};
803
804        let password_length_range = MIN_PASSWORD_LENGTH..MAX_PASSWORD_LENGTH;
805        let any_valid_password =
806            proptest::collection::vec(any::<char>(), password_length_range)
807                .prop_map(String::from_iter);
808
809        // Reduce cases since we do key stretching which is quite expensive
810        let config = Config::with_cases(4);
811        proptest!(config, |(
812            mut rng in any::<FastRng>(),
813            password in any_valid_password,
814        )| {
815            let root_seed1 = RootSeed::from_rng(&mut rng);
816            let encrypted = root_seed1.password_encrypt(&mut rng, &password)
817                .unwrap();
818            let root_seed2 = RootSeed::password_decrypt(&password, encrypted)
819                .unwrap();
820            assert_eq!(root_seed1, root_seed2);
821        })
822    }
823
824    #[test]
825    fn password_decryption_compatibility() {
826        let root_seed1 = RootSeed::new(Secret::new([69u8; 32]));
827        let password1 = "password1234";
828        // // Uncomment to regenerate
829        // let mut rng = FastRng::from_u64(20231017);
830        // let encrypted =
831        //     root_seed1.password_encrypt(&mut rng, password1).unwrap();
832        // let encrypted_hex = hex::display(&encrypted);
833        // println!("Encrypted: {encrypted_hex}");
834
835        let encrypted = hex::decode("adcfc4aef26858bacfae83dd19e735bb145203ab18183cbe932cd742b4446e7300b561678b0652666b316288bbb57552c4f40e91d8e440fd1085cba610204ca982f52fce471de27fe360e9560cee0996e55ce7ac323201908b7ff261b8ff425a87d215e83870e45062d988627c8cb7216b").unwrap();
836        let root_seed1_decrypted =
837            RootSeed::password_decrypt(password1, encrypted).unwrap();
838        assert_eq!(root_seed1, root_seed1_decrypted);
839
840        let root_seed2 = RootSeed::new(Secret::new([0u8; 32]));
841        let password2 = "                ";
842        // // Uncomment to regenerate
843        // let mut rng = FastRng::from_u64(20231017);
844        // let encrypted =
845        //     root_seed2.password_encrypt(&mut rng, password2).unwrap();
846        // let encrypted_hex = hex::display(&encrypted);
847        // println!("Encrypted: {encrypted_hex}");
848
849        let encrypted = hex::decode("adcfc4aef26858bacfae83dd19e735bb145203ab18183cbe932cd742b4446e7300b561678b0652666b316288bbb57552c4f40e91d8e440fd1085cba610204ca982062fbcb21c14cdb9d107f2f359e0f272e473d2cdb71a870d8fb19d1169c160876ee1ccde4f73a8f2b4ebc9bed68f6139").unwrap();
850        let root_seed2_decrypted =
851            RootSeed::password_decrypt(password2, encrypted).unwrap();
852        assert_eq!(root_seed2, root_seed2_decrypted);
853    }
854
855    #[test]
856    fn root_seed_mnemonic_round_trip() {
857        proptest!(|(root_seed1 in any::<RootSeed>())| {
858            let mnemonic = root_seed1.to_mnemonic();
859
860            // All mnemonics should have exactly 24 words.
861            prop_assert_eq!(mnemonic.word_count(), 24);
862
863            let root_seed2 = RootSeed::try_from(mnemonic).unwrap();
864            prop_assert_eq!(
865                root_seed1.expose_secret(), root_seed2.expose_secret()
866            );
867        });
868    }
869
870    /// Check correctness of `bip39::Mnemonic`'s `FromStr` / `Display` impls
871    #[test]
872    fn mnemonic_fromstr_display_roundtrip() {
873        proptest!(|(root_seed in any::<RootSeed>())| {
874            let mnemonic1 = root_seed.to_mnemonic();
875            let mnemonic2 = bip39::Mnemonic::from_str(&mnemonic1.to_string()).unwrap();
876            prop_assert_eq!(mnemonic1, mnemonic2)
877        })
878    }
879
880    /// A basic compatibility test to check that a few "known good" pairings of
881    /// [`RootSeed`] <-> [`Mnemonic`] <-> [`String`] still correspond. This
882    /// ensures that the [`bip39`] crate cannot introduce compatibility-breaking
883    /// changes without us noticing.
884    #[test]
885    fn mnemonic_compatibility_test() {
886        // This code generated the "known good" values
887        // let mut rng = FastRng::from_u64(98592174);
888        // let seed1 = RootSeed::from_rng(&mut rng);
889        // let seed2 = RootSeed::from_rng(&mut rng);
890        // let seed3 = RootSeed::from_rng(&mut rng);
891        // let seed1_str = hex::encode(seed1.as_bytes());
892        // let seed2_str = hex::encode(seed2.as_bytes());
893        // let seed3_str = hex::encode(seed3.as_bytes());
894        // println!("{seed1_str}");
895        // println!("{seed2_str}");
896        // println!("{seed3_str}");
897        // let mnenemenmenomic1 = seed1.to_mnemonic().to_string();
898        // let mnenemenmenomic2 = seed2.to_mnemonic().to_string();
899        // let mnenemenmenomic3 = seed3.to_mnemonic().to_string();
900        // println!("{mnenemenmenomic1}");
901        // println!("{mnenemenmenomic2}");
902        // println!("{mnenemenmenomic3}");
903
904        // "Known good" seeds
905        let seed1 = RootSeed::new(Secret::new(hex::decode_const(
906            b"91f24ce8326abc2e9faef6a3b866021ce9574c11210e86b0f457a31ed8ad4cba",
907        )));
908        let seed2 = RootSeed::new(Secret::new(hex::decode_const(
909            b"5c2aa5fdd678112c8b13d745b5c1d1e1a81ace76721ec72f1424bd2eb387a8af",
910        )));
911        let seed3 = RootSeed::new(Secret::new(hex::decode_const(
912            b"51ddba4775fc71fb1dba65dfc2ffab7526dd61bae7a9b13e9f3aa550bee19360",
913        )));
914
915        // "Known good" mnemonic strings
916        let str1 = String::from(
917            "music mystery deliver gospel profit blanket leaf tell \
918            photo segment letter degree nice plastic duty canyon \
919            mammal marble bicycle economy unique find cream dune",
920        );
921        let str2 = String::from(
922            "found festival legal provide library north clump kit \
923            east puppy inner select like grunt supply duck \
924            shrimp judge ankle kid twenty sense pencil tray",
925        );
926        let str3 = String::from(
927            "fade universe mushroom typical shove work ivory erosion \
928            thank blood turn tumble horse radio twist vivid \
929            raise visual solid enjoy armor ignore eternal arrange",
930        );
931
932        // Check `Mnemonic`
933        let mnemonic_from_str1 = bip39::Mnemonic::from_str(&str1).unwrap();
934        let mnemonic_from_str2 = bip39::Mnemonic::from_str(&str2).unwrap();
935        let mnemonic_from_str3 = bip39::Mnemonic::from_str(&str3).unwrap();
936        assert_eq!(seed1.to_mnemonic(), mnemonic_from_str1);
937        assert_eq!(seed2.to_mnemonic(), mnemonic_from_str2);
938        assert_eq!(seed3.to_mnemonic(), mnemonic_from_str3);
939
940        // Check `RootSeed`
941        let seed_from_str1 =
942            RootSeed::try_from(mnemonic_from_str1.clone()).unwrap();
943        let seed_from_str2 =
944            RootSeed::try_from(mnemonic_from_str2.clone()).unwrap();
945        let seed_from_str3 =
946            RootSeed::try_from(mnemonic_from_str3.clone()).unwrap();
947        assert_eq!(seed1.as_bytes(), seed_from_str1.as_bytes());
948        assert_eq!(seed2.as_bytes(), seed_from_str2.as_bytes());
949        assert_eq!(seed3.as_bytes(), seed_from_str3.as_bytes());
950
951        // Check `String`
952        assert_eq!(str1, seed1.to_mnemonic().to_string());
953        assert_eq!(str2, seed2.to_mnemonic().to_string());
954        assert_eq!(str3, seed3.to_mnemonic().to_string());
955    }
956
957    /// Snapshot tests to ensure key derivations don't change.
958    /// These protect backwards compatibility for existing wallets.
959    #[test]
960    fn derive_snapshots() {
961        let seed = RootSeed::from_u64(20240506);
962
963        // Lexe user pubkey
964        let user_pk = seed.derive_user_pk();
965        assert_eq!(
966            user_pk.to_string(),
967            "a9edf9596ddf589918beca32d148a7d0ba59273b419ccf63a910f1b75861ff06",
968        );
969
970        // Lightning node pubkey
971        let node_pk = seed.derive_node_pk();
972        assert_eq!(
973            node_pk.to_string(),
974            "035a70d45eec7efb270319f116a9684250acb4ef282a26d21874878e7c5088f73b",
975        );
976
977        // LDK seed (used to initialize KeysManager)
978        let ldk_seed = seed.derive_ldk_seed();
979        assert_eq!(
980            hex::encode(ldk_seed.expose_secret()),
981            "551444699ae8acbebe67d5b54da844e8297b83e26e205203a65f29564eaf3787",
982        );
983
984        // BIP39 compatible 64-byte seed
985        let bip39_seed = seed.derive_bip39_seed();
986        assert_eq!(
987            hex::encode(bip39_seed.expose_secret()),
988            "30dc1cca6811e6f52a6efba751db4fe9495883b778c72b28ee248f0076cf03b9\
989             dc3c3d7d662c98806ce59c0e59911a249533ca0c82dea3780cdf040f9a3dfe09",
990        );
991
992        // BIP39-compatible master xpriv (for new on-chain wallets)
993        let bip39_master_xpriv =
994            seed.derive_bip32_master_xprv(Network::Mainnet);
995        assert_eq!(
996            bip39_master_xpriv.to_string(),
997            "xprv9s21ZrQH143K3BwTSDGEpsQA99b5fmckcX2s4dBbxojs287ApWXGThVTu9\
998             TmogYG8A1JiUnbD6gHSfw5hXsTduny878ygutaCaCvg1KTvgM",
999        );
1000
1001        // BIP39-compatible master xpriv (Testnet)
1002        let bip39_testnet_xpriv =
1003            seed.derive_bip32_master_xprv(Network::Testnet3);
1004        assert_eq!(
1005            bip39_testnet_xpriv.to_string(),
1006            "tprv8ZgxMBicQKsPe1Az6n7jzX29TH1HuHekx4wyw3c4SnELoirFoss1ySrupK\
1007             dRp3vaVbY5iaQMNTG5uXUppkDQSy4ZekMHMGcd7fxM7h7WWqo"
1008        );
1009
1010        // Legacy Lexe master xpriv (used for existing on-chain wallets)
1011        let master_xpriv = seed.derive_legacy_master_xprv(Network::Mainnet);
1012        assert_eq!(
1013            master_xpriv.to_string(),
1014            "xprv9s21ZrQH143K42JPXVa2Q7nAp6XB3FVwyYdGkQetMYRcprZXKvt52p1tqg\
1015             9fwyFJaL6Ki92bCdRNDPAnyddy7CzpQAEktM8nMtNGw4Xj6vt",
1016        );
1017
1018        // Legacy Lexe master xpriv (Testnet)
1019        let master_xpriv_testnet =
1020            seed.derive_legacy_master_xprv(Network::Testnet3);
1021        assert_eq!(
1022            master_xpriv_testnet.to_string(),
1023            "tprv8ZgxMBicQKsPeqXvC4RXZmQA8DwPGmXxK6YPcq5LqWv6cTJcKJDpYZPLk\
1024             rKKxLdcwmd6iEeMMz1AgEiY6qyuvGGQvoT4YhrqGz7hNoR5R4G",
1025        );
1026
1027        // Ephemeral issuing CA pubkey
1028        let ephemeral_ca = seed.derive_ephemeral_issuing_ca_key_pair();
1029        assert_eq!(
1030            ephemeral_ca.public_key().to_string(),
1031            "70656b5a6084c457bf004dad264cecc131879b7e6791fe0cc828c38cc0df6e92",
1032        );
1033
1034        // Revocable issuing CA pubkey
1035        let revocable_ca = seed.derive_revocable_issuing_ca_key_pair();
1036        assert_eq!(
1037            revocable_ca.public_key().to_string(),
1038            "efe6e020ba9ca4a50467cdbaff469f9d465f21d1c6fe976868a20d97bbaa2ee3",
1039        );
1040
1041        // VFS master key (via derivation + encryption)
1042        let vfs_ctxt = seed.derive_vfs_master_key().encrypt(
1043            &mut FastRng::from_u64(1234),
1044            &[],
1045            None,
1046            &|out: &mut Vec<u8>| out.extend_from_slice(b"test"),
1047        );
1048        assert_eq!(
1049            hex::encode(&vfs_ctxt),
1050            "0000a7e6a0514440b57fcf6df97b46132adde062f1a5a224aacf4fa0f286b4c56\
1051             fe2768b7dad22333936638c5734f0d529a74880aa",
1052        );
1053    }
1054
1055    /// Verify the BIP39 mnemonic buffer size constant is large enough.
1056    #[test]
1057    fn bip39_mnemonic_buf_size() {
1058        let words = bip39::Language::English.word_list();
1059        let max_word_len = words.iter().map(|w| w.len()).max().unwrap();
1060        assert_eq!(max_word_len, 8);
1061
1062        let root_seed = RootSeed::from_u64(20240506);
1063        let mnemonic = root_seed.to_mnemonic();
1064        let num_words = mnemonic.words().count();
1065        assert_eq!(num_words, 24);
1066
1067        // Max size: 24 words * 8 chars + 23 spaces = 215 bytes
1068        assert!(
1069            (max_word_len + 1) * num_words <= RootSeed::BIP39_MNEMONIC_BUF_SIZE
1070        );
1071    }
1072
1073    /// Verify our BIP39 seed derivation matches the rust-bip39 crate.
1074    #[test]
1075    fn derive_bip39_seed_matches_rust_bip39() {
1076        proptest!(|(root_seed in any::<RootSeed>())| {
1077            let mnemonic = root_seed.to_mnemonic();
1078
1079            // Our implementation
1080            let our_seed = root_seed.derive_bip39_seed();
1081
1082            // rust-bip39 implementation (empty passphrase)
1083            let their_seed = mnemonic.to_seed_normalized("");
1084
1085            prop_assert_eq!(our_seed.expose_secret(), &their_seed);
1086        });
1087    }
1088
1089    // ```bash
1090    // $ nix shell .#secretctl
1091    // $ PASSWORD=".." IN_PATH=".." \
1092    //     cargo test -p lexe-common --lib -- test_decrypt_root_seed --nocapture --ignored
1093    // ```
1094    #[test]
1095    #[ignore]
1096    fn test_decrypt_root_seed() {
1097        let password = std::env::var("PASSWORD").expect("`$PASSWORD` not set");
1098        let in_path = std::env::var_os("IN_PATH").expect("`$IN_PATH` not set");
1099        let in_path = Path::new(&in_path);
1100
1101        let ciphertext = std::fs::read(in_path).unwrap();
1102        let root_seed = RootSeed::password_decrypt(&password, ciphertext)
1103            .expect("Failed to decrypt");
1104
1105        let root_seed_bytes = root_seed.expose_secret().as_slice();
1106        let mut root_seed_hex = hex::encode(root_seed_bytes);
1107        println!("{root_seed_hex}");
1108
1109        root_seed_hex.zeroize();
1110    }
1111}