I recommend stopping at the 15 min mark and watch this video on Shamir: https://youtu.be/iFY5SyY3IMQ

FROSTR
By TGFB Media Podcast Network
Aired Apr 8, 2025 · 1h 46m · Last boosted Apr 9, 2025
Chapters
Show Notes
bitcoinplebdev and cmd are building FROSTR, a multi-signature aggregation scheme for nostr key management.
Nostr Boost Stats
- sats
- 390
- boosts
- 3
- boosters
- 3
- sats
- 0
- boosts
- 0
- boosters
- 0
- sats
- 0
- boosts
- 0
- boosters
- 0
- sats
- 0
- boosts
- 0
- boosters
- 0
Nostr Community
Everyone who has boosted FROSTR on Nostr, ranked by sats sent, all time.
-
Pip the WoT guy
169 sats
-
florian
121 sats
-
average_gary
100 sats
Episode Boosts
Every boost sent to this episode, as published to Nostr, newest first.
-
-
-
no one in this podcast mentioned exactly how a 2-of-3 Shamir secret sharing works, which is a shame because it's super simple. Here is how: First, the secret S is a number, or can be represented as such. Second, when you generate the shares for the secret S, you come up with a random line that pass throughout the point (0,S). For example the line (a is random): y = a*x + S Then, you take three more points that are not the original point (0,S), for example: P1 = (1, a+S) P2 = (2,2a+S) P3 = (3,3a+S) (check this points are on the line) How many lines go through 2 points? That's easy, only one. This means that with only two of these points, we can find the line, and then the secret. For example, If we have the first two points P1 and P2, we can do: 2*P1 - P2 = (2-2, 2a+2S -2a -S) = (0,S) ta daaaa! We've got the secret back. This is the basic for a 2-of-3 SSS. To increase the second number, just generate more points at the shares creation. To increase the number, you have to use polynomials of higher degrees, for example a parabola (3-of-whatever), a cubical (4-of-whatever), and so on.





















