For this reason, @spritely's tech looks like it's very focused on computer science'y low-level BS, but that's actually because it's *too hard to build the systems I want right now on top of current technology*, we need stronger foundations
But people have to build for today too
It's for that reason that @spritely, while aiming for a *socially collaborative* revolution, is first focusing on a *technical* revolution.
It's too hard to build massively, securely collaborative tools right now. With Spritely's tools, p2p ocap secure tech is the *default output*.
The vision laid out for the fediverse, both independently in my writings and even in Jay Graber and I's joint proposal... well, it's a big lift.
@spritely would like to see if we can retrofit our version onto ActivityPub. Time will tell if that's a separate thing.
transphobia, uspol, returning to tech in a sec
Before we go any further, earlier I mentioned the US House of Representatives, and here I am giving a MASSIVE content warning for transphobia
But @evangreer is the coolest fucking person for standing up to Rep. Mace at the Project Libery summit https://www.fightforthefuture.org/news/2024-11-21-transgender-digital-rights-activist-confronts-hate-monger-rep-nancy-mace-at-internet-summit/
What I am trying to say is I don't have many heroes but @evangreer is absolutely a heroine of mine
You should donate to @fight they are some of the only people doing sensible advocacy against terrible internet laws
Also fuck TERFs
But anyway
The structure of an organization does matter. There's a reason that @spritely is a 501(c)(3) in the US. Any money we take in is a donation: we aren't "delivering on an investment" (though we must deliver on *results*)
Bluesky is a Public Benefit Corporation, also interesting
@DavidBruchmann A hash will always have collisions, because its output (the hash string) is much smaller than its input (binary data of effectively arbitrary size). If a hash function did not have collisions it would be a one-to-one function, and that would mean that the set of outputs would have to have the same size as the set of inputs (so they'd need to be the same number of bytes).
This is only a problem when it becomes computationally feasible to find a pair of inputs that collide (especially if you can take one given input and find a second input that collides). md5 is an example of a hash where weaknesses in the algorithm make it computationally feasible to find collisions (which it would not be if you had to guess at random). It's not my area of expertise, but I believe that no such attack is currently known for sha256 (certainly nothing remotely as effective as for md5).
@cwebber
@internic @cwebber
assumed we call archive files being hashes too, you're mistaking, as they are able not only to change the content in the kind that it's unreadable, but also to restore the initial format, despite the smaller size when it's archived.
Beside that hashes could just be a result of some cryptic algorithm, but in contrast also include additional info like length of the original content, further details in the hash would be possible to make collisions less probable.