Memex overview

As We May Think by Vannevar Bush A record if it is to be useful to science, must be continuously extended, it must be stored, and above all it must be consulted.

Webs of trust and reputation graphs

PGP: Explanation of the web of trust of PGP

It’s Now Possible To Sign Arbitrary Data With Your SSH Keys

Distributed hash tables

Distributed Hash Tables, Part I by Brandon Wiley

Kademlia - Wikipedia

Microformats and note taking

From brainstorm to outline: Why I use OPML

Microformats – building blocks for data-rich web pages

Attention conservation

Your attention didn’t collapse. It was stolen | Psychology

Web 2.0

Web 2.0: Compact Definition? - O’Reilly Radar

On Web 2.0, application uses YOU!

Related/unsorted

Why it’s too early to get excited about Web3 – O’Reilly

Alternatives to the metaverse

Clever uses of pass, the Unix password manager

The internet runs on free open-source software. Who pays to fix it?

The Three Laws of Personal Devices

The Web3 Fraud | USENIX

Should you fix errors and contribute to Google Maps for free?

Competition & Privacy: It’s Both Or Nothing

Why We Need to Address Scam Culture

Cryptocurrencies: A Necessary Scam?

Get a Good Job With More Pay, the Landlord Takes It All Away

Thiel, Silicon Valley and the Rise of Tech Neo-Reaction

How CockroachDB went serverless

Web5 notes

A block contains a list of claims and a list of parent blocks. In order to check if a block is valid, you also need a block with a claim “[blob] is a valid signature for [block]” and a copy of the signature. You can’t check a block’s validity in isolation.

When choosing among blocks to form a chain, choose the oldest. When choosing which of two conflicting blocks to remove in order to make a chain valid, remove the oldest. The older a block is, the more likely that other nodes will already have a copy.