Second-Person Pronouns | List, Examples & Explanation

running from entropy

self-responsible

intelligence exploded faster than meaning.

collects rent on code it didn’t write,

mirrors

intelligence learning to circulate

URL

TimeChain

finternet technology

timechain : a decade of misunderstanding blockchain | by gaurav rana | Good Audience 25 May 2019 - timechain : a decade of misunderstanding blockchain Abstract: The term “blockchain” has caused much confusion and damage due to its failure to accurately capture

AT URIs referencing handles are not durable.

Boris Mann

Decentralized public networks

knowledge isn't locked up in platforms or fragmented formats

decentralized publishing protocols like ATProto

No more rebuilding your social graph and data when apps pivot and shut down.

new apps will come to you.

Native mobile apps for share actions on iOS and Android

IPFS implementations

ipns.publish now accepts key name strings rather than private keys Names previously publishing using an user controlled private key, will need to be explicitly published again by first importing the key into the keychain (await libp2p.keychain.importKey('my-key', key) and then published with ipns.publish('my-key', ...). uses libp2p v3 and updated block/data stores

Archived - this repo has been merged into helia

A perfect system for preventing learning while maintaining the illusion of education.

🐍 COMPARING THE WESTERN AND CHINESE ZODIACS

any sufficiently familiar technology is indistinguishable from nature.

drop-in service worker to replace centralized gateways with verified fetch

Example showing drop-in service worker to replace centralized gateways with verified fetch

Architecture

switch to Drop-In Service Worker .

Most IPFS gateway usage today stems from backend services treating ipfs.io as a free CDN

there’s Verified Fetch

Apps & Hotlinks → @helia/verified-fetch

Service Worker Gateway

Verified Fetch

he public-good IPFS gateways

A Post Gateway World: Transitioning Users to Direct Retrieval with IPFS

Join the discussion

caching peers discovered during sweeps in the routing table, the system can reuse peer information across adjacent regions

Implement adaptive timeouts that fail faster on unresponsive peers and strategically skip slow peers

Adaptive Timeout Strategy

IPNS records currently use the legacy sequential provider

Shipyard is open to discussing devgrants

Desktop users and home servers can now provide at scale.

Most users should rely on Provide Sweep alone, which delivers efficient content routing without the resource overhead.

Faster lookups

Stale routing:

we recommend disabling

Reprovide Sweep vs Accelerated DHT Client metrics

providing millions of CIDs

Reprovide Sweep is now the default provider in Kubo v0.39.

the Accelerated client trades continuous crawling overhead for zero-latency lookups

The Accelerated DHT Client serves these queries from its cached network map without additional requests.

Accelerated is spiky, Reprovide Sweep is regular.

an order of magnitude more than Reprovide Sweep.

Reprovide Sweep successfully reprovides all 100,000 CIDs within the 3-hour window.

While effective at completing the work

Performance Comparison

When the system is ready to perform a provide operation,

Provide Sweep caps the number of lookups at around 3,000, regardless of how many CIDs you’re providing.

Each region is defined by a keyspace prefix and is sized to contain at least 20 peers, ensuring there are always enough nodes to satisfy the DHT’s replication factor

ransforms what was once a resource-intensive burst

Reprovide Sweep schedules region reprovides evenly across the 22-hour

organizes all CIDs by keyspace regions and sweeps through these regions sequentially

Provide Sweep finds them once and delivers all relevant provider records together

will send dozens or even hundreds of provider records to the same servers

pigeonhole principle

CIDs that are close together in the Kademlia keyspace share the same closest peers.

mpractical for smaller scale IPFS users who want to participate in the network without such overhead.

crawling the network is expensive

network remains robust even as peers constantly churn in and out

With this snapshot in memory, finding the 20 closest peers to any key becomes instant: no messages, no timeouts, just a local lookup.

maintain a complete map of the network

content gradually disappears from the DHT

Kubo can only reprovide 5,280 CIDs

if new content arrives faster than Kubo can provide it, the queue grows indefinitely.

finding 20 reachable closest peers requires patience and retries.

bottleneck isn’t the actual storage of provider records, it is the lookup process itself.

regular refresh serves two purposes

matches your provide strategy

focus on Kubo because it supports self-hosting

the provide and reprovide mechanisms

no dependency on continued funding

Vulnerable to defunding

periodic reprovides

Scales organically with content and participants

provider list unless renewed.

ime-to-live (TTL) of 48 hours

the DHT implements an expiration mechanism

a directory linking what you’re looking for to where you can find it.

lightweight pointers that map each CID to a list of peer IDs

smart resume capabilities to handle node restarts gracefully

replication factor of 20

The solution is redundancy.

if nodes storing information about content suddenly go offline, that content becomes undiscoverable.

og₂(N) steps

log₂(N) other peers,

Those peers will either return the object itself or point to even closer peers who might have it

a mathematical way to calculate distance in this virtual space.

object’s address in the DHT

custom routing mechanisms

a distributed key-value store.

Private Content Routing

InterPlanetary Network Indexer

providing content at scale practical.

distributed system that maps CIDs to the peers that can serve them

discovery problem

decouples content identity from where it lives on the network

Provide Sweep changes everything

Each CID required its own 10-20 second DHT lookup,

could only handle 5-10k CIDs

Self-hosting a lot of content and publishing yourself as a provider

experimenting with several concepts and ideas to build a Web of Apps.

should be able to discover interesting Web Apps as you browse the web

Open Web App

Web Activities - most recently, Mozilla Labs

providing a web-based action delegation service from generic actions to specific action providers

user-centric technologists

web actions are verbs

Diagram of the Plugin Pipeline:

new ideas about what humanity should uh be able to do, you can just write a protocol

page just uh loads and you retrieve some function new functionality you didn't have

nervous system for humanity

the problem of using location addressing

if you find a problem with the internet

To save a string to an IPFS local gateway from a browser, you can use the ipfs-http-client library in a web application.

Path Gateway Specification When set, gateway will include it in Content-Disposition header and may use it for Content-Type calculation. ... Optional, can be used to request specific Content-Disposition to be set on

Path Gateway Specification

alternatively @helia/http is available which uses HTTP gateways for all network operations.

Kudos. IPFS at long last ready for prime time Beautiful. Ready for Prime time! Game changer Thanks you Learned so much from this beautiful write up

benefit from having mutable data

IPNS records provide cryptographically verifiable, mutable pointers to objects.

Personal

t is a holistic solution which integrates web research, linked data, annotation, note-taking and knowledge organization into a Lifelong Personal Digital Archive of “born reproducible”, ab initio re-purposable, and re-enactable, Research Objects.

contextualizes semantically structured information,

harvesting and contextualizing semantically structured information from Freebase as a linked data source.

"pinned+mfs" - a combination of the pinned and mfs strategies. ℹ️ NOTE: This is the suggested strategy for users who run without GC and don't want to provide everything in cache

the provider persists its reprovide cycle state and provide queue to the datastore, and restores them on restart

Provide Validity of 48h, and discard the record after expiration

Provider Records

bucket size of k = 20

kubo 0.39 with sweep and fast root cid

0.30.0

A Terse, Quick IPLD Primer for the Engineer

HAMT

explicit versioning is fragile; feature detection allows smooth growth and natural evolution.

considerable effort made to keep the amount of computation required to decide if data "matches" a Schema or not to be minimal,

increasingly compact/high-entropy/schemafull

more redundant data (meaning they're easier to "eyeball" and understand without a schema!);

"design language" for IPLD!

ADLs (short for Advanced Data Layout

combination of a CID and a Path is a context-free way to reference any information that's legible via IPLD.

many nodes in a graph

Paths are a 1->1 thing: they start from one position in a DAG, and get you to single destination position.

Data Model level (where the important semantics are!)

IPLD takes all of the incidental choices that must be made (but don't "matter", per se)

thesis statement

maps and lists for building nested structures

The IPLD Data Model is like an "AST" for data -- but without the "S"; the Data Model is independent of syntax.

A hash array mapped trie[1] (HAMT, /ˈhæmt/) is an implementation of an associative array that combines the characteristics of a hash table and an array mapped trie.[1] It is a refined version of the more general notion of a hash tree.

allow the root to grow lazily[

hash array mapped trie (HAMT)

within a commercial offering or entity

mission to enable conversations over the world’s knowledge,

install the Hypothesis Bookmarklet

To install the Hypothesis Bookmarklet

Able Player Fully accessible cross-browser HTML5 media player.

Able Player Demos

"me" is an object pronoun

/hyperpost/~/indyweb/📓/20/25/11/3/setup/-/indy0wiki.pad/

/hyperpost/~/indyweb/📓/20/25/11/3/setup/-/indy0wiki.pad/index.html