Big Barry Bitcoin on Nostr: Yeah, multisig offers the ability to spread trust across multiple hww, but ...
Yeah, multisig offers the ability to spread trust across multiple hww, but conversely, it kind of mandates it too. If you are gonna use a single device, with MAYBE the exception of seed signers.
If you were gonna do it all on one device, then what's the pojnt of it? You're bringing the keys into one place, and even if not, you're bringing the keys onto one device.
The main benefit to seedxor for me is that you never lose entropy, or better said, the entropy is only ever as low as the lowest entropy key.
As an example, if I have a random key and xor it wjth 11111.... then if you find the random key, then you are way more than half way there. Conversely if all keys are properly generated, then even if you have 2 of 3 of the 128bit keys, you still are 0% of the way to finding the final answer.
Get me? Like if you have a 256bit 24 word phrase, and split it into 2, 12, and I find the first 12 words, I'm half way there. I only need to brute force 128bits.
If you have 3 128 bit keys, and you find 1 of them, you have nothing, you still need to brute 128 bits... if you find 2 of 3, same, brute 128 bits. If you had 0, brute 128 bits.
Plus each key is valid, checksum and all. So you never even have any clue how many parts there are.
If you were gonna do it all on one device, then what's the pojnt of it? You're bringing the keys into one place, and even if not, you're bringing the keys onto one device.
The main benefit to seedxor for me is that you never lose entropy, or better said, the entropy is only ever as low as the lowest entropy key.
As an example, if I have a random key and xor it wjth 11111.... then if you find the random key, then you are way more than half way there. Conversely if all keys are properly generated, then even if you have 2 of 3 of the 128bit keys, you still are 0% of the way to finding the final answer.
Get me? Like if you have a 256bit 24 word phrase, and split it into 2, 12, and I find the first 12 words, I'm half way there. I only need to brute force 128bits.
If you have 3 128 bit keys, and you find 1 of them, you have nothing, you still need to brute 128 bits... if you find 2 of 3, same, brute 128 bits. If you had 0, brute 128 bits.
Plus each key is valid, checksum and all. So you never even have any clue how many parts there are.