Adrian Cochrane is a user on floss.social. You can follow them or interact with them if you have an account anywhere in the fediverse. If you don't, you can sign up here.

Adrian Cochrane @alcinnz@floss.social

Ford Foundation's Road & Bridges discussed the topic of a "post open source".

And yet I think if you strip away the facade of people not licensing their work properly, repeatedly reimplementing the same infrastructure, or developing exclusively for proprietary platforms I don't think things have changed that much from a decade ago.

Please boost: Where can I sell a book as physical & ebook and have it automatically fulfilled? (that is, a good print-on-demand service that ties into a storefront.)

I currently use Amazon and would prefer to not.

Does someone want to start #100DaysOfCode with me?
Code 1 hour daily for the next 100 days.

I mean, I am going to start anyways, but it way more fun with a 'code-buddy' for sure.

"Open source has been such an incredible force for quality and community exactly because it's not been de ned in market terms. In market terms, most open source projects should never have had a chance."
– David Heinemeier Hansson, Ruby on Rails
Via Ford Foundation's "Roads & Bridges"

@Wolf480pl @rysiek @Gargron @charlag @wakest

I've only glanced at OMEMO myself but from what little I've seen it looks promising.

#IANAC (I am not a cryptographer) but I've studied enough to know secure protocols are hard. Even brilliant people who devote their careers to protocol development get it wrong a lot of the time. Therefore we want open protocols subjected to a lot of scrutiny, which takes time.

Internet security is a bit like swimming against a tide of continuous snafus and facepalms. The best we can do is try, and things are getting better, but slowly.

@mkb
@wakest @charlag @Gargron @rysiek
Just to chip in here and add: this frames the "victory condition" nicely. The goal of crypto is to make it too costly for State Actors to pick targets without careful consideration. If attacking you with certainty costs them 0.01c, they'll hit everyone. If it's 1c, they'll automate it. If it's 100, a human analyst will decide. 10,000, and it's a committee.

Imagine two people telling you about keywords: a librarian and an SEO consultant.

One will tell you that knowledge can be structured for easy retrieval, and should therefore be prepared in a way that assists in future humans finding what they *need*.

The other will tell you it is a useless field of metadata, but if you insist on using it here are the ways to game "the system"...

There's essentially two type of BTrees.

Ordinary BTrees stores the values in the same pages as their corresponding keys.

B+Trees make range, prefix, & sorting queries at a negligable cost to lookups, deletes, & inserts. By making the leaves hold the values, and references the next & previous leaf pages in sorted order.

This makes it very quick to quickly find which page to add, remove, lookup a key in. And upon overflow it can just split the page in half separated by a single key added to the parent, an approach which has the nice byproduct of keeping the tree "balanced" and performance constant.

And once you've found a key it makes it easy to iterate over all keys greater than or less then it. Also range & prefix queries.

Most SQL operators are blazingly fast with that, though only for one column per table.

While it is generally exposed to apps as a stream of bytes, hard disks are split up into "pages" that are copied into memory as needed. And while SRAM has less need of this, it still helps reduce bus congestion if they can copy out large sections at a time.

In each of these pages belonging to it a BTree will store a bunch of sorted keys (and maybe values) alongside references to the pages storing keys between each sequential pair of keys.

I've described RDBMSs before as interpreted languages distinguished with an AI optimizer.

But runtime most of them are heavily based to some extent or other on BTrees (PostgreSQL has them as it's default index, & SQLite stores everything in them).

BTrees are a datastructure that makes it trivial to sort, test for presence of, or lookup data. And one that naturally and efficiently fits on a harddisk.

That is BTrees are an implementation of a "sorted mapping".

I've heard people in talks be excited about a future without filesystems. It never excited me, but now I don't think I like the idea.

I can see it feeling pointless, but having to write the code that persists a program's data forces us to think about the issue. And it pushes us to make our data accessible long after our software goes extinct.

Because data reliably outlives software.

blockheadchain Show more

hot take Show more

.@Framasoft's crowdfunding for #PeerTube has just passed 100%, so it will definitely get funding πŸŽ‰ πŸ‘ 🍾

There's still 12 days to go, so the appeal is going for a stretch goal to add even more features 😎

Well done everyone! πŸ‘

#DeleteYouTube #Alternatives

This is one of the oldest blog posts I've written (there are older ones on Patreon but it doesn't count quite the same way) and it's still so relevant today.

dat://blog.joinmastodon.org/20

blog.joinmastodon.org/2017/02/

@Gargron

I am ... not a fan ... of the idea there is a hard-and-fast line between "tech people" and "non-tech".

Not everyone who works with tech, is a hobbiest or enthusiast or who just happens to have picked up some skills along the way knows every detail of the workings of every technology.

Anti-Facebook Spitefulness Show more