| 16 Jul 2025 |
K900 | I don't think there's a solution for achieving this that is actually good | 20:24:57 |
K900 | Any sort of consensus algorithm is susceptible to 51% attacks | 20:25:16 |
K900 | And CRDTs are susceptible to splits | 20:25:28 |
@magic_rb:matrix.redalder.org | 51% is a fun one, ive long been fascinates by distributed systems, but any system you come up with which is based on consensus can be taken over by the 51% thing | 20:30:40 |
K900 | The only thing I can think of is doing some kind of roughtime thing | 20:31:15 |
@magic_rb:matrix.redalder.org | Roughtime? | 20:31:34 |
K900 | Where you have an external trusted timing oracle | 20:31:34 |
K900 | Or five | 20:31:39 |
@magic_rb:matrix.redalder.org | "Trusted" and "distributed" dont go together :P | 20:31:59 |
K900 | But that's arguably a single point of failure | 20:32:00 |
@magic_rb:matrix.redalder.org | (So is matrix.org) | 20:32:12 |
K900 | In reply to @magic_rb:matrix.redalder.org Roughtime? https://roughtime.googlesource.com/roughtime | 20:32:13 |
@magic_rb:matrix.redalder.org | Oh nice, didnt know rhat | 20:33:51 |
K900 | But you still need to agree on the set of roughtime servers to trust | 20:34:32 |
K900 | Or include a giant pile of receipts in every state event just in case someone in the federation trusts that particular server | 20:35:21 |
@magic_rb:matrix.redalder.org | Distributed systems are hard :( | 20:38:06 |
c-x-berger | http://scholar.harvard.edu/files/mickens/files/thesaddestmoment.pdf | 20:38:22 |
c-x-berger | * for further reading http://scholar.harvard.edu/files/mickens/files/thesaddestmoment.pdf | 20:38:37 |
emily | https://developers.cloudflare.com/time-services/roughtime/ fwiw | 20:55:30 |
emily | cloudflare kinda adopted the protocol from google at this point | 20:55:43 |