on master help sign in
Merge branch 'master' into faq-front-page
commitd92038d9d7b8650a39138430abcd612dbd97718b authordrbeefsupreme <drbeefsupreme@discordja.net> dateThu 7 Oct 2021, 14:03 (5 years ago) parent4d71c5d5ad0079
522 files changed+24272−16217
.gitignore+4−1 .npmrc+1 README.md+4 components/Contact.js+13−15 components/EventPreview.js+102−17 components/Footer.js+2−7 components/Header.js+7 components/Markdown.js+3−1 components/NewletterSignup.js+2−2 components/PostPreview.js+4−4 components/Search.js−1 components/Section.js+2−2 components/Snippets.js+107 components/TableOfContents.js+5−2 components/TwoUp.js+12 components/icons/Cross.js+11 content/blog/2019-10-3-roadmap.md+16−15 content/blog/2019-5-roadmap.md+4−3 content/blog/2020-to-2021.md+2−2 content/blog/20200929-state-of-urbit.md+4−7 content/blog/20201119-models-of-society.md+4−4 content/blog/a-founders-farewell.md+36−32 content/blog/a-topiary.md+2−1 content/blog/aesthetic-culture-1.md+3−2 content/blog/after-machine-war.md+2−2 content/blog/an-email.md+8−12 content/blog/an-urbit-overview.md+79−75 content/blog/announcing-urbit-grants.md+6−2 content/blog/azimuth-as-multipass.md+6−3 content/blog/azimuth-is-on-chain.md+7−3 content/blog/azimuth-security-bounty-program.md+6−2 content/blog/beliefs-and-principles.md+28−24 content/blog/bootstrapping-urbit-from-ethereum.md+28−21 content/blog/common-objections-to-urbit.md+207−202 content/blog/community-spotlight-the-portico.md+2−1 content/blog/creating-sigils.md+9−7 content/blog/eliza.md+3−2 content/blog/events-series.md+4−3 content/blog/first-contract.md+2−1 content/blog/first-steps-towards-urbit-org.md+8−13 content/blog/ford-fusion.md+23−23 content/blog/gifts-q3-2020.md+6−4 content/blog/governance-of-urbit.md+7−2 content/blog/hackathon-results.md+11−15 content/blog/haleek-maul-interview.md+71 content/blog/hosting-the-future.md+7−6 content/blog/infrastructural.md+10−9 content/blog/interim-constitution.md+28−27 content/blog/interplanetary_commerce.md+5−4 content/blog/introducing-os1.md+4−3 content/blog/io-in-hoon.md+3−3 content/blog/iot.md+4−3 content/blog/landscape-a-portrait.md+10−6 content/blog/magic.md+87−86 content/blog/metaphase.md+2−1 content/blog/on-christopher-alexander.md+2−1 content/blog/pki-maze.md+4−8 content/blog/platform-decay.md+4−3 content/blog/precepts-discussion.md+48−46 content/blog/precepts.md+187−187 content/blog/providers.md+24−27 content/blog/rollups.md+12−10 content/blog/security-and-continuity.md+3−5 content/blog/security-audit.md+46−46 content/blog/simple-durable-yours.md+2−4 content/blog/stable-arvo.md+11−13 content/blog/state-of-urbit.md+95 content/blog/the-100-year-computer.md+13−9 content/blog/the-dao-as-a-lesson-in-decentralized-governance.md+100−94 content/blog/the-missing-middle.md+20−19 content/blog/the-state-of-landscape.md+16−13 content/blog/the-understanding-urbit-podcast.md+3−2 content/blog/the-urbit-address-space.md+93−88 content/blog/tools-of-our-own.md+5−4 content/blog/toward-a-frozen-operating-system.md+89−83 content/blog/toward-a-new-clay.md+233−227 content/blog/urbit-and-bitcoin.md+6−6 content/blog/urbit-and-the-blockchain.md+85−80 content/blog/urbit-for-normies.md+56−57 content/blog/urbit-grants-and-mid-2019-gifts.md+9−4 content/blog/urbit-is-for-communities.md+3−6 content/blog/urbithost-interview.md+116 content/blog/value-of-address-space-pt1.md+7−10 content/blog/value-of-address-space-pt2.md+59−73 content/blog/value-of-address-space-pt3.md+34−45 content/blog/what-is-urbit-for.md+67−62 content/blog/why-hoon.md+4−2 content/blog/why-urbit-probably-does-not-need-a-blockchain.md+160−154 content/blog/your-last-computer.md+2−2 content/docs/_index.md+1−1 content/docs/arvo/ames/_index.md+20 content/docs/arvo/ames/ames-api.md−292 content/docs/arvo/ames/cryptography.md+3−3 content/docs/arvo/ames/data-types.md+389 content/docs/arvo/ames/scry.md+126 content/docs/arvo/ames/tasks.md+193 content/docs/arvo/behn/examples.md+2−2 content/docs/arvo/clay/architecture.md+43−120 content/docs/arvo/clay/clay.md+4−1 content/docs/arvo/clay/data-types.md+2−9 content/docs/arvo/clay/examples.md+125−160 content/docs/arvo/clay/marks/_index.md+23 content/docs/arvo/clay/marks/examples.md+248 content/docs/arvo/clay/marks/marks.md+59 content/docs/arvo/clay/marks/using-marks.md+240 content/docs/arvo/clay/marks/writing-marks.md+333 content/docs/arvo/clay/scry.md+6−6 content/docs/arvo/clay/tasks.md+3−3 content/docs/arvo/clay/using.md+67−61 content/docs/arvo/concepts/_index.md+4 content/docs/arvo/concepts/scry.md+77 content/docs/arvo/concepts/subscriptions.md+43−43 content/docs/arvo/dill/_index.md+16 content/docs/arvo/dill/data-types.md+187 content/docs/arvo/dill/dill-api.md−366 content/docs/arvo/dill/dill.md+35−18 content/docs/arvo/dill/scry.md+45 content/docs/arvo/dill/tasks.md+342 content/docs/arvo/eyre/examples.md+5−5 content/docs/arvo/eyre/tasks.md+15−15 content/docs/arvo/iris/_index.md+4−4 content/docs/arvo/iris/data-types.md+1−1 content/docs/arvo/iris/example.md+1−1 content/docs/arvo/iris/tasks.md+4−4 content/docs/arvo/jael/examples.md+3−3 content/docs/arvo/jael/scry.md+15−15 content/docs/arvo/jael/tasks.md+15−15 content/docs/arvo/overview.md+53−56 content/docs/development/environment.md+1−1 content/docs/development/project-repositories.md+2−5 content/docs/glossary/desk.md+1−1 content/docs/hoon/guides/_index.md+2 content/docs/hoon/guides/strings.md+531 content/docs/hoon/reference/_index.md+6−3 content/docs/hoon/reference/cheat-sheet.md+3−13 content/docs/hoon/reference/rune/cen.md+1−1 content/docs/hoon/reference/rune/ket.md+12−3 content/docs/hoon/reference/rune/tis.md+9−3 content/docs/hoon/reference/rune/zap.md+1−1 content/docs/hoon/reference/stdlib/1a.md+403−284 content/docs/hoon/reference/stdlib/1b.md+125−89 content/docs/hoon/reference/stdlib/1c.md+201−122 content/docs/hoon/reference/stdlib/2a.md+298−131 content/docs/hoon/reference/stdlib/2b.md+664−431 content/docs/hoon/reference/stdlib/2c.md+738−651 content/docs/hoon/reference/stdlib/2d.md+55−54 content/docs/hoon/reference/stdlib/2e.md+98−178 content/docs/hoon/reference/stdlib/2f.md+163−285 content/docs/hoon/reference/stdlib/2g.md+26−26 content/docs/hoon/reference/stdlib/2h.md+345−345 content/docs/hoon/reference/stdlib/2i.md+720−436 content/docs/hoon/reference/stdlib/2j.md+267−156 content/docs/hoon/reference/stdlib/2k.md+191−135 content/docs/hoon/reference/stdlib/2l.md+5−3 content/docs/hoon/reference/stdlib/2m.md+40−32 content/docs/hoon/reference/stdlib/2n.md+161−138 content/docs/hoon/reference/stdlib/2o.md+99−86 content/docs/hoon/reference/stdlib/2p.md+125−119 content/docs/hoon/reference/stdlib/2q.md+350−139 content/docs/hoon/reference/stdlib/3a.md+25−5 content/docs/hoon/reference/stdlib/3b.md+200−29 content/docs/hoon/reference/stdlib/3c.md+26−10 content/docs/hoon/reference/stdlib/3d.md+26−12 content/docs/hoon/reference/stdlib/3f.md+20−4 content/docs/hoon/reference/stdlib/3g.md+23−42 content/docs/hoon/reference/stdlib/4a.md+5−1 content/docs/hoon/reference/stdlib/4b.md+36−37 content/docs/hoon/reference/stdlib/4c.md+12−16 content/docs/hoon/reference/stdlib/4d.md+4−4 content/docs/hoon/reference/stdlib/4e.md+20−33 content/docs/hoon/reference/stdlib/4f.md+49−53 content/docs/hoon/reference/stdlib/4g.md+8−8 content/docs/hoon/reference/stdlib/4h.md+66−64 content/docs/hoon/reference/stdlib/4i.md+70−72 content/docs/hoon/reference/stdlib/4j.md+62−64 content/docs/hoon/reference/stdlib/4k.md+5−5 content/docs/hoon/reference/stdlib/4l.md+11−13 content/docs/hoon/reference/stdlib/4m.md+20−18 content/docs/hoon/reference/stdlib/4n.md+15−13 content/docs/hoon/reference/stdlib/4o.md+31−127 content/docs/hoon/reference/stdlib/5c.md+77−1 content/docs/hoon/reference/stdlib/5f.md+18−23 content/docs/hoon/reference/stdlib/table-of-contents.md+95−63 content/docs/hoon/reference/style.md+108−108 content/docs/hoon/reference/zuse/2d_1-5.md+587 content/docs/hoon/reference/zuse/2d_6.md+1551 content/docs/hoon/reference/zuse/2d_7.md+1307 content/docs/hoon/reference/zuse/2e_2-3.md+67 content/docs/hoon/reference/zuse/_index.md+31 content/docs/hoon/reference/zuse/table-of-contents.md+247 content/docs/userspace/_index.md+3 content/docs/userspace/dist/_index.md+29 content/docs/userspace/dist/dist.md+105 content/docs/userspace/dist/docket.md+296 content/docs/userspace/dist/glob.md+102 content/docs/userspace/dist/guide.md+286 content/docs/userspace/dist/tools.md+342 content/docs/userspace/graph-store/overview.md+15−21 content/docs/userspace/graph-store/sample-application-overview.md+369 content/docs/userspace/graph-store/validator-walkthrough.md+38−49 content/docs/userspace/overview.md+5 content/docs/userspace/threads/basics/bind.md+10−10 content/docs/userspace/threads/basics/input.md+23−23 content/docs/userspace/threads/basics/output.md+18−18 content/docs/userspace/threads/basics/summary.md+16−10 content/docs/userspace/threads/examples/child-thread.md+33−33 content/docs/userspace/threads/examples/get-json.md+5−4 content/docs/userspace/threads/examples/main-loop.md+8−8 content/docs/userspace/threads/examples/poke-agent.md+2−2 content/docs/userspace/threads/examples/scry.md+10−10 content/docs/userspace/threads/examples/take-fact.md+2−2 content/docs/userspace/threads/gall/poke-thread.md+8−9 content/docs/userspace/threads/gall/start-thread.md+9−9 content/docs/userspace/threads/gall/stop-thread.md+8−8 content/docs/userspace/threads/gall/take-facts.md+8−8 content/docs/userspace/threads/gall/take-result.md+9−9 content/docs/userspace/threads/http-api.md+1−1 content/docs/userspace/threads/reference.md+5−13 content/events/2017-08-11-after-hours-bootstrapping-urbit-from-the-ethereum-blockchain.md+10−8 content/events/2017-09-22-after-hours-fun-with-arvo-the-urbit-os.md+9−8 content/events/2017-10-26-after-hours-designing-robust-human-systems.md+11−10 content/events/2017-11-16-after-hours-visiting-contributors.md+8−8 content/events/2018-01-26-urbit-irl-20181.md+9−8 content/events/2018-02-23-urbit-irl-20182.md+9−8 content/events/2018-03-11-20183-hoon-school.md+9−8 content/events/2018-03-23-urbit-irl-20183.md+9−8 content/events/2018-04-08-20184-hoon-school.md+9−8 content/events/2018-05-25-urbit-irl-20185.md+9−8 content/events/2018-08-03-after-hours-decentralized-web-summit.md+8−7 content/events/2018-08-17-urbit-irl-20188.md+9−8 content/events/2018-09-21-urbit-irl-20189.md+9−8 content/events/2018-10-10-urbit-zcash-blockchain-week.md+9−8 content/events/2018-12-20-after-hours-its-just-a-party-man.md+9−8 content/events/2019-03-01-after-hours-ask-galen-anything.md+9−8 content/events/2019-03-08-urbit-irl-austin-tx.md+9−8 content/events/2019-04-19-urbit-irl-20194.md+9−8 content/events/2019-05-17-urbit-irl-20195.md+9−8 content/events/2019-06-21-urbit-irl-20196.md+9−8 content/events/2019-07-19-urbit-irl-20197.md+8−9 content/events/2019-08-29-urbit-austin-20198.md+8−9 content/events/2019-10-04-urbit-irl-201910.md+8−9 content/events/2019-11-15-urbit-irl-201911.md+8−9 content/events/2019-12-13-urbit-irl-201912.md+8−9 content/events/2020-01-24-urbit-irl-20201.md+9−8 content/events/2020-02-28-urbit-irl-20202.md+8−9 content/events/2020-04-03-urbit-os1-launch-party.md+8−9 content/events/2020-10-09-urbit-hosting-launch-event.md+8−8 content/events/2020-11-05-developer-call-graph-store.md+12−6 content/events/2020-11-19-developer-call-bittorrent-tracking-on-urbit.md+12−8 content/events/2020-12-10-developer-call-injecting-external-services-into-urbit.md+13−6 content/events/2021-02-04-developer-call-architectural-idea-maze.md+13−7 content/events/2021-03-04-developer-call-scaling-azimuth.md+9−6 content/events/2021-03-18-developer-call-pressure-and-protolith.md+11−6 content/events/2021-04-01-developer-call-javascript-apps-on-urbit.md+12−7 content/events/2021-04-15-developer-call-software-distribution.md+16−7 content/events/2021-04-27-bitcoin-launch.md+9−7 content/events/2021-04-29-developer-call-real-time-communications-on-urbit.md+11−6 content/events/2021-05-13-developer-call-versioned-networking.md+11−6 content/events/2021-05-27-town-hall.md+16−7 content/events/2021-07-01-developer-call-runtime-future.md+14−11 content/events/2021-07-15-developer-call-yakshaving.md+14−11 content/events/2021-09-02-21q3-dc-meetup.md+12−10 content/events/2021-09-16-developer-call-azimuth-scaled.md+46 content/events/2021-09-24-urbit-outside.md+23 content/events/2021-10-15-assembly.md+26 content/events/20211007-developer-call-visor.md+38 content/faq.md+49−47 content/getting-started/_index.md+9 content/getting-started/planet.md+5−3 content/gifts/sample.md+1−1 content/grants/a-book-about-urbit.md+5−3 content/grants/a-collaborative-web-mapping-system-for-urbit.md → content/grants/a-network-enabled-spatial-database-and-demonstration-app.md+31−24 content/grants/analytics-script.md+7−4 content/grants/antechamber.md+5−3 content/grants/art-by-urbit.md+6−3 content/grants/authenticate-with-urbit.md+36 content/grants/azimuth-cli.md+164 content/grants/bart-train-tracker-landscape-tile.md+5−3 content/grants/bitcoin-full-node-provider-and-wallet.md+5−3 content/grants/bitcoin-key-derivation.md+5−3 content/grants/bitcoin-node-json-rpc-api-part-1.md+5−3 content/grants/bitcoin-node-json-rpc-api-part-2.md+5−3 content/grants/bitcoin-node-json-rpc-api-part-3.md+5−3 content/grants/bitcoin-node-json-rpc-api-part-4.md+5−3 content/grants/bitcoin-wallet-maintenance.md+5−3 content/grants/bitcoin-wallet-on-bridge.md+5−3 content/grants/boston-t-train-tracker-landscape-tile.md+5−3 content/grants/bridge-l2-revamp.md+6−3 content/grants/calendar-ui.md+6−3 content/grants/calendar.md+5−3 content/grants/comprehensive-local-server-and-mum-explanation-video.md+7−4 content/grants/contacts.md+6−3 content/grants/content-producer.md+6−3 content/grants/content-saver.md+5−3 content/grants/cross-platform-desktop-urbit-app.md+7−4 content/grants/cta-train-tracker-landscape-tile.md+5−3 content/grants/cypherscope-bot.md+80 content/grants/display-eth-data.md+5−3 content/grants/docker-image-for-cloud-container-orchestration.md+5−3 content/grants/educational-guide-todomvc-urbit-edition.md+6−3 content/grants/escape.md+5−3 content/grants/ethereum-abi-parser.md+6−3 content/grants/feed-aggregator.md+6−3 content/grants/gall-api-documentation.md+5−3 content/grants/go-airlock-library.md+5−3 content/grants/graph-store-documentation-guide.md+6−3 content/grants/guide-to-s3.md+6−3 content/grants/haskell-airlock-library.md+5−3 content/grants/hoon-001-learner-efficiency-and-early-learner-resources.md+5−3 content/grants/host-three-college-university-urbit-meetups-1.md+5−3 content/grants/host-three-college-university-urbit-meetups-2.md+5−3 content/grants/host-three-college-university-urbit-meetups-3.md+5−3 content/grants/host-three-virtual-urbit-meetups.md+5−3 content/grants/host-two-urbit-meetups-1.md+5−3 content/grants/host-two-urbit-meetups-10.md+5−3 content/grants/host-two-urbit-meetups-11.md+5−3 content/grants/host-two-urbit-meetups-12.md+7−4 content/grants/host-two-urbit-meetups-13.md+59 content/grants/host-two-urbit-meetups-14.md+59 content/grants/host-two-urbit-meetups-15.md+59 content/grants/host-two-urbit-meetups-2.md+5−3 content/grants/host-two-urbit-meetups-3.md+5−3 content/grants/host-two-urbit-meetups-4.md+5−3 content/grants/host-two-urbit-meetups-5.md+5−3 content/grants/host-two-urbit-meetups-6.md+5−3 content/grants/host-two-urbit-meetups-7.md+5−3 content/grants/host-two-urbit-meetups-8.md+5−3 content/grants/host-two-urbit-meetups-9.md+5−3 content/grants/json-jet.md+7−4 content/grants/links-in-urbit-reference-docs.md+7−4 content/grants/llelogram.md+5−3 content/grants/login-with-urbit.md+7−4 content/grants/machine-learning.md+122 content/grants/market-interface.md+61 content/grants/matrices-in-hoon.md+6−4 content/grants/matrixriotim-bridge-bot.md+5−3 content/grants/minimal-urbit-os.md+6−3 content/grants/network-explorer-data-pipeline-http-api.md+7−4 content/grants/network-explorer.md−231 content/grants/nuck-jet.md+6−3 content/grants/open-street-maps-data-importation.md+5−3 content/grants/overhaul-the-urbitorg-website.md+8−5 content/grants/planet-sales.md+66 content/grants/pokur.md+90 content/grants/ra-debugging-tools.md+25 content/grants/ra-page-tracking.md+5−3 content/grants/ra-segfaults.md+5−3 content/grants/ra-stack-overflow.md+5−3 content/grants/ragnarok-online-on-urbit.md+5−3 content/grants/search-in-groups.md+6−4 content/grants/slaw-scot-jets.md+6−4 content/grants/-smol-future-sustained-knowledge-sharing-and-marketing.md → content/grants/smol-future-sustained-knowledge-sharing-and-marketing.md+5−3 content/grants/speech-recognition.md+78 content/grants/staff-the-urbit-help-desk-1.md+5−3 content/grants/staff-the-urbit-help-desk-2.md+5−3 content/grants/staff-the-urbit-helpdesk-east.md+5−3 content/grants/staff-the-urbit-helpdesk-west.md+5−3 content/grants/static-site-generation.md+80 content/grants/the-complete-guide-to-gall-and-landscape.md+5−3 content/grants/thread-documentation.md+5−3 content/grants/tor-nodes-relay-search-tile.md+5−3 content/grants/translate-key-parts-of-urbitorg-into-german.md+6−3 content/grants/translate-key-parts-of-urbitorg-into-korean.md+6−3 content/grants/translate-key-parts-of-urbitorg-into-norwegian.md+5−3 content/grants/translate-key-parts-of-urbitorg-into-spanish.md+6−3 content/grants/try-urbit-website.md+7−4 content/grants/typescript-airlock-library.md+5−3 content/grants/ua-collaborative-text-editor.md+6−4 content/grants/ua-filesharer.md+5−3 content/grants/ua-heads-up-poker.md+5−3 content/grants/ua-invoice-system.md+5−3 content/grants/ua-marketplace.md+5−3 content/grants/ucal-google-and-outlook-integration.md+6−3 content/grants/udon-syntax-highlighter.md+5−3 content/grants/unit-tests-for-json-parsing.md+5−3 content/grants/unit-tests-for-pure-algorithms.md+5−3 content/grants/unit-tests-for-sha-functions.md+5−3 content/grants/unit-tests-for-zuse-cryptographic-functions.md+5−3 content/grants/up-to-date-hoon-reference-card.md+5−3 content/grants/urbian-a-customized-linux-distribution-for-urbit-appliances.md+6−3 content/grants/urbit-api-for-elixir.md+5−3 content/grants/urbit-community-concierge-east-coast-2q2021.md+7−4 content/grants/urbit-community-concierge-east-coast.md+7−4 content/grants/urbit-community-concierge-west-coast-2q2021.md+7−4 content/grants/urbit-community-concierge-west-coast.md+7−4 content/grants/urbit-event-series.md+7−4 content/grants/urbit-explainer-video.md+6−3 content/grants/urbit-http-api-for-emacs-elisp.md+6−3 content/grants/urbit-http-api-for-kotlin.md+6−3 content/grants/urbit-http-api-for-python.md+6−3 content/grants/urbit-http-api-for-rust.md+6−3 content/grants/urbit-http-interface-java-edition.md+6−3 content/grants/urbit-http-library-for-ruby.md+6−3 content/grants/urbit-irc-bridge.md+6−3 content/grants/urbit-lfs-filehosting.md+6−3 content/grants/urbit-notes.md+102 content/grants/urbit-online-meetup.md+5−3 content/grants/urbit-react-cookbook.md+6−3 content/grants/urbit-ship-and-star-hosting-and-troubleshooting-docs.md+5−3 content/grants/verifying-urbit-id-on-keybase.md+5−3 content/grants/video-content-manager.md+6−3 content/grants/volt-lightning-on-urbit.md+6−3 content/grants/web-scraper.md+5−3 content/grants/webrtc-gall-agent-and-external-app.md+18−18 content/grants/webrtc.md−78 content/grants/~home-urbit.md+120 content/media/blockchannel-episode-19-virtual-land-in-the-clouds-with-urbit.md+3−1 content/media/blueprint-2017-galen-wolfe-pauly-on-the-distributed-web.md+5−2 content/media/epicenter-episode-205-urbit-a-digital-republic-reinventing-the-internet.md+5−2 content/media/governing-the-future-e09-urbit-a-user-owned-internet-on-top-of-the-internet.md+6−2 content/media/lambdaconf-2016-curtis-yarvin-urbit-a-clean-slate-functional-operating-stack.md+5−2 content/media/lambdaconf-2018-ted-blackman-ford-urbits-build-system.md+5−2 content/media/on-the-brink-castle-island.md+3−3 content/media/the-ether-review-46-curtis-yarvin-and-galen-wolfe-pauly-on-urbit.md+5−2 content/media/urbit-and-the-not-so-dark-future-of-the-internet.md+3−2 content/media/what-is-urbit.md+2−1 content/updates/2016-10-6-update.md+73−72 content/updates/2016-5-16-roadmap.md+62−61 content/updates/2016-7-20-update.md+34−33 content/updates/2016-8-30-update.md+48−47 content/updates/2017-1-30-update.md+124−123 content/updates/2017-10-7-update.md+3−2 content/updates/2017-11-14-update.md+33−34 content/updates/2017-12-16-update.md+11−9 content/updates/2017-12-2-update.md+17−16 content/updates/2017-12-22-update.md+13−12 content/updates/2017-3-1-update.md+41−40 content/updates/2017-4-17-update.md+37−36 content/updates/2017-5-11-roadmap.md+71−70 content/updates/2017-8-11-update.md+30−31 content/updates/2017-9-23-update.md+3−2 content/updates/2017-9-29-update.md+3−2 content/updates/2018-1-13-update.md+3−2 content/updates/2018-1-6-update.md+11−10 content/updates/2018-10-12-update.md+13−12 content/updates/2018-10-24-update.md+8−7 content/updates/2018-11-20-update.md+12−11 content/updates/2018-11-6-update.md+8−7 content/updates/2018-12-18-update.md+9−8 content/updates/2018-2-17-update.md+6−4 content/updates/2018-2-24-update.md+10−9 content/updates/2018-2-5-update.md+10−10 content/updates/2018-2-9-update.md+9−8 content/updates/2018-3-24-update.md+12−11 content/updates/2018-3-5-update.md+8−7 content/updates/2018-4-14-update.md+16−15 content/updates/2018-4-7-update.md+9−8 content/updates/2018-5-16-update.md+13−13 content/updates/2018-5-23-update.md+11−11 content/updates/2018-5-29-update.md+3−2 content/updates/2018-5-30-update.md+11−10 content/updates/2018-6-14-update.md+13−12 content/updates/2018-6-21-update.md+12−12 content/updates/2018-6-6-update.md+13−12 content/updates/2018-7-13-update.md+12−11 content/updates/2018-7-20-update.md+20−20 content/updates/2018-7-3-update.md+13−13 content/updates/2018-7-30-update.md+18−18 content/updates/2018-8-23-update.md+16−15 content/updates/2018-8-30-update.md+11−10 content/updates/2018-8-8-update.md+18−17 content/updates/2018-9-11-update.md+17−16 content/updates/2019-11-06-update.md+6−2 content/updates/2019-12-06-update.md+2−1 content/updates/2019-2-11-update.md+8−6 content/updates/2019-2-25-update.md+7−5 content/updates/2019-2-26-network-update.md+4−2 content/updates/2019-2-4-update.md+9−7 content/updates/2019-3-11-update.md+8−6 content/updates/2019-3-27-update.md+6−4 content/updates/2019-3-4-update.md+7−5 content/updates/2019-4-11-update.md+7−5 content/updates/2019-5-10-update.md+4−3 content/updates/2019-5-17-update.md+4−3 content/updates/2019-5-31-update.md+7−6 content/updates/2019-6-14-update.md+10−7 content/updates/2019-7-25-update.md+9−5 content/updates/2020-02-06-update.md+5−3 content/updates/2020-04-04-update.md+2−1 content/updates/2020-06-15-update.md+2−1 content/updates/2020-07-27-update.md+2−1 content/updates/2020-09-30-update.md+2−1 content/updates/2020-10-29-update.md+2−1 content/updates/2020-12-01-update.md+2−1 content/updates/2021-01-15-update.md+2−1 content/updates/2021-02-19-update.md+2−1 content/updates/2021-04-01-update.md+2−1 content/updates/2021-05-05-update.md+2−1 content/updates/2021-06-16-update.md+5−3 content/using/_index.md+3−3 content/using/id/guide-to-breaches.md+1−3 content/using/os/_index.md+1−1 content/using/os/getting-started.md → content/using/os/basics.md+4−4 content/using/os/dist-faq.md+162 content/using/os/ship-troubleshooting.md+2−2 lib/constants.js+55−1 lib/glossary.js+1261−532 lib/hooks.js+22 lib/lib.js+57−23 lib/rss.js+1−1 next.config.js+1−8 package-lock.json+874−3152 package.json+3−5 pages/bitcoin-wallet.js+21 pages/blog.js+3−2 pages/blog/[slug].js+12−21 pages/events.js+65−71 pages/events/[slug].js+103−74 pages/grants.js+40−16 pages/grants/[slug].js+2−1 pages/index.js+77−34 pages/media.js+57−2 pages/media/[slug].js+8−4 pages/updates.js+3−2 pages/updates/[slug].js+3−1 pages/using/[[...slug]].js+3−3 scripts/date_to_string_upgrade.js+43 scripts/event_date_upgrade.js+51 styles/globals.css+23−21 styles/markdown.css+20−8 vercel.json+5 yarn.lock−1865
.gitignore+4−1
@@ -13,6 +13,7 @@
1313# next.js
1414/.next/
1515/out/
16+.next
1617
1718# production
1819/build
@@ -37,4 +38,6 @@ yarn-error.log*
3738.vercel
3839
3940# editors
40−/.nova/
41+/.nova/
42+
43+yarn.lock
.npmrcnew file+1
@@ -0,0 +1 @@
1+unsafe-perm = true
README.md+4
@@ -30,3 +30,7 @@ To learn more about Tailwind CSS, take a look at the docs:
3030## Deployment
3131
3232WIP
33+
34+## Upgrades
35+
36+The `/scripts` contains scripts used to programmatically upgrade site content data.
components/Contact.js+13−15
@@ -5,6 +5,11 @@ import { useCopyToClipboard } from "../lib/hooks";
55export default function Contact({ emphasize }) {
66 const [copyStatus, copy] = useCopyToClipboard(contact.urbitCommunity);
77
8+ const linkText = emphasize ? "text-green-400" : "text-wall-600";
9+ const border = emphasize ? "border-green-400" : "border-wall-600";
10+ const washedBg = emphasize ? "bg-green-100" : "bg-wall-100";
11+ const iconColor = emphasize ? "#00B171" : "#24221E";
12+
813 const buttonIcon =
914 copyStatus === "inactive" ? (
1015 <svg
@@ -18,7 +23,7 @@ export default function Contact({ emphasize }) {
1823 fillRule="evenodd"
1924 clipRule="evenodd"
2025 d="M3.2 1.6C3.2 0.716344 3.91634 0 4.8 0H11.3615L14.9333 2.38124V12.2667C14.9333 13.1503 14.217 13.8667 13.3333 13.8667H12.8V14.4C12.8 15.2837 12.0837 16 11.2 16H2.66667C1.78301 16 1.06667 15.2837 1.06667 14.4V3.73333C1.06667 2.84968 1.78301 2.13333 2.66667 2.13333H3.2V1.6ZM3.2 3.2H2.66667C2.37211 3.2 2.13333 3.43878 2.13333 3.73333V14.4C2.13333 14.6946 2.37211 14.9333 2.66667 14.9333H11.2C11.4946 14.9333 11.7333 14.6946 11.7333 14.4V13.8667H4.8C3.91634 13.8667 3.2 13.1503 3.2 12.2667V3.2Z"
21− fill="#666666"
26+ fill={iconColor}
2227 />
2328 </svg>
2429 ) : copyStatus === "copied" ? (
@@ -33,7 +38,7 @@ export default function Contact({ emphasize }) {
3338 fillRule="evenodd"
3439 clipRule="evenodd"
3540 d="M0 8C0 3.58172 3.58172 0 8 0C12.4183 0 16 3.58172 16 8C16 12.4183 12.4183 16 8 16C3.58172 16 0 12.4183 0 8ZM7.54325 11.4247L12.1498 5.66647L11.3169 5.00013L7.39013 9.90859L4.60812 7.59025L3.92526 8.40969L7.54325 11.4247Z"
36− fill="#666666"
41+ fill={iconColor}
3742 />
3843 </svg>
3944 ) : (
@@ -48,14 +53,11 @@ export default function Contact({ emphasize }) {
4853 fillRule="evenodd"
4954 clipRule="evenodd"
5055 d="M0 8C0 3.58172 3.58172 0 8 0C12.4183 0 16 3.58172 16 8C16 12.4183 12.4183 16 8 16C3.58172 16 0 12.4183 0 8ZM10.8229 11.5772L8.00004 8.75429L5.17716 11.5772L4.42292 10.8229L7.24579 8.00004L4.42292 5.17716L5.17716 4.42292L8.00004 7.24579L10.8229 4.42292L11.5772 5.17716L8.75429 8.00004L11.5772 10.8229L10.8229 11.5772Z"
51− fill="#666666"
56+ fill={iconColor}
5257 />
5358 </svg>
5459 );
5560
56− const linkText = emphasize ? "text-green-400" : "text-wall-600";
57− const border = emphasize ? "border-green-400" : "border-wall-600";
58−
5961 return (
6062 <div>
6163 <div className="measure">
@@ -77,20 +79,16 @@ export default function Contact({ emphasize }) {
7779 Github
7880 </a>
7981 </h4>
80− <h4 className="mt-6 text-wall-500">
81− Ask questions in our{" "}
82− <a className={linkText} href={contact.discord}>
83− Discord
84− </a>
85− </h4>
86− <h4 className="mt-6 text-wall-500 flex items-baseline flex-wrap">
82+ <h4 className="mt-4 text-wall-500 flex items-baseline flex-wrap">
8783 Boot Urbit and join{" "}
8884 <div className="md:ml-2 rounded-lg flex items-stretch">
89− <code className="rounded-l-lg px-2 md:px-4 py-2 bg-wall-100 flex items-center h-full">
85+ <code
86+ className={`rounded-l-lg px-2 md:px-4 py-2 ${washedBg} flex items-center h-full ${linkText}`}
87+ >
9088 {contact.urbitCommunity}
9189 </code>
9290 <button
93− className="rounded-r-lg px-4 bg-wall-100 ml-0.5 flex-1 flex justify-center items-center"
91+ className={`rounded-r-lg px-4 ml-0.5 flex-1 flex justify-center items-center ${washedBg}`}
9492 onClick={() => copy()}
9593 >
9694 {buttonIcon}
components/EventPreview.js+102−17
@@ -1,37 +1,122 @@
11import Link from "next/link";
2+import { DateTime } from "luxon";
3+import {
4+ ShowOrHide,
5+ ReadableList,
6+ Person,
7+ Name,
8+ DateRange,
9+} from "../components/Snippets";
10+import {
11+ generateDisplayDate,
12+ generateRealtimeDate,
13+ formatDate,
14+ formatTime,
15+ formatTimeZone,
16+} from "../lib/lib";
217
3−export default function EventPreview({ event, className, title, rsvp }) {
18+// JAL(2021.9.13) Couldn't quite get this to work properly. There's a trailing
19+// "and"
20+//
21+// function GuestList({ guests, textClass }) {
22+
23+// const renderGuests = guests?.length > 2 ? guests?.slice(0,2) : guests;
24+// const noRenderGuestsCount = guests?.slice(2).length;
25+
26+// return (
27+// <p className={textClass + " type-sub"}>
28+// <b>
29+// {renderGuests?.length > 1 ? "With guests " : "With guest "}
30+// </b>
31+// <ReadableList>
32+// {renderGuests?.map((guest, index) => (
33+// <>
34+// <Person
35+// key={`${guest.name}-${guest.patp}`}
36+// nameClassNames={textClass}
37+// patpClassNames={textClass}
38+// name={guest.name}
39+// patp={guest.patp}
40+// />
41+// {renderGuests?.length > 1 ? <span>, </span> : <></>}
42+// </>
43+// ))}
44+// {noRenderGuestsCount > 1 ?
45+// <Name>{noRenderGuestsCount} more </Name>
46+// :
47+// <></>
48+// }
49+// </ReadableList>
50+// </p>
51+// );
52+// }
53+
54+export default function EventPreview({ event, className, big }) {
455 // Event tiles have a 'dark mode' used when their background images are dark and white text is needed for legibility.
5− const grayText = event.extra?.dark ? "text-midWhite" : "text-wall-500";
6− const blackText = event.extra?.dark ? "text-white" : "text-wall-600";
56+ const grayText = event?.dark ? "text-washedWhite" : "text-wall-400";
57+ const blackText = event?.dark ? "text-white" : "text-wall-600";
58+
59+ const starts = generateDisplayDate(event.starts, event.timezone);
60+ const ends = generateDisplayDate(event.ends, event.timezone);
61+
62+ const inFuture = generateRealtimeDate(starts) > DateTime.now();
63+
64+ const happeningNow =
65+ generateRealtimeDate(event.starts) > DateTime.now() && !inFuture;
766
867 return (
9− <div className={`cursor-pointer ${className}`}>
10− {title ? <h3 className="mb-2">{title}</h3> : null}
68+ <div
69+ className={`cursor-pointer aspect-w-4 aspect-h-5 md:aspect-w-5 md:aspect-h-4 ${className}`}
70+ >
1171 <div
1272 key={event.slug}
13− className={`bg-wall-100 rounded-xl h-80 bg-cover bg-center bg-no-repeat`}
14− style={{ backgroundImage: `url(${event.extra?.image})` || "" }}
73+ className={`bg-wall-100 rounded-xl bg-cover bg-center bg-no-repeat `}
74+ style={{ backgroundImage: `url(${event.image})` || "" }}
1575 >
1676 <Link href={`/events/${event.slug}`}>
17− <div className="flex flex-col p-4 justify-between items-between h-full relative">
18− <div className="flex-grow-1 flex flex-col justify-center h-full">
19− <h4 className={`mb-4 ${blackText}`}>{event.title}</h4>
20− <p className={grayText}>{event?.type}</p>
77+ <div
78+ className={`flex flex-col p-6 justify-between items-between h-full relative`}
79+ >
80+ <div
81+ className={`flex-grow-1 flex ${
82+ big ? "justify-center" : ""
83+ } flex-col h-full`}
84+ >
85+ <h3 className={`${blackText} mb-2`}>{event.title}</h3>
86+ <p className={blackText + ""}>{event.description}</p>
2187 </div>
22− <div className="absolute p-4 left-0 bottom-0 w-full">
23− <p className={`${grayText}`}>{event.extra.host}</p>
24− <p className={`${grayText}`}>{event.extra.guests}</p>
88+
89+ <div className="absolute p-6 left-0 bottom-0 w-full pr-32">
90+ <p className={`${blackText} type-sub mb-1`}>{event.location}</p>
91+ <DateRange
92+ starts={starts}
93+ ends={ends}
94+ className={`${grayText} type-sub`}
95+ />
2596 </div>
26− {rsvp && event.extra.registration_url && event.extra.pinned ? (
27− <div className="absolute right-0 bottom-0 p-4">
97+
98+ {inFuture && event.registration_url ? (
99+ <div className="absolute right-0 bottom-0 p-6">
28100 <a
29101 className="button-sm bg-green-400 text-white"
30− href={event.extra.registration_url}
102+ href={event.registration_url}
103+ onClick={(e) => e.stopPropagation()}
104+ target="_blank"
31105 >
32106 RSVP
33107 </a>
34108 </div>
109+ ) : event.youtube ? (
110+ <div className="absolute right-0 bottom-0 p-6">
111+ <a
112+ className="button-sm bg-wall-600 text-white"
113+ href={`https://www.youtube.com/watch?v=${event.youtube}`}
114+ onClick={(e) => e.stopPropagation()}
115+ target="_blank"
116+ >
117+ ▶ Watch
118+ </a>
119+ </div>
35120 ) : null}
36121 </div>
37122 </Link>
components/Footer.js+2−7
@@ -5,7 +5,7 @@ import { contact } from "../lib/constants";
55
66export default function Footer() {
77 return (
8− <footer className="bg-wall-100 w-full mt-48 flex justify-center">
8+ <footer className="bg-wall-100 mt-20 w-full flex justify-center">
99 <SingleColumn>
1010 <Section short className="flex flex-row flex-wrap">
1111 <div className="w-1/2 md:w-1/3 flex flex-col flex-shrink">
@@ -17,7 +17,7 @@ export default function Footer() {
1717 </Link>
1818 <Link href="/using">
1919 <div>
20− <a className="type-bold text-wall-500">Operator's Manual</a>
20+ <a className="type-bold text-wall-500">User's Manual</a>
2121 </div>
2222 </Link>
2323 <Link href="https://github.com/urbit/port/releases">
@@ -126,11 +126,6 @@ export default function Footer() {
126126 <a className="type-bold text-wall-500">Dev Mailing List</a>
127127 </div>
128128 </Link>
129− <Link href="https://discord.gg/CfSKKaB2ep">
130− <div>
131− <a className="mt-2 type-bold text-wall-500">Support Discord</a>
132− </div>
133− </Link>
134129 <Link href="https://github.com/urbit/azimuth">
135130 <div>
136131 <a className="mt-2 type-bold text-wall-500">Governance</a>
components/Header.js+7
@@ -72,6 +72,13 @@ export default function Header(props) {
7272 >
7373 Docs
7474 </ActiveLink>
75+ <ActiveLink
76+ currentPath={currentPath}
77+ className="mr-5 type-ui"
78+ href="/using"
79+ >
80+ Manual
81+ </ActiveLink>
7582 <ActiveLink
7683 currentPath={currentPath}
7784 className="mr-5 type-ui"
components/Markdown.js+3−1
@@ -38,7 +38,9 @@ export default async function Markdown({ post }) {
3838 const result = await remark()
3939 .use(html, options)
4040 .use(gfm)
41− .use(remarkprism)
41+ .use(remarkprism, {
42+ plugins: ["show-invisibles"],
43+ })
4244 .use(slug)
4345 .use(heading)
4446 .process(post.content);
components/NewletterSignup.js+2−2
@@ -12,8 +12,8 @@ export default function NewsletterSignup(props) {
1212 <div className="input-group" id="mc_embed_signup_scroll">
1313 <div className="mc-field-group w-full relative">
1414 <input
15− className={`appearance-none outline-none text-wall-500 type-ui black border-${
16− props.color || "black"
15+ className={`appearance-none outline-none text-wall-500 type-ui black ${
16+ props.color || "border-wall-600"
1717 } border-4 px-3 w-full mb-2 h-16 rounded-xl`}
1818 type="email"
1919 name="EMAIL"
components/PostPreview.js+4−4
@@ -1,9 +1,11 @@
11import Link from "next/link";
22import BackgroundImage from "./BackgroundImage";
3−import { formatDate } from "../lib/lib";
3+import { formatDate, generateDisplayDate } from "../lib/lib";
44
55export default function PostPreview(props) {
66 const section = props?.section ? props.section : "blog";
7+
8+ const date = generateDisplayDate(props.post.date);
79 return (
810 <div className={`cursor-pointer ${props.className}`}>
911 {props.title ? <h3 className="mb-2">{props.title}</h3> : null}
@@ -31,9 +33,7 @@ export default function PostPreview(props) {
3133 </div>
3234 ) : null}
3335 </div>
34− <div className="text-wall-500 type-sub mt-1">
35− {formatDate(new Date(props.post.date))}
36− </div>
36+ <div className="text-wall-500 type-sub mt-1">{formatDate(date)}</div>
3737 </div>
3838 </Link>
3939 </div>
components/Search.js−1
@@ -26,7 +26,6 @@ class Search extends Component {
2626 }
2727
2828 onSelect(item) {
29− console.log(item);
3029 if (item.slug) {
3130 this.props.router.push(item.slug);
3231 }
components/Section.js+2−2
@@ -8,8 +8,8 @@ export default function Section({
88 narrow = false,
99}) {
1010 const spacing = classnames({
11− "py-4 md:py-6 lg:py-8": short,
12− "py-8 md:py-10 lg:py-20": !short,
11+ "py-8": short,
12+ "py-20": !short,
1313 "layout-narrow": narrow,
1414 layout: !narrow,
1515 });
components/Snippets.jsnew file+107
@@ -0,0 +1,107 @@
1+import {
2+ getAllEvents,
3+ generateDisplayDate,
4+ generateRealtimeDate,
5+ formatDate,
6+ formatTime,
7+ formatTimeZone,
8+} from "../lib/lib";
9+
10+export function Name({ children, className }) {
11+ return <b className={`font-normal ${className || ""}`}>{children}</b>;
12+}
13+
14+export function Patp({ children, className }) {
15+ return <code className={`font-mono ${className || ""}`}>{children}</code>;
16+}
17+
18+// Used to render a human name alongside their @p
19+export function Person({
20+ name,
21+ patp,
22+ nameClassNames,
23+ patpClassNames,
24+ className,
25+}) {
26+ return (
27+ <>
28+ {patp && name ? (
29+ <>
30+ <Name className={nameClassNames}>{name}</Name>{" "}
31+ <Patp className={patpClassNames + " opacity-60"}>{patp}</Patp>
32+ </>
33+ ) : patp ? (
34+ <Patp className={patpClassNames}>{patp}</Patp>
35+ ) : name ? (
36+ <Name className={nameClassNames}>{name}</Name>
37+ ) : null}
38+ </>
39+ );
40+}
41+
42+// This goes inside a <p/> tag
43+export function ReadableList({ children, serial = ",", conjunction = "and" }) {
44+ return (
45+ <>
46+ {children.map((Child, index) => {
47+ if (index < children.length - 2) {
48+ return (
49+ <>
50+ {Child}
51+ {serial}
52+ </>
53+ );
54+ } else if (index < children.length - 1) {
55+ return (
56+ <>
57+ {Child} {conjunction}{" "}
58+ </>
59+ );
60+ }
61+ return <>{Child}</>;
62+ })}
63+ </>
64+ );
65+}
66+
67+export function ShowOrHide({ children, condition }) {
68+ if (condition) {
69+ return children;
70+ }
71+ return null;
72+}
73+
74+export function DateRange({ starts, ends, className, short }) {
75+ // For events which have no end datetime
76+ if (!ends.isValid) {
77+ return (
78+ <div>
79+ <p className={className}>
80+ {`${formatDate(starts)} • ${formatTime(starts)} ${formatTimeZone(
81+ starts
82+ )}`}
83+ </p>
84+ </div>
85+ );
86+ }
87+ // For events which start and end on the same day
88+ if (starts.hasSame(ends, "day")) {
89+ return (
90+ <div>
91+ <p className={className}>
92+ {`${formatDate(starts)} • ${formatTime(starts)} to ${formatTime(
93+ ends
94+ )} ${formatTimeZone(starts)}`}
95+ </p>
96+ </div>
97+ );
98+ }
99+ // For multi-day events
100+ return (
101+ <div>
102+ <p className={className}>{`${starts.toFormat(
103+ "cccc, LLLL d"
104+ )} to ${formatDate(ends)}`}</p>
105+ </div>
106+ );
107+}
components/TableOfContents.js+5−2
@@ -52,9 +52,12 @@ const useHeadingsData = (noh3s) => {
5252
5353const Headings = ({ headings, activeId }) => (
5454 <ul>
55− {headings.map((heading) => (
55+ {headings.map((heading, index) => (
5656 <li key={heading.id}>
57− <a className="font-semibold" href={`#${heading.id}`}>
57+ <a
58+ className={index === 0 ? "font-bold" : "font-medium"}
59+ href={`#${heading.id}`}
60+ >
5861 {heading.title}
5962 </a>
6063 {heading.items.length > 0 && (
components/TwoUp.jsnew file+12
@@ -0,0 +1,12 @@
1+export default function TwoUp({ children, className = "" }) {
2+ return (
3+ <div className={`flex flex-wrap w-full ${className}`}>
4+ <div className="w-full md:w-1/2 pr-0 pb-8 md:pr-4">
5+ {children[0] || null}
6+ </div>
7+ <div className="w-full md:w-1/2 pl-0 pb-8 md:pl-4">
8+ {children[1] || null}
9+ </div>
10+ </div>
11+ );
12+}
components/icons/Cross.jsnew file+11
@@ -0,0 +1,11 @@
1+export default function Cross(props) {
2+ return (
3+ <svg {...props} viewBox="0 0 12 12">
4+ <path
5+ fillRule="evenodd"
6+ clipRule="evenodd"
7+ d="M0.292893 10.2942C-0.0976311 10.6847 -0.0976311 11.3179 0.292893 11.7084C0.683417 12.0989 1.31658 12.0989 1.70711 11.7084L6.00063 7.41487L10.2948 11.7091C10.6853 12.0996 11.3185 12.0996 11.709 11.7091C12.0996 11.3185 12.0996 10.6854 11.709 10.2949L7.41484 6.00066L11.7084 1.70711C12.0989 1.31658 12.0989 0.683417 11.7084 0.292894C11.3179 -0.0976312 10.6847 -0.0976312 10.2942 0.292894L6.00063 4.58645L1.70775 0.293571C1.31723 -0.0969534 0.684061 -0.0969534 0.293536 0.293571C-0.0969879 0.684095 -0.0969879 1.31726 0.293536 1.70778L4.58641 6.00066L0.292893 10.2942Z"
8+ />
9+ </svg>
10+ );
11+}
content/blog/2019-10-3-roadmap.md+16−15
@@ -1,8 +1,12 @@
11+++
22title = "~2019.10 Roadmap"
3−date = 2019-10-03
3+date = "2019-10-02"
44description = "Galen Wolfe-Pauly on the road ahead for the identity/OS/interface/community stack."
5−aliases = ["/posts/essays/2019-10-3-roadmap", "/posts/2019-10-3-roadmap"]
5+aliases = [
6+ "/posts/essays/2019-10-3-roadmap",
7+ "/posts/2019-10-3-roadmap"
8+]
9+
610[extra]
711author = "Galen Wolfe-Pauly"
812ship = "~ravmel-ropdyl"
@@ -15,21 +19,21 @@ The daily work of building a new OS from scratch is so engaging and exciting tha
1519
1620It’s a good thing I have a recurring reminder to write these updates. While our focus is on the future, it’s good to get a sense of the rate that we’re moving forward, and to let everyone know what’s been going on. We’ve made great progress over the past few months.
1721
18−We’ve got a new interface, Urbit 0.8.0, Hoon School, and a grants program among lots of other updates. We’ll go into detail about all of these, and talk a bit about where we’re headed next. The system is improving at a really good pace. We intend to keep it up.
22+We’ve got a new interface, Urbit 0.8.0, Hoon School, and a grants program among lots of other updates. We’ll go into detail about all of these, and talk a bit about where we’re headed next. The system is improving at a really good pace. We intend to keep it up.
1923
2024## Identity (Azimuth)
2125
22−The other day I got an email, clicked a link, and got a planet. A real, live, piece of cryptographic property with paper wallets and everything. It took about two minutes. And at the end, I could have easily sent invites to my friends.
26+The other day I got an email, clicked a link, and got a planet. A real, live, piece of cryptographic property with paper wallets and everything. It took about two minutes. And at the end, I could have easily sent invites to my friends.
2327
24−This experience is part of a completely new Bridge, the interface for interacting with your Urbit identity. The beta experience we’re testing today is quite stripped down, but it’s a huge improvement over the last Bridge release. Clicking a link is a lot easier than downloading source code, running it from the command-line, and probably running into a python-related error.
28+This experience is part of a completely new Bridge, the interface for interacting with your Urbit identity. The beta experience we’re testing today is quite stripped down, but it’s a huge improvement over the last Bridge release. Clicking a link is a lot easier than downloading source code, running it from the command-line, and probably running into a python-related error.
2529
2630Getting to this point involved rewriting Bridge from scratch, figuring out how to host it securely, building infrastructure to fund the requisite transactions involved in registering a new identity, and setting up a service to send emails (and dispose of them afterward). We've also redesigned our paper wallets to make them simpler and clearer.
2731
28−We still want to get this new version of Bridge a bit further along before releasing it to everyone — but we’re excited about it. We didn’t quite get to the point of building an affordance for payments, which we had hoped to do, but that’s coming later.
32+We still want to get this new version of Bridge a bit further along before releasing it to everyone — but we’re excited about it. We didn’t quite get to the point of building an affordance for payments, which we had hoped to do, but that’s coming later.
2933
3034We want everyone to have an Urbit identity. And we want it to be incredibly easy to get one, so we’ll get Bridge out this month with a new urbit.org (more on that below).
3135
32−The other area of identity-related work was Sigils — the algorithmically generated images that go with every Urbit identity. (We’ve got a blog post in the works that covers how we created these, which is a good story that needs to be told.) The original version of Sigils didn’t look very good at small sizes and a few collisions were found (thanks to [urbit.live](https://urbit.live) for helping to discover the collisions). The [new, improved sigils](https://github.com/urbit/sigil-js) have no collisions and look great at small sizes.
36+The other area of identity-related work was Sigils — the algorithmically generated images that go with every Urbit identity. (We’ve got a blog post in the works that covers how we created these, which is a good story that needs to be told.) The original version of Sigils didn’t look very good at small sizes and a few collisions were found (thanks to [urbit.live](https://urbit.live) for helping to discover the collisions). The [new, improved sigils](https://github.com/urbit/sigil-js) have no collisions and look great at small sizes.
3337
3438**Q4 2019**
3539
@@ -42,7 +46,6 @@ The other area of identity-related work was Sigils — the algorithmically gener
4246
4347- Integrate Bridge with a native app for Arvo
4448
45−
4649## OS (Arvo)
4750
4851As a team, we want Urbit to be our primary computer, our last computer, our permanent computer. And we want this now — or at least as soon as we possibly can. We’re both ambitious and impatient.
@@ -51,13 +54,13 @@ The frustration that we can’t move onto Urbit today propels us forward. The sy
5154
5255We’re very nearly to the point that all the kernel-level code in the system has been written by our current team. The one remaining vane that deserves a rewrite (Gall) has had a major cleanup by Jared just recently. The [Ship of Theseus](https://en.wikipedia.org/wiki/Ship_of_Theseus) approach does appear to be working. The infrastructure team is doing fantastic work and has really deepened their ownership of the system. The Urbit of today is on the road to becoming a great piece of system software.
5356
54−The biggest infrastructure-level milestone was the release of [Urbit 0.8.0](https://github.com/urbit/urbit/releases/tag/v0.8.0). We introduced a new process-separation architecture, implemented the correct bootstrap sequence, moved to LMDB for persistence, replaced our http vane (%eyre) and moved to Nix for our build system.
57+The biggest infrastructure-level milestone was the release of [Urbit 0.8.0](https://github.com/urbit/urbit/releases/tag/v0.8.0). We introduced a new process-separation architecture, implemented the correct bootstrap sequence, moved to LMDB for persistence, replaced our http vane (%eyre) and moved to Nix for our build system.
5558
56−To put it simply, Arvo is now much more stable and durable. During the beginning of the year we were seeing bugs and instability that were frustrating and unacceptable. While there are still issues on the live network, none of them terrify us much. We also implemented the ability for users to ‘individually breach’, which means that you can now reset your Urbit without waiting for us to reset the network.
59+To put it simply, Arvo is now much more stable and durable. During the beginning of the year we were seeing bugs and instability that were frustrating and unacceptable. While there are still issues on the live network, none of them terrify us much. We also implemented the ability for users to ‘individually breach’, which means that you can now reset your Urbit without waiting for us to reset the network.
5760
5861### Landscape (Arvo UI)
5962
60−We don’t just build infrastructure for others to develop on top of. We build interfaces too. At the top of the stack, we released a completely new Landscape, the interface for Arvo. This new interface makes it possible to build other ‘modules’ for Arvo that go beyond chat and publishing.
63+We don’t just build infrastructure for others to develop on top of. We build interfaces too. At the top of the stack, we released a completely new Landscape, the interface for Arvo. This new interface makes it possible to build other ‘modules’ for Arvo that go beyond chat and publishing.
6164
6265This new Landscape is a complete departure from the last direction. Your Urbit now has a simple home screen that launches individual modules and it’s [relatively easy](https://github.com/urbit/create-landscape-app) to create new ones. We’re all enjoying using Landscape around the office. It’s still a bit of a prototype — but it’s quite a good one, I think.
6366
@@ -78,10 +81,9 @@ This version of Landscape is, I think, the last one that we’ll call a prototyp
7881
7982**Q1 2020**
8083
81−- Integrated client with Bridge and Arvo
84+- Integrated client with Bridge and Arvo
8285- New interface framework, codenamed ‘Widescreen’
8386
84−
8587## Docs + Community
8688
8789We had quite a bit of interest in our second session of Hoon School. We ended up with 150 people enrolled in Hoon 101, and 42 in 201. The 101 session just ended, with a lot of positive responses and feedback from the participants. We learned a lot doing it and got quite a bit of interesting new example code.
@@ -101,11 +103,10 @@ We also did some experimentation with holding events on Arvo. We held weekly AMA
101103- Vane level documentation
102104- An active grant program
103105
104−
105106## urbit.org
106107
107108Urbit.org is about ready for a refresh — so we’re in the process of rebuilding it. We have, for a long time, told the story of Urbit by describing the system technically. We think Urbit can be explained much more simply and much more concisely. We’re working to put together a new set of materials in this direction.
108109
109110We’d also like to populate urbit.org with a lot more content about what we’re working on and thinking about. We do a reasonable job of writing updates, but many of our projects get released without any background info. Tlon and the Urbit community are full of smart, thoughtful people — and we’d like to do a lot more to surface their work. We plan to close out the year with both a new website and a lot of writing about what we’ve been building. Not everyone wants to read the source code!
110111
111−That covers it for now. If you have questions or want to chat — find us in `~dopzod/urbit-help`. See you online!
112+That covers it for now. If you have questions or want to chat — find us in `~dopzod/urbit-help`. See you online!
content/blog/2019-5-roadmap.md+4−3
@@ -1,8 +1,9 @@
11+++
22title = "~2019.5 Roadmap"
3−date = 2019-05-16
3+date = "2019-05-15"
44description = "Where we are and where we're going as of mid-2019."
5−aliases = ["/posts/essays/2019-5-roadmap", "/posts/2019-5-roadmap"]
5+aliases = [ "/posts/essays/2019-5-roadmap", "/posts/2019-5-roadmap" ]
6+
67[extra]
78author = "Galen Wolfe-Pauly"
89ship = "~ravmel-ropdyl"
@@ -29,7 +30,7 @@ It’s true. Azimuth is operational, secure, and well tested. It’s a pretty co
2930
3031So the question is why haven’t we told the world about it?
3132
32−I tend to think that in order for a technology to succeed it has to not only be an important technical innovation, it also has to be easy to understand as a product. And that’s our answer: we’ve undersold Azimuth because we want it to be easier to understand by *using*, not just by reading the code. Azimuth is quite an elegant piece of technology — but that doesn’t matter until it has a great user experience to match.
33+I tend to think that in order for a technology to succeed it has to not only be an important technical innovation, it also has to be easy to understand as a product. And that’s our answer: we’ve undersold Azimuth because we want it to be easier to understand by _using_, not just by reading the code. Azimuth is quite an elegant piece of technology — but that doesn’t matter until it has a great user experience to match.
3334
3435That’s why, in the near term, we’re focused on building on top of Azimuth ourselves. We can’t ask others to go down roads if we haven’t already been down them.
3536
content/blog/2020-to-2021.md+2−2
@@ -1,7 +1,8 @@
11+++
22title = "2020 -> 2021"
33description = "Reflecting and looking forward."
4−date = 2021-01-21
4+date = "2021-01-20"
5+
56[extra]
67author = "Josh Lehman"
78ship = "~wolref-podlex"
@@ -43,7 +44,6 @@ Growth in Urbit’s developer community has been growing organically in lockstep
4344
4445My strategy to date has been heavily focused on working directly with contributors to provide technical guidance and direction, and it’s been working really well. To that end I’ll also be scaling our ability to provide such support by bringing more individuals into urbit.org that can mentor, review work, and provide guidance on where to best direct contributors' energy.
4546
46−
47472021 is shaping up to be a big year for Urbit, and we'd [love your help](https://grants.urbit.org) in building it. If you want to see what we're working on in real time, join us in Landscape at ~wolref-podlex/foundation.
4848
4949See you on the network!
content/blog/20200929-state-of-urbit.md+4−7
@@ -1,11 +1,12 @@
11+++
22title = "Late 2020 Progress Update: OS 1 -> OS 1.N"
3−date = 2020-09-29
3+date = "2020-09-28"
44description = "When we announced OS 1, in April, we started to disappear into Urbit. Since then, we’ve been living on Urbit like we never have before."
5+
56[extra]
67author = "Galen Wolfe-Pauly"
78ship = "~ravmel-ropdyl"
8−image ="https://storage.googleapis.com/media.urbit.org/site/posts/essays/state-of-urbit-1.jpg"
9+image = "https://storage.googleapis.com/media.urbit.org/site/posts/essays/state-of-urbit-1.jpg"
910+++
1011
1112<br>
@@ -16,7 +17,7 @@ image ="https://storage.googleapis.com/media.urbit.org/site/posts/essays/state-o
1617
1718When we announced OS 1, in April, we started to disappear into Urbit. Since then, we’ve been living on Urbit like we never have before. This has been our goal for years: to mature the system we’re building by becoming its first committed users. We knew that critical step toward Urbit’s maturity was being able to depend on it ourselves, but the system itself had to mature to the point that we could do that practically.
1819
19−We’ve done this in fits and starts. We’ve *tried* and failed a few times over the years. We’ve always *used* Urbit to some extent, but we’ve never *relied* on it. These past six months have been different. I can’t tell whether it was out of sheer determination and commitment, or that the system was just genuinely ‘there’. Either way, both Tlon and the Urbit Community genuinely live on Urbit now.
20+We’ve done this in fits and starts. We’ve _tried_ and failed a few times over the years. We’ve always _used_ Urbit to some extent, but we’ve never _relied_ on it. These past six months have been different. I can’t tell whether it was out of sheer determination and commitment, or that the system was just genuinely ‘there’. Either way, both Tlon and the Urbit Community genuinely live on Urbit now.
2021
2122In a way, our ability to use Urbit day to day doesn’t make sense. When we shipped OS 1, it was full of holes. There were serious performance, stability, and reliability issues. Plenty of people showed up and thought, ‘I don’t understand why you think this is useful.’ But, it was good enough that we wanted to use it. And since we wanted to use it, we put our energy into making it better like we hadn’t ever before. Being able to use a system that you can really trust is a wonderful feeling. It’s Computing Without Compromises.
2223
@@ -26,7 +27,6 @@ The tl;dr is that Urbit is much faster, more reliable, and nicer to use than it
2627
2728Anyway, let’s walk through the details. We’ll talk about our infrastructure and interface work independently, since that’s how we organize things internally. Then we’ll talk a bit about what’s going on on the network.
2829
29−
3030### Infrastructure
3131
3232![Debugging Interface](https://storage.googleapis.com/media.urbit.org/site/posts/essays/state-of-urbit-2.png)
@@ -43,7 +43,6 @@ We also rewrote a large part of our runtime in Haskell and made overall progress
4343
4444The network is stable, fast, and safe from day to day. We’re pretty confident it can grow quite a bit without serious issues. When we shipped OS 1 we really weren’t sure what we could handle. Now we’re standing on much more solid ground.
4545
46−
4746### Interface
4847
4948![](https://storage.googleapis.com/media.urbit.org/site/posts/essays/state-of-urbit-3.jpg)
@@ -60,7 +59,6 @@ Those two are by far the most significant, but there’s so much more. We [rewro
6059
6160And I almost forgot [Leap](https://github.com/urbit/urbit/pull/3231): an omnibox for navigating around OS 1 with the keyboard. We have plans to make Leap much more powerful — but it’s a great first start toward making OS 1 keyboard accessible. I almost exclusively use [Leap](https://upload.wikimedia.org/wikipedia/commons/0/06/Canon_Cat_keyboard.jpg) to get around OS 1 these days.
6261
63−
6462### Community + network
6563
6664![Fishing Village](https://storage.googleapis.com/media.urbit.org/site/posts/essays/state-of-urbit-5.png)
@@ -71,7 +69,6 @@ Getting onto Urbit is still relatively challenging. By the standards of software
7169
7270Turns out, there are plenty of people who are up for running Urbit themselves and quite a few small communities have sprouted around the network. Overall the network has a fun, cozy feeling. It’s nice.
7371
74−
7572### What’s next
7673
7774We’re still more or less flat-out, full speed ahead into an even better Urbit-world. The seeds of change were planted when we made Josh the [interim technical director of urbit.org](https://urbit.org/blog/first-steps-towards-urbit-org/). Urbit itself is getting close to the point where the separation between Urbit and Tlon has to become more real. Urbit is aimed at being an ubiquitous platform, Tlon is aimed at making it as usable and useful as possible.
content/blog/20201119-models-of-society.md+4−4
@@ -1,14 +1,15 @@
11+++
22title = "Models of Society"
33description = "Conversations compose society. What composes conversation — how do we digitize it in a way that enhances society without imposing upon it? How do we form this new medium, both to facilitate natural human behavior and to inspire the best of it?"
4−date = 2020-11-19
4+date = "2020-11-18"
5+
56[extra]
67author = "Tyler Shuster"
78ship = "~radbur-sivmus"
89image = "https://media.urbit.org/site/posts/essays/cochno-stone.png"
910+++
1011
11−*I had used Facebook and Google for my entire adult life. I knew they were toxic but I didn't know why. For a few weeks I tried to create a website that would scrape data from Facebook’s API and push data back, puppetting it from my own server. But as I stared headlong into the ever-shifting darkness of the modern web, I despaired and abandoned my attempt. Less than a year later I heard about Urbit. Technically, it went way over my head&mdash;but socially I knew exactly what it was, what it always had to be, why it was a discovery and not an invention, a place and not a product. I've watched the settlers there for four years, only just now using the opportunity of the pandemic to swim to this new landscape and gaze upon this young nation, this digital city, this urbis ec bit. I do not work for Tlon. I just live here.*
12+_I had used Facebook and Google for my entire adult life. I knew they were toxic but I didn't know why. For a few weeks I tried to create a website that would scrape data from Facebook’s API and push data back, puppetting it from my own server. But as I stared headlong into the ever-shifting darkness of the modern web, I despaired and abandoned my attempt. Less than a year later I heard about Urbit. Technically, it went way over my head&mdash;but socially I knew exactly what it was, what it always had to be, why it was a discovery and not an invention, a place and not a product. I've watched the settlers there for four years, only just now using the opportunity of the pandemic to swim to this new landscape and gaze upon this young nation, this digital city, this urbis ec bit. I do not work for Tlon. I just live here._
1213
1314<hr>
1415
@@ -59,7 +60,6 @@ In theory, we would have a digital city with unique regions, public fora, and so
5960
6061## Urbis ec Bit
6162
62−
6363<br>
6464
6565![View of Florence from San Miniato](https://media.urbit.org/site/posts/essays/view-of-florence.jpg)
@@ -74,4 +74,4 @@ The default tools work with messages in a few of the ways with which we've grown
7474
7575Similar to working undeveloped land, it takes a lot of hard work, which is why Urbit is not ready for mainstream adoption yet, and why I alluded to the idea of settlers in my opening paragraph. Traveling to the new world is not for everyone, but everyone is welcome.
7676
77−*How could one do other than submit to Tlön, to the minute and vast evidence of an orderly plant? It is useless to answer that reality is also orderly. Perhaps it is, but in accordance with divine laws&mdash;I translate: inhuman laws&mdash;which we never quite grasp. Tlön is surely a labyrinth, but it is a labyrinth devised by men, a labyrinth destined to be deciphered by men.*
77+_How could one do other than submit to Tlön, to the minute and vast evidence of an orderly plant? It is useless to answer that reality is also orderly. Perhaps it is, but in accordance with divine laws&mdash;I translate: inhuman laws&mdash;which we never quite grasp. Tlön is surely a labyrinth, but it is a labyrinth devised by men, a labyrinth destined to be deciphered by men._
content/blog/a-founders-farewell.md+36−32
@@ -1,8 +1,12 @@
11+++
22title = "A Founder's Farewell"
3−date = 2019-01-14
3+date = "2019-01-13"
44description = "My goal was always to fire myself at the first possible opportunity. I'm super happy to reach it."
5−aliases = ["/posts/essays/a-founders-farewell", "/posts/a-founders-farewell"]
5+aliases = [
6+ "/posts/essays/a-founders-farewell",
7+ "/posts/a-founders-farewell"
8+]
9+
610[extra]
711author = "Curtis Yarvin"
812ship = "~sorreg-namtyv"
@@ -29,7 +33,7 @@ ceased to be mine and became the world's. Urbit works; its PKI
2933is on the Ethereum mainnet; it's open source; in every way,
3034technical, legal, and mathematical, it is the world's.
3135
32−(What _is_ Urbit? Please read the [primer](/primer).)
36+(What _is_ Urbit? Please read the [primer](/primer).)
3337
3438Let's talk about: why I've left; the state of Tlon; and the state
3539of Urbit. If there's any time left, we'll read some poetry.
@@ -68,7 +72,7 @@ nothing ever built before.
6872
6973Urbit in 2013 had roughly the same feature set as Slack in 2013,
7074but less polished, and decentralized. It was pretty buggy and
71−slow. But had we put all our resources into debugging and
75+slow. But had we put all our resources into debugging and
7276optimization, it would not have taken five years.
7377
7478My instinct was always that Urbit's delivery schedule should be
@@ -88,7 +92,7 @@ As seen from the 2019 Urbit, this is very lame indeed.
8892The conventional wisdom is to ship your embarrassing "MVP." For
8993several reasons, Urbit occupies a unique strategic position.
9094Urbit just isn't relevant until Urbit is, if not perfect,
91−uniformly excellent. It can't just work. It has to work right.
95+uniformly excellent. It can't just work. It has to work right.
9296Urbit has to be amazing – which is hardly a useless discipline.
9397
9498I still did not think it would take five years to make Urbit
@@ -121,7 +125,7 @@ not even the best engineer on the project; I just got here first.
121125This codebase is very young and very general; there is a lot of
122126fun left to be had with it; others deserve to have that fun.
123127
124−I have no successor as "BDFL." Technical leadership passes to
128+I have no successor as "BDFL." Technical leadership passes to
125129Tlon as a company. Urbit is open source and anyone may play, but
126130anyone who wants to catch up to Tlon still has a lot to learn.
127131Not that that should stop them!
@@ -143,7 +147,7 @@ The startup is the least worst. I'd do it again.
143147
144148A normal startup lifecycle (Tlon actually got into YC, but
145149declined – this was either cool or lame) looks nothing like a
146−normal system-software lifecycle. Nor is Urbit normal. But
150+normal system-software lifecycle. Nor is Urbit normal. But
147151while Silicon Valley is absurd, it still fits Marianne Moore's
148152line: "with a perfect contempt for it, one discovers that there
149153is in it after all a place for the genuine."
@@ -175,7 +179,7 @@ is not for lack of talent-hours. Imagine a bazaar creating a
175179feature film, and you'll get the picture. (And Fuchsia seems
176180like a fairly traditional OS.)
177181
178−Why is creative work so hard for bazaars? We could take this as
182+Why is creative work so hard for bazaars? We could take this as
179183an axiom – but it's worth understanding.
180184
181185The path from concept to product is an annealing process. Your
@@ -204,7 +208,7 @@ now, and hard problems. Unless you postpone anything that isn't
204208a hard but solvable problem, your gas will never turn into steel.
205209There are lots and lots and lots of ways to go nowhere fast.
206210
207−Somehow it's 2019. Urbit is hot iron under the hammer. It is
211+Somehow it's 2019. Urbit is hot iron under the hammer. It is
208212solid, but not yet hard. It has shape, but can yet be shaped.
209213It is done, but ought to be finished. It is a sword; you don't
210214want to get stabbed with it; it is not Excalibur, the blade to
@@ -259,8 +263,8 @@ others know better. When we transitioned from Nock 5 to Nock 4,
259263all I contributed was a suggestion. The same for our Ethereum
260264address collection, which our customers absolutely loved.
261265
262−Who's responsible for growing and maintaining this team? Who's
263−the stone at at the top of the pyramid? Not me: if you gave me a
266+Who's responsible for growing and maintaining this team? Who's
267+the stone at at the top of the pyramid? Not me: if you gave me a
264268goat to feed, the goat would die. The stone that holds the arch
265269together is Tlon's CEO and my cofounder, Galen Wolfe-Pauly.
266270
@@ -297,8 +301,8 @@ words that might otherwise go unsaid.
297301### Urbit, a level and neutral platform
298302
299303Urbit's distribution and sponsorship hierarchy of galaxies,
300−stars and planets is *not* designed as a political structure,
301−or even a social structure. The actual social layer is in
304+stars and planets is _not_ designed as a political structure,
305+or even a social structure. The actual social layer is in
302306userspace -- one layer up.
303307
304308Socially and politically, Urbit is a flat network of planets.
@@ -334,10 +338,10 @@ less than half). The rest are held by third parties – all of
334338whom have either much more, or much less, than they deserve.
335339
336340But although the distribution of Urbit space was thoroughly
337−unfair, it was always _honest_ and never _corrupt_. Everyone
341+unfair, it was always _honest_ and never _corrupt_. Everyone
338342who has galaxies or stars did _something_ for Urbit. Some gave a
339343lot of money, some gave a little; some contributed a lot of code,
340−some just showed up. We paid a lawyer by bartering a pair. A
344+some just showed up. We paid a lawyer by bartering a pair. A
341345bunch went to contest winners who solved a trivial Nock problem
342346in 2010.
343347
@@ -347,14 +351,14 @@ often had to be in the right place at the right time. This is
347351another problem with life that we can't fix.
348352
349353Every real system of property is unfair. Who deserves to own
350−Manhattan? Who does own it? If property be not unfair – if it
354+Manhattan? Who does own it? If property be not unfair – if it
351355is not the result of respecting past accidents – it is not
352356property at all, but something else. I certainly would not do it
353357this haphazardly again, but the outcome is no tragedy.
354358
355359When you live in Manhattan, you simply don't worry about who
356−owns it or why; and nor does it matter. Are they Jews? Muslims?
357−Christians? Communists? Italians? You don't care and you don't
360+owns it or why; and nor does it matter. Are they Jews? Muslims?
361+Christians? Communists? Italians? You don't care and you don't
358362have to. You know it's basically random and probably unfair.
359363Randomness, even blatant unfairness, creates a kind of neutral,
360364peaceful, even promising urban anonymity.
@@ -401,7 +405,7 @@ Turing Award – my money is definitely on Raph at this point.
401405You can even go and read my Usenix '93 paper on ASLR-secured
402406RPC, which won Best Student Paper and has like 50 citations.
403407
404−Well. That whole scene is a bad trip, kids. Avoid it. Also, if
408+Well. That whole scene is a bad trip, kids. Avoid it. Also, if
405409you start out as Rimbaud, you might end up as Lebowski. On the
406410other hand, to have any excuse for boiling the ocean, you do have
407411to make some serious CS problems just go away. Here are three.
@@ -436,13 +440,13 @@ transactions.
436440
437441This means you can't write a command protocol where your commands
438442get executed exactly once. You can only choose "at least once"
439−or "at most once." This problem is as ridiculous and frustrating
443+or "at most once." This problem is as ridiculous and frustrating
440444as it sounds.
441445
442446You can address it in three ways: (a) make all your commands
443447formally idempotent, so that repeating them has no additional
444448effect; (b) insert a layer of stateful middleware — a message
445−queue; (c) be fine with "almost always once." Guess which
449+queue; (c) be fine with "almost always once." Guess which
446450approach is most popular?
447451
448452Your Urbit ship has one permanent brain. Its acks are end-to-end
@@ -453,14 +457,14 @@ queue. And every message is executed once.
453457#### Dependencies
454458
45545920th-century languages are all at least vaguely based on a
456−formalism from the '30s called the "lambda calculus." The
460+formalism from the '30s called the "lambda calculus." The
457461fundamental operation in lambda calculus is variable reduction
458462from name to value. So lambda languages all have a symbol table
459463or environment which binds names to values.
460464
461465Modern build systems assemble large programs out of small files
462466by reusing this symbol table for global function names, a process
463−called "linking." Unfortunately, linking causes a problem known
467+called "linking." Unfortunately, linking causes a problem known
464468as "dependency hell," involving baffling, unpredictable upgrade
465469failures. The fundamental problem is the "diamond dependency" —
466470when a build requires two different versions of one symbol.
@@ -517,7 +521,7 @@ demands "space-rated" code that documents every variable and
517521every line – and almost none of the codebase is space-rated.
518522
519523Urbit's internal opacity persists for two reasons, one good and
520−one bad. The bad reason is just laziness. The good reason is
524+one bad. The bad reason is just laziness. The good reason is
521525justified fear of _premature explanation_, which like premature
522526optimization ruins the annealing process.
523527
@@ -542,7 +546,7 @@ in a box for 50 years, or 100, or 500, and when you turn it on
542546in a modern interpreter it will upgrade itself and work fine.
543547
544548There aren't any significant structural obstacles to each of
545−these milestones. But we can't claim them yet. We haven't
549+these milestones. But we can't claim them yet. We haven't
546550really even worried about them. This is another triage case:
547551in this case, the issue is _premature reliability_.
548552
@@ -564,10 +568,10 @@ computer obviously suggests.
564568
565569Instead, Urbit today is built more the Unix way (if not the
566570Windows way). It has separate subsystems for tracking and
567−updating these three kinds of data. This was my design. Like
571+updating these three kinds of data. This was my design. Like
568572Urbit's opacity or impermanence, this was always obviously lame.
569573
570−Why do it the lame way? Because, before understanding the union
574+Why do it the lame way? Because, before understanding the union
571575of these problems, we had to understand each problem by itself.
572576We didn't – not even close.
573577
@@ -587,17 +591,17 @@ ahead, and falling down an impossible rathole.
587591
588592## Further reading
589593
590−What will I do personally? I'll spend more time with my kids.
594+What will I do personally? I'll spend more time with my kids.
591595I'll finish reading my 1911 Britannica – I am only on the B's.
592596I have no other long-term plans.
593597
594598But I won't be back to Urbit. I am leaving not just the project
595599but the field – no less than Satoshi, or Everett, or Rimbaud.
596−Will Satoshi weigh in on the next Bitcoin Cash fork? Did Rimbaud
597−fly back from Ethiopia for his book-release tour? (Did anyone
598−want him back?) It's not so bad to be a middle-aged Rimbaud.
600+Will Satoshi weigh in on the next Bitcoin Cash fork? Did Rimbaud
601+fly back from Ethiopia for his book-release tour? (Did anyone
602+want him back?) It's not so bad to be a middle-aged Rimbaud.
599603
600−Is there more to say? Of course, but not in prose. Read
604+Is there more to say? Of course, but not in prose. Read
601605Bunting's _Chomei at Toyama_ and _Notes on a Fly-Leaf_; Cavafy's
602606_Il Gran Rifiuto_, Keeley & Sherrard translation; Canto XV of the
603607Inferno, Pinsky translation. You might learn something.
content/blog/a-topiary.md+2−1
@@ -1,7 +1,8 @@
11+++
22title = "A Topiary: Hypertext and Urbit"
3−date = 2021-06-14
3+date = "2021-06-13"
44description = "A brief history of hypertext and Urbit networking"
5+
56[extra]
67author = "Reid Scoggin"
78ship = "~sitful-hatred"
content/blog/aesthetic-culture-1.md+3−2
@@ -1,7 +1,8 @@
11+++
22title = "Aesthetic Culture #1"
33description = "One of the most exciting things about Urbit is the aesthetic and design around it, developed partly by Tlon (through the design of Urbit itself) and partly by the community (by producing great Urbit art)."
4−date = 2020-11-12
4+date = "2020-11-11"
5+
56[extra]
67description = "One of the most exciting things about Urbit is the aesthetic and design around it, developed partly by Tlon (through the design of Urbit itself) and partly by the community (by producing great Urbit art)."
78author = "Nikolai Mallett"
@@ -15,7 +16,7 @@ image = "https://media.urbit.org/site/posts/essays/help-the-environment.jpg"
1516
1617<br>
1718
18−*This post is the first in a series of digests centered on art produced within and about Urbit by a member of the community, ~nartes-fasrum. Monthly digests will be available within the Urbit Community group in Landscape, and will occasionally be compiled here on the blog to give you a sneak peek at some of what’s happening on the network. Enjoy! ~wolref-podlex*
19+_This post is the first in a series of digests centered on art produced within and about Urbit by a member of the community, ~nartes-fasrum. Monthly digests will be available within the Urbit Community group in Landscape, and will occasionally be compiled here on the blog to give you a sneak peek at some of what’s happening on the network. Enjoy! ~wolref-podlex_
1920
2021One of the most exciting things about Urbit is the aesthetic and design around it, developed partly by Tlon (through the design of Urbit itself) and partly by the community (by producing great Urbit art). As the community grows, it creates more art, and we have the opportunity to showcase some of the pieces we love. These works can draw curious new users in, and they give existing users ways to communicate their excitement to friends.
2122
content/blog/after-machine-war.md+2−2
@@ -1,7 +1,8 @@
11+++
22title = "After the Machine War"
33description = "The date is January 1, 2050. The place, New York City. The vibe...subdued."
4−date = 2021-03-15
4+date = "2021-03-14"
5+
56[extra]
67author = "Simon Kovacs"
78ship = "~bacbec-lormur"
@@ -14,7 +15,6 @@ image = "https://storage.googleapis.com/media.urbit.org/site/posts/essays/berlin
1415
1516<br>
1617
17−
1818> The following fictional passage, from a book being written in an Urbit Group called “the Aleph,” sketches out a dismal future for the human race. As an item of speculative fiction, the piece is not what one might call original. Anyone could have come up with these ideas. In fact, several already have. The Matrix is an obvious antecedent. Vonnegut isn’t far behind either. And the treacly humanism lodged beneath the bitter humor resembles nothing so much as the work of that beau monde satirist, George Saunders.
1919>
2020> Really the only notable thing about it is that it was written on Urbit. And that, perhaps, has made all the difference.
content/blog/an-email.md+8−12
@@ -1,7 +1,8 @@
11+++
22title = "An Email from the Archive"
33description = "I found this email in my archives recently and thought it might be fun to share publicly."
4−date = 2020-11-30
4+date = "2020-11-29"
5+
56[extra]
67author = "Galen Wolfe-Pauly"
78ship = "~ravmel-ropdyl"
@@ -27,32 +28,30 @@ Our collective desire to depend on digital communication tools vastly exceeds wh
2728
2829In the pre-digital world we enjoyed a few things about the way we communicated, collaborated and did business that are dwindling: simplicity, durability and ownership. I’ll try to give some straightforward examples of what I mean:
2930
30−A - When I talk to someone directly, I’m not worried that someone else is listening in. If they go tell someone else what I said to them, that’s something for us to work out between us — they’re not *always* reporting our conversations back to a third party. The constraints of the interaction and the privacy implications are *simple* — I don’t think about them at all. Good privacy guarantees flow from a strict focus on simplicity. When two people want to talk to each other: give them a secure channel to talk. Putting a centrally-controlled service between them is just an interim solution because no one could figure out a better way to do it.
31+A - When I talk to someone directly, I’m not worried that someone else is listening in. If they go tell someone else what I said to them, that’s something for us to work out between us — they’re not _always_ reporting our conversations back to a third party. The constraints of the interaction and the privacy implications are _simple_ — I don’t think about them at all. Good privacy guarantees flow from a strict focus on simplicity. When two people want to talk to each other: give them a secure channel to talk. Putting a centrally-controlled service between them is just an interim solution because no one could figure out a better way to do it.
3132
3233B - When I write something down on paper, or type into a typewriter, I have an intuitive sense of the durability of what I’ve made. I have notes on my shelf I took ten years ago. I don’t worry about them disappearing. This means I can have a very direct, high-resolution relationship with the medium. I can pour myself into my physically-written notes in a way I would never pour myself into a Google Doc. Our digital tools are deeply untrustworthy because we know they can disappear, that they won’t actually last forever.
3334
34−C - Around 2008 I started limiting myself to a few specific drawing and writing tools. I use them all the time and can actually refine my relationship to them since I know they’re not going to change out from under me. Perhaps at some point these pens wont be made anymore, but the ones I have are actually *mine*. Similarly, the things I make with them actually belong to me in a way that doesn’t require some ridiculous terms of service. A sense of ownership, when it comes to the medium of communication, determines our level of trust and commitment.
35+C - Around 2008 I started limiting myself to a few specific drawing and writing tools. I use them all the time and can actually refine my relationship to them since I know they’re not going to change out from under me. Perhaps at some point these pens wont be made anymore, but the ones I have are actually _mine_. Similarly, the things I make with them actually belong to me in a way that doesn’t require some ridiculous terms of service. A sense of ownership, when it comes to the medium of communication, determines our level of trust and commitment.
3536
3637Our digital tools have to achieve the same level of simplicity, durability and ownership that our pre-digital tools did. Until they do, we’re always going to be in conflict with them, full stop.
3738
38−The main thing is that exactly none of our present platform-centric world can survive when you see things this way. The digital world we live in is composed of an insanely complicated, ephemeral set of tools that distinctly *do not* belong to the people that use them.
39+The main thing is that exactly none of our present platform-centric world can survive when you see things this way. The digital world we live in is composed of an insanely complicated, ephemeral set of tools that distinctly _do not_ belong to the people that use them.
3940
4041We’re going to be in a constant struggle with technology until it conforms to these three very basic expectations. These are the expectations we try to get Urbit to fall in-line with, of course. Something else could also succeed by satisfying them. But I also don’t really see anything else, aside from Bitcoin and maybe Ethereum, falling in line with these core principles.
4142
4243So: while I wish that Urbit was more mature and ready to capture those that are being purged from mainstream social media, are bored with it or are frustrated with the constraints of ‘productivity software’ — I think this conflict is going to drag on until people realize that what we’re in conflict with is the structure of the software we use. Using software that’s managed by other people is always going to cause serious problems all the way up at the user level. For more speculation on how this might play out, watch Black Mirror.
4344
44−
45452 -
4646
4747(1) is, in a way, a long-winded way of saying that the state of the world hasn’t changed our direction all that much. In order for Urbit to be approachable to use, it has to be very nicely made and that takes time and iteration. As the system stabilizes, Urbit can evolve in a more traditional way: we, along with others in the ecosystem, release stuff, observe how people use it, and try to make it better. We’re at the point where we’re nearly ready to get into that feedback loop, and we very much need to get there. We’re close.
4848
49−Urbit is a distinctly different *kind* of software than anything we have now. Your Urbit is something you actually own and can do whatever you want with: not unlike your furniture or your kitchen tools. An Urbit is a tool for individual, human-scale computing and our whole approach to designing and making things is completely different. Most computing is about industrial-scale computing: where the software system stores everyone’s data and is managed by the people who build it.
49+Urbit is a distinctly different _kind_ of software than anything we have now. Your Urbit is something you actually own and can do whatever you want with: not unlike your furniture or your kitchen tools. An Urbit is a tool for individual, human-scale computing and our whole approach to designing and making things is completely different. Most computing is about industrial-scale computing: where the software system stores everyone’s data and is managed by the people who build it.
5050
5151Urbit is the opposite of industrial-scale. Urbit is much more like something that’s carefully crafted and delivered to you directly. This craftsman-like approach to building software really isn’t a part of most modern software engineering.
5252
5353When I think about this from the standpoint of the person using what we make, it’s especially important. Urbit should feel like something that’s purposefully made by hand — not something you picked off the shelf at Wal-Mart. Some of this ethos was present in the early PC movement, but it’s mostly lost today. The care and attention that goes into building the system is also exactly what we make money on. People pay us to own a piece of it, to use it. We’re incentivized to make nice things, in the Urbit model, and we take that responsibility seriously.
5454
55−
56553 -
5756
5857Networks are a really important social form that’s only just beginning to come into existence. A network is neither a state nor a company, but something in-between. Bitcoin is a network, Ethereum is network (but it’s still far too centralized). Urbit is a young network.
@@ -63,15 +62,13 @@ Urbit is controlled by the collective of people who use it — in varying degree
6362
6463On a successful Urbit network, Facebook, Airtable, and Signal are just successful applications. You could probably build companies around them that ship software to Urbit — but they’re more like 5 - 10 people instead of thousands.
6564
66−Urbit doesn’t aim to eat away at the government per se. Instead, it’s an important communication tool for institutions of any scale to actually take control of their means of collaboration. The efficiency of inter-government communication and government to populace communication can clearly be improved by *a whole lot*.
67−
65+Urbit doesn’t aim to eat away at the government per se. Instead, it’s an important communication tool for institutions of any scale to actually take control of their means of collaboration. The efficiency of inter-government communication and government to populace communication can clearly be improved by _a whole lot_.
6866
69674 -
7068
7169The most important thing is that people can generate a vision of the future. This can only emerge from a small collective of motivated people. Our public life is overwhelmed by people shooting from the hip, aiming for likes.
7270
73−There are difficult, infrastructural problems *all over the place* that desperately need the considerate attention of small groups of people. Urbit, as communication tooling, is aimed at improving the quality of the fabric that binds these groups together. Or, to put it another way, before you can solve any specific problem you have to improve the problem solving process overall. Everything is gated on solving the process.
74−
71+There are difficult, infrastructural problems _all over the place_ that desperately need the considerate attention of small groups of people. Urbit, as communication tooling, is aimed at improving the quality of the fabric that binds these groups together. Or, to put it another way, before you can solve any specific problem you have to improve the problem solving process overall. Everything is gated on solving the process.
7572
76735 -
7774
@@ -83,6 +80,5 @@ The thing that comes to mind lately is Hejduk. He had passed away by the time I
8380
8481Hejduk was able to see that architecture isn’t about building buildings per se, but something else. That was always quite obvious to me.
8582
86−
8783Talk soon!
8884G
content/blog/an-urbit-overview.md+79−75
@@ -1,8 +1,12 @@
11+++
22title = "An Urbit Overview"
3−date = 2016-05-11
3+date = "2016-05-10"
44description = "A high-level overview of Urbit."
5−aliases = ["/posts/essays/an-urbit-overview", "/posts/an-urbit-overview"]
5+aliases = [
6+ "/posts/essays/an-urbit-overview",
7+ "/posts/an-urbit-overview"
8+]
9+
610[extra]
711author = "Galen Wolfe-Pauly"
812ship = "~ravmel-ropdyl"
@@ -17,79 +21,79 @@ Urbit is a virtual city of general-purpose personal servers.
1721
1822## Your old personal server
1923
20−What's a personal server? In a sense, you already have one. Your
24+What's a personal server? In a sense, you already have one. Your
2125personal server is the combination of all the cloud services you use
2226now.
2327
24−This "server" is a mess. It's broken into 17 different fragments
25−which are scattered all over the planet. You have no control at all
26−over any of the pieces. The more we depend on Web services, the more
28+This "server" is a mess. It's broken into 17 different fragments
29+which are scattered all over the planet. You have no control at all
30+over any of the pieces. The more we depend on Web services, the more
2731we realize how unsustainable this situation is.
2832
29−Can you remember all the services you have accounts for? How about
30−the username and password for each? Some of them will let you pull
31−your data out somehow, some won't. Sometimes you can move your data
32−between them, sometimes you can't. But they're all good at
33+Can you remember all the services you have accounts for? How about
34+the username and password for each? Some of them will let you pull
35+your data out somehow, some won't. Sometimes you can move your data
36+between them, sometimes you can't. But they're all good at
3337showing you ads.
3438
3539## Your new personal server
3640
37−Your urbit is your own general-purpose server. It holds your
41+Your urbit is your own general-purpose server. It holds your
3842data; runs your apps; wrangles your connected devices; and
39−defines your secure identity. If you still need your old
43+defines your secure identity. If you still need your old
4044services, it drives them with APIs.
4145
4246Your urbit presents your whole digital life as a single web
43−service. And since it's yours, open source and patent-free, it
44−never shows you ads. Or loses your data. Or updates without
47+service. And since it's yours, open source and patent-free, it
48+never shows you ads. Or loses your data. Or updates without
4549your consent.
4650
4751Technically, Urbit is a new kind of OS that has a precise formal
48−definition. (Urbit is actually a [single mathematical function](https://media.urbit.org/whitepaper.pdf).) One advantage of a math-based OS is that Urbit is perfectly
49−portable. It can't tell whether it's in a cloud data center or on
52+definition. (Urbit is actually a [single mathematical function](https://media.urbit.org/whitepaper.pdf).) One advantage of a math-based OS is that Urbit is perfectly
53+portable. It can't tell whether it's in a cloud data center or on
5054your home PC.
5155
52−Concerned about mass surveillance? Download your urbit and restart it
53−on your laptop, or move to a new host in Iceland. Urbit's formal
56+Concerned about mass surveillance? Download your urbit and restart it
57+on your laptop, or move to a new host in Iceland. Urbit's formal
5458simplicity makes managing it as easy as managing an iPhone: all you
5559have to decide is what apps to add.
5660
57−Each urbit is a node on a global, encrypted P2P network. Your Urbit
61+Each urbit is a node on a global, encrypted P2P network. Your Urbit
5862name, a generated pseudonym like `~talsur-todres`, is also your
59−network address. Like Bitcoin, Urbit address space is a cryptographic
63+network address. Like Bitcoin, Urbit address space is a cryptographic
6064asset with a limited supply.
6165
62−By keeping addresses scarce, we make spam and abuse expensive. Urbit
66+By keeping addresses scarce, we make spam and abuse expensive. Urbit
6367is a "friendly network," like the Internet in 1986, where a stranger
64−is nice until proven nasty. As it matures, Urbit will grow into a
68+is nice until proven nasty. As it matures, Urbit will grow into a
6569decentralized, self-governing virtual city both safe and free.
6670
6771## The Urbit future
6872
6973In an Urbit world, your data is no longer trapped in a jumble of
70−proprietary servers. Your urbit is a permanent, versioned, typed
71−archive the size of your digital life. Even before you move your data
74+proprietary servers. Your urbit is a permanent, versioned, typed
75+archive the size of your digital life. Even before you move your data
7276from a Web service to a local Urbit app, your urbit can drive your
7377account with an API or scraper.
7478
75−And within Urbit, data is never locked inside apps. Imagine if you
79+And within Urbit, data is never locked inside apps. Imagine if you
7680could painlessly switch between Facebook and Google+, Asana and
77−Trello, Tumblr and WordPress. Not only does your urbit upgrade itself
81+Trello, Tumblr and WordPress. Not only does your urbit upgrade itself
7882and its apps automatically, you can "sidegrade" a running app to
7983another vendor without losing data.
8084
81−Your urbit is also your digital identity. Along with your data
85+Your urbit is also your digital identity. Along with your data
8286lifestream of media, messages and documents, it has the keys and
83−tokens to manage all your legacy Web services. It holds the keys
87+tokens to manage all your legacy Web services. It holds the keys
8488for your cryptocurrency wallets, so it can buy and sell for you.
8589(With one personal server to secure, not 17 different accounts,
8690you actually have the bandwidth to take security seriously.)
8791
88−You still use network services. But instead of interacting with
92+You still use network services. But instead of interacting with
8993the service provider's HTML UI, which phones home using
9094proprietary HTTP APIs, you interact with a third-party app on
9195your urbit, which talks to multiple service providers using
92−public, typed Urbit protocols. For example, your urbit runs a
96+public, typed Urbit protocols. For example, your urbit runs a
9397single shopping app, which downloads catalogs and uploads orders.
9498This app is one store which sells everything in the world, with a
9599salesman who's 100% on your side and always has the best price.
@@ -97,107 +101,107 @@ Every computing experience is different when the UI is working
97101exclusively for the user.
98102
99103Finally, your urbit is the hub for your network of connected
100−devices. Your smart thermostat, your wristband, your phone and
104+devices. Your smart thermostat, your wristband, your phone and
101105tablet, all run satellite urbits which talk securely to your main
102106urbit in the cloud.
103107
104108## A chance for digital freedom
105109
106110The promise of the personal server isn't just convenience.
107−General-purpose computing is magic. This magic must be in the
108−hands of all, not just those who can master Unix. The computer
109−is a bicycle for the mind. It's an open vehicle for exploration
110−and discovery. It's not a way to optimize ad delivery.
111+General-purpose computing is magic. This magic must be in the
112+hands of all, not just those who can master Unix. The computer
113+is a bicycle for the mind. It's an open vehicle for exploration
114+and discovery. It's not a way to optimize ad delivery.
111115
112116Urbit, as virtual city, is a platform that brings together all our
113117datastreams -- from emails to heartbeats -- in a way that we ourselves
114−control. Can we work together to match faces in photos, without
115−submitting to some panopticon in Mountain View? While the first step
118+control. Can we work together to match faces in photos, without
119+submitting to some panopticon in Mountain View? While the first step
116120in freedom is the right to be left alone, the second is the power to
117121form new intentional communities, to create and evolve a voluntary
118−definition of public space. We have no idea at all what people will
122+definition of public space. We have no idea at all what people will
119123do with this power.
120124
121−General-purpose computing is digital freedom. And today, a cloud data
122−center is the technically optimal locus of computation. The cloud is
123−always on, always available, never loses data. Hosts are sometimes
125+General-purpose computing is digital freedom. And today, a cloud data
126+center is the technically optimal locus of computation. The cloud is
127+always on, always available, never loses data. Hosts are sometimes
124128attacked; but they never intentionally tamper with their virtual
125−computers. The cloud can never be secure against a global adversary;
126−but most people don't have a global adversary. A single portable
129+computers. The cloud can never be secure against a global adversary;
130+but most people don't have a global adversary. A single portable
127131platform provides "herd immunity" for the few who do need direct
128132physical control over their main computers.
129133
130134Though even laptops are atrophying into mere browsers, mass-market,
131135general-purpose computing on the client side remains an endangered
132−species that must be protected. But on the server side, this species
133−has never even _existed_. There has never been anything like a
134−mass-market personal server. Why not?
136+species that must be protected. But on the server side, this species
137+has never even _existed_. There has never been anything like a
138+mass-market personal server. Why not?
135139
136140## Freedom is an engineering problem
137141
138−Urbit is not a difficult idea. Urbit is like a flying car: the idea
139−is not the hard part. Almost everyone we talk to about Urbit turns
140−out to have had pretty much the same idea themselves. The problem is
142+Urbit is not a difficult idea. Urbit is like a flying car: the idea
143+is not the hard part. Almost everyone we talk to about Urbit turns
144+out to have had pretty much the same idea themselves. The problem is
141145building it.
142146
143−A server is a computer. It's running some operating system. This OS
144−is a flavor of Unix. There are no alternatives. It's connected to
145−some network. This network is the Internet. It has no competitors.
147+A server is a computer. It's running some operating system. This OS
148+is a flavor of Unix. There are no alternatives. It's connected to
149+some network. This network is the Internet. It has no competitors.
146150You can have a personal server, if it's a Unix server on the Internet.
147151
148−Almost no one thinks being a Unix system administrator is fun. Not
152+Almost no one thinks being a Unix system administrator is fun. Not
149153even Unix system administrators think running an Internet server is
150−fun. So the personal Unix/Internet server is like the personal
151−bulldozer. This is not a consumer product. Any number of engineers
154+fun. So the personal Unix/Internet server is like the personal
155+bulldozer. This is not a consumer product. Any number of engineers
152156can't turn a bulldozer into a bicycle.
153157
154−How did we build the personal bulldozer? We didn't. We started
155−from scratch. (The people who built the first PCs didn't start
156−with a mainframe OS, either.) We created a new platform: Urbit.
158+How did we build the personal bulldozer? We didn't. We started
159+from scratch. (The people who built the first PCs didn't start
160+with a mainframe OS, either.) We created a new platform: Urbit.
157161
158−Urbit doesn't compete with Unix and the Internet. It's a new,
159−opaque layer on top of them. Your browser runs on a native OS,
162+Urbit doesn't compete with Unix and the Internet. It's a new,
163+opaque layer on top of them. Your browser runs on a native OS,
160164but it doesn't give Web apps any way to talk to the native OS.
161165Urbit is like a browser for the server side: code within Urbit is
162166formally isolated from the platform it runs on top of.
163167
164−Your urbit is a Unix process, in a data center or your PC. It sends
165−UDP packets over the Internet. It can both load and serve web pages
166−over HTTP. Except for character sets and crypto, nothing in Urbit
168+Your urbit is a Unix process, in a data center or your PC. It sends
169+UDP packets over the Internet. It can both load and serve web pages
170+over HTTP. Except for character sets and crypto, nothing in Urbit
167171reuses or depends on any 20th-century code.
168172
169173Urbit is a complete, clean-slate system software stack: a
170174non-lambda interpreter (Nock), a functional language (Hoon), and
171175an event-driven OS (Arvo), with its own encrypted protocol
172176(Ames), typed revision control (Clay), reactive web server (Eyre)
173−and functional build system (Ford). The full system, including
177+and functional build system (Ford). The full system, including
174178basic apps, is only 30,000 lines of Hoon.
175179
176180The first end-to-end prototype of Urbit took one engineer eleven
177−years. The current beta took three more years, with about three
181+years. The current beta took three more years, with about three
178182engineers on average.
179183
180−How does it take 14 years to write 30,000 lines of code? The code
181−wasn't the hard part. The hard part was rewriting it until it was
182−right. We think we've solved all the real CS problems, and we're
183−certainly done changing major interfaces. But it will take more than
184+How does it take 14 years to write 30,000 lines of code? The code
185+wasn't the hard part. The hard part was rewriting it until it was
186+right. We think we've solved all the real CS problems, and we're
187+certainly done changing major interfaces. But it will take more than
184188our small team to deliver a polished Urbit user experience that can
185189actually challenge modern web apps.
186190
187191## Where we are, what we're doing
188192
189−Urbit is in feature freeze. It's a minimum viable product in
190−early beta. It still needs quite a bit of fit-and-finish work.
193+Urbit is in feature freeze. It's a minimum viable product in
194+early beta. It still needs quite a bit of fit-and-finish work.
191195We certainly don't recommend it for end users or consider it in
192−any way secure. But it's fun to play with, if you're a hacker.
196+any way secure. But it's fun to play with, if you're a hacker.
193197
194198This summer, we're making the switch to an open and transparent
195−development and specification process. A system as unusual as
196−Urbit can't be invented in public. But it has to be finished and
199+development and specification process. A system as unusual as
200+Urbit can't be invented in public. But it has to be finished and
197201maintained in public.
198202
199203Additionally, we're creating an open political and economic process,
200−with a small, fixed-price public presale of Urbit address space. Join
204+with a small, fixed-price public presale of Urbit address space. Join
201205us and help make this future actually happen.
202206
203207To keep reading, learn more about [Urbit's address
content/blog/announcing-urbit-grants.md+6−2
@@ -1,8 +1,12 @@
11+++
22title = "Announcing: Urbit Grants Program"
3−date = 2019-08-06
3+date = "2019-08-05"
44description = "Announcing Urbit Grants, a way to earn stars through contributing."
5−aliases = ["/posts/essays/announcing-urbit-grants", "/posts/announcing-urbit-grants"]
5+aliases = [
6+ "/posts/essays/announcing-urbit-grants",
7+ "/posts/announcing-urbit-grants"
8+]
9+
610[extra]
711author = "Robert Mariani"
812ship = "~lodleb-ritrul"
content/blog/azimuth-as-multipass.md+6−3
@@ -1,8 +1,12 @@
11+++
22title = "Azimuth as Multipass"
3−date = 2019-05-16
3+date = "2019-05-15"
44description = "What if everyone had a single 'civilizational key'?"
5−aliases = ["/posts/essays/azimuth-as-multipass/", "/posts/azimuth-as-multipass"]
5+aliases = [
6+ "/posts/essays/azimuth-as-multipass/",
7+ "/posts/azimuth-as-multipass"
8+]
9+
610[extra]
711author = "Galen Wolfe-Pauly"
812ship = "~ravmel-ropdyl"
@@ -28,4 +32,3 @@ If you’re someone who’s worried about getting kidnapped, just use a child id
2832Perhaps part of how we ended up in the world we’re in is that we didn’t have something like Azimuth to begin with. Today, it’s backwards: everyone has an address on the network, but no one has an identity.
2933
3034We think everyone needs an identity that can hold money and have packets routed to it. Start there, and it’s quite fun to imagine where you end up. A civilized digital society might even be possible after all.
31−
content/blog/azimuth-is-on-chain.md+7−3
@@ -1,8 +1,12 @@
11+++
22title = "Azimuth is On-Chain"
3−date = 2019-01-14
3+date = "2019-01-13"
44description = "The Urbit address space, now called Azimuth, is on the blockchain. And too many other things to fit into a single post."
5−aliases = ["/posts/essays/azimuth-is-on-chain", "/posts/azimuth-is-on-chain"]
5+aliases = [
6+ "/posts/essays/azimuth-is-on-chain",
7+ "/posts/azimuth-is-on-chain"
8+]
9+
610[extra]
711author = "Galen Wolfe-Pauly"
812ship = "~ravmel-ropdyl"
@@ -64,7 +68,7 @@ So, how do you get an Azimuth point? We've left that question unanswered intenti
6468
6569Arvo boots from Ethereum, is no longer embarrassingly slow, and has a brand new build system. [Our documentation](https://urbit.org/docs/learn/arvo/hoon) has also improved quite a lot. Hoon, Arvo's programming language, has had a lot of work done to its type system and compiler. We built new tooling for generating static sites (you're probably reading this on one right now) that are much, much faster and easier to use.
6670
67−It's tough to talk about the progress we've made on Arvo without writing a long technical post. We'll save that for later. In a way, what's remarkable about Arvo is that it has become *less* remarkable. It's more stable, faster, and the code quality has improved.
71+It's tough to talk about the progress we've made on Arvo without writing a long technical post. We'll save that for later. In a way, what's remarkable about Arvo is that it has become _less_ remarkable. It's more stable, faster, and the code quality has improved.
6872
6973There's plenty of work to do, though. Should you be building on top of Arvo? Probably not yet. The kernel and kernel modules are really where the work still lies. We build things on top of Arvo, and in doing so it's pretty clear that the system can be better. Clay (the filesystem) and Gall (the application model) are due for a rewrite. A complete rewrite of the web server, Eyre is almost finished.
7074
content/blog/azimuth-security-bounty-program.md+6−2
@@ -1,8 +1,12 @@
11+++
22title = "Azimuth Security Bounty Program"
3−date = 2019-07-22
3+date = "2019-07-21"
44description = "Inviting you (and your friends) to help us make Azimuth as secure as possible."
5−aliases = ["/posts/essays/azimuth-security-bounty-program", "/posts/azimuth-security-bounty-program"]
5+aliases = [
6+ "/posts/essays/azimuth-security-bounty-program",
7+ "/posts/azimuth-security-bounty-program"
8+]
9+
610[extra]
711author = "Anthony Arroyo"
812ship = "~poldec-tonteg"
content/blog/beliefs-and-principles.md+28−24
@@ -1,9 +1,13 @@
11+++
22title = "Beliefs and Principles Guiding the Urbit Project"
3−date = 2016-05-11
3+date = "2016-05-10"
44description = "We believe."
5−aliases = ["/posts/essays/beliefs-and-principles",
6−"/posts/beliefs-and-principles", "/posts/principles"]
5+aliases = [
6+ "/posts/essays/beliefs-and-principles",
7+ "/posts/beliefs-and-principles",
8+ "/posts/principles"
9+]
10+
711[extra]
812author = "Curtis Yarvin + Galen Wolfe-Pauly"
913ship = "~sorreg-namtyv + ~ravmel-ropdyl"
@@ -25,19 +29,19 @@ software, through the IETF principles of sincerity and rough consensus.
2529The ability of the engineering community to govern itself through
2630republican forms is not an abstract theory; it's a proven fact.
2731
28−We believe in both free speech and individual accountability. We
32+We believe in both free speech and individual accountability. We
2933believe that a healthy network is one with diverse and well-defined
3034communities, and clear, user-controlled, boundaries between public and
3135private space.
3236
3337We believe that no software system can replace human trust and
34−communication. Dialogue, judgment and governance are essential to
35−communities of all scales. Code and law can reduce conflict in the
38+communication. Dialogue, judgment and governance are essential to
39+communities of all scales. Code and law can reduce conflict in the
3640common case; they can never handle all exceptions.
3741
3842## Principles
3943
40−Here are some principles of Urbit. Where principles conflict,
44+Here are some principles of Urbit. Where principles conflict,
4145the first stated takes precedence.
4246
4347### Digital independence
@@ -50,56 +54,56 @@ independence a useful and widely available product.
5054### Code is law
5155
5256Wherever possible, the rules of Urbit must be executable as code.
53−Wherever possible, code must be self-enforcing. If not, it must
54−be perfectly defined. If not, it must not be stated.
57+Wherever possible, code must be self-enforcing. If not, it must
58+be perfectly defined. If not, it must not be stated.
5559
5660### Sovereignty is conserved
5761
5862Even where code is law, exceptional situations demanding
59−effective collective action will always arise. There must
63+effective collective action will always arise. There must
6064always be a collective authority to solve these problems.
6165
6266Two known problems in Urbit that require central authority are
63−approval of software updates and activation of the network. But
67+approval of software updates and activation of the network. But
6468there will certainly be others.
6569
6670### Purpose of collective authority
6771
68−Urbit, as opposed to the Tlon corporation, is a republic. Its
72+Urbit, as opposed to the Tlon corporation, is a republic. Its
6973government has one task: promoting, preserving and protecting Urbit.
70−It may take any legal action which advances this goal. Any other
71−actions are *ultra vires*, out of scope. Urbit is not a
74+It may take any legal action which advances this goal. Any other
75+actions are _ultra vires_, out of scope. Urbit is not a
7276general-purpose charity.
7377
7478### Decentralized control
7579
76−Urbit should never fall under any kind of central control. All
80+Urbit should never fall under any kind of central control. All
7781transitions in galaxy ownership should divide positions, not
7882unite them.
7983
80−Galaxy and star ownership should also be separated. It is
84+Galaxy and star ownership should also be separated. It is
8185harmful for a single entity to hold both galaxies and stars.
8286
8387### Property is contingent
8488
8589Property rights are contingent and accidental, not moral or
86−meritorious. A property register does not record why an owner
87−deserves some property. Ownership is neither a reward nor a
90+meritorious. A property register does not record why an owner
91+deserves some property. Ownership is neither a reward nor a
8892right; it is a fact.
8993
9094### Governance is by stake
9195
92−Ultimately, Urbit must be governed by those who own it. In each
96+Ultimately, Urbit must be governed by those who own it. In each
9397tier, equal stakes must hold equal authority.
9498
9599### Content-neutral
96100
97101Urbit does not admit a tradeoff between anarchy and tyranny,
98−order and liberty. Urbit has zero tolerance for abuse, nor does
102+order and liberty. Urbit has zero tolerance for abuse, nor does
99103it facilitate censorship.
100104
101105Urbit will do everything possible to help you block content you
102−don't want to see. It does nothing to help you block content you
106+don't want to see. It does nothing to help you block content you
103107don't want others to see.
104108
105109### Trolling considered harmful
@@ -111,12 +115,12 @@ properly for automatic blocking.
111115### Sockpuppets considered harmful
112116
113117The only legitimate reason for one individual to use multiple
114−identities is to maintain multiple active pseudonyms. But
118+identities is to maintain multiple active pseudonyms. But
115119multiple identities must never interact in the same context.
116120
117121### Not a darknet
118122
119−Urbit is not a darknet. It does not break real-world laws. It
123+Urbit is not a darknet. It does not break real-world laws. It
120124is not designed to facilitate the breaking of real-world laws.
121125For any problem that lawbreakers have, there must always be a
122126better solution that is not Urbit.
@@ -125,6 +129,6 @@ better solution that is not Urbit.
125129
126130As long as they are not facilitating violations of any of these
127131principles, or laws in their own jurisdictions, stars and
128−galaxies are responsible for routing their children. They are
132+galaxies are responsible for routing their children. They are
129133also collectively responsible for escape-routing the children of
130134stars and galaxies which fail in their responsibility.
content/blog/bootstrapping-urbit-from-ethereum.md+28−21
@@ -1,13 +1,20 @@
11+++
22title = "Bootstrapping Urbit from Ethereum"
3−date = 2017-09-20
3+date = "2017-09-19"
44description = "We've decided to launch Urbit's constitution as a system of Ethereum contracts."
5−aliases = ["/posts/essays/bootstrapping-urbit-from-ethereum", "/posts/bootstrapping-urbit-from-ethereum", "/blog/2017.9.20-bootstrapping-urbit-from-ethereum/", "/blog/2017.9-eth/"]
5+aliases = [
6+ "/posts/essays/bootstrapping-urbit-from-ethereum",
7+ "/posts/bootstrapping-urbit-from-ethereum",
8+ "/blog/2017.9.20-bootstrapping-urbit-from-ethereum/",
9+ "/blog/2017.9-eth/"
10+]
11+
612[extra]
713author = "Curtis Yarvin + Galen Wolfe-Pauly"
814ship = "~sorreg-namtyv + ~ravmel-ropdyl"
915+++
10−*TL;DR:*
16+
17+_TL;DR:_
1118
1219We've decided to launch Urbit's constitution as a system of Ethereum contracts.
1320
@@ -19,49 +26,49 @@ auction stars, and stars to distribute planets.
1926## A bit of background
2027
2128One thing we realized after the last sale was, 'oh hey, the network has been up
22−for about a year.' Not bad! It wasn't that long ago that we were rebooting the
23−universe every few weeks. We still have plenty of work to do — but Urbit has
29+for about a year.' Not bad! It wasn't that long ago that we were rebooting the
30+universe every few weeks. We still have plenty of work to do — but Urbit has
2431matured to the point where public ownership of the network really should be
2532cryptographically real.
2633
2734But even when the servers stay up, Urbit is still a testnet and remains
28−centralized in practice. We (Tlon) retain the ability to reset the network keys
29−at any time. This just isn't very 2017.
35+centralized in practice. We (Tlon) retain the ability to reset the network keys
36+at any time. This just isn't very 2017.
3037
3138In theory, Urbit doesn't need a blockchain, because real estate moves slowly.
3239In digital real estate, as opposed to digital currency, a low-friction,
3340zero-trust solution to the double-spend problem isn't an economic necessity.
3441
35−In practice, though, we have a hard chicken-egg problem. In the current design,
42+In practice, though, we have a hard chicken-egg problem. In the current design,
3643the key you use to secure your urbit is the same key that you use to sign your
37−network packets. Abstractly, this is the right design -- you want one
44+network packets. Abstractly, this is the right design -- you want one
3845definition of who owns an identity.
3946
4047But concretely, since Urbit keys are valuable, you don't want to put them in an
41−operating system that isn't generally recognized as systematically secure. It's
42−hard to achieve this status while you're a testnet. So the virtuous cycle never
48+operating system that isn't generally recognized as systematically secure. It's
49+hard to achieve this status while you're a testnet. So the virtuous cycle never
4350gets started.
4451
4552Moving the Urbit land registry to Ethereum is an easy and obvious solution to
46−this problem. If your urbit is owned by an offline Ethereum key, there's now a
47−mature ecosystem for protecting this property. And its security doesn't depend
53+this problem. If your urbit is owned by an offline Ethereum key, there's now a
54+mature ecosystem for protecting this property. And its security doesn't depend
4855on the security of Urbit. So, we realized, maybe Urbit actually does need a
49−blockchain for its land registry. While the system matures, we can bootstrap
56+blockchain for its land registry. While the system matures, we can bootstrap
5057off of Ethereum, without changing the design of the Urbit cryptosystem.
5158
5259And best of all, you can get your Urbit star or planet entirely through the
5360blockchain, without interacting with any centralized database or payment
54−mechanism. So we're really living in 2017.
61+mechanism. So we're really living in 2017.
5562
5663Sounds good, right?
5764
58−It does sound good. Although, as usual, we care about making things that *work*
59−above all else. So, rather than a 'announcing the Urbit token sale' post, this
60−is going to get fairly technical. We want to start the discussion about how
61−this change is going to work, and how it's going to get implemented. We'll save
65+It does sound good. Although, as usual, we care about making things that _work_
66+above all else. So, rather than a 'announcing the Urbit token sale' post, this
67+is going to get fairly technical. We want to start the discussion about how
68+this change is going to work, and how it's going to get implemented. We'll save
6269the hype for later.
6370
64−First, we'll walk through the costs and benefits of using Ethereum. Then,
71+First, we'll walk through the costs and benefits of using Ethereum. Then,
6572we'll refresh our memories on how the Urbit address space works, and finally
6673we'll walk through some of the details of how we plan on implementing this.
6774We've thought quite thoroughly about these things, but public criticism is
@@ -214,7 +221,7 @@ Following Ethereum best practice, we'll use separate storage and logic
214221contracts. The logic contract is stateless, and can upgrade itself without
215222replacing the storage contracts.
216223
217−We'll walk through how we have designed these contracts in detail here. You can
224+We'll walk through how we have designed these contracts in detail here. You can
218225also view our in-progress source at the
219226[`urbit/azimuth` GitHub repo](https://github.com/urbit/azimuth).
220227
content/blog/common-objections-to-urbit.md+207−202
@@ -1,18 +1,23 @@
11+++
22title = "Common Objections to Urbit"
3−date = 2016-06-28
3+date = "2016-06-27"
44description = "Some common objections to Urbit, discussed."
5−aliases = ["/posts/essays/common-objections-to-urbit", "/posts/common-objections-to-urbit", "/posts/objections/"]
5+aliases = [
6+ "/posts/essays/common-objections-to-urbit",
7+ "/posts/common-objections-to-urbit",
8+ "/posts/objections/"
9+]
10+
611[extra]
712author = "Curtis Yarvin"
813ship = "~sorreg-namtyv"
9−image ="https://storage.googleapis.com/media.urbit.org/site/posts/essays/common-objections-to-urbit-1.jpg"
14+image = "https://storage.googleapis.com/media.urbit.org/site/posts/essays/common-objections-to-urbit-1.jpg"
1015+++
1116
1217![](https://storage.googleapis.com/media.urbit.org/site/posts/essays/common-objections-to-urbit-1.jpg)
1318
14−We love crowdsourced criticism. We've heard a lot of great
15−objections to Urbit. Surely there's more out there! We'll
19+We love crowdsourced criticism. We've heard a lot of great
20+objections to Urbit. Surely there's more out there! We'll
1621revise this document to include anything new and interesting.
1722
1823Here's our list right now:
@@ -21,12 +26,12 @@ Here's our list right now:
2126- [Nock jets are a total hoax.](#jets)
2227- [Urbit needs an infinitely extending packet/event log.](#log)
2328- [Urbit is a total scamcoin. It's 100% premined.](#scam)
24−- [Urbit isn't even really decentralized! It has a government!](#gov)
29+- [Urbit isn't even really decentralized! It has a government!](#gov)
2530- [Sandstorm/IPFS/Ethereum is way ahead of Urbit.](#sand)
2631- [Urbit doesn't have enough planets for every human being.](#planet)
2732- [Cloud computing is inherently non-private.](#pwned)
2833- [Urbit will never be able to call any existing code.](#code)
29−- [Hoon is too weird. No one will be able to program in it.](#program)
34+- [Hoon is too weird. No one will be able to program in it.](#program)
3035- [Urbit programmers are stuck with Hoon.](#stuck)
3136- [Ordinary users will never be able to manage an Urbit server.](#user)
3237- [Urbit has no killer app.](#killer)
@@ -37,87 +42,87 @@ _"We choose to go to the moon, not because it is easy, but because it is hard."_
3742
3843## <a name="prime"></a>Urbit is not ready for prime time.
3944
40−*TLDR*: we agree.
45+_TLDR_: we agree.
4146
42−Urbit right now is a fun toy. It is fun to learn Hoon. It is
47+Urbit right now is a fun toy. It is fun to learn Hoon. It is
4348even fun and quite practical to make actual contributions.
4449(Hoon's IEEE floating-point was written by someone we've never
45−met: `~nym`, formerly `~nodpet-rinned`.) In fact, we have never
50+met: `~nym`, formerly `~nodpet-rinned`.) In fact, we have never
4651seen anyone _not_ have fun with Urbit.
4752
48−But there is all kinds of stuff wrong with the codebase. Urbit's
53+But there is all kinds of stuff wrong with the codebase. Urbit's
4954documentation is much improved, but remains incredibly weak --
50−Arvo is almost totally undocumented. Scaling is poor at best.
51−Urbit's reliability is dubious. Its security is nil.
55+Arvo is almost totally undocumented. Scaling is poor at best.
56+Urbit's reliability is dubious. Its security is nil.
5257
53−Urbit is feature-frozen. The only thing we're working on now,
58+Urbit is feature-frozen. The only thing we're working on now,
5459and for the rest of 2016, is doc, debugging and and self-hosting.
5560In that order of importance -- teaching Urbit is more important
5661than fixing it, which is more important than making it useful.
5762But we're quite confident that these are all solvable problems.
5863
5964The most important milestone about Urbit today is that it's ready
60−for technical decisions to be made collectively. A system like
61−Urbit can only be invented by a mad auteur. It can't be
62−maintained or stabilized by a mad auteur. Our primary goal today
65+for technical decisions to be made collectively. A system like
66+Urbit can only be invented by a mad auteur. It can't be
67+maintained or stabilized by a mad auteur. Our primary goal today
6368is expanding the number of people who understand Urbit, and we
6469expect these pioneers to participate in technical governance.
6570
6671## <a name="jets"></a>Nock jets are a total hoax.
6772
68−*TLDR*: all of computing is a hoax. You can't compare a hoax
69−to nothing. You can only compare it to all the other hoaxes.
73+_TLDR_: all of computing is a hoax. You can't compare a hoax
74+to nothing. You can only compare it to all the other hoaxes.
7075
71−A "jet" is a sort of software device driver in Urbit. Urbit is
76+A "jet" is a sort of software device driver in Urbit. Urbit is
7277precisely defined in terms of an interpreter that fits on a
73−T-shirt, Nock. But a naive implementation of Nock is nowhere
78+T-shirt, Nock. But a naive implementation of Nock is nowhere
7479near practical, because Nock has only one integer operation:
75−increment. For example, to decrement a number in Nock, you
80+increment. For example, to decrement a number in Nock, you
7681increment a counter up to the number under it.
7782
7883The only way an efficient Nock interpreter can work is to
7984recognize algorithms like decrement, and implement them
80−non-naively. By far the easiest way to do this is not to analyze
85+non-naively. By far the easiest way to do this is not to analyze
8186arbitrary code as it's being executed, but to register and match
82−well-known implementations in the standard library. No one
87+well-known implementations in the standard library. No one
8388should be writing their own decrement.
8489
8590But the semantics of the interpreter, _so long as the jet and the
8691jet harness are defined correctly_, are exactly those of Nock.
87−We are not extending or changing Nock in any way. We are just
92+We are not extending or changing Nock in any way. We are just
8893taking a shortcut in certain cases we understand perfectly.
8994
9095It's not at all unprecedented to have implementations much more
91−complex than the corresponding specification. The x86
96+complex than the corresponding specification. The x86
9297instruction set is relatively simple; the complexity of its
93−decoding and execution path in a modern CPU is enormous. This
98+decoding and execution path in a modern CPU is enormous. This
9499path may well have "peephole optimizations" that replace matched
95−algorithms, and if it doesn't the modern compiler does. People,
100+algorithms, and if it doesn't the modern compiler does. People,
96101_bad_ people, use "jets" to cheat on benchmarks all the time.
97102
98−Nock is designed as a standard. It's built like a standard.
103+Nock is designed as a standard. It's built like a standard.
99104Typically what causes real problems in standards is ambiguity.
100105Two implementations are incompatible, but each swears it has the
101−right interpretation of the natural-language spec. This simply
102−cannot happen in the Nock world. If two implementations
103−disagree, at least one of them is incorrect. This puts us firmly
106+right interpretation of the natural-language spec. This simply
107+cannot happen in the Nock world. If two implementations
108+disagree, at least one of them is incorrect. This puts us firmly
104109in "with enough eyeballs, all bugs are shallow" territory.
105110
106111The fact remains, however, that a Nock interpreter without jets
107−is completely useless. And there is not even an informal
112+is completely useless. And there is not even an informal
108113document that tells you what jets you need for a reasonably
109−efficient Urbit. (There should be such a document.)
114+efficient Urbit. (There should be such a document.)
110115
111116The correct way to think about jets is not to compare them to a
112−perfect interpreter created by unicorns. Jets are a combined
117+perfect interpreter created by unicorns. Jets are a combined
113118replacement for two other techniques in language implementation:
114119intrinsics and a foreign-function interface.
115120
116121Compared to both intrinsics and an FFI, your jets have one key
117−disadvantage: they need to be specified in pure code. You may
122+disadvantage: they need to be specified in pure code. You may
118123not have this executable specification, which means you need to
119−write it. Is this really so bad for your development process?
120−An executable specification? Which can be trivially tested
124+write it. Is this really so bad for your development process?
125+An executable specification? Which can be trivially tested
121126against the efficient implementation?
122127
123128Compared to intrinsics, jets give you true separation between
@@ -125,7 +130,7 @@ mechanism and policy; only the interpreter, not the programmer
125130and not the compiler, needs to know what's accelerated.
126131
127132Compared to an FFI, jets preclude I/O, so can be trivially
128−sandboxed. Except that the programmer needs to mark routines
133+sandboxed. Except that the programmer needs to mark routines
129134which may benefit from optimization with a hint, here too we
130135separate mechanism (efficient implementation) from policy.
131136
@@ -133,41 +138,41 @@ Yes, formal verification of jet equivalence is desirable.
133138However, in the real world, many specifications, including quite
134139complex ones, are tested into equivalence by brute force.
135140
136−Urbit has some jet abuses. The equivalence between our markdown
137−parser in Hoon and the CommonMark C library is super dubious. It
141+Urbit has some jet abuses. The equivalence between our markdown
142+parser in Hoon and the CommonMark C library is super dubious. It
138143should be revisited.
139144
140145But the miscomputation resulting from a minor jet discrepancy is
141−not a security hole or even fatal. It effectively means the
146+not a security hole or even fatal. It effectively means the
142147event history, computed correctly, does not match the current
143−state. The way to resolve this conflict is for the current state
148+state. The way to resolve this conflict is for the current state
144149to win, and the event history to be discarded -- not abnormal
145−anyway. See the next question.
150+anyway. See the next question.
146151
147152## <a name="log"></a>Urbit needs an infinitely extending packet/event.
148153
149−*TLDR*: no, it doesn't. Urbit can prune the log.
154+_TLDR_: no, it doesn't. Urbit can prune the log.
150155
151156We can prune the event log because the Urbit transition function
152157doesn't have any access to the event history -- just the current
153158state and the current event.
154159
155−Urbit defines the semantics of a complete event log. It doesn't
160+Urbit defines the semantics of a complete event log. It doesn't
156161and can't require an implementation to maintain the whole log.
157162It can maintain a checkpoint and the log since that checkpoint.
158163
159164However, any practical urbit maintains a periodically updated
160−checkpoint. Our present implementation doesn't provide a way to
161−prune the event log. But that's just a missing feature. We have
165+checkpoint. Our present implementation doesn't provide a way to
166+prune the event log. But that's just a missing feature. We have
162167one or two of those!
163168
164−## <a name="scam"></a>Urbit is a total scamcoin. It's 100% premined.
169+## <a name="scam"></a>Urbit is a total scamcoin. It's 100% premined.
165170
166−*TLDR*: yeah. But at least it's not the DAO.
171+_TLDR_: yeah. But at least it's not the DAO.
167172
168−Like a cryptocurrency, Urbit is a digital title. But Urbit is
169−digital land, not digital money. If you assess it as a currency,
170−it's a lousy currency. If you assess a cat as a dog, it's a
173+Like a cryptocurrency, Urbit is a digital title. But Urbit is
174+digital land, not digital money. If you assess it as a currency,
175+it's a lousy currency. If you assess a cat as a dog, it's a
171176lousy dog.
172177
173178In real-world economics, the crucial distinction between land and
@@ -175,25 +180,25 @@ money is that land (a) has intrinsic utility and (b) is
175180non-fungible.
176181
177182Because of (b) alone, frictionless transactions in land are
178−impossible. A blockchain is only needed to ensure zero-cost
179−high-frequency transactions. So digital land doesn't need a
180−blockchain. Which means it doesn't need mining.
183+impossible. A blockchain is only needed to ensure zero-cost
184+high-frequency transactions. So digital land doesn't need a
185+blockchain. Which means it doesn't need mining.
181186
182187Of course, just because a digital title system doesn't need
183188mining, doesn't mean it can't distribute an initial allocation by
184189proof-of-work -- or by any other arbitrary method which is
185−careful not to benefit the system's own developers. Could we
186−give away the Urbit address space randomly? Sure. But why?
190+careful not to benefit the system's own developers. Could we
191+give away the Urbit address space randomly? Sure. But why?
187192
188193Probably the purest design is the "proof-of-burn" initial
189−allocation used by some coins. By any standard, proof-of-burn is
194+allocation used by some coins. By any standard, proof-of-burn is
190195technically beautiful and results in an extraordinary level of
191−ethical independence. We can't help but admire it.
196+ethical independence. We can't help but admire it.
192197
193−But any altcoin or metacoin is just way less work than Urbit. An
198+But any altcoin or metacoin is just way less work than Urbit. An
194199altcoin can afford to burn even its creation energy, capturing no
195−value at all from its seigniorage. Your altcoin doesn't have a
196−clean-slate system software stack to drive. If your rocket has
200+value at all from its seigniorage. Your altcoin doesn't have a
201+clean-slate system software stack to drive. If your rocket has
197202to go to the moon, it's going to leave a little bit of smoke in
198203the air.
199204
@@ -202,78 +207,78 @@ of the currency are rewarded disproportionately for their effort.
202207The scamcoin is a get-rich-quick scheme, vaguely pyramid-shaped.
203208Nothing about Urbit matches this pattern at all.
204209
205−Curtis invented Urbit. So by the [homestead
210+Curtis invented Urbit. So by the [homestead
206211principle](https://en.wikipedia.org/wiki/Homestead_principle), he
207−started out owning all of it. But by now, Urbit's 8-bit galaxies
212+started out owning all of it. But by now, Urbit's 8-bit galaxies
208213have already been distributed among [57 separate individuals](https://github.com/urbit/arvo/blob/master/sys/vane/ames.hoon#L118-L373).
209214Curtis owns 20, or about 8%.
210215
211216Tlon, the corporation which still runs Urbit development, has 95.
212−(Without Tlon, there is basically no Arvo.) 50 are reserved for
213−a hypothetical Urbit Foundation. Tlon employees have another 16.
217+(Without Tlon, there is basically no Arvo.) 50 are reserved for
218+a hypothetical Urbit Foundation. Tlon employees have another 16.
214219
215220The rest of the galaxies belong to donors, investors,
216221contributors, contest winners, and just random people who were in
217−the right place at the right time. One is a Silicon Valley
218−tycoon. Another is an Orthodox nun in a monastery in Greece. A
219−couple are ex-Tlon employees who might totally hate us. There is
222+the right place at the right time. One is a Silicon Valley
223+tycoon. Another is an Orthodox nun in a monastery in Greece. A
224+couple are ex-Tlon employees who might totally hate us. There is
220225nothing they all have in common, which is sort of the point.
221226
222227This property distribution looks a lot like land ownership in the
223−real world -- complex and asymmetrical. That's no accident. If
228+real world -- complex and asymmetrical. That's no accident. If
224229you have a problem living in New York because New York's real
225230estate is not distributed equally among its residents, you may
226−have a similar problem with Urbit. The reality is that Urbit,
231+have a similar problem with Urbit. The reality is that Urbit,
227232like New York, wasn't born yesterday and comes with a complex
228233ownership history which we couldn't possibly change, even if we
229234wanted to.
230235
231−Decentralization is hard. The only real goal of a property
236+Decentralization is hard. The only real goal of a property
232237system in address space is to create and maintain
233−decentralization. The whole network has to exhibit centrifugal
234−force, not centripetal force. Proof-of-work systems certainly
238+decentralization. The whole network has to exhibit centrifugal
239+force, not centripetal force. Proof-of-work systems certainly
235240seem to have unexpected centripetal qualities, producing
236−unanticipated concentrations of centralized hashpower. See the
241+unanticipated concentrations of centralized hashpower. See the
237242next objection.
238243
239−## <a name="gov"></a>Urbit isn't even really decentralized! It has a government!
244+## <a name="gov"></a>Urbit isn't even really decentralized! It has a government!
240245
241−*TLDR*: it's technically impossible for Urbit to be
242−decentralized at this stage of its life. Urbit is designed to
246+_TLDR_: it's technically impossible for Urbit to be
247+decentralized at this stage of its life. Urbit is designed to
243248achieve decentralization, not be born with it.
244249
245−A young network can't afford to be decentralized. It has to act
246−as a unit. Because it has no network effect, it needs every
250+A young network can't afford to be decentralized. It has to act
251+as a unit. Because it has no network effect, it needs every
247252scrap of efficiency it can get.
248253
249254A decentralized general-purpose computing network like Urbit can
250−_only_ be bootstrapped by a central government. For example, by
255+_only_ be bootstrapped by a central government. For example, by
251256default your urbit upgrades its OS automatically (like an
252−"evergreen" browser) with signed network updates. Whoever signs
257+"evergreen" browser) with signed network updates. Whoever signs
253258these updates is a government by definition.
254259
255260When it's impossible to eliminate centralized power, it becomes
256−necessary to tame, stabilize, and limit it. This should not be
261+necessary to tame, stabilize, and limit it. This should not be
257262surprising to anyone living under a constitutional government.
258263
259264As we found out with the DAO, if a network isn't ready to be
260−decentralized, its developers shouldn't even try. If Ethereum is
265+decentralized, its developers shouldn't even try. If Ethereum is
261266hard-forked to roll back the DAO (which looks like the most
262267probable result), it acknowledges that it both has a central
263−government, and needs a central government. Decentralization is
264−good. Pretend decentralization -- "decentralization theater" --
268+government, and needs a central government. Decentralization is
269+good. Pretend decentralization -- "decentralization theater" --
265270is harmful, and not a effective path to actual decentralization.
266271
267272A key test of a free software project's health is whether it can
268−fork. So long as the unity of the public-key hierarchy and the
273+fork. So long as the unity of the public-key hierarchy and the
269274network protocol is maintained, the Arvo kernel and Urbit system
270275can fork in all kinds of ways without disrupting the network.
271276Any stress will fragment the "government" that develops the
272277kernel, and as it fragments it grows more limited and stable.
273278
274279Urbit is designed to govern itself collectively by address space
275−ownership -- effectively, "proof of stake." Any arbitrary power,
276−will tend to fracture along these property lines. For instance,
280+ownership -- effectively, "proof of stake." Any arbitrary power,
281+will tend to fracture along these property lines. For instance,
277282our hot updates are sent through the galaxy hierarchy; in a
278283development fork, active galaxies would pick upstream sources.
279284Two implementations of a standard are better than one.
@@ -283,8 +288,8 @@ we've created a global property map which is much more likely to
283288splinter further, than reunite.
284289
285290In the long run, every galaxy should have a separate owner, who
286−is a human being rather than a corporation. Combining galaxy
287−holdings will damage the reputation of both galaxies. The only
291+is a human being rather than a corporation. Combining galaxy
292+holdings will damage the reputation of both galaxies. The only
288293reason to merge ownership is to move toward incipient monopoly.
289294Whether a galaxy admits this openly or denies it dishonestly, its
290295reputation will suffer.
@@ -292,61 +297,61 @@ reputation will suffer.
292297The technical goal of Urbit is to create a network which, _if it
293298actually takes over the world_, inevitably becomes decentralized.
294299Even if Urbit takes over the world, no individual or coherent
295−organization takes over the world. There is nothing even close
300+organization takes over the world. There is nothing even close
296301to a single point of failure in a mature, successful Urbit.
297302
298−This is the goal of all the new "web3" decentralized systems. If
303+This is the goal of all the new "web3" decentralized systems. If
299304IPFS, Sandstorm or Ethereum takes over the world, nobody takes
300−over the world. (The same is almost true of the Internet --
305+over the world. (The same is almost true of the Internet --
301306though it wouldn't be that surprising if a time traveler from
3023072116 revealed that ICANN had become a planetary government.)
303308
304309Urbit, by starting out as a centralized network, just reduces the
305−technical problem to match the actual goal. Only long-term
310+technical problem to match the actual goal. Only long-term
306311decentralization matters.
307312
308313It's very important that Urbit in 2116 be fully decentralized.
309314For Urbit in 2016, pretending to be decentralized would be a joke
310−at best, and a hoax at worst. And of course, no one can DAO us
315+at best, and a hoax at worst. And of course, no one can DAO us
311316-- since the property system is still just a central registry.
312−Among other things, we check it into GitHub. GitHub is not a
317+Among other things, we check it into GitHub. GitHub is not a
313318blockchain -- but still, good luck with that.
314319
315320## <a name="sand"></a>Sandstorm/IPFS/Ethereum is way ahead of Urbit.
316321
317322In general, web3 (next distributed web) solutions don't compete
318−with each other. They support each other. Concretely, they are
323+with each other. They support each other. Concretely, they are
319324all part of each others' network effect.
320325
321326IPFS, Sandstorm, Ethereum, and Urbit can all take over the world
322−at the same time. None of them competes with the others. They
327+at the same time. None of them competes with the others. They
323328enable each other.
324329
325330For instance, IPFS and Urbit are both global immutable
326−namespaces. IPFS is a chord-routed, content-addressed namespace.
327−Urbit is a direct-routed, identity-addressed namespace. Urbit is
328−a typed revision-control system; IPFS is a blob store. IPFS
331+namespaces. IPFS is a chord-routed, content-addressed namespace.
332+Urbit is a direct-routed, identity-addressed namespace. Urbit is
333+a typed revision-control system; IPFS is a blob store. IPFS
329334isn't a computer; the work hasn't been done, but Urbit can easily
330335mount the IPFS namespace and compute functionally against it.
331336
332337So the better IPFS does, the less Urbit needs to struggle against
333−its lack of network effect. The better Urbit does, the easier it
338+its lack of network effect. The better Urbit does, the easier it
334339is for IPFS to point to a functional language that can actually
335−use its referential transparency directly. So their relationship
340+use its referential transparency directly. So their relationship
336341is symbiotic, not competitive at all.
337342
338343The closest thing to a general-purpose competitor that Urbit has
339−is Sandstorm. Sandstorm, which by the way rocks, is also a
344+is Sandstorm. Sandstorm, which by the way rocks, is also a
340345personal server built around a network protocol.
341346
342347But Sandstorm and Urbit compete in the way that, on the PC, the
343−OS and the browser compete. In theory, the OS could solve the
348+OS and the browser compete. In theory, the OS could solve the
344349problems that the browser solves; or the browser could be the OS.
345350In practice, Windows is a great OS to run a browser on.
346351
347352Similarly, a world in which Sandstorm takes off is an awesome
348353world for Urbit, because everyone who has a Sandstorm instance
349−has a great platform for running Urbit on. Urbit on Sandstorm
354+has a great platform for running Urbit on. Urbit on Sandstorm
350355will be a sort of "double-hulled" personal server, safer and more
351356friendly than either system alone.
352357
@@ -354,24 +359,24 @@ Sandstorm and Urbit have very different approaches to network
354359identification; Sandstorm uses capabilities, Urbit identity.
355360Broadly speaking, we believe, capabilities are optimal for
356361expressive power; but identity is optimal for the UI of the
357−common case. We'd need to see the Powerbox, Sandstorm's UI, more
362+common case. We'd need to see the Powerbox, Sandstorm's UI, more
358363fully fleshed out to understand its UI approach better.
359364
360365## <a name="planet"></a>Urbit doesn't have enough planets for every human
361366
362−A 32-bit planet is a tool, not a toy. Like a car, it's a device
363−for a responsible and independent adult. There aren't 4 billion
367+A 32-bit planet is a tool, not a toy. Like a car, it's a device
368+for a responsible and independent adult. There aren't 4 billion
364369cars in the world, nor 4 billion independent adults.
365370
366371If you aren't an independent adult, and you don't need or even
367372shouldn't have unconditional digital freedom (no one's 8-year-old
368373daughter needs unconditional digital freedom), a moon from
369−someone else's planet is fine. (Even most of today's independent
374+someone else's planet is fine. (Even most of today's independent
370375adults don't complain enough about being Facebook's moons.)
371376
372377And limiting the supply of anything doesn't create a shortage.
373−It sets a price. Ideally, in the long run, we think a planet
374−should cost about $10. This could be off by an order of
378+It sets a price. Ideally, in the long run, we think a planet
379+should cost about $10. This could be off by an order of
375380magnitude either way, and it wouldn't be the end of the world.
376381
377382If a planet costs $10, that means you paid $10 to get a planet.
@@ -385,49 +390,49 @@ Urbit will always choose free speech.
385390
386391## <a name="pwned"></a>Cloud computing is inherently non-private.
387392
388−*TLDR*: a general-purpose cloud computer is much, much more
389−private than a special-purpose cloud computer. In general, a
393+_TLDR_: a general-purpose cloud computer is much, much more
394+private than a special-purpose cloud computer. In general, a
390395cloud VM is secure against corporations but not governments.
391396With a global adversary, compute in your closet -- or even on
392397your body.
393398
394399One reason we want the decentralized Internet is that we're tired
395−of giant corporations spying on us. Think about it this way:
396−Amazon is Netflix's main competitor. And yet, Netflix runs its
397−whole operation on AWS. Why is Netflix sure that Amazon won't
400+of giant corporations spying on us. Think about it this way:
401+Amazon is Netflix's main competitor. And yet, Netflix runs its
402+whole operation on AWS. Why is Netflix sure that Amazon won't
398403spy on it?
399404
400405A general-purpose virtual machine is special from a privacy
401406standpoint, just because it's commercially realistic to design
402407terms of service that prevent the host from peeking and poking at
403−the customer's machine. Crossing this moat is technically
408+the customer's machine. Crossing this moat is technically
404409nontrivial and can't possibly happen by any reasonable accident.
405410No hosting contract could contemplate it.
406411
407412Whereas when your cloud computer is a special-purpose machine --
408413just a database row on some corporation's mainframe -- there is
409414no way these services can promise not to handle your data.
410−Handling your data is _what they do_. On a special-purpose
415+Handling your data is _what they do_. On a special-purpose
411416server, the concept of privacy is not even defined.
412417
413418Where even a general-purpose server falls down is where the user
414419has a sovereign adversary, which can secretly violate explicit or
415−implicit hosting contracts. Users with a sovereign adversary
420+implicit hosting contracts. Users with a sovereign adversary
416421must rely only on their own physical security.
417422
418−However, most users don't have a sovereign adversary. And those
423+However, most users don't have a sovereign adversary. And those
419424who do maximize their "herd immunity" if they can use the same
420−protocols as those who don't. Otherwise, the adversary could
425+protocols as those who don't. Otherwise, the adversary could
421426simply focus on everyone who uses the secure protocols.
422427
423−Also, the portability of a cloud server image is critical. Of
428+Also, the portability of a cloud server image is critical. Of
424429course, since Urbit is formally specified, it's trivially
425−portable. In fact, one strategy against sovereign adversaries
430+portable. In fact, one strategy against sovereign adversaries
426431may be continuous rotation between hosts, like an MX missile.
427432
428433## <a name="code"></a>Urbit will never be able to call any existing code.
429434
430−*TLDR*: neither will Javascript. And dear Unix, the browser
435+_TLDR_: neither will Javascript. And dear Unix, the browser
431436does not miss interacting with your `$LD_LIBRARY_PATH` at all.
432437
433438You can't talk to the OS or use system libraries from Javascript.
@@ -436,31 +441,31 @@ compatibility bridge, native methods, or other interface between
436441Javascript and C.
437442
438443When in doubt, remember that Urbit is "the browser for the server
439−side." It plays by the same general rules. Isolation means
444+side." It plays by the same general rules. Isolation means
440445isolation.
441446
442−## <a name="weird"></a>There's no way Urbit will ever be adopted. It's too weird.
447+## <a name="weird"></a>There's no way Urbit will ever be adopted. It's too weird.
443448
444−*TLDR*: Urbit adoption is designed to be driven by ordinary end
445−users. Urbit isn't ready for ordinary end users yet. We're
449+_TLDR_: Urbit adoption is designed to be driven by ordinary end
450+users. Urbit isn't ready for ordinary end users yet. We're
446451working on it -- come help.
447452
448−Right now, Urbit is a developer tool. Or rather, a developer toy
449−-- since the only thing it's useful for is developing Urbit. It
450−also could be a much better toy. We're working on that too.
453+Right now, Urbit is a developer tool. Or rather, a developer toy
454+-- since the only thing it's useful for is developing Urbit. It
455+also could be a much better toy. We're working on that too.
451456
452457But it's absolutely wrong to think of Urbit being adopted as a
453−developer tool in the conventional sense. If you think this is
458+developer tool in the conventional sense. If you think this is
454459almost impossible, you're right.
455460
456461If we look at the way most successful platforms are adopted,
457−they're not adopted for their own virtues. They're adopted
458−because they're part of a larger solution. It's very hard to
459−displace a native component of an existing platform. Urbit is
462+they're not adopted for their own virtues. They're adopted
463+because they're part of a larger solution. It's very hard to
464+displace a native component of an existing platform. Urbit is
460465not trying to do this.
461466
462467C is a better language than Pascal, but it didn't beat Pascal
463−because it's a better language. C beat Pascal because C was the
468+because it's a better language. C beat Pascal because C was the
464469native language of Unix, and people wanted to program in Unix.
465470People don't use Javascript because Javascript is a great
466471language, but because it's the native language of the browser.
@@ -468,9 +473,9 @@ Replacing the native language of a platform may be doable -- but
468473it's incredibly hard.
469474
470475Hoon is not competing with C, or even Haskell, as a Unix
471−programming language. The only reason to program in Hoon is that
472−it's the native language of Urbit. Urbit is not competing with
473−node.js or Rails as a Web backend. The only reason to run Urbit
476+programming language. The only reason to program in Hoon is that
477+it's the native language of Urbit. Urbit is not competing with
478+node.js or Rails as a Web backend. The only reason to run Urbit
474479is to run a personal server.
475480
476481Nock is cool, but it only gets adopted if Hoon gets adopted.
@@ -479,9 +484,9 @@ Urbit only gets adopted if it's useful as a personal server for
479484human beings -- most of whom won't be Hoon programmers, or
480485programmers at all.
481486
482−## <a name="program"></a>Hoon is too weird. No one will be able to program in it.
487+## <a name="program"></a>Hoon is too weird. No one will be able to program in it.
483488
484−*TLDR*: Hoon is ridiculously simple. Our documentation and
489+_TLDR_: Hoon is ridiculously simple. Our documentation and
485490tooling are just immature.
486491
487492It's pretty fair to assume that (a) functional programming is
@@ -491,94 +496,94 @@ so (c) Hoon must be hard-squared.
491496Actually, Hoon is weird even for a functional language because
492497it's an attempt to remove the hardest things about functional
493498programming: category theory, lazy evaluation, and gratuitous
494−abstraction. To know a language is to know what the compiler is
499+abstraction. To know a language is to know what the compiler is
495500doing; all the semantics of the Hoon compiler fit in 2000 lines
496501of code.
497502
498503It's too easy for us to wind up living in Isaac Asimov's Trantor,
499504a world in which everything got invented thousands of years ago
500−and the idea of new technology is just weird and scary. History
505+and the idea of new technology is just weird and scary. History
501506isn't over yet, and nor is technical history.
502507
503−New things are harder to learn than old things. We ask smart
504−high-school students to learn calculus. Think about how much
508+New things are harder to learn than old things. We ask smart
509+high-school students to learn calculus. Think about how much
505510harder it was for Newton and Leibniz to invent calculus, or for
506−their first students to pick it up. Hoon is nowhere near as hard
511+their first students to pick it up. Hoon is nowhere near as hard
507512as calculus.
508513
509514Most of the difference is just the collective certainty that our
510515society conveys to a high-school student that calculus is
511−learnable. When you're learning Urbit, you don't have this
516+learnable. When you're learning Urbit, you don't have this
512517collective knowledge; so you don't have the confidence that the
513−problem is solvable. Confidence makes a huge difference.
518+problem is solvable. Confidence makes a huge difference.
514519Moreover, any bug or glitch in the developer experience destroys
515520this confidence and takes a long time to heal.
516521
517−Yes, we know: Hoon remains quite hard to learn. Again, we have
518−no reason to think this problem isn't solvable. Public
522+Yes, we know: Hoon remains quite hard to learn. Again, we have
523+no reason to think this problem isn't solvable. Public
519524enlightenment remains our main priority.
520525
521526## <a name="stuck"></a>Urbit programmers are stuck with Hoon.
522527
523−*TLDR*: patience, grasshopper.
528+_TLDR_: patience, grasshopper.
524529
525530There's quite a straightforward way to implement any perfectly
526−specified language with a reliable interpreter in Hoon. First,
527−write an interpreter for that language in Hoon. Second, jet that intepreter function with the existing implementation.
531+specified language with a reliable interpreter in Hoon. First,
532+write an interpreter for that language in Hoon. Second, jet that intepreter function with the existing implementation.
528533
529534It is not clear that Javascript is _quite_ well-defined enough
530−for this treatment. But Lua probably is.
535+for this treatment. But Lua probably is.
531536
532537## <a name="user"></a>Ordinary users will never be able to manage an Urbit server.
533538
534−*TLDR*: Urbit's technical simplicity has always been designed
535−to drive human usability. But the polish is the last thing that
536−goes on. So we can't evaluate this claim right now.
539+_TLDR_: Urbit's technical simplicity has always been designed
540+to drive human usability. But the polish is the last thing that
541+goes on. So we can't evaluate this claim right now.
537542
538−Right now, Urbit is only for geeks. You already need to be able
539−to wrangle a Unix machine to run it. What's the point?
543+Right now, Urbit is only for geeks. You already need to be able
544+to wrangle a Unix machine to run it. What's the point?
540545
541−This Urbit isn't the real Urbit. It's an early milestone on the
546+This Urbit isn't the real Urbit. It's an early milestone on the
542547way to the real Urbit.
543548
544549The real Urbit -- for normal human beings -- is a hosted service.
545−Getting a planet is as easy as signing up for Facebook. Probably
546−many users will think of it as another web account. They might
550+Getting a planet is as easy as signing up for Facebook. Probably
551+many users will think of it as another web account. They might
547552not even know it can run more apps than the ones they use.
548553
549554A deterministic, persistent cloud computer is something different
550−from a traditional server. Normally when we think of a server in
555+from a traditional server. Normally when we think of a server in
551556the cloud, we think of it like a live animal -- a creature that
552−needs to be cared for, fed, and herded. A file in the cloud is
557+needs to be cared for, fed, and herded. A file in the cloud is
553558more like a rock -- you can forget about it for ten years.
554559
555560An urbit is a general-purpose computer, but it doesn't even have
556−the concept of a reboot. It upgrades itself. If you don't feed
561+the concept of a reboot. It upgrades itself. If you don't feed
557562it any packets for ten years, then turn it back on, it will spend
558−a day or two upgrading itself, then be back to normal. Maybe
563+a day or two upgrading itself, then be back to normal. Maybe
559564it's something in between a rock and an animal -- a cactus?
560565
561566Another huge difference versus an Internet server is that we're
562567confident that Urbit's limited supply of identities will make it
563−easy to keep abusers off the network. So far, so good -- but of
568+easy to keep abusers off the network. So far, so good -- but of
564569course, no one abuses a young network.
565570
566571The bottom line is that managing your urbit has to be as easy as
567−managing your iPhone. Normally, it consists of deciding what
572+managing your iPhone. Normally, it consists of deciding what
568573apps you want to be running, and how much you trust them.
569574Resources can't be free, so sometimes you have to play memory
570−police. Humans have shown that they can handle these tasks.
575+police. Humans have shown that they can handle these tasks.
571576
572577Our '70s OSes and networks, which were great designs in their day
573578and have matured into excellent industrial tools, give us a
574579totally misleading impression of how hard it should be to manage
575−a general-purpose computer. Computing isn't scary or dangerous.
576−Unix and the Internet are scary and dangerous. That's fine for
580+a general-purpose computer. Computing isn't scary or dangerous.
581+Unix and the Internet are scary and dangerous. That's fine for
577582an industrial tool, but not a personal tool.
578583
579584## <a name="killer"></a>Urbit has no killer app.
580585
581−*TLDR*: the killer app is personal API aggregation.
586+_TLDR_: the killer app is personal API aggregation.
582587
583588It's a truism that any new platform has to be fundamentally much
584589better at solving some problem than the mature platform it seeks
@@ -591,7 +596,7 @@ From the developer's perspective, Urbit's advantage is that it's
591596a network stack which provides exactly-once delivery of typed,
592597validated, transactional, encrypted and authenticated messages.
593598The difference between an Urbit API and a REST API is like the
594−difference between a paved road and a dirt road. On the other
599+difference between a paved road and a dirt road. On the other
595600hand, you do need to learn a new functional language.
596601
597602From the user's perspective, there's one task that any personal
@@ -600,14 +605,14 @@ unrestricted API aggregation.
600605
601606Well before Urbit is ready to _replace_ any conventional web
602607services, it should be ready to _command_ them in place by API.
603−(Or if needed, by scraping.) If all you care about is being in
608+(Or if needed, by scraping.) If all you care about is being in
604609control of your own data, it's fine to leave it in the hands of
605610these services, as you have the API secrets to get it out.
606611
607612Managing a set of security connections to your existing services
608613is one of the first important tasks of a modern personal server.
609614This is a stateful task that typically requires both a durable
610−API key and a temporary OAuth token. APIs change all the time,
615+API key and a temporary OAuth token. APIs change all the time,
611616so connection maintenance also requires evergreen updates.
612617
613618The origin of this API key will vary, but usually the best way to
@@ -619,7 +624,7 @@ do with your own data.
619624
620625Terms of service which constrain the use of data (as opposed to
621626the abuse of the service) simply aren't realistic and will no
622−longer apply. This enables a variety of novel user experiences
627+longer apply. This enables a variety of novel user experiences
623628which aren't implementable as traditional web services, and also
624629aren't available via conventional third-party API aggregators.
625630
@@ -627,16 +632,16 @@ Also, since Urbit is after all quite immature, it doesn't make
627632much sense to restrict this security state to code within Urbit.
628633The Urbit interpreter `vere` runs as a Unix daemon that
629634implements the FUSE user-level filesystem protocol, and maps the
630−data on your services into the Unix filesystem. For example, one
635+data on your services into the Unix filesystem. For example, one
631636of our demos lets you `ls` your GitHub issues.
632637
633638So it's straightforward to build, for instance, a Python app that
634−uses Urbit as a gateway to mash up a bunch of web services. As a
639+uses Urbit as a gateway to mash up a bunch of web services. As a
635640Unix programmer, you might even just regard Urbit as a generic
636641Web API gateway daemon, without worrying about its internals.
637642
638−We have other ideas for initial killer apps. But this, we feel,
639−is the best one. API libraries for `npm` et al abound.
643+We have other ideas for initial killer apps. But this, we feel,
644+is the best one. API libraries for `npm` et al abound.
640645Stateful, self-updating, generic API aggregators with FUSE
641646integration, also integrated with a reactive web server, are
642647rarer.
@@ -645,23 +650,23 @@ rarer.
645650
646651It's difficult to categorize [this awesome
647652essay](http://ngnghm.github.io/blog/2016/06/11/chapter-10-houyhnhnms-vs-martians/)
648−in a single bullet point. So I've saved it for last.
653+in a single bullet point. So I've saved it for last.
649654
650655When reading this essay, it's important not to forget the amazing
651656absence of genuine, mutually critical discourse in computer
652−science (as in most sciences today). You never hear what Swift's
653−designers think of Go, or vice versa. And critical public
657+science (as in most sciences today). You never hear what Swift's
658+designers think of Go, or vice versa. And critical public
654659discourse decreases, not increases, with increasing academic
655660legitimacy.
656661
657662The basic test of any field purportedly scientific in nature is
658663whether its researchers are genuinely interested in each others'
659−work, and willing to share these genuine responses publicly. If
664+work, and willing to share these genuine responses publicly. If
660665this practice does not exist, the field may still be useful
661−and/or interesting. But it is not science.
666+and/or interesting. But it is not science.
662667
663668What's awesome about Fare's essay is that he's _doing it right_.
664−All the actual details are irrelevant. And mostly wrong. But
669+All the actual details are irrelevant. And mostly wrong. But
665670that's of very little importance compared to _doing it right_.
666671
667672Anyway, we've already addressed the idea that jets are a sham.
@@ -670,11 +675,11 @@ Some other points:
670675### Event-sourcing and/or caching is a pattern, not a layer
671676
672677Fare' is perfectly right that "one size does not fit all" in
673−persistence. Generally, Urbit uses event-sourced persistence.
678+persistence. Generally, Urbit uses event-sourced persistence.
674679
675680But it has multiple layers of event-sourcing: in the definition
676681of Urbit itself; in the application sandbox vane (Gall), and in
677−the application itself. Urbit also has a completely orthogonal
682+the application itself. Urbit also has a completely orthogonal
678683revision control system (Clay).
679684
680685And there is not a single cache across the whole system, though
@@ -688,33 +693,33 @@ or feature, and equally fatal whichever direction you fail.
688693### Let's be clear about why DSLs suck
689694
690695DSLs suck not because they are difficult to newbies in the base
691−language. DSLs suck because every time a programmer, even one
696+language. DSLs suck because every time a programmer, even one
692697_experienced_ in the base language, comes into a new codebase or
693698project, she has to learn a new custom language.
694699
695−You need enormous wins to justify this cost. It's the goal of
700+You need enormous wins to justify this cost. It's the goal of
696701the base language designer to preempt these wins, creating a
697702language which is almost never so tiresome and full of
698703boilerplate that it requires a DSL or template layer.
699704
700705Hoon is almost entirely made of macros -- but they are internal,
701−fixed, built-in macros (with no gensyms). This fixed set of
702−macros is essentially enough. Occasionally we want to add one or
703−two. But we never, ever pine for context-dependent macros.
706+fixed, built-in macros (with no gensyms). This fixed set of
707+macros is essentially enough. Occasionally we want to add one or
708+two. But we never, ever pine for context-dependent macros.
704709
705710### Determinism is not consensus, and is not constraining
706711
707712Fare' is totally right that an urbit's data is meant for itself
708−alone. In fact, an urbit has the right to compute incorrectly if
709−it wants. We go to considerable lengths to ensure that you can't
713+alone. In fact, an urbit has the right to compute incorrectly if
714+it wants. We go to considerable lengths to ensure that you can't
710715gain any particular advantage by incorrect computing.
711716
712717The whole point of Nock is that it's so low-level that there is
713−no conceivable advantage in upgrading it. Divergence is just
714−pointless. This is not a question of network integrity, just of
718+no conceivable advantage in upgrading it. Divergence is just
719+pointless. This is not a question of network integrity, just of
715720practical standardization.
716721
717−This consistency stops at Nock. Without anyone violating the
722+This consistency stops at Nock. Without anyone violating the
718723correctness of their lifecycle functions, anyone or everyone in
719−Urbit could replace Hoon with Javascript. Determinism does not
724+Urbit could replace Hoon with Javascript. Determinism does not
720725cramp Urbit's semantic style in any way, shape or form.
content/blog/community-spotlight-the-portico.md+2−1
@@ -1,7 +1,8 @@
11+++
22title = "Community Spotlight: The Portico"
3−date = 2021-05-04
3+date = "2021-05-03"
44description = "Interview with The Portico founder Josh Reagan"
5+
56[extra]
67author = "Matt"
78ship = "~tirwyd-sarmes"
content/blog/creating-sigils.md+9−7
@@ -1,14 +1,16 @@
11+++
22title = "Creating Sigils"
3−date = 2020-02-04
3+date = "2020-02-03"
44description = "The origin and design process informing Urbit's generative user avatar system, Sigils."
5+
56[extra]
67author = "Gavin Atkinson"
78ship = "~ridlur-figbud"
8−image ="https://media.urbit.org/site/posts/essays/sigils3.png"
9+image = "https://media.urbit.org/site/posts/essays/sigils3.png"
910+++
1011
1112<!-- ![](https://media.urbit.org/site/blog-9.jpg) -->
13+
1214![](https://media.urbit.org/site/posts/essays/sigils0-v3.png)
1315
1416One of the basic building blocks of Urbit is Urbit ID, our naming and identity system. Your Urbit ID is a short, recognizable name that’s also a network address for your Urbit OS instance. (You can find a complete, high level description of Urbit ID [here](https://urbit.org/understanding-urbit/urbit-id/).)
@@ -33,13 +35,13 @@ So we started by collecting influences.
3335
3436<iframe class="arena-iframe" width="100%" src="https://www.are.na/tlon/seal-zp3irwad52y/embed"></iframe>
3537
36−The ‘chop’ or [seal](https://en.wikipedia.org/wiki/Seal_(East_Asia)) is conceptually pretty close to what we wanted to get to.
38+The ‘chop’ or [seal](<https://en.wikipedia.org/wiki/Seal_(East_Asia)>) is conceptually pretty close to what we wanted to get to.
3739
3840<br /><br />
3941
4042<iframe class="arena-iframe" width="100%" src="https://www.are.na/tlon/kamon/embed"></iframe>
4143
42−[Kamon](https://en.wikipedia.org/wiki/Mon_(emblem)) are even closer — especially since they have very little visual complexity.
44+[Kamon](<https://en.wikipedia.org/wiki/Mon_(emblem)>) are even closer — especially since they have very little visual complexity.
4345
4446<br /><br />
4547
@@ -67,11 +69,11 @@ Another influence: international maritime signal flags. We like these not only b
6769
6870You can see the whole collection of our visual research [here](https://www.are.na/tlon/2019-sigils-research).
6971
70−Ultimately, we didn’t specifically draw on any of these influences very consciously. The goal of visual research is to get a sense of the territory, what has been tried, and what works. We think these threads of prior work are evident in the final result — you can *feel* them, but it’s tough to point to them individually.
72+Ultimately, we didn’t specifically draw on any of these influences very consciously. The goal of visual research is to get a sense of the territory, what has been tried, and what works. We think these threads of prior work are evident in the final result — you can _feel_ them, but it’s tough to point to them individually.
7173
7274## What’s in a name?
7375
74−> *“Lev’s sigil appeared, strobing, as Netherton was getting out of the cab in Henrietta Street. “Yes?” Netherton asked.”*
76+> _“Lev’s sigil appeared, strobing, as Netherton was getting out of the cab in Henrietta Street. “Yes?” Netherton asked.”_
7577>
7678> <cite>— William Gibson, The Peripheral</cite>
7779
@@ -79,7 +81,7 @@ Before we get to how we worked through the problem of actually designing these t
7981
8082We went through so many names for these things. Crest, symbol, seal, tag, pictograph, stamp, emblem, signet, icon, glyph, holomark, visage, radigy, pattern, the list goes on for an incredibly (embarrassingly) long time. We argued about this, we went back and forth about it.
8183
82−Sigil won, ultimately, because of the way that it’s personified in William Gibson’s *The Peripheral*. In the far future, characters talk to each other by some kind of telepresence. When a call comes in from someone else, they first appear as a ‘sigil.’ It’s a strange word, but we were imagining a similar use-case.
84+Sigil won, ultimately, because of the way that it’s personified in William Gibson’s _The Peripheral_. In the far future, characters talk to each other by some kind of telepresence. When a call comes in from someone else, they first appear as a ‘sigil.’ It’s a strange word, but we were imagining a similar use-case.
8385
8486While we can’t point to any specific parts of our visual research that reappear directly, sigil is lovingly borrowed.
8587
content/blog/eliza.md+3−2
@@ -1,7 +1,8 @@
11+++
22title = "Eliza"
3−date = 2021-02-23
3+date = "2021-02-22"
44description = "Building things, even Calm™ things, makes noise."
5+
56[extra]
67author = "Christian Langalis"
78ship = "~pindet-timmut"
@@ -42,7 +43,7 @@ The sum of Urbit's architectural design is a new online economics: a way to fina
4243
4344We all know the basic MEGACORP business model: offer a free service (to suckers who don't own a server), secretly mine the data they generate on the (addictive) platform, then sell targeted ads to advertisers. This model will not survive Urbit. The ubiquitous personal server changes the economic equation. You used to 'pay' for an experience with your time and data. On Urbit, once you purchase core internet infrastructure, it's yours.
4445
45−So, can Urbit meaningfully curtail our world's appetite for data? We'll see. Post-enlightenment society runs on instrumental reason, right down to the last byte. Marketers will always want a fresh dataset. However, when the goods are on your Urbit, you can at least demand the respect you deserve. Long term, we expect a transparent market for data, not an opaque "agreement". An analytics company wants to track everything you see and do on Urbit? They better be paying well.
46+So, can Urbit meaningfully curtail our world's appetite for data? We'll see. Post-enlightenment society runs on instrumental reason, right down to the last byte. Marketers will always want a fresh dataset. However, when the goods are on your Urbit, you can at least demand the respect you deserve. Long term, we expect a transparent market for data, not an opaque "agreement". An analytics company wants to track everything you see and do on Urbit? They better be paying well.
4647
4748Eliza doesn't pay respondents. Her collection is a charity to Urbit's developers. (We're also still busy enabling payments on Urbit with the Bitcoin wallet.) However, her presence is not a term of service either. In a few years, by the nth time some smart aleck uses Eliza's chatbot code and conjures 'Zalexa' to attempt an intrusion upon your Calm™, we will see the economics of Urbit's architecture suddenly vivify. Blacklists, reputation systems, and, eventually, even data markets, all Urbit primitives envisioned long ago, will become real. We won't need Zoogle to underwrite a spam filter for the entire internet; the scarcity of Urbit address space, in tandem with a true web-of-trust, handles that.
4849
content/blog/events-series.md+4−3
@@ -1,7 +1,8 @@
11+++
22title = "Urbit Events Series"
33description = "These events are an opportunity for Urbit contributors to share real-time updates that don’t make it into this blog, and for the community to get to know the contributors (and one another)."
4−date = 2020-10-30
4+date = "2020-10-29"
5+
56[extra]
67description = "These events are an opportunity for Urbit contributors to share real-time updates that don’t make it into this blog, and for the community to get to know the contributors (and one another)."
78author = "Lane Rettig"
@@ -15,7 +16,7 @@ image = "https://media.urbit.org/site/posts/essays/bau.jpg"
1516
1617<br>
1718
18−*TL;DR: Urbit is launching a series of community events, the first of which is a developer call taking place on Thursday, November 5 at 9am PT. [Sign up here](https://www.meetup.com/urbit-sf/events/274279522/), and read on for all of the details.*
19+_TL;DR: Urbit is launching a series of community events, the first of which is a developer call taking place on Thursday, November 5 at 9am PT. [Sign up here](https://www.meetup.com/urbit-sf/events/274279522/), and read on for all of the details._
1920
2021--
2122
@@ -53,4 +54,4 @@ Tlon could no longer catalog the Urbit community even if it wanted to. This is a
5354
5455--
5556
56−*Sign up to attend [the first event](https://www.meetup.com/urbit-sf/), and join the channels called “Events Series” on Landscape in the Urbit Community group to get involved.*
57+_Sign up to attend [the first event](https://www.meetup.com/urbit-sf/), and join the channels called “Events Series” on Landscape in the Urbit Community group to get involved._
content/blog/first-contract.md+2−1
@@ -1,7 +1,8 @@
11+++
22title = "Azimuth’s First Contract Upgrade"
3−date = 2021-06-05
3+date = "2021-06-04"
44description = "Galactic Senate makes first concrete action"
5+
56[extra]
67author = "Jonathan Paprocki and Mark"
78ship = "~datnut-pollen and ~palfun-foslup"
content/blog/first-steps-towards-urbit-org.md+8−13
@@ -1,59 +1,54 @@
11+++
22title = "First Steps Towards urbit.org"
3−date = 2020-08-12
3+date = "2020-08-11"
44description = "With a stable platform taking shape and a strong community forming that wants to help build Urbit, it’s time to make urbit.org real."
5+
56[extra]
67author = "Josh Lehman"
78ship = "~wolref-podlex"
8−image ="https://media.urbit.org/site/posts/essays/first-steps.png"
9+image = "https://media.urbit.org/site/posts/essays/first-steps.png"
910+++
1011
1112<br>
1213
1314<img src="https://media.urbit.org/site/posts/essays/first-steps.png">
1415
15−
1616## Summary
1717
1818It’s been a long time since we last discussed separating the [governance of urbit.org](https://urbit.org/blog/governance-of-urbit/) from Tlon. In the last few weeks, we’ve taken steps to make such a separation real. In this update we’ll discuss the background that led us here, why we’re doing this now, and what this means for Urbit.
1919
20−
2120## Background
2221
2322At present Urbit is an open-source project developed primarily by the company Tlon. Urbit is an ambitious project with a long roadmap, which has required both careful guidance and resources to sustain its development. These resources have been Urbit’s address space, which have value in direct proportion to the value of Urbit as a platform. Naturally, Tlon has been focused thus far on making Urbit into a platform that people want to use.
2423
25−Ultimately, Urbit presents more possibilities than any one organization can manage. We anticipated this, and set aside address space for urbit.org, which we’ve often thought of as some type of software foundation. As Urbit matures to the point where Tlon can shift from developing the platform to developing products *on* the platform, urbit.org is meant to continue to improve and maintain the parts of Urbit that many will come to rely upon.
26−
27−When we last discussed this, in early 2019, we weren’t quite ready to pull the trigger on setting up urbit.org. We weren’t sure if a software foundation would be the right structure, didn’t have the resources to tackle the overhead, and Urbit wasn’t yet stable enough for Tlon to focus on anything *but* platform development.
24+Ultimately, Urbit presents more possibilities than any one organization can manage. We anticipated this, and set aside address space for urbit.org, which we’ve often thought of as some type of software foundation. As Urbit matures to the point where Tlon can shift from developing the platform to developing products _on_ the platform, urbit.org is meant to continue to improve and maintain the parts of Urbit that many will come to rely upon.
2825
26+When we last discussed this, in early 2019, we weren’t quite ready to pull the trigger on setting up urbit.org. We weren’t sure if a software foundation would be the right structure, didn’t have the resources to tackle the overhead, and Urbit wasn’t yet stable enough for Tlon to focus on anything _but_ platform development.
2927
3028## The Present
3129
32−Urbit is really starting to look like a platform. Tlon has put tons of work into making Urbit stable and performant, we’ve launched OS1, and hosting services are on the horizon. Meanwhile, the grants program and Hoon School were initiated, and community members have been [contributing](https://github.com/natareo/hooncard/blob/master/hooncard.pdf) [learning](https://github.com/timlucmiptev/gall-guide/blob/master/guide-docs/overview.md) [materials](https://github.com/lukechampine/rote/blob/master/urbit/app/rote.hoon), [issuing](https://github.com/urbit/urbit/pull/2885) [patches](https://github.com/urbit/urbit/pull/3202) [to](https://github.com/urbit/urbit/pull/3238) [Urbit](https://github.com/urbit/urbit/pull/2867), and [building](https://github.com/ryjm/srrs) [new](https://github.com/dclelland/UrsusChat) [applications](https://github.com/yosoyubik/canvas) [in](https://github.com/yosoyubik/urbitcoin) [userspace](https://github.com/taalhavras/ucal).
30+Urbit is really starting to look like a platform. Tlon has put tons of work into making Urbit stable and performant, we’ve launched OS1, and hosting services are on the horizon. Meanwhile, the grants program and Hoon School were initiated, and community members have been [contributing](https://github.com/natareo/hooncard/blob/master/hooncard.pdf) [learning](https://github.com/timlucmiptev/gall-guide/blob/master/guide-docs/overview.md) [materials](https://github.com/lukechampine/rote/blob/master/urbit/app/rote.hoon), [issuing](https://github.com/urbit/urbit/pull/2885) [patches](https://github.com/urbit/urbit/pull/3202) [to](https://github.com/urbit/urbit/pull/3238) [Urbit](https://github.com/urbit/urbit/pull/2867), and [building](https://github.com/ryjm/srrs) [new](https://github.com/dclelland/UrsusChat) [applications](https://github.com/yosoyubik/canvas) [in](https://github.com/yosoyubik/urbitcoin) [userspace](https://github.com/taalhavras/ucal).
3331
3432With a stable platform taking shape and a strong community forming that wants to help build Urbit, it’s time to make urbit.org real. We’ve had plenty of time to think about what it should look like, how it should work, and who should lead it.
3533
3634Our plan is to run urbit.org as a protocol—we’ll treat it like a real entity, but instead of dealing with the administrative details of setting up such an organization, we’ll incubate it within Tlon and give it a mandate: To competently distribute address space as a means of improving Urbit.
3735
38−
3936## Moving Forward
4037
4138On that note, allow me to introduce myself: I’m Josh[^1], the new Interim Director of urbit.org. I’ve been a follower of this project for several years now and more recently a fairly active community member. I first became fascinated by Urbit as a programmer that saw the potential in a clean-slate OS; I later became compelled by a future in which social computing becomes small, friendly, and human-scale again.
4239
4340My background is predominantly in building software, companies, and teams—most notably [Starcity](https://starcity.com), where I am a co-founder and CTO. Starcity[^2], like Tlon, is focused on enabling communities to flourish. While the approaches couldn’t be more different, the goal of bringing people together in fundamentally human ways is shared.
4441
45−My goal is to leverage urbit.org to ensure Urbit’s success. I want to see a world in which Urbit is used by my friends, family, colleagues, everyone I know. To get there, much is left to build.
42+My goal is to leverage urbit.org to ensure Urbit’s success. I want to see a world in which Urbit is used by my friends, family, colleagues, everyone I know. To get there, much is left to build.
4643
4744To that end, the first objective of urbit.org is to recruit builders and give them the tools to succeed. I’ll be focusing heavily on providing technical support to developers that engage with us via Grants, outreach to the wider developer community, supporting the efforts of those that are creating educational courses and documentation, and enlarging the contribution surface by exposing it to other programming languages[^3].
4845
4946The product work that Tlon is doing is crucial to Urbit’s long-term success, so I’ll also be leveraging bounties to more directly accelerate their development efforts. Landscape represents the clearest example of a cohesive vision for Urbit’s use. The existence of a polished product built on Urbit demonstrates to the world that the platform is robust and capable, and the growing community seems eager to help. You can expect more bounties very soon that provide a direct connection to the Landscape roadmap.
5047
51−As I’m only just getting started, I’d love to hear your thoughts. If you’re working on any grants you’ll hear from me soon, and if you have an idea that you want to pursue, I’m here to help you make it happen. You can reach me directly via Urbit as `~wolref-podlex` or by email at josh@urbit.org.
48+As I’m only just getting started, I’d love to hear your thoughts. If you’re working on any grants you’ll hear from me soon, and if you have an idea that you want to pursue, I’m here to help you make it happen. You can reach me directly via Urbit as `~wolref-podlex` or by email at josh@urbit.org.
5249
5350I look forward to working with you.
5451
5552[^1]: But my friends call me ~wolref-podlex.
56−
5753[^2]: We’re also really into the idea of being the first builder of housing on Mars. Just saying...
58−
5954[^3]: We call this project Airlock. You’ll hear more about it soon.
content/blog/ford-fusion.md+23−23
@@ -1,11 +1,12 @@
11+++
22title = "Ford Fusion"
3−date = 2020-07-15
3+date = "2020-07-14"
44description = "Ford Fusion was an overhaul of Urbit's over-the-air upgrade process and a rewrite of its build system. The new update system corrects a few long-standing bugs with the previous one, and the new build system is simpler, smaller (by around 5,000 lines), and easier to manage."
5+
56[extra]
67author = "Ted Blackman"
78ship = "~rovnys-ricfer"
8−image ="https://media.urbit.org/site/posts/essays/ford-fusion.png"
9+image = "https://media.urbit.org/site/posts/essays/ford-fusion.png"
910+++
1011
1112<br>
@@ -26,13 +27,14 @@ Urbit isn't exactly a traditional operating system, so the comparison is somewha
2627itself in the general case, not just some special cases.
2728
2829Ford Fusion has fixed the major upgrade issues of the past by guaranteeing three properties that in retrospect are obvious requirements, but, like much of Urbit, took many years and rewrites to identify as such:
30+
2931- Atomic: the update should complete or fail in one transaction. If it
3032 fails, the system shouldn't get stuck.
3133- Self-contained: there must be no implicit dependencies or hysteresis
3234 (dependence on previous system states) when building the new software
3335 from source.
3436- Ordered: updates must be monotonically sequenced from the system's
35− lowest layer to highest.
37+ lowest layer to highest.
3638
3739Let’s walk through them one by one.
3840
@@ -42,9 +44,9 @@ In previous versions of Urbit, updates failed atomicity by deferring parts of th
4244
4345We've learned that asynchronicity is an entropic state. A system will tend toward more asynchronicity over time unless effort is put into keeping it synchronous. [As Jonathan Blow has noted](https://youtu.be/pW-SOdj4Kkk?t=2547), the language server protocol has turned every editor plugin into a distributed system, since now it has to communicate asynchronously with the main editor process.
4446
45−Consider an update system that took multiple Arvo events to complete. An ad-hoc higher-level transaction system would need to be built to roll back the effects of the first few events in case of failure. It’s important for various parts of the system to be able to emit effects on upgrade; since those effects would need to be rolled back if a later event in this upgrade fails, the system would need to maintain a queue of those events and only apply them once all the other upgrade events have completed.
47+Consider an update system that took multiple Arvo events to complete. An ad-hoc higher-level transaction system would need to be built to roll back the effects of the first few events in case of failure. It’s important for various parts of the system to be able to emit effects on upgrade; since those effects would need to be rolled back if a later event in this upgrade fails, the system would need to maintain a queue of those events and only apply them once all the other upgrade events have completed.
4648
47−Note that the asynchronicity has now spread. Some effects that would normally be guaranteed to be processed synchronously might now be asynchronous. Entropy has begun to take hold, chipping away at the set of invariants the system is capable of guaranteeing.
49+Note that the asynchronicity has now spread. Some effects that would normally be guaranteed to be processed synchronously might now be asynchronous. Entropy has begun to take hold, chipping away at the set of invariants the system is capable of guaranteeing.
4850
4951This observation is not purely theoretical. False modularity was the cause of internal asynchronicity in Clay where it had to wait for responses in a complex dance with Ford, which was another vane (Arvo kernel module); moving Ford into Clay allowed function calls that were synchronous from Clay’s perspective, which allowed further simplifications, culminating in about a twenty percent reduction of source code size of the Arvo kernelspace.
5052
@@ -79,17 +81,17 @@ Emerging from this underworld required making a number of changes to the Arvo ke
7981
8082These are the layers of the stack that update themselves on the fly, from lowest to highest:
8183
82−+ hoon: the hoon language definition and compiler, defined in `/sys/hoon/hoon`
83−+ arvo: the arvo kernel proper and related type definitions, in `/sys/arvo/hoon`
84−+ zuse: the standard library, in `/sys/zuse/hoon`
85−+ vanes: arvo kernel modules, including clay itself, in folder `/sys/vane`
86−+ userspace: apps, marks, ancillary source code like libraries, and user data
84+- hoon: the hoon language definition and compiler, defined in `/sys/hoon/hoon`
85+- arvo: the arvo kernel proper and related type definitions, in `/sys/arvo/hoon`
86+- zuse: the standard library, in `/sys/zuse/hoon`
87+- vanes: arvo kernel modules, including clay itself, in folder `/sys/vane`
88+- userspace: apps, marks, ancillary source code like libraries, and user data
8789
8890An update to one layer necessitates a reload of all layers above it; e.g. a change to Zuse should trigger updates to the vanes and userspace. Conversely, an update to a higher layer should not cause a spurious reload of lower layers, which should not be affected by the change; for example, an update to just userspace should not cause any reloads of system code.
8991
90−Clay is responsible for enforcing the layering of updates. An update to a module is triggered when an attempt is made to commit a change to Clay that affects one or more files needed to build the module. For example, if the 'foo' agent's source, defined in `/app/foo/hoon`, imports the 'bar' library from `/lib/bar/hoon`, then a modification to `/lib/bar/hoon` triggers an update to the 'foo' agent. All vanes and userspace files depend on Zuse, which depends on the Arvo and Hoon sources, so a change to the Hoon, Arvo, or Zuse sources will trigger updates to all vanes and userspace files.
92+Clay is responsible for enforcing the layering of updates. An update to a module is triggered when an attempt is made to commit a change to Clay that affects one or more files needed to build the module. For example, if the 'foo' agent's source, defined in `/app/foo/hoon`, imports the 'bar' library from `/lib/bar/hoon`, then a modification to `/lib/bar/hoon` triggers an update to the 'foo' agent. All vanes and userspace files depend on Zuse, which depends on the Arvo and Hoon sources, so a change to the Hoon, Arvo, or Zuse sources will trigger updates to all vanes and userspace files.
9193
92−When asked to perform a commit, Clay determines which layers need to be updated based on which files have changed and which modules depend on those files. For now, all running programs load their source from the `%home` desk, so only changes to `%home` trigger stateful updates. Files in other desks can be built, but not installed into the system. This might be relaxed in the future.
94+When asked to perform a commit, Clay determines which layers need to be updated based on which files have changed and which modules depend on those files. For now, all running programs load their source from the `%home` desk, so only changes to `%home` trigger stateful updates. Files in other desks can be built, but not installed into the system. This might be relaxed in the future.
9395
9496The process of updating varies by layer. The Hoon and Zuse layers are stateless, so their newly rebuilt cores (Nock executables) must be stored (somewhere in the system’s Nock tree, in memory; remember, Urbit is a single-level store), but they have no state that would need to be migrated. The Arvo kernel, vanes, and userspace agents are all live, stateful programs, so in order to update one of those, the system must extract the state from the old program, pass that data into the newly built program, then discard the old program and store the new one. Arvo and agent state injection routines can emit effects, but vane updates cannot.
9597
@@ -130,7 +132,7 @@ When Gall receives a newly rebuilt agent from Clay, it calls the gate produced b
130132It is a bit counterintuitive that an app reload failure could prevent a kernel update. The reason is that we don't want the system to update itself into a broken state. An Urbit can be rendered practically unusable by the presence of broken agents, even if the kernel hasn't lost integrity,
131133so it's kinder to the user not to break their agents by installing an incompatible kernel update. This also puts virtuous pressure on kernel developers not to "break userspace", the importance of which has been insisted on for decades by Linus Torvalds, among others.
132134
133−If an agent does crash a commit event that included a kernel update, the attempted commit is now trivially rolled back, and the system can deliver an error message to the user. This does not leave the system in an inconsistent or stuck state, so the user could modify the failing agent and try the kernel update again later. Supporting better workflows for keeping third-party agents up-to-date will be an important aspect of Urbit’s upcoming software distribution work.
135+If an agent does crash a commit event that included a kernel update, the attempted commit is now trivially rolled back, and the system can deliver an error message to the user. This does not leave the system in an inconsistent or stuck state, so the user could modify the failing agent and try the kernel update again later. Supporting better workflows for keeping third-party agents up-to-date will be an important aspect of Urbit’s upcoming software distribution work.
134136
135137## Ford Build Semantics
136138
@@ -146,7 +148,7 @@ Clay exposes file builds into the scry namespace with `%ca`: as an example, `.^(
146148
147149#### Mark Builds
148150
149−A mark build produces a `$dais` mark-interface core. It first performs a file build on the Hoon file in `/mar` that defines the mark core, then it does some metaprogramming to make the operations more convenient to use. If the raw mark core delegated revision control operations to another mark core, the mark build will also load the delegate mark core and resolve the result into the `$dais`.
151+A mark build produces a `$dais` mark-interface core. It first performs a file build on the Hoon file in `/mar` that defines the mark core, then it does some metaprogramming to make the operations more convenient to use. If the raw mark core delegated revision control operations to another mark core, the mark build will also load the delegate mark core and resolve the result into the `$dais`.
150152
151153Clay exposes mark builds into the scry namespace with `%cb`: as an example, `.^(dais:clay %cb /~zod/home/3/mar/foo/hoon)` builds a `$dais` for the `%foo` mark.
152154
@@ -154,15 +156,14 @@ Clay exposes mark builds into the scry namespace with `%cb`: as an example, `.^(
154156
155157A cast build produces a `$tube`: a gate that takes a value of one mark as input and converts it to a valid value of another mark or crashes. To convert from mark `%foo` to mark `%bar`, Clay tries the following operations, in order:
156158
157−+ direct grow from `%foo`
158−+ direct grab from `%bar`
159−+ indirect jump from `%foo` through `%qux`
160−+ indirect grab from `%bar` through `%qux`
159+- direct grow from `%foo`
160+- direct grab from `%bar`
161+- indirect jump from `%foo` through `%qux`
162+- indirect grab from `%bar` through `%qux`
161163
162164The `%foo` mark can “grow to” `%bar` by providing an arm in its `+grow` core named `+bar`. `%bar` can convert from `%foo` using a `+foo` arm in its `+grab` core. `%foo` can also chain a conversion through an intermediary using an arm in its `+jump` core, and `%bar` can specify an “indirect grab” by having a `+grab` arm produce a delegate mark instead of directly defining a conversion gate.
163165
164−Clay exposes cast builds into the scry namespace with `%cc`: as an example, `.^(tube:clay %cc
165−/~zod/home/3/foo/bar)` builds a `$tube` conversion gate from `%foo` to `%bar`.
166+Clay exposes cast builds into the scry namespace with `%cc`: as an example, `.^(tube:clay %cc /~zod/home/3/foo/bar)` builds a `$tube` conversion gate from `%foo` to `%bar`.
166167
167168### Ford Runes
168169
@@ -207,8 +208,7 @@ A valid userspace hoon file must contain a nonempty list of hoons (hoon source e
207208
208209Urbit still needs to make better use of desks other than `%home` and the development process should be adjusted given the tighter coupling between source code and kernel and tighter criteria for accepting an update.
209210
210−This work also hopefully provides a good foundation of a package management and software distribution system for Urbit. As `~wicdev-wisryt` has said, a user should be able to run `|install
211−~norsyr-torryn/canvas` to load and build remote source. No one should experience dependency hell on Urbit, but we're not there yet.
211+This work also hopefully provides a good foundation of a package management and software distribution system for Urbit. As `~wicdev-wisryt` has said, a user should be able to run `|install ~norsyr-torryn/canvas` to load and build remote source. No one should experience dependency hell on Urbit, but we're not there yet.
212212
213213At least now, building a desk has no dependencies, other than a Ford with a compatible Hoon compiler. No decisions have been made on this yet, but
214214Ford might get moved to inside the desk, possibly by making Zuse callable. This could allow a desk to expose a Nock interface in addition to a typed Hoon interface, which could even let a desk be used as a "pill" bootloader.
@@ -221,6 +221,6 @@ In early 2020, `~master-morzod` suggested moving Ford into Clay to reduce asynch
221221
222222The first time I rewrote Ford, it took me six months, with help from `~littel-ponnys`, and it weighed in at 6,000 lines of code. The second time, in late 2018, took a few weeks. The third time, in January 2020, took a week. I wrote `+ford` in Ford Fusion in one long day, and it’s about 500 lines of synchronous, functional code.
223223
224−It has taken me two or three years to understand this problem as well as I do, and I expect there are parts of it I still don’t understand. The code itself isn’t the issue; it’s finding the right answer to ontological and teleological questions. What *is* Ford? What will it be in a hundred years? I’m confident Ford Fusion is more similar than its predecessor to the Ford of 2120, because it’s smaller, more functional, and easier to understand and administer.
224+It has taken me two or three years to understand this problem as well as I do, and I expect there are parts of it I still don’t understand. The code itself isn’t the issue; it’s finding the right answer to ontological and teleological questions. What _is_ Ford? What will it be in a hundred years? I’m confident Ford Fusion is more similar than its predecessor to the Ford of 2120, because it’s smaller, more functional, and easier to understand and administer.
225225
226226As an engineering discipline and organizational practice, working on a system intended to be frozen yields surprising simplifications like this every so often. Urbit is now reaching the point where we’re starting to see more of the obsidian edges of the frozen future system emerge from the lava.
content/blog/gifts-q3-2020.md+6−4
@@ -1,14 +1,16 @@
11+++
22title = "Gifts Q3 2020"
3−date = 2020-09-23
3+date = "2020-09-22"
44description = "Twice a year we distribute address space to those that have made valuable contributions to Urbit. Now called our Gifts program, the gifting of address space has been part of Urbit long before we had a grants program."
5+
56[taxonomies]
6−grant_type = ["Gift"]
7−grant_category = []
7+grant_type = [ "Gift" ]
8+grant_category = [ ]
9+
810[extra]
911author = "Josh Lehman"
1012ship = "~wolref-podlex"
11−image ="https://media.urbit.org/site/posts/essays/gifts.png"
13+image = "https://media.urbit.org/site/posts/essays/gifts.png"
1214+++
1315
1416<br>
content/blog/governance-of-urbit.md+7−2
@@ -1,12 +1,17 @@
11+++
22title = "Governance of urbit.org"
3−date = 2019-01-11
3+date = "2019-01-10"
44description = "Stewardship of the Urbit Project."
5−aliases = ["/posts/essays/governance-of-urbit", "/posts/governance-of-urbit"]
5+aliases = [
6+ "/posts/essays/governance-of-urbit",
7+ "/posts/governance-of-urbit"
8+]
9+
610[extra]
711author = "Erik Newton"
812ship = "~patnes-rigtyn"
913+++
14+
1015![](https://storage.googleapis.com/media.urbit.org/site/governance-1.svg)
1116
1217## Summary
content/blog/hackathon-results.md+11−15
@@ -1,11 +1,12 @@
11+++
22title = "Hackathon Results"
3−date = 2020-06-12
3+date = "2020-06-11"
44description = "We recently held an invite-only Urbit Hackathon for graduates of our Hoon School program, and the submissions really impressed us across the board. Submissions were judged on several criteria: creativity, usefulness, and code quality."
5+
56[extra]
67author = "Robert Mariani"
78ship = "~lodleb-ritrul"
8−image ="https://media.urbit.org/site/posts/essays/hackathon-results-wide.png"
9+image = "https://media.urbit.org/site/posts/essays/hackathon-results-wide.png"
910+++
1011
1112<br>
@@ -16,52 +17,47 @@ image ="https://media.urbit.org/site/posts/essays/hackathon-results-wide.png"
1617
1718Results of the Urbit Hackathon
1819
19−We recently held an invite-only Urbit Hackathon for graduates of our Hoon School program, and the submissions really impressed us across the board. Submissions were judged on several criteria: creativity, usefulness, and code quality.
20+We recently held an invite-only Urbit Hackathon for graduates of our Hoon School program, and the submissions really impressed us across the board. Submissions were judged on several criteria: creativity, usefulness, and code quality.
2021
2122Congratulations to all the participants, especially the winners—their projects are seriously impressive.
2223
23−
2424### First Place: Eight Stars
2525
26−Jose’s `~norsyr-torryn` Canvas is a peer-to-peer, collaborative drawing app that comes in the form of a Landscape tile. It’s kind of like a multiplayer MS Paint, but better.
26+Jose’s `~norsyr-torryn` Canvas is a peer-to-peer, collaborative drawing app that comes in the form of a Landscape tile. It’s kind of like a multiplayer MS Paint, but better.
2727
2828Canvas uses Urbit in a way that we think it’s supposed to be used: the stuff that doesn’t require peer-to-peer or storage heavy lifting, such as the actual “drawing” component of the app, is done outside of Urbit.
2929
3030In addition to a freehand template for the classic Paint experience, you can choose from a number of templates to work with, such as a grid of fillable hexagons, or maps of parts of the world and of continents with fillable country divisions. Have you ever wanted to compare which countries you visited, color-coded for how much you liked them? Canvas has a built-in feature for sharing your work on chats in Landscape.
3131
32−Check out a video [demonstration](https://www.youtube.com/watch?v=S6DySv730Hw) of Canvas, and view [the code](https://github.com/yosoyubik/canvas).
32+Check out a video [demonstration](https://www.youtube.com/watch?v=S6DySv730Hw) of Canvas, and view [the code](https://github.com/yosoyubik/canvas).
3333
3434Jose wins eight stars, and he also wins [le internet for the day](https://news.ycombinator.com/item?id=23228058). Bravo!
3535
36−
3736### Second Place: Four Stars Each
3837
39−Luke Champine’s (`~watter-parter`) flashcard app for Landscape, Rote, has been awarded one of two second-place prizes.
38+Luke Champine’s (`~watter-parter`) flashcard app for Landscape, Rote, has been awarded one of two second-place prizes.
4039
41−Rote users write decks in udon, review them, and share them with other ships. His immaculate backend code-style and documentation secured his high placement in the Hackathon—his Hoon code also functions as a full-blown walkthrough. If you’re a Gall novice and you’re looking to learn, take a look at his [code](https://github.com/lukechampine/rote). Luke also kept a Notebook documenting his experience at `~watter-parter/hackathon`.
40+Rote users write decks in udon, review them, and share them with other ships. His immaculate backend code-style and documentation secured his high placement in the Hackathon—his Hoon code also functions as a full-blown walkthrough. If you’re a Gall novice and you’re looking to learn, take a look at his [code](https://github.com/lukechampine/rote). Luke also kept a Notebook documenting his experience at `~watter-parter/hackathon`.
4241
4342Luke also included example decks for flashcards on Hoon runes and their irregular forms. So, all said and done, everything about Rote is an excellent resource to the eager Hoon neophyte.
4443
4544Pyry Kovanen (`~dinleb-rambep`) was also awarded second prize for his reading-list-sharing app, Books. Also a Landscape tile, and it’s pretty darn useful, with the ability to import books from Goodreads. Check out [the code](https://github.com/pkova/urbit/tree/books/pkg/interface/books) and the [video demo](https://youtu.be/Spy7FoPdfx8).
4645
47−
4846### Third Place: Two Stars Each
4947
50−
51−N E Davis (`~lagrev-nocfep`) brought the heavy infrastructural artillery with Roessler, and won third prize. Roessler is actually three related Hoon tools:
48+N E Davis (`~lagrev-nocfep`) brought the heavy infrastructural artillery with Roessler, and won third prize. Roessler is actually three related Hoon tools:
5249`roessler` proper, a library for solving the differential equations producing the [Roessler attractor](https://en.wikipedia.org/wiki/R%C3%B6ssler_attractor).
5350`lazytrig`, a library for transcendental functions.
54−`proj-3d`, a generator that takes the 3D coordinates produced by `Roessler`.
51+`proj-3d`, a generator that takes the 3D coordinates produced by `Roessler`.
5552
5653The Roessler project is full of cool, novel features. You might enjoy taking a look at the [GitHub repo](https://github.com/sigilante/roessler) ...if your brain is big enough.
5754
5855John Franklin (`~dirwex-dosrev`) also secured third place for his Notes application. True to its name, it’s a Landscape tile that allows the user to create and search notes by keyword. Look at the [code](https://github.com/jfranklin9000/notes/) and the [demo video](https://www.youtube.com/watch?v=7DurNjCFOmA).
5956
60−Jon (`~ribnes-fonbex`) was awarded third prize for his Quadratic Voting project. It implements for Urbit ships a [quadratic voting system](https://en.wikipedia.org/wiki/Quadratic_voting), which is sort of like ranked-choice voting but allows people to express their stronger preferences.
57+Jon (`~ribnes-fonbex`) was awarded third prize for his Quadratic Voting project. It implements for Urbit ships a [quadratic voting system](https://en.wikipedia.org/wiki/Quadratic_voting), which is sort of like ranked-choice voting but allows people to express their stronger preferences.
6158
6259Congratulations to the winners and to everyone who submitted—nice work!
6360
64−
6561### The Future
6662
6763We were thoroughly impressed with all of the projects from this inaugural Hackathon. Not only did this Hackathon demonstrate the talent and dedication of our community members, it’s an encouraging sign about the maturity of the Urbit system. We’re going to hold more Hackathons in the future, with one big change: they will be open to anyone who applies.
content/blog/haleek-maul-interview.mdnew file+71
@@ -0,0 +1,71 @@
1++++
2+title = "NFTs, Urbit IDs, and Communities w/ Haleek Maul"
3+date = "2021-09-09"
4+description = "An interview with the founder of Holdersland"
5+[extra]
6+author = "Matt"
7+ship = "~tirwyd-sarmes"
8+image = "https://media.urbit.org/site/posts/essays/haleek_sigil.jpg"
9++++
10+
11+![](https://media.urbit.org/site/posts/essays/haleek_sigil.jpg)
12+
13+*Check out the Holdersland x Urbit collection: [holders.land/urbit](https://holders.land/urbit)*
14+
15+We sat down recently with Haleek Maul to discuss the current state of NFTs and the future of Urbit IDs and digital communities.
16+
17+Are Urbit IDs NFTs? Sure, they're ERC-721 non-fungible tokens which you can buy on OpenSea—but to be clear, we made them way back before the word "NFT" had entered mainstream consciousness. An Urbit ID is a number that is used to generate both a phonetic name and an avatar (what we call [sigils](https://urbit.org/blog/creating-sigils)), but it is so much more than your average NFT—it is a key to an entire digital world.
18+
19+We built Urbit IDs for digital communities and the people they’re made of. An Urbit ID is a decentralized and pseudonymous identity perfect for your collective, commune, squad, team, or DAO. Unlike most addresses or social identities, you own your Urbit ID like you own your crypto. Your Discord handle might be free for now, but as the saying goes, if it’s free then you’re the product. On Urbit your ID is actually yours and you pay for it up front. You can log into third party apps or software without ever relinquishing control of your data. What is yours stays with you. IDs themselves can be owned collectively—there are already DAOs on Urbit who jointly own stars and galaxies.
20+
21+Urbit IDs are evolving and generative. They’re generative because some IDs spawn additional NFTs which themselves can be bought and sold. For instance, each star can spawn 65,535 planets, and each galaxy can spawn 255 stars. The network itself is evolving, meaning that the network can be upgraded via a majority vote by galaxy holders. Urbit IDs and the Ubit network itself are inherently dynamic.
22+
23+At Urbit, we support communities of all kinds. We recently granted Holdersland ten Urbit IDs: four stars and six planets to be auctioned off. Haleek Maul (his Urbit ID is `~fosmex-hocmel`) will be creating custom artwork for each of the sigils. The proceeds of the auction will help support Holdersland in bringing blockchain technologies to the Caribbean. The auction will go live on September 16th, 2021 on [holders.land/urbit](https://holders.land/urbit).
24+
25+Without further ado, here’s Haleek Maul.
26+
27+---
28+
29+**Tell us a little bit about yourself and Holdersland.**
30+
31+Sure. My name is Haleek Maul and I’m a multi-disciplinary artist. I was born in America and came to Barbados when I was three years old. I’ve been making music since 2007. I put out my first debut project in 2012 and since then it has been a process of creating art from the stuff flowing through my mind.
32+
33+Holdersland is a digital extension of my artistic project—a way of creating change in the world around me. When I was younger, there weren’t many artists like me coming from Barbados. I was into a lot of niche electronic and club music and felt alienated from the larger conversation. Holdersland is a way to help creative people in the Caribbean connect with like-minded people around the world, especially using new technologies like blockchain. So I founded Holdersland in 2020 when I left my record label after four years. I felt like music institutions was archaic and didn’t feed into my other artistic practices. I wanted to create an institution that captured the full creative practice—all the way from creating to selling. Most importantly, I wanted to get artists from Barbados and the Caribbean involved in global conversations around art and technology.
34+
35+**What exactly is Holdersland?**
36+
37+It’s a company centered around Caribbean intellectual property. We’re trying to help people get connected with new web3 technologies, especially artists. Holdersland is an aggregator that helps connects those who are interested in new technology with those those who actually develop it.
38+
39+For example, there is a lot of math that underlies music. Part of our project is to extract these mathematical principles and see how they can help generate new forms of art that can be widely distributed. So we’re working to build our own projects and work with users to adopt some of these new technologies. It’s a community of people centered around these values. We plan to implement voting, governance, and incentive structures into the community soon.
40+
41+**What do you think is the link between your two main interests: music and technology?**
42+
43+I’ve always been interested in technology. Anyone who has made music in the last twenty years has had to get involved with tech. Especially if you’re a producer. There are many young kids who are downloading music software and messing around with it, and in the process becoming knowledgeable about music production and design. Science and math live right beside art.
44+
45+I was also into web development when I was a teenager and was very interested in how the internet worked. This led into the work I’m doing with Holdersland. Technology, more often than not, is concerned with collaboration and communication. But in order to develop new technologies we often need to talk about nitty-gritty details. This requires detailed knowledge of particular technologies.
46+
47+**What is the great hope or promise with new decentralized technologies like blockchain or Urbit?**
48+
49+They lower the barrier to communication and trade. Especially for countries like Barbados, we don’t have access to the world market. But now with these networks, and assets like NFTs, we can engage in commerce without borders. It allows new entrants to join the market.
50+
51+It also allows new financial relationships and funding structures to emerge. Rather than have a few people contribute $20k, you can have hundreds of people contribute $100. Once again, this lowers the entry for people to invest is early-stage projects. This changes the way that companies build and ship products.
52+
53+Brain drain is when skilled workers move abroad for more profitable employment. These new technologies allow native Carribeans to stay where they are while earning money. Using these new technologies, the Carribean can prosper while not losing its unique character and cultural identity. Crypto is permanently going to change the distribution of wealth and culture around the world.
54+
55+Discord is a fine community solution, but it’s not ideal. There’s an endless array of plugins and dependencies that makes Discord unstable. However, it is a good mixture of an office, a storefront, and a club: I can do my work, sell assets, and just have fun. Communities are important. People naturally want to be in communities, we just need a better solution than Discord. Especially one that’s crypto-native and allows for commerce. Urbit is a one-stop shop that could fill that gap.
56+
57+**What is the collaboration between Holdersland and Urbit that’s happening this week?**
58+
59+I’m producing some custom sigil artwork for a set of stars and planets. Both the Urbit assets and artwork will be auctioned off together. The proceeds from the event will go towards creating a community music studio here in Barbados and technology education around the island.
60+
61+A lot of people here in Barbados don’t even understand what crypto is. A lot of the work being done around this project is to raise awareness about the potentials of this new technology. I want this to be a general springboard for the Caribbean to gain greater technological literacy. That literacy is an important step for lower-income people to drastically change their situation.
62+
63+**What are you looking forward to talking about on the New World Energy panel at Assembly 2021?**
64+
65+I want to talk about how to migrate communities onto Urbit. How to use Urbit as a new platform for niche cultures found around the current internet. Also the great strength and power provided by Urbit’s digital identities.
66+
67+NFTs can be very powerful—there are a lot of possible applications of a unique digital asset. It’s already dissolved geographical boundaries which will help countries to export their intellectual products freely. Countries need first to gain knowledge around these technologies and their economies will follow.
68+
69+**Thanks for chatting!**
70+
71+See you at Assembly 2021!
content/blog/hosting-the-future.md+7−6
@@ -1,11 +1,12 @@
11+++
22title = "Hosting the Future"
3−date = 2020-10-01
3+date = "2020-09-30"
44description = "The way we see it, hosting is the most important thing, next to Landscape, that Tlon can do to help Urbit continue toward widespread adoption."
5+
56[extra]
67author = "Nick Simmons"
78ship = "~simfur-ritwed"
8−image ="https://storage.googleapis.com/media.urbit.org/site/posts/essays/200930-hosting-by-tlon.jpg"
9+image = "https://storage.googleapis.com/media.urbit.org/site/posts/essays/200930-hosting-by-tlon.jpg"
910+++
1011
1112<br>
@@ -16,13 +17,13 @@ image ="https://storage.googleapis.com/media.urbit.org/site/posts/essays/200930-
1617
1718Urbit users tend to be interesting, creative, and capable people; we’re genuinely impressed with the communities that have formed on the network, and with the quality of discourse there. But for the number of communities to continue to grow, getting on the network has to become dramatically easier. It’s not realistic to expect most people to configure their own Urbit OS node in the command line.
1819
19−At the moment, the biggest lever we have here is to help ordinary users get online, so they can participate in communities inside Urbit, and eventually form their own. This means hosting their Urbit nodes and showing them around the network when they first arrive. There are already several businesses overlapping with this space to varying degrees: [planet.market](https://planet.market/), [urth.systems](https://urth.systems/), and [geturbitid](https://www.geturbitid.com/). Now, Tlon is releasing its own hosting offering. For the uninitiated, “Hosting” just means that we run your urbit ship for you, making it easier for you to get onto the network. We’ve been testing our hosting service with friends and family for the past few months, and now we’re ready to bring it to the rest of the world.
20+At the moment, the biggest lever we have here is to help ordinary users get online, so they can participate in communities inside Urbit, and eventually form their own. This means hosting their Urbit nodes and showing them around the network when they first arrive. There are already several businesses overlapping with this space to varying degrees: [planet.market](https://planet.market/), [urth.systems](https://urth.systems/), and [geturbitid](https://www.geturbitid.com/). Now, Tlon is releasing its own hosting offering. For the uninitiated, “Hosting” just means that we run your urbit ship for you, making it easier for you to get onto the network. We’ve been testing our hosting service with friends and family for the past few months, and now we’re ready to bring it to the rest of the world.
2021
21−To learn more about Tlon hosting and sign up for the waiting list, check out the new [tlon.io](https://tlon.io/) website. We are officially launching the service on October 9th, with a virtual event and demo; we’ll also show off some of the new features and improvements to Landscape, the Urbit web client.
22+To learn more about Tlon hosting and sign up for the waiting list, check out the new [tlon.io](https://tlon.io/) website. We are officially launching the service on October 9th, with a virtual event and demo; we’ll also show off some of the new features and improvements to Landscape, the Urbit web client.
2223
2324To be very clear, hosting isn’t for everyone; if you’re deeply security-conscious or privacy-oriented, you’ll still want to self-host so that nobody else needs to touch your keys. That said, hosting isn’t a walled garden; you’ll get a planet when you sign up for hosting, which you will own 100% and forever. You’ll also always have the option to roll up your data and take it with you if you choose to stop using our service. Your Urbit data is just a single file, and we’ll happily hand it back to you if you ever decide to leave. Nothing will ever stop you from self-hosting.
2425
25−We’ve talked for a while about how the ultimate destiny of Urbit is to escape the control of Tlon. For Urbit to really succeed, it has to be managed by its own community. We started Tlon in order to solidify the foundation of this young platform. Now that Urbit is starting to grow up, Tlon and Urbit will naturally drift apart a bit.
26+We’ve talked for a while about how the ultimate destiny of Urbit is to escape the control of Tlon. For Urbit to really succeed, it has to be managed by its own community. We started Tlon in order to solidify the foundation of this young platform. Now that Urbit is starting to grow up, Tlon and Urbit will naturally drift apart a bit.
2627
2728Urbit is meant to be universal, ubiquitous infrastructure. Tlon exists to make that infrastructure useful and usable. We expect Urbit, as a platform, to be cared for by the community in collaboration with the emerging [Urbit Foundation](https://urbit.org/blog/first-steps-towards-urbit-org/). We intend Tlon to become increasingly focussed on providing a great user experience for anyone interested in this new network, so the network can continue to grow and thrive.
2829
@@ -30,4 +31,4 @@ The way we see it, hosting is the most important thing, next to Landscape, that
3031
3132If you’re curious to keep up with what Tlon is doing here, head to [tlon.io](https://tlon.io) and join the waiting list. We’ll be posting updates to that list as well as to the Tlon Transmissions notebook in the Urbit Community group. Going forward we’ll do our best to keep urbit.org neutral and focussed on the technology itself.
3233
33−See you all on the network!
34+See you all on the network!
content/blog/infrastructural.md+10−9
@@ -1,11 +1,12 @@
11+++
22title = "Infrastructural"
3−date = 2020-04-10
3+date = "2020-04-09"
44description = "A reflection–meditation on OS 1’s initial form development, and the attitude we brought to bear in designing it."
5+
56[extra]
67author = "É. Urcades"
78ship = "~fabled-faster"
8−image ="https://media.urbit.org/site/posts/essays/infrastructural-2.jpg"
9+image = "https://media.urbit.org/site/posts/essays/infrastructural-2.jpg"
910+++
1011
1112<br>
@@ -26,9 +27,9 @@ This post serves as a reflection–meditation on OS 1’s initial form developme
2627
2728## Products
2829
29−Urbit’s interfaces, and the process by which we build them, are resolutely not projections of the world’s current conception of digital design—that of mass digital product design. Products are sold, bought, and discarded as they are in their physical sense. Digital products are slotted into the [vending machines](https://urcad.es/writing/personal-computer-vending-machine/) we call our phones and are mass produced as candy is produced. Candy is *essentially* free, and contemporary digital products are *absolutely* free of cost. If you’re reading this, you probably already have a good idea of what free corporate digital products mean for your privacy.
30+Urbit’s interfaces, and the process by which we build them, are resolutely not projections of the world’s current conception of digital design—that of mass digital product design. Products are sold, bought, and discarded as they are in their physical sense. Digital products are slotted into the [vending machines](https://urcad.es/writing/personal-computer-vending-machine/) we call our phones and are mass produced as candy is produced. Candy is _essentially_ free, and contemporary digital products are _absolutely_ free of cost. If you’re reading this, you probably already have a good idea of what free corporate digital products mean for your privacy.
3031
31−Urbit is distinctly *not* free (as in freely offered as a service via a corporate entity), and your urbit is distinctly *not* a product. As we trace over the interfaces we design with our cursors, we’re not building a product, we’re not selling a product, we’re not painting a product, and we’re certainly not decorating a product.
32+Urbit is distinctly _not_ free (as in freely offered as a service via a corporate entity), and your urbit is distinctly _not_ a product. As we trace over the interfaces we design with our cursors, we’re not building a product, we’re not selling a product, we’re not painting a product, and we’re certainly not decorating a product.
3233
3334Here at Tlon, we’re assembling thoughtful infrastructure you can spend your life using, learning, and extending. We’re attempting to assemble spaces you can one day pass on to friends, close collaborators, or possibly your grandchildren. We are resolute in our practice and stay our hands to the greatest degree possible as a result of this mindset.
3435
@@ -40,17 +41,17 @@ OS 1, while incremental in its initial expression from OS 0, serves to outline o
4041
4142**Beautiful infrastructure is a gravitational force**. Even if you can’t feel it or directly experience it, well-designed infrastructure is a cohering force. One is grounded with respect to the infrastructure they live alongside.
4243
43−**Beautiful infrastructure is like a [shell](https://en.wikipedia.org/wiki/Shell)**. Well-considered infrastructural projects provide durable, generalized, reusable, and most importantly, *self-designed* containers around otherwise formless flows of information.
44+**Beautiful infrastructure is like a [shell](https://en.wikipedia.org/wiki/Shell)**. Well-considered infrastructural projects provide durable, generalized, reusable, and most importantly, _self-designed_ containers around otherwise formless flows of information.
4445The current state of mass software design has gotten many of the “reusable” elements of design down pat, but these structures are optimized to pump ads and information into your brain, algorithmically-sorted-linear-feed style.
4546In Urbit, I can take the conceptual container of "temporal linearity" and use this to shape communication data as I see fit. I should be able to shape once-linear communication and cast it into a nodal communication model: My DM is now a MUD.
4647
4748Truly beautiful infrastructure undergirds the daily exchanges people actually care about—I don’t drink plumbing, I drink the water it carries and protects.
4849
49−Another way of thinking about “Infrastructure” (here defined loosely as “the *truly* essential structures that allow society at varying scales to operate”) is to think about it in terms of interpersonal support structure.
50+Another way of thinking about “Infrastructure” (here defined loosely as “the _truly_ essential structures that allow society at varying scales to operate”) is to think about it in terms of interpersonal support structure.
5051
5152We deeply hope that Urbit can form a support structure for you and your community.
5253
53−These self-evident statements underlie the core problems we sought to address in designing a userspace for OS 1: How do we design an *actually* personal digital infrastructure? What does infrastructure look like when shared with immediate friends? With a cooperative organization? How can we impress upon Urbit's earliest adopters that once they've obtained an Urbit ID, their computer is at that moment *literally* entirely theirs?
54+These self-evident statements underlie the core problems we sought to address in designing a userspace for OS 1: How do we design an _actually_ personal digital infrastructure? What does infrastructure look like when shared with immediate friends? With a cooperative organization? How can we impress upon Urbit's earliest adopters that once they've obtained an Urbit ID, their computer is at that moment _literally_ entirely theirs?
5455
5556<br>
5657
@@ -62,7 +63,7 @@ These self-evident statements underlie the core problems we sought to address in
6263
6364OS 1 was optimized from an interface design standpoint to ensure that a new inhabitant viscerally felt like there was a “space to inhabit”, or a “canvas to be painted”, or a set of simple and fundamental digital structures they could arrange to make their computer their own.
6465
65−Counterintuitively, designing around this notion of a "rich blank slate” required OS 1 to be designed in a manner that *almost* results in it feeling incomplete, or on the verge of appearing deeply unremarkable.
66+Counterintuitively, designing around this notion of a "rich blank slate” required OS 1 to be designed in a manner that _almost_ results in it feeling incomplete, or on the verge of appearing deeply unremarkable.
6667
6768A few key design decisions emphasized the above gestalt we sought to express:
6869
@@ -75,4 +76,4 @@ Many other small constraints have been set into place to build what we truly bel
7576
7677While visually primitive, OS 1 has managed to manifest a rich systematic expressiveness based on how it seems to be currently inhabited. We've been enjoying witnessing the ways people are beginning to interpret and make use of the faculties provided to create communal computing experiences of their own.
7778
78−What's most wonderful to observe is the fun people are having in striking out on their own in this collective endeavor. More than anything, we hope Urbit’s inhabitants are having a good time and learning to enjoy computers again.
79+What's most wonderful to observe is the fun people are having in striking out on their own in this collective endeavor. More than anything, we hope Urbit’s inhabitants are having a good time and learning to enjoy computers again.
content/blog/interim-constitution.md+28−27
@@ -1,8 +1,9 @@
11+++
22title = "Interim Constitution"
3−date = 2016-05-16
3+date = "2016-05-15"
44description = "The governing rules for the early days of the Urbit network."
5−aliases = ["/posts/essays/interim-constitution", "/posts/constitution"]
5+aliases = [ "/posts/essays/interim-constitution", "/posts/constitution" ]
6+
67[extra]
78author = "Tlon"
89ship = ""
@@ -13,17 +14,17 @@ image = "https://storage.googleapis.com/media.urbit.org/site/posts/essays/interi
1314
1415## Declaration of purpose
1516
16−Urbit is a new network created by the Tlon Corporation. Tlon's
17+Urbit is a new network created by the Tlon Corporation. Tlon's
1718broad intention is to surrender governance of Urbit to its users,
1819as soon as the community is collectively ready to receive it.
1920
2021This constitution (which is not a legal contract, just our present
2122intent, which may be updated arbitrarily) describes our governance
22−process during this interim period. Its design borrows from validated
23+process during this interim period. Its design borrows from validated
2324historical structures, mainly Roman and Anglo-American.
2425
2526The last and most important task of the interim government is to
26−write the next version of the constitution. This document may or
27+write the next version of the constitution. This document may or
2728may not incorporate any or all of the interim structures.
2829
2930## Beliefs and principles
@@ -36,15 +37,15 @@ The interim republic has four branches: an executive consulate, a
3637galactic senate, a stellar congress and a planetary assembly.
3738
3839For the interim, full authority is held by the (Roman style)
39−consulate. The legislature (senate, congress, assembly) is
40−advisory. The senate is never consulted and the congress is
40+consulate. The legislature (senate, congress, assembly) is
41+advisory. The senate is never consulted and the congress is
4142almost never consulted.
4243
4344In the future, the assembly of planets specializes in technical
44−governance. The congress of stars specializes in internal, but
45−nontechnical, governance. The senate of galaxies selects the
45+governance. The congress of stars specializes in internal, but
46+nontechnical, governance. The senate of galaxies selects the
4647consuls and holds them accountable, and specializes in compliance
47−with external powers. All votes, elections and other public
48+with external powers. All votes, elections and other public
4849actions are logged in the Urbit global namespace.
4950
5051As in most parliamentary systems, each of these structures sets
@@ -52,29 +53,29 @@ and enforces its own internal rules of operation.
5253
5354### Consulate
5455
55−A consulate is a two-person executive. The consuls must work out
56−their own organization and division of labor. Disagreements
56+A consulate is a two-person executive. The consuls must work out
57+their own organization and division of labor. Disagreements
5758between consuls are resolved by the senate.
5859
59−A consul must be a senator. The senate, voting per galaxy,
60+A consul must be a senator. The senate, voting per galaxy,
6061replaces the consulate whenever either a vacancy exists, or a
61−vote of no confidence gains a majority. When electing consuls,
62+vote of no confidence gains a majority. When electing consuls,
6263first a plurality selects one consul; then the plurality of those
6364who voted for anyone but the winner selects the second.
6465
6566### Senate
6667
6768The _senate_ is the set of all galaxy holders, voting per galaxy.
68−It does not convene except to replace the consuls. Its
69+It does not convene except to replace the consuls. Its
6970proceedings are in private.
7071
7172To avoid growing the network too quickly, galaxies are activated
72−gradually. Initially, only one galaxy is active, the root `~zod`
73+gradually. Initially, only one galaxy is active, the root `~zod`
7374(galaxy 0).
7475
7576Further activation is at the discretion of the consuls, who
7677control `urbit.org` and will only bind activated galaxies to
77−`galaxy.urbit.org`. Routing at the galaxy layer is by DNS, so
78+`galaxy.urbit.org`. Routing at the galaxy layer is by DNS, so
7879unbound galaxies, and any stars or planets they launch, hear no
7980packets.
8081
@@ -85,36 +86,36 @@ Non-activated galaxies can still be rekeyed.
8586### Congress
8687
8788The _congress_ is the set of all active independent stars.
88−voting per star. An _independent star_ is any star _not_ owned
89+voting per star. An _independent star_ is any star _not_ owned
8990by anyone who is either a senator, or has some connection to one
9091that would pose a conflict of interest.
9192
9293The congress of stars is designed to exercise project and
93−community governance. Its proceedings are in private. The
94+community governance. Its proceedings are in private. The
9495consuls convene it at their pleasure, and keep it informed.
9596
9697### Assembly
9798
9899The _assembly_ is the set of all active primary planets, voting
99−per planet. A _primary planet_ is the main planet of a unique
100+per planet. A _primary planet_ is the main planet of a unique
100101human (no sockpuppets).
101102
102−The assembly is responsible for technical governance. Its
103+The assembly is responsible for technical governance. Its
103104proceedings are in public.
104105
105106### The next constitution
106107
107108The congress proposes, and the senate approves, the next version
108−of this constitution. Future constitutions should be defined in
109+of this constitution. Future constitutions should be defined in
109110a smart contract platform, such as Ethereum.
110111
111112## Galaxy table
112113
113−95 galaxies are held by the [Tlon Corporation](https://tlon.io/). 50,
114−reserved for urbit.org, the future community foundation. 40, by
114+95 galaxies are held by the [Tlon Corporation](https://tlon.io/). 50,
115+reserved for urbit.org, the future community foundation. 40, by
115116Tlon employees and their family members (24 by Curtis, who
116−started in 2002; 16 by everyone else, who started in 2014). 34,
117−by outside investors in Tlon. 37, by 33 other individuals, who
117+started in 2002; 16 by everyone else, who started in 2014). 34,
118+by outside investors in Tlon. 37, by 33 other individuals, who
118119donated to the project, contributed code or services, won a
119120contest, or were just at the right place at the right time.
120121
@@ -134,7 +135,7 @@ intended as property of the republic, and will be used only in
134135the interests of the republic and Urbit as a whole.
135136
136137Externally, these galaxies are held by Tlon; internally, they are
137−managed and voted by Tlon. Once the republic acquires a legal
138+managed and voted by Tlon. Once the republic acquires a legal
138139identity and an independent human organization, Tlon pledges to
139140donate the `urbit.org` galaxies, the DNS domain, and the GitHub
140141`urbit` account to it.
content/blog/interplanetary_commerce.md+5−4
@@ -1,7 +1,8 @@
11+++
22title = "Interplanetary Commerce"
3−date = 2021-04-09
3+date = "2021-04-08"
44description = "OS-level commercial primitives."
5+
56[extra]
67author = "Christian Langalis"
78ship = "~pindet-timmut"
@@ -22,15 +23,15 @@ Things only accelerate from here. Our next objective, to integrate Lightning Net
2223
2324## Being Paid
2425
25−>And there is all the difference in the world between paying and being paid. The act of paying is perhaps the most uncomfortable infliction that the two orchard thieves entailed upon us. But being paid,—what will compare with it?
26+> And there is all the difference in the world between paying and being paid. The act of paying is perhaps the most uncomfortable infliction that the two orchard thieves entailed upon us. But being paid,—what will compare with it?
2627>
27−><cite>Herman Melville</cite>
28+> <cite>Herman Melville</cite>
2829
2930However, a good wallet is only half the equation for a holistic P2P commercial experience. Interfaces for selling goods and services is the other half. While we don’t part with our Bitcoin [easily](https://nakamotoinstitute.org/mempool/everyones-a-scammer/), two initial markets appear logical and attractive: content and Urbit-native services.
3031
3132First, digital cottage industry, the “creator economy”, is blossoming. Streaming, podcasting, and writing on platforms like Youtube, Patreon, and Substack has been big business [lately](https://otherlife.co/barbarians-past-the-gate/). What fintech did to “unbundle the banks", we will now do to media monopolies and their centralized distribution platforms. With the introduction of Urbit payments, you can syndicate, distribute, and monetize your media on Urbit. By selling access to a private group containing content, digital creatives can begin doing this today.
3233
33−Second, Urbit-native [service providers](https://urbit.org/blog/providers/) are now operating at scale. Companies offering Urbit hosting, onboarding, Urbit IDs, and software now communicate with their customers directly on the network. A basic set of commercial tools will make their processes more efficient. Storefront interfaces, paywalls, CRM, and reputation tools will replace the ad-hoc assemblages they currently use.
34+Second, Urbit-native [service providers](https://urbit.org/blog/providers/) are now operating at scale. Companies offering Urbit hosting, onboarding, Urbit IDs, and software now communicate with their customers directly on the network. A basic set of commercial tools will make their processes more efficient. Storefront interfaces, paywalls, CRM, and reputation tools will replace the ad-hoc assemblages they currently use.
3435
3536The Urbit Foundation is soliciting contributors to this project through Urbit Grants. If you’re interested in working on any of these components [send us a proposal](https://grants.urbit.org/create).
3637
content/blog/introducing-os1.md+4−3
@@ -1,11 +1,12 @@
11+++
22title = "Introducing OS 1"
3−date = 2020-04-30
3+date = "2020-04-29"
44description = "OS 1 is somewhere between ‘productivity software’ and a ‘social network’. We think it’s the beginning of an altogether new breed of social computing."
5+
56[extra]
67author = "Galen Wolfe-Pauly"
78ship = "~ravmel-ropdyl"
8−image ="https://media.urbit.org/site/posts/essays/intro-os1-landscape.png"
9+image = "https://media.urbit.org/site/posts/essays/intro-os1-landscape.png"
910+++
1011
1112<br>
@@ -110,7 +111,7 @@ OS 1 is a first step down the road back to a system that’s simple, durable, an
110111
111112One really critical thing about OS 1 is the pattern of ‘groups sharing modules’. This pattern makes it perfectly clear how a virtual computer can outcompete a bunch of different services. As the collection of modules in OS 1 → N grows, we make it easier for others to contribute modules, and we increase the flexibility of connecting modules our system quickly outruns the messy, disconnected world we’re currently stuck in.
112113
113−OS 1 isn’t mature enough to be *easy* for outside contributors to add modules — but it is [open source](https://github.com/urbit/urbit), and anyone is welcome to tinker and experiment with modifying it. We run a [grants program](https://grants.urbit.org/) to reward contributors for improving any part of Urbit OS. As the system matures we expect this program to expand and accelerate.
114+OS 1 isn’t mature enough to be _easy_ for outside contributors to add modules — but it is [open source](https://github.com/urbit/urbit), and anyone is welcome to tinker and experiment with modifying it. We run a [grants program](https://grants.urbit.org/) to reward contributors for improving any part of Urbit OS. As the system matures we expect this program to expand and accelerate.
114115
115116## Looking ahead
116117
content/blog/io-in-hoon.md+3−3
@@ -1,7 +1,8 @@
11+++
22title = "Input and Output in Hoon"
33description = "Let's talk about IO in Urbit."
4−date = 2020-12-16
4+date = "2020-12-15"
5+
56[extra]
67author = "Philip Monk"
78ship = "~wicdev-wisryt"
@@ -14,7 +15,6 @@ image = "https://media.urbit.org/site/posts/essays/zion-canyon-1.jpg"
1415
1516<br>
1617
17−
1818Let's talk about IO in Urbit. I won't say much about how events and effects are processed by the runtime; it suffices to note that the runtime is a normal Unix program which (1) listens for various events, (2) passes them to Arvo (Urbit OS), and (3) processes the effects produced by Arvo. Instead, I’ll focus on how IO works from the perspective of Hoon programs, like Arvo or apps running on Arvo. But first, let's review IO paradigms in other languages.
1919
2020All examples are in a made-up language, since it's useful to understand this information even before you're comfortable in Hoon. If you're learning Hoon and want a challenge, try translating them!
@@ -35,7 +35,7 @@ For readability, intermediate variables would be a good idea, but nothing stops
3535
3636### Monadic IO
3737
38−Languages that use explicit monads for IO (such as Haskell) perform IO by running IO behind a bind operation, which I'll notate with `<-`. Thus, while you can't put IO *anywhere*, the general structure is a sequence of IO operations.
38+Languages that use explicit monads for IO (such as Haskell) perform IO by running IO behind a bind operation, which I'll notate with `<-`. Thus, while you can't put IO _anywhere_, the general structure is a sequence of IO operations.
3939
4040 fileName <- cliInput()
4141 url <- readFile(fileName)
content/blog/iot.md+4−3
@@ -1,7 +1,8 @@
11+++
22title = "Lunar Urbit and the Internet of Things"
3−date = 2021-04-30
3+date = "2021-04-29"
44description = "Potential future use cases of moons for industry and consumers"
5+
56[extra]
67author = "Jonathan Paprocki"
78ship = "~datnut-pollen"
@@ -441,8 +442,8 @@ microtransactions. On Mars, this task will be trivial, and is merely a stone's
441442throw away from a vast and undiscovered universe of other possibilities unlocked
442443by SSI networks.
443444
444−
445−[^0]: Of course, all moon names have four words, not three. What the fourth word
445+[^0]:
446+ Of course, all moon names have four words, not three. What the fourth word
446447 needs to be for only three words to display is a matter of Urbit lore that
447448 is more fun to discover yourself than have it told to you, so we won't spoil
448449 it here.
content/blog/landscape-a-portrait.md+10−6
@@ -1,8 +1,12 @@
11+++
22title = "Landscape: A Portrait"
3−date = 2019-09-03
3+date = "2019-09-02"
44description = "On the latest Urbit user interface, and the interfaces to come."
5−aliases = ["/posts/essays/landscape-a-portrait/", "/posts/landscape-a-portrait"]
5+aliases = [
6+ "/posts/essays/landscape-a-portrait/",
7+ "/posts/landscape-a-portrait"
8+]
9+
610[extra]
711author = "Matilde Park"
812ship = "~haddef-sigwen"
@@ -28,7 +32,7 @@ Urbit has been in “research mode” for most of its history, but the system ha
2832
2933Urbit’s kernel is graduating from its rebellious period, however its _userspace_ has remained embryonic for most of its history. The project of building an application model has been restarted and rescoped into _aspects_ that could weather the chaotic growth of the kernel, but it would never quite serve as an interface to the entire operating system. Due to one of our latest vane refactors, it’s becoming possible to start that work in earnest.
3034
31−Alongside the latest release of Landscape came the rewrite of the [`%eyre`](https://urbit.org/docs/learn/arvo/eyre/) vane, which serves a ship’s files and applications over HTTP. Among the improvements came the decision to move from serving from one ‘/web’ folder by default to an application-specific endpoint.
35+Alongside the latest release of Landscape came the rewrite of the [`%eyre`](https://urbit.org/docs/learn/arvo/eyre/) vane, which serves a ship’s files and applications over HTTP. Among the improvements came the decision to move from serving from one ‘/web’ folder by default to an application-specific endpoint.
3236
3337That is, a Hoon application, upon being started, now tells Eyre it wants to serve _these files_ at _this endpoint_ over HTTP and Eyre facilitates that.
3438
@@ -50,9 +54,9 @@ All of this is fantastic news; and while Landscape-oriented userspace developmen
5054
5155Among the inspirations for our team are [the tales of Andy Hertzfeld](https://www.folklore.org/StoryView.py?project=Macintosh&story=Were_Not_Hackers!.txt), working on the Macintosh, and ongoing [discussions](http://doc.cat-v.org/plan_9/4th_edition/papers/812/) and [decisions](https://research.swtch.com/help.pdf) that went into Plan 9 from Bell Labs. (Sometimes, for fun, we also watch videos about [the Xerox Alto](https://www.youtube.com/watch?v=tngrLvyiNEI).)
5256
53−These inspirations share that their creators were dealing with really primordial stuff – the font of human-computer interface had really just sprung and they were _seeing things no one had seen before_ because they _had to_.
57+These inspirations share that their creators were dealing with really primordial stuff – the font of human-computer interface had really just sprung and they were _seeing things no one had seen before_ because they _had to_.
5458
55−Doing that now, after a lifetime of reflexive familiarity with the dominant solutions – from Apple’s macOS to Google’s Material Design – we have to do the work of _unseeing_. By engaging with what it was like to see for the first time, we get closer to seeing with fresh eyes. We work to avoid implicitly categorising the new territory as simply, well, comparative to the old one.
59+Doing that now, after a lifetime of reflexive familiarity with the dominant solutions – from Apple’s macOS to Google’s Material Design – we have to do the work of _unseeing_. By engaging with what it was like to see for the first time, we get closer to seeing with fresh eyes. We work to avoid implicitly categorising the new territory as simply, well, comparative to the old one.
5660
5761So, while it’s not the same to simply _read_ these dialogues, it can get us pretty close.
5862
@@ -66,7 +70,7 @@ So what do we think that new platform needs from its interface?
6670
6771- **Landscape, and all of Urbit’s future interfaces, need a way to easily organise around _cohorts_ of ships, or _groups_,** with shared applications or files and a socially-oriented computing experience in turn — [something always in the vision](https://urbit.org/posts/azimuth-is-on-chain/#aegean), but not quite implemented yet.
6872
69−- Lastly, **Landscape, and all of Urbit’s future interfaces, need a userspace-specific, software design pattern** to integrate all of this: access to the file system, permissioning shared sets of files, and tying it together, an underlying representation of both data and interface amongst many computers.
73+- Lastly, **Landscape, and all of Urbit’s future interfaces, need a userspace-specific, software design pattern** to integrate all of this: access to the file system, permissioning shared sets of files, and tying it together, an underlying representation of both data and interface amongst many computers.
7074
7175No more siloed input/output in applications on a ‘timeshared computer’ with your redundant data always belonging to someone else.
7276
content/blog/magic.md+87−86
@@ -1,8 +1,9 @@
11+++
22title = "Magic"
3−date = 2016-05-16
3+date = "2016-05-15"
44description = "A thought-experiment to explain the Urbit user experience."
5−aliases = ["/posts/essays/magic", "/posts/magic"]
5+aliases = [ "/posts/essays/magic", "/posts/magic" ]
6+
67[extra]
78author = "Curtis Yarvin"
89ship = "~sorreg-namtyv"
@@ -11,186 +12,186 @@ image = "https://storage.googleapis.com/media.urbit.org/site/posts/essays/magic.
1112
1213![](https://storage.googleapis.com/media.urbit.org/site/posts/essays/magic.jpg)
1314
14−It's easy to get too obsessed with Urbit's alien technology. We
15−didn't build Urbit for its tech. We built it for people to use.
15+It's easy to get too obsessed with Urbit's alien technology. We
16+didn't build Urbit for its tech. We built it for people to use.
1617
1718It's also hard to understand the power of Urbit, because it's
18−still quite immature. Unless you understand it already, it's
19+still quite immature. Unless you understand it already, it's
1920just a weird OS that doesn't work all that well.
2021
2122And this OS is supposedly designed as a new kind of product: a
22−personal server. What is a personal server? If you had one,
23−you'd know. Since you don't, you don't. So both your problem
23+personal server. What is a personal server? If you had one,
24+you'd know. Since you don't, you don't. So both your problem
2425and our solution are totally unclear.
2526
2627One way to understand Urbit is to forget the technology totally.
27−Instead, let's build the same product out of magic. Technology
28−is hard and imperfect and slow. Magic is easy and perfect and
29−fast. Why not use it? At least for a demo?
28+Instead, let's build the same product out of magic. Technology
29+is hard and imperfect and slow. Magic is easy and perfect and
30+fast. Why not use it? At least for a demo?
3031
3132## Magic step one: total integration.
3233
3334Make a list of all the cloud apps which have your personal data.
34−OK, just imagine making a list. OK, use magic.
35+OK, just imagine making a list. OK, use magic.
3536
36−By magic, we make some giant company buy all these apps. It
37−could be any of them, but let's say it's Facebook. Facebook buys
38−_all the apps_. As of now, _all your cloud computing happens in
37+By magic, we make some giant company buy all these apps. It
38+could be any of them, but let's say it's Facebook. Facebook buys
39+_all the apps_. As of now, _all your cloud computing happens in
3940your Facebook profile_.
4041
4142Your Facebook is now your Dropbox and your Evernote and your
42−Wordpress and your Gmail. And it's not just Web apps; all your
43−servers move to Facebook. Your Nest talks to a Facebook server.
44−Your iPhone talks to Facebook instead of iCloud. Your Fitbit
45−records your heart rate in a Facebook log. Your Facebook
46−manages your finances and pays your bills. Got bitcoin?
47−Facebook is your wallet. Shop online? Check out the Facebook
43+Wordpress and your Gmail. And it's not just Web apps; all your
44+servers move to Facebook. Your Nest talks to a Facebook server.
45+Your iPhone talks to Facebook instead of iCloud. Your Fitbit
46+records your heart rate in a Facebook log. Your Facebook
47+manages your finances and pays your bills. Got bitcoin?
48+Facebook is your wallet. Shop online? Check out the Facebook
4849Store -- it sells everything!
4950
50−In short, you can just lock your browser to `facebook.com`. The
51−Web is dead. Or more precisely, it's an obsolete protocol which
51+In short, you can just lock your browser to `facebook.com`. The
52+Web is dead. Or more precisely, it's an obsolete protocol which
5253you use to log in to Facebook.
5354
54−Does this sound creepy? Sure. It's incredibly creepy. But look
55−on the bright side: it's also incredibly convenient. (And
55+Does this sound creepy? Sure. It's incredibly creepy. But look
56+on the bright side: it's also incredibly convenient. (And
5657incredibly secure, at least with a 2-factor key.)
5758
58−For the first time ever, _all your data is in one place_. For
59+For the first time ever, _all your data is in one place_. For
5960example, the engineers at Facebook, who are awesome, would never
6061leave Dropbox, Instagram and iCloud as three separate things.
61−You don't need an "integration" between them. Your profile is
62−one thing: you. Your entire digital life.
62+You don't need an "integration" between them. Your profile is
63+one thing: you. Your entire digital life.
6364
6465(In fact, if you're a geek and have Unix boxes, your Facebook is
65−magically integrated with Unix. You can just open your laptop
66+magically integrated with Unix. You can just open your laptop
6667and type `ls /photos/2016/May/` -- as if your digital life was a
6768chip in a box in your backpack, not redundant servers in multiple
6869secure data centers.)
6970
7071Imagine we all lived in hotels, all the time, even in just one
71−city. Imagine you don't even have one room with a long-term
72−lease. You sleep in one pod Mondays, another on Tuesdays...
73−then, someone offers you a home. Your own house. With your own
72+city. Imagine you don't even have one room with a long-term
73+lease. You sleep in one pod Mondays, another on Tuesdays...
74+then, someone offers you a home. Your own house. With your own
7475furniture, your own books in your own bookcases...
7576
7677## Magic step two: free your data.
7778
78−The good news is, you get your own house. The bad news is, it's
79+The good news is, you get your own house. The bad news is, it's
7980in North Korea.
8081
81−Having your whole life owned by Facebook is still creepy. Or so
82−most people would think. It's not actually clear that it's more
82+Having your whole life owned by Facebook is still creepy. Or so
83+most people would think. It's not actually clear that it's more
8384creepy to be owned by one corporation, than nine corporations.
8485But it _feels_ creepier.
8586
86−By magic, Facebook cares. So it decides to free you. Actually,
87−Facebook's business is owning you. So freedom will destroy its
88−business. But magically, Facebook doesn't mind.
87+By magic, Facebook cares. So it decides to free you. Actually,
88+Facebook's business is owning you. So freedom will destroy its
89+business. But magically, Facebook doesn't mind.
8990
9091Right now, the software behind your Facebook experience is a
91−million lines of Facebook goo. It solves your problems and shows
92+million lines of Facebook goo. It solves your problems and shows
9293your ads and does whatever the heck it wants with your data.
93−(Not that it's "your" data. It's Facebook's data, about you.)
94+(Not that it's "your" data. It's Facebook's data, about you.)
9495
9596Without changing the functionality of your Facebook experience,
9697Facebook replaces every component of this goo with an "agent."
97−(You have about as many agents as you used to have apps.) If you
98−don't care about being free, you won't notice the change. If you
98+(You have about as many agents as you used to have apps.) If you
99+don't care about being free, you won't notice the change. If you
99100do care, everything changes.
100101
101−One, you don't have to run Facebook's agents. You can replace
102−them with anyone else's software, free or paid. Agents upgrade
102+One, you don't have to run Facebook's agents. You can replace
103+them with anyone else's software, free or paid. Agents upgrade
103104themselves automatically, but you are never locked in; you can
104105always switch agents and/or vendors without damaging your data.
105106
106−Don't like your email UI? Change it. Don't like to see ads?
107+Don't like your email UI? Change it. Don't like to see ads?
107108You no longer see any ads -- why would someone use an agent that
108−showed them ads? Ick. Unless it's something ridiculously
109+showed them ads? Ick. Unless it's something ridiculously
109110specialized, an agent is either free software or costs $3.99.
110111
111−Two, agents _act as you_. Facebook is no longer the Panopticon.
112+Two, agents _act as you_. Facebook is no longer the Panopticon.
112113It is not a giant mainframe where all the code can access all the
113−data. An agent can use as much of your own data as you give it;
114−it cannot use anyone else's data. At least not without asking.
114+data. An agent can use as much of your own data as you give it;
115+it cannot use anyone else's data. At least not without asking.
115116
116−When anyone can write an agent, only code can be law. Privacy is
117+When anyone can write an agent, only code can be law. Privacy is
117118no longer enforced by the informal decisions of Facebook product
118−managers. It must be enforced by formal security policies.
119+managers. It must be enforced by formal security policies.
119120
120121This might constrict the services Facebook can offer, but only a
121−little. Since privacy is a human universal, apps that don't
122−respect it (for instance, image face tagging) feel weird. A
122+little. Since privacy is a human universal, apps that don't
123+respect it (for instance, image face tagging) feel weird. A
123124service like this can't be broken up into personal agents; it
124−still requires a Big Data mainframe somewhere. But it's okay;
125+still requires a Big Data mainframe somewhere. But it's okay;
125126the agents can still talk to it.
126127
127128For the most part, Big Data (everyone's) has become little data
128−(yours). You no longer have a Facebook profile -- a fancy UI
129+(yours). You no longer have a Facebook profile -- a fancy UI
129130backed by a million lines of Facebook goo on one big mainframe.
130−Now what you have is a Facebook _server_: a real computer. Or at
131+Now what you have is a Facebook _server_: a real computer. Or at
131132least, a virtual computer (which is much more reliable than any
132133one physical computer).
133134
134−Is this computer hard to manage? You have the same basic job as
135−someone who owns an iPhone: deciding what software to run. If
135+Is this computer hard to manage? You have the same basic job as
136+someone who owns an iPhone: deciding what software to run. If
136137you skip this job, your iPhone or your Facebook is still pretty
137−useful. You also need to decide what data to keep. An iPhone
138+useful. You also need to decide what data to keep. An iPhone
138139has finite, free storage; the cloud has infinite, non-free
139−storage. You still want a warning when your server gets fat.
140+storage. You still want a warning when your server gets fat.
140141But at least it keeps working.
141142
142143## Magic step three: free your server.
143144
144−This agent-oriented Facebook can't show you ads. But this is not
145−actually a huge business problem. Since Facebook owns everyone's
146−life, it has the mother of all monopoly lockins. It can just
147−bill you $9.99 a month for running your Facebook server. This is
145+This agent-oriented Facebook can't show you ads. But this is not
146+actually a huge business problem. Since Facebook owns everyone's
147+life, it has the mother of all monopoly lockins. It can just
148+bill you $9.99 a month for running your Facebook server. This is
148149a great deal, for you and for Facebook.
149150
150−But you're still a slave, Neo. A Facebook server still isn't a
151−personal server. Monopolies suck.
151+But you're still a slave, Neo. A Facebook server still isn't a
152+personal server. Monopolies suck.
152153
153−Magic works, so Facebook feels guilty. It goes all the way
154+Magic works, so Facebook feels guilty. It goes all the way
154155toward freeing you, and ruins its own business.
155156
156157Now, your server is just a big file whose format is precisely
157−defined. You can move it to any hosting service, or even run it
158−on a home PC. Since hosting is now a commodity, it costs almost
159−nothing and has zero profit margin. It may even come bundled
158+defined. You can move it to any hosting service, or even run it
159+on a home PC. Since hosting is now a commodity, it costs almost
160+nothing and has zero profit margin. It may even come bundled
160161with your Internet service.
161162
162−Every data center is owned by the local government. If you have
163−data to hide from the authorities, compute at home. Most people
163+Every data center is owned by the local government. If you have
164+data to hide from the authorities, compute at home. Most people
164165don't have anything to hide and should run in the cloud, because
165−the cloud works better. But using the _same platform_ as those
166−who do have something to hide creates "herd immunity". You don't
166+the cloud works better. But using the _same platform_ as those
167+who do have something to hide creates "herd immunity". You don't
167168have to choose between a secure platform with no network effect,
168169and a non-secure platform that everyone else uses.
169170
170171## Magic step four: free your name.
171172
172−Freeing your server also means freeing your identity. It's no
173−longer true that Facebook decides who you are. Facebook just
174−wrote the algorithm. Your server contains cryptographic secrets
175−that control your identity. If your identity was a bitcoin, your
173+Freeing your server also means freeing your identity. It's no
174+longer true that Facebook decides who you are. Facebook just
175+wrote the algorithm. Your server contains cryptographic secrets
176+that control your identity. If your identity was a bitcoin, your
176177server would be a giant bitcoin wallet.
177178
178−The bad news: lose the file, lose the identity. The good news:
179−your server is genuinely personal now. It's yours in every way.
179+The bad news: lose the file, lose the identity. The good news:
180+your server is genuinely personal now. It's yours in every way.
180181It's so personal that if you destroy it, it's gone.
181182
182−Facebook doesn't even keep its power to create new servers. The
183+Facebook doesn't even keep its power to create new servers. The
183184"real name" policy has done great things to control spam, because
184−spam always depends on disposable accounts. But it implies a
185+spam always depends on disposable accounts. But it implies a
185186central authority.
186187
187188Instead, Facebook borrows an idea from bitcoin and just limits
188−the number of identities. If you need one, you have to buy one.
189+the number of identities. If you need one, you have to buy one.
189190They don't cost that much; just enough to deter spammers.
190191
191−(Is your real name still linked to your identity? Maybe, maybe
192−not. There's a role for name validation, but not everyone needs
193−to have a real name, and not everyone else needs to know it. A
192+(Is your real name still linked to your identity? Maybe, maybe
193+not. There's a role for name validation, but not everyone needs
194+to have a real name, and not everyone else needs to know it. A
194195dissident, or anyone who wants to speak out and let the words
195196speak for themselves, might want a second anonymous identity.
196197But sock puppets remain evil -- two names for the same person
@@ -200,5 +201,5 @@ should not interact in the same place.)
200201
201202And, with magic, we've succeeded in turning Facebook into Urbit.
202203Technically, Urbit is pretty close to magic, but there is no way
203−it's going to happen this way. See the [roadmap](/blog/roadmap) for how it
204+it's going to happen this way. See the [roadmap](/blog/roadmap) for how it
204205actually happens.
content/blog/metaphase.md+2−1
@@ -1,7 +1,8 @@
11+++
22title = "Metaphase"
3−date = 2020-12-09
3+date = "2020-12-08"
44description = "On the upcoming and foregoing Landscape lifecycles, and other forms of mitosis across the Urbit project."
5+
56[extra]
67author = "Matilde Park"
78ship = "~haddef-sigwen"
content/blog/on-christopher-alexander.md+2−1
@@ -1,7 +1,8 @@
11+++
22title = "On Christopher Alexander"
3−date = 2021-07-20
3+date = "2021-07-19"
44description = "An overview of his writing and relevance"
5+
56[extra]
67author = "Matt"
78ship = "~tirwyd-sarmes"
content/blog/pki-maze.md+4−8
@@ -1,7 +1,8 @@
11+++
22title = "Designing a Permanent Personal Identity"
3−date = 2019-11-27
3+date = "2019-11-26"
44description = "A public key infrastructure (PKI) is a system for binding a set of keys to a name. Sometimes a small amount of metadata is included."
5+
56[extra]
67author = "Philip Monk"
78ship = "~wicdev-wisryt"
@@ -40,7 +41,7 @@ However, Urbit is yours and it's forever. Trusting central registries jeopardize
4041
4142Some argue that blockchain is only good for money. This is myopic and is generally based on the experience that its most valuable application so far has been money. However, blockchain is a cryptographic primitive to do what was previously impossible: prove that one message was signed before another without a central party. Blockchain was discovered by someone trying to create digital money, and he needed that primitive, but that doesn't mean that's all it's good for.
4243
43−Thus, we store our PKI data on a blockchain for our second kind of name: planets. A planet is a 32-bit address which has key information stored on the blockchain.[^2] The owner of a planet may broadcast new PKI data by adding it to the blockchain. Any later messages by the old keys will be rejected, and everyone on the network will listen to the blockchain for key data. Thus, we have global consistency, permanence, and self sovereignty. We know of no other solution that can provide these properties.
44+Thus, we store our PKI data on a blockchain for our second kind of name: planets. A planet is a 32-bit address which has key information stored on the blockchain.[^2] The owner of a planet may broadcast new PKI data by adding it to the blockchain. Any later messages by the old keys will be rejected, and everyone on the network will listen to the blockchain for key data. Thus, we have global consistency, permanence, and self sovereignty. We know of no other solution that can provide these properties.
4445
4546However, while small individually, the aggregate PKI data for all nodes on the network may become very large. This is not an issue for comets because nobody needs to store comet keys except for those which they're talking with, and even those can be garbage-collected and re-requested and verified. For planets, there is a canonical set of keys, and somebody must store that. There are about 2<sup>32</sup>, or 4 billion planets. If the PKI data is about 100 bytes for each planet, this is about 400 GB of data. This may be more than most users wish to store, but it's small enough that it would be very cheap for someone to host this data for many users[^3].
4647
@@ -62,13 +63,8 @@ To create a sane network, we require global consistency for all our names. There
6263
6364Fancifully, comets are wayward celestial bodies that are great for testing and miscellaneous low-value things that won't last for long. Planets are where you can build a home and shape it into anything you want it to be. People can always find your planet; it's not going anywhere. Moons are useful for special purposes, like storage, heavy industry, and anything else you might want to do off-planet.[^4]
6465
65−
6666[^0]: Or the equivalent with a hierarchical key structure. In practice, you want to have a master key which signs a junior key for everyday use. You use the master key to rotate the junior key.
67−
6867[^1]: More strictly: it proves that he didn't mine it after the other blocks currently on the Bitcoin blockchain. It only gives an ordering within the chain, not a literal timestamp.
69−
7068[^2]: In addition to planets, there are stars and galaxies. From a PKI perspective they're treated exactly like planets, but on the network they provide infrastructure services like routing.
71−
7269[^3]: In practice, this will likely be an included service by your sponsoring star. It could be a separate service, but it will be very cheap because it's a commodity and the "cost of production" is very cheap. At any rate, it should never rise above the capital cost of a 400GB hard drive.
73−
74−[^4]: To extend the metaphor, stars are a neighborhood to live in -- they're easier for other planets to see, so when they want to send you a message they look for your star first. If they don't even know where your star is, they can certainly find your star's galaxy, and that will be enough to locate the star. Of course, if your star is not providing satisfactory service, you can take your planet and move to another star.
70+[^4]: To extend the metaphor, stars are a neighborhood to live in -- they're easier for other planets to see, so when they want to send you a message they look for your star first. If they don't even know where your star is, they can certainly find your star's galaxy, and that will be enough to locate the star. Of course, if your star is not providing satisfactory service, you can take your planet and move to another star.
content/blog/platform-decay.md+4−3
@@ -1,11 +1,12 @@
11+++
22title = "Platform Decay, Decentralized Marketplaces, and Urbit"
3−date = 2020-05-08
3+date = "2020-05-07"
44description = "Urbit is calm computing. Calm commerce follows naturally. "
5+
56[extra]
67author = "Nicholas Simmons"
78ship = "~simfur-ritwed"
8−image ="https://media.urbit.org/site/posts/essays/platform-decay-preview.png"
9+image = "https://media.urbit.org/site/posts/essays/platform-decay-preview.png"
910+++
1011
1112<br>
@@ -36,7 +37,7 @@ Even more subtle and worrying effects come when e-commerce platforms realize tha
3637
3738The manufacturing of consumer desire in this way feels creepy. It’s frustrating to have your tastes dictated to you by whoever has the biggest ad spend. It also spells the end of small business on the Internet—you can spend years mastering knowledge of a profitable niche, but if Amazon profiles your customers and decides they’re more likely to spend their money on the latest Pixar DVD, your listings will be shoved below the fold. Pixar paid for placement and you didn’t; the Pixar ad placement deal made a splash in the quarterly report, your fees didn’t. In cultural terms, this threatens to create a winner-take-all situation that will prevent new and niche artists and thinkers from gaining attention at the expense of explicitly placed, ‘premium’ content.
3839
39−Again, this is all accelerated by the way that ad sales function; platforms like broadly popular content and products because the larger number of customers searching for and purchasing them creates more granular data and increased opportunities for micro-targeting ads. This incentive leads to the increasing invisibility of long-tail, niche content or products whose appeal has less to do with lowest-common-denominator addictive virality, whether it’s the repair manual for your ‘85 Toyota or a copy of Plato’s *Republic*. It also accelerates the stampede toward a ‘sharing’ and ‘renting’ economy; when ad impressions are a sizable part of company revenue, forcing customers to return to ad-infested platforms to continue renting objects or content, rather than making one-time purchases, is a no-brainer.
40+Again, this is all accelerated by the way that ad sales function; platforms like broadly popular content and products because the larger number of customers searching for and purchasing them creates more granular data and increased opportunities for micro-targeting ads. This incentive leads to the increasing invisibility of long-tail, niche content or products whose appeal has less to do with lowest-common-denominator addictive virality, whether it’s the repair manual for your ‘85 Toyota or a copy of Plato’s _Republic_. It also accelerates the stampede toward a ‘sharing’ and ‘renting’ economy; when ad impressions are a sizable part of company revenue, forcing customers to return to ad-infested platforms to continue renting objects or content, rather than making one-time purchases, is a no-brainer.
4041
4142There’s a nightmare scenario here, a kind of hybrid, zombie brainchild of Jean Baudrillard’s concerns about the simulation of common meaning and Peter Thiel’s arguments about the stealthy hollowing-out of industrial capacity. In this nightmare future, financial and legal regulation strangle the viability of anything like a real industry, and we’re left with a handful of incumbent platforms which have concluded that the smartest move is to just sell vaporware ‘content,’ collectible bobbleheads, and sugar water. The supposed niche of any platform business is academic at this level; Amazon, Spotify, and Patreon are simply machines for converting user attention into the highest-margin purchases possible. The ‘high-velocity trash economy’ (h/t Pierre Rochard) increasingly shows itself as a network of funnels by which insider prognostications about government and central bank policy are turned into profits, with the illusion of productive activity serving only as window dressing. This deforming process extends all the way down to the vagaries of the consumer economy. If there is no financial reason for available consumer offerings to be anything we actually need, they can and will be deprecated and displaced; useful goods and services will be sidelined by literal trash that has the ‘financial’ logic of maintaining an unbroken, upward metric by virtue of direct parasitism upon the human brainstem.
4243
content/blog/precepts-discussion.md+48−46
@@ -1,11 +1,12 @@
11+++
22title = "Precepts: Discussion"
3−date = 2020-03-18
3+date = "2020-03-17"
44description = "The precepts aren’t arguments. We discuss and justify them here."
5+
56[extra]
67author = "Philip Monk"
78ship = "~wicdev-wisryt"
8−image ="https://media.urbit.org/site/posts/essays/discuss-01.jpg"
9+image = "https://media.urbit.org/site/posts/essays/discuss-01.jpg"
910+++
1011
1112<br>
@@ -86,7 +87,7 @@ Some examples of things that are objectively quite simple but subjectively hard
8687 more obvious in retrospect than it does on first glance.
8788
8889- Any language that induces a moment where you exclaim to yourself,
89− "This is true programming! Everyone should program this way, it's so
90+ "This is true programming! Everyone should program this way, it's so
9091 obviously better!". People say that often about Lisp, Haskell,
9192 Prolog, and Smalltalk. Nobody ever said that about C, Java,
9293 Javascript, or Python. And yet, which ones are easier to learn?
@@ -240,7 +241,7 @@ strong guarantees on top of something with weak guarantees — for
240241example, delivery guarantees on top of an unreliable transport protocol.
241242In that case, you are sure of the underlying system, it's just that what
242243you're sure of is that you can't rely on it delivering packets in order
243−or at all. So, you formalize what you *are* sure of, which is that it
244+or at all. So, you formalize what you _are_ sure of, which is that it
244245will eventually get your packets through if you keep sending them
245246forever. And that's something you can build on.
246247
@@ -364,7 +365,7 @@ There are some principles that aren't obviously better than the alternatives, bu
364365
365366> B1: Always ack a dupe; never ack an ack.
366367>
367−> It's okay to ack a nack as long as you never nack a nack.
368+> It's okay to ack a nack as long as you never nack a nack.
368369
369370This is a simple rule, and if you follow it you get various guarantees for free. For example, sending a message will always cause up to a constant number of additional messages to be sent by direct or indirect causality (other than application-level code), so you never have to worry about accidentally causing a loop.
370371
@@ -423,21 +424,21 @@ Better to define rules in a more powerful language. This allows you to follow A6
423424Good code is the result of people approaching the act of engineering with the right attitude.
424425
425426> C1: Code courageously.
426−
427− If you avoid changing a section of code for fear of awakening the
428− demons therein, you are living in fear. If you stay in the
429− comfortable confines of the small section of the code you wrote or
430− know well, you will never write legendary code. All code was
431− written by humans and can be mastered by humans.
432−
433− It's natural to feel fear of code; however, you must act as though
434− you are able to master and change any part of it. To code
435− courageously is to walk into any abyss, bring light, and make it
436− right.
427+
428+If you avoid changing a section of code for fear of awakening the
429+demons therein, you are living in fear. If you stay in the
430+comfortable confines of the small section of the code you wrote or
431+know well, you will never write legendary code. All code was
432+written by humans and can be mastered by humans.
433+
434+It's natural to feel fear of code; however, you must act as though
435+you are able to master and change any part of it. To code
436+courageously is to walk into any abyss, bring light, and make it
437+right.
437438
438439The unix/internet stack is a giant ball of mud. It's so big that when you're standing on it, it looks like a bog, and it's not clear that there is a bottom to it. You know there must be, but it doesn't matter because you learned long ago that the best solution is to not dig too deep. Build a strong structure by spreading out your weight and using strong construction materials. If there's something useful deep in the mud, it's probably not worth diving in to pull it out. That's dangerous and prone to failure, and you know many people who have gotten stuck down there.
439440
440−This is an appropriate reaction to the unix/internet stack. It's also self-perpetuating. The bog is filled — even *composed* of — countless predecessors who did that same thing. If you ever find yourself on solid ground, protect that with your life. Learn how it works and how to use it well. Then build a strong structure on top of that. Don't let it decompose into a layer of mud.
441+This is an appropriate reaction to the unix/internet stack. It's also self-perpetuating. The bog is filled — even _composed_ of — countless predecessors who did that same thing. If you ever find yourself on solid ground, protect that with your life. Learn how it works and how to use it well. Then build a strong structure on top of that. Don't let it decompose into a layer of mud.
441442
442443Urbit is small enough that, while there's definitely some construction-related dirt and muck covering it, the solid metallic core is not very deep — not more than waist deep in most places. The feeling of always being in contact with the bottom is very different than flailing about in a bog.
443444
@@ -451,11 +452,11 @@ follow conventions, and fire anyone who won't. Anything that can
451452be solved by discipline is not a real problem.
452453
453454> "To him who knows to do good and does not do it, to him it is
454−sin."
455+> sin."
455456
456457Preserving the property of solid ground requires perpetual discipline. Once lost, it's often impossible to reacquire. Don't compromise your standards.
457458
458−Call people out when they're being lazy. And when someone calls you out, recognize it and fix it. Sometimes it's just a question on a code review — "why did you do it this way?" Upon reflection, you determine that you did it that way because you couldn't be bothered to do it right. Maybe that was a reasonable choice at the time you were coding so you wouldn't be distracted, but if it's been called out in a code review, now's the time to fix it, not make excuses.
459+Call people out when they're being lazy. And when someone calls you out, recognize it and fix it. Sometimes it's just a question on a code review — "why did you do it this way?" Upon reflection, you determine that you did it that way because you couldn't be bothered to do it right. Maybe that was a reasonable choice at the time you were coding so you wouldn't be distracted, but if it's been called out in a code review, now's the time to fix it, not make excuses.
459460
460461> C3: When a smart person makes an obviously stupid suggestion, before
461462> responding take a full 60 seconds to envision how you would implement
@@ -464,7 +465,7 @@ Call people out when they're being lazy. And when someone calls you out, recogni
464465Once you've determined that someone understands a situation well, if they earnestly make a suggestion that you haven't thought of, or that you immediately dismissed as impractical, stop and consciously consider it. This is one of the best ways of countering the natural echo chamber
465466of your own mind.
466467
467−This is also one of the best ways to build stuff correctly. Very often, you will be tempted to cut a corner, and someone will point out that it should be done correctly. You should consider why you immediately rejected it. Was it because you were afraid of the relevant piece of code? If so, you should learn more about that code to determine if it's actually a good idea. Did you reject it because you felt it would distract you from working on what you thought was more important?
468+This is also one of the best ways to build stuff correctly. Very often, you will be tempted to cut a corner, and someone will point out that it should be done correctly. You should consider why you immediately rejected it. Was it because you were afraid of the relevant piece of code? If so, you should learn more about that code to determine if it's actually a good idea. Did you reject it because you felt it would distract you from working on what you thought was more important?
468469Consider carefully whether this particular piece of technical debt is worth taking on. It's worth 60 seconds of thinking about how you could solve it correctly right now — often it would be quite easy to do correctly and you'd be paying interest on the incorrectness for a long time.
469470
470471<br>
@@ -541,7 +542,7 @@ Some of these are strongly affected by workflows. We can't force a developer to
541542
542543One of the primary inputs to code navigability is how much of it you can have on your screen. Code that is too wide limits the number of columns of code. Some people keep only one column on their screen, so they don't see a problem with long lines of code. The most efficient navigation is to already be there (i.e. to only have to move your eyes). If you only have one column of code open, you can only be in one place, which eliminates the best form of navigation.
543544
544−Dually, code that is too narrow limits the number of lines you can have on a screen (this isn't a separate precept simply because we've never had to tell someone to write *wider* code). This suggests there is some happy medium. This is dependent on the language, but in Hoon we've
545+Dually, code that is too narrow limits the number of lines you can have on a screen (this isn't a separate precept simply because we've never had to tell someone to write _wider_ code). This suggests there is some happy medium. This is dependent on the language, but in Hoon we've
545546found that up to 55 columns is a pretty good number for most code. However, there are plenty of legitimate reasons to go a bit longer than that. 70 columns is rare, but not surprising. There is essentially never a reason to extend beyond 80 columns.
546547
547548> E2: Tabs aren't real.
@@ -553,6 +554,7 @@ There can be good reason for inconsistency in some areas, but not in
553554code formatting, which is such an intensely communicative action.
554555
555556> E3: A text file is a series of lines, each ending with a newline
557+
556558 character.
557559
558560There are several competing definitions of text files, but most commonly-used software uses this one. It's simple and consistent.
@@ -581,9 +583,9 @@ However, cache invalidation and naming things are genuinely hard because they mu
581583context.
582584
583585You shouldn't solve hard problems if you don't need to, so don't name anything you don't have to. Giving unique names to things is tiring, and it reduces readability. A consistent pattern for naming things makes it easy to keep track of what is what and reduces the number of
584−decisions you must make.
586+decisions you must make.
585587
586−Examples:
588+Examples:
587589
588590- If the only difference between three things is that they're not the
589591 same, consider naming them `thing-1`, `thing-2`, and `thing-3`.
@@ -632,43 +634,43 @@ This is the most important passage in all that has ever been written
632634about Urbit:
633635
634636> What is Martian code actually like? There are two possibilities.
635−>
637+>
636638> One: since Earth code is fifty years old, and Martian code is fifty
637639> million years old, Martian code has been evolving into a big ball of mud
638640> for a million times longer than Earth software. (And two million times
639641> longer than Windows.)
640−>
641−> This hypothesis strikes me as possible, but implausible. Since the *big
642−> ball of mud* expands indefinitely, Martian code would therefore be so
642+>
643+> This hypothesis strikes me as possible, but implausible. Since the _big
644+> ball of mud_ expands indefinitely, Martian code would therefore be so
643645> large and horrible that, despite its underground installed base, the
644646> server room bulged into space like a termite mound, intercepting
645647> low-flying asteroids and stinking up the solar system all the way to
646648> Pluto. Our latest space telescopes would surely have detected this
647649> abominable structure - if not, in fact, collided with it.
648−>
650+>
649651> Two: therefore, at some point in Martian history, some abject fsck of a
650−> Martian code-monkey must have said: *fsck* this entire fscking ball of
651−> mud. For *lo*, its defects cannot be summarized; for they exceed the
652+> Martian code-monkey must have said: _fsck_ this entire fscking ball of
653+> mud. For _lo_, its defects cannot be summarized; for they exceed the
652654> global supply of bullet points; for numerous as the fishes in the sea,
653655> like the fishes in the sea they fsck, making more little fscking fishes.
654−> For lo, it is *fscked*, and a big ball of mud. And there is only one thing
655−> to do with it: *obliterate* the trunk, *fire* the developers, and hire a
656−> whole new fscking *army* of Martian code-monkeys to rewrite the *entire
657−> fscking thing*.
658−>
659−> This is such an obvious and essential response to the *big ball of mud*
656+> For lo, it is _fscked_, and a big ball of mud. And there is only one thing
657+> to do with it: _obliterate_ the trunk, _fire_ the developers, and hire a
658+> whole new fscking _army_ of Martian code-monkeys to rewrite the _entire
659+> fscking thing_.
660+>
661+> This is such an obvious and essential response to the _big ball of mud_
660662> pattern that, despite the fact that we know nothing about Mars, we can
661663> deduce that it must have happened on Mars. Probably several times.
662664> Probably several hundred. For each of these attempts but the last, of
663−> course, the result was either (a) abject failure, (b) another *big ball
664−> of mud*, or (c) both.
665−>
665+> course, the result was either (a) abject failure, (b) another _big ball
666+> of mud_, or (c) both.
667+>
666668> But the last, by definition, succeeded. This is the crucial inference we
667669> can draw about Mars: since the Martians had 50 million years to try, in
668670> the end they must have succeeded. The result: Martian code, as we know
669−> it today. Not enormous and horrible — *tiny and diamond-perfect*.
671+> it today. Not enormous and horrible — _tiny and diamond-perfect_.
670672> Moreover, because it is tiny and diamond-perfect, it is perfectly stable
671−> and never changes or decays. It neither is a *big ball of mud*, nor tends
673+> and never changes or decays. It neither is a _big ball of mud_, nor tends
672674> to become one. It has achieved its final, permanent and excellent state.
673675
674676We don't know that Urbit will achieve this final form, but Urbit is an attempt to make progress in that direction. Any software that isn't a candidate for "tiny and diamond-perfect" is either a prototype or scaffolding.
@@ -692,17 +694,17 @@ acceptable. If you depend on a piece of source code to be kept forever, copied a
692694Another way to look at this is to say that anything that wouldn't work on a spaceship is architecturally flawed. Maybe it requires many sequential round-trips to a central server because it doesn't have all the relevant information. See discussion of A7.
693695
694696> F3: If it's owned by someone else, it isn't yours.
695−>
697+>
696698> F4: If it's managed by someone else and you can't change who that is, it
697699> isn't yours.
698−>
700+>
699701> F5: If it's not yours, it isn't permanent.
700−>
702+>
701703> F6: If it's not permanent, it isn't real.
702704
703705Nobody is as aligned with your values as you are. If you don't control the software, then you can't guarantee you'll always have access to it. Whoever does control the software may destroy it, move away, or simply revoke your access to it.
704706
705−Control has some nuance. If it's physically controlled by a company and you can't get your data and the software that makes it useful, you definitely don't have control. If you have physical control of it, you do have control. But if you're hosting the data and software on a commodity cloud server, you still mostly have control of it. Your privacy has been reduced, sure. However, as long as you keep regular backups of the data and software, if the hosting provider disappears you just need to find another host, or host it yourself. Any particular host is likely to disappear, but the situation where *every* host disappears and you can't even host it yourself is much less likely. Brands are mortal, commodities are not.
707+Control has some nuance. If it's physically controlled by a company and you can't get your data and the software that makes it useful, you definitely don't have control. If you have physical control of it, you do have control. But if you're hosting the data and software on a commodity cloud server, you still mostly have control of it. Your privacy has been reduced, sure. However, as long as you keep regular backups of the data and software, if the hosting provider disappears you just need to find another host, or host it yourself. Any particular host is likely to disappear, but the situation where _every_ host disappears and you can't even host it yourself is much less likely. Brands are mortal, commodities are not.
706708
707709Some branded hosts allow you to download a zip file of your data. This gives you a little more control over your data, but it's much closer to "no control" than "total control". This is because your online world is data plus code, and without the code that makes it useful, data is only good for scrapbooking. The scrapbook will remind you of the good old days, but you won't be able to live them again.
708710
@@ -765,4 +767,4 @@ other communities and may spread if they provide some benefit.
765767Many technologies today combine us into a single community, or at least a single set of norms. If many communities are hosted by a single entity, there will be pressure from some of those communities toward the entity to pressure other communities to follow certain of their norms.
766768This crosstalk isn't all bad, but there must be an equilibrium. All too often the lines between the communities are so permeable as to be inconsequential. In this case, the communities will converge in a single large community, at the cost of the memetic diversity of the original communities.
767769
768−Technology should mirror human interaction, and humans interact in communities.
770+Technology should mirror human interaction, and humans interact in communities.
content/blog/precepts.md+187−187
@@ -1,18 +1,19 @@
11+++
22title = "Precepts"
3−date = 2020-03-18
3+date = "2020-03-17"
44description = "Technical maxims that define Urbit's approach to engineering."
5+
56[extra]
67author = "Philip Monk"
78ship = "~wicdev-wisryt"
8−image ="https://media.urbit.org/site/posts/essays/pre-01.jpg"
9+image = "https://media.urbit.org/site/posts/essays/pre-01.jpg"
910+++
1011
1112<br>
1213
1314<img class="ba" src="https://media.urbit.org/site/posts/essays/pre-01.jpg">
1415
15−Urbit is a principled approach to system design and programming, but it's often not obvious what those principles are. We have many specific terms for the different parts of the project: Arvo is the OS, Hoon is the language, Tlon is the company, Azimuth is the identity system, Ames is the network. But the word most associated with the project is "Urbit", and it's not clear what technically it refers to. It's only a small stretch to say that "Urbit" *is* this set of principles, and that if anybody follows these principles strictly they will create a system that is isomorphic to the Urbit.
16+Urbit is a principled approach to system design and programming, but it's often not obvious what those principles are. We have many specific terms for the different parts of the project: Arvo is the OS, Hoon is the language, Tlon is the company, Azimuth is the identity system, Ames is the network. But the word most associated with the project is "Urbit", and it's not clear what technically it refers to. It's only a small stretch to say that "Urbit" _is_ this set of principles, and that if anybody follows these principles strictly they will create a system that is isomorphic to the Urbit.
1617
1718Some of these are commonly held among many software projects, and some are not. Some are only debatably better than the alternatives, but Urbit exclusively chooses them.
1819
@@ -22,120 +23,119 @@ We’ll start with a brief description of many principles, then we’ll go into
2223
2324<img class="ba" src="https://media.urbit.org/site/posts/essays/pre-02.jpg">
2425
25−
2626### A: General Design
2727
28−1) Data is better than code.
28+1. Data is better than code.
2929
30− Store data in your state, send data over the wire, dispatch based
31− on data.
30+ Store data in your state, send data over the wire, dispatch based
31+ on data.
3232
33−2) Everything should be CQRS.
33+2. Everything should be CQRS.
3434
35−3) (Almost) Everything should be pubsub.
35+3. (Almost) Everything should be pubsub.
3636
37−4) A subscriber shouldn't affect a publisher.
37+4. A subscriber shouldn't affect a publisher.
3838
39−5) Communication between nodes should be communication between
39+5. Communication between nodes should be communication between
4040 independent actors.
4141
42− Each message should do one complete thing, and there shouldn't
43− need to be a sequence of coupled messages.
42+ Each message should do one complete thing, and there shouldn't
43+ need to be a sequence of coupled messages.
4444
45−6) Represent your data as closely as possible to the essential structure
45+6. Represent your data as closely as possible to the essential structure
4646 of the problem.
4747
48−7) A client's representation of data should be as close as possible to
48+7. A client's representation of data should be as close as possible to
4949 that of the server.
5050
51− This blurs the distinction between client and server. It allows
52− offline-mode, reduces communication to syncing, and decentralizes.
51+ This blurs the distinction between client and server. It allows
52+ offline-mode, reduces communication to syncing, and decentralizes.
5353
54−8) When mating different paradigms, build one cleanly on top of the
54+8. When mating different paradigms, build one cleanly on top of the
5555 other.
5656
57− Never try to make them work on some of the same primitives. Never
58− abuse one to make the other work. For example, ducts in
59− themselves are very general - if you want to do pubsub, that can
60− easily be built on top of ducts, but don't pretend that pubsub is
61− a *part* of the duct system.
57+ Never try to make them work on some of the same primitives. Never
58+ abuse one to make the other work. For example, ducts in
59+ themselves are very general - if you want to do pubsub, that can
60+ easily be built on top of ducts, but don't pretend that pubsub is
61+ a _part_ of the duct system.
6262
63−9) Never misuse an abstraction.
63+9. Never misuse an abstraction.
6464
65− An abstraction provides a certain set of tools; use them and only
66− them.
65+ An abstraction provides a certain set of tools; use them and only
66+ them.
6767
68−10) Correctness is more important than performance.
68+10. Correctness is more important than performance.
6969
70−11) Be simple and uncompromising in defining what's correct; go crazy
70+11. Be simple and uncompromising in defining what's correct; go crazy
7171 with optimizations.
7272
73− Nock is a great example of this. It contains the character of the
74− virtual machine, but its asymptotics are bad. Add jets to fix the
75− asymptotics.
76−
77− Another example is the ACID nature of Arvo. Arvo is a pure
78− function f(logs) of its event log, so formally Arvo is just a
79− function run against an event log. A naive implementation has
80− very bad asymptotics; processing each new event is O(n) in the
81− number of historical events. Choose the function g(state,log)
82− such that f(logs ++ log) = g(f(logs),log). Then, as long as you
83− keep the state in memory, processing each new event is constant in
84− the number of previous events. This still requires O(n) restart
85− from disk, but you can also periodically (and non-blockingly)
86− write a checkpoint of the state to disk, so that restart from disk
87− is only linear in the number of events since the last checkpoint.
88−
89−12) Correctness is more important than optimality.
90−
91−13) If you don't completely understand your code and the semantics of
73+ Nock is a great example of this. It contains the character of the
74+ virtual machine, but its asymptotics are bad. Add jets to fix the
75+ asymptotics.
76+
77+ Another example is the ACID nature of Arvo. Arvo is a pure
78+ function f(logs) of its event log, so formally Arvo is just a
79+ function run against an event log. A naive implementation has
80+ very bad asymptotics; processing each new event is O(n) in the
81+ number of historical events. Choose the function g(state,log)
82+ such that f(logs ++ log) = g(f(logs),log). Then, as long as you
83+ keep the state in memory, processing each new event is constant in
84+ the number of previous events. This still requires O(n) restart
85+ from disk, but you can also periodically (and non-blockingly)
86+ write a checkpoint of the state to disk, so that restart from disk
87+ is only linear in the number of events since the last checkpoint.
88+
89+12. Correctness is more important than optimality.
90+
91+13. If you don't completely understand your code and the semantics of
9292 all the code it depends on, your code is wrong.
9393
94−14) Deterministic beats heuristic.
94+14. Deterministic beats heuristic.
9595
96− Heuristics are evil and should only be used where determinism is
97− infeasible, such as in cache reclamation.
96+ Heuristics are evil and should only be used where determinism is
97+ infeasible, such as in cache reclamation.
9898
99−15) Stateless is better than stateful.
99+15. Stateless is better than stateful.
100100
101−16) Explicit state is better than implicit state.
101+16. Explicit state is better than implicit state.
102102
103−17) Referential transparency is honesty and stability.
103+17. Referential transparency is honesty and stability.
104104
105− Lack of referential transparency and other forms of
106− disingenuousness are some of the world's big problems. Only
107− deviate from referential transparency if absolutely necessary.
105+ Lack of referential transparency and other forms of
106+ disingenuousness are some of the world's big problems. Only
107+ deviate from referential transparency if absolutely necessary.
108108
109−18) Responsibilities should be clearly separated.
109+18. Responsibilities should be clearly separated.
110110
111− This applies from kernel modules through network citizens.
111+ This applies from kernel modules through network citizens.
112112
113−19) Dualities must be faced head-on and analyzed differently at
113+19. Dualities must be faced head-on and analyzed differently at
114114 different layers.
115115
116− Statically typed vs. dynamically typed, imperative vs. functional,
117− code vs. data, and effectful vs. pure can all be a matter of
118− perspective, and all relevant perspectives must have coherent
119− answers.
116+ Statically typed vs. dynamically typed, imperative vs. functional,
117+ code vs. data, and effectful vs. pure can all be a matter of
118+ perspective, and all relevant perspectives must have coherent
119+ answers.
120120
121−20) One hundred lines of simplicity is better than twenty lines of
121+20. One hundred lines of simplicity is better than twenty lines of
122122 complexity.
123123
124− It's not enough for an abstraction to reduce code duplication; it
125− must actually make the code simpler.
124+ It's not enough for an abstraction to reduce code duplication; it
125+ must actually make the code simpler.
126126
127−21) Prefer mechanical simplicity to mathematical simplicity.
127+21. Prefer mechanical simplicity to mathematical simplicity.
128128
129− Often mechanical simplicity and mathematical simplicity go
130− together.
129+ Often mechanical simplicity and mathematical simplicity go
130+ together.
131131
132−22) The Law of Leaky Abstractions is a lie; abstract airtightly.
132+22. The Law of Leaky Abstractions is a lie; abstract airtightly.
133133
134− If your abstractions are leaking, it's not due to some law of the
135− universe; you just suck at abstracting. Usually, you didn't
136− specify the abstraction narrowly enough.
134+ If your abstractions are leaking, it's not due to some law of the
135+ universe; you just suck at abstracting. Usually, you didn't
136+ specify the abstraction narrowly enough.
137137
138−23) Some cliches are repeated because they are true; others must be
138+23. Some cliches are repeated because they are true; others must be
139139 repeated because they are not.
140140
141141<br>
@@ -144,31 +144,31 @@ We’ll start with a brief description of many principles, then we’ll go into
144144
145145### B: Specific Design
146146
147−1) Always ack a dupe; never ack an ack.
147+1. Always ack a dupe; never ack an ack.
148+
149+ It's okay to ack a nack as long as you never nack a nack.
148150
149− It's okay to ack a nack as long as you never nack a nack.
151+2. Never construct or deconstruct a duct.
150152
151−2) Never construct or deconstruct a duct.
153+3. Route on wire before sign, never sign before wire.
152154
153−3) Route on wire before sign, never sign before wire.
155+4. Only go from statically typed to dynamically typed if you must.
154156
155−4) Only go from statically typed to dynamically typed if you must.
157+ Once you go into a dynamically typed world, it's hard to go back.
158+ Statically typed is better than dynamically typed, so if something
159+ can be made static, it should be.
156160
157− Once you go into a dynamically typed world, it's hard to go back.
158− Statically typed is better than dynamically typed, so if something
159− can be made static, it should be.
160−
161− Each timeless data structure is a brick in the foundation of
162− digital civilization.
161+ Each timeless data structure is a brick in the foundation of
162+ digital civilization.
163163
164−5) Anything with business logic speaks one paradigm; anything that
164+5. Anything with business logic speaks one paradigm; anything that
165165 translates paradigms has no business logic.
166166
167−6) Functionally enforced semantic rules are better security primitives
167+6. Functionally enforced semantic rules are better security primitives
168168 than memory access restrictions.
169169
170− A compiler can use type safety as an effective tool to enforce
171− some classes of security guarantees.
170+ A compiler can use type safety as an effective tool to enforce
171+ some classes of security guarantees.
172172
173173<br>
174174
@@ -176,30 +176,30 @@ We’ll start with a brief description of many principles, then we’ll go into
176176
177177### C: Attitude
178178
179−1) Code courageously.
179+1. Code courageously.
180180
181− If you avoid changing a section of code for fear of awakening the
182− demons therein, you are living in fear. If you stay in the
183− comfortable confines of the small section of the code you wrote or
184− know well, you will never write legendary code. All code was
185− written by humans and can be mastered by humans.
181+ If you avoid changing a section of code for fear of awakening the
182+ demons therein, you are living in fear. If you stay in the
183+ comfortable confines of the small section of the code you wrote or
184+ know well, you will never write legendary code. All code was
185+ written by humans and can be mastered by humans.
186186
187− It's natural to feel fear of code; however, you must act as though
188− you are able to master and change any part of it. To code
189− courageously is to walk into any abyss, bring light, and make it
190− right.
187+ It's natural to feel fear of code; however, you must act as though
188+ you are able to master and change any part of it. To code
189+ courageously is to walk into any abyss, bring light, and make it
190+ right.
191191
192−2) No time for lazy people.
192+2. No time for lazy people.
193193
194− If there's clearly a right way to do something and a wrong way, do
195− it the right way. Coding requires incredible discipline. Always
196− follow conventions, and fire anyone who won't. Anything that can
197− be solved by discipline is not a real problem.
194+ If there's clearly a right way to do something and a wrong way, do
195+ it the right way. Coding requires incredible discipline. Always
196+ follow conventions, and fire anyone who won't. Anything that can
197+ be solved by discipline is not a real problem.
198198
199− > "To him who knows to do good and does not do it, to him it is
200− sin."
199+ > "To him who knows to do good and does not do it, to him it is
200+ > sin."
201201
202−3) When a smart person makes an obviously stupid suggestion, before
202+3. When a smart person makes an obviously stupid suggestion, before
203203 responding take a full 60 seconds to envision how you would implement
204204 it and what the effects would be.
205205
@@ -209,46 +209,46 @@ We’ll start with a brief description of many principles, then we’ll go into
209209
210210### D: Theory
211211
212−1) Academia is a succubus.
212+1. Academia is a succubus.
213213
214− Academia has a really high ratio of smart people to useful
215− products. Academia has many genuinely smart and interesting
216− ideas, but always remember that pursuing them whole-heartedly will
217− never result in a useful product.
214+ Academia has a really high ratio of smart people to useful
215+ products. Academia has many genuinely smart and interesting
216+ ideas, but always remember that pursuing them whole-heartedly will
217+ never result in a useful product.
218218
219−2) Never fear math.
219+2. Never fear math.
220220
221− Academia is inefficient, but it's also correct. Those people
222− wasted a lot of time finding the right answer, but now that
223− they've done it, you must exploit it. If you don't know the
224− theory, learn it. No excuse for being "bad at math". Most who
225− are "bad at math" are simply lazy or fearful. Be strong and of
226− good courage. If you're truly so bad at math that you cannot
227− learn it, you should not design systems.
221+ Academia is inefficient, but it's also correct. Those people
222+ wasted a lot of time finding the right answer, but now that
223+ they've done it, you must exploit it. If you don't know the
224+ theory, learn it. No excuse for being "bad at math". Most who
225+ are "bad at math" are simply lazy or fearful. Be strong and of
226+ good courage. If you're truly so bad at math that you cannot
227+ learn it, you should not design systems.
228228
229−3) Not being qualified to solve a problem is no reason not to solve it.
229+3. Not being qualified to solve a problem is no reason not to solve it.
230230
231− If you don't know how to do it, do it anyway. "We are too young
232− to realize that certain things are impossible. So, we will do
233− them anyway."
231+ If you don't know how to do it, do it anyway. "We are too young
232+ to realize that certain things are impossible. So, we will do
233+ them anyway."
234234
235−4) The best way to get the right answer is to try it the wrong way.
235+4. The best way to get the right answer is to try it the wrong way.
236236
237− You cannot design a good system without spending most of your time
238− in contact with the problem. The bad parts about systems are
239− rarely obvious in theory, but often in practice.
237+ You cannot design a good system without spending most of your time
238+ in contact with the problem. The bad parts about systems are
239+ rarely obvious in theory, but often in practice.
240240
241−5) Practice tells you that things are good or bad; theory tells you why.
241+5. Practice tells you that things are good or bad; theory tells you why.
242242
243− Never use theory to design a good system from scratch; only
244− practice can tell whether the system is good.
243+ Never use theory to design a good system from scratch; only
244+ practice can tell whether the system is good.
245245
246−6) Everyone must regularly alternate between theory and practice.
246+6. Everyone must regularly alternate between theory and practice.
247247
248− There is an eternal wheel of system design. Given a system, use
249− practice to discover what is bad, missing, or unnecessary. Then,
250− use theory to fix the bad, add the missing, and remove the
251− unnecessary. Repeat.
248+ There is an eternal wheel of system design. Given a system, use
249+ practice to discover what is bad, missing, or unnecessary. Then,
250+ use theory to fix the bad, add the missing, and remove the
251+ unnecessary. Repeat.
252252
253253<br>
254254
@@ -256,34 +256,34 @@ We’ll start with a brief description of many principles, then we’ll go into
256256
257257### E: Text Style
258258
259−1) No code should extend beyond 80 characters, most within 55.
259+1. No code should extend beyond 80 characters, most within 55.
260260
261−2) Tabs aren't real.
261+2. Tabs aren't real.
262262
263−3) A text file is a series of lines, each ending with a newline
263+3. A text file is a series of lines, each ending with a newline
264264 character.
265265
266− Corollary: all non-empty text files end with a newline (often
267− hidden by editors). An empty text file does not end with a
268− newline.
266+ Corollary: all non-empty text files end with a newline (often
267+ hidden by editors). An empty text file does not end with a
268+ newline.
269269
270−4) One block comment is better than interleaved comments on every line.
270+4. One block comment is better than interleaved comments on every line.
271271
272−5) Don't name anything you don't have to.
272+5. Don't name anything you don't have to.
273273
274− This includes conventional names for variables of particular
275− types. For example, the conventional name for a variable of type
276− `path` is `pax`. You should have a good reason for using any
277− other name for a `path`.
274+ This includes conventional names for variables of particular
275+ types. For example, the conventional name for a variable of type
276+ `path` is `pax`. You should have a good reason for using any
277+ other name for a `path`.
278278
279− A more recent convention that follows the same principle is to
280− give the variable the same name as its type.
279+ A more recent convention that follows the same principle is to
280+ give the variable the same name as its type.
281281
282−6) If it's the same thing, give it the same name.
282+6. If it's the same thing, give it the same name.
283283
284−7) Humans are good at memorizing.
284+7. Humans are good at memorizing.
285285
286−8) Abbreviations aren't worth it.
286+8. Abbreviations aren't worth it.
287287
288288<br>
289289
@@ -291,65 +291,65 @@ We’ll start with a brief description of many principles, then we’ll go into
291291
292292### F: Real Software
293293
294−1) If it's not deterministic, it isn't real.
294+1. If it's not deterministic, it isn't real.
295295
296−2) If it's centralized, it isn't real.
296+2. If it's centralized, it isn't real.
297297
298−3) If it's owned by someone else, it isn't yours.
298+3. If it's owned by someone else, it isn't yours.
299299
300−4) If it's managed by someone else and you can't change who that is, it
300+4. If it's managed by someone else and you can't change who that is, it
301301 isn't yours.
302302
303−5) If it's not yours, it isn't permanent.
303+5. If it's not yours, it isn't permanent.
304304
305−6) If it's not permanent, it isn't real.
305+6. If it's not permanent, it isn't real.
306306
307−7) The way it is isn't always the way it ought to be.
307+7. The way it is isn't always the way it ought to be.
308308
309− If you can make it the way it ought to be, do so.
309+ If you can make it the way it ought to be, do so.
310310
311−8) The way it ought to be isn't always the way it is.
311+8. The way it ought to be isn't always the way it is.
312312
313− Some things can't be made more elegant.
313+ Some things can't be made more elegant.
314314
315− For every ailment under the sun
316− There is a remedy, or there is none;
317− If there be one, try to find it;
318− If there be none, never mind it.
315+ For every ailment under the sun
316+ There is a remedy, or there is none;
317+ If there be one, try to find it;
318+ If there be none, never mind it.
319319
320−9) Timeless software is good software.
320+9. Timeless software is good software.
321321
322−10) System modules should be designed to be frozen permanently;
322+10. System modules should be designed to be frozen permanently;
323323 conversely, Urbit consists of that system software which admits of a
324324 Kelvin version.
325325
326−11) The two procedures for achieving timelessness are distillation and
326+11. The two procedures for achieving timelessness are distillation and
327327 generalization.
328328
329− Every temporary or contingent feature in a system module should
330− eventually either be removed (distillation) or relaxed into
331− timelessness (generalization). For an example of the result of
332− both procedures, consider the abstraction of the core in Nock and
333− Hoon.
329+ Every temporary or contingent feature in a system module should
330+ eventually either be removed (distillation) or relaxed into
331+ timelessness (generalization). For an example of the result of
332+ both procedures, consider the abstraction of the core in Nock and
333+ Hoon.
334334
335−12) Standardization is better than perfection.
335+12. Standardization is better than perfection.
336336
337− Kelvin versioning stops when we run out of versions, not when
338− every defect has been rectified.
337+ Kelvin versioning stops when we run out of versions, not when
338+ every defect has been rectified.
339339
340−13) That which cannot be Kelvin-versioned should update fluidly and
340+13. That which cannot be Kelvin-versioned should update fluidly and
341341 automatically.
342342
343− All incompatible upgrades should provide permanent and automatic
344− upgrade paths. This is principled permanent backward
345− compatibility.
343+ All incompatible upgrades should provide permanent and automatic
344+ upgrade paths. This is principled permanent backward
345+ compatibility.
346346
347−14) Humans are interactive and temporal; technology is permanent and
347+14. Humans are interactive and temporal; technology is permanent and
348348 exhaustive.
349349
350−15) Communities are autonomous.
350+15. Communities are autonomous.
351351
352−16) Sovereignty necessitates understanding.
352+16. Sovereignty necessitates understanding.
353353
354− If you don't understand a system you're using, you don't control
355− it. If nobody understands the system, the system is in control.
354+ If you don't understand a system you're using, you don't control
355+ it. If nobody understands the system, the system is in control.
content/blog/providers.md+24−27
@@ -1,11 +1,12 @@
11+++
22title = "Providers"
3−date = 2020-08-18
3+date = "2020-08-17"
44description = "We’ve always assumed that providers would have to come into existence sooner or later. By the look of it, that time is now. Tlon and a few others have provider-like services in the works."
5+
56[extra]
67author = "Galen Wolfe-Pauly"
78ship = "~ravmel-ropdyl"
8−image ="https://storage.googleapis.com/media.urbit.org/site/posts/essays/providers.png"
9+image = "https://storage.googleapis.com/media.urbit.org/site/posts/essays/providers.png"
910+++
1011
1112<br>
@@ -14,76 +15,72 @@ image ="https://storage.googleapis.com/media.urbit.org/site/posts/essays/provide
1415
1516<br>
1617
17−We look forward to a future where your Urbit is an always-on, always-available service. You should be able to pick up any device and conjure up your whole digital life immediately.
18−
19−Sounds good—but how does this actually come to pass? Urbit has to be technically robust and have a nice interface. Assuming we can deliver both of those things, your Urbit node also has to be safe, secure, and running somewhere with a network connection.
18+We look forward to a future where your Urbit is an always-on, always-available service. You should be able to pick up any device and conjure up your whole digital life immediately.
2019
21−Urbit has been getting nicer to use and more stable every day. We use it constantly, both as a company (Tlon) and for the broader Urbit community. From what we can tell, people are using Urbit to start communities of their own here and there. The problem is: to use our platform, you’ve got to run it yourself. This limits our audience *a lot*. Setting up a VPS and running an Urbit OS node is pretty easy if you’re comfortable in the command line, which makes it completely impossible for most people.
20+Sounds good—but how does this actually come to pass? Urbit has to be technically robust and have a nice interface. Assuming we can deliver both of those things, your Urbit node also has to be safe, secure, and running somewhere with a network connection.
2221
23−We hear from people regularly who want to be able to sign up for Urbit like it was any cloud service. What they want is what we’ve been calling a *provider*: a service to provide easy onboarding and hosting. Given a good provider, we’d be pretty close to our long-term vision: Urbit would feel like a ubiquitous, easily accessible service.
22+Urbit has been getting nicer to use and more stable every day. We use it constantly, both as a company (Tlon) and for the broader Urbit community. From what we can tell, people are using Urbit to start communities of their own here and there. The problem is: to use our platform, you’ve got to run it yourself. This limits our audience _a lot_. Setting up a VPS and running an Urbit OS node is pretty easy if you’re comfortable in the command line, which makes it completely impossible for most people.
2423
25−We’ve always assumed that providers would have to come into existence sooner or later. By the look of it, that time is now. Tlon and a few others have provider-like services in the works. We’ll talk about the specifics of what Tlon is planning to do in a future post. In this one, we’ll talk about what a provider is, why anyone would start one, and give a few examples of what they might look like.
24+We hear from people regularly who want to be able to sign up for Urbit like it was any cloud service. What they want is what we’ve been calling a _provider_: a service to provide easy onboarding and hosting. Given a good provider, we’d be pretty close to our long-term vision: Urbit would feel like a ubiquitous, easily accessible service.
2625
26+We’ve always assumed that providers would have to come into existence sooner or later. By the look of it, that time is now. Tlon and a few others have provider-like services in the works. We’ll talk about the specifics of what Tlon is planning to do in a future post. In this one, we’ll talk about what a provider is, why anyone would start one, and give a few examples of what they might look like.
2727
2828## What is a provider?
2929
30−A provider is anyone (company, DAO, a group of friends) that provides easy onboarding and hosting.
30+A provider is anyone (company, DAO, a group of friends) that provides easy onboarding and hosting.
3131
32−From a user perspective, signing up with a provider should be as simple as picking a planet and hosting plan, paying, and getting connected to a running Urbit OS node. This should be able to be done entirely in a browser or a standalone app and feel more or less like signing up for a conventional service.
32+From a user perspective, signing up with a provider should be as simple as picking a planet and hosting plan, paying, and getting connected to a running Urbit OS node. This should be able to be done entirely in a browser or a standalone app and feel more or less like signing up for a conventional service.
3333
3434From a technical perspective, this means a provider needs to create an Ethereum wallet for the user (client-side, of course), deliver an Urbit ID to it, and boot an Urbit OS node for them. And, at some point in the process, collect payment.
3535
36−As a user, your provider is somewhere between your ISP and your WordPress host. Your provider both runs the star that sponsors your planet (and provides peer discovery) as well as potentially providing both access to communities and even provider-specific software. We don’t really expect providers to be terribly generic—quite the opposite. Providers are likely to differentiate themselves on price, available software, and available communities. We’ll get into some examples later.
36+As a user, your provider is somewhere between your ISP and your WordPress host. Your provider both runs the star that sponsors your planet (and provides peer discovery) as well as potentially providing both access to communities and even provider-specific software. We don’t really expect providers to be terribly generic—quite the opposite. Providers are likely to differentiate themselves on price, available software, and available communities. We’ll get into some examples later.
3737
38−The utility that a provider offers involves quite a lot of trust on behalf of the user. While the provider never actually holds the keys to your Urbit ID, they do run your node and, in turn, can access its contents. Unlike giant cloud services, your data isn’t in an easily searchable database. Inspecting your data should be something explicitly protected by a good provider ToS.
38+The utility that a provider offers involves quite a lot of trust on behalf of the user. While the provider never actually holds the keys to your Urbit ID, they do run your node and, in turn, can access its contents. Unlike giant cloud services, your data isn’t in an easily searchable database. Inspecting your data should be something explicitly protected by a good provider ToS.
3939
40−If a strongly worded ToS isn’t enough for you, you can always host yourself. And, given the way Urbit works, downloading your Urbit from a provider and running it elsewhere should be both really simple and something a provider will *always* let you do. It’s perfectly fine to run Urbit in your closet—which means that providers are really competing on ease of use and price.
40+If a strongly worded ToS isn’t enough for you, you can always host yourself. And, given the way Urbit works, downloading your Urbit from a provider and running it elsewhere should be both really simple and something a provider will _always_ let you do. It’s perfectly fine to run Urbit in your closet—which means that providers are really competing on ease of use and price.
4141
4242Let’s move on and talk a bit about why starting a provider makes sense to begin with.
4343
44−
4544## Why would anyone start a provider?
4645
4746Our aim is to make Urbit OS so obviously nice to use that it’s well worth paying for. Today, a planet goes for about $10–$20 and, once you buy one, you’ve got to figure out how to really put it to use. Which takes some work.
4847
4948Any large holder of address space should immediately see the opportunity here: the more useful Urbit is, the more value can be captured by starting a provider. Providers make it possible to actually capture the value in address space, both by selling it and by operating nodes.
5049
51−Let’s say the base cost of running an Urbit OS node, in a hosted environment, is $10 / node / month. If you can sell hosting for $200 / year, you’re making back the ‘cost’ of the planet when someone signs up. Given that it’s more desirable to buy a planet when you know the star is online and you can put it to good use, this seems like a pretty good proposition: both for the provider and the customer.
50+Let’s say the base cost of running an Urbit OS node, in a hosted environment, is $10 / node / month. If you can sell hosting for $200 / year, you’re making back the ‘cost’ of the planet when someone signs up. Given that it’s more desirable to buy a planet when you know the star is online and you can put it to good use, this seems like a pretty good proposition: both for the provider and the customer.
5251
53−Starting a provider doesn’t *have* to be done by address-space holders. You could start a provider with no address space of your own by custodying the address space of others. Then, you could take a cut of the address space sales and all of the hosting revenue. With a market of people looking to use Urbit, the crux of success with this approach is simply whether you can compete on user experience.
52+Starting a provider doesn’t _have_ to be done by address-space holders. You could start a provider with no address space of your own by custodying the address space of others. Then, you could take a cut of the address space sales and all of the hosting revenue. With a market of people looking to use Urbit, the crux of success with this approach is simply whether you can compete on user experience.
5453
5554Providers are, in a way, like the miners of Urbit. They’re incentivized to run fleets of very specific VMs for profit. The profit motive, in Urbit’s case, is just a bit more conventional than a bitcoin miner. An Urbit provider is just offering a service in exchange for money.
5655
57−
5856## What are some examples of providers?
5957
60−If you think of a provider simply as a business, its most basic incentive is to attract as many customers as possible. You can do that by competing on price or performance, or by competing on aesthetics and community—there are lots of ways that providers can compete.
58+If you think of a provider simply as a business, its most basic incentive is to attract as many customers as possible. You can do that by competing on price or performance, or by competing on aesthetics and community—there are lots of ways that providers can compete.
6159
62−As a roughly similar ecosystem, the world of webhosting is a great comparison. There are lots of small webhosts that all have very specific services: Dreamhost, MediaTemple, prgmr.com, and Linode all come to mind. Then there are the more generic, large-scale, performance-oriented options: AWS, GCP, Azure. It’s not quite time for an AWS-scale Urbit provider, but perhaps the AWS of Urbit will start as something much smaller.
60+As a roughly similar ecosystem, the world of webhosting is a great comparison. There are lots of small webhosts that all have very specific services: Dreamhost, MediaTemple, prgmr.com, and Linode all come to mind. Then there are the more generic, large-scale, performance-oriented options: AWS, GCP, Azure. It’s not quite time for an AWS-scale Urbit provider, but perhaps the AWS of Urbit will start as something much smaller.
6361
6462Let’s walk through a few examples to get a feel for what’s possible:
6563
6664Communities -
6765
68−A provider could easily curate community content like news, events, and discussion that it only delivers to its customers. Think of it as a bit like the days of sharing a server among friends—only in this case it could be hundreds or thousands of people who form a collective to run infrastructure and share information.
66+A provider could easily curate community content like news, events, and discussion that it only delivers to its customers. Think of it as a bit like the days of sharing a server among friends—only in this case it could be hundreds or thousands of people who form a collective to run infrastructure and share information.
6967
70−Custom software -
68+Custom software -
7169
72−There are so many ways that providers can offer custom software. Urbit isn’t ready for third party software distribution. When it is, subscribers to a specific provider could get unique modules and applications synced directly to their Urbit nodes along with their membership.
70+There are so many ways that providers can offer custom software. Urbit isn’t ready for third party software distribution. When it is, subscribers to a specific provider could get unique modules and applications synced directly to their Urbit nodes along with their membership.
7371
7472Aside from Urbit-specific software, providers could provide custom software services to their subscribers. A straightforward example of this could come in the form of Bitcoin or Ethereum nodes for processing transactions. Sign up with a provider and get the ability to send transactions to the chain quickly and reliably.
7573
76−Security -
74+Security -
7775
7876Let’s say our base cost of $10 / month / planet from above is correct (it’s probably high, but it’s a simple number). Would someone pay $100 / month for a planet hosted in a bunker or in the pylon of an abandoned oil rig? Maybe.
7977
80−
8178## What about Tlon?
8279
83−Before there can be an ecosystem of providers, there has to be *one* provider. While we’ve heard of a few other people working on things, we expect Tlon to be the first to try to really get into the provider business in earnest.
80+Before there can be an ecosystem of providers, there has to be _one_ provider. While we’ve heard of a few other people working on things, we expect Tlon to be the first to try to really get into the provider business in earnest.
8481
8582I’ll save the details of what we’re going to do for a future post. Launching Tlon as a separate business will be the beginning of the separation of Tlon and Urbit. I’m really quite excited about it. Tlon is only able to consider becoming a business of its own because Urbit is mature enough that we can actually do it.
8683
87−For now, I’ll just say that Tlon will pick the low-hanging fruit first. Our goal is to make onboarding a group into Urbit incredibly simple. We want people to be able to go from email invite to running Urbit in a few minutes without ever knowing anything about Ethereum, Unix, or what a private key is.
84+For now, I’ll just say that Tlon will pick the low-hanging fruit first. Our goal is to make onboarding a group into Urbit incredibly simple. We want people to be able to go from email invite to running Urbit in a few minutes without ever knowing anything about Ethereum, Unix, or what a private key is.
8885
89−Once we’ve laid the groundwork with something that *just works*, we plan to open-source some of our components. Scaling up Urbit isn’t going to be easy. We hope that others will help us, and will help explore what’s possible in supporting Urbit users in the future.
86+Once we’ve laid the groundwork with something that _just works_, we plan to open-source some of our components. Scaling up Urbit isn’t going to be easy. We hope that others will help us, and will help explore what’s possible in supporting Urbit users in the future.
content/blog/rollups.md+12−10
@@ -1,7 +1,8 @@
11+++
22title = "The Gang Solves the Gas Crisis"
3−date = 2021-05-14
3+date = "2021-05-13"
44description = "How we're making Urbit ID affordable again"
5+
56[extra]
67author = "Jonathan Paprocki"
78ship = "~datnut-pollen"
@@ -175,10 +176,11 @@ these factors to be included in the roller documentation.
175176governing Urbit ID. They will require a few changes to accommodate the new
176177system. Some of this has been implicit above, but to be clear, we will only be
177178making a couple minor alterations:
178− - Once a star's spawn proxy is set to the layer 2 address, it can't be switched
179− back, and they can no longer spawn layer 1 planets.
180− - Galaxies and their proxies cannot be deposited to layer 2.
181−Some other minor details are yet to be worked out, but again, nothing will change for those who wish to remain on layer 1.
179+
180+- Once a star's spawn proxy is set to the layer 2 address, it can't be switched
181+ back, and they can no longer spawn layer 1 planets.
182+- Galaxies and their proxies cannot be deposited to layer 2.
183+ Some other minor details are yet to be worked out, but again, nothing will change for those who wish to remain on layer 1.
182184
183185### Technical details {#technical}
184186
@@ -187,10 +189,11 @@ What's really going on behind the scenes here? Briefly, only the data of the Urb
187189In layer 1, the [Ethereum Virtual Machine (EVM)](https://ethereum.org/en/developers/docs/evm/) guarantees the validity of state transitions, while for layer 2 transactions, each Urbit node guarantees the validity of the state transitions.
188190
189191Changes to the state of Urbit ID on layer 1 works as follows:
190− 1. A transaction is posted to the Ethereum blockchain.
191− 2. The EVM calculates the resulting state transition and checks its validity, then updates the state.
192− 3. Your urbit downloads the new state from an Ethereum node.
193− 4. Your urbit makes the final decision on whether the new state is valid.
192+
193+1. A transaction is posted to the Ethereum blockchain.
194+2. The EVM calculates the resulting state transition and checks its validity, then updates the state.
195+3. Your urbit downloads the new state from an Ethereum node.
196+4. Your urbit makes the final decision on whether the new state is valid.
194197
195198In practice, the fourth step is never used in layer 1. The primary change to our
196199security model is that we are cutting out step 2 and beefing up step 4. Your
@@ -217,4 +220,3 @@ post on the `urbit-dev` mailing list. Lastly, the primary working branch on
217220Github for the Urbit side of naive rollups is
218221[here](https://github.com/urbit/urbit/tree/philip/naive), though it is not the
219222only place code is accumulating.
220−
content/blog/security-and-continuity.md+3−5
@@ -1,7 +1,8 @@
11+++
22title = "Security and Continuity"
33description = "An update on our primary infrastructure milestones for 2020."
4−date = 2020-12-01
4+date = "2020-11-30"
5+
56[extra]
67author = "Galen Wolfe-Pauly"
78ship = "~ravmel-ropdyl"
@@ -20,7 +21,6 @@ For this year, we committed to completing two things: passing a third-party secu
2021
2122We’ve been steadily making progress on these two fronts, and I’m happy to report both are nearly complete. We’ll walk through some of the details here and then follow up in another post soon to report on how the final work turned out.
2223
23−
2424## Ames Audit
2525
2626Urbit OS is an ‘overlay OS’: it runs on top of (pretty much) any flavor of Unix. Each Urbit OS node communicates with other nodes over UDP using Ames, the Urbit-specific networking protocol.
@@ -41,18 +41,16 @@ The good thing about an audit scoped in this way is that we can trust the protoc
4141
4242As of the end of November 2020, the audit is very nearly complete, and we’ve handled all the important issues that were brought up. We’ll post the results and talk about our mitigation strategies in a future writeup.
4343
44−
4544## Continuity
4645
4746Urbit is designed to last a long time. What’s the use of a personal computer if it’s gonna disappear along with all the data you put in it? Ideally, you can put your Urbit on a USB stick, forget about it for ten years and have it work again when you plug it in. It’ll need to update for a while, but once our work on continuity is complete, your urbit should be able to upgrade itself through ten years of updates, all over the air.
4847
49−While Urbit is designed to upgrade seamlessly over the network we have occasionally run into issues that have caused us to reboot the entire network. Most of the time this is when some incompatibility between the interpreter and the kernel means we have to force everyone to do a hard reset to ensure compatibility between the two. Our current work on continuity addresses this. Soon, your urbit will tell you when your interpreter needs to be upgraded. At first this won’t be that different from an application notifying you to download an update. Eventually, we think we can make this a lot smoother.
48+While Urbit is designed to upgrade seamlessly over the network we have occasionally run into issues that have caused us to reboot the entire network. Most of the time this is when some incompatibility between the interpreter and the kernel means we have to force everyone to do a hard reset to ensure compatibility between the two. Our current work on continuity addresses this. Soon, your urbit will tell you when your interpreter needs to be upgraded. At first this won’t be that different from an application notifying you to download an update. Eventually, we think we can make this a lot smoother.
5049
5150A network reboot isn’t the only way that we can break continuity. Urbit is a general-purpose computer — which means you’re free to attempt to destroy it. If, for any reason, you do manage to screw the system up we want you to be able to get your data out and effectively reset continuity on a single node. We built the affordance for that a while ago, but before the end of the year we’ll also distribute tooling to migrate userspace data between hard resets.
5251
5352The combination of version negotiation and data migration should afford us the ability to run the network indefinitely into the future. Unfortunately, to get this change in, we’ll need to reset the network. We’re optimistic that this will be the last time we ever do it. And, given our data migration tooling, this breach won’t involve losing data.
5453
55−
5654## Status + conclusion
5755
5856We have been working with auditors since this summer and should have a report ready to publish in the next few weeks. Both version negotiation and data migration are in testing and are ready to be deployed.
content/blog/security-audit.md+46−46
@@ -1,7 +1,8 @@
11+++
22title = "Ames Security Audit and the Future of the Protocol"
33description = "Ames’ design has unparalleled potential to deter, mitigate, and recover from attacks, since every packet is authenticated and encrypted and backed by a stable, decentralized PKI."
4−date = 2020-12-18
4+date = "2020-12-17"
5+
56[extra]
67author = "Ted Blackman + Anthony Arroyo"
78ship = "~rovnys-ricfer + ~poldec-tonteg"
@@ -18,140 +19,139 @@ The security firm Leviathan has now finished their initial audit of the security
1819
1920I'm pleased to report they confirmed the cryptographic soundness of the protocol, namely that "a ship must have possession of their own valid Urbit key in order to authenticate as that ship and to send valid Ames messages. Additionally, no other ship except the two communicating may be able to decrypt or modify messages during transport."
2021
21−This means Ames uses cryptography in a mathematically sound manner that protects your privacy, keeps your secrets secret, and ensures nobody else will be able to impersonate you on the network. Since this was an architectural audit, it’s possible there are still vulnerabilities in the runtime implementation. Until the runtime has been hardened, Tlon continues to recommend against storing valuables in your ship.
22+This means Ames uses cryptography in a mathematically sound manner that protects your privacy, keeps your secrets secret, and ensures nobody else will be able to impersonate you on the network. Since this was an architectural audit, it’s possible there are still vulnerabilities in the runtime implementation. Until the runtime has been hardened, Tlon continues to recommend against storing valuables in your ship.
2223
2324Aside from a couple of minor issues that have already been resolved, there are three general classes of problem highlighted in their report that future work will need to address:
2425
25−+ Forward secrecy
26−+ Protection against denial of service attacks
27−+ Enforcement of social boundaries
26+- Forward secrecy
27+- Protection against denial of service attacks
28+- Enforcement of social boundaries
2829
2930Ames’ design allows for versioning of the protocol, which means that the proposed changes below can be deployed as over-the-air updates as they become more pressing concerns. This feature gives us confidence that we can address future security issues as they arise.
3031
31−We will need to improve all of these over the next couple of years, as independent lines of work. As the network grows: better forward secrecy will decrease the damage from a key getting compromised; resistance against denial of service attacks will make the Urbit network resilient to increasingly determined saboteurs; and stricter enforcement of social boundaries will let Urbit’s social networks remain safe and friendly despite potentially increasingly large numbers of bad actors and increasingly complex app ecosystems.
32+We will need to improve all of these over the next couple of years, as independent lines of work. As the network grows: better forward secrecy will decrease the damage from a key getting compromised; resistance against denial of service attacks will make the Urbit network resilient to increasingly determined saboteurs; and stricter enforcement of social boundaries will let Urbit’s social networks remain safe and friendly despite potentially increasingly large numbers of bad actors and increasingly complex app ecosystems.
3233
3334## Forward Secrecy
3435
35−A protocol is said to have forward secrecy if compromising a key used in a recent message doesn’t also compromise all previous messages. Similarly, a protocol is said to have backward secrecy -- also called future secrecy -- if compromising a key used in a previous message fails to compromise all future messages. Ames has some degree of both, but more would be better, to decrease the damage an attacker could inflict by compromising a key.
36+A protocol is said to have forward secrecy if compromising a key used in a recent message doesn’t also compromise all previous messages. Similarly, a protocol is said to have backward secrecy -- also called future secrecy -- if compromising a key used in a previous message fails to compromise all future messages. Ames has some degree of both, but more would be better, to decrease the damage an attacker could inflict by compromising a key.
3637
37−As it stands, an Urbit user can change their Ames keys whenever they want, by conducting an Ethereum transaction to update the Ames public key listed in the Azimuth contract, which implements Urbit’s PKI on Ethereum. Compromise of one Ames private key does not compromise earlier or later keys, so this has both forward and backward secrecy. The main drawback is that Ethereum transactions can be expensive, so key rotation is likely to be infrequent, and an attacker might be able to gain access to a long stretch of time by compromising a single key.
38+As it stands, an Urbit user can change their Ames keys whenever they want, by conducting an Ethereum transaction to update the Ames public key listed in the Azimuth contract, which implements Urbit’s PKI on Ethereum. Compromise of one Ames private key does not compromise earlier or later keys, so this has both forward and backward secrecy. The main drawback is that Ethereum transactions can be expensive, so key rotation is likely to be infrequent, and an attacker might be able to gain access to a long stretch of time by compromising a single key.
3839
3940Various key rotation “ratchet” schemes could be added to Ames to establish varying degrees of forward and backward secrecy, and other kinds of cryptographic protections beyond basic soundness, such as break-in recovery.
4041
41−Right now, changing a key through Azimuth is a manual process. It could be automated, possibly as one of a suite of services that an Urbit Provider will offer. Unfortunately, each key rotation costs the user money, so automating rotation could get prohibitively expensive.
42−Existing protocols, such as the Signal app's encrypted messaging protocol, the Noise protocol framework, and the Wireguard VPN protocol, use ephemeral Diffie-Hellman key exchange and KDF chaining to achieve forward and backward secrecy and self-healing.
42+Right now, changing a key through Azimuth is a manual process. It could be automated, possibly as one of a suite of services that an Urbit Provider will offer. Unfortunately, each key rotation costs the user money, so automating rotation could get prohibitively expensive.
43+Existing protocols, such as the Signal app's encrypted messaging protocol, the Noise protocol framework, and the Wireguard VPN protocol, use ephemeral Diffie-Hellman key exchange and KDF chaining to achieve forward and backward secrecy and self-healing.
4344
44−Ames could be upgraded to use one of these existing ratchet algorithms, or we might create an Urbit-specific variant optimized for the Urbit network. This is work that should be done, but fortunately it will not require any novel research or drastic changes to Ames’s architecture.
45+Ames could be upgraded to use one of these existing ratchet algorithms, or we might create an Urbit-specific variant optimized for the Urbit network. This is work that should be done, but fortunately it will not require any novel research or drastic changes to Ames’s architecture.
4546
4647While Urbit’s cryptographic protections don’t yet match those of Signal or a few other privacy-focused apps, Ames is cryptographically sound, and since Urbit updates itself over-the-air and is backed by a stable, decentralized PKI, I’m confident that the level of sophistication of Urbit’s cryptography has the potential to be world-class with just a bit more work.
4748
4849## Denial of Service
4950
50−A denial of service (DoS) attack against an Urbit ship is an attempt to overwhelm it remotely by sending it network data in such a way as to interfere with the ship’s ability to communicate with other ships or process other events -- usually by hogging its resources (computational power, memory, or bandwidth) until normal operation slows down or ceases entirely. Since the promise of Urbit is that everyone can run their own server, that server needs to be able to defend itself against DoS attacks. This is in fact one of the main impediments to running your own server in the modern world.
51+A denial of service (DoS) attack against an Urbit ship is an attempt to overwhelm it remotely by sending it network data in such a way as to interfere with the ship’s ability to communicate with other ships or process other events -- usually by hogging its resources (computational power, memory, or bandwidth) until normal operation slows down or ceases entirely. Since the promise of Urbit is that everyone can run their own server, that server needs to be able to defend itself against DoS attacks. This is in fact one of the main impediments to running your own server in the modern world.
5152
52−Right now, Urbit has no protection. Soon, it will need to at least be able to resist a simple attack carried out by an individual. Eventually, it should be able to resist a determined Distributed Denial of Service (“DDoS”) attack, which is more difficult.
53+Right now, Urbit has no protection. Soon, it will need to at least be able to resist a simple attack carried out by an individual. Eventually, it should be able to resist a determined Distributed Denial of Service (“DDoS”) attack, which is more difficult.
5354
54−There are two categories of DoS attacks in Urbit: authenticated and unauthenticated. An authenticated attack requires access to a ship's private key to construct valid Ames packets intended to overwhelm a target. All authenticated attacks will be handled primarily through enforcement of social boundaries, as discussed in the next section.
55+There are two categories of DoS attacks in Urbit: authenticated and unauthenticated. An authenticated attack requires access to a ship's private key to construct valid Ames packets intended to overwhelm a target. All authenticated attacks will be handled primarily through enforcement of social boundaries, as discussed in the next section.
5556
5657An unauthenticated DoS attack constructs packets that eventually fail to authenticate and decrypt but still overwhelm the target by causing it to waste resources (CPU, memory, disk, bandwidth) in such a way that it can't keep up with legitimate communications.
5758
58−An unauthenticated DoS attack relies on the lack of Sybil resistance of IP networks: it's possible to generate new IP addresses rapidly, and a determined attacker might also be able to spoof its sender IP address. This is best considered an IP-layer attack that must be handled mostly at the IP layer itself, by maintaining state about which IP addresses can be trusted and which can't, determined empirically and heuristically by the Urbit runtime. The best any higher-level protocol, such as Ames or TCP, can do is make it as cheap as possible for a DoS target to reject a bad packet.
59+An unauthenticated DoS attack relies on the lack of Sybil resistance of IP networks: it's possible to generate new IP addresses rapidly, and a determined attacker might also be able to spoof its sender IP address. This is best considered an IP-layer attack that must be handled mostly at the IP layer itself, by maintaining state about which IP addresses can be trusted and which can't, determined empirically and heuristically by the Urbit runtime. The best any higher-level protocol, such as Ames or TCP, can do is make it as cheap as possible for a DoS target to reject a bad packet.
5960
6061The overall strategy that Ames can take, as a protocol layering over the IP protocol, is to add an authentication procedure to each packet that can quickly identify bad packets, which an implementation will then use to mark that IP address as suspect and to refrain from adding the sender IP to a list of known-good IPs.
6162
62−Currently, Ames handles this by attempting to decrypt a message and rejecting the message on failure. This may be a more costly solution than other methods, such as attaching a signature or a MAC to each message. The way to mitigate unauthenticated attacks is to make bad packets fail faster by augmenting each packet with a signature or MAC to each packet, since those are faster to validate than encryption.
63+Currently, Ames handles this by attempting to decrypt a message and rejecting the message on failure. This may be a more costly solution than other methods, such as attaching a signature or a MAC to each message. The way to mitigate unauthenticated attacks is to make bad packets fail faster by augmenting each packet with a signature or MAC to each packet, since those are faster to validate than encryption.
6364
64−So far, we have identified three approaches that could be taken here. Of these three, Leviathan recommended the end-to-end HMAC solution, since that would not impose additional CPU requirements on packet-relay nodes, such as stars.
65+So far, we have identified three approaches that could be taken here. Of these three, Leviathan recommended the end-to-end HMAC solution, since that would not impose additional CPU requirements on packet-relay nodes, such as stars.
6566
66−+ Sign each packet, and any relay or final recipient could validate the signature
67−+ Wrap each packet in an HMAC, validated by the final receiver
68−+ Wrap each packet in a HMAC for each hop in a relay chain; each relay would validate and strip the previous HMAC and add a new one for the next hop
67+- Sign each packet, and any relay or final recipient could validate the signature
68+- Wrap each packet in an HMAC, validated by the final receiver
69+- Wrap each packet in a HMAC for each hop in a relay chain; each relay would validate and strip the previous HMAC and add a new one for the next hop
6970
70−Any of these solutions would be attempts to increase the rate at which the network could discard invalid packets, with different tradeoffs. I'll back up a bit to provide some context, and then I'll compare the approaches.
71+Any of these solutions would be attempts to increase the rate at which the network could discard invalid packets, with different tradeoffs. I'll back up a bit to provide some context, and then I'll compare the approaches.
7172
72−In any DoS solution, a planet will want to block or throttle IPs that have been sending it packets that fail to authenticate and decrypt. Ideally, a star will help protect planets for whom it’s relaying, too. Many different arrangements among galaxy, star, and planet are imaginable here, from an open policy to a policy wherein each packet has to come from a known-good IP. This sort of paranoid, closed-off arrangement might still not be enough to withstand a determined DDoS, but it's difficult for me to imagine doing better than that without launching Urbit-specific ISPs. Ames packets are cryptographically authenticated, so an Urbit ISP would actually be feasible.
73+In any DoS solution, a planet will want to block or throttle IPs that have been sending it packets that fail to authenticate and decrypt. Ideally, a star will help protect planets for whom it’s relaying, too. Many different arrangements among galaxy, star, and planet are imaginable here, from an open policy to a policy wherein each packet has to come from a known-good IP. This sort of paranoid, closed-off arrangement might still not be enough to withstand a determined DDoS, but it's difficult for me to imagine doing better than that without launching Urbit-specific ISPs. Ames packets are cryptographically authenticated, so an Urbit ISP would actually be feasible.
7374
74−This brings us back to the three possible ways of mitigating DoS from within the Ames protocol. They all involve adding a piece of authenticating information to each packet that can be verified more quickly than waiting for the cyphertext to fail to decrypt — Ames's symmetric encryption is authenticated, so it's not a cryptographic soundness issue, but the performance impact of trying to decrypt could be significant enough to make it hard to prevent a DoS.
75+This brings us back to the three possible ways of mitigating DoS from within the Ames protocol. They all involve adding a piece of authenticating information to each packet that can be verified more quickly than waiting for the cyphertext to fail to decrypt — Ames's symmetric encryption is authenticated, so it's not a cryptographic soundness issue, but the performance impact of trying to decrypt could be significant enough to make it hard to prevent a DoS.
7576
7677As-is, an Ames packet is basically `[protocol-version checksum sndr rcvr (nullable origin) cyphertext]` (visit [this PR](https://github.com/urbit/urbit/pull/4051#issue-530369627) for a full specification). Let’s walk through the construction of the packet and how it can be upgraded to offer different DOS mitigations.
7778
7879### DoS Mitigation Approach 1: Signature
7980
80−The first approach to DoS protection would be to add a signature to the packet. The signature would cover everything except the checksum and the origin, since those need to be swapped out by relays. The signature would probably obviate the need for the (20-bit) checksum, although we could also leave it in there if we can't figure out what else to do with those header bits.
81+The first approach to DoS protection would be to add a signature to the packet. The signature would cover everything except the checksum and the origin, since those need to be swapped out by relays. The signature would probably obviate the need for the (20-bit) checksum, although we could also leave it in there if we can't figure out what else to do with those header bits.
8182
8283#### Advantages of a signature over other approaches
8384
84−- It can be validated by anyone on the network. Relays would not need to modify it. This might also give it symmetry with the upcoming remote scry protocol, which might also sign every packet. I'm not quite sure this is an important property, actually, but it might theoretically make launching an Urbit ISP or internet backbone easier one day.
85+- It can be validated by anyone on the network. Relays would not need to modify it. This might also give it symmetry with the upcoming remote scry protocol, which might also sign every packet. I'm not quite sure this is an important property, actually, but it might theoretically make launching an Urbit ISP or internet backbone easier one day.
8586- It would be signed directly by the key listed on Ethereum, not something that might get ratcheted at some point for better forward secrecy — this could eventually lower the rate at which intermediate validators need their key caches invalidated, although this is a bit of a theoretical concern.
8687
8788#### Disadvantages of a signature over other approaches
8889
8990- Generating and validating a signature is significantly slower than generating and validating an HMAC.
90−- An ECDSA signature is 64 bytes, which is ~6% of a packet payload. As far as I can tell, it can't be compressed.
91+- An ECDSA signature is 64 bytes, which is ~6% of a packet payload. As far as I can tell, it can't be compressed.
9192- Since the signature could be validated by anyone, it doesn't attest to a specific communication channel, so it might not help as much with IP filtering.
9293
9394### DoS Mitigation Approach 2: End-to-End HMAC
9495
95−The second approach would be to use an HMAC instead of a signature, validated by the eventual receiver. This HMAC would also cover everything except the mug and origin. I'm calling this the "end-to-end HMAC" design. An HMAC requires a shared secret, for which we could use the same symmetric key that Ames uses.
96+The second approach would be to use an HMAC instead of a signature, validated by the eventual receiver. This HMAC would also cover everything except the mug and origin. I'm calling this the "end-to-end HMAC" design. An HMAC requires a shared secret, for which we could use the same symmetric key that Ames uses.
9697
9798#### Advantages of end-to-end HMAC
9899
99100- It's simple in some sense; relays don't need to do anything cryptographic.
100101- HMACs are much faster to create and validate than signatures.
101−- HMACs, since they're hashes, can be truncated arbitrarily and still maintain some security — to find hash collisions, you'd still have to guess what packet||shared-secret would hash to; it would just be a smaller search space. Since Ames's encryption already guarantees authentication and we'd just be using this as a performance optimization, I suspect we could get away with using one that's significantly smaller than a signature — I'm not sure how small, but if 4 bytes would be enough in practice, that would take up less than 0.5% of the space in a packet.
102+- HMACs, since they're hashes, can be truncated arbitrarily and still maintain some security — to find hash collisions, you'd still have to guess what packet||shared-secret would hash to; it would just be a smaller search space. Since Ames's encryption already guarantees authentication and we'd just be using this as a performance optimization, I suspect we could get away with using one that's significantly smaller than a signature — I'm not sure how small, but if 4 bytes would be enough in practice, that would take up less than 0.5% of the space in a packet.
102103
103104#### Disadvantages of end-to-end HMAC
104105
105−- Only the recipient can validate. This means the authentication couldn't be used by relays to discard invalid packets. The recipient could provide back-pressure out-of-band to a relay to ask the relay to discard packets from an IP with an invalid HMAC, but this is indirect and might need to filter backward through multiple relays to work properly.
106+- Only the recipient can validate. This means the authentication couldn't be used by relays to discard invalid packets. The recipient could provide back-pressure out-of-band to a relay to ask the relay to discard packets from an IP with an invalid HMAC, but this is indirect and might need to filter backward through multiple relays to work properly.
106107
107108### DoS Mitigation Approach 3: Point-to-Point HMAC
108109
109−The third approach, which is what I would build unless convinced otherwise, is what I'm calling "point-to-point HMAC". This design would include a different HMAC for each hop in a relay chain, instead of (or maybe in addition to) including one end-to-end HMAC.
110+The third approach, which is what I would build unless convinced otherwise, is what I'm calling "point-to-point HMAC". This design would include a different HMAC for each hop in a relay chain, instead of (or maybe in addition to) including one end-to-end HMAC.
110111
111−We have a couple different options for how to construct the shared secret for each hop. I would intuitively construct it using a Diffie-Hellman of my private signing key and your public signing key — the "networking keys" on Ethereum include a currently unused signing key in addition to the encryption key that Ames uses. This way even if we add more forward secrecy to Ames, changing the symmetric key used for encryption, relays wouldn't have to have their caches invalidated as often; the state required to perform relaying wouldn't be as tied to the state required to receive a message.
112+We have a couple different options for how to construct the shared secret for each hop. I would intuitively construct it using a Diffie-Hellman of my private signing key and your public signing key — the "networking keys" on Ethereum include a currently unused signing key in addition to the encryption key that Ames uses. This way even if we add more forward secrecy to Ames, changing the symmetric key used for encryption, relays wouldn't have to have their caches invalidated as often; the state required to perform relaying wouldn't be as tied to the state required to receive a message.
112113
113114#### Advantages of point-to-point HMAC
114115
115−- A star could perform some validation on every packet it's asked to relay. This makes it more difficult for an attacker to route a ton of packets to a planet through a star, or even through many relays. Signatures also have this property, but they're slower to verify. This approach and the signature approach, but not the end-to-end HMACs, force an attacker to use an (at least partially) authenticated attack in order to use a relay as a way to get to a planet.
116+- A star could perform some validation on every packet it's asked to relay. This makes it more difficult for an attacker to route a ton of packets to a planet through a star, or even through many relays. Signatures also have this property, but they're slower to verify. This approach and the signature approach, but not the end-to-end HMACs, force an attacker to use an (at least partially) authenticated attack in order to use a relay as a way to get to a planet.
116117- A planet could quickly validate that a relayed packet actually came from its star, not an attacker who's managed to spoof the star's IP address.
117118
118119#### Disadvantages of point-to-point HMAC
119120
120121- Not everyone on the network can validate a packet, unlike a signature.
121−- Each relay needs to validate and strip off the previous HMAC and create a new one before sending it. This should be quite fast, since an HMAC is just a hash, but it's still some CPU, and potentially creates an imbalance where an attacker could induce the relay to spend more CPU in validation than the attacker spent in constructing the packets.
122−- By itself, it doesn't validate the cyphertext in an end-to-end way. I suspect we might want to include both a per-route HMAC and an end-to-end one, especially if we use truncated HMACs — although per-route might be enough on its own, since if the receiver fails to validate a bunch of packets whose HMACs were validated by the relay, the receiver can ask the relay to block that whole Urbit address regardless of IP, so it shouldn't be possible to sustain that kind of attack for long.
122+- Each relay needs to validate and strip off the previous HMAC and create a new one before sending it. This should be quite fast, since an HMAC is just a hash, but it's still some CPU, and potentially creates an imbalance where an attacker could induce the relay to spend more CPU in validation than the attacker spent in constructing the packets.
123+- By itself, it doesn't validate the cyphertext in an end-to-end way. I suspect we might want to include both a per-route HMAC and an end-to-end one, especially if we use truncated HMACs — although per-route might be enough on its own, since if the receiver fails to validate a bunch of packets whose HMACs were validated by the relay, the receiver can ask the relay to block that whole Urbit address regardless of IP, so it shouldn't be possible to sustain that kind of attack for long.
123124
124125#### An Aside About Cryptographic Performance
125126
126−I'm not sure exactly how much faster HMAC is. According to DJB (https://ed25519.cr.yp.to/ed25519-20110705.pdf), an ECDSA signature can be created in around 30 microseconds and verified in around 100 microseconds. This source (https://www.jacksondunstan.com/articles/3206) suggests about 21 microseconds for HMAC-SHA256, so about a 1.5x improvement in generation speed and 5x in validation speed. We should verify these numbers for ourselves before making a decision.
127+I'm not sure exactly how much faster HMAC is. According to DJB (https://ed25519.cr.yp.to/ed25519-20110705.pdf), an ECDSA signature can be created in around 30 microseconds and verified in around 100 microseconds. This source (https://www.jacksondunstan.com/articles/3206) suggests about 21 microseconds for HMAC-SHA256, so about a 1.5x improvement in generation speed and 5x in validation speed. We should verify these numbers for ourselves before making a decision.
127128
128129### DoS Protection Strategy and Timeline
129130
130−Tlon is not currently pursuing adding any of the extra cryptographic authentication on Ames packets described above. Since this is ultimately a performance issue, there are other more pressing performance issues that we could improve upon before decryption will become the limiting factor in how many packets can be processed by a ship. We will revisit this authentication performance question once some of the low-hanging fruit has been done, perhaps roughly a year from now.
131+Tlon is not currently pursuing adding any of the extra cryptographic authentication on Ames packets described above. Since this is ultimately a performance issue, there are other more pressing performance issues that we could improve upon before decryption will become the limiting factor in how many packets can be processed by a ship. We will revisit this authentication performance question once some of the low-hanging fruit has been done, perhaps roughly a year from now.
131132
132133Since the audit, we’ve already improved the Ames packet format to allow faster parsing, faster validation of basic fields, and faster relaying; in the future, increases in performance of Nock execution and inter-process communication between Urbit's I/O process and Nock worker would allow Urbit to absorb somewhat more punishment before service can be effectively denied.
133134
134135## Enforcement of Social Boundaries
135136
136−While Urbit needs to rely largely on its runtime to mitigate unauthenticated attacks, any attack conducted from an Urbit ship needs to be handled inside Arvo itself, not just by IP filtering in the runtime. Just like in any DoS, an attacker ship might try to induce you to use too much memory, CPU, or disk space in order to sabotage normal operation. An authenticated attack is harder to define than an unauthenticated attack, because it depends on what social relationship the attacker and target have, and it involves valid, authenticated Ames packets; once discovered, though, it’s easier to mitigate, because it can use Urbit’s permanent identity system to enforce social consequences, i.e. stop listening to that Urbit address and possibly encourage others to do so as well.
137+While Urbit needs to rely largely on its runtime to mitigate unauthenticated attacks, any attack conducted from an Urbit ship needs to be handled inside Arvo itself, not just by IP filtering in the runtime. Just like in any DoS, an attacker ship might try to induce you to use too much memory, CPU, or disk space in order to sabotage normal operation. An authenticated attack is harder to define than an unauthenticated attack, because it depends on what social relationship the attacker and target have, and it involves valid, authenticated Ames packets; once discovered, though, it’s easier to mitigate, because it can use Urbit’s permanent identity system to enforce social consequences, i.e. stop listening to that Urbit address and possibly encourage others to do so as well.
137138
138139There are a couple of different kinds of authenticated attack: attempts to exploit vulnerabilities in the Nock worker (the interpreter, allocator, and jets) by causing particular Nock code to run, and attempts to induce the target to exhaust various computational resources.
139140
140−Protecting against attempts to break out of the sandbox and hijack or otherwise interfere with the Unix process running Nock will require a process of hardening, fuzzing, and likely further security audits specifically evaluating the security of that boundary. This is largely out of scope of the Ames protocol itself, which was the subject of this audit.
141−
142−This leaves us with the latter case: resource exhaustion attacks. A peer could try to get my ship to use too much RAM, disk, CPU, or bandwidth by sending it valid Ames packets. This represents a social problem: a person on the network is trying to interfere with me. It's what's known in blockchain circles as an "attributable fault": once the attack is detected, it's trivial to determine the identity of the culprit.
141+Protecting against attempts to break out of the sandbox and hijack or otherwise interfere with the Unix process running Nock will require a process of hardening, fuzzing, and likely further security audits specifically evaluating the security of that boundary. This is largely out of scope of the Ames protocol itself, which was the subject of this audit.
143142
144−Once the attacker’s Urbit address is known, Urbit will fall back on the Sybil resistance of its identity system: there are a finite number of identities, each of which costs some money. Because Urbit identities are relatively permanent, they can be blocked permanently. As long as the expected value of an authenticated attack is less than the cost of the identity, the attacks won't happen very much — they'll cost money to sustain, instead of being self-perpetuating.
143+This leaves us with the latter case: resource exhaustion attacks. A peer could try to get my ship to use too much RAM, disk, CPU, or bandwidth by sending it valid Ames packets. This represents a social problem: a person on the network is trying to interfere with me. It's what's known in blockchain circles as an "attributable fault": once the attack is detected, it's trivial to determine the identity of the culprit.
145144
146−Attacks like this are best thought of as attempts to violate social boundaries. I don't want you using up too many of my resources; that's a social boundary, and an attempt to force my ship to spend its resources on your behalf constitutes a violation of this boundary. The strategy for mitigating these attacks is to impose social and, indirectly, economic consequences on the perpetrators. The main social consequence is other ships refusing to communicate with you anymore.
145+Once the attacker’s Urbit address is known, Urbit will fall back on the Sybil resistance of its identity system: there are a finite number of identities, each of which costs some money. Because Urbit identities are relatively permanent, they can be blocked permanently. As long as the expected value of an authenticated attack is less than the cost of the identity, the attacks won't happen very much — they'll cost money to sustain, instead of being self-perpetuating.
147146
148−Some of this mitigation will take place in the Arvo kernel, and some will need to be application-specific. To protect the system from attackers, the kernel needs to be able to free space (Urbit is a single-level store, so there's no distinction between disk and RAM from Arvo's perspective) taken up by unfinished messages sent by peers. This can be done by allowing an application to ask Ames to delete partially received messages from a peer, generally replacing the received packets with an intent to nack (negative acknowledgment) to indicate that the transaction the peer wanted me to perform has been rejected.
147+Attacks like this are best thought of as attempts to violate social boundaries. I don't want you using up too many of my resources; that's a social boundary, and an attempt to force my ship to spend its resources on your behalf constitutes a violation of this boundary. The strategy for mitigating these attacks is to impose social and, indirectly, economic consequences on the perpetrators. The main social consequence is other ships refusing to communicate with you anymore.
149148
150−Applications should also be able to set resource usage policies that the Arvo kernel will enforce. For example, a chat application should configure Ames to reject any chat messages larger than, say, two hundred kilobytes. A file-sharing application would need a much larger per-message limit (ideally no per-message limit), but it might need to place a cap on its bandwidth usage to make sure lower-latency communications aren't swamped by a large file transfer. This kernel/application interface starts to resemble a permissioning or capabilities system, and it could be built as part of the crucial larger project of providing for configurable application permissions.
149+Some of this mitigation will take place in the Arvo kernel, and some will need to be application-specific. To protect the system from attackers, the kernel needs to be able to free space (Urbit is a single-level store, so there's no distinction between disk and RAM from Arvo's perspective) taken up by unfinished messages sent by peers. This can be done by allowing an application to ask Ames to delete partially received messages from a peer, generally replacing the received packets with an intent to nack (negative acknowledgment) to indicate that the transaction the peer wanted me to perform has been rejected.
151150
152−To close the loop on enforcing social boundaries, reputation information should be shared across ships. This will likely be done by building one or more applications that share statistics and block operations. Some forms of reputation are likely to be globally shared, whereas others are likely to be multipolar, i.e. some people like you and some don’t. Generally, the lower the layer of the attack, the more global the reputation effect will be; the higher the layer, the more multipolar. An attempt to spam the network with millions of malicious packets will cause most people not to want to talk to you; sending me a movie I found mediocre is probably not even information worth sharing with anyone else.
151+Applications should also be able to set resource usage policies that the Arvo kernel will enforce. For example, a chat application should configure Ames to reject any chat messages larger than, say, two hundred kilobytes. A file-sharing application would need a much larger per-message limit (ideally no per-message limit), but it might need to place a cap on its bandwidth usage to make sure lower-latency communications aren't swamped by a large file transfer. This kernel/application interface starts to resemble a permissioning or capabilities system, and it could be built as part of the crucial larger project of providing for configurable application permissions.
153152
153+To close the loop on enforcing social boundaries, reputation information should be shared across ships. This will likely be done by building one or more applications that share statistics and block operations. Some forms of reputation are likely to be globally shared, whereas others are likely to be multipolar, i.e. some people like you and some don’t. Generally, the lower the layer of the attack, the more global the reputation effect will be; the higher the layer, the more multipolar. An attempt to spam the network with millions of malicious packets will cause most people not to want to talk to you; sending me a movie I found mediocre is probably not even information worth sharing with anyone else.
154154
155155## Conclusion
156156
157−Ames’ design has unparalleled potential to deter, mitigate, and recover from attacks, since every packet is authenticated and encrypted and backed by a stable, decentralized PKI. It feels good to have our design for encryption and authentication be confirmed by a third party as cryptographically sound, and we know more or less what we need to build to reach the full security potential of the platform, including the steps outlined here.
157+Ames’ design has unparalleled potential to deter, mitigate, and recover from attacks, since every packet is authenticated and encrypted and backed by a stable, decentralized PKI. It feels good to have our design for encryption and authentication be confirmed by a third party as cryptographically sound, and we know more or less what we need to build to reach the full security potential of the platform, including the steps outlined here.
content/blog/simple-durable-yours.md+2−4
@@ -1,18 +1,16 @@
11+++
22title = "Simple, Durable, Yours"
3−date = 2019-10-17
3+date = "2019-10-16"
44description = "We built Urbit from scratch to be a system that’s simple, durable, and yours. Everything that computing today is not — but should be."
5−[extra]
5+extra = { }
66+++
77
88We live in a world dense with digital services. We see the world through them, we depend on them completely, and they’re not going away. They’re only becoming more ubiquitous.
99
1010But computers are a mess.
1111
12−
1312<img class="ba mv5 w-100" src="https://media.urbit.org/site/understanding-urbit/simple-durable-yours/simple-durable-yours-notifications.svg">
1413
15−
1614We spend all our time switching between services, juggling logins and different interfaces. And once we’re logged in, the services we use harvest our data, spy on us, and often shut down with little warning.
1715
1816If computers are going to be a part of our lives for generations to come, we need a sound foundation for them. We need a _system_, not a grab bag of apps and services. Urbit is that system.
content/blog/stable-arvo.md+11−13
@@ -1,7 +1,8 @@
11+++
22title = "Stable Arvo"
3−date = 2019-11-20
3+date = "2019-11-19"
44description = "This year we set out to get Arvo to a point that we can credibly call ‘stable.' "
5+
56[extra]
67author = "Anthony Arroyo"
78ship = "~poldec-tonteg"
@@ -14,21 +15,20 @@ image = "https://media.urbit.org/site/posts/essays/stable-arvo.png"
1415
1516We want your Urbit to last forever. We want an ordinary Urbit user to never worry about their Urbit breaking, going away or failing unexpectedly. We don’t just want this — we think this is one of the most incredible things Urbit can actually deliver.
1617
17−In order to get closer to an Urbit that can last forever, we set for ourselves the goal of getting Arvo (the kernel of what we’ve been calling ‘Urbit OS’) to a point that we can credibly call ‘stable’ by the end of 2019.
18+In order to get closer to an Urbit that can last forever, we set for ourselves the goal of getting Arvo (the kernel of what we’ve been calling ‘Urbit OS’) to a point that we can credibly call ‘stable’ by the end of 2019.
1819
19−But what do we mean exactly by ‘stable’? For something meant to last far into the future, stability really means *resilience*. Arvo has to both run and upgrade itself without ever breaking or falling into an unrecoverable state.
20+But what do we mean exactly by ‘stable’? For something meant to last far into the future, stability really means _resilience_. Arvo has to both run and upgrade itself without ever breaking or falling into an unrecoverable state.
2021
2122Getting Arvo to this point doesn’t quite achieve the user-level goal we’re hoping to achieve. But if you’re comfortable doing a bit of system administration, Arvo itself should need almost no maintenance.
2223
2324To achieve stability in practice Arvo needs three things:
2425
25−- The Arvo network (Ames) has to be stable
26+- The Arvo network (Ames) has to be stable
2627- Arvo can’t easily fall into an unrecoverable state
2728- Arvo has to have a clear and formalized upgrade mechanic
2829
2930All of these are actively being worked on, and are mostly near completion. Let’s walk through them one by one.
3031
31−
3232### A new Ames
3333
3434To ensure that Arvo can upgrade itself forever, it needs a network to deliver the updates. Toward this end we’ve put a lot of work into making Ames, the Urbit networking protocol, as reliable as possible.
@@ -41,7 +41,6 @@ We’ve been working on that rewrite, codenamed Alef, for a few months now. Alef
4141
4242We expect to switch to Alef in a continuity breach (network reset) during this quarter. This will be a huge step toward resilience. A networking protocol we can trust to deliver updates is essential for a computer that will last a long time.
4343
44−
4544### Recoverability
4645
4746Another barrier to stability with existing Urbit is that a ship can, under specific conditions, fall into a terminal state. If part of your ship’s state relies on event in the future and this event crashes, then that part of the state can become unrecoverable. Consider, for example, an event that is set to be triggered by a timer. If this timer crashes, that event will never happen. This is a huge problem.
@@ -52,25 +51,24 @@ This architecture means that errors have to be considered not simply as an excep
5251
5352Deterministic errors are currently handled within the virtual interpreter, Mock, and result in a “bail: exit.” They can be handled “within” Arvo and are never written to the event log. The real difficulty lies with non-deterministic errors, specifically ones can potentially cause other events.
5453
55−An obvious case of causally-connected events is a timer; any code that sets a timer eventually suspends itself, waiting to be awoken. And yet, if the subsequent timer event were to crash, the state machine awaiting it would remain suspended, expecting a transition that can and will not
54+An obvious case of causally-connected events is a timer; any code that sets a timer eventually suspends itself, waiting to be awoken. And yet, if the subsequent timer event were to crash, the state machine awaiting it would remain suspended, expecting a transition that can and will not
5655occur.
5756
58−We believe that we have a general scheme that accounts for both classes of error. We’ve formalized this and will use it going forward to avoid falling into inconsistent states.
57+We believe that we have a general scheme that accounts for both classes of error. We’ve formalized this and will use it going forward to avoid falling into inconsistent states.
5958
6059Our solution to this problem is simple: if Arvo or one of its vanes crashes while processing an event, the fact of the failed event itself becomes a new event. The runtime injects an error notification in the event log, named, as is befitting of a failed event: %crud.
6160
6261In the case of a failed timer event, the error notification is routed back to the code that set the timer and communicates the following: you were expecting to be woken up, but, when you were, you crashed. The code in question could then consider the logical operation of which the timer was a part to have failed, or perhaps it could try again. In any case, it must not crash when handling the error notification, and it must not continue to expect to be woken up.
6362
64−This quarter, building on previous work, we’ve built on the %crud pattern and mapped the protocols between the vanes and between arvo and vere. This allows us to make sure that %cruds are all handled (so as to avoid the crash discussed above) and, in future iterations of the vanes, know what conditions need to be accommodated to avoid introducing regressions.
63+This quarter, building on previous work, we’ve built on the %crud pattern and mapped the protocols between the vanes and between arvo and vere. This allows us to make sure that %cruds are all handled (so as to avoid the crash discussed above) and, in future iterations of the vanes, know what conditions need to be accommodated to avoid introducing regressions.
6564
6665By adopting this pattern and virtualizing userspace, we can make completely sure that code running in the kernel or an app can’t cause your ship to get into an inconsistent state.
6766
68−
6967### Telescoping Kelvins
7068
71−Finally, in order for a ship to reliably receive and apply upgrades, we need to formalize and enforce a versioning scheme inside the system.
69+Finally, in order for a ship to reliably receive and apply upgrades, we need to formalize and enforce a versioning scheme inside the system.
7270
73−Most software simply increases its version number on each release. Nock (our VM spec) and Hoon, on the other hand, uses kelvin versioning. Kelvin versioning doesn’t infinitely increase version numbers. Instead, we decrease the version number on each significant change in the hope that our software will eventually not need to change at all. Infrastructure, if it’s going to be truly reliable, should eventually reach absolute zero.
71+Most software simply increases its version number on each release. Nock (our VM spec) and Hoon, on the other hand, uses kelvin versioning. Kelvin versioning doesn’t infinitely increase version numbers. Instead, we decrease the version number on each significant change in the hope that our software will eventually not need to change at all. Infrastructure, if it’s going to be truly reliable, should eventually reach absolute zero.
7472
7573Nock is already nearly frozen at 4K. A change to Nock is a major event.
7674
@@ -84,7 +82,7 @@ The mechanism for the kernel is pretty simple. In short, we’ll enforce that ev
8482
8583The versioning scheme between the runtime and Arvo is similarly straightforward. We’ll build in an affordance for notifying the user if we need them to manually upgrade the interpreter. This ensures that API changes between interpreter and kernel can always be non-breaking. Someday interpreter changes can be done over the air (like your browser downloading its own upgrades), but we’re not there yet.
8684
87−What’s important about these two things is that they let us take continuity seriously. "Continuity" or "permanence" is arguably Urbit's killer feature: you start your ship, it just works, forever. Back it up on a USB drive, throw it in a drawer for forty years, and upon reconnecting to the network in 2059 (and pulling down all the updates you've missed) you're back in the game.
85+What’s important about these two things is that they let us take continuity seriously. "Continuity" or "permanence" is arguably Urbit's killer feature: you start your ship, it just works, forever. Back it up on a USB drive, throw it in a drawer for forty years, and upon reconnecting to the network in 2059 (and pulling down all the updates you've missed) you're back in the game.
8886
8987With the recent 0.9.0 release we’ve gotten to the point where we can make almost all our upgrades over the air. Even the language is now upgradeable over the wire.
9088
content/blog/state-of-urbit.mdnew file+95
@@ -0,0 +1,95 @@
1++++
2+title = "State of Urbit"
3+date = "2021-08-24"
4+description = "A year in review"
5+[extra]
6+author = "Galen Wolfe-Pauly"
7+ship = "~ravmel-ropdyl"
8+image = "https://media.urbit.org/site/posts/essays/cities-6.jpg"
9++++
10+
11+![](https://media.urbit.org/site/posts/essays/cities-6.jpg)
12+
13+In the past year, as Urbit has become more reliable and easier to use, we find that we&#39;re spending almost all of our time on the network. We&#39;ve disappeared into the system we&#39;ve been building, and it&#39;s a pleasure to be on Urbit. There&#39;s nowhere else we&#39;d rather be.
14+
15+If you&#39;re on the network with us you can see the system being built and getting better in real time. Bug fixes and new features appear on your ship constantly. The community is actively planning the future of the system _using the system itself_. At Tlon, we have the unparalleled pleasure of working on the system, _on the system_. This feels great, but for those of you who aren&#39;t on the network, it can look as if we&#39;ve disappeared.
16+
17+Right now, Urbit is not for my non-technical friends. But everyone can tell that mainstream apps are getting worse and most feel a desire for change. We want Urbit to be as easy to use as a conventional service. Or, at least as easy to use as Signal. And we&#39;re getting pretty close to that.
18+
19+In this post I&#39;ll cover the progress we&#39;ve made since releasing OS 1 so those who aren&#39;t on the network can get a sense of what we&#39;ve been up to and where we&#39;re going. We&#39;ve built a great communication tool called Landscape, we are improving Urbit&#39;s ease of onboarding, and we&#39;re launching an entire software distribution system. We have a lot of work on our plate.
20+
21+Okay, let&#39;s talk about where we currently stand and where we&#39;re heading.
22+
23+**Arc**
24+
25+Let&#39;s start at the top: we&#39;re working to build a new network and operating system for everyday cloud computing. We think everyone deserves to control and shape the tools they use to communicate and collaborate.
26+
27+Or, to put it another way: the apps and services we have today are confusing, annoying, and overly complicated. The only way out is to start at the foundation by building a new software stack. Once we have a cloud computing stack that an individual can own and completely control, the old hope that computers can be tools of freedom will return. We haven&#39;t forgotten the original vision of software as a fun, free, flexible everyday tool.
28+
29+This is a hilariously ambitious thing to try to do, we know. This is what makes it fun. So far, we just try to move step-by-step without overhyping what we&#39;re doing. Building a new platform for networked computing is both a technical and social problem. The technology has to work exceptionally well and the community has to care for it and move it forward.
30+
31+Our first step was simply to build a prototype, then to refine it into something that could plausibly work. Then, most recently, take that plausible prototype and build a user experience we liked enough to depend on it from day-to-day.
32+
33+In the last eighteen months we&#39;ve done exactly that. We depend on Urbit day-to-day and have shipped a tool that has become a home for numerous cultures and communities who are invested in moving the system forward. We first called that tool OS 1 but now it&#39;s known as Landscape.
34+
35+First, let&#39;s talk about the general arc of OS 1 → Landscape, both the successes and challenges. Then we&#39;ll talk about our next step, which is to create an independent and community supported software ecosystem.
36+
37+**OS 1 → Landscape**
38+
39+The tools we use shape the way we think. So how could we build better tools with old broken ones? We needed to cut our reliance on old tools that couldn&#39;t care less about how people actually work and live. The only thing they maximized was distraction and dependence. We needed something that was fundamentally private, durable, and flexible. Above all, we needed something that actually belonged to us.
40+
41+Building Urbit involves a lot of communication and collaboration. In order to move Urbit forward we knew that we needed a place to converse and connect, and we knew that place had to be on Urbit itself. We didn&#39;t need a Slack or a Discord or a Google Drive or a Reddit. We needed all of those things, in one place, that actually belonged to us.
42+
43+We experimented, built things, threw them away, and then eventually built and [launched OS 1](https://www.youtube.com/watch?v=71ViyftPkGk).
44+
45+OS 1, now Landscape, is a simple tool for bringing groups together to communicate and stay connected. When a real physical community goes online they immediately become fragmented between various apps. Perhaps a Slack channel coupled with some Notion notebooks and a Telegram channel works for some people. It&#39;s easy to imagine other permutations, and you probably are already in at least two or three. These duct-taped stacks are not only ugly and confusing, but your day to day computing is spread thin and remains in the control of companies—not you.
46+
47+Urbit is a decentralized network but Landscape is for re-centralizing your communication. Users can form groups which share a set of channels; each channel can be either a chat, a notebook or a collection of links. This means groups can communicate flexibly, exactly how they want. And since Landscape is built on Urbit, each group is private and peer to peer; data is only shared between people in the group; each community on Landscape is completely independent. Communities own their data and last as long as they need to.
48+
49+This combination of a flexible unified interface on a decentralized platform you can trust feels really good.
50+
51+When OS 1 was first released, it was slow, buggy, and frustrating—but we loved it and wanted it to be better. We spent the next nine months making sweeping changes to take it from releasable prototype to pretty-nice first version. We rewrote the frontend completely, massively improved the performance of Urbit OS itself, and overhauled the interface. It was an enormous collective effort.
52+
53+By the end of 2020 we had renamed OS 1 to Landscape and the user experience was far better. We [announced our hosting service](https://www.youtube.com/watch?v=w3qKe_WZr50) and onboarded close friends to help us test the system. I [wrote a little](<[https://tlon.io/news/landscape-now/](https://tlon.io/news/landscape-now/)>) about using Landscape from day-to-day around that time.
54+
55+Landscape wasn&#39;t just a useful tool for us, but it was something that other communities were starting to use in earnest. It seemed like Landscape could be a great place for people to grow new private communities, so long as we could onboard new users effectively. Hosting is a huge piece of the puzzle, since we need non-technical people to be able to use this wonderful platform as easily as its mainstream competitors.
56+
57+At this point (early this year), we encountered some pretty serious hurdles.
58+
59+To use Urbit, you need an Urbit ID. Each one of these is an NFT (something that no one cared about when we first launched Urbit ID). The basic idea is that an ID should cost something so that they aren&#39;t used abusively. But, in late 2020 the combination of a crypto bull market and congestion on the Ethereum network caused the transaction fee for buying an Urbit ID to increase from ~$1-2 to ~$100. An Urbit ID should cost _something_, but \&gt;$100 is too much of a barrier for entry. We knew that this could happen and started researching solutions late last year, ultimately deciding to [implement a solution ourselves](https://urbit.org/blog/rollups/).
60+
61+The tough part about having an identity verified on the blockchain is that you become vulnerable to unpredictable volatility. We saw a period of painfully high prices, followed by a dip, followed by another stretch of extremely high prices. We opted to continue releasing Landscape updates and moving the system forward despite the fact that it became prohibitively expensive to onboard people. Luckily, our solution to this problem should go live this summer, and will reduce the cost of onboarding about 60x. The best part is that it is a permanent solution so we&#39;ll never have to face this problem again.
62+
63+The other challenge to scaling the onboarding process is hosting.
64+
65+We have a functional hosting structure but we want it to be fully automated and featured. We&#39;ve been able to onboard friends and enthusiasts which has taught us a lot about how the system should work. But hosting has to be easy for anyone to join and get online quickly. Without an automated invite flow and it&#39;s not ready for prime time.
66+
67+We&#39;ve made great progress on this front. We are currently testing improvements internally and aim to have a final version ready simultaneously with lower planet fees. Then, at long last, we can comfortably invite friends to get on the network without ever leaving the browser.
68+
69+It&#39;s worth mentioning that hosting is very much a Tlon Corporation project. Urbit is a platform owned, maintained, and developed by the people that use it (along with the nascent Urbit Foundation). Tlon, while also contributing to the Urbit project, ultimately wants to produce applications and services on Urbit. Hosting is one of those projects. Hosting makes Urbit easy, approachable, and usable without the compromises involved in using a conventional service. Since we&#39;ll be one of many Urbit-related providers, Tlon won&#39;t be the only host. There are already a few others (like [UrbitHost](https://urbithost.com/)) getting off the ground, which is fantastic.
70+
71+**Landscape → Grid**
72+
73+As the world has become more physically distributed we rely on our digital tools to keep our communities connected. The rise of DAOs, collectives, squads, and alternative community governance structures underscores the importance of tools like Landscape that communities can actually own and control.
74+
75+Our first goal was to find out if we could build something really good on top of Urbit. We did that. And we&#39;re continuing to lower the barrier to entry. We&#39;ve also got an Urbit &#39;messenger&#39; iOS app in the works that&#39;s really nice.
76+
77+Landscape is great, but in the long run Urbit is meant to be a platform for anyone to build on top of. Urbit is a computer, not just a single communications app like Landscape. The whole point of Urbit is to make it easy for an individual to run their own general-purpose computer in the cloud. Your Urbit isn&#39;t just meant to run Landscape it&#39;s meant to run any sort of application. And that&#39;s where we&#39;re going next.
78+
79+Grid is a holistic interface for interacting with your Urbit node. Landscape, as it&#39;s known today, will become one of many apps that can be launched. Perhaps most importantly, Grid will have peer-to-peer software distribution over the network. This means you can, as a developer, build something, let a friend sync it over the network, and never have to run a dedicated distribution server. Or, as an everyday user, you can run software on your private Urbit node without the developer ever being involved.
80+
81+Urbit isn&#39;t an OS in the traditional sense—it&#39;s an &#39;overlay&#39; OS. It has to run on top of something else. But Urbit _is_ an OS in the sense that it&#39;s general-purpose. And our goal in building interfaces for Urbit is to deliver that feeling of openness and flexibility to the user. Grid is a major step toward that goal.
82+
83+Not only should a community own their communication tools, they should be able to run and host their own cloud software. They shouldn&#39;t need to rely on providers to store their data, run the application, and determine how their digital life will function.
84+
85+Grid will surely go through the same process that Landscape did. It&#39;ll start as a working first version that will inspire us to refine and make it better. But, unlike Landscape, Grid opens up an entirely new frontier for what can be done on Urbit.
86+
87+We&#39;re putting together our first conference on Oct 15-17th to inaugurate Urbit as an integrated platform and distribution system for new applications. [Tickets for Assembly 2021 are already available](https://checkout.eventcreate.com/assembly2021/select-buy). Tlon is going to Austin!
88+
89+**Closing**
90+
91+Urbit is a deeply optimistic project. Although the digital world seems more broken than ever, we&#39;re confident that something else is possible. We have already created software that people use everyday. We want everyone to have the experience that we do, and we want that experience to continue to get better. Beautiful, reliable infrastructure that communities can build on will have a significant impact on the world. The end game of connected computers doesn&#39;t have to be dystopian.
92+
93+For those of you who aren&#39;t directly involved with the project, I hope this gives you a snapshot of where we are. If we were on an Antarctic expedition the postcard would read something like &#39;Team is well-fed, healthy and motivated. Making great progress.&#39;
94+
95+With that, I&#39;ll get back to work.
content/blog/the-100-year-computer.md+13−9
@@ -1,8 +1,12 @@
11+++
22title = "The 100-Year Computer"
3−date = 2019-05-14
4−description = "One way to think about Urbit: as a \"100-year computer.\""
5−aliases = ["/posts/essays/the-100-year-computer/", "/posts/the-100-year-computer"]
3+date = "2019-05-13"
4+description = 'One way to think about Urbit: as a "100-year computer."'
5+aliases = [
6+ "/posts/essays/the-100-year-computer/",
7+ "/posts/the-100-year-computer"
8+]
9+
610[extra]
711author = "Galen Wolfe-Pauly"
812ship = "~ravmel-ropdyl"
@@ -11,16 +15,16 @@ image = "https://media.urbit.org/site/posts/essays/100-year-computer-1.png"
1115
1216![](https://media.urbit.org/site/posts/essays/100-year-computer-1.png)
1317
14−Around the Tlon office, we’re always looking for more concise ways to describe what we do. We kicked around ‘personal server’ for a long time. It’s pretty close. ‘Personal cloud computer’ did okay for a while, but it’s a little confusing.
18+Around the Tlon office, we’re always looking for more concise ways to describe what we do. We kicked around ‘personal server’ for a long time. It’s pretty close. ‘Personal cloud computer’ did okay for a while, but it’s a little confusing.
1519
16−One way to think about Urbit is as a 100-year computer.
20+One way to think about Urbit is as a 100-year computer.
1721
18−A 100-year computer has to be durable, reliable and permanent. It has to never lose data or fail in unpredictable ways. It has to be continuous, meaning it should never need to be updated by the user. If I put it in a closet for 10 years and take it out, it should work again without any intervention.
22+A 100-year computer has to be durable, reliable and permanent. It has to never lose data or fail in unpredictable ways. It has to be continuous, meaning it should never need to be updated by the user. If I put it in a closet for 10 years and take it out, it should work again without any intervention.
1923
20−And, perhaps most importantly, it should be easy and enjoyable to use. Both for a casual user and for a technical person. If it’s not enjoyable to use, and doesn’t actually *get used*, it’s never going to survive for 100 years.
24+And, perhaps most importantly, it should be easy and enjoyable to use. Both for a casual user and for a technical person. If it’s not enjoyable to use, and doesn’t actually _get used_, it’s never going to survive for 100 years.
2125
2226In theory we could all be using Apple I’s today, but they’re a bit cumbersome. In large part that’s because they don’t update themselves. Those magnetic tapes don’t strike me as particularly durable either.
2327
24−Imagine that a computer was something you kept forever. It would comfortably store your entire life: your writing, photos, blood tests, even your genome. Your computer would never show you ads, interrupt you against your wishes, or send your data to someone else without your permission.
28+Imagine that a computer was something you kept forever. It would comfortably store your entire life: your writing, photos, blood tests, even your genome. Your computer would never show you ads, interrupt you against your wishes, or send your data to someone else without your permission.
2529
26−Imagine a computer that was extremely valuable to you, that you’d pay thousands of dollars to recover, but you used *less* than the one you do today.
30+Imagine a computer that was extremely valuable to you, that you’d pay thousands of dollars to recover, but you used _less_ than the one you do today.
content/blog/the-dao-as-a-lesson-in-decentralized-governance.md+100−94
@@ -1,18 +1,24 @@
11+++
22title = "The DAO as a Lesson in Decentralized Governance"
3−date = 2016-06-24
3+date = "2016-06-23"
44description = "What's the right lesson for the decentralization community to learn from the collapse of the DAO?"
5−aliases = ["/posts/essays/the-dao-as-a-lesson-in-decentralized-governance", "/posts/the-dao-as-a-lesson-in-decentralized-governance", "/blog/dao"]
5+aliases = [
6+ "/posts/essays/the-dao-as-a-lesson-in-decentralized-governance",
7+ "/posts/the-dao-as-a-lesson-in-decentralized-governance",
8+ "/blog/dao"
9+]
10+
611[extra]
712author = "Curtis Yarvin"
813ship = "~sorreg-namtyv"
914+++
15+
1016What's the right lesson for the decentralization community to
1117learn from the collapse of the DAO?
1218
1319Perhaps the simplest lesson is that even decentralized networks
14−need governments, and have governments. Every network is a
15−state. Every state has a government.
20+need governments, and have governments. Every network is a
21+state. Every state has a government.
1622
1723## Decentralization theater considered harmful
1824
@@ -30,79 +36,79 @@ A network without decentralization theater is one that admits:
3036- any new state is born at war with full emergency powers.
3137- limiting and/or eliminating governance is a slow, hard task.
3238
33−TLDR: true decentralization isn't just a technical problem. It's
34−also a political problem, and not an easy one. Believing you've
39+TLDR: true decentralization isn't just a technical problem. It's
40+also a political problem, and not an easy one. Believing you've
3541solved it, before actually solving it, is not a way to solve it.
3642
3743## Decentralization and legitimacy
3844
3945Steve Randy Waldman is not alone in pointing out that [a
4046blockchain is a
41−parliament](http://www.interfluidity.com/v2/6581.html). It's
47+parliament](http://www.interfluidity.com/v2/6581.html). It's
4248just the technical reality that a majority of miners in a
4349proof-of-work blockchain, or stakeholders under proof of stake,
4450have the mathematical power to govern the network absolutely.
4551
4652But this power does not give them the legitimate authority to do
47−whatever they want. Mathematically, the Ethereum miners can
48−easily roll back the DAO. Do they have the _right_ to roll back
49−the DAO? As we write, this question is one much debated.
53+whatever they want. Mathematically, the Ethereum miners can
54+easily roll back the DAO. Do they have the _right_ to roll back
55+the DAO? As we write, this question is one much debated.
5056
51−We have an easy answer: no. The most basic principle of law is
52−that _pacta sunt servanda_, agreements must be respected. A good
57+We have an easy answer: no. The most basic principle of law is
58+that _pacta sunt servanda_, agreements must be respected. A good
5359clue is that before the DAO hack, everyone swore great oaths to
54−"the steadfast iron will of immutable code." Methinks the lady
55−did protest too much. But these oaths make rolling back the DAO
60+"the steadfast iron will of immutable code." Methinks the lady
61+did protest too much. But these oaths make rolling back the DAO
5662blatantly illegitimate.
5763
5864From a governance perspective, the line of lawlessness isn't the
59−line between soft and hard forks. It's any fork which makes an
60−exception for a specific address. Ethereum has already done this
61−by freezing the DAO contract. At this point, it might as well be
65+line between soft and hard forks. It's any fork which makes an
66+exception for a specific address. Ethereum has already done this
67+by freezing the DAO contract. At this point, it might as well be
6268hanged for an ox, and go through with the full rollback.
6369
6470## Illegitimacy and belligerency
6571
6672Within the ethos of Ethereum (we are obviously not qualified to
67−comment on "real" law), a rollback is a _lawless act_. This does
68−not make it a wrongful act. It simply cannot be judged as an act
69−of law. Rather, it is an act of war.
73+comment on "real" law), a rollback is a _lawless act_. This does
74+not make it a wrongful act. It simply cannot be judged as an act
75+of law. Rather, it is an act of war.
7076
7177And judged as an act of war, a DAO rollback is _exactly right_.
72−Ethereum is not dealing with a "participant." It is dealing with
78+Ethereum is not dealing with a "participant." It is dealing with
7379a pirate, a thief, _hostis humani generis_.
7480
7581As a state at war with an external enemy, the Ethereum network
76−shouldn't just zero the DAO hacker's booty. It must do all it
77−can to destroy her. If possible, it must dox and report her.
82+shouldn't just zero the DAO hacker's booty. It must do all it
83+can to destroy her. If possible, it must dox and report her.
7884The right place for this fool is the supermax, not the Riviera.
7985
80−But does Ethereum really want to be at war? And if Ethereum is
86+But does Ethereum really want to be at war? And if Ethereum is
8187at war -- and this certainly isn't the only pirate in the sea --
82−how does it become decentralized? If Ethereum is at war, where
88+how does it become decentralized? If Ethereum is at war, where
8389there is no law, how can it achieve its goal of creating a world
8490where code is law?
8591
86−But we really shouldn't panic. It is actually possible to go
92+But we really shouldn't panic. It is actually possible to go
8793from wartime government to peacetime government, from absolute
88−martial law to absolute rule of law. It is just nontrivial.
94+martial law to absolute rule of law. It is just nontrivial.
8995It's a political engineering problem that can't be ignored.
9096If it has to be solved, it should be solved properly.
9197
9298What really doesn't work is to declare martial law, execute all
9399traitors, terrorists and enemies of the state, then declare that
94−elections will proceed as scheduled next week. If the goal is
100+elections will proceed as scheduled next week. If the goal is
95101the decentralized rule of code as law, a rollback takes an
96−enormous step backward. Reversing this setback isn't trivial.
102+enormous step backward. Reversing this setback isn't trivial.
97103
98−Should Ethereum actually go to war? Or should it just let the
99−hacker win? Clearly, from a pure blockchain perspective, the
104+Should Ethereum actually go to war? Or should it just let the
105+hacker win? Clearly, from a pure blockchain perspective, the
100106only correct thing to do is let the DAO burn -- as a painful
101107warning to all future contract authors and participants.
102108
103109At present, it seems that Ethereum's leadership has chosen war.
104−Certainly, neither choice is obviously imprudent. Ethereum is a
105−winner and probably has a bright future either way. But who
110+Certainly, neither choice is obviously imprudent. Ethereum is a
111+winner and probably has a bright future either way. But who
106112chooses war needs a plan to win that war, and return to peace.
107113
108114## Sovereignty is conserved
@@ -111,32 +117,32 @@ For a government to even have the power to consider wartime
111117measures, a government has to exist in the first place.
112118
113119Again, we can't remind ourselves too often that a blockchain just
114−puts absolute authority in the hands of the miners. We just
120+puts absolute authority in the hands of the miners. We just
115121think of this power in terms of the law it's supposed to enforce.
116122But the two are different -- at least in wartime.
117123
118−Why is it so hard to eliminate unaccountable power? Who watches
119−the watchmen? The German legal scholar [Carl
124+Why is it so hard to eliminate unaccountable power? Who watches
125+the watchmen? The German legal scholar [Carl
120126Schmitt](https://en.wikipedia.org/wiki/Carl_Schmitt) defined the
121127problem well when he wrote: "the sovereign is who decides the
122128exception."
123129
124130In the American regime, the Supreme Court is sovereign by
125−Schmitt's definition. We have a complex system of laws, which
131+Schmitt's definition. We have a complex system of laws, which
126132are not formal code but in some ways aspire to be; above it, we
127133have a judiciary system that can decide arbitrary exceptions to
128−those laws. Pure rule of law, Schmitt tells us, is always and
129−everywhere an illusion. We can and should strive to approach
134+those laws. Pure rule of law, Schmitt tells us, is always and
135+everywhere an illusion. We can and should strive to approach
130136this limit, but it's an infinity that we can't actually reach.
131137
132138Schmitt's exception principle can be rephrased as "sovereignty is
133−conserved." There is always someone who answers to nobody. We
139+conserved." There is always someone who answers to nobody. We
134140cannot eliminate government; the best we can do is tame it.
135141
136142One way to think of the problem of reducing exceptional force to
137143zero is to compare it to a simple unstable equilibrium, like a
138−pencil standing on its point. The pencil on its point needs
139−almost no force to stay upright. But the farther it deviates
144+pencil standing on its point. The pencil on its point needs
145+almost no force to stay upright. But the farther it deviates
140146from this orderly, self-sustaining equilibrium, the more energy
141147must be applied to return it to vertical.
142148
@@ -146,26 +152,26 @@ things like 'fairness', but it's hard to define what fairness
146152even means."
147153
148154If we could define fairness, we would have a rule to which there
149−were no exceptions. We would need no judges, or governments, or
150−even soldiers. We would need no sovereignty. But since we can't
155+were no exceptions. We would need no judges, or governments, or
156+even soldiers. We would need no sovereignty. But since we can't
151157define fairness -- yet need to enforce some clear vision of
152158fairness -- sovereignty remains conserved.
153159
154160## Bitcoin, a blockchain at peace
155161
156162Bitcoin has done an excellent job of freezing the war power of
157−its own "parliament." Ironically, mining power in Bitcoin is
163+its own "parliament." Ironically, mining power in Bitcoin is
158164quite centralized -- a small number of Chinese mining-pool
159165managers, who have every opportunity to collude, could roll back
160−anything. But they never have and they probably never will.
166+anything. But they never have and they probably never will.
161167
162168Even if a single pool controlled 51% of Bitcoin mining power,
163169they'd have no incentive to break the rules -- quite the
164−converse. We equate physical decentralization with limited
170+converse. We equate physical decentralization with limited
165171governance, perhaps because we think of the physical difficulty
166172of coordination as the main protection against arbitrary power.
167173
168−Bitcoin shows that this isn't true. As far as we can tell,
174+Bitcoin shows that this isn't true. As far as we can tell,
169175Bitcoin would keep working fine if there was only one miner.
170176This uni-miner would have still have no incentive to corrupt the
171177network -- though another party, such as a real government, might
@@ -173,41 +179,41 @@ have an incentive to coerce the miner.
173179
174180The important success of Bitcoin is the collective acceptance --
175181mathematically false, but politically true -- that rollbacks in
176−Bitcoin are inconceivable. Bitcoin has governance problems, but
182+Bitcoin are inconceivable. Bitcoin has governance problems, but
177183they're confined to relatively unimportant questions, like the
178−blocksize debate. "Decentralization" may not be quite the word,
179−but somehow Bitcoin has achieved limited government. The pencil
180−is standing on its point. For now.
184+blocksize debate. "Decentralization" may not be quite the word,
185+but somehow Bitcoin has achieved limited government. The pencil
186+is standing on its point. For now.
181187
182188## Ethereum's dilemma
183189
184−A rollback creates a scary precedent. It's a sort of military
185−coup. Just as the miners have the power to rule any blockchain,
186−the military has the power to rule any country. Do they want it?
187−The first coup makes the next coup much easier. Same with the
190+A rollback creates a scary precedent. It's a sort of military
191+coup. Just as the miners have the power to rule any blockchain,
192+the military has the power to rule any country. Do they want it?
193+The first coup makes the next coup much easier. Same with the
188194first rollback.
189195
190196In retrospect, the great mistake here was that Ethereum didn't
191197know it needed a government, and did its best to pretend it
192−didn't have one. After a rollback, Ethereum doesn't just have a
193−government. It has a military dictatorship.
198+didn't have one. After a rollback, Ethereum doesn't just have a
199+government. It has a military dictatorship.
194200
195−Ethereum and Bitcoin are qualitatively different. Bitcoin has a
196−simple UI metaphor: cash. Everyone knows how cash works. A
197−smart contract has its own UI metaphor: law. But as we see,
201+Ethereum and Bitcoin are qualitatively different. Bitcoin has a
202+simple UI metaphor: cash. Everyone knows how cash works. A
203+smart contract has its own UI metaphor: law. But as we see,
198204mechanically administered law, law without judges, is a very
199205different thing from ordinary human law.
200206
201207What the DAO shows is that Ethereum just wasn't ready to be
202−decentralized. It was not ready to allow a $150 million contract
203−with no supervision or appeals process. The problem was not
208+decentralized. It was not ready to allow a $150 million contract
209+with no supervision or appeals process. The problem was not
204210Ethereum's code per se -- although Solidity doesn't seem terribly
205211well designed for preventing these pitfalls -- but the human
206212understanding of its capabilities and limits.
207213
208−A rollback acknowledges this. It acknowledges that Ethereum
214+A rollback acknowledges this. It acknowledges that Ethereum
209215wasn't ready for complete self-government, and _someone_ needed
210−to have stopped the DAO from trading. It's not quite clear what
216+to have stopped the DAO from trading. It's not quite clear what
211217the principle behind the rollback was.
212218
213219Perhaps the best kind of DAO rollback would be a rollback which
@@ -215,13 +221,13 @@ understood this error fully, and acknowledged that -- for the
215221moment -- Ethereum needs a sovereign government, with the power
216222to restrict and/or steward contracts.
217223
218−Contracts are not payments. They are infinitely more complex.
219−They will keep blowing up. Ethereum is full of buggy contracts,
220−scammy contracts, ponzis and casinos, etc. A governed Ethereum,
224+Contracts are not payments. They are infinitely more complex.
225+They will keep blowing up. Ethereum is full of buggy contracts,
226+scammy contracts, ponzis and casinos, etc. A governed Ethereum,
221227in the present state of the technology, might well choose to vet
222228all contracts centrally _before_ they started trading.
223229
224−Would this be a permanent feature? Certainly not -- it would be
230+Would this be a permanent feature? Certainly not -- it would be
225231a way for the community to collectively define a good contract.
226232Once we know what a responsible, well-tested, non-scammy Ethereum
227233contract looks like, it's much easier to return to the principle
@@ -233,49 +239,49 @@ are able to make this decision rationally, and get it right.
233239This work simply hasn't been done.
234240
235241Perhaps the worst-case scenario is one in which Ethereum approves
236−the hard fork, on the "just this once" principle. To save the
237−country, we need a military coup. But don't panic! "After
242+the hard fork, on the "just this once" principle. To save the
243+country, we need a military coup. But don't panic! "After
238244executing all traitors and enemies of the people, the generals
239245will immediately restore democracy and the rule of law."
240246
241247The "just this once" fork takes us back to decentralization
242−theater, where Ethereum pretends not to have a government. But
243−now, this pretense is even more threadbare. The next hack, which
248+theater, where Ethereum pretends not to have a government. But
249+now, this pretense is even more threadbare. The next hack, which
244250will certainly happen, will produce yet another coup -- or at
245−least a food fight over whether to have a coup. This is the path
251+least a food fight over whether to have a coup. This is the path
246252to a "digital banana republic," where the tattered illusion of
247253law barely conceals the real law of nature.
248254
249255The bottom line is that if a rollback happens once, we can expect
250−it to happen again. This time, the rollback can be treated as an
251−act of war, and no process is necessary. Next time, there needs
256+it to happen again. This time, the rollback can be treated as an
257+act of war, and no process is necessary. Next time, there needs
252258to be a process -- or the dream of code as law will drift further
253259away.
254260
255261Having a central government isn't inconsistent with the ultimate
256−objective of eliminating central government. Certainly, before
257−Ethereum was released, its developers were its government. Every
262+objective of eliminating central government. Certainly, before
263+Ethereum was released, its developers were its government. Every
258264government is born in a state of chaos and war.
259265
260266The mistake is just in thinking something as complex as Ethereum
261−can jump directly to decentralization in a single step. The
262−pencil is not standing on its point, or anywhere close. Before
267+can jump directly to decentralization in a single step. The
268+pencil is not standing on its point, or anywhere close. Before
263269anyone can think about letting go, someone needs to actually lift
264−it. To reach law, first enforce peace.
270+it. To reach law, first enforce peace.
265271
266272## Constitutional structure
267273
268274One of the governance problems of blockchains, related to the
269275fundamental error of decentralization theater, is the failure to
270276build deliberative institutions on top of the "parliament of
271−miners." Voting by proof of work is great, especially if the
277+miners." Voting by proof of work is great, especially if the
272278majority is well above 51%, and can demonstrate its strength
273−without an actual hashing race. It's a good way to finalize
274−decisions. But not a good way to make them.
279+without an actual hashing race. It's a good way to finalize
280+decisions. But not a good way to make them.
275281
276282But blockchain governance would be considerably improved if the
277283miners actually had a formal way to delegate their power to a
278−structured institution that represented them. Both Bitcoin and
284+structured institution that represented them. Both Bitcoin and
279285Ethereum have foundations and/or core teams, but authority in
280286these institutions isn't tied in any way to actual mining power.
281287Informal politics fills this void with personality cults and
@@ -287,22 +293,22 @@ Misalignment between a fundamental power, like the miners, and a
287293group purporting to represent them, like the foundations, is
288294inherently dangerous.
289295
290−What's the alternative? An actual constitution. Perhaps the
296+What's the alternative? An actual constitution. Perhaps the
291297first smart contract that Ethereum needs is not the DAO, not even
292298well-engineered, high-quality smart contracts like Augur and
293−Maker, but just its own equivalent of 1789. If Ethereum needs a
294−government, it must govern itself. It certainly has all the
299+Maker, but just its own equivalent of 1789. If Ethereum needs a
300+government, it must govern itself. It certainly has all the
295301technical tools it needs!
296302
297−Or, of course, it could just let the hackers win. This is the
298−easiest path. And in the end, it may still be the best. War,
303+Or, of course, it could just let the hackers win. This is the
304+easiest path. And in the end, it may still be the best. War,
299305who needs it?
300306
301307## A quick Urbit plug
302308
303309Technically, Urbit needs governance much more than Ethereum.
304310Decentralization remains our goal -- but it's a long-term goal.
305−Decentralization theater has never even been a temptation. It's
311+Decentralization theater has never even been a temptation. It's
306312just technically impossible.
307313
308314For example, until the Urbit OS and language (Arvo and Hoon) are
@@ -311,10 +317,10 @@ Urbit is still "evergreen" -- it still needs automatic hotpatches
311317from the network.
312318
313319Whatever institution signs these updates is, by any standard, an
314−absolute government. It's as if the Ethereum Foundation could
320+absolute government. It's as if the Ethereum Foundation could
315321push a hardfork of all clients by signing the new code on the
316−blockchain. Getting out of this situation is a long-term goal --
317−where "long term" means years. Decentralization is hard.
322+blockchain. Getting out of this situation is a long-term goal --
323+where "long term" means years. Decentralization is hard.
318324
319325Read our [interim
320326constitution](http://urbit.org/essays/interim-constitution) and our
content/blog/the-missing-middle.md+20−19
@@ -1,11 +1,12 @@
11+++
22title = "The Missing Middle"
3−date = 2020-05-26
3+date = "2020-05-25"
44description = "Urbit stars can facilitate a flexible continuum of community norms."
5+
56[extra]
67author = "Nicholas Simmons"
78ship = "~simfur-ritwed"
8−image ="https://media.urbit.org/site/posts/essays/missing-middle.png"
9+image = "https://media.urbit.org/site/posts/essays/missing-middle.png"
910+++
1011
1112<br>
@@ -14,40 +15,40 @@ image ="https://media.urbit.org/site/posts/essays/missing-middle.png"
1415
1516<br>
1617
17−The promise of social technology is that we can discover more friends; *specifically, people more similar to us* than we previously had access to. The means by which we do so, the methods of collaboration, the quality of connected experiences; these factors matter, but they are marginal considerations compared to the basic offering of an expanded choice of connections.
18+The promise of social technology is that we can discover more friends; _specifically, people more similar to us_ than we previously had access to. The means by which we do so, the methods of collaboration, the quality of connected experiences; these factors matter, but they are marginal considerations compared to the basic offering of an expanded choice of connections.
1819
19−The wilder-eyed, utopian end of early computing drew greatly from this promise; such unprecedented connection could bring about world peace, intellectual serendipity, higher consciousness. We didn’t get world peace, but we did get a genuine revolution in collaborative information-sharing and rapid communication. That ability to refactor our social preferences gave birth to an uncountable universe of online communities and subcultures that would be unimaginable to anyone who didn’t see it happen.
20+The wilder-eyed, utopian end of early computing drew greatly from this promise; such unprecedented connection could bring about world peace, intellectual serendipity, higher consciousness. We didn’t get world peace, but we did get a genuine revolution in collaborative information-sharing and rapid communication. That ability to refactor our social preferences gave birth to an uncountable universe of online communities and subcultures that would be unimaginable to anyone who didn’t see it happen.
2021
21−We didn’t get a million friends either. Dunbar’s number, which posits an upper bound of ~150 trusted relationships per person, put the lie to dreams of a ‘global community.’ Better social tools give us more choice in who to fill those slots with, but not the ability to expand the personal spheres where we actually spend most of our time and forge most of our familiarity and trust with others.
22+We didn’t get a million friends either. Dunbar’s number, which posits an upper bound of ~150 trusted relationships per person, put the lie to dreams of a ‘global community.’ Better social tools give us more choice in who to fill those slots with, but not the ability to expand the personal spheres where we actually spend most of our time and forge most of our familiarity and trust with others.
2223
23−We know this, and the social networks know it. To combat a slump in user activity, Facebook jettisoned promises of boundless discovery and started promoting Groups. The success of Discord and Slack happened precisely because they promised tools for gated communities, not open commons.
24+We know this, and the social networks know it. To combat a slump in user activity, Facebook jettisoned promises of boundless discovery and started promoting Groups. The success of Discord and Slack happened precisely because they promised tools for gated communities, not open commons.
2425
25−One of those early promises came true in spades, though: while we still live in Dunbar communities, we’ve sped up the sorting process. We can find people like us at astonishing speed, and the diversity of options for what ‘people like us’ means has expanded exponentially. The ‘Big Sort’ of modern society is rapid, unprecedented, and utterly reliant on social technology. The problem is that for all of our freedom to find each other and make mutual agreements, the underlying technologies used for all of this sorting and trusting don’t actually reflect the diversity of expectations, norms, or approaches we might want to try. One major reason for this status quo is the underlying structure of the client-server Internet. Unlike in the physical world, where cities, religious groups, and professional associations both own real assets and collectively determine rules and norms, there is no median level of civic compromise on the Internet; just massive technical providers and platform companies, and dispossessed Dunbar communities and individuals unable to determine such rules and norms for themselves.
26+One of those early promises came true in spades, though: while we still live in Dunbar communities, we’ve sped up the sorting process. We can find people like us at astonishing speed, and the diversity of options for what ‘people like us’ means has expanded exponentially. The ‘Big Sort’ of modern society is rapid, unprecedented, and utterly reliant on social technology. The problem is that for all of our freedom to find each other and make mutual agreements, the underlying technologies used for all of this sorting and trusting don’t actually reflect the diversity of expectations, norms, or approaches we might want to try. One major reason for this status quo is the underlying structure of the client-server Internet. Unlike in the physical world, where cities, religious groups, and professional associations both own real assets and collectively determine rules and norms, there is no median level of civic compromise on the Internet; just massive technical providers and platform companies, and dispossessed Dunbar communities and individuals unable to determine such rules and norms for themselves.
2627
27−Both internal norms (‘how do we act’) and external perceptions (‘who are we?’) get yanked around by the dictates of platform owners, routing infrastructure providers, and the societal consensus that governs both, at levels far above our Dunbar phyles. Privacy is contradicted by the need to surveil internal activity in order to target ads. The current model of social connection technology sets the bar for self-determination so high as to prevent it from adapting to external circumstances. The technical realities of the situation are due to client-server technology and its institutional history. The social aspect is a holdover from the 20th-century media paradigm of mass consensus cultures.
28+Both internal norms (‘how do we act’) and external perceptions (‘who are we?’) get yanked around by the dictates of platform owners, routing infrastructure providers, and the societal consensus that governs both, at levels far above our Dunbar phyles. Privacy is contradicted by the need to surveil internal activity in order to target ads. The current model of social connection technology sets the bar for self-determination so high as to prevent it from adapting to external circumstances. The technical realities of the situation are due to client-server technology and its institutional history. The social aspect is a holdover from the 20th-century media paradigm of mass consensus cultures.
2829
29−The ‘long 20th century’ of mass institutions and broad consensus realities is over. Contrary to impressions, it was not the inevitable or final result of moral and civil progress. Rather, it arose from pragmatic external incentives of mass advertising and great-power ideological rivalries.
30+The ‘long 20th century’ of mass institutions and broad consensus realities is over. Contrary to impressions, it was not the inevitable or final result of moral and civil progress. Rather, it arose from pragmatic external incentives of mass advertising and great-power ideological rivalries.
3031
31−The assumption that we must inevitably play by the same rules of discourse, given the autonomy granted by wealth, technology, and knowledge, is rapidly degrading. This status quo is a leftover from a time when mass education prepared workers for mass jobs, where mass communication hammered the same messages over the factory loudspeaker and advertised the same small number of products over the few television channels available. Yet we still assume that the shape and function of the tools and spaces for dialogue we inherited from that era are immutable and inevitable; this outdated belief cuts us off from new methods of choice and collaboration.
32+The assumption that we must inevitably play by the same rules of discourse, given the autonomy granted by wealth, technology, and knowledge, is rapidly degrading. This status quo is a leftover from a time when mass education prepared workers for mass jobs, where mass communication hammered the same messages over the factory loudspeaker and advertised the same small number of products over the few television channels available. Yet we still assume that the shape and function of the tools and spaces for dialogue we inherited from that era are immutable and inevitable; this outdated belief cuts us off from new methods of choice and collaboration.
3233
3334Without the external political and economic pressures which created our mass culture, inclusion in or acceptance by it becomes just another sinecure for sale, the outcome of a zero-sum auction to benefit from and utilize for further gain, the power accumulated by the legacy institutions safeguarding it. The ‘objective’ model has become a straightjacket on human ingenuity and community self-determination. The fact that it is ‘supposed to exist’ means that it is the ultimate prize. Inclusion in the mainstream Discourse grants scalable exploitation of any idea and prestige to its proponents. But it is a booby prize. No serious and nuanced idea, no dedicated community can withstand its flattening effects or the ways that it commercializes and cargo-cults its subject into an artificial shape. The resulting conversations are lackluster in form as well as subject.
3435
35−The stiffer the Discourse is; the less input it deems useful, the more fragile it becomes. The inside becomes a stultifying garden party of outdated, anodyne official narratives; the outside a stew of paranoid, enraged rump factions shut out of any path to respectability or good-faith engagement with their perspective.
36+The stiffer the Discourse is; the less input it deems useful, the more fragile it becomes. The inside becomes a stultifying garden party of outdated, anodyne official narratives; the outside a stew of paranoid, enraged rump factions shut out of any path to respectability or good-faith engagement with their perspective.
3637
37−The same dynamic wreaks havoc inside Dunbar groups as well; when there are fewer gradations of acceptable difference, internal schisms take on a stark tinge of zero-sum loyalty versus betrayal, rather than consensual drift. Savvy users, knowing the stakes, migrate quickly, leaving behind wastelands of the obstinate and clueless, who are in turn preyed upon by grifters and demagogues. Only when external events force a ‘tectonic shift’ in official understanding do these standards change. The problem is that the usual result of a ‘tectonic shift’ is a sudden, destructive earthquake. If networked culture is going to survive dramatic events out in the real world, we’re going to need a middle structural layer that allows norms and agreements to shift and negotiate based on observed reality and the wishes of ordinary participants.
38+The same dynamic wreaks havoc inside Dunbar groups as well; when there are fewer gradations of acceptable difference, internal schisms take on a stark tinge of zero-sum loyalty versus betrayal, rather than consensual drift. Savvy users, knowing the stakes, migrate quickly, leaving behind wastelands of the obstinate and clueless, who are in turn preyed upon by grifters and demagogues. Only when external events force a ‘tectonic shift’ in official understanding do these standards change. The problem is that the usual result of a ‘tectonic shift’ is a sudden, destructive earthquake. If networked culture is going to survive dramatic events out in the real world, we’re going to need a middle structural layer that allows norms and agreements to shift and negotiate based on observed reality and the wishes of ordinary participants.
3839
39−This omission of a ‘middle layer’ of technical governance directly informs our vision for the Urbit network. In an Urbit-based world, we envision stars will be consensus hubs. There are 256 Urbit galaxies, each able to spawn 255 stars for a total of 65,280 potential stars. Each star, in turn, can spawn 65,535 planets—far above the Dunbar number of an intimate community, but also far below the ratios of authoritarian control under which current platform regimes operate. Stars and galaxies perform the essential routing and peer discovery functions of the Urbit network; planets represent distinct individual identities.
40+This omission of a ‘middle layer’ of technical governance directly informs our vision for the Urbit network. In an Urbit-based world, we envision stars will be consensus hubs. There are 256 Urbit galaxies, each able to spawn 255 stars for a total of 65,280 potential stars. Each star, in turn, can spawn 65,535 planets—far above the Dunbar number of an intimate community, but also far below the ratios of authoritarian control under which current platform regimes operate. Stars and galaxies perform the essential routing and peer discovery functions of the Urbit network; planets represent distinct individual identities.
4041
41−Although every star is spawned by a particular galaxy, it can move to any other galaxy which agrees to host it. Similarly, planets may migrate between stars. Many imagine the extreme ramifications of such a system, projecting a Darwinian competition of starkly diverse political models encoded in governance. When we think about the future of Urbit, though, we don’t see a chaotic universe of iconoclastic outposts. We don’t doubt there will be diversity among stars (driven by the wishes of their owners and resident planet users/customers), but the real value is in the antifragility allowed by far more subtle gradations of difference in rules and structures decided upon by stars. Each star will have much, but not all, in common with its immediate neighbors, across a constellation which contains a great overall diversity of norms. Changes in policy or alignment will resemble ripples across a pond more than a buildup of tectonic force against a brittle fault.
42+Although every star is spawned by a particular galaxy, it can move to any other galaxy which agrees to host it. Similarly, planets may migrate between stars. Many imagine the extreme ramifications of such a system, projecting a Darwinian competition of starkly diverse political models encoded in governance. When we think about the future of Urbit, though, we don’t see a chaotic universe of iconoclastic outposts. We don’t doubt there will be diversity among stars (driven by the wishes of their owners and resident planet users/customers), but the real value is in the antifragility allowed by far more subtle gradations of difference in rules and structures decided upon by stars. Each star will have much, but not all, in common with its immediate neighbors, across a constellation which contains a great overall diversity of norms. Changes in policy or alignment will resemble ripples across a pond more than a buildup of tectonic force against a brittle fault.
4243
43−Stars are Schelling points for such gradations precisely because they are discrete cogs in the overall technical infrastructure of Urbit. Technical responsibility and any bounds of ownership will always mark such points. Their designation in the case of Urbit or any other system is necessarily somewhat arbitrary. Our vision is orders of magnitude less centralized than the status quo, but not devolved so far towards the individual that community formation demands massive amounts of *individual* technical knowledge and maintenance tasks. There will always be a need for routing infrastructure, ergo power (the power to set community norms and external relations) will always accrue to the points of control over that infrastructure.
44+Stars are Schelling points for such gradations precisely because they are discrete cogs in the overall technical infrastructure of Urbit. Technical responsibility and any bounds of ownership will always mark such points. Their designation in the case of Urbit or any other system is necessarily somewhat arbitrary. Our vision is orders of magnitude less centralized than the status quo, but not devolved so far towards the individual that community formation demands massive amounts of _individual_ technical knowledge and maintenance tasks. There will always be a need for routing infrastructure, ergo power (the power to set community norms and external relations) will always accrue to the points of control over that infrastructure.
4445
45−Urbit simplifies much of this infrastructure but, just as importantly, it makes those technical locations, and the conditions of ownership and control, explicit. It allows for them to be owned and controlled by anyone who purchases them, rather than controlled by network-level overlords and unelected government regulators. Stars are somewhere between ISPs and consumer hosting platforms (like Geocities an eon ago, or Wordpress today); independent enough to set their own policies, but generally subject to the realities of running a profitable business. The decisions made by service providers inevitably have a great influence on the norms of any network, and Urbit is no different. The advantage of the Urbit model is that there are far more stars than ISPs, they are easier to run, they are fungible properties with clear ownership, and they are not burdened with technical and regulatory debt which ties them to the status quo. These qualities allow them to be purchased and maintained by a far wider range of people than might be able to control an ISP today; the massive decentralization of routing infrastructure also seems a likely antidote to the current state of regulatory overreach and centralized snooping which ISPs are subject to.
46+Urbit simplifies much of this infrastructure but, just as importantly, it makes those technical locations, and the conditions of ownership and control, explicit. It allows for them to be owned and controlled by anyone who purchases them, rather than controlled by network-level overlords and unelected government regulators. Stars are somewhere between ISPs and consumer hosting platforms (like Geocities an eon ago, or Wordpress today); independent enough to set their own policies, but generally subject to the realities of running a profitable business. The decisions made by service providers inevitably have a great influence on the norms of any network, and Urbit is no different. The advantage of the Urbit model is that there are far more stars than ISPs, they are easier to run, they are fungible properties with clear ownership, and they are not burdened with technical and regulatory debt which ties them to the status quo. These qualities allow them to be purchased and maintained by a far wider range of people than might be able to control an ISP today; the massive decentralization of routing infrastructure also seems a likely antidote to the current state of regulatory overreach and centralized snooping which ISPs are subject to.
4647
47−The Internet gave us an unprecedented flowering of diverse cultures; it gave communities the option to pursue a vast number of paths and goals. And we *should* have the ability, granted by wealth, free time, and communications technology, to arrange the rules of our collaboration as we wish. The structural design of the Urbit network is an effort to provide that power, encoded in a digital asset with private keys that can be held both by individuals and (via multisig arrangements) by groups. The lower price and complexity of stars compared to current ISPs also makes a lot more room for innovation in business models; star owners can make their own judgments about how to prioritize commercial revenue versus cooperative ownership, anonymity versus identity, short-term versus long-term contracts.
48+The Internet gave us an unprecedented flowering of diverse cultures; it gave communities the option to pursue a vast number of paths and goals. And we _should_ have the ability, granted by wealth, free time, and communications technology, to arrange the rules of our collaboration as we wish. The structural design of the Urbit network is an effort to provide that power, encoded in a digital asset with private keys that can be held both by individuals and (via multisig arrangements) by groups. The lower price and complexity of stars compared to current ISPs also makes a lot more room for innovation in business models; star owners can make their own judgments about how to prioritize commercial revenue versus cooperative ownership, anonymity versus identity, short-term versus long-term contracts.
4849
4950We see stars as an opportunity to incubate community hubs, to plant a flag in the wilderness, declare values and alignments, and see who shows up. This process can be varied; some stars might advertise widely, others might quietly and slowly invite other communities on board. That’s the point. There’s a nice juxtaposition between first mover-effect and overall availability here; early adopters will have an opportunity to shape discourse, but the supply is not so constrained that they’ll capture all of it. Early adopters will likely have an immense and permanent value of voice, infrastructural ownership, and ongoing revenue over their shorter-term speculative one.
5051
51−The diversity and non-discoverability of Urbit are already showing themselves: we hear whisperings of insular communities that we not only *don’t* know about but by our express intentions *can’t* know about unless they make themselves known.
52+The diversity and non-discoverability of Urbit are already showing themselves: we hear whisperings of insular communities that we not only _don’t_ know about but by our express intentions _can’t_ know about unless they make themselves known.
5253
53−Regardless of whether we or anyone else know about them, star owners already possess legible chunks of the ‘missing middle’’—large enough to affect the map of the Urbit universe, small enough to allow a wide array of voices—in a way that the ownership models of the current Internet can’t come anywhere close to providing. Not every neighborhood poker club needs an Urbit star. But the institution-founders, tastemakers, and social connectors of today and tomorrow, those who want to build opera houses on the digital prairie, should consider the advantages of building on a star.
54+Regardless of whether we or anyone else know about them, star owners already possess legible chunks of the ‘missing middle’’—large enough to affect the map of the Urbit universe, small enough to allow a wide array of voices—in a way that the ownership models of the current Internet can’t come anywhere close to providing. Not every neighborhood poker club needs an Urbit star. But the institution-founders, tastemakers, and social connectors of today and tomorrow, those who want to build opera houses on the digital prairie, should consider the advantages of building on a star.
content/blog/the-state-of-landscape.md+16−13
@@ -1,8 +1,12 @@
11+++
22title = "The State of Landscape"
3−date = 2019-05-16
3+date = "2019-05-15"
44description = "An update on the state of Landscape and the Urbit network."
5−aliases = ["/posts/essays/the-state-of-landscape", "/posts/the-state-of-landscape"]
5+aliases = [
6+ "/posts/essays/the-state-of-landscape",
7+ "/posts/the-state-of-landscape"
8+]
9+
610[extra]
711author = "Galen Wolfe-Pauly"
812ship = "~ravmel-ropdyl"
@@ -11,27 +15,27 @@ image = "https://media.urbit.org/site/posts/essays/the-state-of-landscape-1.png"
1115
1216![](https://media.urbit.org/site/posts/essays/the-state-of-landscape-1.png)
1317
14−The TL;DR is: if you’re really excited about living on Mars, Landscape is fun to try out. Come join `~dopzod/urbit-help`, experiment with creating your own chats and collections (did anyone find that easter egg, yet?), and see what you can do with the thing.
18+The TL;DR is: if you’re really excited about living on Mars, Landscape is fun to try out. Come join `~dopzod/urbit-help`, experiment with creating your own chats and collections (did anyone find that easter egg, yet?), and see what you can do with the thing.
1519
1620Landscape today is for the intrepid adventurer. So is much of the system. If you want to read about what we’re doing to make it more welcoming, [check out the 2019 roadmap](/posts/essays/2019-5-roadmap/).
1721
1822## The Broad View
1923
20−We thought a lot last year about how to avoid the pitfalls of modern social networks. The services we all use today each feel like *one place*. It’s as if everyone on MEGANET is living together in the same city.
24+We thought a lot last year about how to avoid the pitfalls of modern social networks. The services we all use today each feel like _one place_. It’s as if everyone on MEGANET is living together in the same city.
2125
2226In the real world, cities have their own cultures. So we thought: there must be some way to build more granular communities online. Living in a single world-city is kind of a bummer, honestly.
2327
24−Landscape was our first experiment in this direction. It’s a ruthlessly simple interface for chat and discussion that runs on top of Arvo. You can connect to Landscape in a browser or in an app on your iOS device. All communication is pseudonymous and authenticated (as with everything in Arvo) with your Azimuth point.
28+Landscape was our first experiment in this direction. It’s a ruthlessly simple interface for chat and discussion that runs on top of Arvo. You can connect to Landscape in a browser or in an app on your iOS device. All communication is pseudonymous and authenticated (as with everything in Arvo) with your Azimuth point.
2529
2630Over the past few months, we’ve been running small experiments, experimenting with ways to support our own work and finding the limits of what we can do on the network. Originally, we built Landscape out of our desire to get away from using MEGACORP communication tools in our daily work. We thought: if we’re trying to build a whole new network and society, we had better go live there first.
2731
28−Landscape is an experiment — it’s supposed to be fun, above all, and a good way to help focus our efforts on maturing the platform.
32+Landscape is an experiment — it’s supposed to be fun, above all, and a good way to help focus our efforts on maturing the platform.
2933
3034Anyway, let’s show off some of the specifics, and give an update on this experiment so far.
3135
3236## A Quick Tour
3337
34−Landscape is pretty simple. It lets you subscribe to chats, in the spirit of IRC, and ‘collections’, which are effectively forums or blogs with comments. You can also direct message with other running ‘ships’ or Arvo nodes.
38+Landscape is pretty simple. It lets you subscribe to chats, in the spirit of IRC, and ‘collections’, which are effectively forums or blogs with comments. You can also direct message with other running ‘ships’ or Arvo nodes.
3539
3640For the most part, this happens through a web interface that you can access at `https://ship.arvo.network` or via `localhost:80`.
3741
@@ -45,7 +49,7 @@ What’s keeping us from asking others to use this thing more aggressively? Let
4549
4650They have gotten a lot better, but there are still a few things that can crash your Arvo ship. This, of course, has nothing to do with your Azimuth point, which is completely separate and, as far as we know, secure.
4751
48−The first (and most severe) is a bug in our event persistence that occurs very rarely. Basically, there are conditions under which you can cause events not to be properly written to disk and corrupt your event log. It’s pretty unlikely, but it’s unacceptable for a real product since it basically causes you to have to wait out the current network era.
52+The first (and most severe) is a bug in our event persistence that occurs very rarely. Basically, there are conditions under which you can cause events not to be properly written to disk and corrupt your event log. It’s pretty unlikely, but it’s unacceptable for a real product since it basically causes you to have to wait out the current network era.
4953
5054The second is that Ames (our network protocol) has occasional connectivity problems. Originally, we thought we had found this issue as being related to [a timer bug](https://github.com/urbit/arvo/pull/1072). It may be, but the networking is in the process of a major overhaul — so we’ve implemented a few bandaids to make the situation workable. `|bonk` sometimes needs to be used to reset connections between peers, and `:ethmanage` sometimes need to be used to re-synchronize with the blockchain. It’s an ugly fix, but it usually works.
5155
@@ -55,21 +59,20 @@ Relatedly, we have occasionally been seeing errors caused by the Arvo network be
5559
5660One great thing about the Arvo network is that it’s more like a giant single computer than a network. When you talk to another ship, use remote files or sync data it’s almost the same as working with local data.
5761
58−The main thing underlying this is *sequence numbers*. Your Arvo ship keeps track of every message it has exchanged with every other ship, and it never breaks that sequence. If our ships are talking, and we’re on packet `83910` but you reset and try to start again at `0` my ship just thinks you’ve lost your mind and won’t talk to you anymore.
62+The main thing underlying this is _sequence numbers_. Your Arvo ship keeps track of every message it has exchanged with every other ship, and it never breaks that sequence. If our ships are talking, and we’re on packet `83910` but you reset and try to start again at `0` my ship just thinks you’ve lost your mind and won’t talk to you anymore.
5963
60−We’d like individual resets to work, and we’re [working on it](https://github.com/urbit/arvo/pull/1169). But, for the time being, if you have any fatal error on your ship, it means you’ve got to sit this era out.
64+We’d like individual resets to work, and we’re [working on it](https://github.com/urbit/arvo/pull/1169). But, for the time being, if you have any fatal error on your ship, it means you’ve got to sit this era out.
6165
6266This is another unacceptable bug for anything we truly rely on.
6367
6468### 3 - There are no push notifications, yet
6569
66−What’s one thing that a chat application needs to do? Notify you of new messages. What does Landscape notify you about? Well, at the moment, basically nothing.
70+What’s one thing that a chat application needs to do? Notify you of new messages. What does Landscape notify you about? Well, at the moment, basically nothing.
6771
6872We implemented and tested a push notifications server for iOS, which is slated for release in the next few months (it depends on things in our `cc-release` branch). We’d also love to work on having your ship connect to your email provider and send you alerts over email. We’re thinking about how to do that.
6973
7074## What We’ve Learned and What We’re Doing
7175
72−Many of us spend all day on Landscape, use it from our phones, and find it really fun. The bugs above bite less than you might think and, in many cases, the experience is quite nice. It’s a passive, distraction-free way to interact with others around the office.
76+Many of us spend all day on Landscape, use it from our phones, and find it really fun. The bugs above bite less than you might think and, in many cases, the experience is quite nice. It’s a passive, distraction-free way to interact with others around the office.
7377
7478We operate one public channel, `~dopzod/urbit-help` for answering any of your questions about the system. And, from time to time, we have been creating topic-centric channels and announcing them publicly. This has been a lot of fun. Come join us if you’re feeling brave.
75−
content/blog/the-understanding-urbit-podcast.md+3−2
@@ -1,11 +1,12 @@
11+++
22title = "The Understanding Urbit Podcast"
3−date = 2020-04-03
3+date = "2020-04-02"
44description = "An interview-based podcast series about the Urbit project, as told by those working on it."
5+
56[extra]
67author = "Arthur Falls"
78ship = "~satsyt-sogleb"
8−image ="https://media.urbit.org/site/posts/essays/uu-podcast.png"
9+image = "https://media.urbit.org/site/posts/essays/uu-podcast.png"
910+++
1011
1112<br>
content/blog/the-urbit-address-space.md+93−88
@@ -1,34 +1,39 @@
11+++
22title = "The Urbit Address Space"
3−date = 2016-05-16
3+date = "2016-05-15"
44description = "An overview of Urbit's cryptographic address space."
5−aliases = ["/posts/essays/the-urbit-address-space", "/posts/the-urbit-address-space"]
5+aliases = [
6+ "/posts/essays/the-urbit-address-space",
7+ "/posts/the-urbit-address-space"
8+]
9+
610[extra]
711author = "Galen Wolfe-Pauly + Curtis Yarvin"
812ship = "~ravmel-ropdyl + ~sorreg-namtyv"
913image = "https://storage.googleapis.com/media.urbit.org/site/posts/essays/the-urbit-address-space.jpg"
1014+++
15+
1116![](https://storage.googleapis.com/media.urbit.org/site/posts/essays/the-urbit-address-space.jpg)
1217
1318## Basics
1419
15−Urbit contains a lot of new technology. As an ordinary user, all you
16−need to understand is Urbit's identity model. If you're in a hurry,
20+Urbit contains a lot of new technology. As an ordinary user, all you
21+need to understand is Urbit's identity model. If you're in a hurry,
1722just read these simplified basics.
1823
19−An Urbit identity, or "ship," is a string like `~firbyr-napbes`. It
24+An Urbit identity, or "ship," is a string like `~firbyr-napbes`. It
2025means nothing, but it's easy to remember and say out loud.
2126`~firbyr-napbes` is actually just a 32-bit number, like an IP address,
2227that we turn into a human-memorable string.
2328
2429Technically, a ship is a secure digital identity that you own and
25−control with a cryptographic key, like a Bitcoin wallet. As in
26−Bitcoin, the supply of ships is mathematically limited. This keeps
30+control with a cryptographic key, like a Bitcoin wallet. As in
31+Bitcoin, the supply of ships is mathematically limited. This keeps
2732the network friendly, by making spam and abuse expensive.
2833
2934A ship name is just a number; smaller numbers make shorter names.
30−Shorter names are easier to remember, so they're more valuable. So
31−ships are classified by the number of bits in their name. (A ship
35+Shorter names are easier to remember, so they're more valuable. So
36+ships are classified by the number of bits in their name. (A ship
3237name is just a scrambled base-256 representation of the number.)
3338
3439A 32-bit ship (like `~firbyr-napbes`) is called a "planet." A 16-bit
@@ -37,48 +42,48 @@ ship (like `~pollev)` is a "star." An 8-bit ship (like `~mun`) is a
3742Stars and galaxies are network infrastructure.
3843
3944Each planet or star is launched by its "parent," the star or galaxy
40−whose number is its bottom half. So the planet `~firbyr-napbes`,
45+whose number is its bottom half. So the planet `~firbyr-napbes`,
4146`0xdead.beef` or `3.735.928.559`, is the child of `~pollev`, `0xbeef`
42−or `48.879`, whose parent is `~mun`, `0xef`, `239`. The parent of
47+or `48.879`, whose parent is `~mun`, `0xef`, `239`. The parent of
4348`~mun` and all galaxies is `~zod`, `0`.
4449
45−If Bitcoin is money, Urbit is land. Much as all real-estate titles in
50+If Bitcoin is money, Urbit is land. Much as all real-estate titles in
4651England trace back to William the Conqueror, all certificates in Urbit
4752trace back to `~zod`.
4853
49−But this universe is worthless unless dispersed. It's already quite
50−well fragmented. And as it grows distributed, it grows decentralized.
54+But this universe is worthless unless dispersed. It's already quite
55+well fragmented. And as it grows distributed, it grows decentralized.
5156The endpoint is a virtual city of 4 billion (`2^32`) citizens, all
52−owners of their own independent digital identities. The stars and
57+owners of their own independent digital identities. The stars and
5358galaxies continue as a federated governance and service network.
5459
5560This city is a social network, a peer-to-peer packet network, and a
56−public-key infrastructure (PKI). In the social layer, your ship is
57−your name. In the packet layer, your ship is your network address.
58−In the PKI, your ship is your cryptographic identity. Perhaps more
61+public-key infrastructure (PKI). In the social layer, your ship is
62+your name. In the packet layer, your ship is your network address.
63+In the PKI, your ship is your cryptographic identity. Perhaps more
5964intuitively, a ship is a sort of pronounceable phone number.
6065
61−And once Urbit is built, no one owns the city. No one can control it.
66+And once Urbit is built, no one owns the city. No one can control it.
6267It does need governance; but it governs itself as a digital republic.
6368
6469## Details
6570
66−As an Urbit user, these basics are all you need to know. As a
67−developer, a few more details might interest you. (An even more
71+As an Urbit user, these basics are all you need to know. As a
72+developer, a few more details might interest you. (An even more
6873comprehensive treatment is in the [whitepaper](https://media.urbit.org/whitepaper.pdf)).
6974
7075### Design goals
7176
7277An identity system has three goals: a name wants to be secure,
73−human-meaningful, and decentralized. A principle called "Zooko's
78+human-meaningful, and decentralized. A principle called "Zooko's
7479triangle" says that a practical identity system can achieve any two of
7580these goals.
7681
7782The art of OS design is the art of using strategic tradeoffs to almost
78−solve unsolvable problems. Urbit's goals are to be secure,
79−human-_memorable_, and _eventually_ decentralized. We sacrifice
83+solve unsolvable problems. Urbit's goals are to be secure,
84+human-_memorable_, and _eventually_ decentralized. We sacrifice
8085meaning (Urbit is not competing with the DNS), and postpone
81−decentralization. These tradeoffs buy us a simple system that can
86+decentralization. These tradeoffs buy us a simple system that can
8287actually be built.
8388
8489### Comparison to existing identity layers
@@ -92,43 +97,43 @@ addresses (like `126.78.92.112`), domain names (like
9297`@galenwp`).
9398
9499Urbit (or more precisely, its Ames protocol) squeezes all three layers
95−into one. At the network level, Urbit is a P2P overlay network; your
96−ship is your network address. It's also the name of your server.
97−Finally, it's your secure digital pseudonym. And we map your ship
100+into one. At the network level, Urbit is a P2P overlay network; your
101+ship is your network address. It's also the name of your server.
102+Finally, it's your secure digital pseudonym. And we map your ship
98103name into the DNS, at `ship.urbit.org`.
99104
100105(One way to use Urbit is as an identity for the Internet, which
101−doesn't have a standard system of secure authentication. Urbit has a
106+doesn't have a standard system of secure authentication. Urbit has a
102107single-signon API which lets any Web server accept Urbit logins, like
103108a normal social login -- but not captive to any central mainframe.)
104109
105110### Cryptographic ownership
106111
107−You own an Urbit ship cryptographically, like a Bitcoin wallet. But
112+You own an Urbit ship cryptographically, like a Bitcoin wallet. But
108113Urbit doesn't use a blockchain or mining.
109114
110115You transfer a ship by signing a new public key with the old private
111−key, then broadcasting the signature. Any urbit that receives this
116+key, then broadcasting the signature. Any urbit that receives this
112117new certificate will no longer trust the old key.
113118
114−Urbit is digital land, not digital money. A currency needs to support
115−high-frequency, zero-friction transfers. Real estate transfers are
119+Urbit is digital land, not digital money. A currency needs to support
120+high-frequency, zero-friction transfers. Real estate transfers are
116121low frequency and high friction, so the "double spend" problem (which
117122mining solves) is much less pressing.
118123
119−Don't expect urbits to be tradeable on cryptocurrency exchanges. A
124+Don't expect urbits to be tradeable on cryptocurrency exchanges. A
120125trade adds at least one signature to the ship's certificate, or two if
121−the parties don't trust each other and an intermediary is needed. A
126+the parties don't trust each other and an intermediary is needed. A
122127bulky certificate isn't free, since it slows down new connections.
123128
124−This isn't a serious problem if urbits are treated like land. But it
125−prevents Urbit from being a competent currency. This is a feature,
126−not a bug. Urbit has no need to compete with Bitcoin or Ethereum,
129+This isn't a serious problem if urbits are treated like land. But it
130+prevents Urbit from being a competent currency. This is a feature,
131+not a bug. Urbit has no need to compete with Bitcoin or Ethereum,
127132and every reason not to.
128133
129134## Moons and comets
130135
131−In the general case, a ship is actually a 128-bit number. A full
136+In the general case, a ship is actually a 128-bit number. A full
132137table of ship classes:
133138
134139```
@@ -140,154 +145,154 @@ table of ship classes:
140145```
141146
142147Moons are for clients and connected devices: a laptop, a phone, a
143−digital thermostat. A moon is not independent; its parent planet has
144−to sign its key updates. (We don't want rogue clients floating
148+digital thermostat. A moon is not independent; its parent planet has
149+to sign its key updates. (We don't want rogue clients floating
145150randomly around the universe.)
146151
147−A comet's address is the hash of its initial public key. Anyone can
148−launch a comet. Nothing stops you from using a comet as your
152+A comet's address is the hash of its initial public key. Anyone can
153+launch a comet. Nothing stops you from using a comet as your
149154identity, except that the name is a mouthful and everyone will assume
150155you're a bot.
151156
152157### Scarcity, reputation, friendliness and trust
153158
154159A crucial difference between Urbit and other networks is that planets
155−are scarce. Even when the network is fully populated, there are only
156−4 billion. Early in Urbit's life, most stars and galaxies are not yet
157−operating, so far fewer are available. No one will ever be able to
160+are scarce. Even when the network is fully populated, there are only
161+4 billion. Early in Urbit's life, most stars and galaxies are not yet
162+operating, so far fewer are available. No one will ever be able to
158163get planets trivially and for free.
159164
160165Urbit is a _friendly network_: a network on which you can assume that
161−a stranger is nice until proven nasty. Friendliness is a direct
162−consequence of scarce, individually owned identities. We're not
166+a stranger is nice until proven nasty. Friendliness is a direct
167+consequence of scarce, individually owned identities. We're not
163168changing human nature, just creating the right economic incentives.
164169
165170Most forms of network abuse are "Sybil attacks": they rely on an
166−infinite supply of fresh identities. Scarcity makes reputation work.
171+infinite supply of fresh identities. Scarcity makes reputation work.
167172Spam is a business; if the cost of a new planet exceeds the amount of
168173money you can make by spamming from that planet until its reputation
169174is trashed, there will be no spam.
170175
171176Shady stars and galaxies that sell blocks of planets to spammers will
172177also develop reputations as "bad neighborhoods," damaging the value of
173−the whole block. Abuse at any level is designed to be
178+the whole block. Abuse at any level is designed to be
174179counterproductive and economically self-terminating.
175180
176181Urbit has no reputation system at all at the moment, simply because
177−we're so small that friendliness is automatic. The clear and rigorous
182+we're so small that friendliness is automatic. The clear and rigorous
178183structure of the address space is not a reputation system; it is a
179184platform on which any number of such systems can and should be built.
180185But we can't build one until we need one.
181186
182187### Initial allocation and rationale
183188
184−In cryptocurrency terms, Urbit is "100% premined." Why? Three
189+In cryptocurrency terms, Urbit is "100% premined." Why? Three
185190reasons.
186191
187−One, Urbit doesn't need mining. Two, Urbit is a much more ambitious
188−software project than Bitcoin or even Ethereum. To fund its own
192+One, Urbit doesn't need mining. Two, Urbit is a much more ambitious
193+software project than Bitcoin or even Ethereum. To fund its own
189194development, the project needs to capture the potential value of its
190195own real estate.
191196
192197Three, most theories of property agree that anyone whoever creates or
193−discovers new property starts out by owning it. Because galaxies are
194−premined, Urbit starts as a centralized system. But it has two strong
198+discovers new property starts out by owning it. Because galaxies are
199+premined, Urbit starts as a centralized system. But it has two strong
195200motivations to decentralize.
196201
197−One, the more decentralized Urbit is, the more Urbit is worth. Two,
202+One, the more decentralized Urbit is, the more Urbit is worth. Two,
198203the only way for Urbit to fund its own development is to homestead its
199204own real estate.
200205
201206Urbit was created by Curtis Yarvin, who has distributed the 256
202207galaxies as follows (allocation as of June 1, 2016):
203208
204−95, to the [Tlon Corporation](/blog/company). 50, to urbit.org, the future
205−community foundation. 40, to Tlon employees and their family members
209+95, to the [Tlon Corporation](/blog/company). 50, to urbit.org, the future
210+community foundation. 40, to Tlon employees and their family members
206211(24 to Curtis, who started in 2002; 16 to everyone else, who started
207−in 2014). 34, to outside investors in Tlon. 37, to 33 other
212+in 2014). 34, to outside investors in Tlon. 37, to 33 other
208213individuals, who donated to the project, contributed code or services,
209214won a contest, or were just in the right place at the right time.
210215
211216What's critical is that the whole system is unlikely to collapse back
212−into a single landlord. This is why we've intentionally scattered
217+into a single landlord. This is why we've intentionally scattered
213218Urbit's ownership across a diverse set of entities.
214219
215220Furthermore, we've defined informal conventions designed to motivate a
216221healthy ownership structure by punishing violators with reputation
217−cost. Address blocks should only split, never merge; galaxies and
222+cost. Address blocks should only split, never merge; galaxies and
218223stars should be owned by different parties; galaxies should be owned
219−by true individuals, not corporations. Urbit does not live up to
224+by true individuals, not corporations. Urbit does not live up to
220225these ideals at present, but must always progress toward them.
221226
222227### Federated services, adoption and escape
223228
224−Urbit is a peer-to-peer network. Urbits that live behind a firewall
229+Urbit is a peer-to-peer network. Urbits that live behind a firewall
225230or on a home network need "supernodes" to help them route packets.
226−The supernode is the parent. So a parent's work isn't done once it's
231+The supernode is the parent. So a parent's work isn't done once it's
227232launched all its children.
228233
229−There's no way to enforce this responsibility. So a star or planet
234+There's no way to enforce this responsibility. So a star or planet
230235can be _adopted_ by a new parent of the same class, letting it escape
231−from a bad default parent. If your parent stops serving you, and no
236+from a bad default parent. If your parent stops serving you, and no
232237other parent is willing to adopt you, you're probably a bad actor.
233238
234−Supernode routing is just one example of why you need a parent. A
239+Supernode routing is just one example of why you need a parent. A
235240mature Urbit will naturally develop all kinds of other _federated
236241services_ -- from technical standardization and update approval, to
237−certificate update broadcast, to reputation and friend lookup. All
238−these services are delivered by cooperating stars and galaxies. Bad
242+certificate update broadcast, to reputation and friend lookup. All
243+these services are delivered by cooperating stars and galaxies. Bad
239244actors at this level should be rare.
240245
241246Especially when Urbit is young, the level of trust that a child places
242−in its parent is high. The trust implied by automatic kernel updates
243−is almost infinite. You can disable updates, but that's nowhere near
244−practical yet. (Ideally we will be able to freeze the Arvo kernel,
247+in its parent is high. The trust implied by automatic kernel updates
248+is almost infinite. You can disable updates, but that's nowhere near
249+practical yet. (Ideally we will be able to freeze the Arvo kernel,
245250like Nock, and turn off kernel updates; but this will take years at
246251least.)
247252
248253### Code is law: seeing like a pattern language of great cities
249254
250−Constitutional innovation is dangerous. Our vision of digital
255+Constitutional innovation is dangerous. Our vision of digital
251256governance isn't ours, but is synthesized as best we can from the work
252257of four great 20th-century thinkers: the legal scholar Lawrence
253258Lessig, the political scientist James C. Scott, the urbanist Jane
254259Jacobs and the architect Christopher Alexander.
255260
256261All decentralized computation systems rely to some extent on Lessig's
257−principle: "code is law." Where law uses human interpretation to
258−determine an outcome, code uses mathematics. It is code, not law,
262+principle: "code is law." Where law uses human interpretation to
263+determine an outcome, code uses mathematics. It is code, not law,
259264that decides who owns a Bitcoin wallet.
260265
261−But all these systems, including Bitcoin, need governance. They need
262−as little as possible, but not none. In the digital world as in the
266+But all these systems, including Bitcoin, need governance. They need
267+as little as possible, but not none. In the digital world as in the
263268real world, _laissez-faire_ is always necessary, never sufficient.
264269Governance is a human universal.
265270
266−That's why we call Urbit a "virtual city." And as a city, it can't be
267−a corporate gated community. It might start as that, but it has to
271+That's why we call Urbit a "virtual city." And as a city, it can't be
272+a corporate gated community. It might start as that, but it has to
268273grow up into a true city-state: a self-governing digital republic.
269274This pattern is not just blind clinging to Anglo-American tradition;
270275like every prudent constitution, it fits the actual virtues and vices
271276of its target population.
272277
273278Urbit's galactic hierarchy resembles the natural patterns we find in
274−many existing human political systems. As Alexander wrote:
279+many existing human political systems. As Alexander wrote:
275280
276281> Wherever possible, work toward the evolution of independent regions
277− in the world, each with its own natural and geographic boundaries;
278− each with its own economy; each one autonomous and self-governing;
279− each with a seat in a world government, without the intervening power
280− of larger states or countries.
282+> in the world, each with its own natural and geographic boundaries;
283+> each with its own economy; each one autonomous and self-governing;
284+> each with a seat in a world government, without the intervening power
285+> of larger states or countries.
281286
282287We adapt Alexander's vision to a digital republic as the pattern that
283−_authority is proportional to property_. This pattern already has a
288+_authority is proportional to property_. This pattern already has a
284289name in the cryptocurrency community, which calls it _proof of stake_.
285290Urbit's launch hierarchy is a sort of built-in proof of stake.
286291
287292Another governance pattern, a political cliche but no less valuable
288−for it, is the system of checks and balances. The address space of
293+for it, is the system of checks and balances. The address space of
289294Urbit is covered by three independent tiers, galaxies, stars and
290−planets; which should govern? The obvious design is a three-chambered
295+planets; which should govern? The obvious design is a three-chambered
291296legislature balanced against itself.
292297
293298For more on Urbit's governance design, see our [beliefs and
content/blog/tools-of-our-own.md+5−4
@@ -1,11 +1,12 @@
11+++
22title = "Tools of Our Own"
3−date = 2020-05-13
3+date = "2020-05-12"
44description = "What is a digital environment? What does it mean to shape your own digital environment?"
5+
56[extra]
67author = "Matilde Park"
78ship = "~haddef-sigwen"
8−image ="https://media.urbit.org/site/posts/essays/tools-of-our-own-1.png"
9+image = "https://media.urbit.org/site/posts/essays/tools-of-our-own-1.png"
910+++
1011
1112<br>
@@ -18,7 +19,7 @@ image ="https://media.urbit.org/site/posts/essays/tools-of-our-own-1.png"
1819>
1920> <cite>Ivan Illich, <em>Tools for Conviviality</em></cite>
2021
21−One of the recent ways we've come to describe the mission of the Urbit project is to give communities [the power to shape, or evolve, their digital environments](https://urbit.org/blog/urbit-is-for-communities/). Of course, like many of our definitions, it requires some background to really contextualize the claim. When I describe this particular statement to people, they often ask, "What does that *mean*, though? What is a digital environment, and why would I need Urbit to do it?"
22+One of the recent ways we've come to describe the mission of the Urbit project is to give communities [the power to shape, or evolve, their digital environments](https://urbit.org/blog/urbit-is-for-communities/). Of course, like many of our definitions, it requires some background to really contextualize the claim. When I describe this particular statement to people, they often ask, "What does that _mean_, though? What is a digital environment, and why would I need Urbit to do it?"
2223
2324After all, we think of our slate of tools as our entire toolbox. This makes sense for physical tools. And for a lot of people in the real world (at least, I think), their tools remain physical notebooks and paper. I, however, left those tools behind ages ago, and found myself in a world that used my habits, my memory, to loosely organize a wide array of online tools, that were themselves shaped according to the values of their creators.
2425
@@ -50,7 +51,7 @@ But this is crazy: for decades, an aspect of the Internet stack that necessitate
5051
5152And for productivity tools—for the personal activities we do every day—the same problem ultimately applies. Either you wrangle more and more single-use "products" into a framework, wrangling combinatorial explosion, or you punt the problem to the user's brain, remembering the relation between tools.
5253
53−This is why hybrid products are born *and* why massive enterprises are shifting toward subscription models for office software. With the [clearnet](https://en.wikipedia.org/wiki/Clearnet_(networking)), using our own computers for everyday tasks that extend outside themselves is not easy. It's way easier to sign into an enterprise's server farm for your persistent data storage and manipulation. In 2020, the prefab parts for the exoskeleton only come in "left arm, right leg" pairs, or you can just give up and plug straight into SkyNet.
54+This is why hybrid products are born _and_ why massive enterprises are shifting toward subscription models for office software. With the [clearnet](<https://en.wikipedia.org/wiki/Clearnet_(networking)>), using our own computers for everyday tasks that extend outside themselves is not easy. It's way easier to sign into an enterprise's server farm for your persistent data storage and manipulation. In 2020, the prefab parts for the exoskeleton only come in "left arm, right leg" pairs, or you can just give up and plug straight into SkyNet.
5455
5556<br>
5657
content/blog/toward-a-frozen-operating-system.md+89−83
@@ -1,52 +1,58 @@
11+++
22title = "Toward a Frozen Operating System"
3−date = 2017-05-10
3+date = "2017-05-09"
44description = "Is it possible to freeze an entire OS?"
5−aliases = ["/posts/essays/toward-a-frozen-operating-system", "/posts/toward-a-frozen-operating-system", "/blog/2017.5-frozen/"]
5+aliases = [
6+ "/posts/essays/toward-a-frozen-operating-system",
7+ "/posts/toward-a-frozen-operating-system",
8+ "/blog/2017.5-frozen/"
9+]
10+
611[extra]
712author = "Curtis Yarvin + Galen Wolfe-Pauly"
813ship = "~sorreg-namtyv + ~ravmel-ropdyl"
914+++
15+
1016Is it possible to freeze an entire OS, so that its codebase never changes and
11−never has to change? Is the proposition even meaningful? Is it practical?
17+never has to change? Is the proposition even meaningful? Is it practical?
1218And if so, why would we want a frozen OS?
1319
14−Think about it intuitively. There's a reason we call an OS a "platform." It's
15−a piece of permanent infrastructure. Paul Graham wrote a
20+Think about it intuitively. There's a reason we call an OS a "platform." It's
21+a piece of permanent infrastructure. Paul Graham wrote a
1622[great essay](http://www.paulgraham.com/hundred.html) about the
1723"hundred-year language," but the language is only one part of any complete
18−platform. And in infrastructure terms, a hundred years isn't that long.
24+platform. And in infrastructure terms, a hundred years isn't that long.
1925
20−Why not think of structures that have lasted _thousands_ of years? An aqueduct,
21−a pyramid, a Parthenon? Why set our sights lower? Why isn't it time to aim for
22−perfect and timeless code? If not now, when?
26+Why not think of structures that have lasted _thousands_ of years? An aqueduct,
27+a pyramid, a Parthenon? Why set our sights lower? Why isn't it time to aim for
28+perfect and timeless code? If not now, when?
2329
2430## Scope of the problem
2531
26−More prosaically, a frozen OS just means your OS never changes. A frozen OS
27−never gets any updates. Not because it can't update itself, just because it
32+More prosaically, a frozen OS just means your OS never changes. A frozen OS
33+never gets any updates. Not because it can't update itself, just because it
2834doesn't need to.
2935
30−Is this even a meaningful concept? A frozen OS? First we'll have to decide
31−what "OS" even means. Certainly, if "OS" means "the code that your hardware
36+Is this even a meaningful concept? A frozen OS? First we'll have to decide
37+what "OS" even means. Certainly, if "OS" means "the code that your hardware
3238boots into," hardware always changes and so will the OS.
3339
3440A broader, more useful definition: the "OS" is _an opaque model of a persistent
35−general-purpose computer_. This definition allows for arbitrary levels of
36−virtualization. Linux on a droplet is an OS. A browser is an OS, because it's
37−persistent (sorta) and opaque. But `node.js` is not an OS, because it's not
41+general-purpose computer_. This definition allows for arbitrary levels of
42+virtualization. Linux on a droplet is an OS. A browser is an OS, because it's
43+persistent (sorta) and opaque. But `node.js` is not an OS, because it's not
3844opaque: it exports Linux system calls.
3945
4046Within this opaque model, we have to decide what's "system" and "user" software.
41−It clearly makes no sense to freeze userspace. Let's use the
47+It clearly makes no sense to freeze userspace. Let's use the
4248[trusted codebase](https://en.wikipedia.org/wiki/Trusted_computing_base): code
4349is system software, if compromising it would compromise the whole system.
4450
4551## Infinite maturity
4652
4753It's important to remember that just because a system is designed to achieve
48−frozenness, doesn't mean it's useless until it's frozen. It doesn't even mean
49−it's immature. It just means that in the very long term, the system's maturity
54+frozenness, doesn't mean it's useless until it's frozen. It doesn't even mean
55+it's immature. It just means that in the very long term, the system's maturity
5056goals are infinite.
5157
5258Systems designed to diverge infinitely (with normal X.X.X semantic versioning),
@@ -54,30 +60,30 @@ even those designed to converge infinitely (as with
5460[Knuth versioning](http://www.tex.ac.uk/FAQ-TeXfuture.html)), also achieve
5561maturity, often great maturity, without being quite frozen.
5662
57−For example, C is a very mature language. C has long since mastered backward
58−compatibility. We can be sure that any C program which compiles on today's
63+For example, C is a very mature language. C has long since mastered backward
64+compatibility. We can be sure that any C program which compiles on today's
5965correct C compilers will compile on any future correct C compiler.
6066
6167But, since C is not frozen, we can't be sure that today's C compilers will
62−compile any future C program. So C has not yet achieved perfect _forward_
63−compatibility. By definition, a frozen system is compatible both forward and
64−backward. So C is mature, but it could still get more mature.
68+compile any future C program. So C has not yet achieved perfect _forward_
69+compatibility. By definition, a frozen system is compatible both forward and
70+backward. So C is mature, but it could still get more mature.
6571
66−The point of a frozen OS is to shoot for _infinite_ maturity. Obviously a
72+The point of a frozen OS is to shoot for _infinite_ maturity. Obviously a
6773frozen platform is compatible forever in both directions.
6874
69−Infinite maturity does exist in the real world. But only in a few simple file
70−formats and protocols — IP, JSON, XML. And not all this maturity is the result
71−of perfection. Some is just the accident of a missing update mechanism.
75+Infinite maturity does exist in the real world. But only in a few simple file
76+formats and protocols — IP, JSON, XML. And not all this maturity is the result
77+of perfection. Some is just the accident of a missing update mechanism.
7278
7379But IP, JSON, XML... this is how stable, how taken for granted, system software
74−should be. And can be. Certainly, any JSON parser today will parse any JSON
80+should be. And can be. Certainly, any JSON parser today will parse any JSON
7581document made in the future.
7682
7783The dream of absolute zero is an OS whose core components are so simple, so
7884boring, and so mechanically straightforward that we can imagine them becoming
79−finished and never changing. We need to freeze not just a format or a protocol,
80−but a language, a kernel, a standard library. To succeed, we need to flush out
85+finished and never changing. We need to freeze not just a format or a protocol,
86+but a language, a kernel, a standard library. To succeed, we need to flush out
8187each quirk, complexity, and creeping feature, until the system is so boring and
8288obvious that no one even wants to change it.
8389
@@ -85,19 +91,19 @@ obvious that no one even wants to change it.
8591
8692"Kelvin versioning" is one way to track a project designed to be frozen.
8793
88−In Kelvin versioning, a version is an integer in degrees Kelvin. Absolute zero
89−is frozen — no further updates are possible. If your Kelvin versions don't
90−track your actual progress, you run out of integers. This danger is a concrete
94+In Kelvin versioning, a version is an integer in degrees Kelvin. Absolute zero
95+is frozen — no further updates are possible. If your Kelvin versions don't
96+track your actual progress, you run out of integers. This danger is a concrete
9197incentive for the project to track its own progress accurately.
9298
93−(Kelvin versioning isn't useful only at lifecycle scale. It can be used for any
99+(Kelvin versioning isn't useful only at lifecycle scale. It can be used for any
94100development process with an irreversible end — as build numbers for a release,
95101for example.)
96102
97103## The palm-tree dependency model
98104
99−A whole OS can't have a single Kelvin number. It has to consist of multiple
100−components which depend on each other. What's the right dependency model for
105+A whole OS can't have a single Kelvin number. It has to consist of multiple
106+components which depend on each other. What's the right dependency model for
101107the parts of a frozen OS?
102108
103109One way to think about dependencies across a whole OS is the "palm-tree model."
@@ -106,11 +112,11 @@ components (where we have to choose one version of the code), and "inclusive"
106112ones (where different users can see different versions).
107113
108114The exclusive components are the trunk of the palm tree: a stack of layers, each
109−of which has one active copy. For instance, you are only running one kernel at
110−a time. Different apps cannot use different versions of the kernel.
115+of which has one active copy. For instance, you are only running one kernel at
116+a time. Different apps cannot use different versions of the kernel.
111117
112118The inclusive components are the fronds, branching out in any direction they
113−want. Not only can two apps use different versions of the same library, in
119+want. Not only can two apps use different versions of the same library, in
114120many situations _one_ app needs to be able to use two different versions of the
115121same library.
116122
@@ -118,28 +124,28 @@ same library.
118124
119125Any subsystem that serves as any kind of platform is exclusive, since anything
120126that runs on top of the platform has to choose one version of the platform to
121−run on. Since layers are good, this creates a natural stack which can get quite
127+run on. Since layers are good, this creates a natural stack which can get quite
122128tall — and include components which are technically in userspace.
123129
124130The right way for this trunk to approach absolute zero is to "telescope" its
125−Kelvin versions. The rules of telescoping are simple:
131+Kelvin versions. The rules of telescoping are simple:
126132
1271331. If tool B sits on platform A, either both A and B must be at absolute zero,
128−or B must be warmer than A.
134+ or B must be warmer than A.
129135
1301362. Whenever the temperature of A (the platform) declines, the temperature of B
131−(the tool) must also decline.
137+ (the tool) must also decline.
132138
133−3. B must state the version of A it was developed against. A, when loading B,
134−must state its own current version, and the warmest version of itself with which
135−it's backward-compatible.
139+3. B must state the version of A it was developed against. A, when loading B,
140+ must state its own current version, and the warmest version of itself with which
141+ it's backward-compatible.
136142
137143Of course, if B itself is a platform on which some higher-level tool C depends,
138144it must follow the same constraints recursively.
139145
140146The important effect of obeying rule 2: in a tall trunk, it's sufficient to
141−state your dependency on the platform directly below you. Suppose C sits on B,
142−which sits on A and exports features of A. C can state only the version of B
147+state your dependency on the platform directly below you. Suppose C sits on B,
148+which sits on A and exports features of A. C can state only the version of B
143149it's written against, because when A chills, B must also chill.
144150
145151If A could chill without B chilling, we could modify C to use new features of A.
@@ -148,73 +154,73 @@ received the A update.
148154
149155## The palm fronds: total flexibility
150156
151−The goal of the trunk is to get to the fronds. In the fronds, no one should
152−ever worry about dependency conflicts. And nothing is ever frozen, or has to be
157+The goal of the trunk is to get to the fronds. In the fronds, no one should
158+ever worry about dependency conflicts. And nothing is ever frozen, or has to be
153159frozen.
154160
155161The right way to solve dependencies in userspace is: within an organization, use
156−a monorepo and link relative to its head. Between organizations, use pinned
157−version numbers that are as immutable as possible. Avoid programming
162+a monorepo and link relative to its head. Between organizations, use pinned
163+version numbers that are as immutable as possible. Avoid programming
158164environments that create exclusion problems in userspace — for instance, that
159165compel a single process to choose one version of a library when a diamond
160166dependency exists.
161167
162168There is almost never any good reason to automatically update dependencies with
163−fresh versions of foreign code. In the case of a security update, the
169+fresh versions of foreign code. In the case of a security update, the
164170maintainer of an app which depends on a patched library needs to catch the
165−patch and propagate the update in a new version of the app. An app shouldn't be
171+patch and propagate the update in a new version of the app. An app shouldn't be
166172security-critical to begin with, and propagating updates is a basic function of
167−a modern OS. Also, if the app is security-critical, it could have its own bugs,
173+a modern OS. Also, if the app is security-critical, it could have its own bugs,
168174so it needs a maintainer and an update pathway anyway.
169175
170176## Urbit: status and prospects
171177
172−Yes, we do believe it's possible to write a freezable OS. In fact, we wrote
173−one. And it works. It's not yet frozen (except at the bottom layer), but it's
178+Yes, we do believe it's possible to write a freezable OS. In fact, we wrote
179+one. And it works. It's not yet frozen (except at the bottom layer), but it's
174180getting there.
175181
176−Urbit, a clean-slate functional OS, has been under development since 2002. It
182+Urbit, a clean-slate functional OS, has been under development since 2002. It
177183took a decade (as a one-man project) just to build a prototype of a freezable OS.
178184The result in 2017 (now with a small company) is a telescoping Kelvin stack of
179185layers from VM to UI.
180186
181187At the bottom (the VM Nock), this stack is slightly warmer than liquid helium
182−(5K). It's easy for Nock to get this cold, because it's defined in a page of
183−axioms that gzips to 340 bytes. We are in no hurry to declare zero, but any
188+(5K). It's easy for Nock to get this cold, because it's defined in a page of
189+axioms that gzips to 340 bytes. We are in no hurry to declare zero, but any
184190change at this point would be both very unlikely and very difficult to
185191implement.
186192
187193Urbit's typed functional language, Hoon, which compiles itself to Nock, is
188−closing in on liquid krypton at 143K. Hoon is defined in about 5,000 lines of
189−Hoon, or 10,000 if you count the deep standard library. Nock will never need to
194+closing in on liquid krypton at 143K. Hoon is defined in about 5,000 lines of
195+Hoon, or 10,000 if you count the deep standard library. Nock will never need to
190196change; Hoon is perfectly serviceable but has some well-known rough spots.
191197
192−Above Hoon, the stack rapidly gets much warmer. Arvo is an event-driven
193−microkernel that's 1,000 lines of Hoon. Above this are another 5,000 lines of
198+Above Hoon, the stack rapidly gets much warmer. Arvo is an event-driven
199+microkernel that's 1,000 lines of Hoon. Above this are another 5,000 lines of
194200system library, then 12,000 lines of Arvo modules: a peer-to-peer network, a
195201PKI and private ledger, a revision-control system, an HTTP gateway, a functional
196−build system, and an application sandbox. A trivial working system needs
202+build system, and an application sandbox. A trivial working system needs
197203another 5,000 lines for basic chat and shell apps.
198204
199205We haven't had meaningful Kelvin numbers for the Arvo layer, but this release
200−will change that. About a third of Arvo has been or will be rewritten in the
206+will change that. About a third of Arvo has been or will be rewritten in the
201207last year; we'll assign Kelvins once this code (which now compiles) is tested
202208into existence, largely based on how close the last compiling draft was to the
203−first working draft. But you'll certainly be able to cook eggs on it.
209+first working draft. But you'll certainly be able to cook eggs on it.
204210
205−(Once again, not being frozen doesn't mean not working. Until all these layers
206−are finished, we'll be updating them over the air. To be exact, Urbit
211+(Once again, not being frozen doesn't mean not working. Until all these layers
212+are finished, we'll be updating them over the air. To be exact, Urbit
207213distributes its own updates through subscriptions in its own revision-control
208214system.)
209215
210216The actual status of Urbit is that in 2017, we hope to make our last
211217discontinuous update — meaning that instead of your Urbit node updating itself
212−silently, you destroy and recreate it. Urbit works today, but it isn't really
218+silently, you destroy and recreate it. Urbit works today, but it isn't really
213219alive until today's Urbit data lives forever.
214220
215221Even committing to continuity is a significant step toward the frozen OS,
216222because we're committing to never making another change that the present
217−platform can't install. Fortunately, the only layer that has to stay frozen for
223+platform can't install. Fortunately, the only layer that has to stay frozen for
218224this is Nock.
219225
220226## The style of convergent system software
@@ -223,22 +229,22 @@ We're obviously in no position to declare victory at any layer above Nock, but
223229aiming at absolute zero creates a system design style we think works very well —
224230even if we never get to zero.
225231
226−Deep, onion-like layering is essential. A thin layer has no room to grow. A
232+Deep, onion-like layering is essential. A thin layer has no room to grow. A
227233good example of this principle is the difference between Urbit and Lisp
228−machines. Both Nock and Lisp are very simple axiomatic definitions of
229−computing. But practical Lisp systems expand by extending the model, whereas
234+machines. Both Nock and Lisp are very simple axiomatic definitions of
235+computing. But practical Lisp systems expand by extending the model, whereas
230236Urbit layers over a frozen axiom system.
231237
232−Software that expands by extension is inevitable. But we need to be able to
233−kick it up to userspace. System software should be concerned with the
234−fundamental problems of computing, which don't change. The few cases in which
238+Software that expands by extension is inevitable. But we need to be able to
239+kick it up to userspace. System software should be concerned with the
240+fundamental problems of computing, which don't change. The few cases in which
235241they do change — like crypto algorithms — are special cases, easily
236−encapsulated. And even these changes can be expected to slow down in the long
242+encapsulated. And even these changes can be expected to slow down in the long
237243term.
238244
239245Perhaps the best example of the convergent style in existing, mature system
240−software is the relational database. The genius of the relational model is that
241−it's designed to never grow hair. Even SQL, with its COBOL-era syntax, is
246+software is the relational database. The genius of the relational model is that
247+it's designed to never grow hair. Even SQL, with its COBOL-era syntax, is
242248essentially invulnerable to any significant non-cosmetic improvement.
243249
244250The lesson: when we see a system that seems to want to expand indefinitely, we
@@ -248,7 +254,7 @@ Layering is what distinguishes true system software from the giant balls of mud
248254that all deep codebases want to become.
249255
250256Are all balls of mud, or at least all the muddy parts of an OS, susceptible to
251−this transformation? We think so. But we'll see.
257+this transformation? We think so. But we'll see.
252258
253−As usual, comments are on fora. Check out
259+As usual, comments are on fora. Check out
254260[this thread](https://urbit.org/fora/posts/~2017.5.12..20.30.11..0050~/).
content/blog/toward-a-new-clay.md+233−227
@@ -1,63 +1,68 @@
11+++
22title = "Toward a New %clay"
3−date = 2016-07-14
3+date = "2016-07-13"
44description = "Urbit's revision-control system, %clay, is itself due for a (medium-sized) revision!"
5−aliases = ["/posts/essays/toward-a-new-clay", "/posts/toward-a-new-clay", "/blog/clay"]
5+aliases = [
6+ "/posts/essays/toward-a-new-clay",
7+ "/posts/toward-a-new-clay",
8+ "/blog/clay"
9+]
10+
611[extra]
712author = "Curtis Yarvin"
813ship = "~sorreg-namtyv"
914+++
1015
1116TLDR: (a) Urbit's revision-control system, `%clay`, is itself due
12−for a (medium-sized) revision! (b) this time, you yourself can
13−really help! (c) please don't give away the buried spoiler!
17+for a (medium-sized) revision! (b) this time, you yourself can
18+really help! (c) please don't give away the buried spoiler!
1419
1520This explanation does not (or at least should not) require you to
1621know anything about Urbit.
1722
1823### But %clay is already pretty cool
1924
20−Of course, nothing in Urbit is allowed to be _lame_. `%clay` is
21−actually quite cool. It does need some work. But first, let's
25+Of course, nothing in Urbit is allowed to be _lame_. `%clay` is
26+actually quite cool. It does need some work. But first, let's
2227talk about what it is and why it's cool.
2328
2429`%clay` is the Arvo vane (Urbit kernel module) for revision
25−control. It's an authenticated, human-memorable global immutable
26−namespace which is also a typed revision-control system. It's
27−also very good at subscription and synchronization. Urbit
30+control. It's an authenticated, human-memorable global immutable
31+namespace which is also a typed revision-control system. It's
32+also very good at subscription and synchronization. Urbit
2833currently uses `%clay` to distribute live hotpatches; we
2934transparently upgrade the whole network with one checkin.
3035
3136### Compared to other revision-control systems
3237
33−`%clay` is clearly a vanilla DVCS in the modern `git` style. Of
38+`%clay` is clearly a vanilla DVCS in the modern `git` style. Of
3439deployed DVCS these days, `%clay` is probably closest in spirit
3540to `bzr` or maybe `fossil`.
3641
3742Obviously, as a part of a larger whole, you would expect any
38−Urbit RCS to be brutally spartan. `%clay` is. It's even more
43+Urbit RCS to be brutally spartan. `%clay` is. It's even more
3944spartan than `bzr`.
4045
41−(In fact, it's really too spartan to fully use at the moment. We
46+(In fact, it's really too spartan to fully use at the moment. We
4247ourselves still use `%clay` mainly as a distribution system, and
43−do all internal development on GitHub. This is because the
48+do all internal development on GitHub. This is because the
4449present `%clay` lacks a few little conveniences, like commit
45−messages. See upgrades, below.)
50+messages. See upgrades, below.)
4651
47−There are lots of normal DVCS things in `%clay`. But there are
48−also cool and unusual ones. Let's take a brief tour of the
52+There are lots of normal DVCS things in `%clay`. But there are
53+also cool and unusual ones. Let's take a brief tour of the
4954high-level system, then describe what we think should change
5055about it.
5156
5257### Anatomy of a DVCS
5358
54−A DVCS is a historical state graph. A point in this graph is a
59+A DVCS is a historical state graph. A point in this graph is a
5560snapshot of some tree-structured system, like a filesystem.
5661
5762These snapshots, including recursive internal nodes, are stored in
58−a content-addressable store. Pointers in this store are used to
63+a content-addressable store. Pointers in this store are used to
5964construct a revision graph, whose edges are edit and/or merge
60−actions. Some sort of namespace attaches meaningful names to
65+actions. Some sort of namespace attaches meaningful names to
6166current revisions in this graph.
6267
6368There are six big questions in the design of a DVCS:
@@ -73,16 +78,16 @@ There are six big questions in the design of a DVCS:
7378
7479A good way to summarize `%clay` (at present) is that its answers
7580to the first four questions are interesting, and its answers to
76−the last two are boring. We'll talk about all six, though.
81+the last two are boring. We'll talk about all six, though.
7782
7883### Global namespace: [ship desk case]
7984
80−The permanent global name of a `%clay` snapshot is a `++beak`. A beak
85+The permanent global name of a `%clay` snapshot is a `++beak`. A beak
8186is a triple: `[ship desk case]`.
8287
83−The `++ship` is an Urbit ship. A ship is a network address, a
84−human-memorable name and a cryptographic identity. The address
85−width is variable; shorter addresses are more desirable. Most
88+The `++ship` is an Urbit ship. A ship is a network address, a
89+human-memorable name and a cryptographic identity. The address
90+width is variable; shorter addresses are more desirable. Most
8691users have 32-bit addresses, which we map to four-syllable
8792synthetic names like `~sorreg-namtyv`.
8893
@@ -95,44 +100,44 @@ In the Urbit path syntax, the beak is the first three segments of
95100the path: `/ship/desk/case/my/cat/picture`.
96101
97102In most cases, a path parser has a default ship, desk and case,
98−each of which can be replaced by `=`. So `/=home=/my/cat/picture`
103+each of which can be replaced by `=`. So `/=home=/my/cat/picture`
99104is the data at `/my/cat/picture` on your own ship, in the `%home`
100−desk, right now. Immutability doesn't have to be inconvenient.
105+desk, right now. Immutability doesn't have to be inconvenient.
101106
102−`%clay` has no concept of a mutable name or a magic `HEAD`. Use
103−the current date. If you're referring to remote data and you're
107+`%clay` has no concept of a mutable name or a magic `HEAD`. Use
108+the current date. If you're referring to remote data and you're
104109worried about clock skew, subtract a second or three, or be
105−prepared to block. (Or keep your clock unskewed, which shouldn't
106−be _that_ hard.) It's not like mutable-name schemes work any
110+prepared to block. (Or keep your clock unskewed, which shouldn't
111+be _that_ hard.) It's not like mutable-name schemes work any
107112better than this anyway.
108113
109−(Immutability is central to `%clay`. `git` merely adopted the
110−reflog. `%clay` was born in it, molded by it...)
114+(Immutability is central to `%clay`. `git` merely adopted the
115+reflog. `%clay` was born in it, molded by it...)
111116
112117`%clay` is objective; each Urbit node hosts only one ship, but
113−treats domestic and foreign data (almost) the same way. If you
118+treats domestic and foreign data (almost) the same way. If you
114119ask your `%clay` repository for someone else's data, it will
115120block the request until it gets the data, which it then caches.
116121At present, we always fulfill requests from the origin ship,
117122though in future we could certainly use it as a tracker.
118123
119124If `%clay` discards cached data, it keeps a hash, so that your
120−urbit can't violate the local illusion of immutability. We
125+urbit can't violate the local illusion of immutability. We
121126can't, of course, prevent anyone else's ship from sending
122−conflicting claims in different directions. But we can prevent
127+conflicting claims in different directions. But we can prevent
123128programs on our own ship from hearing about them, meaning that we
124129retain local referential transparency.
125130
126131### Local structure: dome, arch, leaf and mark
127132
128−A `%clay` snapshot is called a `++dome`. A dome is the `%clay`
133+A `%clay` snapshot is called a `++dome`. A dome is the `%clay`
129134equivalent of a tree-structured filesystem.
130135
131136Each node in this tree is one uniform structure, an `++arch`,
132−which is both file and directory. A `++leaf` or data value in
137+which is both file and directory. A `++leaf` or data value in
133138this arch is a typed document.
134139
135−A logical document type is called a `++mark`. A mark is a
140+A logical document type is called a `++mark`. A mark is a
136141symbolic pointer to a Hoon source file, in the same dome, for an
137142engine that can validate, compare, and/or convert
138143documents of that mark.
@@ -141,8 +146,8 @@ Let's go over arches and marks a little more closely...
141146
142147#### An arch is a uniform filesystem node
143148
144−Most filesystems and RCS have modal nodes. For instance, a git
145−data node can be a blob or a tree. `%clay` (and the Urbit
149+Most filesystems and RCS have modal nodes. For instance, a git
150+data node can be a blob or a tree. `%clay` (and the Urbit
146151namespace in general) has one kind of node, an `arch`:
147152
148153```
@@ -151,24 +156,24 @@ namespace in general) has one kind of node, an `arch`:
151156```
152157
153158An arch has an optional typed-data leaf, and optional named
154−children. In Unix terms, it's a file, a directory, or both. It
159+children. In Unix terms, it's a file, a directory, or both. It
155160can't be neither: an empty arch, with no data and no children, is
156−auto-pruned. As in `git` (but not in Unix), the hierarchy is a
157−pure function of its leaves. Paths exist only because of the
161+auto-pruned. As in `git` (but not in Unix), the hierarchy is a
162+pure function of its leaves. Paths exist only because of the
158163data they point to.
159164
160165The `++knot` names in an arch path are also a little special.
161166They're typed, in a sense; any knot can be parsed invertibly into
162−a typed atom. The atom is an arbitrary unsigned integer. Its
167+a typed atom. The atom is an arbitrary unsigned integer. Its
163168type (an `++aura` if you know Hoon) defines the semantics and
164169presentation of the atom: for instance, a symbol, a decimal,
165170a date, etc.
166171
167172Ultimately a filesystem is a database, and a path is a primary
168−key. It's very useful to be able to store simple data in this
173+key. It's very useful to be able to store simple data in this
169174key, in a standard and unambiguous way.
170175
171−Why uniform nodes? One, they map nicely to information trees
176+Why uniform nodes? One, they map nicely to information trees
172177where a subtree may need some custom collective presentation,
173178not an automatically generated Apache style directory listing.
174179Two, non-uniform nodes introduce a whole pointless category of
@@ -176,34 +181,34 @@ node type conflicts -- for which life is far too short.
176181
177182#### A mark is an executable document type
178183
179−A mark is "like an executable MIME type." It's best defined as a
184+A mark is "like an executable MIME type." It's best defined as a
180185symbolic mapping from a filesystem to a schema engine.
181186
182187If you have a MIME type `text/html`, you need to watch the
183−Internets to track what the W3C thinks HTML is. If you have an
188+Internets to track what the W3C thinks HTML is. If you have an
184189Urbit mark `%html`, you can functionally construct (using our
185190insanely powerful functional build vane `%ford`) a core which
186191can validate or normalize HTML, apply patch and diff logic, and
187−translate to and from other marks. `%ford` can even reason about
192+translate to and from other marks. `%ford` can even reason about
188193translation paths and construct multistep conversions.
189194
190195(Urbit does not actually have this super-smart `%html` mark right
191−now. But it probably should, huh. And this page was composed in
196+now. But it probably should, huh. And this page was composed in
192197Markdown and translated to HTML by `%ford`.)
193198
194−Where does the source code of a mark live? Within the same dome
195−as the data it describes. `%html` files are described by the
199+Where does the source code of a mark live? Within the same dome
200+as the data it describes. `%html` files are described by the
196201Hoon source at `/===/mar/html`, which perhaps gets mapped into
197202your Unix filesystem at `$ship/home/mar/html.hoon`.
198203
199−This Hoon file is not self-contained. It has dependencies. The
204+This Hoon file is not self-contained. It has dependencies. The
200205`%html` mark may depend on various structures and libraries
201−elsewhere in Urbit. But the source code for all them is within
206+elsewhere in Urbit. But the source code for all them is within
202207this dome.
203208
204209One constraint this puts on domes is that _all domes are
205−descendants of the base system dome_. Domes are versions of one
206−reality, not fragments of that reality. You can't create a new
210+descendants of the base system dome_. Domes are versions of one
211+reality, not fragments of that reality. You can't create a new
207212empty dome -- you'd have no mark source, and be unable to install
208213any validated files.
209214
@@ -214,13 +219,13 @@ weird collisions between non-parallel things don't happen.
214219
215220### Unix mapping and mounting
216221
217−Every DVCS is its own filesystem in a sense. But every DVCS
222+Every DVCS is its own filesystem in a sense. But every DVCS
218223works by mapping and mounting itself, in some sense, to Unix.
219224
220225#### Mapping arches to Unix
221226
222−How do we map arches into Unix? The arch structure maps 1:1 to
223−the Unix directory tree. When the arch has a leaf, we derive a
227+How do we map arches into Unix? The arch structure maps 1:1 to
228+the Unix directory tree. When the arch has a leaf, we derive a
224229dot extension from the file's mark.
225230
226231So, supposing we have a leaf `foo` which is an HTML document
@@ -234,19 +239,19 @@ foo/moo.html
234239```
235240
236241This maps invertibly back into `%clay`, and it looks perfectly
237−unremarkable from the Unix side. File completion sometimes gets
242+unremarkable from the Unix side. File completion sometimes gets
238243a little annoying.
239244
240245It would be if nice every possible Unix tree, even every
241246plausible Unix tree, mapped cleanly and completely to a `%clay`
242−dome. There are always horrid exceptions, even in common use --
243−like extensionless Makefiles. The trivial solution is that if
247+dome. There are always horrid exceptions, even in common use --
248+like extensionless Makefiles. The trivial solution is that if
244249`%clay` finds a file mysterious, it won't track it.
245250
246251One often unquestioned assumption in new system software is that
247−compatibility with old content is important. It's nice, but not
248−that important. Most content in a new system is new content.
249−The important compatibility direction is export, not import. So
252+compatibility with old content is important. It's nice, but not
253+that important. Most content in a new system is new content.
254+The important compatibility direction is export, not import. So
250255the new system should subset, not superset, the ancient formats.
251256
252257### Mounting desks to Unix
@@ -257,36 +262,36 @@ the Unix directory of the same name within the pier.
257262When files in a mount directory change, `%clay` notices it
258263through `libuv` filesystem watching (ultimately `inotify()` or
259264`FSEvents`), computes diffs, and automatically commits them to
260−the desk. And if `%clay` creates a new version for its own
265+the desk. And if `%clay` creates a new version for its own
261266urbity reasons, it will revise the Unix files.
262267
263268Keeping all mounted files in the same Unix subdirectory makes it
264−easy to move the whole pier in a tarfile. Edits applied while
269+easy to move the whole pier in a tarfile. Edits applied while
265270the `urbit` process isn't running will be detected and applied
266271the next time it starts.
267272
268273In conventional DVCS terms, `%clay` has a 1:1 static mapping from
269−branches to working directories. Why?
274+branches to working directories. Why?
270275
271−Why not? Do we need that "what branches are checked out in what
272−directories" piece of state? Why force the user to worry about
273−which branches are mounted to which directories? Why not just
274−mount them under their own names? Is there some crippling global
276+Why not? Do we need that "what branches are checked out in what
277+directories" piece of state? Why force the user to worry about
278+which branches are mounted to which directories? Why not just
279+mount them under their own names? Is there some crippling global
275280shortage of disk space for source files? Our planet is running
276−out of inodes? Wut?
281+out of inodes? Wut?
277282
278283### Queries, subscriptions and synchronization
279284
280285There are two ways to get data out of `%clay`: dereference the Urbit
281−namespace, or send a request/subscription. Sync is in userspace.
286+namespace, or send a request/subscription. Sync is in userspace.
282287
283288#### Dereferencing the namespace
284289
285−`%clay` is just part of the full Urbit namespace. The full namespace
290+`%clay` is just part of the full Urbit namespace. The full namespace
286291has a two-character prefix which expresses what vane to query
287−(always `%c` for `%clay`). The suffix is a mode flag; `%x` for
292+(always `%c` for `%clay`). The suffix is a mode flag; `%x` for
288293data, `%y` for a list of children, `%z` for the whole arch
289−subtree, `%w` for the version number. (Each vane has its own
294+subtree, `%w` for the version number. (Each vane has its own
290295modes.)
291296
292297For example, the full path to my cat picture is
@@ -300,6 +305,7 @@ For example, the full path to my cat picture is
300305If the data model is `++image` (hypothetical -- we don't really
301306do image processing in Urbit right now), the normal way to load
302307this data in a Hoon program is
308+
303309```
304310.^(image /cx/~sorreg-namtyv/home/[now]/my/cat/picture)
305311```
@@ -316,15 +322,15 @@ learn it in future, `[~ ~]` if we know we'll never know it, or
316322`[~ ~ value]` if we know it now.
317323
318324In high-level shell programming (`:dojo`), we can make apparently
319−"blocking" requests to `%clay`. What actually happens: when `%clay`
325+"blocking" requests to `%clay`. What actually happens: when `%clay`
320326produces `~`, we stop trying to compute this expression and wait
321−on one or more blocking requests. When we are unblocked, we
327+on one or more blocking requests. When we are unblocked, we
322328recompute again from scratch; the intermediate computation is not
323329saved at all.
324330
325−Urbit doesn't like to block. It likes to save coherent data
326−structures, not incomplete computation contexts. When Urbit
327−pretends to block for you, this is a courtesy service. You
331+Urbit doesn't like to block. It likes to save coherent data
332+structures, not incomplete computation contexts. When Urbit
333+pretends to block for you, this is a courtesy service. You
328334can return the courtesy of not expecting miracles from it.
329335When in doubt, send an actual request.
330336
@@ -335,7 +341,7 @@ namespace, but can (a) read across case (revision) ranges,
335341and (b) filter by subtree.
336342
337343If the revision range in a request stretches into the future, the
338−request becomes a subscription. Urbit messaging always regards a
344+request becomes a subscription. Urbit messaging always regards a
339345single response as a special case of a subscription.
340346
341347Generally, the response stream created by a request starts with
@@ -345,10 +351,10 @@ closed when the request range is complete.
345351
346352#### Userspace synchronization
347353
348−Synchronization per se is done in userspace. In `%clay`, sync just
354+Synchronization per se is done in userspace. In `%clay`, sync just
349355means an application (typically the `%kiln` module in the system
350356app `:hood`) subscribes to a remote desk, and saves its change
351−stream locally. So sync is really an emergent feature of `%clay`.
357+stream locally. So sync is really an emergent feature of `%clay`.
352358
353359### Revision graph
354360
@@ -356,16 +362,16 @@ stream locally. So sync is really an emergent feature of `%clay`.
356362Some changes are proposed below, however.
357363
358364As in any DVCS, a dome is the child of one parent dome (an edit)
359−or more parents (a merge). Often the parent of any revision is
365+or more parents (a merge). Often the parent of any revision is
360366the previous version in the sequence, but it can be anything.
361367
362368### Storage model
363369
364−`%clay`'s storage model is completely uninteresting. It's also a
370+`%clay`'s storage model is completely uninteresting. It's also a
365371little funky and I want to change it, so I'll be super vague.
366372
367373A `++lobe`, a 128-bit atom, is the Merkle hash of a `blob`, which
368−is essentially a leaf. All blobs are stored in a hash table
374+is essentially a leaf. All blobs are stored in a hash table
369375(`(map lobe blob)`), and reference each other through lobes.
370376
371377At present we don't GC this space at all, because we don't
@@ -374,12 +380,12 @@ actually delete any roots.
374380A `blob` may be `%direct`, meaning it's defined as the data
375381itself, or `%delta`, defined as a change against another blob.
376382This is motivated by the desire not to store a full snapshot
377−on every file change. But it may be misguided (see changes #0
383+on every file change. But it may be misguided (see changes #0
378384and #1 below).
379385
380386We cache the full arch tree (`++ankh`) of the latest state in
381−each desk. For current queries, this mitigates a lot of the
382−opportunities for slowness that this data model creates. But the
387+each desk. For current queries, this mitigates a lot of the
388+opportunities for slowness that this data model creates. But the
383389disparity between the speed of the current version and the
384390speed previous version is an undesirable glitch in the API.
385391
@@ -391,38 +397,38 @@ We actually have _three_ motivations for change...
391397
392398At present, we're still using `git` as a development platform.
393399`%clay` is certainly used, but just for its strength --
394−deployment. This is starving Urbit of essential experience and
395−basically keeping it lame. So, change is necessary.
400+deployment. This is starving Urbit of essential experience and
401+basically keeping it lame. So, change is necessary.
396402
397403### Change must come from the community
398404
399−"Why?" you ask? "Why must change come from the community?" Well,
400−one, duh. Change always comes from the community.
405+"Why?" you ask? "Why must change come from the community?" Well,
406+one, duh. Change always comes from the community.
401407
402−But two, a great force for change has departed. Philip Monk,
408+But two, a great force for change has departed. Philip Monk,
403409late maintainer of `%clay` (`~wictuc-folrex` in the old era,
404−`~wicdev-wisryt` in the new), is tired of types and typing. He
410+`~wicdev-wisryt` in the new), is tired of types and typing. He
405411spent September roaming with the bison in Montana, and is now
406−literally on his way to Patagonia. On the one hand, Phil still
412+literally on his way to Patagonia. On the one hand, Phil still
407413exists and is not at all unwilling to answer questions, even dumb
408−questions. On the other hand, _Patagonia_.
414+questions. On the other hand, _Patagonia_.
409415
410−So %clay needs a new owner, or owners. At this point, we think
416+So %clay needs a new owner, or owners. At this point, we think
411417the community might be indoctrinated enough to take a stab.
412418
413419Alas, `%clay` already has a pretty checkered ownership history.
414420Long ago I built a `%clay` that was really the only serious
415−design failure in Arvo. Then Jared Hance, a brilliant summer
421+design failure in Arvo. Then Jared Hance, a brilliant summer
416422intern, took my broken `%clay` and reformed it into a minimal `git`
417−in about a week. Then Philip modified Jared's `%clay` to be a
423+in about a week. Then Philip modified Jared's `%clay` to be a
418424_typed_ revision-control system, which is a pretty cool thing.
419425
420426But... in none of these transitions did `%clay` actually get
421−_rewritten_ per se. While it's a reasonably good vane, it
427+_rewritten_ per se. While it's a reasonably good vane, it
422428does contain one or two historical decisions.
423429
424430We know a lot more about Arvo than we used to, and I think we can
425−revisit many of these decisions. The point of this post is to
431+revisit many of these decisions. The point of this post is to
426432start a `%clay` design discussion that will evolve into actual
427433collective action.
428434
@@ -432,41 +438,41 @@ We're planning a rewards program for contributions to `%clay`.
432438It'll simply involve setting a time period and a pool of real
433439estate, and allocating the pool by judged contribution.
434440
435−This is an experimental program. We'll say more about it later.
436−It may not even happen. It may happen very differently. When in
441+This is an experimental program. We'll say more about it later.
442+It may not even happen. It may happen very differently. When in
437443doubt, don't talk about Fight Club.
438444
439445## Some openings for change
440446
441−Change, of course, must come from the community. No one can
442−dictate change from the top down. We _know_ this. But...
447+Change, of course, must come from the community. No one can
448+dictate change from the top down. We _know_ this. But...
443449
444450This list of suggested changes for the next `%clay` is not in any
445−sort of order: priority, structure, difficulty, etc. Let's talk
446−about the changes first; make actual plans second. The numbers
451+sort of order: priority, structure, difficulty, etc. Let's talk
452+about the changes first; make actual plans second. The numbers
447453here are just for convenience.
448454
449−*All changes in this program will happen on the next-generation
450−(`cc-release`) branch.*
455+_All changes in this program will happen on the next-generation
456+(`cc-release`) branch._
451457
452458### Change #0: state reform
453459
454460As mentioned above, the storage model in `%clay`, as the code is
455−at present, feels a little funky to me. There's nothing terribly
461+at present, feels a little funky to me. There's nothing terribly
456462awful about it, but it doesn't feel quite right and its scaling
457463properties are very questionable.
458464
459465Briefly, `%clay` today actually derives the hierarchy from its
460−leaves -- rather than _logically_ so deriving it. Only leaves
461−are in the object store. This is just weird, and you can feel
462−`%clay` trying to be something other than what it is. (I blame
466+leaves -- rather than _logically_ so deriving it. Only leaves
467+are in the object store. This is just weird, and you can feel
468+`%clay` trying to be something other than what it is. (I blame
463469Jared, though it's actually my fault.)
464470
465471To store a dome snapshot (`++yaki`), the present code keeps a
466−`(map path blob)` at the root of the dome. This is enough to
472+`(map path blob)` at the root of the dome. This is enough to
467473reconstruct the `++arch` structures the namespace exports.
468474However, all kinds of basic arch operations, like basically `ls`,
469−become `O(n)` in the number of leaves in the dome. This is
475+become `O(n)` in the number of leaves in the dome. This is
470476obviously not quite right.
471477
472478I believe the storage structure should be (removing everything
@@ -487,46 +493,46 @@ Here a `++root` is the universal node, with children addressed by
487493hash, but logically representing the abstract `++arch`.
488494
489495Users of hierarchical filesystems basically expect performance
490−qualities that match the filesystem structure. A huge directory
491−in one place shouldn't affect search speeds somewhere else. And
496+qualities that match the filesystem structure. A huge directory
497+in one place shouldn't affect search speeds somewhere else. And
492498of course, `ls` can't be O(n) in the size of the filesystem.
493499
494500### Change #1: store edges, cache snapshots
495501
496−The current `%clay` is snapshot-oriented, like `git`. The actual
497−changes are discarded. I think this is a bad choice.
502+The current `%clay` is snapshot-oriented, like `git`. The actual
503+changes are discarded. I think this is a bad choice.
498504
499505`%clay` is not a research project, and has no idea of going as
500−far as `darcs` in the "set-of-patches" direction. However, at
506+far as `darcs` in the "set-of-patches" direction. However, at
501507present we actually throw away the patch (`++nori`).
502508
503509I think the right DVCS design for `%clay` is a snapshot-oriented
504−system which also keeps the patches. The revision graph has the
505−same general shape as in the old `git` style. But rather than
510+system which also keeps the patches. The revision graph has the
511+same general shape as in the old `git` style. But rather than
506512just deriving the diffs from the snapshots, we can also derive
507−the snapshots from the diffs. When in doubt, we save space by
513+the snapshots from the diffs. When in doubt, we save space by
508514dropping the snapshot, not the diff.
509515
510516For an RCS which is also a general-purpose typed filesystem, it's
511517clear that considering edges (deltas, diffs, changes, etc) as the
512−primary state is optimal. You can use diff functions to derive
518+primary state is optimal. You can use diff functions to derive
513519deltas from snapshots, but in many data models this will always
514−risk losing information from the original action. When in
520+risk losing information from the original action. When in
515521doubt, save what the user did.
516522
517523This is even more true for operations on the tree structure, not
518−on individual leaves. Consider the heuristic energy that `git` has
524+on individual leaves. Consider the heuristic energy that `git` has
519525to go through to figure out when `mv` has been used -- even when
520−`git mv` has been used! (According to the `git` faq, this is
526+`git mv` has been used! (According to the `git` faq, this is
521527because the lowest common denominator remains Linus' style of
522528working with emailed patches.)
523529
524−Edges probably don't even need to be deduplicated. They also can
530+Edges probably don't even need to be deduplicated. They also can
525531contain metadata such as commit messages (which `%clay` has no
526532place for at present).
527533
528534Once edges are recognized as unreclaimed primary state, snapshots
529−can always be derived from the edges. So we can reclaim memory
535+can always be derived from the edges. So we can reclaim memory
530536being used for snapshots.
531537
532538It's also straightforward to have a kind of edge which is a list
@@ -534,27 +540,27 @@ of edges, letting us collapse feature branches trivially.
534540
535541Finally, I think references in edges should wherever possible
536542indirect through the namespace, rather than directly to the
537−content address. The user has strictly more information if you
543+content address. The user has strictly more information if you
538544say you merged `/~sorreg-namtyv/base/987/`, than if all you have
539545is the hash that this reference refers to.
540546
541547### Change #2: unconfuse merge and rebase
542548
543549The dispute between merge and rebase has all the bad smells of
544−a historical wart. But here I'm just not sure what's right.
550+a historical wart. But here I'm just not sure what's right.
545551
546552The user has one _intent_ whether merging or rebasing, which is
547−to combine changes on one desk into another. The _algorithm_
553+to combine changes on one desk into another. The _algorithm_
548554used to construct this change, whether operational transformation
549555(rebasing) or a 3-way diff (merging) has one goal: use all
550556available information to model the authors' editing intent as
551−realistically as possible. If we save edges, we should use
557+realistically as possible. If we save edges, we should use
552558edges.
553559
554560Whether to define the resulting change graph with the typical
555561structure of a merge, or the typical structure of a rebase,
556562strikes me as quite arbitrary, and well into the land of "pick
557−one and force everyone to stick with it." But this call demands
563+one and force everyone to stick with it." But this call demands
558564a real expert on RCS workflow, which I'm not.
559565
560566Since `%clay` is a humble part of a larger system and needs to
@@ -564,23 +570,23 @@ different preferences" is not usually the right answer.
564570### Change #3: comment jihad
565571
566572`%clay` needs to be brought up to the documentation standards of
567−`%jael`. This means (a) the formatting matches; (b) the comments
573+`%jael`. This means (a) the formatting matches; (b) the comments
568574are at the same level of quality and ubiquity.
569575
570576The basic commenting standards are: (a) every core (class) needs
571577a block comment explanation; (b) every gate (function) needs a
572578line comment; (c) every face (variable) needs a line comment.
573579
574−This is obviously not just a clerical task. To write these
575−comments, you need to actually understand the code. This is a
580+This is obviously not just a clerical task. To write these
581+comments, you need to actually understand the code. This is a
576582nontrivial but extremely rewarding task, even if the code you're
577583commenting will get replaced.
578584
579585Also, the _symbols_ in `%clay` must be brought up to `%jael`
580−quality. There is still far too much four-letterism here.
586+quality. There is still far too much four-letterism here.
581587
582588NB: `%clay` is about 3000 lines of pretty clean Hoon, which is
583−certainly not at all undocumented. We're not exactly looking at
589+certainly not at all undocumented. We're not exactly looking at
584590a Matterhorn of reverse engineering here.
585591
586592### Change #4: knot to coin internal paths
@@ -591,26 +597,26 @@ ASCII symbol as an atom) must be within the range of the
591597invertible noun printer, `++co`.
592598
593599`++co` maps a described data value, a `++coin`, to an ASCII
594−string which is a valid URL segment and Unix filename. Its
600+string which is a valid URL segment and Unix filename. Its
595601friend `++so` inverts the function, perfectly.
596602
597−Almost every knot is the simplest kind of `coin`, a `dime.` A
603+Almost every knot is the simplest kind of `coin`, a `dime.` A
598604dime is a single atom with a rendering type (`aura` if you know
599−Hoon). Auras include `@tas` for symbolic text, `@ud` for
600−unsigned decimal, `@p` for Urbit ship, etc. `++co` can also
605+Hoon). Auras include `@tas` for symbolic text, `@ud` for
606+unsigned decimal, `@p` for Urbit ship, etc. `++co` can also
601607print arbitrary cells, though less prettily.
602608
603609This feature is cool because it lets us stuff data into names in
604−a precise and predictable way. Usually the names in a namespace
610+a precise and predictable way. Usually the names in a namespace
605611are human-meaningful and human-originated, and are therefore
606−symbolic, but there are exceptions. For example, blogposts may
612+symbolic, but there are exceptions. For example, blogposts may
607613want to be named by date.
608614
609615However, it is slightly retarded for the fundamental state of our
610616arches to store the _rendered_ string (`++knot`), not the source
611−data (`++coin`). It leads to all kinds of inefficiencies where
612−we're doing way more parsing than we want to. (Parsing also
613−should be jet-propelled, but is not.) It also makes it way too
617+data (`++coin`). It leads to all kinds of inefficiencies where
618+we're doing way more parsing than we want to. (Parsing also
619+should be jet-propelled, but is not.) It also makes it way too
614620easy to sneak in bad data and make it `%clay`'s problem.
615621
616622So, logically, we'd be shifting from
@@ -625,7 +631,7 @@ So, logically, we'd be shifting from
625631
626632Also, a vanilla `++map` might not be quite the right data
627633structure at this point -- we probably want a custom sorted tree,
628−which separates auras and imposes a custom order on each. This
634+which separates auras and imposes a custom order on each. This
629635would let us serve simple range queries quite efficiently, so
630636long as they match the standard aura order (eg, alphabetical
631637order for symbols).
@@ -633,23 +639,23 @@ order for symbols).
633639### Change #5: dome semantics by reference
634640
635641While the principle that a dome contains its own mark source is
636−elegant, it's a pain in the ass to implement properly. `%clay`
642+elegant, it's a pain in the ass to implement properly. `%clay`
637643certainly does not do it justice at present.
638644
639645The complexity is in checking every change to see whether it
640646includes a change to the mark source (which is very unlikely),
641647or a dependency of the mark source (slightly less unlikely).
642648And if so, do we have to update all the leaves in the dome?
643−This is also very unlikely. And yet, it happens.
649+This is also very unlikely. And yet, it happens.
644650
645651Instead, we could simply designate, by beak (ship, desk, and
646−case) a dome which contains the canonical mark source. This
652+case) a dome which contains the canonical mark source. This
647653would rarely change -- you could upgrade a desk to a new mark
648654dome, but it would be a manual operation and probably a rare one.
649655
650656The common case would just be that everyone uses the current
651657version of the `%base` desk when a desk is created, and never
652−changes it. In practice, this means not every two-byte edit
658+changes it. In practice, this means not every two-byte edit
653659needs to get involved in detecting and/or applying schema
654660evolution, a welcome simplification.
655661
@@ -661,14 +667,14 @@ design is one mark per message structure, the mark namespace gets
661667overloaded fast.
662668
663669So we added an app hierarchy within the mark namespace, using hep
664−`-` as a divider. The `:talk` app expects messages with the mark
670+`-` as a divider. The `:talk` app expects messages with the mark
665671`talk-message`, whose sources is in `/===/mar/talk/message`.
666672
667673This helps, but it doesn't solve another two problems: trivial
668674nouns and containers.
669675
670676It's retarded to have to add a source file to send a `@ud` or a
671−`*`. An aura (see above under `coin`) should be a trivial mark.
677+`*`. An aura (see above under `coin`) should be a trivial mark.
672678
673679Also, we need to be able to construct standard containers of
674680marks: lists, maps, sets, and tuples (or, as a database person
@@ -680,32 +686,32 @@ Another kind of complex mark that needs to exist: conflict,
680686difference, and invalid marks.
681687
682688Conflict data and difference data are two types of noun that are
683−generated in normal RCS operation. If we have the concept of an
689+generated in normal RCS operation. If we have the concept of an
684690`%html` noun, we also need the concept of an invertible change
685691from one `%html` file to another; a merge conflict between two
686692`%html` files; and even a conflict between two marks.
687693
688694There are two kinds of changes to a dome: manual and automatic.
689695Manual changes are initiated by the user and should crash, unless
690−manually overridden. Automatic changes should not crash, ever,
691−and should not lose data. If they create problems, which they
696+manually overridden. Automatic changes should not crash, ever,
697+and should not lose data. If they create problems, which they
692698shouldn't, these problems will need to be cleaned up manually.
693699
694700This is a complex space to navigate, but it requires a conflicted
695701merge to be able to resolve to a valid dome containing conflict
696−leaves, not crash. The present `%clay` goes halfway there and
702+leaves, not crash. The present `%clay` goes halfway there and
697703resolves to a scratch desk, but we can go farther: the whole `git`
698−dumpster-fire of "merge state" deserves destruction. One change
704+dumpster-fire of "merge state" deserves destruction. One change
699705is a merge that produces conflicts, the next is an edit that
700706resolves them.
701707
702−Similarly, all sorts of errors can produce invalid leaves. One
708+Similarly, all sorts of errors can produce invalid leaves. One
703709particularly rare case which is nonetheless important is schema
704710evolution: what happens to files in a mark, when the mark source
705−code changes. They all need to be re-normalized. And this
706−operation can fail, producing an invalid value. (We don't do any
711+code changes. They all need to be re-normalized. And this
712+operation can fail, producing an invalid value. (We don't do any
707713of this now, BTW, although `%ford` has the dependency mechanism to
708−make it possible.) Again, in some cases this should crash the
714+make it possible.) Again, in some cases this should crash the
709715update to the mark source; in other cases, there is no local way
710716to handle the crash.
711717
@@ -716,46 +722,46 @@ into using the bad content.
716722
717723The bottom line: a mark needs to be split into two models:
718724`++mark`, the original symbolic mark with its source engine, and
719−something like `++logo`, the meta-mark or mark container. The
725+something like `++logo`, the meta-mark or mark container. The
720726mark is the building block; the logo is the building.
721727
722728### Change #8: filesystem hierarchy standard
723729
724730While all filesystems remain forks of one ur-filesystem, the
725−standard tends to enforce itself. But not define itself.
731+standard tends to enforce itself. But not define itself.
726732
727−I've always hated the current `/mar` for marks, for instance. I
728−prefer `/mac`. But others hate this. And so on. Also, by
733+I've always hated the current `/mar` for marks, for instance. I
734+prefer `/mac`. But others hate this. And so on. Also, by
729735necessity, our nascent "FHS" is heavily biased toward system
730−data, away from user data. This is retarded.
736+data, away from user data. This is retarded.
731737
732−Please focus all bikeshedding energy on this problem! Better to
738+Please focus all bikeshedding energy on this problem! Better to
733739bikeshed about what color to paint the bikeshed, then what shape
734740the bike gears should be.
735741
736742### Change #9: security and access control
737743
738−Oh, yeah, that! They always say not to design security in at the
739−last minute. Unfortunately, this is exactly what we did. There
740−is no security at all in present `%clay`. (There is also no push
744+Oh, yeah, that! They always say not to design security in at the
745+last minute. Unfortunately, this is exactly what we did. There
746+is no security at all in present `%clay`. (There is also no push
741747operation in `%clay`, so it's not as mad as you think -- anyone
742748can read anything, no one can write anything, which is fine in a
743749young network where there are no secrets.)
744750
745751Fortunately, we don't have anything super fancy planned in this
746−area, just basic access-control lists. These obviously need to
752+area, just basic access-control lists. These obviously need to
747753be designed along with the filesystem-hierarchy standard (see
748754elsewhere).
749755
750−Is it even possible to do ACLs properly in `%clay`? At this
751−point, yes. There is an event-oriented security model in Arvo,
756+Is it even possible to do ACLs properly in `%clay`? At this
757+point, yes. There is an event-oriented security model in Arvo,
752758though it isn't really hooked up to anything at the moment.
753−There is also a privilege badge system in `%jael`. The
759+There is also a privilege badge system in `%jael`. The
754760combination of these two features is quite sufficient for a
755761decent ACL model.
756762
757763The idea of event-based security is that every event passed to
758−`%clay` has a security `++mask`. The mask tells us:
764+`%clay` has a security `++mask`. The mask tells us:
759765
760766- the set of ships that has _contaminated_ this event
761767- the set of ships that has _endorsed_ this event
@@ -763,20 +769,20 @@ The idea of event-based security is that every event passed to
763769
764770To simplify this system a little and maybe explain it, the
765771security question in any event is: (a) who has _caused_ this
766−event? (b) who may receive its _effects_? (These sets never
772+event? (b) who may receive its _effects_? (These sets never
767773include your urbit itself, of course, only neighbors.)
768774
769775For example, if we're doing something because ship X sent us a
770776packet, and we're going to leak the results of this something
771777back in a response to ship X, once `%clay` knows what our ship
772778thinks of its neighbor X, we should have a good picture of what
773−effects this event should be allowed to cause. If `%jael` knows
779+effects this event should be allowed to cause. If `%jael` knows
774780that X is our friend, `%clay` can know that X can see our cat
775781picture.
776782
777783Causality is separated out into contamination (data from ship X
778784got into the event) and endorsement (ship X signed the whole
779−event). (This may be overdesign.) All these sets can be defined
785+event). (This may be overdesign.) All these sets can be defined
780786as the empty set (eg, releasing to the empty set means no output)
781787or the universal set (input from the universal set could be from
782788anyone, ie, is unauthenticated).
@@ -785,11 +791,11 @@ anyone, ie, is unauthenticated).
785791
786792When you read a leaf from a `%clay` dome, `%clay` is happy to
787793perform any necessary mark conversions (the actual work is done
788−by the `%ford` build vane). You can also just ask for the leaf
794+by the `%ford` build vane). You can also just ask for the leaf
789795in whatever mark `%clay` has it.
790796
791797It's confusing to think of this mark extension as part of the
792−path. You shouldn't say `+cat /===/app/talk/hoon`. You should say
798+path. You shouldn't say `+cat /===/app/talk/hoon`. You should say
793799`+cat /===/app/talk`, or maybe `+cat %hoon /===/app/talk`.
794800
795801A mark-extended namespace may be added to `%ford`, to compensate.
@@ -798,7 +804,7 @@ But type-converting reads are the rare case, not the common case.
798804### Change #11: real queries and indexes
799805
800806A filesystem should postpone being a database until it can no
801−longer do so. So, please don't think about this problem yet.
807+longer do so. So, please don't think about this problem yet.
802808I'm joking, of course!
803809
804810### Change #12: meta-query
@@ -807,24 +813,24 @@ Make it possible to query the list of desks in a ship :-)
807813
808814### Change #13: completely redesign Unix mounting
809815
810−This is actually a series of changes, described below. But
816+This is actually a series of changes, described below. But
811817broadly...
812818
813819One of Urbit's experiments is live two-way synchronization
814820between the Unix filesystem and the revision-control store.
815−Dropbox style, as it were. I think this experiment is basically
816−a failure. It may be right for cat pictures, but I don't think
821+Dropbox style, as it were. I think this experiment is basically
822+a failure. It may be right for cat pictures, but I don't think
817823it's right for Urbit.
818824
819825The fundamental problem is that there are all sorts of weird,
820−flaky ways applications use a mutable filesystem. It's not at
826+flaky ways applications use a mutable filesystem. It's not at
821827all unusual for an editor to change a file by deleting the old
822828file, then writing the new one in its place.
823829
824−You really don't want this to produce a delete change. A simple
830+You really don't want this to produce a delete change. A simple
825831cooldown timer for the sync helps a lot with this, but causes
826−other weirdnesses. In theory, a sync can even cause another
827−change to the same version of the same desk. And so on.
832+other weirdnesses. In theory, a sync can even cause another
833+change to the same version of the same desk. And so on.
828834
829835The thing we fear is just too funky to work (there is some
830836strange "reflux bug" still affecting it) is any sort of _two-way_
@@ -835,8 +841,8 @@ cold storage, is that there's no useful workflow that actually
835841uses it -- at least, when editing Urbit code.
836842
837843It's actually really nice to have files on a disk that nothing
838−will automatically modify. If you're using `git` and `%clay` in
839−parallel, it's nice to mount your `git` working directory. The
844+will automatically modify. If you're using `git` and `%clay` in
845+parallel, it's nice to mount your `git` working directory. The
840846original Urbit workflow was to work out of a mounted directory,
841847but the two-way updates were just too weird and scary, so now we
842848tend to edit elsewhere and copy in -- which is lame.
@@ -849,25 +855,25 @@ FUSE (in a somewhat experimental state), and filesystem watching
849855
850856The FUSE interface is a good one, though it needs more work.
851857Moreover, it exports the whole Urbit namespace to Unix, not just
852−`%clay`. For reading Urbit data, FUSE is basically ideal.
858+`%clay`. For reading Urbit data, FUSE is basically ideal.
853859
854−The obvious impulse is to make a read-write FUSE. But I don't
860+The obvious impulse is to make a read-write FUSE. But I don't
855861think FUSE should be used for recording changes to an RCS, even
856862though the FUSE API sends you changes as events.
857863
858−There are three reasons for this. One, the actual filesystem
864+There are three reasons for this. One, the actual filesystem
859865writes that Unix apps make are typically of low quality and
860−confusing. Some crack-brained editor will find it completely
866+confusing. Some crack-brained editor will find it completely
861867normal and unremarkable to modify a byte in a file, by deleting
862−the file and rewriting it from scratch. You can use a cooldown
868+the file and rewriting it from scratch. You can use a cooldown
863869timer to wait for this nonsense to converge, but leaving data in
864870heuristic limbo seems like a very bad idea in FUSE-land.
865871
866872The second is that people derive a lot of comfort from seeing
867−actual files on an actual disk. The idea that your datas are
873+actual files on an actual disk. The idea that your datas are
868874stuck in Urbit is slightly terrifying as a user experience.
869−We claim to be reliable. It's actually hard to imagine datas that
870−couldn't be recovered from either snapshot or log. But how can
875+We claim to be reliable. It's actually hard to imagine datas that
876+couldn't be recovered from either snapshot or log. But how can
871877you possibly believe us on this?
872878
873879So I think it's correct to lean all the weight of reading data
@@ -882,35 +888,35 @@ But this is a separate discussion.
882888
883889### Change #15: one-way, nonced working desk
884890
885−A one-way mount is a much less crazy thing. It works the same
891+A one-way mount is a much less crazy thing. It works the same
886892way our two-way mount works today, but with only one writer: the
887893user, via Unix.
888894
889895Since a mount is one-way, it needs to have an absolute write lock
890−on the desk it's writing to. We cannot have a `%home` desk which
896+on the desk it's writing to. We cannot have a `%home` desk which
891897we are also editing with filesystem watching.
892898
893899Instead, we have a temporary and anonymous state that's connected
894−itself with your `%home` desk. Desk names have to be valid
895−symbols, but we can use `hep`, `-`. A reasonable choice is to
900+itself with your `%home` desk. Desk names have to be valid
901+symbols, but we can use `hep`, `-`. A reasonable choice is to
896902pick a random 32-bit name for each mount instance -- so the desk
897−name is not `%home`, but `%home-bosdut-sigder`. (Randomizing
903+name is not `%home`, but `%home-bosdut-sigder`. (Randomizing
898904instead of always using a fixed suffix, say, `%home-work`,
899905just makes all kinds of screwups less likely.)
900906
901907You create a mount simply by mkdiring the desk name in your pier.
902908Just the base name, Urbit will come up with the `%bosdut-sigder`
903−part and put it in a `.desk` file at the desk root. To forget
904−the mount, just delete this file. This avoids the ugly confusion
909+part and put it in a `.desk` file at the desk root. To forget
910+the mount, just delete this file. This avoids the ugly confusion
905911between unmounting a mount, and deleting all the data in it.
906912
907913(Urbit will keep a set of the mount desks it's used and
908−forgotten, not reuse them, and block all requests into them. By
914+forgotten, not reuse them, and block all requests into them. By
909915blocking, we can delete without losing referential transparency.
910916Yes, Virginia, Urbit can forget!)
911917
912918Note that the auto-reload behavior of applications is extremely
913−useful when testing. When testing, you can either switch the
919+useful when testing. When testing, you can either switch the
914920active application desk from `%home` to `%home-bosdut-sigder`,
915921or activate autosync from the latter to the former.
916922
@@ -933,7 +939,7 @@ Otherwise, you're basically, like, reinventing Perforce.
933939
934940More concretely, the Urbit experience today requires `:hood`
935941pokes (Urbit shell commands, basically) for all nontrivial RCS
936−operations, from mounting to merging. Again, there are lots of
942+operations, from mounting to merging. Again, there are lots of
937943situations in which you can write into a mounted filesystem (the
938944protocol for Unix communication could be easily adapted to
939945communicate with a browser-based editor, for instance), but you
@@ -943,20 +949,20 @@ Even commands like mounting and merging are easily communicated,
943949through filesystem writes that any Unix tool (including many
944950macro editors).
945951
946−This is very easy for a filesystem watcher. One such protocol:
952+This is very easy for a filesystem watcher. One such protocol:
947953if you want to send the daemon a command relative to some
948−directory, write a `.ur-command` metafile in that directory. The
954+directory, write a `.ur-command` metafile in that directory. The
949955daemon accepts the command by deleting it.
950956
951957The user experience is that you configure your mounts by simply
952−making the directories and configuring dotfiles in them. Unlike
958+making the directories and configuring dotfiles in them. Unlike
953959in the present system, Urbit will never modify your datas
954960silently in the background.
955961
956962Here's what this looks like:
957963
958−Suppose you want to edit some data in the `%home` desk. Your
959−data is in `/=home=/mar/talk`. You also want a read-only view
964+Suppose you want to edit some data in the `%home` desk. Your
965+data is in `/=home=/mar/talk`. You also want a read-only view
960966of `/=home=/arvo`.
961967
962968From Unix, you do something like this:
@@ -969,18 +975,18 @@ From Unix, you do something like this:
969975 $ touch home/arvo/.read
970976```
971977
972−Want to commit your changes? That means merging the working
973−desk, `%home-bosdut-sigder`, into the `%home`. Put a commit message
974−into `home/.commit` and it'll happen. If there's an error, it
978+Want to commit your changes? That means merging the working
979+desk, `%home-bosdut-sigder`, into the `%home`. Put a commit message
980+into `home/.commit` and it'll happen. If there's an error, it
975981will appear as `.error`.
976982
977983The mount has a .version file which simply contains the change
978−number (of the working desk) which any edits are relative to. If
984+number (of the working desk) which any edits are relative to. If
979985the urbit daemon is running and watching, edits will be absorbed
980986quickly (probably after a heuristic timeout), and the version
981−incremented. But we always are confident that the edits are
987+incremented. But we always are confident that the edits are
982988against the latest version, or at least we can use this as a
983−sanity check. All kinds of insane things can happen to get a
989+sanity check. All kinds of insane things can happen to get a
984990filesystem out of consistency.
985991
986992This design obviously needs a little fleshing out, but I'm quite
@@ -989,12 +995,12 @@ from Unix.
989995
990996## In conclusion
991997
992−There's obviously a lot of fun here! There are two things you
998+There's obviously a lot of fun here! There are two things you
993999can do right now.
9941000
9951001One, talk about `%clay` on [this forum
9961002thread](http://urbit.org/~~/fora/posts/~2016.10.25..17.37.47..6937~/) or
997−on [:talk](http://urbit.org/stream). Both hosted on Urbit
1003+on [:talk](http://urbit.org/stream). Both hosted on Urbit
9981004itself!
9991005
10001006Two, poke around the
content/blog/urbit-and-bitcoin.md+6−6
@@ -1,7 +1,8 @@
11+++
22title = "Urbit and Bitcoin"
33description = "A sound money deserves a sound computer."
4−date = 2019-10-17
4+date = "2019-10-16"
5+
56[extra]
67author = "Christian Langalis"
78ship = "~pindet-timmut"
@@ -9,13 +10,12 @@ ship = "~pindet-timmut"
910
1011Sound money deserves a sound computer.
1112
12−Urbit imagines a new model for an OS that – among other changes – includes money as a native service. Developers within the Urbit ecosystem will be able to securely use money in their applications as easily as they might use file systems or networking protocols. Creating a new sound currency, however is not our goal; Bitcoin has already done that.
13+Urbit imagines a new model for an OS that – among other changes – includes money as a native service. Developers within the Urbit ecosystem will be able to securely use money in their applications as easily as they might use file systems or networking protocols. Creating a new sound currency, however is not our goal; Bitcoin has already done that.
1314
14−Running a Bitcoin node is very much like running a single purpose personal server (one that hosts the Bitcoin blockchain and verifies transactions). Urbit is designed to be the *final* personal server, so this week we launched several grants to incorporate Bitcoin into our development cycle. The first of these are directed towards interacting with Bitcoin nodes directly from Urbit.
15+Running a Bitcoin node is very much like running a single purpose personal server (one that hosts the Bitcoin blockchain and verifies transactions). Urbit is designed to be the _final_ personal server, so this week we launched several grants to incorporate Bitcoin into our development cycle. The first of these are directed towards interacting with Bitcoin nodes directly from Urbit.
1516
16−Bitcoin and Urbit are complementary systems. Sound digital money requires sound computing to be used safely and effectively. Urbit’s OS is strictly-typed and entirely functional, and as a result, it’s orders of magnitude more secure than the Unix ecosystem when fully implemented.
17+Bitcoin and Urbit are complementary systems. Sound digital money requires sound computing to be used safely and effectively. Urbit’s OS is strictly-typed and entirely functional, and as a result, it’s orders of magnitude more secure than the Unix ecosystem when fully implemented.
1718
18−Urbit and Bitcoin converge along the realization that the Virtual is subsuming the Real. In other words, the locus of control over your life is no longer embodied in the physical, but the digital. For example, what worries you more: a pickpocket or a sim-swapper? The bogeymen of today don’t target our physical selves; they target our private keys, our searches, and our data. The client-server computing paradigm is falling in upon itself, and cannot protect us in this new reality. Without peer-to-peer tools like Urbit and Bitcoin, our property and lives lie vulnerable to control by platforms.
19+Urbit and Bitcoin converge along the realization that the Virtual is subsuming the Real. In other words, the locus of control over your life is no longer embodied in the physical, but the digital. For example, what worries you more: a pickpocket or a sim-swapper? The bogeymen of today don’t target our physical selves; they target our private keys, our searches, and our data. The client-server computing paradigm is falling in upon itself, and cannot protect us in this new reality. Without peer-to-peer tools like Urbit and Bitcoin, our property and lives lie vulnerable to control by platforms.
1920
2021To integrate Bitcoin with Urbit, we’re starting with the basics: a Bitcoin wallet and a Bitcoin node solution for Urbit. These tools will bring Urbit’s Bitcoin functionality from 0 to 1, and will serve as building blocks for our upcoming push from 1 to `n`. We’ll be sharing more about this in the coming weeks and months. If this excites you, please feel free to get involved with some of our current Bitcoin bounties, found [here](https://grants.urbit.org/bounties).
21−
content/blog/urbit-and-the-blockchain.md+85−80
@@ -1,8 +1,13 @@
11+++
22title = "Urbit and the Blockchain Wars"
3−date = 2017-09-25
3+date = "2017-09-24"
44description = "A bit about the 'idea maze' of choosing to bootstrap from Ethereum."
5−aliases = ["/posts/essays/urbit-and-the-blockchain", "/posts/urbit-and-the-blockchain", "/blog/2017.9-critique/"]
5+aliases = [
6+ "/posts/essays/urbit-and-the-blockchain",
7+ "/posts/urbit-and-the-blockchain",
8+ "/blog/2017.9-critique/"
9+]
10+
611[extra]
712author = "Curtis Yarvin"
813ship = "~sorreg-namtyv"
@@ -11,34 +16,34 @@ image = "https://storage.googleapis.com/media.urbit.org/site/posts/essays/urbit-
1116
1217![](https://storage.googleapis.com/media.urbit.org/site/posts/essays/urbit-and-the-blockchain-1.jpg)
1318
14−One core principle of the Urbit network is that *Urbit doesn't take sides*.
19+One core principle of the Urbit network is that _Urbit doesn't take sides_.
1520This is true in all kinds of conflicts -- and especially blockchain wars.
1621
1722We're [moving the Urbit PKI onto Ethereum](https://urbit.org/blog/2017.9.20-bootstrapping-urbit-from-ethereum/)
1823not because we like Ethereum, but because it's the most practical thing for
19−Urbit right now. This is not a moral or aesthetic choice.
24+Urbit right now. This is not a moral or aesthetic choice.
2025
21−Some have objected to this decision. Some of these objections are excellent.
26+Some have objected to this decision. Some of these objections are excellent.
2227The rest are understandable.
2328
24−Let's review our decision, responding to objections along the way. Not everyone
25−has to agree on everything. No one should stay confused. And we welcome
29+Let's review our decision, responding to objections along the way. Not everyone
30+has to agree on everything. No one should stay confused. And we welcome
2631further comment.
2732
2833## Urbit is not endorsing or supporting Ethereum
2934
30−There are many technical criticisms of Ethereum. We agree with many of these
31−criticisms -- even most. But still more important: Bitcoin is the strongest
32−chain. If Bitcoin could directly enforce Urbit's PKI rules, we'd use Bitcoin,
33−for this reason alone. (That said, Ethereum may be less exposed to Chinese
35+There are many technical criticisms of Ethereum. We agree with many of these
36+criticisms -- even most. But still more important: Bitcoin is the strongest
37+chain. If Bitcoin could directly enforce Urbit's PKI rules, we'd use Bitcoin,
38+for this reason alone. (That said, Ethereum may be less exposed to Chinese
3439politics.)
3540
36−We chose ETH because it is the strongest *computational* chain. It is certainly
41+We chose ETH because it is the strongest _computational_ chain. It is certainly
3742stronger than the way we're storing the Urbit land registry now: GitHub, plus
3843internal records.
3944
40−Urbit is not endorsing Ethereum. Urbit is not creating any appreciable monetary
41−demand for Ethereum. Urbit is not even locked in to Ethereum: with a fully
45+Urbit is not endorsing Ethereum. Urbit is not creating any appreciable monetary
46+demand for Ethereum. Urbit is not even locked in to Ethereum: with a fully
4247self-governing constitution, the Urbit galaxies can decide to migrate to another
4348consensus engine, or no consensus engine, or even our own consensus engine, any
4449time we like.
@@ -46,20 +51,20 @@ time we like.
4651And even if the whole Ethereum network unexpectedly implodes, and stops
4752generating meaningful new blocks, we (or more generally: the set of active
4853Urbit galaxies) cannot abandon the social power to manually hard-fork the
49−network. Ultimately, the Ethereum contract is just a hardcoded address in a
54+network. Ultimately, the Ethereum contract is just a hardcoded address in a
5055piece of Urbit source code.
5156
5257Let's address each of these points at a little more length.
5358
5459## On moving to a blockchain
5560
56−The first point to remember: our choice wasn't between Ethereum and nothing. It
57−wasn't between a blockchain and nothing. It was a choice between 21st-century
61+The first point to remember: our choice wasn't between Ethereum and nothing. It
62+wasn't between a blockchain and nothing. It was a choice between 21st-century
5863tools and 20th-century tools.
5964
6065The current Urbit land registry is divided into parts stored in various places:
6166GitHub commits, database records held by Tlon Corporation, and insecure keys on
62−a test network. This might have been fine, for us, in 2015. In 2017, it's
67+a test network. This might have been fine, for us, in 2015. In 2017, it's
6368borderline unacceptable.
6469
6570## On choosing a chain
@@ -68,31 +73,31 @@ Our first decision point: whether the public chain enforces the rules of Urbit,
6873or just logs raw data that anyone can interpret.
6974
7075The simplest procedure, with the strongest blockchain, would be just to encode
71−each Urbit event as raw (OP_RETURN) data on the Bitcoin blockchain. Or we could
76+each Urbit event as raw (OP_RETURN) data on the Bitcoin blockchain. Or we could
7277use another simple layer on top of Bitcoin; classic "colored coins," for
7378instance.
7479
7580The resemblance between Urbit land-registry titles and colored coins is one we
76−noticed a long time ago, of course. For a long time it wasn't that relevant,
81+noticed a long time ago, of course. For a long time it wasn't that relevant,
7782because colored coins remained largely theoretical.
7883
7984The larger problem is just that a non-computational blockchain can't enforce the
8085specific rules of the Urbit land registry (like the right of a star to create
8186specific planets).
8287
83−You can put arbitrary data into a blockchain and enforce it off-chain. This
84−strikes us as unsatisfactory, though. For instance, you have to define the
85−semantics of erroneous or malformed operations. If this is not done perfectly,
86−it's a short road to major weirdness. Also, your interpretation tools are a
88+You can put arbitrary data into a blockchain and enforce it off-chain. This
89+strikes us as unsatisfactory, though. For instance, you have to define the
90+semantics of erroneous or malformed operations. If this is not done perfectly,
91+it's a short road to major weirdness. Also, your interpretation tools are a
8792special-purpose one-off not shared with anyone.
8893
8994There are other second-order "virtualchains" (Blockstack is one example), which
9095build computation layers on top of arbitrary chains. These tools are interesting
91−and cool. They are also quite young. As is Urbit, so we need all the maturity
96+and cool. They are also quite young. As is Urbit, so we need all the maturity
9297we can get.
9398
9499Also, our use case, as a land registry, is quite simple -- we don't have any
95−desire to pay (in complexity) for power we don't use. A two-layer solution
100+desire to pay (in complexity) for power we don't use. A two-layer solution
96101just seems to leave more room for bad weirdness.
97102
98103## As normal Urbit state?
@@ -100,122 +105,122 @@ just seems to leave more room for bad weirdness.
100105The original design was for Urbit to host its own primary copy of the PKI state,
101106not mirror some external master.
102107
103−As more people start believing in Urbit, this makes us extremely nervous. Being
108+As more people start believing in Urbit, this makes us extremely nervous. Being
104109the single source of truth implies a strong commitment to security and
105−continuity. Urbit needs to get there, but it isn't there yet.
110+continuity. Urbit needs to get there, but it isn't there yet.
106111
107112Trust in the security, continuity, and general maturity of Urbit needs to
108−develop gradually. An Urbit that isn't ready to store crypto-assets can still
109−be a great product. But it can't be a great product if its supposedly valuable
113+develop gradually. An Urbit that isn't ready to store crypto-assets can still
114+be a great product. But it can't be a great product if its supposedly valuable
110115keys are in fact insecure, yet needed to operate on the network.
111116
112−In short: we can't follow this original plan. It has the same chicken-egg
117+In short: we can't follow this original plan. It has the same chicken-egg
113118problem we discussed [last time](https://urbit.org/blog/2017.9.20-bootstrapping-urbit-from-ethereum/).
114119
115120## An Urbit consensus engine?
116121
117−Urbit is itself a deterministic computer. Building a consensus computer within
122+Urbit is itself a deterministic computer. Building a consensus computer within
118123Urbit, which is actually a general-purpose OS, is an attractive long-term
119124possibility.
120125
121126But Urbit lacks the principal feature of Ethereum: deterministic performance.
122127In both Ethereum and Urbit, the semantics of a computation are precisely
123−defined. In Ethereum, the computation's cost is also precisely defined.
128+defined. In Ethereum, the computation's cost is also precisely defined.
124129
125−This would be quite hard to do in Urbit. We traded deterministic performance
126−off for semantic simplicity. Designing a consensus computer without a
130+This would be quite hard to do in Urbit. We traded deterministic performance
131+off for semantic simplicity. Designing a consensus computer without a
127132performance definition is a research problem.
128133
129−We have solved a number of research problems here at Urbit. Could we build an
130−Urbit blockchain? This problem doesn't seem utterly intractable. For instance,
134+We have solved a number of research problems here at Urbit. Could we build an
135+Urbit blockchain? This problem doesn't seem utterly intractable. For instance,
131136we could leverage the semi-trusted hierarchy in some direction resembling proof
132137of stake.
133138
134139One thing is certain, though: research problems don't solve themselves
135−overnight. If you have any ideas on this one, give us a holler.
140+overnight. If you have any ideas on this one, give us a holler.
136141
137142In any case, if Urbit got its own consensus engine, it's obvious that we'd
138−simply copy the state of the Urbit PKI on Ethereum, and shut it down. Or we
143+simply copy the state of the Urbit PKI on Ethereum, and shut it down. Or we
139144could migrate to another computational blockchain which works better than
140145Ethereum.
141146
142147## An existing computational blockchain
143148
144−So we need an existing, mature, computational blockchain. There are only two
149+So we need an existing, mature, computational blockchain. There are only two
145150major candidates: ETH and ETC (Ethereum Classic).
146151
147−It's no secret that we prefer the governance model of ETC. It's also no secret
152+It's no secret that we prefer the governance model of ETC. It's also no secret
148153that the whole Ethereum system, especially Solidity, isn't exactly put together
149154in the way we would do it.
150155
151156But an optimal governance model is just one virtue among many others we need to
152−consider. ETH's network capitalization is 25x that of ETC. Its hashrate is 15x.
157+consider. ETH's network capitalization is 25x that of ETC. Its hashrate is 15x.
153158Its tooling support -- in software, hardware, vaulting, exchanging, etc -- is
154159considerably stronger.
155160
156−ETC's governance model is Bitcoin's: code is law. For the network, this is
157−better. But we are considering threats to Urbit, not threats to the rest of
161+ETC's governance model is Bitcoin's: code is law. For the network, this is
162+better. But we are considering threats to Urbit, not threats to the rest of
158163Ethereum.
159164
160−ETH has embraced discretionary human governance. It's quite plausible that this
161−will lead to total political collapse. But the human political structure of ETH
162−seems reasonably strong at the moment. It's relatively difficult to imagine
163−successful, near-term "proof of Vitalik" attacks via Ethereum on Urbit. Political
165+ETH has embraced discretionary human governance. It's quite plausible that this
166+will lead to total political collapse. But the human political structure of ETH
167+seems reasonably strong at the moment. It's relatively difficult to imagine
168+successful, near-term "proof of Vitalik" attacks via Ethereum on Urbit. Political
164169conflict tends to develop over longer periods of time, giving us room to migrate.
165170
166171Ultimately we decided that the minority power of ETC outweighs the governance
167−issues with ETH. This is of course how imperfect standards win. Betamax had
172+issues with ETH. This is of course how imperfect standards win. Betamax had
168173better resolution than VHS.
169174
170175## One reminder
171176
172177For Bitcoin maximalists in particular (some of our best friends are Bitcoin
173178maximalists), it's important to note that (besides the gas price of
174−transactions) putting Urbit on Ethereum *does not create any net monetary demand
175−for Ethereum*.
179+transactions) putting Urbit on Ethereum _does not create any net monetary demand
180+for Ethereum_.
176181
177−Yes, you will get an Urbit ship through an Ethereum transaction. However, no
178−value stays in ether. If you want to buy a ship with bitcoin, you are just
179−going through a conversion layer. These conversion layers work pretty well
180−these days. If you have a religious objection to handling altcoins, have a
182+Yes, you will get an Urbit ship through an Ethereum transaction. However, no
183+value stays in ether. If you want to buy a ship with bitcoin, you are just
184+going through a conversion layer. These conversion layers work pretty well
185+these days. If you have a religious objection to handling altcoins, have a
181186friend help.
182187
183188Bitcoin maximalists understand that all monetary energy should concentrate in a
184−single currency. But land isn't money. And the technical details of the
189+single currency. But land isn't money. And the technical details of the
185190implementation of the Urbit registry -- whether `OP_RETURN`, Ethereum, or GitHub
186191-- have no effect on Bitcoin supply and demand.
187192
188193## Another reminder
189194
190−Ethereum is not using Urbit. Urbit is using Ethereum. We know every cool
195+Ethereum is not using Urbit. Urbit is using Ethereum. We know every cool
191196alternative band that gets signed to a major label says this, but we mean it.
192197
193198Urbit, as a land registry, is almost a textbook example of very weak, boring use
194−of a computational blockchain. We're not expecting a lot out of Ethereum.
199+of a computational blockchain. We're not expecting a lot out of Ethereum.
195200Ethereum does not feel like a system whose technical envelope should be pushed.
196201We have no intention of pushing it.
197202
198203Moreover, the ability to vote formally in an Ethereum constitution will allow us
199−to migrate in a cohesive way to *any other formalization of the Urbit PKI*.
200−This could be another Ethereum contract. Or another blockchain.
204+to migrate in a cohesive way to _any other formalization of the Urbit PKI_.
205+This could be another Ethereum contract. Or another blockchain.
201206
202207This "clean escape" implies that Ethereum is still operating normally, or at
203−least normally enough to conduct a galaxy vote. What could happen to Ethereum?
208+least normally enough to conduct a galaxy vote. What could happen to Ethereum?
204209The blockchain could stop generating new blocks; it could fork; it could be
205−filtered by some kind of collective attacker; it could even start accepting invalid transactions. What seems implausible is destruction of all copies of the whole chain.
210+filtered by some kind of collective attacker; it could even start accepting invalid transactions. What seems implausible is destruction of all copies of the whole chain.
206211
207212When Ethereum ceases to be functional or trustworthy for any reason, a "dirty
208−escape" becomes necessary. The galaxy operators need to identify the last point
213+escape" becomes necessary. The galaxy operators need to identify the last point
209214in the Ethereum chain at which the Urbit constitution remains valid, copy that
210215data to the new primary record, and resume from there.
211216
212217But unlike other blockchains that have wrestled with human-centric governance,
213−Urbit still has a formal procedure for making this decision. With the Ethereum
218+Urbit still has a formal procedure for making this decision. With the Ethereum
214219chain compromised, we no longer have an automated system that implements the
215−rules. The rules remain, though. Humans have spent thousands of years
220+rules. The rules remain, though. Humans have spent thousands of years
216221following non-automated rules.
217222
218−Basically, we're just using ETH as a self-validating ownership record. So long
223+Basically, we're just using ETH as a self-validating ownership record. So long
219224as the chain isn't destroyed and owners retain their secrets, Urbit retains the
220225power to migrate to any record that works better.
221226
@@ -229,30 +234,30 @@ the Urbit PKI at all.
229234
230235In Urbit, if your parent galaxy is sending you fraudulent reports about the
231236blockchain (any blockchain), you have a very serious problem which goes way
232−past blockchains. It's time to switch galaxies.
237+past blockchains. It's time to switch galaxies.
233238
234239The trust relationship between an urbit and its parent is like the trust
235−relationship between you and a gas station. For all you know, what's coming
236−out of the hose could be Welch's grape juice. But why have you never, ever worried about cheap surplus vegetable products destroying your engine?
240+relationship between you and a gas station. For all you know, what's coming
241+out of the hose could be Welch's grape juice. But why have you never, ever worried about cheap surplus vegetable products destroying your engine?
237242
238−ExxonMobil has no business motivation to ruin its customers' engines. If it
239−did, it would just destroy its business, and gain… what? If you don't have an
240−attack motivation, you don't have a threat model. If you don't have a threat
241−model, you don't have a threat. This is why we don't tend to worry about
243+ExxonMobil has no business motivation to ruin its customers' engines. If it
244+did, it would just destroy its business, and gain… what? If you don't have an
245+attack motivation, you don't have a threat model. If you don't have a threat
246+model, you don't have a threat. This is why we don't tend to worry about
242247"parent attacks" in Urbit.
243248
244249But that said: there's no reason not to make Urbit's cryptographic structure as
245−strong as possible. If you don't want to trust your gas station -- you
246−shouldn't have to. We don't need to eliminate reliance on trust. We do prefer
247−to *minimize* it.
250+strong as possible. If you don't want to trust your gas station -- you
251+shouldn't have to. We don't need to eliminate reliance on trust. We do prefer
252+to _minimize_ it.
248253
249254Therefore, the Urbit Ethereum mirror needs to track all the Ethereum
250255transactions that touch the Urbit constitution, and propagate these raw
251−transactions into Urbit. Urbit nodes can check the transactions and their
252−signatures themselves, without relying on Ethereum. Then, anyone in Urbit can
256+transactions into Urbit. Urbit nodes can check the transactions and their
257+signatures themselves, without relying on Ethereum. Then, anyone in Urbit can
253258validate the Urbit PKI without an Ethereum node.
254259
255−(We don't anticipate running a node *in* Urbit, eg an EVM in Hoon -- for now,
260+(We don't anticipate running a node _in_ Urbit, eg an EVM in Hoon -- for now,
256261galaxies will just RPC to a local Unix node.)
257262
258263## And in closing
@@ -260,7 +265,7 @@ galaxies will just RPC to a local Unix node.)
260265We appreciate everyone's feedback and hope no one remains confused.
261266
262267We're happy to address any remaining concerns -- and happier still if someone
263−finds a mistake on our end. If you have a good counterargument, now is better
268+finds a mistake on our end. If you have a good counterargument, now is better
264269than later!
265270
266271Fora thread for discussion is here:
content/blog/urbit-for-normies.md+56−57
@@ -1,55 +1,55 @@
11+++
22title = "Urbit for Normies"
3−date = 2020-02-12
3+date = "2020-02-11"
44description = "A layperson’s guide to the coming new internet."
5+
56[extra]
67author = "Erik Newton"
78ship = "~patnes-rigtyn"
8−image ="https://media.urbit.org/site/posts/essays/normies-2.png"
9+image = "https://media.urbit.org/site/posts/essays/normies-2.png"
910+++
1011
1112Urbit is a challenging project to fully describe because, rather than a single product, it’s an entire system. Often when I talk about one of the individual elements of the system, someone will tell me that another company is already building that — and they’re usually right. What sets Urbit apart is that we’re building all these elements at once to work together seamlessly.
1213
13−For that reason, this overview is long. I wanted to explain, at a very high level, as much of the system as possible, to share an image of the entire forest rather than spending too much time on any of the trees.
14+For that reason, this overview is long. I wanted to explain, at a very high level, as much of the system as possible, to share an image of the entire forest rather than spending too much time on any of the trees.
1415
1516My own path to Urbit was not predictable, so it turns out I’m a useful ambassador to describe what the heck we’re doing to my fellow normies.
1617
1718I refer to myself as a normie because I’m a lawyer by training, not the typical code-savvy early Urbit adopter. I ran a law firm and, after retiring, founded a podcast and magazine about relationship dynamics. During that time I came to believe that humanity was in desperate need of better ways to relate. I didn’t know how, but I knew that my podcast about romance wasn’t going to move the needle. I began to look for a bigger project. I wanted something I truly could invest myself in; something that could have a real impact on this problem.
1819
19−That’s when a friend introduced me to Urbit. Saying it was the most credible project he’d seen in years, he described it as “an open-source decentralized internet project,” and that it “would give control of computing back to regular people.” That sparked my interest, but I didn’t totally understand it. After looking over the website and watching a couple of obscure descriptive videos on YouTube my response was threefold:
20+That’s when a friend introduced me to Urbit. Saying it was the most credible project he’d seen in years, he described it as “an open-source decentralized internet project,” and that it “would give control of computing back to regular people.” That sparked my interest, but I didn’t totally understand it. After looking over the website and watching a couple of obscure descriptive videos on YouTube my response was threefold:
2021
21−1) **This is huge** — if it actually works, it’s the future.
22−2) **This is real** — It’s got working code, dozens of engineers, and a very unorthodox solution.
23−3) **I don’t truly understand this** — I can’t read the code, and I can barely comprehend the paradigm shift.
22+1. **This is huge** — if it actually works, it’s the future.
23+2. **This is real** — It’s got working code, dozens of engineers, and a very unorthodox solution.
24+3. **I don’t truly understand this** — I can’t read the code, and I can barely comprehend the paradigm shift.
2425
2526So of course I asked for an intro.
2627
27−Fast forward: I ended up becoming COO at Tlon, the primary developer of Urbit. Urbit is exactly the sort of project I was looking for — one that represents an important promise for humanity. But, boy, did I have to fake my way through the technical elements of my new job those first few months.
28+Fast forward: I ended up becoming COO at Tlon, the primary developer of Urbit. Urbit is exactly the sort of project I was looking for — one that represents an important promise for humanity. But, boy, did I have to fake my way through the technical elements of my new job those first few months.
2829
29−What I eventually came to realize is that if Urbit is only accessible to programmers, it’s dead on arrival. In order to be useful, Urbit has to be understandable by the non-technical user. Like me. And maybe like you.
30+What I eventually came to realize is that if Urbit is only accessible to programmers, it’s dead on arrival. In order to be useful, Urbit has to be understandable by the non-technical user. Like me. And maybe like you.
3031
3132I understand as well as anyone how complicated Urbit can appear. But, fundamentally, Urbit is quite simple and it promises a critical upgrade to human interaction. That might sound like hyperbole but it’s the reason I work here. This is my attempt to explain to fellow normies the scope and scale of this world-changing project called Urbit.
3233
33−
3434## What is Urbit?
3535
3636Let’s take this one step at a time and start with the most basic definition:
3737
38−Urbit is a peer-to-peer internet being built from scratch to be more private, secure, and durable than the current internet.
38+Urbit is a peer-to-peer internet being built from scratch to be more private, secure, and durable than the current internet.
3939
4040At its most basic level, an Urbit is:
4141
42−1) A super-private computer, combined with
43−2) an ID, which is
44−3) connected peer-to-peer with other Urbit computers.
42+1. A super-private computer, combined with
43+2. an ID, which is
44+3. connected peer-to-peer with other Urbit computers.
4545
46−Taking that a half-step deeper, each Urbit user gets a permanent identity, which allows them to access their personal computer in the cloud, and then talk to directly with other Urbit computers (i.e. other people) on the network, all without using an intermediary.
46+Taking that a half-step deeper, each Urbit user gets a permanent identity, which allows them to access their personal computer in the cloud, and then talk to directly with other Urbit computers (i.e. other people) on the network, all without using an intermediary.
4747
4848When I say “computer” I’m not talking about a physical device, but rather the software that computes. Urbit is a virtual computer, not a hardware device. Today that means you can access your Urbit computer from anywhere, on just about any device with a web browser. Eventually you won’t even need the web browser.
4949
5050By “intermediary” I’m talking about all those centralized servers that we use every day to do our computing. Servers owned by Google, Facebook, YouTube, Instagram, Twitter, Slack, Amazon, Nest, Apple, and so on. All of these companies and products keep close tabs on our activity and use that information to sell us things and influence our opinions. Everything we do online is watched and recorded.
5151
52−Urbit will fundamentally change that — more about the privacy implications later.
52+Urbit will fundamentally change that — more about the privacy implications later.
5353
5454<img class="ba" src="https://media.urbit.org/site/posts/essays/normies-1.png">
5555
@@ -57,121 +57,120 @@ Urbit will fundamentally change that — more about the privacy implications lat
5757
5858Another way of explaining Urbit is to describe how it feels and looks. Visually, Urbit belongs to a genre often called “calm computing.” Urbit is designed to be simple, basic, and non-addictive. You won’t find any flashy-blinky lights here; no zany colors; no wacky branding. Just calm, functional, purpose-built tools for people to connect and work together. (One of my favorite examples of calm computing is the [light phone](https://www.thelightphone.com/).)
5959
60−Today Urbit’s interface looks like a tab in your web browser that has some limited functionality (chat, a weather app, a notebook, link sharing). Soon, you won’t even need the web browser — you’ll be able to access or run Urbit directly in its own window. Inside will be a super clean interface with all the functionality you might want from your computer, in one place and with one login (think document creation, email, social media access, accounting) — but it will run on your virtual Urbit computer, so it will be safe from corporate prying and data leaks, available on any device, and all inside one simple interface.
60+Today Urbit’s interface looks like a tab in your web browser that has some limited functionality (chat, a weather app, a notebook, link sharing). Soon, you won’t even need the web browser — you’ll be able to access or run Urbit directly in its own window. Inside will be a super clean interface with all the functionality you might want from your computer, in one place and with one login (think document creation, email, social media access, accounting) — but it will run on your virtual Urbit computer, so it will be safe from corporate prying and data leaks, available on any device, and all inside one simple interface.
6161
6262## What it’s for
6363
64−Fundamentally, Urbit is neutral open-source infrastructure, so it can be for many things. From our highest level perspective Urbit is computing for real communities and normal people, not for corporations. To make that real, Urbit focuses on delivering a computing experience that is secure, private, durable, and calm.
64+Fundamentally, Urbit is neutral open-source infrastructure, so it can be for many things. From our highest level perspective Urbit is computing for real communities and normal people, not for corporations. To make that real, Urbit focuses on delivering a computing experience that is secure, private, durable, and calm.
6565
66−For me, Urbit’s core purpose is to give us all back our privacy and our autonomy. It’s time for humanity to control its tools rather than the other way around.
66+For me, Urbit’s core purpose is to give us all back our privacy and our autonomy. It’s time for humanity to control its tools rather than the other way around.
6767
6868## Key elements
6969
70−One potential barrier to understanding Urbit is that we’re building out multiple layers of this new internet simultaneously, and each has its own explanations and value propositions. Remember, what sets Urbit apart is that we’re building of all these elements at once to work together as a system.
70+One potential barrier to understanding Urbit is that we’re building out multiple layers of this new internet simultaneously, and each has its own explanations and value propositions. Remember, what sets Urbit apart is that we’re building of all these elements at once to work together as a system.
7171
7272I’ll try to explain the most important of these without straying too deep into the technical weeds.
7373
74741. **A peer-to-peer network**
7575
76− Peer-to-peer networking is a really big deal. On the current internet, essentially all of our communications and activities go through centralized servers owned by corporations (Facebook, Google, etc.) — and those corporations can’t help but use all that information to make money. They’re capitalists, after all, and so we get constant privacy violations and interfaces built for maximum dopamine addiction.
76+ Peer-to-peer networking is a really big deal. On the current internet, essentially all of our communications and activities go through centralized servers owned by corporations (Facebook, Google, etc.) — and those corporations can’t help but use all that information to make money. They’re capitalists, after all, and so we get constant privacy violations and interfaces built for maximum dopamine addiction.
7777
78− In an Urbit world, all those communications go directly between users (i.e. peer-to-peer) with nobody in the middle. That means there’s no data capture by any megacorp, less intrusion into your life online, and communications go back to the semi-private one-to-one or small group format that is most comfortable for humans. It’s more like real life.
78+ In an Urbit world, all those communications go directly between users (i.e. peer-to-peer) with nobody in the middle. That means there’s no data capture by any megacorp, less intrusion into your life online, and communications go back to the semi-private one-to-one or small group format that is most comfortable for humans. It’s more like real life.
7979
80802. **Your own server**
8181
82− Servers are complicated. Too complicated. Have you ever tried to use a command line? Exactly. It’s a terrible way to work, and that’s just a hint at how complex servers are to operate. To hide that complexity, we let corporations run our servers for us — they can afford teams of engineers. The problem is that today most of our computing is handled by these corporate servers — and that means we’re giving up control because of complexity.
82+ Servers are complicated. Too complicated. Have you ever tried to use a command line? Exactly. It’s a terrible way to work, and that’s just a hint at how complex servers are to operate. To hide that complexity, we let corporations run our servers for us — they can afford teams of engineers. The problem is that today most of our computing is handled by these corporate servers — and that means we’re giving up control because of complexity.
8383
84− As an example, every time you use Siri, your message is sent to Apple’s servers, where it is processed, and the response is sent back to you (which is admittedly amazing). Unfortunately that’s why it never works if you’re offline, and it’s also why Apple knows what you’re saying to Siri. And this applies to all the apps we use: The actual computing happens on corporate servers. The problem is that we consumers aren’t in control and, again, the corporate entities watch, record, and gate-keep all of our activity.
84+ As an example, every time you use Siri, your message is sent to Apple’s servers, where it is processed, and the response is sent back to you (which is admittedly amazing). Unfortunately that’s why it never works if you’re offline, and it’s also why Apple knows what you’re saying to Siri. And this applies to all the apps we use: The actual computing happens on corporate servers. The problem is that we consumers aren’t in control and, again, the corporate entities watch, record, and gate-keep all of our activity.
8585
86− Fundamentally, Urbit is a super simple server. That means Urbit can run those computations and hold all that data for you, eliminating the need for a corporate intermediary.
86+ Fundamentally, Urbit is a super simple server. That means Urbit can run those computations and hold all that data for you, eliminating the need for a corporate intermediary.
8787
88883. **Permanent, personal ownership of your digital identity and all your data**
8989
90− Urbit IDs are permanently ownable — and that ownership is backed by cryptography, not some corporate database. Once you take possession of your Urbit ID, no central authority can ever take it away from you. Sure, if you start spamming people on the network, word could get around and you might get blocked by other users, but none of them can prevent you from using your ID or accessing your Urbit computer. Compare that to the current internet where Facebook owns your Facebook profile, Google owns your Gmail account, Twitter owns your Twitter handle, etc. At any time and for any reason, those services can arbitrarily shut off your access, and you have little to no recourse — all that data, all those followers, and all that reputation is wiped out instantly. Your Urbit, on the other hand — both the identity, and all the data inside your Urbit computer — is yours permanently, so long as you know your secret key.
90+ Urbit IDs are permanently ownable — and that ownership is backed by cryptography, not some corporate database. Once you take possession of your Urbit ID, no central authority can ever take it away from you. Sure, if you start spamming people on the network, word could get around and you might get blocked by other users, but none of them can prevent you from using your ID or accessing your Urbit computer. Compare that to the current internet where Facebook owns your Facebook profile, Google owns your Gmail account, Twitter owns your Twitter handle, etc. At any time and for any reason, those services can arbitrarily shut off your access, and you have little to no recourse — all that data, all those followers, and all that reputation is wiped out instantly. Your Urbit, on the other hand — both the identity, and all the data inside your Urbit computer — is yours permanently, so long as you know your secret key.
9191
92− A secure decentralized identity system like the one we’ve built leads to some very interesting use cases that are otherwise insurmountable. For example: decentralized Uber, decentralized delivery services, and a solid solution to the problem of fake reviews. To build any of these services, the problem of permanent identity needs to be solved first, and we’ve done that as part of our overall system. I’ll spend more time on use cases below.
92+ A secure decentralized identity system like the one we’ve built leads to some very interesting use cases that are otherwise insurmountable. For example: decentralized Uber, decentralized delivery services, and a solid solution to the problem of fake reviews. To build any of these services, the problem of permanent identity needs to be solved first, and we’ve done that as part of our overall system. I’ll spend more time on use cases below.
9393
94− It’s worth noting that this problem has never been solved before. All of our communication channels on the internet today rely on someone else to authenticate our identity. Urbit is — to my knowledge — the first practical application of a decentralized ID system that actually works.
94+ It’s worth noting that this problem has never been solved before. All of our communication channels on the internet today rely on someone else to authenticate our identity. Urbit is — to my knowledge — the first practical application of a decentralized ID system that actually works.
9595
96−4. **An incentive for good behavior**
96+4. **An incentive for good behavior**
9797
98− On the Urbit network, identities are finite, and they accrue reputation. Compare that to the current internet where identity is infinite (anyone can create as many email addresses or social media profiles as they want, essentially for free) and so spam, scams, and DoS attacks (“denial-of-service”: when many disposable identities ‘attack’ a server at the same time) are rampant. On the Urbit network, there are just over 4 billion total IDs (2<sup>32</sup> to be exact). Scarcity creates value. That scarcity, combined with reputation accrual, means there's an incentive for good behavior.
98+ On the Urbit network, identities are finite, and they accrue reputation. Compare that to the current internet where identity is infinite (anyone can create as many email addresses or social media profiles as they want, essentially for free) and so spam, scams, and DoS attacks (“denial-of-service”: when many disposable identities ‘attack’ a server at the same time) are rampant. On the Urbit network, there are just over 4 billion total IDs (2<sup>32</sup> to be exact). Scarcity creates value. That scarcity, combined with reputation accrual, means there's an incentive for good behavior.
9999
100− You might think 4 billion IDs sounds like too few given how many humans we have on the planet. I won’t go into the technical details here, but if we ever get to the point where that’s a problem (which would be a great problem to have), we’ve outlined several solutions that allow everyone alive to get on the network. We don’t intend to lock anyone out.
100+ You might think 4 billion IDs sounds like too few given how many humans we have on the planet. I won’t go into the technical details here, but if we ever get to the point where that’s a problem (which would be a great problem to have), we’ve outlined several solutions that allow everyone alive to get on the network. We don’t intend to lock anyone out.
101101
1021025. **Tools anyone can learn and use**
103103
104− Urbit is a system that anyone with patience can understand completely from top to bottom, from the integers of byte code to the complete OS and everything in between. Urbit in its entirety is just over 50,000 lines of code. That is tiny. Compare that to Linux (the open-source OS that most modern computing is built upon), which is tens of millions of lines of code, and you start to see how important this is for efficiency. Apple’s and Windows’ codebases are similarly massive. In our current computing system, nobody can understand the entire thing completely, and that means there are innumerable security holes. With Urbit, while it may demand something of you, any reasonably intelligent developer can grasp the whole thing. We’ve worked very hard to keep our system simple at each level. That makes it more efficient, more durable, and much more secure.
104+ Urbit is a system that anyone with patience can understand completely from top to bottom, from the integers of byte code to the complete OS and everything in between. Urbit in its entirety is just over 50,000 lines of code. That is tiny. Compare that to Linux (the open-source OS that most modern computing is built upon), which is tens of millions of lines of code, and you start to see how important this is for efficiency. Apple’s and Windows’ codebases are similarly massive. In our current computing system, nobody can understand the entire thing completely, and that means there are innumerable security holes. With Urbit, while it may demand something of you, any reasonably intelligent developer can grasp the whole thing. We’ve worked very hard to keep our system simple at each level. That makes it more efficient, more durable, and much more secure.
105105
1061066. **Lessons from the last half century**
107107
108− Bear with me — this is where some jargon kicks in. In many ways, Urbit is an attempt to apply lessons learned from the failures of 20th century computer development. From an engineer’s perspective, Urbit solves a series of problems that we end users rarely notice, but which cause extraordinary amounts of complexity and waste. The list of applied lessons is long, but rather than bullet them all, I’ll explain the one that surprised me the most.
108+ Bear with me — this is where some jargon kicks in. In many ways, Urbit is an attempt to apply lessons learned from the failures of 20th century computer development. From an engineer’s perspective, Urbit solves a series of problems that we end users rarely notice, but which cause extraordinary amounts of complexity and waste. The list of applied lessons is long, but rather than bullet them all, I’ll explain the one that surprised me the most.
109109
110− Urbit is deterministic. That is, a given sequence of inputs always produces the same output. When I first heard that, I thought, “Wait, isn’t that what all operating systems do? Give you the same result every time?” Weirdly, the answer is no. Normal operating systems don’t work this way. Normal modern operating systems actually get varying results when they compute things. This is a deep problem that causes programmers countless hours of frustration. The most common implication of this that you’ve probably experienced is having to reboot your computer — either because it’s locked up, or because it simply won’t do something that it was totally doing a second ago. What’s annoying to a regular user, though, is absolutely crazy-making to developers.
110+ Urbit is deterministic. That is, a given sequence of inputs always produces the same output. When I first heard that, I thought, “Wait, isn’t that what all operating systems do? Give you the same result every time?” Weirdly, the answer is no. Normal operating systems don’t work this way. Normal modern operating systems actually get varying results when they compute things. This is a deep problem that causes programmers countless hours of frustration. The most common implication of this that you’ve probably experienced is having to reboot your computer — either because it’s locked up, or because it simply won’t do something that it was totally doing a second ago. What’s annoying to a regular user, though, is absolutely crazy-making to developers.
111111
112− This determinism makes programming on an Urbit immensely more efficient than other environments.
112+ This determinism makes programming on an Urbit immensely more efficient than other environments.
113+
114+ Urbit applies this and a whole list of other lessons from the past half-century of systems software to increase reliability and security in everything from file storage to networking to user-facing apps. All this adds up to more security and reliability and less service-lock-in with Urbit than with our current systems.
113115
114− Urbit applies this and a whole list of other lessons from the past half-century of systems software to increase reliability and security in everything from file storage to networking to user-facing apps. All this adds up to more security and reliability and less service-lock-in with Urbit than with our current systems.
115−
1161167. **Private, human-sized, and efficient**
117117
118− Because Urbit isn’t centralized or owned by any one company, there’s no incentive for it to dominate your life. Your Urbit isn’t designed to spy on you, get you addicted to clicking its buttons, manipulate your emotions to gain attention, or nudge you to buy something. Your Urbit is a simple, customizable, permanent place for you to do all your computer-based tasks with your friends in absolute privacy.
118+ Because Urbit isn’t centralized or owned by any one company, there’s no incentive for it to dominate your life. Your Urbit isn’t designed to spy on you, get you addicted to clicking its buttons, manipulate your emotions to gain attention, or nudge you to buy something. Your Urbit is a simple, customizable, permanent place for you to do all your computer-based tasks with your friends in absolute privacy.
119119
120− This is so much the case, in fact, that it presents a bit of a problem for Tlon. We don’t know how many people use Urbit every day, who they talk to, or what they’re doing. While we think this is how things should be, it puts us in a bind when a VC wants to know about our user base; we can only make educated guesses. That said, we think this is the right problem to have.
120+ This is so much the case, in fact, that it presents a bit of a problem for Tlon. We don’t know how many people use Urbit every day, who they talk to, or what they’re doing. While we think this is how things should be, it puts us in a bind when a VC wants to know about our user base; we can only make educated guesses. That said, we think this is the right problem to have.
121121
122− What all this adds up to is that the Urbit network is immensely more resource efficient, secure, easier to customize, and smaller in size than any other computing system in the world. If you care about data security, privacy, durability, or even just elegance, Urbit has the best design going.
122+ What all this adds up to is that the Urbit network is immensely more resource efficient, secure, easier to customize, and smaller in size than any other computing system in the world. If you care about data security, privacy, durability, or even just elegance, Urbit has the best design going.
123123
124− <br></br>
124+ <br></br>
125125
126126<img class="ba" src="https://media.urbit.org/site/posts/essays/normies-2.png">
127127
128128## How it compares
129129
130−A final way to understand Urbit is to make comparisons between Urbit and current products we use today. This is limited, because ultimately Urbit will grow in directions we can’t predict, but comparisons are a useful starting place.
130+A final way to understand Urbit is to make comparisons between Urbit and current products we use today. This is limited, because ultimately Urbit will grow in directions we can’t predict, but comparisons are a useful starting place.
131131
132132Again, on the current internet, we all access megacorp software using our web browsers and app interfaces. This means that we each exist as a line in a megacorp database, and those megacorps use that data to make money, which results in rampant privacy violations and addictive interfaces. Urbit is the alternative to all that: it’s decentralized, private, and secure. And it’s yours.
133133
134−Let’s get to some real-world examples.
135−
134+Let’s get to some real-world examples.
136135
137136## Urbit vs. Reddit
138137
139−Imagine you’d like to discuss a certain research topic with a group of friends. Say, Canadian small cap equities or the best cookie recipes. You’ll need a chat interface for live discussion, a notebook to record concepts, and a way to share links for discussion. You can do this in the default web if you want: use Reddit for the links (but make sure it’s a private group), use Google Docs for the notebook (but make sure everyone has Gmail), and use iMessage for the chat (but everyone needs a Mac). And don’t forget, each service has their own login and security holes, and they’re all mining your data.
138+Imagine you’d like to discuss a certain research topic with a group of friends. Say, Canadian small cap equities or the best cookie recipes. You’ll need a chat interface for live discussion, a notebook to record concepts, and a way to share links for discussion. You can do this in the default web if you want: use Reddit for the links (but make sure it’s a private group), use Google Docs for the notebook (but make sure everyone has Gmail), and use iMessage for the chat (but everyone needs a Mac). And don’t forget, each service has their own login and security holes, and they’re all mining your data.
140139
141−The alternative is spin up a group on Urbit. All of that functionality is available today in one clean, simple interface. It’s private, you own the data, there’s only one login, and you can even learn to build apps for your group.
140+The alternative is spin up a group on Urbit. All of that functionality is available today in one clean, simple interface. It’s private, you own the data, there’s only one login, and you can even learn to build apps for your group.
142141
143142## Urbit vs. Facebook, Twitter, etc.
144143
145−Or let’s say you want to share pictures with your friends, post micro-messages to the world, write a blog, or share a podcast. There’s simply no reason you should use some centralized company (one that then owns your content) to broadcast any of those things. Instead, send it out from your Urbit. You’ll own the content, you’ll control the data, no company will spy on you, and nobody can ever take your ID from you. With Urbit we all finally own the tools, and that means we own the data by default.
144+Or let’s say you want to share pictures with your friends, post micro-messages to the world, write a blog, or share a podcast. There’s simply no reason you should use some centralized company (one that then owns your content) to broadcast any of those things. Instead, send it out from your Urbit. You’ll own the content, you’ll control the data, no company will spy on you, and nobody can ever take your ID from you. With Urbit we all finally own the tools, and that means we own the data by default.
146145
147146## Urbit vs. Nest
148147
149−Imagine, as I do, that you want a connected video camera in your house, but don’t want the Nest corporation (which is now owned by Google) to be able to spy on you. Or perhaps you just don’t want to have to sign up for yet another duplicative service in order to use the camera you just bought. If any of that is the case, you can run your camera through your Urbit instead. The video feed will never leave your control, because it no longer has to live on Nest’s servers. Your camera will talk over a secure channel only to your Urbit. Your Urbit is the server.
148+Imagine, as I do, that you want a connected video camera in your house, but don’t want the Nest corporation (which is now owned by Google) to be able to spy on you. Or perhaps you just don’t want to have to sign up for yet another duplicative service in order to use the camera you just bought. If any of that is the case, you can run your camera through your Urbit instead. The video feed will never leave your control, because it no longer has to live on Nest’s servers. Your camera will talk over a secure channel only to your Urbit. Your Urbit is the server.
150149
151−You can apply this same concept to smart speakers, a Ring doorbell, connected baby monitor, smart fridge, or any of the innumerable connected devices that give someone else access to your personal life. Why should anyone else have access to that information?
150+You can apply this same concept to smart speakers, a Ring doorbell, connected baby monitor, smart fridge, or any of the innumerable connected devices that give someone else access to your personal life. Why should anyone else have access to that information?
152151
153152## Urbit vs. Google Docs
154153
155−Imagine you want to write a screenplay with a small group of friends, but you don’t want Google mining the content of your shared doc for advertising keywords, and you won’t want to use multiple services for chat, document sharing, email, etc. In that case, simply create an Urbit group with your friends and write together using Urbit’s writing tools. Your content will stay completely private to the team until you decide to release it to the world, and you’ll communicate using one simple interface. Even better, the archive of your multimodal work lives in one place, so looking back at your process doesn’t require reconstructing it from dozens of different apps. And everything is stored on your respective Urbit computers, not Google’s servers.
154+Imagine you want to write a screenplay with a small group of friends, but you don’t want Google mining the content of your shared doc for advertising keywords, and you won’t want to use multiple services for chat, document sharing, email, etc. In that case, simply create an Urbit group with your friends and write together using Urbit’s writing tools. Your content will stay completely private to the team until you decide to release it to the world, and you’ll communicate using one simple interface. Even better, the archive of your multimodal work lives in one place, so looking back at your process doesn’t require reconstructing it from dozens of different apps. And everything is stored on your respective Urbit computers, not Google’s servers.
156155
157156## Urbit for your protected health information
158157
159−Imagine, as is already becoming the case, that it becomes highly valuable to have your genome sequenced in order to make good healthcare decisions. In that scenario, most of us would want our health care providers to be able to make precise assessments of parts of our genome, but we wouldn’t want insurance companies or other third parties to have access without our permission. In the current paradigm, once you share the information, it’s out there and can be leaked or sold. So much so that we all sort of assume that leaks are the default. In the Urbit paradigm, that information lives on your Urbit computer and nowhere else, and any software necessary to process it can be run on your Urbit as well. In other words, there’s never any need to share the raw data with anyone; instead, you can download a small program, run it on your Urbit, and share the final analyses only without ever exposing your data.
158+Imagine, as is already becoming the case, that it becomes highly valuable to have your genome sequenced in order to make good healthcare decisions. In that scenario, most of us would want our health care providers to be able to make precise assessments of parts of our genome, but we wouldn’t want insurance companies or other third parties to have access without our permission. In the current paradigm, once you share the information, it’s out there and can be leaked or sold. So much so that we all sort of assume that leaks are the default. In the Urbit paradigm, that information lives on your Urbit computer and nowhere else, and any software necessary to process it can be run on your Urbit as well. In other words, there’s never any need to share the raw data with anyone; instead, you can download a small program, run it on your Urbit, and share the final analyses only without ever exposing your data.
160159
161−Some of these cases are, admittedly, a bit speculative since we haven’t built all the functionality yet. But it’s coming, and quite soon.
160+Some of these cases are, admittedly, a bit speculative since we haven’t built all the functionality yet. But it’s coming, and quite soon.
162161
163162For now, if you like the way this sounds you can [get yourself an Urbit ID](https://urbit.org/getting-started/#id) and start learning about how to safely store cryptographic keys (it’s really not that hard, and we give you suggestions). If you’re feeling technical or adventurous, you can try booting our beta OS interface to see what it looks like. It’s fussy, but it exists. Soon it will be less fussy. You can check out our [roadmap](https://urbit.org/understanding-urbit/roadmap/) if you’d like to know when.
164163
165164## Why we need Urbit
166165
167−We humans haven’t evolved enough to manage the firehose of information that modern technology blasts us with. There’s too much news, too many connections, too many opinions, and more agendas out there than any of us can mindfully comprehend. We’re designed for much smaller communities, one-to-one connections, and slower idea assimilation than our modern infrastructure allows. The pace of change is increasing, and we don’t know how to manage it.
166+We humans haven’t evolved enough to manage the firehose of information that modern technology blasts us with. There’s too much news, too many connections, too many opinions, and more agendas out there than any of us can mindfully comprehend. We’re designed for much smaller communities, one-to-one connections, and slower idea assimilation than our modern infrastructure allows. The pace of change is increasing, and we don’t know how to manage it.
168167
169−We’re scared, and to manage that fear we’re becoming more insular, more entrenched. Layer on top of all that the incentives that big business and big politics have to manipulate our emotions, and we’re headed in a very dangerous direction.
168+We’re scared, and to manage that fear we’re becoming more insular, more entrenched. Layer on top of all that the incentives that big business and big politics have to manipulate our emotions, and we’re headed in a very dangerous direction.
170169
171−We can’t turn back the technological clock; humanity can only ever press onward. This is where Urbit comes in. Urbit is a forward-looking solution to this particular set of problems around human-scale computing and personal autonomy. Urbit provides a means by which groups can live peacefully in parallel.
170+We can’t turn back the technological clock; humanity can only ever press onward. This is where Urbit comes in. Urbit is a forward-looking solution to this particular set of problems around human-scale computing and personal autonomy. Urbit provides a means by which groups can live peacefully in parallel.
172171
173−Urbit is a computing environment that allows humans to do everything they want on computers, but in communities of their choosing, in a way that feels direct and natural, and in a way that allows true personal freedom. Urbit is calm, secure, and private in its most fundamental architecture. No spying corporations. No manipulative politicians.
172+Urbit is a computing environment that allows humans to do everything they want on computers, but in communities of their choosing, in a way that feels direct and natural, and in a way that allows true personal freedom. Urbit is calm, secure, and private in its most fundamental architecture. No spying corporations. No manipulative politicians.
174173
175−And that is what we need. Humans need a way to at once take advantage of our vast technological advances but not be dominated by them. Urbit is an open-source tool that we all own, that anyone can understand down to its roots, that’s fully under its user’s control. It is human-scale computing for human-scale communities. Simple, durable, yours.
174+And that is what we need. Humans need a way to at once take advantage of our vast technological advances but not be dominated by them. Urbit is an open-source tool that we all own, that anyone can understand down to its roots, that’s fully under its user’s control. It is human-scale computing for human-scale communities. Simple, durable, yours.
176175
177176For me, this first iteration of Urbit is more than enough, and it’s exactly the sort of peaceful future I want to work towards.
content/blog/urbit-grants-and-mid-2019-gifts.md+9−4
@@ -1,11 +1,16 @@
11+++
22title = "Urbit Grants and mid-2019 Gifts"
3−date = 2019-06-10
3+date = "2019-06-09"
44description = "Announcing an upcoming Urbit grants program and star gifts for Mid-2019."
5−aliases = ["/posts/essays/urbit-grants-and-mid-2019-gifts", "/posts/urbit-grants-and-mid-2019-gifts"]
5+aliases = [
6+ "/posts/essays/urbit-grants-and-mid-2019-gifts",
7+ "/posts/urbit-grants-and-mid-2019-gifts"
8+]
9+
610[taxonomies]
7−grant_type = ["Gift"]
8−grant_category = []
11+grant_type = [ "Gift" ]
12+grant_category = [ ]
13+
914[extra]
1015author = "Galen Wolfe-Pauly + Alex Matzner"
1116ship = "~ravmel-ropdyl + ~mignyt-mogseb"
content/blog/urbit-is-for-communities.md+3−6
@@ -1,11 +1,12 @@
11+++
22title = "Urbit is for Communities"
3−date = 2020-03-23
3+date = "2020-03-22"
44description = "Urbit is for giving communities the tools to shape their own environments; for us all to feel a sense of life and self-directedness in the digital world."
5+
56[extra]
67author = "Galen Wolfe-Pauly"
78ship = "~ravmel-ropdyl"
8−image ="https://media.urbit.org/site/posts/essays/urbit-is-for-communities.jpg"
9+image = "https://media.urbit.org/site/posts/essays/urbit-is-for-communities.jpg"
910+++
1011
1112<br>
@@ -34,7 +35,6 @@ We don’t often talk about it explicitly, but this is what Urbit is for. Urbit
3435
3536It’s not any single specific technical feature of Urbit that makes it well-suited for communities to homestead and develop. It’s the combination of the technology under the hood and the interfaces we build on top. Let’s talk about both.
3637
37−
3838## Technically capable
3939
4040I love [this tweet](https://twitter.com/devonzuegel/status/1221804267083718656) about becoming a ‘digital prepper’. It feels like it has already happened to me, too. I’ve seen enough centralized services shut down and disappear (often with my data) that I’m reluctant to try new ones. No matter how friendly and cozy their branding.
@@ -57,7 +57,6 @@ That means we have to solve the problems inherent to the legacy internet. There
5757
5858But even with a system that fixes all of these issues by default, it only matters if the system is usable and understandable. What we really want is a digital world that’s generated by the communities that inhabit it — which means it has to be generated by people with no technical knowledge.
5959
60−
6160## Communities are built by people
6261
6362In the physical world, you can arrange the furniture in your house, or go to Ikea, or build your own furniture, or figure out how to build a house from scratch. By taking your preferred approach to design, you contribute to the shape of your city. The world around us is a wonderfully loose collaboration between the more technically oriented architects and planners, and the everyday homeowners and residents.
@@ -70,7 +69,6 @@ For most people, customizing your Urbit should be a matter of picking from an av
7069
7170We’re not quite to this level of sophistication, but we’re on the path. Let’s talk about where we are and where we’re going.
7271
73−
7472## OS 1
7573
7674Our rough attempt to satisfy this goal is hovering on the horizon. We call it OS 1.
@@ -85,7 +83,6 @@ Currently, our Ikea experience is pretty limited, there are only a few Legos to
8583
8684The system is ripe for experimentation, customization, and exploration. It’s ready for earnest homesteading. Come build.
8785
88−
8986## → N
9087
9188OS 1 is really just the beginning. There are so many more modules and means of communicating and collaborating to add. There is so much we can do to make the system more customizable.
content/blog/urbithost-interview.mdnew file+116
@@ -0,0 +1,116 @@
1++++
2+title = "An Interview with UrbitHost"
3+date = "2021-08-19"
4+description = "Interview with the founder of UrbitHost ~lavlyn-litmeg"
5+[extra]
6+author = "Matt"
7+ship = "~tirwyd-sarmes"
8+image = "https://media.urbit.org/site/posts/essays/nasa-star-cluster.jpg"
9++++
10+
11+![](https://media.urbit.org/site/posts/essays/nasa-star-cluster.jpg)
12+
13+**An Interview with UrbitHost**
14+
15+Urbit has been making great strides to become accessible to those who are non-technical. Port enables a user to launch their Urbit ID from their personal computer without any knowledge of the command line. However, you only have access while you are running Port, which means you can&#39;t do things like check your DMs while on the move.
16+
17+Hosting your Urbit means that your Urbit is always on and available. All that is required to access the network is visiting a URL and logging in.That means you can access Urbit from your phone, laptop, or any device with a browser.
18+
19+The downside is that running your own server can be a complex and difficult process. Third-party hosting allows an expert to do that work for you. The hosting provider gets paid, and you get 24/7 access to your ship.
20+
21+[UrbitHost](https://urbithost.com) is one of the latest [hosting providers](https://subject.network/planet-sales/) to enter the market. As of now, it is one of the fastest and easiest ways onto the network. You pay the fee, and you get sent a link that you use to access Landscape. It&#39;s that easy.
22+
23+At least, it&#39;s that easy for the end user. For the guy running the operations, ~lavlyn-litmeg, it can be quite a complex operation. I sat down with him to find out about what it&#39;s like being a commercial developer on Urbit. We also talked about technology, the developer ecosystem, and the future of Urbit.
24+
25+If you want to get in touch you can reach him at ~lavlyn-litmeg, the ~sardys/uh group, or [urbithost.com](https://urbithost.com).
26+
27+---
28+
29+**Tell us a bit about yourself and your history with Urbit?**
30+
31+I&#39;m a software engineer who is currently working at one of the larger crypto currency companies. My history with Urbit goes back quite a long time. I saw one of those early demos by Curtis where he had two dojos running, sending messages back and forth, and I thought it looked interesting. Since then, I often checked in on the project, but I stayed at the sidelines because it felt not quite ready; there were constant breaches and so on. What kept me close by was that I believed in the vision of Urbit.
32+
33+I think the open internet only has a future if people retain control of their digital identities, which means that, in addition to a cryptographic identity, they need to be able to keep control over their data. This not only includes their social graph, but they also must be able to run computations on that data. Urbit checks all those boxes. The people behind Urbit and all the other contributors have been steadily marching towards these goals with incredible stamina. I&#39;m inspired by that. And, since the release of OS1, Urbit is very much usable, and I find myself spending more and more time on it instead of other corners of the internet.
34+
35+**Why did you decide to work on hosting rather than another Urbit project? If you weren&#39;t working on UrbitHost what would you be working on within the Urbit ecosystem?**
36+
37+I want my non-tech friends to be able to join Urbit. Most people I know can&#39;t be bothered with executing a blockchain transaction, many feel uncomfortable installing an app they don&#39;t understand, and almost all would shy away from the command line. For the vast majority of people, getting onto Urbit must be as easy as signing up for Gmail or Twitter, otherwise they won&#39;t come.
38+
39+I thought about how I could contribute to Urbit and decided that now is a good time to build a hosting provider. It&#39;s still early, but a non-technical person can actually spend time on the network and be productive. I think we are just now seeing a shift where we need community builders as much as we need engineers working on the internals of Urbit. It is important that those community builders have no barrier to entry for themselves or their communities.
40+
41+That is why ease of access has been my goal from the beginning. I wanted the site to be fully automated, meaning someone could sign up and be on Urbit within minutes. It was also important to me that users be able to choose their own Urbit ID. As far as I know, there was no offering like that yet, so I decided to build it—but I know that others are working on this too.
42+
43+If I was working on something else, it would be Urbit apps. We&#39;re waiting for the new release for it to be easier to distribute and access apps; there are a few tools I would really like to see. But other than that, I would like to spend more time community building.
44+
45+**Can you tell us about how you&#39;re implementing UrbitHost? You beat Tlon to the punch of having immediate hosted access to the Urbit network -- what&#39;re you doing differently? How will your implementation change when programmatic access becomes available via Khan (the new vane to replace Herb)?**
46+
47+UrbitHost runs on Kubernetes, which is a tool to orchestrate containers. What that means, concretely, is that each ship runs inside a Docker container, and Kubernetes makes sure that each container is running and has enough resources. For example, if a server goes down, Kubernetes will automatically move the ships that were on that server to a new server that is available. No data is lost and there should be very little down-time.
48+
49+People think Kubernetes should only be used for services that can be scaled horizontally, meaning there are multiple instances running of the same services. Scaling like this is obviously not an option for Urbit, because a ship must only run as a single instance. But in the last few years, Kubernetes has added many features to run single and stable instances of a container, for example a database. UrbitHost is making use of these features—permanent volumes, stateful sets, and so on—to provide a high-availability hosting for Urbit. It also scales well. I surmise, we could host thousands of ships, we would only have to add compute nodes.
50+
51+As for beating Tlon, I&#39;m not sure if it is a fair comparison. UrbitHost, as it is currently, is a minimal viable product. I tried to realize a simple goal: automated hosting. Tlon is hosting many more planets, not to speak of all the stars and galaxies that make up the network. As far as I can tell, Tlon and UrbitHost are doing things quite similarly. For example, I knew that Tlon is also hosting on Kubernetes, which gave me much more confidence that we could do it too.
52+
53+UrbitHost&#39;s programmatic interaction with hosted ships is quite minimal once it is booted. We use airlock to retrieve the access code and do a few more maintenance things, and we are using it for some upcoming features like automatic S3 configuration. But from what I can tell, Khan looks like a really important step forward, because interacting with the hosted ships via airlock is one of the most brittle areas, and I&#39;m looking forward to making it more robust once Khan is out.
54+
55+**What is most needed within the Urbit ecosystem — any particular apps or services? Which projects are you most excited about?**
56+
57+The ability to publish content directly from a planet to the regular internet would be cool. I would really love to see some bigger blogs being hosted on Urbit. The basic idea would be this: everyone can read the blog, but to join the conversation one would have to join Urbit and the group associated with that blog. Of course, a planet could publish other content too, possibly a mix of free and premium content. Either way, it would pull a lot of people into the gravity well of Urbit.
58+
59+Publishing could also be a good value proposition for Urbit hosting providers. If public content is hosted on a ship, then all the profit from new customers who are brought to the provider could somehow be split between the host and content producer. What is nice, though, is that a content producer can take his Urbit-native community anywhere, anytime, without disrupting the community much. The portability of Urbit at every level would really shine here as communities grow.
60+
61+There are incredible projects happening on every front. The Bitcoin integration is very exciting, it is being realized in a truly Urbit-native way and could prove to be a great catalyst for the ecosystem. However, as a hosting provider, the constant lower-level improvements are exciting too.
62+
63+**What will be the effect of two upcoming changes to Urbit:**
64+
65+1. **Built in software distribution and management**
66+2. **Layer 2 and the new &quot;Khan&quot; vane**
67+
68+**For #1, how would you pitch developers on the benefits of building on Urbit?**
69+
70+**With regard to #2, I think there is about to be an explosion of hosting providers. Will this unleash an Eternal September effect or does Urbit&#39;s &quot;walled garden&quot; style of communication make it more resilient? Urbit is not a single silo like Facebook, after all.**
71+
72+I think that once software distribution is as simple and easy as the iOS app store it will be a watershed moment for Urbit. Put bluntly, it will give users something to do on Urbit besides chat. There are several interesting apps out there already, but they are not easy to discover and install.
73+
74+Developers want reach. The most important pitch to developers will be that on Urbit they have access to a substantial audience. I remember developing for the iPhone in the early days. Objective-C was really a tough pill to swallow, but because the platform was interesting and promised to reach a large audience, I kept going with it. I think Urbit is an interesting platform for the various reasons already mentioned. But learning to develop for Urbit is really a time investment—I myself am still a novice Hoon developer —and for it to be worth it, there has to be a clear pay-off. For some, this is making system-level contributions, but for most it will be having that app show up in some centrally visible place and seeing people engage with it. Once this exists, it will be much easier to pitch Urbit to developers.
75+
76+The layer 2 solution which will make spawning planets much cheaper is an important next step, especially for hosting providers. Layer 2 will help us immensely because spawning and keying planets is very expensive right now, and it puts a damper on how much we are actively pursuing growth.
77+
78+If new hosting providers come online, it will not necessarily mean a huge influx of users. In my experience, building a provider is hard and takes time to mature. However, I would love to see fast user growth.
79+
80+I honestly don&#39;t think having our own Urbit Eternal September would be that bad. I would just see it as growing pains. If we enter a time of sustained growth and rapid user onboarding, the fact that some Urbit groups will get overwhelmed with all the new people will be a small price to pay. The current setup, with a few central groups that act like hubs and discovery points—for example, the fantastic Urbit Index—would have to change. People would need to be funneled into their own Urbit universes that might not overlap much with other areas on Urbit. The nice thing is that all this is accounted for in the Urbit infrastructure.
81+
82+If a certain hosting provider ends up bringing thousands upon thousands of users to Urbit, like AOL did back then with Usenet, then it will be the provider&#39;s responsibility to onboard those users sensibly and not just dump them on the existing groups. In other words, providers, in my opinion, also have a community building responsibility. Of course, this does not mean that providers should be overbearing parents, allowing only this or that, but simply that they should have sensible defaults that don&#39;t overwhelm or destroy the network.
83+
84+**What is the role of commercial providers in the open-source ecosystem?**
85+
86+Commercial providers will be incredibly important to make Urbit succeed. I think if Urbit attracts a large number of users, many, if not most, will run their ship via a hosting provider. It is the easiest way to get started.
87+
88+However, using a hosting provider to get onto Urbit might at first seem antithetical to the spirit of the project. If someone is trying to get away from mega-corporations, why would they go right back to another company and give them their data?
89+
90+Well, because it&#39;s a completely different relationship. The relationship between us, the provider, and you, the customer, is transparently straight forward. You are not the product. We have a more traditional provider-customer relationship where we just do the dev ops work. It is in our interest to keep your data private and keep your ship running. We give you an Urbit ID, which you can keep forever, and host your ship as long as you wish. When you want to leave, you can download your pier and Urbit ID and use it with a different provider or on your own computer in minutes. On the other hand, you cannot leave Facebook and run your profile off of your laptop. Basically, we cannot count on customer lock-in, we must provide good and honest service. Again, the portability promise of Urbit is essential here and ensures that we are on an equal footing.
91+
92+**Once the Urbit payment ecosystem gets built out more, would you consider accepting payments over the Urbit network?**
93+
94+Of course. Having an Urbit-native economy would be a key marker of success, and I would love to participate in it. Moreover, we are planning to offer a Bitcoin node to our customers soon.
95+
96+**Are you coming to Assembly 2021?**
97+
98+Yes. At least, I&#39;m planning to! I would love to meet all the people behind Urbit in real life.
99+
100+**I know you are a Christopher Alexander fan, how has he influenced your work?**
101+
102+I&#39;ve been interested in Christopher Alexander for quite a long time. When I realized that many of the people building Urbit are also inspired by him, I understood why much of the Urbit vibe resonated with me. Critics of Urbit either focus on the technical details or on Curtis Yarvin&#39;s writings, sometimes conflating the two. That&#39;s fine and perhaps a valid point to start, but what they don&#39;t understand is that so many other ideas and ideals have since become driving forces behind the project. This is at least what I observe as an outsider.
103+
104+Alexander&#39;s ideas are all about how to build beautiful houses. He wants us to inhabit places that feel life-giving, places that make us more fully human. The same should be asked of the technology we use. So much of the current internet is the equivalent of a fluorescent-lit cubicle, a brutalist government building, or a flashy central square. It might be interesting to travel through these places, but they do not make good homes.
105+
106+To explore what makes a building beautiful, Alexander had to wade into metaphysics, because he wanted to give a much more objective account of how beauty is present in physical artifacts, which led him to treat beauty as a universal. I think to build more meaningful technology we need to do the same. We do not have a good metaphysics of technology, and this is something I&#39;m really interested in.
107+
108+**Give me a brief summary about your personal philosophy of technology. Do all tools fall under the umbrella of &quot;technology&quot;? Or do some tools hit an inflection point where they acquire radically different characteristics (compare a shovel and a computer)? It seems to me that the philosophy of technology often boils down to trying to define what &quot;technology&quot; actually is. What do you make of all this?**
109+
110+Yeah, I definitely think there is an inflection point once technology becomes digital, but I believe there is something all technology has in common. My approach here is classical. Artifacts have to be distinguished from living things because human made things have their origin outside themselves, meaning they are manufactured (in Aristotelian terms, and stated somewhat simplistically, artifacts have an efficient cause outside themselves, whereas biological things have an innate efficient cause). We are often tempted to think of living organisms simply as elaborate self-replicating machines, but that is putting the cart before the horse. We should rather look to the world of living things to be inspired to build our artifacts.
111+
112+The question of inspiration becomes even more pressing when discussing modern technology, and you put your finger on it with the inflection point. There is no tradition to fall back on when we are building digital technologies. Someone like Christopher Alexander, who is working on architecture, has thousands of years of architecture to look at. He can read the past and see what worked and what did not. On the other hand, when we build things like Urbit, we must look for inspiration in other places because there is no corpus of, say, thousands of years of constructing digital social networks where we can simply choose the best parts. So far, we have mostly bad examples, how not to do it. And considering how new the internet is, most of it is still a blank slate. So while I&#39;m definitely interested in the ontology of technology, I think it is an even more pressing question to learn the principles of the living world around us in order to build digital places that feel organic and life-giving.
113+
114+**Thanks for chatting!**
115+
116+See you on the network!
content/blog/value-of-address-space-pt1.md+7−10
@@ -1,20 +1,17 @@
11+++
22title = "The Value of Urbit Address Space (1 of 3)"
3−date = 2020-04-07
3+date = "2020-04-06"
44description = "An expansion of our position on Urbit's address space value."
5+
56[extra]
67author = "Erik Newton + Galen Wolfe-Pauly"
78ship = "~patnes-rigtyn + ~ravmel-ropdyl"
8−image ="https://media.urbit.org/site/posts/essays/value-of-address-space-pt1.jpg"
9+image = "https://media.urbit.org/site/posts/essays/value-of-address-space-pt1.jpg"
910+++
1011
11−<br>
12−
13−<img class="ba" src="https://media.urbit.org/site/posts/essays/value-of-address-space-pt1.jpg">
14−
15−<br>
12+![](https://media.urbit.org/site/posts/essays/value-of-address-space-pt1.jpg)
1613
17−*This is the first in a series of three posts on Urbit address space. See also [part 2](https://urbit.org/blog/value-of-address-space-pt2/) and [part 3](https://urbit.org/blog/value-of-address-space-pt3/).*
14+_This is the first in a series of three posts on Urbit address space. See also [part 2](https://urbit.org/blog/value-of-address-space-pt2/) and [part 3](https://urbit.org/blog/value-of-address-space-pt3/)._
1815
1916## Part One – What/why, a history, and some analogies
2017
@@ -84,7 +81,7 @@ So how did these ~4B names get initialized and distributed? Urbit address space
8481
8582Now that the system is up and running, Urbit address space has steadily become more distributed. This arguably follows the distribution patterns of the Bitcoin UTXO set, and even historical distribution patterns of physical land.
8683
87−Let’s take a look at how this came to be.
84+Let’s take a look at how this came to be.
8885
8986Urbit was originally an experimental personal project. The original Urbit address space registry was just a text file in the source code at that time. At the very beginning, all of the address space was owned by Curtis — its creator — and it was all pretty much worthless. In the years leading up to 2013, Curtis gave away galaxies to anyone who would help or contribute to the project, and to several people who were simply in the right place at the right time.
9087
@@ -96,7 +93,7 @@ It was then decided that a public key infrastructure was the most logical way to
9693
9794## Analogues and the intrinsic value of address space
9895
99−We’ve often said that Urbit address space, particularly stars and galaxies, have intrinsic value that should be understood beyond simply the price of the planets they contain. Another way of putting this is that, because stars and galaxies are infrastructure nodes, they’re uniquely positioned to generate cash flow from activities on the network beyond simply selling their planets.
96+We’ve often said that Urbit address space, particularly stars and galaxies, have intrinsic value that should be understood beyond simply the price of the planets they contain. Another way of putting this is that, because stars and galaxies are infrastructure nodes, they’re uniquely positioned to generate cash flow from activities on the network beyond simply selling their planets.
10097
10198This cash flow won't likely come from passive activity, but from actively working to develop businesses located on stars and galaxies. Let’s dig a bit deeper into these activities through the lens of some analogues to the existing world.
10299
content/blog/value-of-address-space-pt2.md+59−73
@@ -1,155 +1,141 @@
11+++
22title = "The Value of Urbit Address Space (2 of 3)"
3−date = 2020-04-13
3+date = "2020-04-12"
44description = "Scarcity, utility, liquidity, and network effect."
5+
56[extra]
67author = "Erik Newton + Galen Wolfe-Pauly"
78ship = "~patnes-rigtyn + ~ravmel-ropdyl"
8−image ="https://media.urbit.org/site/posts/essays/value-of-address-space-pt2.jpg"
9+image = "https://media.urbit.org/site/posts/essays/value-of-address-space-pt2.jpg"
910+++
1011
11−<br>
12−
13−<img class="ba" src="https://media.urbit.org/site/posts/essays/value-of-address-space-pt2.jpg">
14−
15−<br>
12+![](https://media.urbit.org/site/posts/essays/value-of-address-space-pt2.jpg)
1613
17−*This is the second in a series of three posts on Urbit address space. See also [part 1](https://urbit.org/blog/value-of-address-space-pt1/) and [part 3](https://urbit.org/blog/value-of-address-space-pt3/).*
14+_This is the second in a series of three posts on Urbit address space. See also [part 1](https://urbit.org/blog/value-of-address-space-pt1/) and [part 3](https://urbit.org/blog/value-of-address-space-pt3/)._
1815
1916## Measuring value
2017
2118Value and price are distinct concepts that often get conflated. In our view, Urbit address space has value for four fundamental reasons: it’s scarce; it has utility; it has some limited liquidity; and it has network effect. Price, on the other hand, is always a function of supply and demand, and it's not something we – as builders – concern ourselves with very much. Let’s take a look at these fundamentals within the Urbit ecosystem.
2219
23−
24−
2520## Scarcity
26−256 galaxies, ~65,000 stars, ~4B planets.
2721
28−<br>
22+256 galaxies, ~65,000 stars, ~4B planets.
2923
30−<img class="ba w-100" src="https://media.urbit.org/site/posts/essays/value-of-address-space-pt2a.svg">
24+![](https://media.urbit.org/site/posts/essays/value-of-address-space-pt2a.svg)
3125
32−<br>
26+A foundational design principle of the Urbit network is that the address space is limited. This rarity helps qualify Urbit as a [collectible](https://nakamotoinstitute.org/shelling-out/), and thus creates a non-zero acquisition cost for an address. This cost discourages abuses like spam and bot-net attacks. Traditionally, these attacks are made with quasi-unlimited access to IP addresses. The unit economics of acquiring planets for these nefarious purposes is a strong deterrent.
3327
34−A foundational design principle of the Urbit network is that the address space is limited. This rarity helps qualify Urbit as a [collectible](https://nakamotoinstitute.org/shelling-out/), and thus creates a non-zero acquisition cost for an address. This cost discourages abuses like spam and bot-net attacks. Traditionally, these attacks are made with quasi-unlimited access to IP addresses. The unit economics of acquiring planets for these nefarious purposes is a strong deterrent.
28+There are 256 galaxies on the network. Each galaxy is initialized with ownership of 255 stars. Galaxies act as root nodes for peer discovery and packet routing within the Urbit network, and they are each also entitled to vote on updates to the smart contracts which govern the network. To date, galaxies trade primarily on OTC (over the counter) desks, and rarely appear on the open market.
3529
36−There are 256 galaxies on the network. Each galaxy is initialized with ownership of 256 stars. Galaxies act as root nodes for peer discovery and packet routing within the Urbit network, and they are each also entitled to vote on updates to the smart contracts which govern the network. To date, galaxies trade primarily on OTC (over the counter) desks, and rarely appear on the open market.
30+There are 65,280 total stars on the network. In turn, each star is initialized with ownership of 65,535 planets. Stars currently trade on platforms independent of Tlon, such as [urbit.live](https://urbit.live/) and [opensea.io](https://opensea.io/). The current price range can easily be ascertained on those sites, but as of the time of this writing, stars are selling at a price that greatly discounts their planet holdings.
3731
38−There are 65,536 total stars on the network. In turn, each star is initialized with ownership of 65,536 planets. Stars currently trade on platforms independent of Tlon, such as [urbit.live](https://urbit.live/) and [opensea.io](https://opensea.io/). The current price range can easily be ascertained on those sites, but as of the time of this writing, stars are selling at a price that greatly discounts their planet holdings.
32+One would expect that in an efficient market the relative pricing of stars on one hand, and planets on the other hand would eventually align (so to speak). This may come to pass as the Urbit community increases education about Urbit, and as additional planet sellers and hosting providers enter the space.
3933
40−One would expect that in an efficient market the relative pricing of stars on one hand, and planets on the other hand would eventually align (so to speak). This may come to pass as the Urbit community increases education about Urbit, and as additional planet sellers and hosting providers enter the space.
34+Finally, there are 4,294,901,760 (or ~2<sup>32</sup>) planets on the network. Planets currently trade largely in a range of $10 to $15. We expect planet prices to fluctuate from provider to provider as described in the previous post, based on the quality of services various providers offer. That said, it's worth noting that the cost to configure addresses for distribution is fairly static and this may act as something of a lower bound.
4135
42−Finally, there are 4,294,967,296 (or 2<sup>32</sup>) planets on the network. Planets currently trade largely in a range of $10 to $15. We expect planet prices to fluctuate from provider to provider as described in the previous post, based on the quality of services various providers offer. That said, it's worth noting that the cost to configure addresses for distribution is fairly static and this may act as something of a lower bound.
36+That said, we also anticipate that planet prices will be abstracted away from most purchasers, and will be included in bundled annual packages of hosting and data routing services. For this reason, infrastructure service providers (i.e. hosting providers) will likely be the best positioned parties to capture value from planet distribution.
4337
44−That said, we also anticipate that planet prices will be abstracted away from most purchasers, and will be included in bundled annual packages of hosting and data routing services. For this reason, infrastructure service providers (i.e. hosting providers) will likely be the best positioned parties to capture value from planet distribution.
45−
46−While an increase in the supply of Urbit address space is a technical possibility, it would run counter to the economic incentives of Urbit address space owners. This is why we view a galaxy vote to dilute address space as improbable.
38+While an increase in the supply of Urbit address space is a technical possibility, it would run counter to the economic incentives of Urbit address space owners. This is why we view a galaxy vote to dilute address space as improbable.
4739
4840Scarcity may be sufficient alone to drive value, but it’s much more impactful when the unit has some underlying purpose, which brings us to utility.
4941
5042## Utility
43+
5144Utility (i.e. what Urbit addresses can be used for) has largely been addressed in the previous installation of this series. Briefly, our view is that stars and galaxies are useful for more than simply selling their subsidiary address space. Their use value encompasses their unique functionality on the network and the business models that functionality represents.
5245
53−As a refresher, this use value falls in five broad categories.
46+As a refresher, this use value falls in five broad categories.
47+
54481. Authentication technology is broadly useful. All Urbit identities — planets, stars, and galaxies — can be used for authenticating one’s Urbit computer, and for authentication in general. Urbit ID was designed for Urbit-specific authentication, but a lot of general functionality can be built on top of this infrastructure. Urbit ID is simple, extensible, and easy to use, making PGP style claims much more useful than they are today.
55492. Network infrastructure services represent a potential revenue stream. Stars and galaxies specifically should be understood as providing their owners the opportunity to develop and use network infrastructure. We anticipate that stars and galaxies will eventually charge for infrastructure related services, like hosting and packet routing, and will distinguish themselves on quality and service.
56−3. Stars and galaxies are well positioned to offer additional services. Because of their role as high level network nodes, stars and galaxies are uniquely positioned to offer additional services, including content delivery networks (CDNs), Bitcoin and other blockchain-related nodes, 0x relays, and Tor exit nodes.
50+3. Stars and galaxies are well positioned to offer additional services. Because of their role as high level network nodes, stars and galaxies are uniquely positioned to offer additional services, including content delivery networks (CDNs), Bitcoin and other blockchain-related nodes, 0x relays, and Tor exit nodes.
57514. Schelling points have value. Because stars and galaxies hold a certain authority on the network (by dint of their relationship to their subsidiary nodes), they act as [Schelling points](https://nav.al/schelling-point), or default hubs, for various activities that will arise as the network grows. Already various groups and communities are beginning to collect around stars. This gravity has value and will eventually be priced.
58−5. Voting has value. Galaxies exclusively hold a vote on the network. This voting right can be separated from the galaxy itself and transferred, and we anticipate that this will happen eventually. The value of this right has not and may never be priced into the market, though as Urbit adoption grows, the value of a vote may emerge.
52+5. Voting has value. Galaxies exclusively hold a vote on the network. This voting right can be separated from the galaxy itself and transferred, and we anticipate that this will happen eventually. The value of this right has not and may never be priced into the market, though as Urbit adoption grows, the value of a vote may emerge.
5953
6054Utility is only one component of a value calculation. To further develop the inquiry into value, let’s move on to trading factors.
6155
6256## Trading, volume, and liquidity
63−Urbit IDs are individually represented by non-fungible ERC-721 tokens, and can therefore be sold by any platform that supports this token standard. Currently there are three known Urbit-exclusive sales platforms and one generalized ERC-721 platform that list Urbit IDs. Prices for stars and planets are readily available. Volume is low, as no effort has been made to promote the fact of availability, yet the number of [total transactions](https://azimuth.network/stats/events.txt) has increased steadily since the network was launched to Ethereum in 2019, even absent public messaging.
6457
65−<br>
66−<img class="" src="https://media.urbit.org/site/posts/essays/value-of-address-space-pt2-tps.svg">
67−<br>
58+Urbit IDs are individually represented by non-fungible ERC-721 tokens, and can therefore be sold by any platform that supports this token standard. Currently there are three known Urbit-exclusive sales platforms and one generalized ERC-721 platform that list Urbit IDs. Prices for stars and planets are readily available. Volume is low, as no effort has been made to promote the fact of availability, yet the number of [total transactions](https://azimuth.network/stats/events.txt) has increased steadily since the network was launched to Ethereum in 2019, even absent public messaging.
59+
60+![](https://media.urbit.org/site/posts/essays/value-of-address-space-pt2-tps.svg)
6861
69−<br>
70−<img class="" src="https://media.urbit.org/site/posts/essays/value-of-address-space-pt2-tss.svg">
71−<br>
62+![](https://media.urbit.org/site/posts/essays/value-of-address-space-pt2-tss.svg)
7263
73−Buying non-fungible tokens like Urbit IDs is rather different than trading quasi-fungible tokens like Bitcoin (even setting aside the issue of volume). Each Urbit ID is unique, and so they tend to be purchased by end users for their specific characteristics, rather than generically. As an example, the planet `~parret-barret` sold for about $1,000 at a time when most planets were selling for $10-20, perhaps due to its rhyming name. Planets with circular sigils also often sell for significantly more than other planets — we’re not entirely sure why this is the case.
64+Buying non-fungible tokens like Urbit IDs is rather different than trading quasi-fungible tokens like Bitcoin (even setting aside the issue of volume). Each Urbit ID is unique, and so they tend to be purchased by end users for their specific characteristics, rather than generically. As an example, the planet `~parret-barret` sold for about $1,000 at a time when most planets were selling for $10-20, perhaps due to its rhyming name. Planets with circular sigils also often sell for significantly more than other planets — we’re not entirely sure why this is the case.
7465
7566## Planet Sales
7667
77−<br>
78−<img class="" src="https://media.urbit.org/site/posts/essays/value-of-address-space-pt2e-price-eth.svg">
79−<br>
68+![](https://media.urbit.org/site/posts/essays/value-of-address-space-pt2e-price-eth.svg)
8069
81−<br>
82−<img class="" src="https://media.urbit.org/site/posts/essays/value-of-address-space-pt2e-price-btc.svg">
83−<br>
70+![](https://media.urbit.org/site/posts/essays/value-of-address-space-pt2e-price-btc.svg)
8471
8572## Star Sales
8673
87−<br>
88−<img class="w-100" src="https://media.urbit.org/site/posts/essays/value-of-address-space-pt2e-price-btc-usd.svg">
89−<br>
74+![](https://media.urbit.org/site/posts/essays/value-of-address-space-pt2e-price-btc-usd.svg)
9075
91−This ID-specific trading pattern is generally appropriate in our view: Urbit ID isn’t designed to be rapidly traded at high volume. Urbit is more like a house than a fungible good like a currency.
76+This ID-specific trading pattern is generally appropriate in our view: Urbit ID isn’t designed to be rapidly traded at high volume. Urbit is more like a house than a fungible good like a currency.
9277
93−For the time being buying and selling of Urbit IDs happens through auctions on specific platforms, and via person-to-person transactions, because each transaction is for a _specific_ Urbit ID. Again, Urbit ID is designed in the spirit of property titles, rather than currencies, so this makes sense.
78+For the time being buying and selling of Urbit IDs happens through auctions on specific platforms, and via person-to-person transactions, because each transaction is for a _specific_ Urbit ID. Again, Urbit ID is designed in the spirit of property titles, rather than currencies, so this makes sense.
9479
9580Strictly speaking, liquidity is a measure of the degree to which a given asset will change in value due to a given transaction. In that sense, Urbit address space is likely fairly illiquid. But liquidity can’t be properly understood without volume. As noted above, the volume of transactions on the network has been steadily increasing since inception, and yet the price has remained fairly constant. This seems to indicate a healthy ratio.
9681
97−<br>
82+![](https://media.urbit.org/site/posts/essays/value-of-address-space-pt2b.svg)
9883
99−<img class="ba w-100" src="https://media.urbit.org/site/posts/essays/value-of-address-space-pt2b.svg">
84+A further impact on liquidity and volume is that of available supply. At present, the majority of Urbit address space is locked by smart contracts. These lockups began to release at varying linear rates in January 2019. All address space will be completely unlocked and tradeable by January 2025. Eventually as both understanding and demand increase, we anticipate that planets will find an equilibrium price, and stars will be repriced accordingly.
10085
101−<br>
102−
103−A further impact on liquidity and volume is that of available supply. At present, the majority of Urbit address space is locked by smart contracts. These lockups began to release at varying linear rates in January 2019. All address space will be completely unlocked and tradeable by January 2025. Eventually as both understanding and demand increase, we anticipate that planets will find an equilibrium price, and stars will be repriced accordingly.
104−
105−We’ll discuss lockups and spawning limits in more detail in the third installment of this series.
86+We’ll discuss lockups and spawning limits in more detail in the third installment of this series.
10687
10788In our view, this combination of scarcity, utility, and the above trading factors is a useful description of existing market dynamics for Urbit address space. A further description of why Urbit has value lies not just in its trading characteristics, but in the utility of human interaction. This brings us to network effect.
10889
10990## Network effect
110−Much is made of the concept of network effect and its impact on network valuations generally. The concept is fairly straightforward so long as numbers aren’t applied. Broadly speaking, networks are interconnected systems of people or things. Network effects are mechanisms wherein every new user of a given system makes the system more valuable to every other user.
91+
92+Much is made of the concept of network effect and its impact on network valuations generally. The concept is fairly straightforward so long as numbers aren’t applied. Broadly speaking, networks are interconnected systems of people or things. Network effects are mechanisms wherein every new user of a given system makes the system more valuable to every other user.
11193
11294Urbit is a network of networks, and it’s designed specifically for communities — for communication and collaboration. The more people who use Urbit, the more communities get started by design. The more communities there are, the more likely outsiders get pulled in to join them, and so the virtuous network effect cycle continues.
11395
114−Digging deeper, Urbit is unusual as a network for the following interrelated reasons:
115−1. Urbit is a platform in the true sense; wherein
116−2. connections are peer-to-peer;
117−3. privacy is high;
118−4. discoverability is low;
119−5. customization and autonomy are nearly limitless; and yet
120−6. the number of possible groups and node connections is essentially unbounded.
96+Digging deeper, Urbit is unusual as a network for the following interrelated reasons:
97+
98+1. Urbit is a platform in the true sense; wherein
99+2. connections are peer-to-peer;
100+3. privacy is high;
101+4. discoverability is low;
102+5. customization and autonomy are nearly limitless; and yet
103+6. the number of possible groups and node connections is essentially unbounded.
121104
122105The upshot is that Urbit can serve as the meta-network for many different kinds of individual networks, each with their own value. Urbit is much more akin to the internet itself than it is to, say, Facebook. Reed’s and Metcalf’s laws therefore apply to Urbit in some very interesting ways.
123106
124107## Network laws
125−Before diving into a discussion of network effect, it's worth noting that although individual tokens and users of those tokens benefit in various ways from a thriving network, the structure of the Urbit network does not grant token holders any rights to profits or losses "generated by the network" as a whole. In fact the very notion is counter to the intent of Urbit's ethos of decentralization. Individuals on the network may profit by their own activities, but there is no central authority profiting off activity in the aggregate; there is no ownership of the network as a whole, and so there are no centralized profits and losses to share. Address space tokens represent one's ownership of their own parcel of land as it were.
126108
127−That said, an entire continent may have aggregate value even though it is distributed. To explore this notion with regards to Urbit, it's worth reviewing the three laws typically cited to express the value of a network as a whole:
128−- Sarnoff’s law states that the value of a network increases proportionally to its size. This is widely understood to understate the value of most modern networks.
129−- Metcalf’s law states that the value of a network is the square of the number of users (n^2).
130−- Reed’s law states that the value of a network increases with the number of groups that can be built on the network. This is expressed as 2^n, where n is the number of groups.
109+Before diving into a discussion of network effect, it's worth noting that although individual tokens and users of those tokens benefit in various ways from a thriving network, the structure of the Urbit network does not grant token holders any rights to profits or losses "generated by the network" as a whole. In fact the very notion is counter to the intent of Urbit's ethos of decentralization. Individuals on the network may profit by their own activities, but there is no central authority profiting off activity in the aggregate; there is no ownership of the network as a whole, and so there are no centralized profits and losses to share. Address space tokens represent one's ownership of their own parcel of land as it were.
131110
132−Reed’s law captures the notion that groups vastly increase the density of connections on a network and so scale value more quickly.
111+That said, an entire continent may have aggregate value even though it is distributed. To explore this notion with regards to Urbit, it's worth reviewing the three laws typically cited to express the value of a network as a whole:
133112
134−Urbit is a network of networks, and so is best described by Reed’s law.
113+- Sarnoff’s law states that the value of a network increases proportionally to its size. This is widely understood to understate the value of most modern networks.
114+- Metcalf’s law states that the value of a network is the square of the number of users (n^2).
115+- Reed’s law states that the value of a network increases with the number of groups that can be built on the network. This is expressed as 2^n, where n is the number of groups.
135116
136−Urbit’s unique approach to groups also helps resolve two other problems which lead to value loss in many networks: Urbit’s design significantly reduces both network pollution (i.e. irrelevant feeds) and network congestion (clogged bandwidth), as individual clusters can easily separate their activity from other networks on the platform.
117+Reed’s law captures the notion that groups vastly increase the density of connections on a network and so scale value more quickly.
137118
119+Urbit is a network of networks, and so is best described by Reed’s law.
138120
121+Urbit’s unique approach to groups also helps resolve two other problems which lead to value loss in many networks: Urbit’s design significantly reduces both network pollution (i.e. irrelevant feeds) and network congestion (clogged bandwidth), as individual clusters can easily separate their activity from other networks on the platform.
139122
140123## Urbit is a platform network
141−It’s important to note that Urbit has utility absent the network, as Urbit OS is in fact a Turing-complete virtual computer. Though the system is designed around communities, individuals can use Urbit to create personal documents, archive data, and write code for the system. This is how Urbit’s total network size can be relatively small and still provide value for individual users and clusters. However, Urbit already has users, and for many of these, critical mass — the point at which the network is more valuable than its cost — has already been reached. In addition, as each of these individual clusters writes code for the platform, positive indirect network effects increase (more utility arises from these individual development efforts).
142124
143−This combination of effects makes Urbit significantly more robust than non-platform networks which can’t rely on this intrinsic utility.
125+It’s important to note that Urbit has utility absent the network, as Urbit OS is in fact a Turing-complete virtual computer. Though the system is designed around communities, individuals can use Urbit to create personal documents, archive data, and write code for the system. This is how Urbit’s total network size can be relatively small and still provide value for individual users and clusters. However, Urbit already has users, and for many of these, critical mass — the point at which the network is more valuable than its cost — has already been reached. In addition, as each of these individual clusters writes code for the platform, positive indirect network effects increase (more utility arises from these individual development efforts).
126+
127+This combination of effects makes Urbit significantly more robust than non-platform networks which can’t rely on this intrinsic utility.
144128
145−That said, we do not intend to ever rely simply on this individuated computing utility alone. Urbit is for communities, and Tlon’s primary focus is to increase adoption of the system as a whole, including the network. To this end we’re working steadily to increase functionality of the system, improve messaging, and actively onboard communities.
129+That said, we do not intend to ever rely simply on this individuated computing utility alone. Urbit is for communities, and Tlon’s primary focus is to increase adoption of the system as a whole, including the network. To this end we’re working steadily to increase functionality of the system, improve messaging, and actively onboard communities.
146130
147131## Network identity
148−Another distinguishing characteristic of Urbit is that identities are pseudonymous but can easily be de-pseudonymized by users at will (though not by outside authorities). This flexibility combined with identity reputation accrual means people can behave in different ways depending on the social context. People can communicate privately, publicly, or in small groups, and they can do it anonymously or otherwise. This natural and extensible approach to social engagement results in personal comfort and drives adoption.
132+
133+Another distinguishing characteristic of Urbit is that identities are pseudonymous but can easily be de-pseudonymized by users at will (though not by outside authorities). This flexibility combined with identity reputation accrual means people can behave in different ways depending on the social context. People can communicate privately, publicly, or in small groups, and they can do it anonymously or otherwise. This natural and extensible approach to social engagement results in personal comfort and drives adoption.
149134
150135## Extensibility
136+
151137Because Urbit is vastly customizable, and because it’s a network platform for other networks, it can and should grow in ways we can’t predict. Each new use case that develops creates a new market, new communities, and new hubs. Each of these contributes to the diversity of the overall ecosystem, making it vastly more interesting and diverse than anything we might create alone. We expect this extensibility to contribute greatly to retention as users are able to build the world they want to inhabit.
152138
153−Urbit is a deeply extensible platform for communities: it’s a network of networks. Users join to be part of communities, then launch communities of their own, further driving growth and engagement in a virtuous cycle.
139+Urbit is a deeply extensible platform for communities: it’s a network of networks. Users join to be part of communities, then launch communities of their own, further driving growth and engagement in a virtuous cycle.
154140
155−In the next installment of this series, we’ll describe lockups and availability in more detail and will share the data we’ve managed to compile about address space distribution.
141+In the next installment of this series, we’ll describe lockups and availability in more detail and will share the data we’ve managed to compile about address space distribution.
content/blog/value-of-address-space-pt3.md+34−45
@@ -1,48 +1,47 @@
11+++
22title = "The Value of Urbit Address Space (3 of 3)"
3−date = 2020-07-10
3+date = "2020-07-09"
44description = ""
5+
56[extra]
67author = "Erik Newton + Galen Wolfe-Pauly"
78ship = "~patnes-rigtyn + ~ravmel-ropdyl"
8−image ="https://media.urbit.org/site/posts/essays/value-of-address-space-pt3.jpg"
9+image = "https://media.urbit.org/site/posts/essays/value-of-address-space-pt3.jpg"
910+++
1011
1112<br>
1213
13−<img class="ba" src="https://media.urbit.org/site/posts/essays/value-of-address-space-pt3.jpg">
14−
15−<br>
14+![](https://media.urbit.org/site/posts/essays/value-of-address-space-pt3.jpg)
1615
17−*This is the third in a series of three posts on Urbit address space. See also [part 1](https://urbit.org/blog/value-of-address-space-pt1/) and [part 2](https://urbit.org/blog/value-of-address-space-pt2/).*
16+_This is the third in a series of three posts on Urbit address space. See also [part 1](https://urbit.org/blog/value-of-address-space-pt1/) and [part 2](https://urbit.org/blog/value-of-address-space-pt2/)._
1817
19−It has been some time since we revisited this series of posts, so let’s start with a summary.
18+It has been some time since we revisited this series of posts, so let’s start with a summary.
2019
2120Our framework for understanding the value of Urbit address space is that it’s useful, it’s rare, it’s easy to exchange, and the more that people use it, the more useful it becomes. Let’s briefly review each concept in a little more detail.
2221
23−First, utility. Urbit address space was designed for logging into Urbit OS, but Urbit ID can be used as an identity primitive for any internet service. That means it’s vastly extensible. Perhaps more importantly, because Urbit IDs at the star and galaxy level represent network infrastructure for the Urbit network, users have already begun to build a range of business models upon them, from hosting providers to community hubs. We explored several of these possibilities in detail in the [first post](https://urbit.org/blog/value-of-address-space-pt1/) in the series, and we also provide a primer on Urbit ID itself.
22+First, utility. Urbit address space was designed for logging into Urbit OS, but Urbit ID can be used as an identity primitive for any internet service. That means it’s vastly extensible. Perhaps more importantly, because Urbit IDs at the star and galaxy level represent network infrastructure for the Urbit network, users have already begun to build a range of business models upon them, from hosting providers to community hubs. We explored several of these possibilities in detail in the [first post](https://urbit.org/blog/value-of-address-space-pt1/) in the series, and we also provide a primer on Urbit ID itself.
2423
2524Second, Urbit address space is finite, and that means it’s scarce. This design, which we explained in more detail in the [second post](https://urbit.org/blog/value-of-address-space-pt2/) in the series, was intended to promote good behavior and to limit spam. So far, that has worked. Scarcity is also impacted by availability of supply, which we’ll explore in this post.
2625
27−Third, network effects, also described in the second post in this series, have the potential to build upon themselves quite rapidly within the Urbit ecosystem. Urbit is essentially a network of other networks, each owned and controlled by their individual users. For this reason, Urbit’s network effect is best described by Reed’s law, which argues that the value of a network increases with the number of groups that can be built on the network. In Urbit’s case, this number is essentially bounded only by the amount of data that can be stored in Urbit itself, which today is 2GB. That size is already enough to support vastly more groups than anyone has tried to launch, and we plan to grow beyond that limit in the coming year.
26+Third, network effects, also described in the second post in this series, have the potential to build upon themselves quite rapidly within the Urbit ecosystem. Urbit is essentially a network of other networks, each owned and controlled by their individual users. For this reason, Urbit’s network effect is best described by Reed’s law, which argues that the value of a network increases with the number of groups that can be built on the network. In Urbit’s case, this number is essentially bounded only by the amount of data that can be stored in Urbit itself, which today is 2GB. That size is already enough to support vastly more groups than anyone has tried to launch, and we plan to grow beyond that limit in the coming year.
2827
29−Also in Part 2, we explored trading of Urbit address space. We look at the current price of stars and planets as denominated in both BTC, and USD, and we see that the price of Urbit address space has remained fairly constant since its launch on-chain, while volume has been steadily increasing. The market is continually developing, with more ways to buy and sell Urbit address space cropping up.
28+Also in Part 2, we explored trading of Urbit address space. We look at the current price of stars and planets as denominated in both BTC, and USD, and we see that the price of Urbit address space has remained fairly constant since its launch on-chain, while volume has been steadily increasing. The market is continually developing, with more ways to buy and sell Urbit address space cropping up.
3029
31−So, to recap: our view is that the value of Urbit address space is a function of its utility, scarcity, network effects, and ease of trade.
30+So, to recap: our view is that the value of Urbit address space is a function of its utility, scarcity, network effects, and ease of trade.
3231
33−In this post, we don’t expand that framework, but rather explore two elements that are important to actually using the framework. We’ll explain lockups, since they impact scarcity, and we’ll discuss usage metrics — including why we don’t (and in most cases can’t) track them.
32+In this post, we don’t expand that framework, but rather explore two elements that are important to actually using the framework. We’ll explain lockups, since they impact scarcity, and we’ll discuss usage metrics — including why we don’t (and in most cases can’t) track them.
3433
35−## Lockups and spawning limits
34+## Lockups and spawning limits
3635
3736One way to think about galaxies, stars, and planets is that they’re different-sized buckets of Urbit IDs. A star contains 2<sup>16</sup> (~65K) planets, a galaxy contains 2<sup>8</sup> (256) stars and, in turn, 2<sup>24</sup> planets (16,777,216). Beyond this nesting pattern, there are three further considerations to note: booted versus unbooted addresses, locked versus unlocked addresses, and planet spawning limits.
3837
3938Booted and Unbooted Addresses –
4039
41−A booted address is one that has actually been used to boot Urbit OS. By convention, booted addresses are expected to have some existing reputation outside of their name alone, since they’ve been used on the network. Reputation, good and bad, comes in many forms. Did the address operate any useful infrastructure? Did it get placed on any blacklists for spam or abuse? Did it simply send and receive messages? The ability to programatically track reputation is still in its infancy, but we expect the tooling to develop as Urbit grows.
40+A booted address is one that has actually been used to boot Urbit OS. By convention, booted addresses are expected to have some existing reputation outside of their name alone, since they’ve been used on the network. Reputation, good and bad, comes in many forms. Did the address operate any useful infrastructure? Did it get placed on any blacklists for spam or abuse? Did it simply send and receive messages? The ability to programatically track reputation is still in its infancy, but we expect the tooling to develop as Urbit grows.
4241
43−Unbooted addresses, on the other hand, have no reputation. Both booted and unbooted addresses can be transferred between owners, but booted addresses will likely vary widely in price depending on the reputation each of them has acquired, and how they’ve been used.
42+Unbooted addresses, on the other hand, have no reputation. Both booted and unbooted addresses can be transferred between owners, but booted addresses will likely vary widely in price depending on the reputation each of them has acquired, and how they’ve been used.
4443
45−For the purposes of this discussion, we’re primarily referring to unbooted addresses, as they have no reputation, and so are more similar to one another. We anticipate that booted addresses will trade infrequently — and likely via broker or auction, since users will prefer to control the reputation of the ID they’ve developed, rather than transfer that reputation to another.
44+For the purposes of this discussion, we’re primarily referring to unbooted addresses, as they have no reputation, and so are more similar to one another. We anticipate that booted addresses will trade infrequently — and likely via broker or auction, since users will prefer to control the reputation of the ID they’ve developed, rather than transfer that reputation to another.
4645
4746Locked vs. Unlocked Addresses –
4847
@@ -50,54 +49,44 @@ At present, the majority of Urbit address space is locked by smart contracts. Wh
5049
5150A locked star is held in a contract and can neither be booted nor issue planets. The lockup contracts can be examined on [GitHub](https://github.com/urbit/azimuth).
5251
53−In practice, the only Urbit IDs that are ‘locked’ are stars. A galaxy that is said to be locked is simply a galaxy whose stars are currently held by a lockup contract. A locked galaxy can be transferred (i.e. sold or simply moved to a new key) and booted (importantly, any galaxy—booted or not—can vote), but it can’t issue stars until the lockup contract expires.
52+In practice, the only Urbit IDs that are ‘locked’ are stars. A galaxy that is said to be locked is simply a galaxy whose stars are currently held by a lockup contract. A locked galaxy can be transferred (i.e. sold or simply moved to a new key) and booted (importantly, any galaxy—booted or not—can vote), but it can’t issue stars until the lockup contract expires.
5453
55−<br>
56−<img class="ba" src="https://media.urbit.org/site/posts/essays/value-of-address-space-pt3-graph1.png">
57−<br>
54+![Star Unlocking Schedule](https://media.urbit.org/site/posts/essays/value-of-address-space-pt3-graph1.png)
5855
59−<br>
60−<img class="ba" src="https://media.urbit.org/site/posts/essays/value-of-address-space-pt3-graph2.png">
61−<br>
56+![Total Urbit IDs Spawned and Activated](https://media.urbit.org/site/posts/essays/value-of-address-space-pt3-graph2.png)
6257
63−These lockups all began to release at varying linear rates in January 2019 (specifically on Tue Jan 08 23:34:41 2019 UTC).
58+These lockups all began to release at varying linear rates in January 2019 (specifically on Tue Jan 08 23:34:41 2019 UTC).
6459
6560The various linear unlocking schedules are grouped as follows:
6661
6762- The urbit.org addresses, and early prize winners unlock linearly from 2019-2021.
68−- Tlon, its founders, employees, and most purchasers from Tlon were frozen for a year, and now unlock linearly from 2020-2024.
69−- 2018 private buyers were frozen for a year, and then began to unlock linearly over the course of one or three years, depending on the terms of their respective contracts.
63+- Tlon, its founders, employees, and most purchasers from Tlon were frozen for a year, and now unlock linearly from 2020-2024.
64+- 2018 private buyers were frozen for a year, and then began to unlock linearly over the course of one or three years, depending on the terms of their respective contracts.
7065- Earlier private buyer addresses—including those in our first two crowdsales—were unlocked right away.
7166
67+As of January 2020, 17,283 stars were unlocked and tradeable. By January 2021, 33,355 will be available. On January 9, 2024, all 65,536 stars will be unlocked and available for trading.
7268
73−As of January 2020, 17,283 stars were unlocked and tradeable. By January 2021, 33,355 will be available. On January 9, 2024, all 65,536 stars will be unlocked and available for trading.
74−
75−Being unlocked does not necessarily mean that a star can spawn all of its planets. For that calculation, we must turn to spawning limits.
76−
69+Being unlocked does not necessarily mean that a star can spawn all of its planets. For that calculation, we must turn to spawning limits.
7770
7871Spawning Limits –
7972
80−Unlocked stars are further gated by the number of planets they’re able to spawn. Every unlocked star was immediately able to spawn 1024 planets from the moment Urbit went live on the blockchain in January 2019—we wanted everyone to be able to invite some friends to their communities right away. From that date forward, the spawnable amount doubles every year (365 days), maxing out at 65,535 spawnable planets after 6 years.
73+Unlocked stars are further gated by the number of planets they’re able to spawn. Every unlocked star was immediately able to spawn 1024 planets from the moment Urbit went live on the blockchain in January 2019—we wanted everyone to be able to invite some friends to their communities right away. From that date forward, the spawnable amount doubles every year (365 days), maxing out at 65,535 spawnable planets after 6 years.
8174
82−<br>
83−<img class="ba" src="https://media.urbit.org/site/posts/essays/value-of-address-space-pt3-graph3.png">
84−<br>
75+![Total Spawnable Planets and Spawnable Planets per Star](https://media.urbit.org/site/posts/essays/value-of-address-space-pt3-graph3.png)
8576
8677When we layer the spawning limits over the various lockup contracts, we find that all Urbit address space is both unlocked and spawnable by January 9, 2025.
8778
8879## Address space distribution
8980
90−Address space has continued to change hands since we put Urbit on-chain in January 2019. At that time, we had a fairly granular understanding of who owned what. Today we only have precise numbers for the Tlon and urbit.org owned address space. Galaxies change hands quite infrequently, so we know more about that ownership than stars and planets. We know next to nothing about the distribution of planets.
81+Address space has continued to change hands since we put Urbit on-chain in January 2019. At that time, we had a fairly granular understanding of who owned what. Today we only have precise numbers for the Tlon and urbit.org owned address space. Galaxies change hands quite infrequently, so we know more about that ownership than stars and planets. We know next to nothing about the distribution of planets.
9182
92−We consider the opacity of our understanding about transactions on the network to be a privacy feature rather than a bug. To be specific about the information we can collect here: first, we don’t know anything about users beyond their ETH address, and second, we can’t tell the difference between a transfer of an address, and the re-keying of an address. This means we’re never entirely sure if a transfer has in fact occurred; we only know that the address has changed.
83+We consider the opacity of our understanding about transactions on the network to be a privacy feature rather than a bug. To be specific about the information we can collect here: first, we don’t know anything about users beyond their ETH address, and second, we can’t tell the difference between a transfer of an address, and the re-keying of an address. This means we’re never entirely sure if a transfer has in fact occurred; we only know that the address has changed.
9384
94−The chart below is an estimate (as of January 2020) based on our general understanding of how galaxies are distributed. Much of this is anecdotal, and it’s largely based on the very few transactions we’ve observed within the galaxy table since Urbit went on chain in 2019. This chart should therefore be understood as incomplete, and an estimate only.
85+The chart below is an estimate (as of January 2020) based on our general understanding of how galaxies are distributed. Much of this is anecdotal, and it’s largely based on the very few transactions we’ve observed within the galaxy table since Urbit went on chain in 2019. This chart should therefore be understood as incomplete, and an estimate only.
9586
96−<br>
97−<img class="ba" src="https://media.urbit.org/site/posts/essays/value-of-address-space-pt3-graph4.png">
98−<br>
87+![Estimated Galaxy Distribution](https://media.urbit.org/site/posts/essays/value-of-address-space-pt3-graph4.png)
9988
100−Address space distribution is best understood in terms of galaxies and stars independently, as they’re distinct assets. The chart above only illustrates galaxy distribution, but describes Tlon’s “naked” galaxy holdings, which are galaxies empty of their stars. These galaxies are empty because the stars they once contained have been distributed, primarily to Tlon contractors, employees, and to certain private buyers.
89+Address space distribution is best understood in terms of galaxies and stars independently, as they’re distinct assets. The chart above only illustrates galaxy distribution, but describes Tlon’s “naked” galaxy holdings, which are galaxies empty of their stars. These galaxies are empty because the stars they once contained have been distributed, primarily to Tlon contractors, employees, and to certain private buyers.
10190
10291We believe that wide distribution is important to the health of the network and the growth of Urbit as a whole. Our own distribution efforts are focused on disbursing Urbit address space ownership as broadly as possible to those interested in using and developing the network.
10392
@@ -111,19 +100,19 @@ First, it’s too early. Urbit’s current users are a fanbase of pioneers who a
111100
112101We’re laying the groundwork so that we can, in earnest, invite our friends and communities to a network they will love. That means we’re designing smooth onboarding, an elegant user interface, and increasing the stability of both the system and network. Tlon’s forthcoming hosting services will vastly reduce barriers to entry, and will be our first major push into the public sphere.
113102
114−Second, and perhaps more importantly, capturing data about traction on the network is difficult by design. Due to Urbit's privacy-forward architecture, there’s quite a lot we will never know. Once an Urbit ID is up and running, we don’t know how often it operates, where it’s hosted, or what it’s doing. This makes capturing usage metrics challenging, but we think this is the right problem to have.
103+Second, and perhaps more importantly, capturing data about traction on the network is difficult by design. Due to Urbit's privacy-forward architecture, there’s quite a lot we will never know. Once an Urbit ID is up and running, we don’t know how often it operates, where it’s hosted, or what it’s doing. This makes capturing usage metrics challenging, but we think this is the right problem to have.
115104
116105The Network Explorer –
117106
118107In the next several months we plan to roll out the first iteration of a network explorer that will allow users to visualize the structure and composition of the network as well as some basic activity data. Our first version of the network explorer will include representations of how the various layers of address space fit together, the finiteness of address space, historical uptime for nodes, and the various unlocking schedules.
119−The network explorer will also allow users to zoom in on various nodes to learn more about them and what they offer.
108+The network explorer will also allow users to zoom in on various nodes to learn more about them and what they offer.
120109Urbit’s privacy-forward design makes collection of data appropriately impossible in many cases. That said, the network explorer should begin to collect all the elements of the value framework we’ve laid out here in one dynamic visualization.
121110
122111Closing –
123112
124−We have long said that Urbit address space had value because it was both useful and scarce. Taking a deeper look, we found that some limited liquidity, and network effect also play an important role in the value framework.
113+We have long said that Urbit address space had value because it was both useful and scarce. Taking a deeper look, we found that some limited liquidity, and network effect also play an important role in the value framework.
125114
126−All of the factors that make up our framework are, in turn, impacted by availability of supply and by user growth. In the Urbit ecosystem, supply is effectively gated—as described above—in order to prevent flooding of the network.
115+All of the factors that make up our framework are, in turn, impacted by availability of supply and by user growth. In the Urbit ecosystem, supply is effectively gated—as described above—in order to prevent flooding of the network.
127116
128117User growth, on the other hand, is something we simply have not yet pursued in earnest. Instead, our development efforts have been focused on enhancing usability and stability of the platform. Our focus on user growth will begin as we roll out hosting. Once that happens, usage metrics will become both more interesting and more relevant.
129118
content/blog/what-is-urbit-for.md+67−62
@@ -1,85 +1,90 @@
11+++
22title = "What is Urbit For?"
3−date = 2016-05-11
3+date = "2016-05-10"
44description = "A vision of the Urbit-powered future."
5−aliases = ["/posts/essays/what-is-urbit-for", "/posts/what-is-urbit-for"]
5+aliases = [
6+ "/posts/essays/what-is-urbit-for",
7+ "/posts/what-is-urbit-for"
8+]
9+
610[extra]
711author = "Galen Wolfe-Pauly"
812ship = "~ravmel-ropdyl"
9−image = "https://storage.googleapis.com/media.urbit.org/site/posts/essays/what-is-urbit-for.jpg"
13+image = "https://storage.googleapis.com/media.urbit.org/site/posts/essays/what-is-urbit-for.jpg"
1014+++
15+
1116![](https://storage.googleapis.com/media.urbit.org/site/posts/essays/what-is-urbit-for.jpg)
1217
1318Open platforms don't beat closed systems just because they're open.
14−They win because you can do more exciting things with them. We
19+They win because you can do more exciting things with them. We
1520believe we're overdue for new infrastructure not purely on principle:
1621but because we think you can build better products on top.
1722
1823We look forward to a future where your fleet of Urbits run the devices
1924throughout your house, keep your biometric data in sync with the data
20−center and hold your secure medical and financial data. Today Urbit
25+center and hold your secure medical and financial data. Today Urbit
2126is just a proof of concept — but we see a road from here to there.
2227
2328## Today
2429
25−These are things that work but are under development today. We expect
30+These are things that work but are under development today. We expect
2631them to improve and stabilize in the coming months.
2732
2833### Making the web programmable
2934
3035The first thing your Urbit can do is act as a transparent layer to
31−your existing services. We'd like urbit to be usable as a self-hosted
32−IFTTT for geeks. Your urbit can hold your keys, store data, run
33−programs and seamlessly connect to your existing services. Plus, with
36+your existing services. We'd like urbit to be usable as a self-hosted
37+IFTTT for geeks. Your urbit can hold your keys, store data, run
38+programs and seamlessly connect to your existing services. Plus, with
3439a global revision controlled filesystem it's easy to share API
3540connectors and keep them up to date.
3641
3742With an Urbit running on your machine you can `ls` your Gmail from
38−Unix. Write a short script to poll Twitter on a keyword and deliver
39−the results to your email or into a Slack channel. Send an SMS when
40−an HTTP request doesn't resolve. These are just a few examples. Your
43+Unix. Write a short script to poll Twitter on a keyword and deliver
44+the results to your email or into a Slack channel. Send an SMS when
45+an HTTP request doesn't resolve. These are just a few examples. Your
4146Urbit is designed to make data trapped in your existing services feel
4247like an extension of your local programming environment.
4348
4449### Self-hosted publishing and communication
4550
4651Additionally your Urbit is a flexible platform for publishing data to
47−the web and communicating with others. Sort of like a self-hosted
48−Slack, WordPress and Wiki in one. It's more common to use many tools
49−for sharing our content and communicating. Urbit is designed to bring
52+the web and communicating with others. Sort of like a self-hosted
53+Slack, WordPress and Wiki in one. It's more common to use many tools
54+for sharing our content and communicating. Urbit is designed to bring
5055those tools together; giving the individual control over their
5156creative output.
5257
5358Simply write markdown in your favorite editor and have an Urbit sync
54−them to the cloud. Use React components to control your layout and
55−extend our toolset. Host your own discussion channels and comment
56−threads. On a computer you own and control, whose source is 100%
59+them to the cloud. Use React components to control your layout and
60+extend our toolset. Host your own discussion channels and comment
61+threads. On a computer you own and control, whose source is 100%
5762open.
5863
5964### Cryptographic identity
6065
6166Your Urbit is your digital identity, cryptographically secured but not
62−controlled by any central authority. The Urbit PKI fills a gap that
63−remains unsolved on the web. We can send encrypted messages, securely
67+controlled by any central authority. The Urbit PKI fills a gap that
68+remains unsolved on the web. We can send encrypted messages, securely
6469exchange digital currency, but how do I know who anyone is?
6570
6671Your Urbit can post public proof to your third party services and its
67−validity is easily auditable. Using Urbit as an identity scheme for
72+validity is easily auditable. Using Urbit as an identity scheme for
6873new services would be a great decentralized alternative to 'Sign in
6974with [company x]'.
7075
7176## Tomorrow
7277
7378Urbit's crypto isn't tested, the network still gets rebooted from time
74−to time. The next milestone comes when Urbit matures to the point
79+to time. The next milestone comes when Urbit matures to the point
7580that it's as reliable as its SaaS counterparts.
7681
7782### Lifestreams, finally
7883
7984The combination of great API tools and great publishing tools means we
8085can finally build an integrated interface for today's social networks.
81−The web is full of streams of data. For the user there's not much
82−utility in bouncing from service to service. Instead, it'd be great
86+The web is full of streams of data. For the user there's not much
87+utility in bouncing from service to service. Instead, it'd be great
8388to have general-purpose tools for consuming and publishing data.
8489Imagine a Medium-quality interface that makes no distinction between
8590Facebook and Twitter; SMS and Skype.
@@ -87,54 +92,54 @@ Facebook and Twitter; SMS and Skype.
8792### Secret storage, web3
8893
8994Bitcoin and Ethereum are both part of a new era of decentralized
90−infrastructure that's just beginning. For the blockchain to realize
95+infrastructure that's just beginning. For the blockchain to realize
9196its potential individuals need ought to have a way to host their own
92−nodes. At the very least, individuals need a reliable place to keep
93−their secrets. What's more, the blockchain isn't designed for
94−computation. It's great for contracts and currency, but too slow for
97+nodes. At the very least, individuals need a reliable place to keep
98+their secrets. What's more, the blockchain isn't designed for
99+computation. It's great for contracts and currency, but too slow for
95100practical computing.
96101
97−Urbit is a great complement to the blockchain. Your Urbit can safely
102+Urbit is a great complement to the blockchain. Your Urbit can safely
98103store your keys, providing an always-available keychain on the
99−network. Even better, your Urbit can hold your blockchain assets and
100−provide an off-chain computation layer. Urbit's computation doesn't
104+network. Even better, your Urbit can hold your blockchain assets and
105+provide an off-chain computation layer. Urbit's computation doesn't
101106provide any kind of distributed consensus, but our computation model
102−is very simple and lends itself well to auditing. This makes it a
107+is very simple and lends itself well to auditing. This makes it a
103108very blockchain-friendly platform.
104109
105110## Over the horizon
106111
107112If there's one thing we know from the history of personal computers
108113it's that computers are always expanding into more and more of our
109−lives. The more _personal_ our computers get the more they need to
110−reflect our thinking and our relationships. We don't know exactly
114+lives. The more _personal_ our computers get the more they need to
115+reflect our thinking and our relationships. We don't know exactly
111116what this will look like, but we can certainly speculate on the areas
112117that deserve the most attention.
113118
114119### Data permanence and software competition
115120
116121Right now applications and data are practically the same thing.
117−There's no practical way for the user to separate them. Apps come and
118−go, either by falling out of fashion or actually shutting down. In
119−both cases our data becomes orphaned. There's no practical way for us
120−to get it back. The raw data from your LiveJournal is as good as a
121−floppy disk from the 80s. Computers hold the records of our lives.
122+There's no practical way for the user to separate them. Apps come and
123+go, either by falling out of fashion or actually shutting down. In
124+both cases our data becomes orphaned. There's no practical way for us
125+to get it back. The raw data from your LiveJournal is as good as a
126+floppy disk from the 80s. Computers hold the records of our lives.
122127Losing the history of the world to bitrot is a preventable problem.
123128
124129Since each person owns their own Urbit there's no way to separate the
125−user from their data. When you run software on your Urbit you
130+user from their data. When you run software on your Urbit you
126131_actually run it_ and your programs manipulate data that _you own_.
127−The individual has permanent access to their data by design. Ensuring
132+The individual has permanent access to their data by design. Ensuring
128133its durability is a technical problem, not a license agreement
129134problem.
130135
131136When individuals are running their own software it's no longer
132−possible to lock them in by controlling their data. Instead, software
133−has to actually compete on utility. If one could trivially replace
137+possible to lock them in by controlling their data. Instead, software
138+has to actually compete on utility. If one could trivially replace
134139the interface for Evernote with one from another developer for $10
135−wouldn't it be worth it? Even more so with Urbit, since after
140+wouldn't it be worth it? Even more so with Urbit, since after
136141installing software you're not dependent on the developer staying
137−alive. You're running a local copy. This model puts pressure on
142+alive. You're running a local copy. This model puts pressure on
138143applications to interoperate better and become more modular.
139144
140145### Reputation
@@ -145,14 +150,14 @@ Just like the marriage of applications and data, reputation is
145150permanently tethered to and jealously guarded by the services we use.
146151
147152For example, today we have karma systems on a per-site basis, like
148−Reddit. Is there any reason that individuals shouldn't have karma
149−scores per-topic? An individual's authority on a certain topic could
150−be verified by other experts while still denied by detractors. It's
151−easy to extend this to services like Yelp. With a strong identity
153+Reddit. Is there any reason that individuals shouldn't have karma
154+scores per-topic? An individual's authority on a certain topic could
155+be verified by other experts while still denied by detractors. It's
156+easy to extend this to services like Yelp. With a strong identity
152157system it's possible for pseudonymous reviews to be counted with real
153−value. We'd no longer need a central authority for deciding on the
158+value. We'd no longer need a central authority for deciding on the
154159reputation of a restaurant, but just a way to pseudonymously aggregate
155−individual opinions. There's a broad swath of territory ripe for
160+individual opinions. There's a broad swath of territory ripe for
156161exploration here.
157162
158163### Privacy
@@ -160,32 +165,32 @@ exploration here.
160165With a reliably secure place to store your data on the network,
161166wouldn't you want to store even more personal information yourself?
162167Why is it that we don't store our own medical records, biometric data
163−or financial data? In a world where we have a safe place to keep them
168+or financial data? In a world where we have a safe place to keep them
164169we wouldn't require anyone else to keep them for us.
165170
166−Furthermore, we'd be able to share them pseudonymously. One could
171+Furthermore, we'd be able to share them pseudonymously. One could
167172imagine medical research or census-like polling being done without
168−compromising the privacy of those involved. This also lowers the
169−barrier to entry for fintech and medical software developers. If I
173+compromising the privacy of those involved. This also lowers the
174+barrier to entry for fintech and medical software developers. If I
170175can run my own personal health and finance software that can reliably
171176access my own transactions and medical records, what would developers
172177come up with?
173178
174179### IoT
175180
176−What needs a network _and_ computation? Devices. Turning a unix box
181+What needs a network _and_ computation? Devices. Turning a unix box
177182into a usable platform for hardware isn't something that any
178−individual manufacturer is incentivized to do. For the internet of
183+individual manufacturer is incentivized to do. For the internet of
179184things to actually work we need a platform for devices to interoperate
180−simply and securely. Urbit is up to the task. Your Urbit isn't just
185+simply and securely. Urbit is up to the task. Your Urbit isn't just
181186a single instance, it can sign the keys for a whole network of Urbits
182187intended to be used for your devices, sensors, appliances, machines,
183188robots, VR helmet, etc.
184189
185190The future of the individual's computing experience may very likely be
186−among many different devices. Bret Victor's 'Seeing Spaces' is a
187−great exploration of what this future may look like. For the
191+among many different devices. Bret Victor's 'Seeing Spaces' is a
192+great exploration of what this future may look like. For the
188193industrial enterprise there's a whole other set of parallel problems:
189194tracking inventory, controlling a vast array of machines, and managing
190−logistics. In both cases we need a decentralized network and
191−computing platform. Urbit is up to the task.
195+logistics. In both cases we need a decentralized network and
196+computing platform. Urbit is up to the task.
content/blog/why-hoon.md+4−2
@@ -1,7 +1,8 @@
11+++
22title = "Why Hoon?"
3−date = 2019-11-14
3+date = "2019-11-13"
44description = "The promise of Urbit lies in its reimagination of the digital world using components that are as constrained and limited as possible."
5+
56[extra]
67author = "Ted Blackman"
78ship = "~rovnys-ricfer"
@@ -19,6 +20,7 @@ sense.
1920
2021In particular, the problems Hoon solves that aren't solved by other
2122functional languages are:
23+
2224- Compile and run other code in a typesafe manner at full speed,
2325- Typesafe metaprogramming, and
2426- Hot code reload and online data migration.
@@ -143,7 +145,7 @@ Hoon and Nock have several unusual properties:
143145 the runtime has a matching jet, it will use that instead of the Nock
144146 implementation. Nock isn't as slow as you might think, especially
145147 considering it's a minimal, dynamic, axiomatic language.
146−<br/><br/>
148+ <br/><br/>
147149 This arrangement has the deeper implication that all code written in
148150 Nock is best considered as a specification for a program, which can be
149151 executed directly but might never run at all due to being jetted.
content/blog/why-urbit-probably-does-not-need-a-blockchain.md+160−154
@@ -1,13 +1,19 @@
11+++
22title = "Why Urbit Probably Doesn't Need a Blockchain"
3−date = 2016-07-14
3+date = "2016-07-13"
44description = "Urbit (probably) doesn't need a blockchain, because the Urbit address-space PKI is a special case of a consensus ledger."
5−aliases = ["/posts/essays/why-urbit-probably-does-not-need-a-blockchain/", "/posts/why-urbit-probably-does-not-need-a-blockchain/", "/blog/blockchain/"]
5+aliases = [
6+ "/posts/essays/why-urbit-probably-does-not-need-a-blockchain/",
7+ "/posts/why-urbit-probably-does-not-need-a-blockchain/",
8+ "/blog/blockchain/"
9+]
10+
611[extra]
712author = "Curtis Yarvin"
813ship = "~sorreg-namtyv"
914image = "https://storage.googleapis.com/media.urbit.org/site/posts/essays/why-urbit-probably-does-not-need-a-blockchain.jpg"
1015+++
16+
1117![](https://storage.googleapis.com/media.urbit.org/site/posts/essays/why-urbit-probably-does-not-need-a-blockchain.jpg)
1218
1319TLDR: Urbit (probably) doesn't need a blockchain, because the Urbit
@@ -26,27 +32,27 @@ Gabriel's famous
2632["worse is better"](https://en.wikipedia.org/wiki/Worse_is_better) essay.
2733
2834There are two kinds of mindsets when approaching hard technical
29−problems. The "MIT" mindset, more typical among mathematicians and
35+problems. The "MIT" mindset, more typical among mathematicians and
3036scientists, wants to attack the problem as its simplest and broadest
31−case, producing the most general and powerful solution available. In
37+case, producing the most general and powerful solution available. In
3238short: better-is-better.
3339
3440The "New Jersey" worse-is-better mentality, more typical among
3541programmers and engineers, wants to do everything possible to _not_
36−attack the problem. Can I produce a serviceable approximation to a
37−true solution? Do I actually have to solve the general problem, or
38−can I reduce it to an easier special case? Can I change the product
42+attack the problem. Can I produce a serviceable approximation to a
43+true solution? Do I actually have to solve the general problem, or
44+can I reduce it to an easier special case? Can I change the product
3945so it doesn't have this problem?
4046
4147Ideally, anyone building anything has both these mindsets in their
42−toolbox. But it's worth noting that (a) Jersey designs (meaning the
48+toolbox. But it's worth noting that (a) Jersey designs (meaning the
4349Bell Labs school that produced Unix, C, and Go) tend to beat MIT
4450designs in the marketplace, and (b) there are very few pure-functional
4551systems built with the true Jersey spirit.
4652
4753## Why Urbit (probably) doesn't need a blockchain
4854
49−Nakamoto consensus is an example of better-is-better. The blockchain
55+Nakamoto consensus is an example of better-is-better. The blockchain
5056design is actually more powerful than it needs to be. It's not just a
5157trustless decentralized ledger; it's a trustless decentralized
5258database and (as Ethereum has realized; but this idea is clearly
@@ -54,29 +60,29 @@ present in Bitcoin's scripting language) a general-purpose, zero-trust
5460decentralized computer.
5561
5662Again, Urbit is not a general-purpose decentralized database or
57−consensus computer. It's a special case of the former, which is a
58−special case of the latter. Urbit is nothing but a digital title
59−chain for network addresses. Our belief is that the special case is
63+consensus computer. It's a special case of the former, which is a
64+special case of the latter. Urbit is nothing but a digital title
65+chain for network addresses. Our belief is that the special case is
6066much easier than the general case, which is why Urbit (probably)
6167doesn't need a blockchain.
6268
6369The rest of this essay describes what makes this special case special,
64−and how we can use that to not need full Nakamoto consensus, or any
70+and how we can use that to not need full Nakamoto consensus, or any
6571kind of general-purpose Byzantine agreement.
6672
6773## The double-sell problem
6874
69−Urbit has the same basic "double-spend" issue as Bitcoin. As Satoshi
75+Urbit has the same basic "double-spend" issue as Bitcoin. As Satoshi
7076puts it: "The problem of course is the payee can't verify that one of
7177the owners did not double-spend the coin." But Urbit is not a
7278currency, so we say "double-selling."
7379
74−"Double-selling" means signing over an Urbit address (_ship_) to two
80+"Double-selling" means signing over an Urbit address (_ship_) to two
7581different parties at the same time, presumably with the intent to sell
7682it to both and skip town with the loot.
7783
78−Again, the logical problem is the same. Bitcoin attacks it as a broad
79−theoretical breakthrough: better-is-better. Urbit attacks it as a
84+Again, the logical problem is the same. Bitcoin attacks it as a broad
85+theoretical breakthrough: better-is-better. Urbit attacks it as a
8086narrow special case: worse-is-better.
8187
8288Intuitively, Urbit's answer is that a real-estate transaction is
@@ -90,40 +96,40 @@ a quick look at the Urbit address space and PKI.
9096## The Urbit address space and PKI
9197
9298(NB: this description differs in minor ways from the running code.
93−Where they differ, the description is right. Urbit is not at present
99+Where they differ, the description is right. Urbit is not at present
94100secure: use for entertainment purpose only.)
95101
96102An Urbit ship is an unsigned integer that serves four purposes: a
97103cryptographic identity, a packet routing address, a stateful virtual
98104computer, and a unique, human-memorable name.
99105
100−Each ship is owned by a private key. To transfer a ship to a new
101−keypair, sign the new public key with the old private key. This
102−revokes the old key and activates the new key. Propagating this
103−update globally makes the revocation global. This is essentially the
106+Each ship is owned by a private key. To transfer a ship to a new
107+keypair, sign the new public key with the old private key. This
108+revokes the old key and activates the new key. Propagating this
109+update globally makes the revocation global. This is essentially the
104110digital title system a smart 12-year-old would design.
105111
106112### Ships and wills
107113
108−Ships are 128-bit numbers classified into tiers by bitwidth. An 8-bit
109−ship (a number less than 256) is a _galaxy_. A 16-bit ship is a
110−_star_. A 32-bit ship is a _planet_. A 64-bit ship is a _moon_. A
114+Ships are 128-bit numbers classified into tiers by bitwidth. An 8-bit
115+ship (a number less than 256) is a _galaxy_. A 16-bit ship is a
116+_star_. A 32-bit ship is a _planet_. A 64-bit ship is a _moon_. A
111117128-bit ship is a _comet_.
112118
113−The chain of signatures for each ship is called a _will_. Unlike most
119+The chain of signatures for each ship is called a _will_. Unlike most
114120certificate systems, there is no metadata in an Urbit will. Nothing is
115−signed but the public-key fingerprint. The length of the will is the
116−keypair version that owns the ship. This version is called its
117−_life_. Each new signed fingerprint in the will is a _deed_.
121+signed but the public-key fingerprint. The length of the will is the
122+keypair version that owns the ship. This version is called its
123+_life_. Each new signed fingerprint in the will is a _deed_.
118124
119−Who gets to create a ship? Comets are fingerprints of a random
120−keypair. Moons, planets and stars are created by their _prefix_, the
125+Who gets to create a ship? Comets are fingerprints of a random
126+keypair. Moons, planets and stars are created by their _prefix_, the
121127ship whose bits are the bottom half of their formal width. For
122128instance, the star `0xbeef` is the prefix of the planet `0xdeadbeef`.
123129Galaxies have their fingerprints hardcoded in the official kernel.
124130
125−Ship numbers are not generally written in hex. They're written in
126−Hoon's `@p` syntax, a phonemic base-256. `@p` also permutes within
131+Ship numbers are not generally written in hex. They're written in
132+Hoon's `@p` syntax, a phonemic base-256. `@p` also permutes within
127133tiers, to superficially conceal prefix structure; for instance,
128134`0xdead.beef` is `~firbyr-napbes`, while `0xcafe.beef` is
129135`~nissep-sopnub`.
@@ -133,18 +139,18 @@ tiers, to superficially conceal prefix structure; for instance,
133139The prefix of a moon, planet, or star also becomes its _parent_. The
134140parent of a ship is its natural locus of federated services. The most
135141basic such service is to mediate P2P routing, as a so-called
136−"supernode." But the set of potential federated services is
142+"supernode." But the set of potential federated services is
137143unbounded.
138144
139−For moons, each new key update is signed by the parent. Planets and
140−stars sign their own updates, making them independent. To prevent
145+For moons, each new key update is signed by the parent. Planets and
146+stars sign their own updates, making them independent. To prevent
141147denial-of-service attacks by parents against children, stars and
142−planets can _exit_, choosing a new parent. An exit deed is a key
148+planets can _exit_, choosing a new parent. An exit deed is a key
143149update also signed by the new parent.
144150
145151The full public cryptographic record of a ship is its _dossier_. The
146152dossier is the set of ship-will pairs, including all parents and
147−prefixes recursively, needed to validate the ship's current key. A
153+prefixes recursively, needed to validate the ship's current key. A
148154ship can process a dossier from an untrusted source.
149155
150156The full set of ship-will pairs a ship knows is its _cabinet_. So the
@@ -155,11 +161,11 @@ accepted into a ship's cabinet.
155161
156162The rule is simple: any deeds in the dossier which are new (not
157163already in the cabinet) must not use keys superseded in the cabinet.
158−Otherwise revocation doesn't work. But revocation affects only
164+Otherwise revocation doesn't work. But revocation affects only
159165dossiers received in the future; nothing already in the cabinet can be
160166revoked.
161167
162−Intuitively, this algorithm creates a propagation race. Life `2` of
168+Intuitively, this algorithm creates a propagation race. Life `2` of
163169`~firbyr-napbes` revokes life `1` of `~firbyr-napbes`, so propagating
164170life `2` to the whole network ensures that anyone who steals the
165171private key for life `1` can't use it in any way -- whether to launch
@@ -181,15 +187,15 @@ As the Karame ["Two Bitcoins at the Price of
181187One"](http://eprint.iacr.org/2012/248.pdf) paper points out:
182188
183189> An efficient countermeasure to combat double-spending on fast
184− Bitcoin payments would be for Bitcoin peers to propagate alerts
185− whenever they receive two or more transactions that share common
186− inputs and different outputs.
190+> Bitcoin payments would be for Bitcoin peers to propagate alerts
191+> whenever they receive two or more transactions that share common
192+> inputs and different outputs.
187193
188194"Fast Bitcoin payments" means zero-confirmation, ie, Bitcoin without
189−the blockchain. These double-spend alerts have never been integrated
195+the blockchain. These double-spend alerts have never been integrated
190196into Bitcoin Core, despite frequent proposals. Given that Bitcoin
191197_does_ have a blockchain, it seems quite sensible for purists to shun
192−hacks that make zero-conf transactions somewhat more secure. Also,
198+hacks that make zero-conf transactions somewhat more secure. Also,
193199double-spend alerts in Bitcoin are a DoS vulnerability; Bitcoin has
194200fees to control the cost of propagating transactions, but who pays for
195201an alert?
@@ -201,29 +207,29 @@ An accepted transaction is simply one that propagates to one or more
201207randomly chosen observer nodes.
202208
203209This design, for the problem that Bitcoin is solving, intuitively
204−feels weak and a little hacky. The Karame paper is not actually
205−advocating for removing the blockchain from Bitcoin. At the same
210+feels weak and a little hacky. The Karame paper is not actually
211+advocating for removing the blockchain from Bitcoin. At the same
206212time, low-value zero-confirmation payments are commonly used.
207213
208214One way to think about security is to flip the tables and think of the
209−defender as the attacker, and vice versa. Just imagine you have some
210−moral right to double spend. The rest of the world is unfairly trying
211−to stop you. Can you defend yourself?
215+defender as the attacker, and vice versa. Just imagine you have some
216+moral right to double spend. The rest of the world is unfairly trying
217+to stop you. Can you defend yourself?
212218
213219In the context of a gossip network that shares all the things, a
214220procedure that involves telling one person one thing, and another
215221person another conflicting thing, and not getting "hacked" by the
216222unfair world which believes there should be only one truth, is
217−inherently quite fragile. And where the attack is fragile, the
223+inherently quite fragile. And where the attack is fragile, the
218224defense is robust.
219225
220226Most of the security in any digital title system comes from the PKI
221−itself. The double-spend problem, the general issue of Byzantine
222−failures in information propagation, is already a corner case. So
227+itself. The double-spend problem, the general issue of Byzantine
228+failures in information propagation, is already a corner case. So
223229perhaps we can solve it as a corner case.
224230
225231Again: _even Bitcoin_ isn't that far from being able to build a
226−practical decentralized ledger without a blockchain. The same gossip
232+practical decentralized ledger without a blockchain. The same gossip
227233model that broadcasts nonconflicting transactions is not at all
228234incapable of reacting to conflicting transactions. We're not really
229235recommending that Bitcoin ditch the blockchain, but this gives us hope
@@ -232,41 +238,41 @@ with our fundamentally easier problem.
232238## Various specific specialnesses
233239
234240What are the differences between the Urbit double-sell problem and the
235−Bitcoin double-spend problem? Is our special case really, truly,
241+Bitcoin double-spend problem? Is our special case really, truly,
236242special?
237243
238244In worse-is-better mode, we want every special-case advantage we can
239−get. Every difference we find is one we can use as a leverage point.
245+get. Every difference we find is one we can use as a leverage point.
240246
241247### Minimal transaction interdependency
242248
243249The first major technical difference between the Urbit title history
244250and the Bitcoin blockchain is that Bitcoin and its relatives are
245251designed to secure a complete, interdependent, collective transaction
246−history. Except for the parent-child relationship, Urbit wills are
252+history. Except for the parent-child relationship, Urbit wills are
247253independent of each other.
248254
249255Bitcoin's use of UTXOs rather than balances reduces interdependency
250−somewhat. But the validity of each transaction is still dependent on
251−all the transactions that created its inputs. (Ethereum drops the
256+somewhat. But the validity of each transaction is still dependent on
257+all the transactions that created its inputs. (Ethereum drops the
252258UTXO model, whose value in reducing dependencies may not match its
253259cost in complexity.)
254260
255−Urbit is not a payment system or a shared ledger. Bitcoins are
256−divisible, but Urbit ships aren't. An Urbit will containing its
261+Urbit is not a payment system or a shared ledger. Bitcoins are
262+divisible, but Urbit ships aren't. An Urbit will containing its
257263parent chain is self-validating and has no dependencies. There is no
258−collective history. There is no Merkle tree. There is no chain, with
264+collective history. There is no Merkle tree. There is no chain, with
259265or without blocks.
260266
261267This simplification doesn't eliminate the double-sell problem in
262−theory, but makes it much more tractable in practice. The set of past
268+theory, but makes it much more tractable in practice. The set of past
263269transactions (key transfers) that a new transaction could conflict
264270with is much smaller.
265271
266272### Trust hierarchy and governance structure
267273
268274The second major technical difference is that Bitcoin is a flat,
269−trustless, fully decentralized system. Urbit has a hierarchical,
275+trustless, fully decentralized system. Urbit has a hierarchical,
270276polycentric governance system which is a trust hierarchy.
271277
272278Now and for quite some time, urbits default to automatically accepting
@@ -276,41 +282,41 @@ You trust your browser quite a bit, which means you trust your browser
276282vendor.
277283
278284And since few Bitcoin node operators code their own daemons, the same
279−dependency on a source distribution exists in Bitcoin. It's informal
285+dependency on a source distribution exists in Bitcoin. It's informal
280286and off-chain, though, which is not really a good thing. (Urbit is
281287like if Bitcoin Core hotpatched itself automatically by publishing
282288source-code diffs on the blockchain.)
283289
284290To be on the safe side, we should think of Urbit as a centralized
285291system until the OS update that turns off automatic updates is
286−shipped. This of course requires a certain measure of perfection,
292+shipped. This of course requires a certain measure of perfection,
287293which cannot in any way be predicted.
288294
289295After Arvo proper becomes "deciduous" (apps will of course always be
290296remotely hotpatched), child-to-parent trust should diminish to the
291−power of the parent to deny service to the child. This will always be
297+power of the parent to deny service to the child. This will always be
292298present without some major redesign.
293299
294300But it's opposed by the equal and opposite power of the child to
295301switch to a different parent, creating a competitive market in
296−governance. This should deliver service at the highest quality and
297−lowest price, fortifying trust with incentives. The power of a
302+governance. This should deliver service at the highest quality and
303+lowest price, fortifying trust with incentives. The power of a
298304restaurant owner to deny you service does not give the food industry
299305the power to starve you to death.
300306
301307And if no parent wants your business, with 2^16 stars who could accept
302308it, you probably shouldn't be on the network at all. Urbit, like a
303309real society, is designed to be a network of incentives that holds
304−everyone in productive tension. We want everyone to be free, and no
310+everyone in productive tension. We want everyone to be free, and no
305311one to be unaccountable.
306312
307313For example: a parent which extends its will also needs to send
308−updated signatures to its children and former children. Either will
314+updated signatures to its children and former children. Either will
309315otherwise be unable to propagate their dossiers to ships whose
310316cabinets have the updated parent will, _even if some other parent
311317adopts them_.
312318
313−But Urbit is a collectively governed and updatable system. A star or
319+But Urbit is a collectively governed and updatable system. A star or
314320galaxy which denies service to its own children will (a) get a bad
315321reputation, (b) drive its children to other parents, and (c) force the
316322network to hardcode a ship-specific exception into the propagation
@@ -319,29 +325,29 @@ algorithm, overriding stale-key revocation.
319325In theory, a parent can extort its children by denying service. In
320326practice, since Urbit is self-governing, not ungoverned, and its
321327government can right this wrong with a source-code patch, the
322−extortion won't work. So it won't happen. So the act of government
328+extortion won't work. So it won't happen. So the act of government
323329won't be necessary, and won't happen either.
324330
325−Of course a perfectly decentralized system would be freer. But worse,
326−as usual, is better. And since we are paying for this worseness,
331+Of course a perfectly decentralized system would be freer. But worse,
332+as usual, is better. And since we are paying for this worseness,
327333imperfect decentralization, we'd like to get all the mileage out of it
328334that we can.
329335
330336Again, Urbit, not being a trustless system, does not have to solve the
331337trustless consensus problem -- although we still very much want to
332−minimize and bound the delegation of trust. This is an obvious
338+minimize and bound the delegation of trust. This is an obvious
333339relaxation of Bitcoin's hard theoretical problem.
334340
335341### Routing: security through topology
336342
337−Please don't laugh. Security through routing topology isn't a joke --
338−unless firewalls are a joke. Cisco sells too many firewalls for them
343+Please don't laugh. Security through routing topology isn't a joke --
344+unless firewalls are a joke. Cisco sells too many firewalls for them
339345to be a joke.
340346
341347In Bitcoin we may have all sorts of reasons to ask what ship holds
342−what coins. In Urbit, when we ask what key controls an ship, we are
343−either sending or receiving a message. Is our outgoing message safely
344−sealed to the current owner? Is our incoming message properly signed
348+what coins. In Urbit, when we ask what key controls an ship, we are
349+either sending or receiving a message. Is our outgoing message safely
350+sealed to the current owner? Is our incoming message properly signed
345351by the current owner?
346352
347353When the parent also forwards all packets until a P2P link is
@@ -350,29 +356,29 @@ full cone NAT, TURN if not), we can design in all kinds of
350356interactions between routing and certificate management.
351357
352358In particular, a parent which is a single source of truth in some
353−sense is a very attractive design element. Again, we're paying for
354−our imperfect decentralization. We might as well use it.
359+sense is a very attractive design element. Again, we're paying for
360+our imperfect decentralization. We might as well use it.
355361
356−For example: I want to send a packet to ship X. Two parties, A and B,
357−are competing for ownership of X. A is the rightful owner. I am
362+For example: I want to send a packet to ship X. Two parties, A and B,
363+are competing for ownership of X. A is the rightful owner. I am
358364secure against B if either of these conditions are true: my packet can
359−only be decoded by A, or my packet is not sent to B. Both would be
360−ideal, of course. Either will do.
365+only be decoded by A, or my packet is not sent to B. Both would be
366+ideal, of course. Either will do.
361367
362368### Latency and friction tolerance
363369
364370Confirmed Bitcoin payments aren't especially low-latency by payment
365−standards. They're reasonably low-friction by payment standards. But
371+standards. They're reasonably low-friction by payment standards. But
366372fees are certainly a thing.
367373
368−Urbit is digital real estate, not digital money. When we look at the
374+Urbit is digital real estate, not digital money. When we look at the
369375standards of latency and friction in actual real estate -- where a
370376transaction that takes a week is super-fast, a 5% payment overhead is
371377normal, and a third-party intermediary is standard -- we see a much,
372378much weaker set of requirements.
373379
374380Obviously a week and a 5% overhead are incredibly sucky levels of
375−latency and friction. The point is that even if this is the only
381+latency and friction. The point is that even if this is the only
376382level of performance Urbit can achieve, that's not necessarily the end
377383of the world for Urbit.
378384
@@ -384,48 +390,48 @@ just not that hard.
384390(One little-made point about Bitcoin, by the way, is that Bitcoin
385391enables trust-free _payments_, but not trust-free _exchanges_. The
386392seller still needs to deliver the goods either before or after the
387−payment; in either case, there is trust. Only Ethereum can solve this
393+payment; in either case, there is trust. Only Ethereum can solve this
388394problem -- and only for digital exchanges.)
389395
390396## We can afford to be patient
391397
392398With a better-is-better, general-purpose solution, one size fits all
393−until the end of time. With a worse-is-better, special-case solution,
399+until the end of time. With a worse-is-better, special-case solution,
394400the details of that case are critical.
395401
396−But we actually don't know these details. One rule of the
402+But we actually don't know these details. One rule of the
397403worse-is-better school: never solve a problem before you have to. You
398−don't know all the details, and you need those details. (Of course,
404+don't know all the details, and you need those details. (Of course,
399405with the better-is-better approach, the details don't matter at all.)
400406
401−Is there such a thing as a transitive adjective? Grammarians are
402−unclear. But technically, the adjective "secure" is always an error.
403−Nothing is "secure." "Secure against X" is the correct usage, where X
407+Is there such a thing as a transitive adjective? Grammarians are
408+unclear. But technically, the adjective "secure" is always an error.
409+Nothing is "secure." "Secure against X" is the correct usage, where X
404410is some threat model.
405411
406412Urbit is an insecure test network with no sensitive data on it. This
407−will remain true for a while. No Urbit ship has ever been transferred
408−cryptographically. This will also remain the status quo for quite a
413+will remain true for a while. No Urbit ship has ever been transferred
414+cryptographically. This will also remain the status quo for quite a
409415while.
410416
411−We _don't know the threat model_. We _can't solve the problem_. It's
412−as simple as that. The best Urbit can do, at the present time, is map
417+We _don't know the threat model_. We _can't solve the problem_. It's
418+as simple as that. The best Urbit can do, at the present time, is map
413419out the ballpark of solutions.
414420
415−And we have time to proceed patiently. One way to think about the
416−timing of cryptographic decentralization is to look at the DNS. It's
421+And we have time to proceed patiently. One way to think about the
422+timing of cryptographic decentralization is to look at the DNS. It's
417423clear that now, a decentralized DNS with cryptographic domain-name
418−titles would be extremely desirable. It was never designed to happen.
424+titles would be extremely desirable. It was never designed to happen.
419425It will probably never happen.
420426
421427But if we look at when cryptographic DNS with allodial title _should_
422428have happened, it's probably sometime in the mid-90s. Ie, after over a
423−decade of production use of the Domain Name System. In short: there's
429+decade of production use of the Domain Name System. In short: there's
424430no need to hurry here.
425431
426432## A map of the solution space
427433
428−But we still need a map of the worse-is-better ballpark. Let's look
434+But we still need a map of the worse-is-better ballpark. Let's look
429435at some options, from least secure to most.
430436
431437The essential question we can't answer, without a better sense of the
@@ -434,19 +440,19 @@ especially are not sure about the threat model of malicious stars
434440(16-bit ships) and/or galaxies (8-bit ships).
435441
436442We need to know what kinds of double-sell attacks are plausible. Since
437−we don't know this yet, we need not one propagation design, but a
443+we don't know this yet, we need not one propagation design, but a
438444range of designs -- stretching all the way up to a full blockchain.
439445
440446### Acceptance model
441447
442−What doesn't change is the will _acceptance_ model. A ship will
448+What doesn't change is the will _acceptance_ model. A ship will
443449always accept a new will if (a) the new will extends the old will, (b)
444450the parent signature on the initial public key is at least as recent
445451as the ship's current version of that parent.
446452
447453The parent clause implies that when a parent extends its will, it
448454needs to send updated initial signatures to all the children it's
449−launched. Otherwise, their own future updates will not be accepted by
455+launched. Otherwise, their own future updates will not be accepted by
450456ships that have seen the parent's update.
451457
452458This is not a big deal in the world of parent responsibilities. But
@@ -460,30 +466,30 @@ Scarcity rules.
460466
461467### Level 0: passive propagation only
462468
463−The Ames protocol can piggyback a will on any packet. Each ship also
469+The Ames protocol can piggyback a will on any packet. Each ship also
464470permanently records which other ships hold which version of its own
465−will. An update is automatically sent when needed.
471+will. An update is automatically sent when needed.
466472
467473With level 0 propagation, all key exchanges in Ames are passive and
468−invisible to the programmer. When the sender has no will or symmetric
474+invisible to the programmer. When the sender has no will or symmetric
469475key for the receiver, the packet is signed, bundled with the will, and
470476sent as cleartext.
471477
472−Signed cleartext? If you have no will for a peer, you've never talked
473−to this ship before. Your first words to a stranger probably won't be
474−super secret. If this isn't true, the programmer has to send an
475−innocuous message first and wait for it to be acknowledged. Kicking a
478+Signed cleartext? If you have no will for a peer, you've never talked
479+to this ship before. Your first words to a stranger probably won't be
480+super secret. If this isn't true, the programmer has to send an
481+innocuous message first and wait for it to be acknowledged. Kicking a
476482rare corner case up to the programmer is a classic worse-is-better
477483move.
478484
479485With level 0 propagation only (the current implementation, because we
480486don't even care about key updates yet), an updated does not
481−effectively revoke the old key. If Alice updates to a new key,
487+effectively revoke the old key. If Alice updates to a new key,
482488Mallory steals the old key, then Mallory talks to Bob before Alice
483489does, Mallory can impersonate Alice.
484490
485491So not only does level 0 not solve double-sell, it's also quite
486−insecure. But it's still fine for now (because Urbit isn't really
492+insecure. But it's still fine for now (because Urbit isn't really
487493decentralized yet).
488494
489495### Level 1: neighbor-only propagation with parent filtering
@@ -491,7 +497,7 @@ decentralized yet).
491497The list of other ships which hold your will, essentially the list of
492498all ships you've talked to, is your list of _neighbors_. You
493499essentially have permanent, if perhaps very sporadic, conversations
494−with all your cryptographic neighbors. Symmetric keys time out fast,
500+with all your cryptographic neighbors. Symmetric keys time out fast,
495501but wills are held forever.
496502
497503By proactively pinging all your neighbors when you extend your will,
@@ -499,99 +505,99 @@ you prevent anyone who finds the old private key (ideally you update
499505when your old key is stale, not when it's actually been _stolen_) from
500506jumping into these conversations.
501507
502−What about non-neighbors? We add a second feature: a parent will only
503−forward a packet if its sender matches the current will. So updating
508+What about non-neighbors? We add a second feature: a parent will only
509+forward a packet if its sender matches the current will. So updating
504510your parent (who is always your neighbor) transforms it
505511
506512There are two cases: where Alice's parent Trent is also Bob's parent,
507−and where Bob has a separate parent Walter. In the first case, the
513+and where Bob has a separate parent Walter. In the first case, the
508514expected packet flow is that Alice will send the packet to Trent, who
509−sends it to Bob. In the second case, Trent sends it to Walter, who
515+sends it to Bob. In the second case, Trent sends it to Walter, who
510516sends it to Bob.
511517
512518In either flow, Bob or Walter is sure that the packet came through
513−Trent. Since Trent is Alice's parent and hence Alice's neighbor, and
514−hence is updated, Trent will forward no packets from Mallory. So
519+Trent. Since Trent is Alice's parent and hence Alice's neighbor, and
520+hence is updated, Trent will forward no packets from Mallory. So
515521Mallory has no way to reach Bob.
516522
517523Non-neighborly packets not matching this flow can't be accepted.
518−Suppose Mallory gets Bob's public IP address directly? If Bob gets a
524+Suppose Mallory gets Bob's public IP address directly? If Bob gets a
519525non-forwarded packet marked "Alice," but Alice is not his neighbor,
520−that's super weird. He must reject the packet.
526+that's super weird. He must reject the packet.
521527
522528Level 1 is nice because it provides a reasonable level of security,
523−but it's still extremely simple. Not only does it not use a
529+but it's still extremely simple. Not only does it not use a
524530blockchain, it doesn't even need a gossip flood!
525531
526532And level 1 propagation also does a competent worse-is-better job on
527−the double-sell problem. Trent simply becomes the single source of
528−truth. The buyer of Alice needs to check that Trent, her parent, has
533+the double-sell problem. Trent simply becomes the single source of
534+truth. The buyer of Alice needs to check that Trent, her parent, has
529535Alice's latest will from the buyer's perspective. If Alice's seller
530536propagates a different fork to other ships, this damages Alice's
531537ability to communicate, but produces no obvious gain for the seller.
532538
533−Level 1 puts a lot of security weight on the parent. If Trent
539+Level 1 puts a lot of security weight on the parent. If Trent
534540misbehaves, for example by not filtering Mallory's packets, Alice can
535−be impersonated. And its solution to the double-sell problem is
536−adequate, but not ideal. Level 1 is the worse-is-better sweet spot
541+be impersonated. And its solution to the double-sell problem is
542+adequate, but not ideal. Level 1 is the worse-is-better sweet spot
537543for a young Urbit, but will probably give way to level 2.
538544
539545### Level 2: broadcast all wills
540546
541−We can't say definitively that level 1 will be inadequate. But
542−intuitively, it feels slightly weak. We will probably need a gossip
547+We can't say definitively that level 1 will be inadequate. But
548+intuitively, it feels slightly weak. We will probably need a gossip
543549protocol.
544550
545551The only ships that can be transferred are galaxies, stars and
546552planets; if all updates of all wills of all these major ships are
547−broadcast, we hardly have a scaling problem like Bitcoin's. Even if
553+broadcast, we hardly have a scaling problem like Bitcoin's. Even if
548554changing the lock on your front door counted as a real-estate
549555transaction, there are a lot fewer real-estate transactions than
550556credit-card payments.
551557
552558Moreover, conflict detection (double-sell alerts) is a natural part of
553−any gossip protocol. Gossip should be between stars, not directly
559+any gossip protocol. Gossip should be between stars, not directly
554560between planets; horizontal gossip, vertical distribution.
555561Star-to-planet distribution may still be limited.
556562
557563Especially since stars are somewhat trusted, ganking a gossip protocol
558564with random update edges is incredibly hard and requires a pretty
559−preposterous conspiracy. And flooding all planet wills does a lot to
560−keep stars honest. It would be incredibly stupid for a star to try a
565+preposterous conspiracy. And flooding all planet wills does a lot to
566+keep stars honest. It would be incredibly stupid for a star to try a
561567double-sell attack against its own planets, but code is always more
562568powerful than mere incentives.
563569
564570Finally, the exit model isn't fully baked yet, but it will probably
565−have more aggressive propagation needs. What's clear is that an exit
571+have more aggressive propagation needs. What's clear is that an exit
566572statement is another type of will entry, involving a signature both
567−from the previous key and the new parent. You can only escape to
573+from the previous key and the new parent. You can only escape to
568574another ship of your parent's class that agrees to adopt you.
569575
570576In general, because escaping need to work for routing (without the
571577cooperation of the former parent), wills containing an exit statement
572578(a planet moving to a new star, or a star moving to a new galaxy)
573579exit) probably need to be flooded globally among all 8-bit galaxies
574−and 16-bit stars. Exits should be rare, so they shouldn't present
580+and 16-bit stars. Exits should be rare, so they shouldn't present
575581much of a scaling problem.
576582
577583### Level 3: full blockchain
578584
579−Obviously a blockchain can solve Urbit's problem. Probably the right
585+Obviously a blockchain can solve Urbit's problem. Probably the right
580586thing to do would be to use the Bitcoin blockchain, and confirm the
581−current Urbit key version with a "colored coin" of some kind. (This
587+current Urbit key version with a "colored coin" of some kind. (This
582588should not be confused with the orthogonal idea of representing Urbit
583589_invitations_ as colored coins.)
584590
585591This involves making all Urbit ships into Bitcoin SPV nodes at the
586−least. Not the worst fate in the world, but also a cost.
592+least. Not the worst fate in the world, but also a cost.
587593Alternatively, Urbit could have its own "altcoin" blockchain, with
588594actual Urbit-specific mining.
589595
590596Again, given that level 2 seems like it should work quite well, it's
591−hard to see why level 3 propagation would be needed. But we can't
592−really know at this point. There's a reason Urbit can update itself
593−over the air. That's why we say: Urbit (probably) doesn't need a
594−blockchain. If it does, we can retrofit it.
597+hard to see why level 3 propagation would be needed. But we can't
598+really know at this point. There's a reason Urbit can update itself
599+over the air. That's why we say: Urbit (probably) doesn't need a
600+blockchain. If it does, we can retrofit it.
595601
596602## Retrospective note
597603
@@ -600,18 +606,18 @@ stripped-down, worse-is-better variation of Nakamoto consensus.
600606That's clearly the right way to introduce it in 2016.
601607
602608Actually, though, this part of Urbit was designed before the Bitcoin
603−paper was published. There were other academic approaches to
609+paper was published. There were other academic approaches to
604610Byzantine consensus, but certainly none validated on a large scale as
605−Nakamoto consensus has been. It never seemed appropriate to treat
611+Nakamoto consensus has been. It never seemed appropriate to treat
606612cryptographic titles to network addresses as a case of generalized
607613Byzantine consensus, and without the existence of Bitcoin there was no
608614temptation in this direction.
609615
610−In a sense the secret of PKIs is that PKIs are easy. What's hard is
616+In a sense the secret of PKIs is that PKIs are easy. What's hard is
611617adapting an existing identity and authorization structure into a PKI.
612618If you build the simplest possible PKI, then force the human processes
613619to fit themselves to the protocol instead of vice versa, you have a
614−much easier job. Similarly, if you are not adding PKI to an existing
620+much easier job. Similarly, if you are not adding PKI to an existing
615621network, but building the network and the PKI as one system, many
616−simplifications are possible. This is once again the classic
622+simplifications are possible. This is once again the classic
617623worse-is-better method.
content/blog/your-last-computer.md+2−2
@@ -1,7 +1,8 @@
11+++
22title = "Your Last Computer"
3−date = 2019-10-17
3+date = "2019-10-16"
44description = "Your Urbit is a simpler computer, a quieter computer, a more private computer. We want it to feel predictable, safe, and reliable — things only a complete, sealed system can do. This, we hope, can get us a world where technology keeps us connected, but doesn’t dominate our lives."
5+
56[extra]
67image = "https://media.urbit.org/site/understanding-urbit/your-last-computer/your-last-computer-waves%402x.png"
78+++
@@ -10,7 +11,6 @@ This whole ‘simple, durable, yours’ thing may sound good, but what does it a
1011
1112First, let’s talk about what it should feel like in the future.
1213
13−
1414<img class="mv5 w-100" src="https://media.urbit.org/site/understanding-urbit/your-last-computer/your-last-computer-waves%402x.png">
1515
1616Imagine that you can log in from anywhere with one simple, memorable name and password. And when you do, an entire OS appears for you. Inside is your whole digital life. Every conversation you’ve ever had, all your biometric data — every step and heartbeat. Your personal mesh of devices: your doors, your car, your irrigation. All of your communities, every message you’ve shared with friends and family. Every connection you’ve made and every archival piece of data, in one place. Secure and private, forever.
content/docs/_index.md+1−1
@@ -6,7 +6,7 @@ template = "sections/docs.html"
66
77Welcome to the developer documentation for the Urbit project. This documentation
88is maintained by [Tlon](https://tlon.io) and the Urbit community in a public
9−[Github repository](https://github.com/urbit/docs). Issues and contributions are
9+[Github repository](https://github.com/urbit/urbit.org/tree/master/content/docs). Issues and contributions are
1010welcome.
1111
1212This documentation provides a series of explainers, guides, tutorials and
content/docs/arvo/ames/_index.md+20
@@ -5,3 +5,23 @@ sort_by = "weight"
55template = "sections/docs/chapters.html"
66insert_anchor_links = "right"
77+++
8+
9+## [Overview](/docs/arvo/ames/ames)
10+
11+An overview of Ames and its capabilities.
12+
13+## [Cryptography](/docs/arvo/ames/cryptography)
14+
15+A technical overview of how Ames implements cryptography.
16+
17+## [API Reference](/docs/arvo/ames/tasks)
18+
19+The `task`s Ames takes and the `gift`s it returns.
20+
21+## [Scry Reference](/docs/arvo/ames/scry)
22+
23+The scry endpoints of Ames.
24+
25+## [Data Types](/docs/arvo/ames/data-types)
26+
27+Reference documentation of the various data types used by Ames.
content/docs/arvo/ames/ames-api.mddeleted−292
@@ -1,292 +0,0 @@
1−+++
2−title = "API Reference"
3−weight = 10
4−template = "doc.html"
5−+++
6−
7−In this document we describe the public interface for Ames. Namely, we describe
8−each `task` that Ames can be `%pass`ed, and which `gift`(s) Ames can `%give` in return.
9−
10−Some `task`s appear to have more than one arm associated to them, e.g. there are
11−four `+on-hear` arms. We denote this where it occurs, but always refer to the
12−`on-hear:event-core` arm.
13−
14−Ames `task`s can be naturally divided into two categories: messaging tasks and
15−system/lifecycle tasks.
16−
17−## Messaging Tasks
18−
19−### `%hear`
20−
21−`%hear` handles raw packet receipt. This `task` only ever originates from Unix.
22−It does the initial processing of a packet, namely by passing the raw packet
23−information to `+decode-packet` which deserializes the packet and giving that data and the origin of the
24−packet to `+on-hear-packet`, which begins the transformation of the packet into
25−a new event in the form of a `+event-core`.
26−
27−There are multiple `+on-hear` arms in `ames.hoon`. Here we refer to
28−`on-hear:event-core`, as that is the one called by a `%hear` `task`. The other ones are used
29−primarily for ack and nack processing, or receiving message fragments.
30−
31−#### Accepts
32−
33−```hoon
34−[=lane =blob]
35−```
36−
37−`%hear` takes in a `blob`, which is essentially a large atom (around 1kB or less)
38−that is the raw data of the message, and a `lane`, which is the origin of the
39−message (typically an IP address).
40−
41−#### Returns
42−
43−`%hear` can trigger a number of possible returns. It can trigger the release of
44−zero or more additional packets via `%send` `gift`s. It may also trigger a `%boon`
45−or `%plea` `gift` (collectively referred to as a `%memo` within Ames) to a local vane in the case of a completed message.
46−
47−
48−### `%heed`
49−
50−A vane can pass Ames a `%heed` `task` to request Ames track a peer's
51−responsiveness. If our `%boon`s to it start backing up locally,
52−Ames will `give` a `%clog` back to the requesting vane containing the
53−unresponsive peer's Urbit address.
54−
55−Stop tracking a peer by sending Ames a
56−`%jilt` `task`.
57−
58−
59−#### Accepts
60−
61−```hoon
62−=ship
63−```
64−
65−The ship to be tracked.
66−
67−#### Returns
68−
69−If the `ship` is indeed being unresponsive, as measured by backed up `%boon`s,
70−Ames will `give` a `%clog` `gift` to the requesting vane containing the
71−unresponsive peer's urbit address.
72−
73−
74−### `%hole`
75−
76−`%hole` handles packet crash notification. `%hole` works much like `%hear`, in
77−that it passes an incoming raw packet to `+decode-packet` to be deserialized,
78−and then passes that data along with the source of the packet to
79−`+on-hear-packet` along with a `?` set to `%.n` denoting that there is something wrong with
80−the packet.
81−
82−#### Accepts
83−
84−```hoon
85−[=lane =blob]
86−```
87−`%hole` takes in a `blob`, which is essentially a large atom (around 1kB or less)
88−that is the raw data of the message, and a `lane`, which is the origin of the
89−message (typically an IP address).
90−
91−#### Returns
92−
93−Like `%hear`, `%hole` can trigger additional packets in the form of `%send`
94−`gift`s, and may also yield a `%boon` or `%plea` `gift` to a local vane.
95−
96−
97−### `%jilt`
98−
99−`%jilt` stops tracking a potentially unresponsive peer that was previously being
100−tracked as a result of the `%heed` `task`.
101−
102−There are two `+on-jilt` arms, this `task` utilizes `on-hear:event-core`.
103−
104−#### Accepts
105−
106−```hoon
107−=ship
108−```
109−
110−The `ship` we no longer wish to track.
111−
112−#### Returns
113−
114−This `task` returns no `gift`s.
115−
116−
117−### `%plea`
118−
119−`%plea` is the `task` used to instruct Ames to send a message. It extends the
120−`%pass`/`%give` semantics across the network. As such, it is the most
121−fundamental `task` in Ames and the primary reason for its existence.
122−
123−Ames also `pass`es a `%plea` `note` to another vane when it receives a message on a
124−"forward flow" from a peer, originally passed from one of the peer's vanes to the
125−peer's Ames.
126−
127−Ultimately `%plea` causes `%send` `gift`(s) to be sent to Unix, which tells
128−Unix to send packets. In terms of `%pass`/`%give` semantics, this is in
129−response to the `%born` `task`, which came along the Unix `duct`, rather than a
130−response to the `%plea`.
131−
132−#### Accepts
133−
134−```hoon
135−[=ship =plea]
136−```
137−
138−A `%plea` `task` takes in the `ship` the `plea` is addressed to, and a `$plea`,
139−which is
140−
141−```hoon
142− +$ plea [vane=@tas =path payload=*]
143−```
144−Here, `vane` is the destination vane on the remote ship, `path` is the internal
145−route on the receiving ship, and `payload` is the semantic message content.
146−
147−#### Returns
148−
149−This `task` returns no `gift`s.
150−
151−## System and Lifecycle Tasks
152−
153−### `%born`
154−
155−Each time you start your Urbit, the Arvo kernel calls the `%born` task for Ames.
156−
157−#### Accepts
158−
159−`%born` takes no arguments.
160−
161−#### Returns
162−
163−In response to a `%born` `task`, Ames `%give`s Jael a `%turf` `gift`.
164−
165−The `duct` along which `%born` comes is Ames' only duct to Unix, so `%send`
166−`gift`s (which are instructions for Unix to send a packet) are also returned in
167−response to `%born`.
168−
169−
170−### `%crud`
171−
172−`%crud` is called whenever an error involving Ames occurs. It produces a crash
173−report in response.
174−
175−#### Accepts
176−
177−```hoon
178−=error
179−```
180−
181−A `$error` is a `[tag=@tas =tang]`.
182−
183−#### Returns
184−
185−Ames does not `give` a `gift` in response to a `%crud` `task`, but it does
186−`%pass` Dill a `%flog` `task` instructing it to print `error`.
187−
188−
189−## `%init`
190−
191−`%init` is called a single time during the very first boot process, immediately
192−after the [larval stage](/docs/arvo/overview#larval-stage-core)
193−is completed. This initializes the vane. Jael is initialized first, followed by
194−other vanes such as Ames.
195−
196−In response to receiving the `%init` `task`, Ames subscribes to the information
197−contained by Jael.
198−
199−#### Accepts
200−
201−```hoon
202−our=ship
203−```
204−
205−`%init` takes in the name of our ship, which is a `@p`.
206−
207−#### Returns
208−
209−```hoon
210− =~ (emit duct %pass /turf %j %turf ~)
211− (emit duct %pass /private-keys %j %private-keys ~)
212−```
213−
214−`%init` sends two moves that subscribe to `%turf` and `%private-keys` in Jael.
215−
216−
217−### `%sift`
218−
219−This `task` filters debug output by ship.
220−
221−#### Accepts
222−
223−```hoon
224−ships=(list ship)
225−```
226−
227−The list of ships for which debug output is desired.
228−
229−#### Returns
230−
231−This `task` returns no `gift`s.
232−
233−
234−### `%spew`
235−
236−Sets verbosity toggles on debug output. These toggles are as follows.
237−
238−* `%snd` - sending packets
239−* `%rcv` - receiving packets
240−* `%odd` - unusual events
241−* `%msg` - message-level events
242−* `%ges` - congestion control
243−* `%for` - packet forwarding
244−* `%rot` - routing attempts
245−
246−Each toggle is a flag set to `%.n` by default.
247−
248−#### Accepts
249−
250−```hoon
251−verbs=(list verb)
252−```
253−
254−`%spew` takes in a `list` of `verb`, which are verbosity flags for Ames.
255−
256−```hoon
257−+$ verb ?(%snd %rcv %odd %msg %ges %for %rot)
258−```
259−
260−`%spew` flips each toggle given in `verbs`.
261−
262−#### Returns
263−
264−This `task` returns no `gift`s.
265−
266−
267−### `%vega`
268−
269−`%vega` is called whenever the kernel is updated. Ames currently does not do
270−anything in response to this.
271−
272−#### Accepts
273−
274−`%vega` takes no arguments.
275−
276−#### Returns
277−
278−This `task` returns no `gift`s.
279−
280−
281−### `%wegh`
282−
283−This `task` is a request to Ames to produce a memory usage report.
284−
285−#### Accepts
286−
287−This `task` has no arguments.
288−
289−#### Returns
290−
291−In response to this `task,` Ames `%give`s a `%mass` `gift` containing Ames'
292−current memory usage.
content/docs/arvo/ames/cryptography.md+3−3
@@ -1,6 +1,6 @@
11+++
22title = "Cryptography"
3−weight = 5
3+weight = 2
44template = "doc.html"
55+++
66
@@ -34,7 +34,7 @@ Algorithm](https://en.wikipedia.org/wiki/Elliptic_Curve_Digital_Signature_Algori
3434is used for authentication
3535
3636The encrypted payload of each packet is a `$shut-packet`, which is the `+jam` of
37−a cell with the `bone`, message number, and message fragment or ack (see
37+a cell with the [$bone](/docs/arvo/ames/data-types#bone), message number, and message fragment or ack (see
3838[Ames](/docs/arvo/ames/ames) for more information on packet structure). The
3939message fragment is signed using the authentication key. It is encrypted using
4040[`+en:crub:crypto`](/docs/arvo/reference/cryptography#en) found in
@@ -43,7 +43,7 @@ message fragment is signed using the authentication key. It is encrypted using
4343## Diffie-Hellman key exchange {#key-exchange}
4444
4545For each foreign ship a given ship has communicated with, `$ames-state` contains a
46−`$peer-state`, inside which the `$symmetric-key` (an atom which nests under
46+[$peer-state](/docs/arvo/ames/data-types#peer-state), inside which the [$symmetric-key](/docs/arvo/ames/data-types#symmetric-key) (an atom which nests under
4747`@uw`) is utilized for encrypting all Ames packets shared between the two ships.
4848The `symmetric-key` is derived using [`+shar:ed:crypto`](/docs/arvo/reference/cryptography#ed) found in `sys/zuse.hoon`,
4949which is an arm utilized for generating the symmetric key for elliptic curve
content/docs/arvo/ames/data-types.mdnew file+389
@@ -0,0 +1,389 @@
1++++
2+title = "Data Types"
3+weight = 5
4+template = "doc.html"
5++++
6+
7+Here are the data types used by Ames, as defined in `lull.hoon`.
8+
9+## `$address`
10+
11+```hoon
12++$ address @uxaddress
13+```
14+
15+Opaque atomic transport address to or from Unix. For Ames over UDP, it will encode the IP address and port.
16+
17+## `$verb`
18+
19+```hoon
20++$ verb ?(%snd %rcv %odd %msg %ges %for %rot)
21+```
22+
23+Verbosity flag for Ames. Use with `|ames-verb %flag1 %flag2 ...` and turn off with `|ames-verb`.
24+
25+- `%snd` - Sending packets.
26+- `%rcv` - Receiving packets.
27+- `%odd` - Unusual events.
28+- `%msg` - Message-level events.
29+- `%ges` - Congestion control.
30+- `%for` - Packet forwarding.
31+- `%rot` - Routing attempts.
32+
33+## `$blob`
34+
35+```hoon
36++$ blob @uxblob
37+```
38+
39+Raw atom to or from Unix, representing a packet.
40+
41+## `$error`
42+
43+```hoon
44++$ error [tag=@tas =tang]
45+```
46+
47+Tagged diagnostic trace.
48+
49+## `$lane`
50+
51+```hoon
52++$ lane (each @pC address)
53+```
54+
55+Ship transport address; either opaque [$address](#address) or galaxy. The runtime knows how to look up galaxies, so we don't need to know their transport addresses.
56+
57+## `$plea`
58+
59+```hoon
60++$ plea [vane=@tas =path payload=*]
61+```
62+
63+Application-level message, as a `%pass`.
64+
65+- `vane` - Destination vane on remote ship.
66+- `path` - Internal route on the receiving ship.
67+- `payload` - Semantic message contents.
68+
69+## `$bone`
70+
71+```hoon
72++$ bone @udbone
73+```
74+
75+Message flow index - mapped to `duct`s in the [$ossuary](#ossuary).
76+
77+The first `bone` is 0. They increment by 4, since each flow includes a bit for each message determining forward vs. backward and a second bit for whether the message is on the normal flow or the associated diagnostic flow (for naxplanations).
78+
79+The least significant bit of a `bone` is:
80+
81+- 1 if "forward", i.e. we send `%plea`s on this flow.
82+- 0 if "backward", i.e. we receive `%plea`s on this flow.
83+
84+The second-least significant bit is 1 if the `bone` is a naxplanation `bone`, and 0 otherwise. Only naxplanation messages can be sent on a naxplanation `bone`, as `%boon`s.
85+
86+## `$fragment`
87+
88+```hoon
89++$ fragment @uwfragment
90+```
91+
92+A message fragment.
93+
94+## `$fragment-num`
95+
96+```hoon
97++$ fragment-num @udfragmentnum
98+```
99+
100+Message fragment count.
101+
102+## `$message-blob`
103+
104+```hoon
105++$ message-blob @udmessageblob
106+```
107+
108+Unfragmented message blob.
109+
110+## `$message-num`
111+
112+```hoon
113++$ message-num @udmessagenum
114+```
115+
116+Message count.
117+
118+## `$public-key`
119+
120+```hoon
121++$ public-key @uwpublickey
122+```
123+
124+A peer's public key.
125+
126+## `$symmetric-key`
127+
128+```hoon
129++$ symmetric-key @uwsymmetrickey
130+```
131+
132+A symmetric key for encrypting messages to a peer. This is produced by performing an elliptic curve Diffie-Hellman using our private key and the peer's public key.
133+
134+## `$ack`
135+
136+```hoon
137++$ ack
138+ $% [%ok ~]
139+ [%nack ~]
140+ [%naxplanation =error]
141+ ==
142+```
143+
144+A message acknowledgement.
145+
146+- `%ok` - Positive acknowledgement.
147+- `%nack` - Negative acknowledgement.
148+- `%naxplanation` - Nack trace.
149+
150+## `$ship-state`
151+
152+```hoon
153++$ ship-state
154+ $% [%alien alien-agenda]
155+ [%known peer-state]
156+ ==
157+```
158+
159+All Ames knows about a peer.
160+
161+- `%alien` - No PKI data, so enqueue actions to perform once we learn it.
162+- `%known` - We know their `life` and public keys, so we have a channel.
163+
164+## `$alien-agenda`
165+
166+```hoon
167++$ alien-agenda
168+ $: messages=(list [=duct =plea])
169+ packets=(set =blob)
170+ heeds=(set duct)
171+ ==
172+```
173+
174+What to do when Ames learns a peer's life and keys.
175+
176+- `messages` - [$plea](#plea)s local vanes have asked Ames to send.
177+- `packets` - Packets we've tried to send.
178+- `heeds` - Local tracking requests; passed through into [$peer-state](#peer-state).
179+
180+## `$peer-state`
181+
182+```hoon
183++$ peer-state
184+ $: $: =symmetric-key
185+ =life
186+ =public-key
187+ sponsor=ship
188+ ==
189+ route=(unit [direct=? =lane])
190+ =qos
191+ =ossuary
192+ snd=(map bone message-pump-state)
193+ rcv=(map bone message-sink-state)
194+ nax=(set [=bone =message-num])
195+ heeds=(set duct)
196+ ==
197+```
198+
199+State for a peer with known life and keys.
200+
201+- `route` - Transport-layer destination for packets to the peer.
202+- `qos` - Quality of service; connection status to the peer.
203+- `ossuary` - [$bone](#bone) to `duct` mapper.
204+- `snd` - Per-`bone` message pumps to send messages as fragments.
205+- `rcv` - Per-`bone` message sinks to assemble messages from fragments.
206+- `nax` - Unprocessed nacks (negative acknowledgments).
207+- `heeds` - Listeners for `%clog` notifications.
208+
209+## `$qos`
210+
211+```hoon
212++$ qos
213+ $~ [%unborn *@da]
214+ [?(%live %dead %unborn) last-contact=@da]
215+```
216+
217+Quality of service; how is the connection to a peer doing?
218+
219+- `%live` - Peer is ok.
220+- `%dead` - Peer is not responding.
221+- `%unborn` - Peer is sunken.
222+- `last-contact` - Last time Ames heard from the peer, or if `%unborn`, the time when we first started tracking then.
223+
224+## `$ossuary`
225+
226+```hoon
227++$ ossuary
228+ $: =next=bone
229+ by-duct=(map duct bone)
230+ by-bone=(map bone duct)
231+ ==
232+```
233+
234+[$bone](#bone) to `duct` mapping, `next` is the next `bone` to map to a `duct`.
235+
236+## `$message-pump-state`
237+
238+```hoon
239++$ message-pump-state
240+ $: current=_`message-num`1
241+ next=_`message-num`1
242+ unsent-messages=(qeu message-blob)
243+ unsent-fragments=(list static-fragment)
244+ queued-message-acks=(map message-num ack)
245+ =packet-pump-state
246+ ==
247+```
248+
249+Persistent state for a `|message-pump`.
250+
251+- `current`- Sequence number of earliest message sent or being sent.
252+- `next` - Sequence number of next message to send.
253+- `unsent-messages` - Messages to be sent after current message.
254+- `unsent-fragments` - Fragments of current message waiting for sending.
255+- `queued-message-acks` - Future message acks to be applied after current.
256+- `packet-pump-state` - State of corresponding `|packet-pump`.
257+
258+## `$static-fragment`
259+
260+```hoon
261++$ static-fragment
262+ $: =message-num
263+ num-fragments=fragment-num
264+ =fragment-num
265+ =fragment
266+ ==
267+```
268+
269+A packet; a fragment of a message and metadata.
270+
271+## `$packet-pump-state`
272+
273+```hoon
274++$ packet-pump-state
275+ $: next-wake=(unit @da)
276+ live=(tree [live-packet-key live-packet-val])
277+ metrics=pump-metrics
278+ ==
279+```
280+
281+Persistent state for a `|packet-pump`.
282+
283+- `next-wake` - Last timer we've set, or null.
284+- `live` - Packets in flight; sent but not yet acked.
285+- `metrics` - Congestion control information.
286+
287+## `$pump-metrics`
288+
289+```hoon
290++$ pump-metrics
291+ $: rto=_~s1
292+ rtt=_~s1
293+ rttvar=_~s1
294+ ssthresh=_10.000
295+ cwnd=_1
296+ num-live=@ud
297+ counter=@ud
298+ ==
299+```
300+
301+Congestion control state for a `|packet-pump`.
302+
303+- `rto` - Retransmission timeout.
304+- `rtt` - Roundtrip time estimate, low-passed using EWMA.
305+- `rttvar` - Mean deviation of `rtt`, also low-passed with EWMA.
306+- `num-live` - How many packets sent, awaiting ack.
307+- `ssthresh` - Slow-start threshold.
308+- `cwnd` - Congestion window; max unacked packets.
309+
310+## `$live-packet`
311+
312+```hoon
313++$ live-packet
314+ $: key=live-packet-key
315+ val=live-packet-val
316+ ==
317+```
318+
319+A packet in flight, as tracked in the [$packet-pump-state](#packet-pump-state).
320+
321+## `$live-packet-key`
322+
323+```hoon
324++$ live-packet-key
325+ $: =message-num
326+ =fragment-num
327+ ==
328+```
329+
330+Identifier of a packet in flight.
331+
332+## `$live-packet-val`
333+
334+```hoon
335++$ live-packet-val
336+ $: packet-state
337+ num-fragments=fragment-num
338+ =fragment
339+ ==
340+```
341+
342+Content and metadata about a packet in flight.
343+
344+## `$packet-state`
345+
346+```hoon
347++$ packet-state
348+ $: last-sent=@da
349+ retries=@ud
350+ skips=@ud
351+ ==
352+```
353+
354+Sending statistics about a packet in flight.
355+
356+## `$message-sink-state`
357+
358+```hoon
359++$ message-sink-state
360+ $: last-acked=message-num
361+ last-heard=message-num
362+ pending-vane-ack=(qeu [=message-num message=*])
363+ live-messages=(map message-num partial-rcv-message)
364+ nax=(set message-num)
365+ ==
366+```
367+
368+State of a `|message-sink` to assemble received messages.
369+
370+- `last-acked` - Highest [$message-num](#message-num) Ames has fully acknowledged.
371+- `last-heard` - Highest `message-num` Ames has heard all fragments for.
372+- `pending-vane-ack` - Heard but not processed by local vane.
373+- `live-messages` - Partially received messages.
374+
375+## `$partial-rcv-message`
376+
377+```hoon
378++$ partial-rcv-message
379+ $: num-fragments=fragment-num
380+ num-received=fragment-num
381+ fragments=(map fragment-num fragment)
382+ ==
383+```
384+
385+A message for which Ames has received some fragments.
386+
387+- `num-fragments` - Total number of fragments in the message.
388+- `num-received` - How many fragments Ames has received so far.
389+- `fragments` - The received fragments themselves.
content/docs/arvo/ames/scry.mdnew file+126
@@ -0,0 +1,126 @@
1++++
2+title = "Scry Reference"
3+weight = 4
4+template = "doc.html"
5++++
6+
7+Here are the scry endpoints of Ames. All of them take a `%x` `care` and require the `desk` in the path prefix be empty, so the general format is `.^([type] %ax /=//=/[some-path])`.
8+
9+## /protocol/version
10+
11+A scry with a `%x` `care` and a `path` of `/protocol/version` will return the current Ames protocol version as a `@`.
12+
13+#### Example
14+
15+```
16+> .^(@ %ax /=//=/protocol/version)
17+0
18+```
19+
20+## /peers
21+
22+A scry with a `%x` `care` and a `path` of `/peers` will return all ships that Ames is aware of. The type returned is a `(map ship ?(%alien %known))`, where `%known` means we have PKI data for them and `%alien` means we don't.
23+
24+#### Example
25+
26+```
27+> .^((map ship ?(%alien %known)) %ax /=//=/peers)
28+{[p=~wet q=%known] [p=~nes q=%known]}
29+```
30+
31+## /peers/[ship]
32+
33+A scry with a `%x` `care` and a `path` of `/peers/[ship]` where `[ship]` is a ship name like `~dopzod` will return everything Ames knows about that ship, or crash if the ship is unknown to Ames. The type returned is a [$ship-state](/docs/arvo/ames/data-types#ship-state).
34+
35+#### Example
36+
37+```
38+> .^(ship-state:ames %ax /=//=/peers/~nes)
39+[ %known
40+ [ symmetric-key=0wEF.5-Mp4.ehBxk.a-ktl.CAUHq.~XNVq.AfPFk.TwBbj.rc7MS
41+ life=1
42+ public-key=0w9R.IG6Km.CQfuL.lP9Da.l~kh1.lOHzV.xactk.1ybiB.hekW~.VC2d0.DDRsU.h6GHl.PKmRX.p3u2-.vO4Hg.QTOlp.A4AI0.uGPVy
43+ sponsor=~nes
44+ ]
45+ route=[~ [direct=%.y lane=[%.y p=~nes]]]
46+ qos=[%dead last-contact=~2021.8.9..16.11.36..fdbc]
47+ ossuary
48+ [ next-bone=4
49+ by-duct={[p=~[/gall/sys/way/~nes/hood /gall/use/hood/0w2.4d7EV/out/~nes/hood/helm/hi/~nes /dill //term/1] q=0]}
50+ by-bone={[p=0 q=~[/gall/sys/way/~nes/hood /gall/use/hood/0w2.4d7EV/out/~nes/hood/helm/hi/~nes /dill //term/1]]}
51+ ]
52+ snd
53+ { [ p=0
54+ q
55+ [ current=2
56+ next=3
57+ unsent-messages={}
58+ unsent-fragments=~
59+ queued-message-acks={}
60+ packet-pump-state
61+ [ next-wake=[~ ~2021.8.17..02.21.14..3d23]
62+ live={[[message-num=2 fragment-num=0] [last-sent=~2021.8.17..02.19.14..3d23 retries=2.255 skips=0] num-fragments=1 fragment=0w2.QJ1qS.JzaQn.w7rMp.IzuTJ.7M7aP.-1s~1]}
63+ metrics=[rto=~m2 rtt=~s1 rttvar=~s1 ssthresh=1 cwnd=1 num-live=1 counter=1]
64+ ]
65+ ]
66+ ]
67+ }
68+ rcv={}
69+ nax={}
70+ heeds={~[/gall/sys/lag /dill //term/1]}
71+]
72+```
73+
74+## /peers/[ship]/forward-lane
75+
76+A scry with a `%x` `care` and a `path` of `/peers/[ship]/forward-lane` where `[ship]` is a ship name like `~dopzod` will return outbound routes to the given ship, or `~` if there are none. The type returned is a `(list lane:ames)`, see [$lane](/docs/arvo/ames/data-types#lane) for type details.
77+
78+#### Examples
79+
80+```
81+> .^((list lane:ames) %ax /=//=/peers/~nes/forward-lane)
82+~[[%.y p=~nes]]
83+```
84+
85+```
86+> .^((list lane:ames) %ax /=//=/peers/~nec/forward-lane)
87+~
88+```
89+
90+## /bones/[ship]
91+
92+A scry with a `%x` `care` and a `path` of `/bones/[ship]` where `[ship]` is a ship name like `~dopzod` will return inbound and outbound [$bone](/docs/arvo/ames/data-types#bone)s, which index message flows. If the ship in question is unknown to Ames, the scry will fail. The type returned is `[snd=(set bone) rcv=(set bone)]`.
93+
94+#### Example
95+
96+```
97+> .^([snd=(set bone) rcv=(set bone)] %ax /=//=/bones/~nes)
98+[snd={0} rcv={}]
99+```
100+
101+## /snd-bones/[ship]/[bone]
102+
103+A scry with a `%x` `care` and a `path` of `/snd-bones/[ship]/[bone]`, where `[ship]` is a ship name like `~dopzod` and `[bone]` is an outbound [$bone](/docs/arvo/ames/data-types#bone), will return message flow details for that `bone`. If the ship in question is unknown to Ames or the `bone` does not exist, the scry will fail. The type returned is a [$message-pump-state](/docs/arvo/ames/data-types#message-pump-state) wrapped in a `vase`.
104+
105+#### Example
106+
107+```
108+> !< message-pump-state:ames .^(vase %ax /=//=/snd-bones/~nes/0)
109+[ current=2
110+ next=3
111+ unsent-messages={}
112+ unsent-fragments=~
113+ queued-message-acks={}
114+ packet-pump-state
115+ [ next-wake=[~ ~2021.8.17..02.27.14..aaff]
116+ live
117+ { [ [message-num=2 fragment-num=0]
118+ [last-sent=~2021.8.17..02.25.14..aaff retries=2.258 skips=0]
119+ num-fragments=1
120+ fragment=0w2.QJ1qS.JzaQn.w7rMp.IzuTJ.7M7aP.-1s~1
121+ ]
122+ }
123+ metrics=[rto=~m2 rtt=~s1 rttvar=~s1 ssthresh=1 cwnd=1 num-live=1 counter=1]
124+ ]
125+]
126+```
content/docs/arvo/ames/tasks.mdnew file+193
@@ -0,0 +1,193 @@
1++++
2+title = "API Reference"
3+weight = 3
4+template = "doc.html"
5++++
6+
7+In this document we describe the public interface for Ames. Namely, we describe
8+each `task` that Ames can be `%pass`ed, and which `gift`(s) Ames can `%give` in return.
9+
10+Some `task`s appear to have more than one arm associated to them, e.g. there are
11+four `+on-hear` arms. We denote this where it occurs, but always refer to the
12+`+on-hear:event-core` arm.
13+
14+Ames `task`s can be naturally divided into two categories: messaging tasks and
15+system/lifecycle tasks.
16+
17+## Messaging Tasks
18+
19+### `%hear`
20+
21+```hoon
22+[%hear =lane =blob]
23+```
24+
25+`%hear` handles raw packet receipt.
26+
27+This `task` only ever originates from Unix. It does the initial processing of a packet, namely by passing the raw packet information to `+decode-packet` which deserializes the packet and giving that data and the origin of the packet to `+on-hear-packet`, which begins the transformation of the packet into a new event in the form of a `+event-core`.
28+
29+There are multiple `+on-hear` arms in `ames.hoon`. Here we refer to `+on-hear:event-core`, as that is the one called by a `%hear` `task`. The other ones are used primarily for ack and nack processing, or receiving message fragments.
30+
31+`%hear` takes in a [$blob](/docs/arvo/ames/data-types#blob), which is essentially a large atom (around 1kB or less) that is the raw data of the message, and a [$lane](/docs/arvo/ames/data-types#lane), which is the origin of the message (typically an IP address).
32+
33+#### Returns
34+
35+`%hear` can trigger a number of possible returns. It can trigger the release of zero or more additional packets via `%send` `gift`s. It may also trigger a `%boon` or `%plea` `gift` (collectively referred to as a `%memo` within Ames) to a local vane in the case of a completed message.
36+
37+### `%heed`
38+
39+```hoon
40+[%heed =ship]
41+```
42+
43+A vane can pass Ames a `%heed` `task` to request Ames track a peer's responsiveness. If our `%boon`s to it start backing up locally, Ames will `give` a `%clog` back to the requesting vane containing the unresponsive peer's Urbit address.
44+
45+Stop tracking a peer by sending Ames a [%jilt](#jilt) `task`.
46+
47+The `ship` field specifies the peer to be tracked.
48+
49+#### Returns
50+
51+If the `ship` is indeed being unresponsive, as measured by backed up `%boon`s,
52+Ames will `give` a `%clog` `gift` to the requesting vane containing the
53+unresponsive peer's urbit address.
54+
55+### `%jilt`
56+
57+```hoon
58+[%jilt =ship]
59+```
60+
61+`%jilt` stops tracking a potentially unresponsive peer that was previously being
62+tracked as a result of the [%heed](#heed) `task`.
63+
64+There are two `+on-jilt` arms, this `task` utilizes `+on-hear:event-core`.
65+
66+The `ship` field specifies the peer we want to stop tracking.
67+
68+#### Returns
69+
70+This `task` returns no `gift`s.
71+
72+### `%plea`
73+
74+```hoon
75+[%plea =ship =plea:ames]
76+```
77+
78+`%plea` is the `task` used to instruct Ames to send a message. It extends the
79+`%pass`/`%give` semantics across the network. As such, it is the most
80+fundamental `task` in Ames and the primary reason for its existence.
81+
82+Ames also `pass`es a `%plea` `note` to another vane when it receives a message on a
83+"forward flow" from a peer, originally passed from one of the peer's vanes to the
84+peer's Ames.
85+
86+Ultimately `%plea` causes `%send` `gift`(s) to be sent to Unix, which tells
87+Unix to send packets. In terms of `%pass`/`%give` semantics, this is in
88+response to the `%born` `task`, which came along the Unix `duct`, rather than a
89+response to the `%plea`.
90+
91+A `%plea` `task` takes in the `ship` the `plea` is addressed to, and a [$plea](/docs/arvo/ames/data-types.md#plea).
92+
93+#### Returns
94+
95+This `task` returns no `gift`s.
96+
97+## System Tasks
98+
99+### `%born`
100+
101+```hoon
102+[%born ~]
103+```
104+
105+Each time you start your Urbit, the Arvo kernel calls the `%born` `task` for Ames.
106+
107+#### Returns
108+
109+In response to a `%born` `task`, Ames `%give`s Jael a `%turf` `gift`.
110+
111+The `duct` along which `%born` comes is Ames' only duct to Unix, so `%send`
112+`gift`s (which are instructions for Unix to send a packet) are also returned in
113+response to `%born`.
114+
115+### `%init`
116+
117+```hoon
118+[%init ~]
119+```
120+
121+`%init` is called a single time during the very first boot process, immediately
122+after the [larval stage](/docs/arvo/overview#larval-stage-core)
123+is completed. This initializes the vane. Jael is initialized first, followed by
124+other vanes such as Ames.
125+
126+In response to receiving the `%init` `task`, Ames subscribes to the information
127+contained by Jael.
128+
129+#### Returns
130+
131+```hoon
132+=~ (emit duct %pass /turf %j %turf ~)
133+ (emit duct %pass /private-keys %j %private-keys ~)
134+```
135+
136+`%init` sends two moves that subscribe to `%turf` and `%private-keys` in Jael.
137+
138+### `%sift`
139+
140+```hoon
141+[%sift ships=(list ship)]
142+```
143+
144+This `task` filters debug output by ship. This `task` is used internally when the `|ames-sift` `hood` generator is run from the dojo.
145+
146+The `ships` field specifies the ships for which debug output is desired.
147+
148+#### Returns
149+
150+This `task` returns no `gift`s.
151+
152+### `%spew`
153+
154+```hoon
155+[%spew veb=(list verb)]
156+```
157+
158+Sets verbosity toggles on debug output. This `task` is used internally when the `|ames-verb` `hood` generator is run from the dojo.
159+
160+`%spew` takes in a `list` of [$verb](/docs/arvo/ames/data-types#verb), which are verbosity flags for Ames.
161+
162+`%spew` flips each toggle given in `veb`.
163+
164+#### Returns
165+
166+This `task` returns no `gift`s.
167+
168+### `%stir`
169+
170+```hoon
171+[%stir arg=@t]
172+```
173+
174+A `%stir` `task` starts timers for any flows that lack them.
175+
176+The `arg` field is unused.
177+
178+#### Returns
179+
180+This `task` returns no `gift`s.
181+
182+### `%vega`
183+
184+```hoon
185+[%vega ~]
186+```
187+
188+`%vega` is called whenever the kernel is updated. Ames currently does not do
189+anything in response to this.
190+
191+#### Returns
192+
193+This `task` returns no `gift`s.
content/docs/arvo/behn/examples.md+2−2
@@ -39,7 +39,7 @@ Below is a thread which will take a `@dr` as its argument and `%pass`es Behn a `
3939(pure:m !>(~))
4040```
4141
42−Save the thread to `/ted/wait.hoon` and `|commit %home`. Then we can try running the thread with a `@dr` of `~s2`:
42+Save the thread to `/ted/wait.hoon` and `|commit %base`. Then we can try running the thread with a `@dr` of `~s2`:
4343
4444```
4545> -wait ~s2
@@ -84,7 +84,7 @@ Below is a variation on the [%wake](#wake) thread. It takes a `@dr` as its argum
8484(pure:m !>(~))
8585```
8686
87−Save the above thread to `/ted/rest.hoon`, and `|commit %home`. Let's try run it with an argument of `~s2`:
87+Save the above thread to `/ted/rest.hoon`, and `|commit %base`. Let's try run it with an argument of `~s2`:
8888
8989```
9090> -rest ~s2
content/docs/arvo/clay/architecture.md+43−120
@@ -4,26 +4,25 @@ weight = 2
44template = "doc.html"
55+++
66
7−Clay is the primary filesystem for the [Arvo](/docs/arvo/overview) operating system,
8−which is the [core](/docs/glossary/core/) of an urbit. The architecture of Clay is
9−intrinsically connected with Arvo, but for this section we assume no knowledge of
10−either Arvo or Urbit. We will point out only those features of
11−Arvo that are necessary for an understanding of Clay, and we will
12−do so only when they arise.
7+Clay is the primary filesystem for the [Arvo](/docs/arvo/overview)
8+operating system, which is the [core](/docs/glossary/core/) of an
9+urbit. The architecture of Clay is intrinsically connected with Arvo,
10+but for this section we assume no knowledge of either Arvo or Urbit.
11+We will point out only those features of Arvo that are necessary for
12+an understanding of Clay, and we will do so only when they arise.
1313
1414The first relevant feature of Arvo is that it is a deterministic
15−system where input and output are defined as a series of events
16−and effects. The state of Arvo is simply a pure function of its event
17−log. None of the effects from an event are emitted until the
18−event is entered in the log and persisted, either to disk or
19−another trusted source of persistence, such as a Kafka cluster.
20−Consequently, Arvo is a single-level store: everything in its
21−state is persistent.
15+system where input and output are defined as a series of events and
16+effects. The state of Arvo is simply a pure function of its event log.
17+None of the effects from an event are emitted until the event is
18+entered in the log and persisted, either to disk or another trusted
19+source of persistence, such as a Kafka cluster. Consequently, Arvo is
20+a single-level store: everything in its state is persistent.
2221
2322In a more traditional OS, everything in RAM can be erased at any
2423time by power failure, and is always erased on reboot. Thus, a
2524primary purpose of a filesystem is to ensure files persist across
26−power failures and reboots. In Arvo, both power failures and
25+power failures and reboots. In Arvo, both power failures and
2726reboots are special cases of suspending computation, which is
2827done safely since our event log is already persistent. Therefore,
2928Clay is not needed in Arvo for persistence. Why, then, do we have a
@@ -37,7 +36,7 @@ tree. It is easy and intuitive to read from and write to a
3736filesystem tree.
3837
3938Second, Clay has a distributed revision-control system baked into
40−it. Traditional filesystems are not revision controlled, so
39+it. Traditional filesystems are not revision controlled, so
4140userspace software -- such as git -- is written on top of them to
4241do so. Clay natively provides the same functionality as modern
4342DVCSes, and more.
@@ -47,25 +46,25 @@ it supports typed data and is referentially transparent.
4746
4847### Revision Control
4948
50−Every urbit has one or more `desk`s, which are independently
51−revision-controlled branches. Each `desk` contains its own `mark`
49+Every urbit has one or more desks, which are independently
50+revision-controlled branches. Each desk contains its own `mark`
5251definitions, apps, and so forth.
5352
54−Traditionally, an urbit has at least a `%home` `desk` and `%kids` `desk`. The
55−`%home` `desk` has all the system software from the distribution, along with your
56−personal files. The `%home` `desk` is a fork of the `%kids` desk of whichever ship
57−you download [OTAs](/docs/glossary/ota-updates) from - typically your sponsor,
58−but theoretically may be any ship. You will also find references to a `%base`
59−`desk` - which is not a real `desk`, rather it just a hash associated to the
60−`desk` from which your `%home` `desk` was forked.
53+Traditionally, an Urbit ship has at least a `%base` desk, and usually
54+`%garden` and `%landscape` desks. The `%base` desk has the kernel and
55+base system software. The `%garden` desk has software pertaining to
56+the home screen. The `%landscape` desk contains software for the
57+Groups app. The `%base` desk is a fork of the `%base` desk of
58+whichever ship you download system updates from - typically your
59+sponsor, but theoretically may be any ship.
6160
62−A `desk` is a series of numbered commits, the most recent of which
63−represents the current state of the `desk`. A commit is composed of
61+A desk is a series of numbered commits, the most recent of which
62+represents the current state of the desk. A commit is composed of
6463(1) an absolute time when it was created, (2) a list of zero or
6564more parents, and (3) a map from paths to data.
6665
6766Most commits have exactly one parent, but the initial commit on a
68−`desk` may have zero parents, and merge commits have more than one
67+desk may have zero parents, and merge commits have more than one
6968parent.
7069
7170The non-metadata is stored as a `map` of `path`s to data. It's
@@ -88,10 +87,10 @@ only on the data within and not on whether or not it's stored
8887directly, so we may on occasion rearrange the contents of the
8988blob store for performance reasons.
9089
91−Recall that a `desk` is a series of numbered commits. Not every
92−commit in a `desk` must be numbered. For example, if the base `desk`
93−has had 50 commits since home was forked from it, then a merge
94−from base to home will only add a single revision number to home,
90+Recall that a desk is a series of numbered commits. Not every
91+commit in a desk must be numbered. For example, if the `%base` desk
92+has had 50 commits since `%foo` was forked from it, then a merge
93+from `%base` to `%foo` will only add a single revision number to home,
9594although the full commit history will be accessible by traversing
9695the parentage of the individual commits.
9796
@@ -101,25 +100,25 @@ the topmost commit is always numbered, and every numbered commit
101100is an ancestor of every later numbered commit.
102101
103102There are three ways to refer to particular commits in the
104−revision history. Firstly, one can use the revision number.
103+revision history. Firstly, one can use the revision number.
105104Secondly, one can use any absolute time between the one numbered
106105commit and the next (inclusive of the first, exclusive of the
107−second). Thirdly, every `desk` has a `map` of labels to revision
106+second). Thirdly, every desk has a `map` of labels to revision
108107numbers. These labels may be used to refer to specific commits.
109108
110109Additionally, Clay is a global filesystem, so data on other urbits
111−is easily accessible the same way as data on our local urbit. In
112−general, the path to a particular revision of a `desk` is
113−`/~urbit-name/desk-name/revision`. Thus, to get `/try/readme/md`
114−from revision 5 of the home `desk` on `~sampel-sipnym`, we refer to
115−`/~sampel-sipnym/home/5/try/readme/md`. Clay's namespace is thus
110+is easily accessible the same way as data on our local urbit. In
111+general, the path to a particular revision of a desk is
112+`/~urbit-name/desk-name/revision`. Thus, to get `/try/readme/md`
113+from revision 5 of the `%base` desk on `~sampel-sipnym`, we refer to
114+`/~sampel-sipnym/base/5/try/readme/md`. Clay's namespace is thus
116115global and referentially transparent.
117116
118117### A Typed Filesystem
119118
120119Since Clay is a general filesystem for storing data of arbitrary
121120types, in order to revision control correctly it needs to be
122−aware of types all the way through. Traditional revision control
121+aware of types all the way through. Traditional revision control
123122does an excellent job of handling source code, so for source code
124123we act very similar to traditional revision control. The
125124challenge is to handle other data similarly well.
@@ -145,7 +144,7 @@ branches and merged at will.
145144Suppose Alice is tasked with touching up a picture, improving the
146145color balance, adjusting the contrast, and so forth, while Bob
147146has the job of cropping the picture to fit where it's needed and
148−adding textual overlay. Without type-aware revision control,
147+adding textual overlay. Without type-aware revision control,
149148these changes must be made serially, requiring Alice and Bob to
150149explicitly coordinate their efforts. With type-aware revision
151150control, these operations may be performed in parallel, and then
@@ -168,87 +167,11 @@ different sentences may be flagged as a conflict. In general,
168167prose should be diffed by sentence, not by line.
169168
170169As far as we are aware, Clay is the first generalized,
171−type-aware revision control system. We'll go into the workings
170+type-aware revision control system. We'll go into the workings
172171of this system in some detail.
173172
174173### Marks
175174
176−Central to a typed filesystem is the idea of types. In Clay, we
177−call these `mark`s. A `mark` is a file that defines a type,
178−conversion routines to and from the `mark`, and diff, patch, and
179−merge routines.
180−
181−For example, a `%txt` mark may be a list of lines of text, and it
182−may include conversions to `%mime` to allow it to be serialized
183−and sent to a browser or to the Unix filesystem. It will also
184−include Hunt-McIlroy diff, patch, and merge algorithms.
185−
186−A `%json` `mark` would be defined as a JSON object in the code, and
187−it would have a parser to convert from `%txt` and a printer to
188−convert back to `%txt`. The diff, patch, and merge algorithms are
189−fairly straightforward for JSON, though they're very different
190−from the text ones.
191−
192−More formally, a `mark` is a core with three [arms](/docs/glossary/arm/): `+grab`,
193−`+grow`, and `+grad`. In `+grab` is a series of functions to
194−convert from other `mark`s to the given `mark`. In `+grow` is a
195−series of functions to convert from the given `mark` to other
196−`mark`s. In `+grad` is `+diff`, `+pact`, `+join`, and `+mash`, and
197−`+form`.
198−
199−The types are as follows, in an informal pseudocode:
200−
201−```
202− ++ grab:
203− ++ mime: <mime> -> <mark-type>
204− ++ txt: <txt> -> <mark-type>
205− ...
206− ++ grow:
207− ++ mime: <mark-type> -> <mime>
208− ++ txt: <mark-type> -> <txt>
209− ...
210− ++ grad
211− ++ form: <mark-type>
212− ++ diff: (<mark-type>, <mark-type>) -> <diff-type>
213− ++ pact: (<mark-type>, <diff-type>) -> <mark-type>
214− ++ join: (<diff-type>, <diff-type>) -> <diff-type> or NULL
215− ++ mash: (<diff-type>, <diff-type>) -> <diff-type>
216−```
217−
218−These types are basically what you would expect. Not every `mark`
219−has each of these functions defined -- all of them are optional
220−in the general case.
221−
222−In general, for a particular `mark`, the `+grab` and `+grow` entries
223−(if they exist) should be inverses of each other.
224−
225−In `+grad`, `+diff` takes two instances of a `mark` and produces a diff of them
226−whose `mark` is given by `+form`. `+pact` takes an instance of a `mark` and
227−patches it with the given diff. `+join` takes two diffs and attempts to merge
228−them into a single diff. If there are conflicts, it produces null. `+mash` takes
229−two diffs and forces a merge, annotating any conflicts.
230−
231−In general, if `+diff` called with A and B produces diff D, then
232−`+pact` called with A and D should produce B. Also, if `+join`
233−of two diffs does not produce null, then `+mash` of the same
234−diffs should produce the same result.
235−
236−Alternately, instead of `+diff`, `+pact`, `+join`, and
237−`+mash`, a `mark` can provide the same functionality by defining
238−`+grad` to be the name of another `mark` to which we wish to
239−delegate the revision control responsibilities. Then, before
240−running any of those functions, Clay will convert to the other
241−`mark`, and convert back afterward. For example, the `%hoon` `mark`
242−is revision-controlled in the same way as `%txt`, so its `+grad`
243−is simply `++ grad %txt`. Of course, `+txt` must be defined in
244−`+grow` and `+grab` as well.
245−
246−Every file in Clay has a `mark`, and that `mark` must have a
247−fully-functioning `+grad`. `Mark`s are used for more than just
248−Clay, and other `mark`s don't need a `+grad`, but if a piece of
249−data is to be saved to Clay, we must know how to revision-control
250−it.
251−
252−Additionally, if a file is to be synced out to Unix, then it must
253−have conversion routines to and from the `%mime` `mark`.
254−
175+Central to a typed filesystem is the idea of file types. In Clay, we
176+call these `mark`s. See the [Marks](/docs/arvo/clay/marks/marks)
177+section for more details.
content/docs/arvo/clay/clay.md+4−1
@@ -5,7 +5,6 @@ template = "doc.html"
55aliases = ["/docs/learn/arvo/clay/"]
66+++
77
8−
98Our filesystem.
109
1110`%clay` is version-controlled, referentially-transparent, and global.
@@ -56,3 +55,7 @@ Details of the various `task`s you can use to interact with Clay.
5655[Examples](/docs/arvo/clay/examples)
5756
5857Example usage of the various Clay `task`s.
58+
59+[Marks](/docs/arvo/clay/marks/marks)
60+
61+Details of `mark`s as well as a guide to writing them and their usage.
content/docs/arvo/clay/data-types.md+2−9
@@ -68,7 +68,6 @@ to th pier) and `beam` is a domestic Clay directory.
6868
6969`pud` is an update that's waiting on a kernel upgrade.
7070
71−
7271#### `$room`, filesystem per domestic ship
7372
7473```hoon
@@ -93,8 +92,7 @@ set of `desk`s on this ship, mapped to their `desk` state.
9392+$ desk @tas
9493```
9594
96−This is the name of a branch of the filesystem. The default `desk`s are `%home`
97−and `%kids`. More may be created by simply referencing them. `desk`s have
95+This is the name of a branch of the filesystem. The default `desk`s are `%base`, `%garden`, `%landscape`, `%webterm` and `%bitcoin`. Desks have
9896independent histories and states, and they may be
9997[merged](/docs/arvo/clay/using#merging) into each other.
10098
@@ -167,7 +165,6 @@ Like a `rave` but with provisions to store current versions for `%next` and `%ma
167165Generally used when we store a request in our state somewhere. This is so that
168166we can determine whether new versions actually affect the path we're subscribed to.
169167
170−
171168#### `$mood:clay`, single subscription request
172169
173170```hoon
@@ -194,7 +191,6 @@ any of its children.
194191 +$ care ?(%a %b %c %d %e %f %p %r %s %t %u %v %w %x %y %z) :: clay submode
195192```
196193
197−
198194This specifies what type of information is requested in a subscription
199195or a scry.
200196
@@ -258,7 +254,6 @@ contents while `q.fil` is the data itself.
258254this is empty. The keys are the names of the children and the values
259255are, recursively, the nodes themselves.
260256
261−
262257### `$arch`, shallow filesystem node
263258
264259```hoon
@@ -275,6 +270,7 @@ those directories.
275270The child directories are given by a `map` to null rather than a `set` so that the
276271ordering of the `map` will be the same as it is for an `axal`, allowing
277272efficient conversion for when the heavier node is needed.
273+
278274```hoon
279275++ axal
280276 |$ [item]
@@ -400,7 +396,6 @@ is all the subscribers from our ship to the foreign `desk`.
400396`regs` are `(map path rule)`, and so `per` is a `map` of read permissions by
401397`path` and `pew` is a `map` of write permissions by `path`.
402398
403−
404399#### `$rind`, foreign request manager
405400
406401```hoon
@@ -547,7 +542,6 @@ blob, and `r` is the delta.
547542`%direct` is the case where we simply have the data directly. `q` is the data.
548543These almost always come from the creation of a file.
549544
550−
551545#### `+urge`, list change
552546
553547```hoon
@@ -685,4 +679,3 @@ commit itself.
685679revision number, whichever is smaller.
686680
687681`lar` is the set of new commits, and `bar` is the set of new content.
688−
content/docs/arvo/clay/examples.md+125−160
@@ -4,41 +4,9 @@ weight = 7
44template = "doc.html"
55+++
66
7−# Contents
8−
9−- [Introduction](#introduction)
10−- [%warp](#warp) - Read and Subscribe.
11− - [%sing](#sing) - Read a file or directory.
12− - [%next](#next) - Subscribe for the next change to a file or directory.
13− - [%mult](#mult) - Subscribe for the next change to a set of files and/or directories.
14− - [%many](#many) - Track changes to a `desk` for the specified range of revisions.
15− - [Cancel Subscription](#cancel-subscription)
16−- [%info](#info) - Write and Modify.
17− - [%ins](#ins) - Add a file.
18− - [%del](#del) - Delete a file.
19− - [%mut](#mut) - Change a file.
20− - [Multiple Changes](#multiple-changes) - Change multiple files.
21−- [Manage Mounts](#manage-mounts)
22− - [%boat](#boat) - List mounts.
23− - [%mont](#mont) - Mount something.
24− - [%ogre](#ogre) - Unmount something.
25− - [%dirk](#dirk) - Commit changes.
26−- [Merge Desks](#merge-desks)
27− - [%merg](#merg)
28−- [Permissions](#permissions)
29− - [%perm](#perm) - Set file permissions.
30− - [%cred](#cred) - Add permission group.
31− - [%crew](#crew) - Get permission groups.
32− - [%crow](#crow) - Get group usage.
33−- [Foreign Ships](#foreign-ships)
34− - [%warp](#warp-remote) - Read a file on a foreign ship.
35− - [%merg](#merg-remote) - Merge from a foreign `desk`.
36−
37−# Introduction
38−
397This document contains a number of examples of interacting with Clay using its various `task`s. Sections correspond to the general details in the [API Reference](/docs/arvo/clay/tasks) document.
408
41−Most examples will either use `|pass` to just send a `task` or the following thread to send a `task` and take the resulting `gift`. You can save the following thread to the `ted` directory of your `%home` `desk`:
9+Most examples will either use `|pass` to just send a `task` or the following thread to send a `task` and take the resulting `gift`. You can save the following thread to the `ted` directory of the `%base` `desk` on a fake ship:
4210
4311`send-task-take-gift.hoon`
4412
@@ -61,18 +29,18 @@ Most examples will either use `|pass` to just send a `task` or the following thr
6129(pure:m !>(~))
6230```
6331
64−# `%warp`
32+## `%warp`
6533
6634See the [Read and Subscribe](/docs/arvo/clay/tasks#warp---read-and-track) section of the [API Reference](/docs/arvo/clay/tasks) document for general details.
6735
68−## `%sing`
36+### `%sing`
6937
7038Here we'll look at reading files by passing Clay a `%warp` `task` with a `%sing` `rave` and receiving a `%writ` `gift` containing the data in response.
7139
7240Using the `send-task-take-gift.hoon` thread, let's try reading `gen/hood/hi.hoon`:
7341
7442```
75−> -send-task-take-gift [%warp our %home ~ %sing %x da+now /gen/hood/hi/hoon]
43+> -send-task-take-gift [%warp our %base ~ %sing %x da+now /gen/hood/hi/hoon]
7644```
7745
7846You should see something like this as the output:
@@ -81,7 +49,7 @@ You should see something like this as the output:
8149[ %writ
8250 p
8351 [ ~
84− [ p=[p=%x q=[%da p=~2021.5.20..23.37.50..e79b] r=%home]
52+ [ p=[p=%x q=[%da p=~2021.5.20..23.37.50..e79b] r=%base]
8553 q=/gen/hood/hi/hoon
8654 r
8755 [ p=%hoon
@@ -99,11 +67,11 @@ You should see something like this as the output:
9967The `cage` in the `riot` of the `%writ` contains the file's data due to our use of an `%x` `care`. It needn't be `%x` though. If we change it to `%u`, for example, we'll get a `?` `cage` instead:
10068
10169```
102−> -send-task-take-gift [%warp our %home ~ %sing %x da+now /gen/hood/hi/hoon]
70+> -send-task-take-gift [%warp our %base ~ %sing %x da+now /gen/hood/hi/hoon]
10371[ %writ
10472 p
10573 [ ~
106− [ p=[p=%u q=[%da p=~2021.5.20..23.42.21..bb33] r=%home]
74+ [ p=[p=%u q=[%da p=~2021.5.20..23.42.21..bb33] r=%base]
10775 q=/gen/hood/hi/hoon
10876 r=[p=%flag q=[#t/?(%.y %.n) q=0]]
10977 ]
@@ -115,34 +83,34 @@ Here's a breakdown of the `task` we sent:
11583
11684![%sing diagram](https://media.urbit.org/docs/arvo/clay/sing.png "%sing diagram")
11785
118−## `%next`
86+### `%next`
11987
12088Here we'll look at subscribing to the next version of a file by passing Clay a `%warp` `task` with a `%next` `rave` and receiving a `%writ` `gift` when the file changes.
12189
12290Using the `send-task-take-gift.hoon` thread, let's subscribe to the next version of `foo.txt`:
12391
12492```
125−> -send-task-take-gift [%warp our %home ~ %next %x da+now /foo/txt]
93+> -send-task-take-gift [%warp our %base ~ %next %x da+now /foo/txt]
12694```
12795
128−Now, in unix, create a file called `foo.txt` in the root of the `home` directory of your ship. In the dojo, hit backspace to disconnect the thread from the dojo prompt and run `|commit %home`. You should see something like:
96+Now, in unix, create a file called `foo.txt` in the root of the `base` directory of your ship. In the dojo, hit backspace to disconnect the thread from the dojo prompt and run `|commit %base`. You should see something like:
12997
13098```
131−> |commit %home
99+> |commit %base
132100>=
133−[%writ p=[~ [p=[p=%x q=[%ud p=3] r=%home] q=/foo/txt r=[p=%txt q=[#t/*'' q=0]]]]]
134−+ /~zod/home/3/foo/txt
101+[%writ p=[~ [p=[p=%x q=[%ud p=3] r=%base] q=/foo/txt r=[p=%txt q=[#t/*'' q=0]]]]]
102++ /~zod/base/3/foo/txt
135103```
136104
137105As you can see, the `riot` in the `%writ` includes a `cage` with the data of `/foo/txt` due to our use of an `%x` `care`.
138106
139−Now run the thread again, and this time delete the file in unix and again `|commit %home` in the dojo. You should see:
107+Now run the thread again, and this time delete the file in unix and again `|commit %base` in the dojo. You should see:
140108
141109```
142−> |commit %home
110+> |commit %base
143111>=
144112[%writ p=~]
145−- /~zod/home/4/foo/txt
113+- /~zod/base/4/foo/txt
146114```
147115
148116You can see the `riot` is just `~` due to the file being deleted.
@@ -151,7 +119,7 @@ Here's a breakdown of the task we sent:
151119
152120![%next diagram](https://media.urbit.org/docs/arvo/clay/next.png "%next diagram")
153121
154−## `%mult`
122+### `%mult`
155123
156124Here we'll look at subscribing to the next version of multiple files by passing Clay a `%warp` `task` with a `%mult` `rave` and receiving a `%wris` `gift` when any of the files change.
157125
@@ -173,7 +141,7 @@ This thread will subscribe to `/foo/txt` with an `%x` `care` and `/bar/txt` with
173141 [%u /bar/txt]
174142 ==
175143;< =bowl:strand bind:m get-bowl:strandio
176−=/ =task:clay [%warp our.bowl %home ~ %mult da+now.bowl files]
144+=/ =task:clay [%warp our.bowl %base ~ %mult da+now.bowl files]
177145=/ =card:agent:gall [%pass /mult %arvo %c task]
178146;< ~ bind:m (send-raw-card:strandio card)
179147;< response=(pair wire sign-arvo) bind:m take-sign-arvo:strandio
@@ -181,27 +149,27 @@ This thread will subscribe to `/foo/txt` with an `%x` `care` and `/bar/txt` with
181149(pure:m !>(~))
182150```
183151
184−Save the above to `ted/sub-mult.hoon`, `|commit %home` and run with `-sub-mult`. Now, create `foo.txt` and `bar.txt` in your home directory, hit backspace in the dojo to disconnect the thread and run `|commit %home`. You should see something like:
152+Save the above to `ted/sub-mult.hoon`, `|commit %base` and run with `-sub-mult`. Now, create `foo.txt` and `bar.txt` in your base directory, hit backspace in the dojo to disconnect the thread and run `|commit %base`. You should see something like:
185153
186154```
187−> |commit %home
155+> |commit %base
188156>=
189157[%wris p=[%da p=~2021.4.27..06.07.08..5ec4] q={[p=%u q=/bar/txt] [p=%x q=/foo/txt]}]
190−+ /~zod/home/151/foo/txt
191−+ /~zod/home/151/bar/txt
158++ /~zod/base/151/foo/txt
159++ /~zod/base/151/bar/txt
192160```
193161
194162You'll notice that, unlike a `%writ`, the `%wris` doesn't give you the data. It merely tells you the `care`s and `path`s of the files that changed. If you need to actually get the data, you can just scry or send a request for the files in question.
195163
196−Now, run the thread again, open `bar.txt` in an editor, modify its contents, save it and `|commit %home`. You'll notice you didn't receive a `%wris`. This is because we subscribed to `/bar/txt` with `%u` care and its existence didn't change.
164+Now, run the thread again, open `bar.txt` in an editor, modify its contents, save it and `|commit %base`. You'll notice you didn't receive a `%wris`. This is because we subscribed to `/bar/txt` with `%u` care and its existence didn't change.
197165
198−Lastly, delete `foo.txt` and `|commit %home`. You should see something like:
166+Lastly, delete `foo.txt` and `|commit %base`. You should see something like:
199167
200168```
201−> |commit %home
169+> |commit %base
202170>=
203171[%wris p=[%da p=~2021.4.27..06.15.03..0da4] q={[p=%x q=/foo/txt]}]
204−- /~zod/home/153/foo/txt
172+- /~zod/base/153/foo/txt
205173```
206174
207175As you can see, a relevant change to any of the subscribed files will trigger a response, not just when all of them change.
@@ -210,11 +178,11 @@ Here's a breakdown of the `task` we sent:
210178
211179![subscribe mult diagram](https://media.urbit.org/docs/arvo/clay/sub-mult.png "subscribe mult diagram")
212180
213−## `%many`
181+### `%many`
214182
215183Here we'll look at subscribing to a range of changes to a `desk` by passing Clay a `%warp` `task` with a `%many` `rave` and receiving `%writ` `gift`s when changes occur.
216184
217−This thread will subscribe to changes to your `%home` `desk` for the next three minutes. The `track` is `%.y` so it will only inform you of changes, not send the full `nako`. It will only get updates if the specified file exists. It contains a `main-loop` that will take an arbitrary number of `sign`s and print them out in the dojo. Since it never ends, you'll need to stop it with the `:spider|kill` command in the dojo.
185+This thread will subscribe to changes to your `%base` `desk` for the next three minutes. The `track` is `%.y` so it will only inform you of changes, not send the full `nako`. It will only get updates if the specified file exists. It contains a `main-loop` that will take an arbitrary number of `sign`s and print them out in the dojo. Since it never ends, you'll need to stop it with the `:spider|kill` command in the dojo.
218186
219187`sub-many.hoon`
220188
@@ -245,30 +213,30 @@ This thread will subscribe to changes to your `%home` `desk` for the next three
245213 (strand-fail:strand %no-arg ~)
246214=/ =path u.uarg
247215;< =bowl:strand bind:m get-bowl:strandio
248−=/ =task:clay [%warp our.bowl %home ~ %many %.y da+now.bowl da+(add ~m3 now.bowl) path]
216+=/ =task:clay [%warp our.bowl %base ~ %many %.y da+now.bowl da+(add ~m3 now.bowl) path]
249217=/ =card:agent:gall [%pass /many %arvo %c task]
250218;< ~ bind:m (send-raw-card:strandio card)
251219;< ~ bind:m take-sign-loop
252220(pure:m !>(~))
253221```
254222
255−Make sure `foo.txt` doesn't exist in the root of your `%home` `desk`. Save this to `ted/sub-many.hoon`, `|commit %home`, run it like `-sub-many /foo/txt`, and hit backspace in the dojo to free up the dojo prompt. Now, add a file called `bar.txt` to your `desk` and `|commit %home`. You should see something like:
223+Make sure `foo.txt` doesn't exist in the root of your `%base` `desk`. Save this to `ted/sub-many.hoon`, `|commit %base`, run it like `-sub-many /foo/txt`, and hit backspace in the dojo to free up the dojo prompt. Now, add a file called `bar.txt` to your `desk` and `|commit %base`. You should see something like:
256224
257225```
258−> |commit %home
226+> |commit %base
259227>=
260−+ /~zod/home/260/bar/txt
228++ /~zod/base/260/bar/txt
261229```
262230
263−Notice you've received no `%writ` from Clay. This is because `/foo/txt` doesn't exist. Now, create `foo.txt` and `|commit %home` again. You should see:
231+Notice you've received no `%writ` from Clay. This is because `/foo/txt` doesn't exist. Now, create `foo.txt` and `|commit %base` again. You should see:
264232
265233```
266−> |commit %home
234+> |commit %base
267235>=
268236[ p=/many
269− q=[%clay [%writ p=[~ [p=[p=%w q=[%ud p=261] r=%home] q=/ r=[p=%null q=[#t/@n q=0]]]]]]
237+ q=[%clay [%writ p=[~ [p=[p=%w q=[%ud p=261] r=%base] q=/ r=[p=%null q=[#t/@n q=0]]]]]]
270238]
271−+ /~zod/home/261/foo/txt
239++ /~zod/base/261/foo/txt
272240```
273241
274242Now that `/foo/txt` exists it will inform you of updates. Note that if you delete `/foo/txt` again it will again stop sending updates.
@@ -276,24 +244,24 @@ Now that `/foo/txt` exists it will inform you of updates. Note that if you delet
276244Now try adding `baz.txt`:
277245
278246```
279−> |commit %home
247+> |commit %base
280248>=
281249[ p=/many
282− q=[%clay [%writ p=[~ [p=[p=%w q=[%ud p=262] r=%home] q=/ r=[p=%null q=[#t/@n q=0]]]]]]
250+ q=[%clay [%writ p=[~ [p=[p=%w q=[%ud p=262] r=%base] q=/ r=[p=%null q=[#t/@n q=0]]]]]]
283251]
284−+ /~zod/home/262/baz/txt
252++ /~zod/base/262/baz/txt
285253```
286254
287255Now wait until the three minutes is up and try making a change, for example deleting `baz.txt`:
288256
289257```
290−> |commit %home
258+> |commit %base
291259>=
292260[ p=/many
293− q=[%clay [%writ p=[~ [p=[p=%w q=[%ud p=264] r=%home] q=/ r=[p=%null q=[#t/@n q=0]]]]]]
261+ q=[%clay [%writ p=[~ [p=[p=%w q=[%ud p=264] r=%base] q=/ r=[p=%null q=[#t/@n q=0]]]]]]
294262]
295263[p=/many q=[%clay [%writ p=~]]]
296−- /~zod/home/263/baz/txt
264+- /~zod/base/263/baz/txt
297265```
298266
299267You can see that along with the normal `%writ` it's also sent a second `%writ` with a null `riot` to indicate the subscription has ended. This is because it has now passed the end of the range of `case`s to which you subscribed.
@@ -304,7 +272,7 @@ Here's a breakdown of the `task` we sent:
304272
305273![subscribe many diagram](https://media.urbit.org/docs/arvo/clay/sub-many.png "subscribe many diagram")
306274
307−## Cancel Subscription
275+### Cancel Subscription
308276
309277Here we'll look at cancelling a subscription by sending Clay a `%warp` `task` with a null `(unit rave)` in the `riff`.
310278
@@ -321,10 +289,10 @@ This thread will subscribe to the `%next` version of `/foo/txt`, then immediatel
321289=/ m (strand ,vase)
322290^- form:m
323291;< =bowl:strand bind:m get-bowl:strandio
324−=/ =task:clay [%warp our.bowl %home ~ %next %x da+now.bowl /foo/txt]
292+=/ =task:clay [%warp our.bowl %base ~ %next %x da+now.bowl /foo/txt]
325293=/ =card:agent:gall [%pass /next %arvo %c task]
326294;< ~ bind:m (send-raw-card:strandio card)
327−=. task [%warp our.bowl %home ~]
295+=. task [%warp our.bowl %base ~]
328296=. card [%pass /next %arvo %c task]
329297;< ~ bind:m (send-raw-card:strandio card)
330298;< =riot:clay bind:m (take-writ:strandio /next)
@@ -332,12 +300,12 @@ This thread will subscribe to the `%next` version of `/foo/txt`, then immediatel
332300(pure:m !>(~))
333301```
334302
335−Save the above to `ted/stop-sub.hoon`, `|commit %home`, run it with `-stop-sub` and hit backspace to detach it from the dojo prompt. Now, add `foo.txt` to the root of your `%home` `desk` and `|commit %home`. You should see:
303+Save the above to `ted/stop-sub.hoon`, `|commit %base`, run it with `-stop-sub` and hit backspace to detach it from the dojo prompt. Now, add `foo.txt` to the root of your `%base` `desk` and `|commit %base`. You should see:
336304
337305```
338−> |commit %home
306+> |commit %base
339307>=
340−+ /~zod/home/266/foo/txt
308++ /~zod/base/266/foo/txt
341309```
342310
343311As you can see we've received no `%writ`. We can thus conclude the subscription has successfully been cancelled.
@@ -348,22 +316,22 @@ Here's a breakdown of the `task` we sent:
348316
349317![cancel subscription diagram](https://media.urbit.org/docs/arvo/clay/stop-sub.png "cancel subscription diagram")
350318
351−# `%info`
319+## `%info`
352320
353321See the [Write and Modify](/docs/arvo/clay/tasks#write-and-modify) section of the [API Reference](/docs/arvo/clay/tasks) document for general details.
354322
355−## `%ins`
323+### `%ins`
356324
357325Here we'll look at adding a file by sending Clay a `%info` `task` containing a `%ins` `miso`.
358326
359327Let's try adding a `foo.txt` file with 'foo' as its contents:
360328
361329```
362−> |pass [%c [%info %home %& [/foo/txt %ins %txt !>(~['foo'])]~]]
363−+ /~zod/home/5/foo/txt
330+> |pass [%c [%info %base %& [/foo/txt %ins %txt !>(~['foo'])]~]]
331++ /~zod/base/5/foo/txt
364332```
365333
366−If you have a look in the home of your pier you'll see there's now a file called `foo.txt` with the text `foo` in it.
334+If you have a look in the base of your pier you'll see there's now a file called `foo.txt` with the text `foo` in it.
367335
368336We've created the `cage` of the content like `[%txt !>(~['foo'])]`, if you want to write something besides a text file you'd just give it the appropriate `mark` and `vase`.
369337
@@ -371,28 +339,28 @@ Here's a breakdown of the `task` we sent:
371339
372340![%ins diagram](https://media.urbit.org/docs/arvo/clay/ins.png)
373341
374−## `%del`
342+### `%del`
375343
376344Here we'll look at deleting a file by sending Clay a `%info` `task` containing a `%del` `miso`.
377345
378346Let's try deleting the `foo.txt` file created in the [previous example](#ins):
379347
380348```
381−> |pass [%c [%info %home %& [/foo/txt %del ~]~]]
382−- /~zod/home/6/foo/txt
349+> |pass [%c [%info %base %& [/foo/txt %del ~]~]]
350+- /~zod/base/6/foo/txt
383351```
384352
385−If you have a look in the home of your pier you'll see the `foo.txt` file is now gone.
353+If you have a look in the base of your pier you'll see the `foo.txt` file is now gone.
386354
387355Here's a breakdown of the `task` we sent:
388356
389357![%del diagram](https://media.urbit.org/docs/arvo/clay/del.png)
390358
391−## `%mut`
359+### `%mut`
392360
393361Identical to the [%ins](#ins) example, just replace `%ins` with `%mut`.
394362
395−## Multiple Changes
363+### Multiple Changes
396364
397365Here we'll look at changing multiple files in one request by sending Clay a `%info` `task` containing multiple `miso` in the `soba`.
398366
@@ -416,28 +384,28 @@ Since `soba` is just a `list` of `miso`, you can add a bunch of `miso` and they'
416384 [/bar/txt %del ~]
417385 [/baz/txt %del ~]
418386 ==
419−;< ~ bind:m (send-raw-card:strandio [%pass /info %arvo %c %info %home %& soba-a])
420−;< ~ bind:m (send-raw-card:strandio [%pass /info %arvo %c %info %home %& soba-b])
387+;< ~ bind:m (send-raw-card:strandio [%pass /info %arvo %c %info %base %& soba-a])
388+;< ~ bind:m (send-raw-card:strandio [%pass /info %arvo %c %info %base %& soba-b])
421389(pure:m !>(~))
422390```
423391
424−Save to `ted/multi-change.hoon`, `|commit %home`, and run:
392+Save to `ted/multi-change.hoon`, `|commit %base`, and run:
425393
426394```
427395> -multi-change
428−+ /~zod/home/37/foo/txt
429−+ /~zod/home/37/bar/txt
430−+ /~zod/home/37/baz/txt
431−- /~zod/home/38/foo/txt
432−- /~zod/home/38/bar/txt
433−- /~zod/home/38/baz/txt
396++ /~zod/base/37/foo/txt
397++ /~zod/base/37/bar/txt
398++ /~zod/base/37/baz/txt
399+- /~zod/base/38/foo/txt
400+- /~zod/base/38/bar/txt
401+- /~zod/base/38/baz/txt
434402```
435403
436−# Manage Mounts
404+## Manage Mounts
437405
438406See the [Manage Mounts](/docs/arvo/clay/tasks#manage-mounts) section of the [API Reference](/docs/arvo/clay/tasks) document for general details.
439407
440−## `%boat`
408+### `%boat`
441409
442410Here we'll look at requesting the list of existing mount points on a ship by sending Clay a `%boat` `task` and receiving a `%hill` `gift`.
443411
@@ -445,56 +413,53 @@ Using the `send-task-take-gift.hoon` thread, let's make such a request:
445413
446414```
447415> -send-task-take-gift [%boat ~]
448−[%hill p=~[%home]]
416+[%hill p=~[%base]]
449417```
450418
451−## `%mont`
419+### `%mont`
452420
453421Here we'll look at mounting `desk`s, directories and files to unix by sending Clay a `%mont` `task`.
454422
455−Let's first try mounting our `%kids` desk:
423+Let's first try mounting our `%garden` desk:
456424
457425```
458−> |pass [%c [%mont %kids [our %kids da+now] /]]
426+> |pass [%c [%mont %garden [our %garden da+now] /]]
459427```
460428
461−If you look in your pier, you should now see a `kids` folder which contains the contents of that `desk`.
429+If you look in your pier, you should now see a `garden` folder which contains the contents of that `desk`.
462430
463431If we make a `%boat` request as detailed in the [%boat](#boat) section, we'll now see the mount point listed:
464432
465433```
466434> -send-task-take-gift [%boat ~]
467−[%hill p=~[%kids %home]]cruz gift. It looks like:
468−
469−[%cruz cez=(map @ta crew)] :: permission groups
470−The cez is just a map from group name to crew
435+[%hill p=~[%garden %base]]
471436```
472437
473438Note the mount point doesn't need to match a `desk`, file or directory. We can also do:
474439
475440```
476−> |pass [%c [%mont %wibbly-wobbly [our %home da+now] /]]
441+> |pass [%c [%mont %wibbly-wobbly [our %base da+now] /]]
477442```
478443
479−And you'll now see that there's a `wibbly-wobbly` folder with the contents of the `%home` `desk`. You'll also notice we can mount the same file or directory more than once. There's no problem having `%home` mounted to both `home` and `wibbly-wobbly`. The only requirement is that their mount points be unique.
444+And you'll now see that there's a `wibbly-wobbly` folder with the contents of the `%base` `desk`. You'll also notice we can mount the same file or directory more than once. There's no problem having `%base` mounted to both `base` and `wibbly-wobbly`. The only requirement is that their mount points be unique.
480445
481446Let's try mounting a subdirectory and a single folder:
482447
483448```
484−> |pass [%c [%mont %gen [our %home da+now] /gen]]
485−> |pass [%c [%mont %hi [our %home da+now] /gen/hood/hi]]
449+> |pass [%c [%mont %gen [our %base da+now] /gen]]
450+> |pass [%c [%mont %hi [our %base da+now] /gen/hood/hi]]
486451```
487452
488453If you look in your pier you'll now see a `gen` folder with the contents of `/gen` and a `hi.hoon` file by itself. Notice how the file extension has been automatically added.
489454
490−## `%ogre`
455+### `%ogre`
491456
492457Here we'll look at unmounting `desk`s, directories and files by sending Clay a `%ogre` `task`.
493458
494−Let's unmount what we mounted in the [%mont](#mont) section. First we'll unmount the `%kids` desk:
459+Let's unmount what we mounted in the [%mont](#mont) section. First we'll unmount the `%garden` desk:
495460
496461```
497−|pass [%c [%ogre %kids]]
462+|pass [%c [%ogre %garden]]
498463```
499464
500465Our custom mount point `%wibbly-wobbly`:
@@ -512,41 +477,41 @@ And the single `hi.hoon` we previously mounted by specifying its mount point `%h
512477If we specify a non-existent mount point it will fail with an error printed to the dojo like:
513478
514479```
515−> |pass [%c [%ogre %kids]]
516−[%not-mounted %kids]
480+> |pass [%c [%ogre %foo]]
481+[%not-mounted %foo]
517482```
518483
519484If we give it an unmounted `beam` it will not print an error but still won't work.
520485
521−## `%dirk`
486+### `%dirk`
522487
523488Here we'll look at committing changed files by sending Clay a `%dirk` `task`.
524489
525490This `task` performs the same function as the `|commit` dojo command.
526491
527−With your `%home` `desk` mounted, try adding a file and send a `%dirk` to commit the change:
492+With your `%base` `desk` mounted, try adding a file and send a `%dirk` to commit the change:
528493
529494```
530−> |pass [%c [%dirk %home]]
531−+ /~zod/home/12/foo/txt
495+> |pass [%c [%dirk %base]]
496++ /~zod/base/12/foo/txt
532497```
533498
534499Clay will print the changed files to the dojo with a leading `+`, `-` or `:` to indicate a new file, deleted file and changed file respectively.
535500
536501If you have the same `desk` mounted to multiple points, a committed change in one mount will also update the others.
537502
538−# Merge Desks
503+## Merge Desks
539504
540505See the [Merge Desks](/docs/arvo/clay/tasks#merge-desks) section of the [API Reference](/docs/arvo/clay/tasks) document for general details.
541506
542−## `%merg`
507+### `%merg`
543508
544509Here we'll look at merging `desk`s by sending Clay a `%merg` `task` and receiving a `%mere` `gift` in response.
545510
546511First, using the `send-task-take-gift.hoon` thread, let's try creating a new `desk`:
547512
548513```
549−> -send-task-take-gift [%merg %foo our %home da+now %init]
514+> -send-task-take-gift [%merg %foo our %base da+now %init]
550515[%mere p=[%.y p={}]]
551516```
552517
@@ -554,15 +519,15 @@ Now if we scry for our `desk`s we'll see `%foo` is there:
554519
555520```
556521> .^((set desk) %cd /===)
557−{%home %foo %kids}
522+{%bitcoin %base %landscape %webterm %garden %foo}
558523```
559524
560525Next, we'll create a merge conflict and try a couple of things. Mount `%foo` with `|mount /=foo=`, then add a `foo.txt` to both `desk`s but with different text in each and `|commit` them.
561526
562−Now we'll try merging `%home` into `%foo` with a `%mate` strategy:
527+Now we'll try merging `%base` into `%foo` with a `%mate` strategy:
563528
564529```
565−> -send-task-take-gift [%merg %foo our %home da+now %mate]
530+> -send-task-take-gift [%merg %foo our %base da+now %mate]
566531[ /foo
567532 [ %clay
568533 [ %mere
@@ -581,14 +546,14 @@ Now we'll try merging `%home` into `%foo` with a `%mate` strategy:
581546As you can see, the merge has failed. Let's try again with a `%meld` strategy:
582547
583548```
584−> -send-task-take-gift [%merg %foo our %home da+now %meld]
549+> -send-task-take-gift [%merg %foo our %base da+now %meld]
585550[/foo [%clay [%mere p=[%.y p={/foo/txt}]]]]
586551```
587552
588553Now the merge has succeeded and the `%mere` notes the file with a merge conflict. If we try with a `%only-that` strategy:
589554
590555```
591−> -send-task-take-gift [%merg %foo our %home da+now %only-that]
556+> -send-task-take-gift [%merg %foo our %base da+now %only-that]
592557[/foo [%clay [%mere p=[%.y p={}]]]]
593558: /~zod/foo/6/foo/txt
594559```
@@ -598,10 +563,10 @@ Now the merge has succeeded and the `%mere` notes the file with a merge conflict
598563Next, let's look at subscribing for future changes. Since the `case` is specified explicitly in the `%merge` `task`, we can set it in the future:
599564
600565```
601−> -send-task-take-gift [%merg %foo our %home da+(add ~m2 now) %only-that]
566+> -send-task-take-gift [%merg %foo our %base da+(add ~m2 now) %only-that]
602567```
603568
604−Now change the text in the `foo.txt` in the `%home` `desk`, hit backspace to detach the thread and `|commit %home`. After the two minutes pass you should see:
569+Now change the text in the `foo.txt` in the `%base` `desk`, hit backspace to detach the thread and `|commit %base`. After the two minutes pass you should see:
605570
606571```
607572[/foo [%clay [%mere p=[%.y p={}]]]]
@@ -610,18 +575,18 @@ Now change the text in the `foo.txt` in the `%home` `desk`, hit backspace to det
610575
611576You can also specify it by revision number or label.
612577
613−# Permissions
578+## Permissions
614579
615580See the [Permissions](/docs/arvo/clay/tasks#permissions) section of the [API Reference](/docs/arvo/clay/tasks) document for general details.
616581
617−## `%perm`
582+### `%perm`
618583
619584Here we'll look at setting permissions by sending Clay a `%perm` `task`.
620585
621586First, let's allow `~nes` to read `/gen/hood/hi/hoon`:
622587
623588```
624−> |pass [%c [%perm %home /gen/hood/hi/hoon %r ~ %white (sy [%.y ~nes]~)]]
589+> |pass [%c [%perm %base /gen/hood/hi/hoon %r ~ %white (sy [%.y ~nes]~)]]
625590```
626591
627592...and we'll do a `%p` scry to see that the permission was set:
@@ -634,7 +599,7 @@ First, let's allow `~nes` to read `/gen/hood/hi/hoon`:
634599You can see that `~nes` is now in the read whitelist. Next, let's try a write permission:
635600
636601```
637−> |pass [%c [%perm %home /ted %w ~ %white (sy [%.y ~nes]~)]]
602+> |pass [%c [%perm %base /ted %w ~ %white (sy [%.y ~nes]~)]]
638603```
639604
640605You can see `~nes` can now write to `/ted`:
@@ -656,7 +621,7 @@ Since we've set it for the whole `/ted` directory, if we check a file inside it
656621Now let's try setting both read and write permissions:
657622
658623```
659−> |pass [%c [%perm %home /gen/help/hoon %rw `[%black (sy [%.y ~nes]~)] `[%white (sy [%.y ~nes]~)]]]
624+> |pass [%c [%perm %base /gen/help/hoon %rw `[%black (sy [%.y ~nes]~)] `[%white (sy [%.y ~nes]~)]]]
660625```
661626
662627```
@@ -669,7 +634,7 @@ Lastly, let's look at deleting a permission rule we've previously set. To do tha
669634For example, to remove a read permission (or write if you specify `%w`):
670635
671636```
672−> |pass [%c [%perm %home /gen/help/hoon %r ~]]
637+> |pass [%c [%perm %base /gen/help/hoon %r ~]]
673638```
674639
675640```
@@ -680,7 +645,7 @@ For example, to remove a read permission (or write if you specify `%w`):
680645...and to remove both read and write at the same time:
681646
682647```
683−> |pass [%c [%perm %home /gen/help/hoon %rw ~ ~]]
648+> |pass [%c [%perm %base /gen/help/hoon %rw ~ ~]]
684649```
685650
686651```
@@ -694,7 +659,7 @@ Here's a breakdown of a `%perm` task:
694659
695660![perm diagram](https://media.urbit.org/docs/arvo/clay/perm-diagram.png)
696661
697−## `%cred`
662+### `%cred`
698663
699664Here we'll look at creating a permission group by sending Clay a `%cred` `task`.
700665
@@ -706,7 +671,7 @@ Let's create a group called `'foo'` with a few ships:
706671
707672We'll check it with the next kind of `task`: [%crew](#crew).
708673
709−## `%crew`
674+### `%crew`
710675
711676Here we'll look at retrieving permission groups by sending Clay a `%crew` `task` and receiving a `%cruz` `gift` in response.
712677
@@ -717,15 +682,15 @@ Let's check, using the `send-task-take-gift.hoon` thread, for the permission gro
717682[%cruz cez={[p=~.foo q={~nec ~bud ~wes ~zod ~sev}]}]
718683```
719684
720−## `%crow`
685+### `%crow`
721686
722687Here we'll look at retrieving a list of all files and directories in all `desk`s which have permissions set for a group by sending Clay a `%crow` `task` and receiving a `%croz` `gift` in response.
723688
724689First we'll set a couple of permissions for the `foo` group we created in the [%cred](#cred) section:
725690
726691```
727−> |pass [%c [%perm %home /gen/hood/hi/hoon %w ~ %white (sy [%.n 'foo']~)]]
728−> |pass [%c [%perm %home /ted %w ~ %white (sy [%.n 'foo']~)]]
692+> |pass [%c [%perm %base /gen/hood/hi/hoon %w ~ %white (sy [%.n 'foo']~)]]
693+> |pass [%c [%perm %base /ted %w ~ %white (sy [%.n 'foo']~)]]
729694```
730695
731696Notice we use a `%.n` in the `whom` to indicate a group rather than the `%.y` of a ship.
@@ -736,7 +701,7 @@ Now we'll use the `send-task-take-gift.hoon` thread to try `%crow`:
736701> -send-task-take-gift [%crow 'foo']
737702[ %croz
738703 rus
739− { [ p=%home
704+ { [ p=%base
740705 q
741706 [ r={}
742707 w
@@ -749,37 +714,37 @@ Now we'll use the `send-task-take-gift.hoon` thread to try `%crow`:
749714]
750715```
751716
752−# Foreign Ships
717+## Foreign Ships
753718
754719See the [Foreign Ships](/docs/arvo/clay/tasks#foreign-ships) section of the [API Reference](/docs/arvo/clay/tasks) document for general details.
755720
756−## `%warp` - Remote
721+### `%warp` - Remote
757722
758723Here we'll look at reading files on a foreign ship by sending Clay a `%warp` `task` with a foreign ship in the `wer` field and receiving a `%writ` `gift` in response.
759724
760−We'll use a fake ~nes as the the foreign ship and a fake ~zod as the local ship.
725+We'll use a fake `~nes` as the the foreign ship and a fake `~zod` as the local ship.
761726
762−First we'll set permissions on the foreign ship. Create a file called `foo.txt` in the `%home` of ~nes, then send a `%perm` request to allow ~zod to read and write the file:
727+First we'll set permissions on the foreign ship. Create a file called `foo.txt` in the `%base` of ~nes, then send a `%perm` request to allow ~zod to read and write the file:
763728
764729```
765−> |pass [%c [%perm %home /foo/txt %rw `[%white (sy [%.y ~zod]~)] `[%white (sy [%.y ~zod]~)]]]
730+> |pass [%c [%perm %base /foo/txt %rw `[%white (sy [%.y ~zod]~)] `[%white (sy [%.y ~zod]~)]]]
766731```
767732
768−If we scry the file for its permissions with a `%p` `care`, we'll see ~zod is now whitelisted:
733+If we scry the file for its permissions with a `%p` `care`, we'll see `~zod` is now whitelisted:
769734
770735```
771736> .^([r=dict:clay w=dict:clay] %cp /===/foo/txt)
772737[r=[src=/foo/txt rul=[mod=%white who=[p={~zod} q={}]]] w=[src=/foo/txt rul=[mod=%white who=[p={~zod} q={}]]]]
773738```
774739
775−Back on ~zod: Using the `send-task-take-gift.hoon` thread, send a `%x` read request for `/foo/txt` on ~nes like:
740+Back on `~zod`: Using the `send-task-take-gift.hoon` thread, send a `%x` read request for `/foo/txt` on ~nes like:
776741
777742```
778−> -send-task-take-gift [%warp ~nes %home ~ %sing %x da+now /foo/txt]
743+> -send-task-take-gift [%warp ~nes %base ~ %sing %x da+now /foo/txt]
779744[ %writ
780745 p
781746 [ ~
782− [ p=[p=%x q=[%da p=~2021.5.3..08.24.22..9ce7] r=%home]
747+ [ p=[p=%x q=[%da p=~2021.5.3..08.24.22..9ce7] r=%base]
783748 q=/foo/txt
784749 r=[p=%txt q=[#t/txt=*'' q=[7.303.014 0]]]
785750 ]
@@ -790,11 +755,11 @@ Back on ~zod: Using the `send-task-take-gift.hoon` thread, send a `%x` read requ
790755As you can see, we've received a `%writ` containing the requested data just as we would with a local request. Let's try a `%u`:
791756
792757```
793−> -send-task-take-gift [%warp ~nes %home ~ %sing %u da+now /foo/txt]
758+> -send-task-take-gift [%warp ~nes %base ~ %sing %u da+now /foo/txt]
794759[ %writ
795760 p
796761 [ ~
797− [ p=[p=%u q=[%da p=~2021.5.3..08.26.32..88cf] r=%home]
762+ [ p=[p=%u q=[%da p=~2021.5.3..08.26.32..88cf] r=%base]
798763 q=/foo/txt
799764 r=[p=%flag q=[#t/?(%.y %.n) q=0]]
800765 ]
@@ -805,7 +770,7 @@ As you can see, we've received a `%writ` containing the requested data just as w
805770If we send a `%d` request however, it will crash:
806771
807772```
808−> -send-task-take-gift [%warp ~nes %home ~ %sing %d da+now /foo/txt]
773+> -send-task-take-gift [%warp ~nes %base ~ %sing %d da+now /foo/txt]
809774call: failed
810775/sys/vane/clay/hoon:<[4.085 3].[4.314 5]>
811776...
@@ -816,7 +781,7 @@ call: failed
816781/sys/vane/clay/hoon:<[1.365 48].[1.365 50]>
817782```
818783
819−## `%merg` - Remote
784+### `%merg` - Remote
820785
821786To merge a foreign `desk` into a local one, you just send Clay a `%merg` `task` (as you would for a local merge) and specify the foreign ship in the `her` field. For an example, see the [%merg](#merg) section.
822787
content/docs/arvo/clay/marks/_index.mdnew file+23
@@ -0,0 +1,23 @@
1++++
2+title = "Marks"
3+weight = 10
4+sort_by = "weight"
5+template = "sections/docs/chapters.html"
6+insert_anchor_links = "right"
7++++
8+
9+[Overview](/docs/arvo/clay/marks/marks)
10+
11+Overview of `mark`s.
12+
13+[Writing Marks](/docs/arvo/clay/marks/writing-marks)
14+
15+A practical walk-through of writing a `mark` file.
16+
17+[Using Marks](/docs/arvo/clay/marks/using-marks)
18+
19+Details of using `mark` conversion gates and `mark` cores in your own code.
20+
21+[Examples](/docs/arvo/clay/marks/examples)
22+
23+The example code used in the Writing Marks guide.
content/docs/arvo/clay/marks/examples.mdnew file+248
@@ -0,0 +1,248 @@
1++++
2+title = "Examples"
3+weight = 4
4+template = "doc.html"
5++++
6+
7+These are the files used in the [Writing Marks](/docs/arvo/clay/marks/writing-marks) guide.
8+
9+## `/lib/csv/hoon`
10+
11+```hoon
12+|%
13+++ validate :: All rows same length?
14+ |= csv=(list (list @t))
15+ ^- ?
16+ =/ result
17+ %+ roll csv
18+ |= [row=(list @t) =flag ref=(unit @ud)]
19+ ?. flag
20+ [flag ref]
21+ ?~ ref
22+ [flag `(lent row)]
23+ ?. =(u.ref (lent row))
24+ [%.n ref]
25+ [flag ref]
26+ flag.result
27+++ en-csv :: csv -> atom (to mime)
28+ |= csv=(list (list @t))
29+ |^ ^- @t
30+ (cat 3 (crip (join '\0a' (turn csv en-row))) '\0a')
31+ ++ en-row :: encode row
32+ |= row=(list @t)
33+ ^- @t
34+ (crip (join ',' (turn row en-field)))
35+ ++ en-field :: encode field
36+ |= field=@t
37+ ^- @t
38+ %+ rash
39+ field
40+ %+ cook
41+ |= =tape
42+ ^- @t
43+ ?~ tape ''
44+ ?: =('"' i.tape)
45+ (cat 3 (crip tape) '"')
46+ (crip tape)
47+ ;~ pose
48+ (full (star ;~(less (mask "\",\0a\0d") next)))
49+ ;~ plug
50+ (easy '"')
51+ (star ;~(pose (cold '""' doq) next))
52+ ==
53+ ==
54+ --
55+++ de-csv :: atom -> csv (from mime)
56+ |= dat=@t
57+ |^ ^- (list (list @t))
58+ =/ parsed (parse dat)
59+ ?. (validate parsed)
60+ ~|(%mixed-col-count !!)
61+ parsed
62+ ++ parse :: parse cord
63+ |= dat=@t
64+ |^ ^- (list (list @t))
65+ %+ rash
66+ dat
67+ %+ most
68+ ;~(pose (jest '\0d\0a') (mask "\0a\0d"))
69+ (most com parse-field)
70+ ++ parse-field :: parse field from cord
71+ |^
72+ %+ cook
73+ |=(a=tape (crip a))
74+ ;~(pose unenclosed enclosed)
75+ ++ unenclosed :: unquoted field
76+ ;~ sfix
77+ (star ;~(less (mask "\",\0a\0d") next))
78+ ;~ pose
79+ ;~ plug
80+ ;~(pose (jest '\0d\0a') (mask "\0a\0d"))
81+ ;~(less next (easy ~))
82+ ==
83+ ;~(less doq (easy ~))
84+ ==
85+ ==
86+ ++ enclosed :: quoted field
87+ |^
88+ ;~ sfix
89+ (ifix [prefix suffix] content)
90+ ;~ pose
91+ ;~(simu (mask ",\0a\0d") (easy ~))
92+ ;~ plug
93+ ;~(pose (jest '\0d\0a') (mask "\0a\0d"))
94+ ;~(less next (easy ~))
95+ ==
96+ ;~(less next (easy ~))
97+ ==
98+ ==
99+ ++ content :: quoted field contents
100+ %- star
101+ ;~ pose
102+ (cold '"' (jest '""'))
103+ %+ cold '\0a'
104+ ;~(pose (jest '\0d\0a') (just '\0d'))
105+ ;~(less doq next)
106+ ==
107+ ++ prefix ;~(pose ;~(plug (star ace) doq) doq) :: quoted field prefix
108+ ++ suffix ;~(pose ;~(plug doq (star ace)) doq) :: quoted field suffix
109+ --
110+ --
111+ --
112+ --
113+++ csv-join
114+ |= [ali=(urge:clay (list @t)) bob=(urge:clay (list @t))]
115+ ^- (unit (urge:clay (list @t)))
116+ |^
117+ =. ali (clean ali)
118+ =. bob (clean bob)
119+ |- ^- (unit (urge:clay (list @t)))
120+ ?~ ali `bob
121+ ?~ bob `ali
122+ ?- -.i.ali
123+ %&
124+ ?- -.i.bob
125+ %&
126+ ?: =(p.i.ali p.i.bob)
127+ %+ bind $(ali t.ali, bob t.bob)
128+ |=(cud=(urge:clay (list @t)) [i.ali cud])
129+ ?: (gth p.i.ali p.i.bob)
130+ %+ bind $(p.i.ali (sub p.i.ali p.i.bob), bob t.bob)
131+ |=(cud=(urge:clay (list @t)) [i.bob cud])
132+ %+ bind $(ali t.ali, p.i.bob (sub p.i.bob p.i.ali))
133+ |=(cud=(urge:clay (list @t)) [i.ali cud])
134+ ::
135+ %|
136+ ?: =(p.i.ali (lent p.i.bob))
137+ %+ bind $(ali t.ali, bob t.bob)
138+ |=(cud=(urge:clay (list @t)) [i.bob cud])
139+ ?: (gth p.i.ali (lent p.i.bob))
140+ %+ bind $(p.i.ali (sub p.i.ali (lent p.i.bob)), bob t.bob)
141+ |=(cud=(urge:clay (list @t)) [i.bob cud])
142+ ~
143+ ==
144+ ::
145+ %|
146+ ?- -.i.bob
147+ %|
148+ ?. =(i.ali i.bob)
149+ ~
150+ %+ bind $(ali t.ali, bob t.bob)
151+ |=(cud=(urge:clay (list @t)) [i.ali cud])
152+ ::
153+ %&
154+ ?: =(p.i.bob (lent p.i.ali))
155+ %+ bind $(ali t.ali, bob t.bob)
156+ |=(cud=(urge:clay (list @t)) [i.ali cud])
157+ ?: (gth p.i.bob (lent p.i.ali))
158+ %+ bind $(ali t.ali, p.i.bob (sub p.i.bob (lent p.i.ali)))
159+ |=(cud=(urge:clay (list @t)) [i.ali cud])
160+ ~
161+ ==
162+ ==
163+ ++ clean :: clean
164+ |= wig=(urge:clay (list @t))
165+ ^- (urge:clay (list @t))
166+ ?~ wig ~
167+ ?~ t.wig wig
168+ ?: ?=(%& -.i.wig)
169+ ?: ?=(%& -.i.t.wig)
170+ $(wig [[%& (add p.i.wig p.i.t.wig)] t.t.wig])
171+ [i.wig $(wig t.wig)]
172+ ?: ?=(%| -.i.t.wig)
173+ $(wig [[%| (welp p.i.wig p.i.t.wig) (welp q.i.wig q.i.t.wig)] t.t.wig])
174+ [i.wig $(wig t.wig)]
175+ --
176+--
177+```
178+
179+## `/mar/csv/hoon`
180+
181+```hoon
182+/+ *csv
183+|_ csv=(list (list @t))
184+++ grab
185+ |%
186+ ++ mime |=((pair mite octs) (de-csv q.q))
187+ ++ noun
188+ |= n=*
189+ ^- (list (list @t))
190+ =/ result ((list (list @t)) n)
191+ ?> (validate result)
192+ result
193+ --
194+++ grow
195+ |%
196+ ++ mime
197+ ?> (validate csv)
198+ [/text/csv (as-octs:mimes:html (en-csv csv))]
199+ ++ noun
200+ ?> (validate csv)
201+ csv
202+ --
203+++ grad
204+ |%
205+ ++ form %csv-diff
206+ ++ diff
207+ |= bob=(list (list @t))
208+ ^- (urge:clay (list @t))
209+ ?> (validate csv)
210+ ?> (validate bob)
211+ (lusk:differ csv bob (loss:differ csv bob))
212+ ++ pact
213+ |= dif=(urge:clay (list @t))
214+ ^- (list (list @t))
215+ =/ result (lurk:differ csv dif)
216+ ?> (validate result)
217+ result
218+ ++ join
219+ |= $: ali=(urge:clay (list @t))
220+ bob=(urge:clay (list @t))
221+ ==
222+ ^- (unit (urge:clay (list @t)))
223+ (csv-join ali bob)
224+ ++ mash
225+ |= $: [ship desk (urge:clay (list @t))]
226+ [ship desk (urge:clay (list @t))]
227+ ==
228+ ^- (urge:clay (list @t))
229+ ~|(%csv-mash !!)
230+ --
231+--
232+```
233+
234+## `/mar/csv-diff/hoon`
235+
236+```hoon
237+|_ dif=(urge:clay (list @t))
238+++ grab
239+ |%
240+ ++ noun (urge:clay (list @t))
241+ --
242+++ grow
243+ |%
244+ ++ noun dif
245+ --
246+++ grad %noun
247+--
248+```
content/docs/arvo/clay/marks/marks.mdnew file+59
@@ -0,0 +1,59 @@
1++++
2+title = "Overview"
3+weight = 1
4+template = "doc.html"
5++++
6+
7+Clay is a typed filesystem, and we call these file types `mark`s. When talking about Hoon and Arvo we'll often talk of types like `@ud`, `(list @t)`, etc. A `mark` will specify such a type for its files, but it does more than just that - it also defines conversion routines to and from other `mark`s, as well as diff, patch, and merge routines.
8+
9+For example, a `%txt` `mark` defines the type of a `%txt` file as a `wain` (a `(list @t)`). It defines a conversion function to a `%mime` `mark` to allow it to be serialized and sent to a browser or to the Unix filesystem. It also includes Hunt-McIlroy diff, patch, and merge algorithms. Conversion functions will be different for different `mark`s, as will things like diff algorithms. An image file like a `%png`, for example, just replaces the old blob of data with the new one rather than implementing a complex binary diff and patch algorithm, so how these functions are implemented depends on the file type and use case.
10+
11+`mark` files are stored in the `/mar` directory. The `path` of the `%txt` `mark`, for example, is `/mar/txt/hoon`.
12+
13+A `mark` is a door (a core with a sample) with three arms: `+grab`, `+grow`, and `+grad`. The door's sample defines its type. In `+grab` is a series of functions to convert from other `mark`s to the given `mark`. In `+grow` is a series of functions to convert from the given `mark` to other `mark`s. In `+grad` is `+diff`, `+pact`, `+join`, `+mash`, and `+form`.
14+
15+Here's its basic structure in an informal pseudocode:
16+
17+```
18+|_ <mark-type>
19+++ grab:
20+ ++ noun: <noun> -> <mark-type>
21+ ++ mime: <mime> -> <mark-type>
22+ ++ txt: <txt> -> <mark-type>
23+ ...
24+++ grow:
25+ ++ noun: <mark-type> -> <noun>
26+ ++ mime: <mark-type> -> <mime>
27+ ++ txt: <mark-type> -> <txt>
28+ ...
29+++ grad
30+ ++ form: <diff-mark>
31+ ++ diff: (<mark-type>, <mark-type>) -> <diff-type>
32+ ++ pact: (<mark-type>, <diff-type>) -> <mark-type>
33+ ++ join: (<diff-type>, <diff-type>) -> <diff-type> or NULL
34+ ++ mash: (<diff-type>, <diff-type>) -> <diff-type>
35+```
36+
37+These types are basically what you would expect. In `+grab`, only a `+noun` arm is mandatory, the rest are optional. The `+grow` arm itself is optional, as are any arms within it. In `+grad`, all arms are mandatory unless revision control is delegated to another `mark`, which we'll discuss later.
38+
39+In general, for a particular `mark`, the `+grab` and `+grow` entries should be inverses of each other. They needn't be symmetrical though - you may want to be able to convert from your `mark` to `%json` but not from `%json` to your `mark`, for example.
40+
41+In `+grad`, `+diff` takes two instances of a `mark` and produces a diff of them whose `mark` is given by `+form`. `+pact` takes an instance of a `mark` and patches it with the given diff. In general, if `+diff` called with A and B produces diff D, then `+pact` called with A and D should produce B.
42+
43+`+join` takes two diffs and attempts to merge them into a single diff. If there are conflicts, it produces null. `+mash` takes two diffs and forces a merge, even if there are conflicts. How your `+mash` function force-merges conflicting diffs is up to you. The `%txt` `mark` annotates any conflicts, for example, but there may be other ways. If `+join` of two diffs does not produce null, then `+mash` of the same diffs should produce the same result. Note that `+mash` is not used by Clay in its ordinary filesystem operations, so you may wish to leave it as a dummy arm that crashes if called.
44+
45+Alternately, instead of `+form`, `+diff`, `+pact`, `+join`, and `+mash`, a `mark` can provide the same functionality by defining `+grad` to be the name of another `mark` to which we wish to delegate the revision control responsibilities. Then, before running any of those functions, Clay will convert to the other `mark`, and convert back afterward. For example, the `%hoon` `mark` is revision-controlled in the same way as `%txt`, so its `+grad` is simply `++ grad %txt`. Of course, `+txt` must be defined in `+grow` and `+grab` as well.
46+
47+We mentioned that `+noun` is the only mandatory arm in `+grab`, but there are a couple of others that, while not mandatory, are of particular interest.
48+
49+The first is a `+mime` arm for converting to and from the `%mime` `mark`. When you `|commit` a file to a `desk` mounted to Unix, Clay will receive the data as a `%mime` `mark`, and then convert it to the `mark` matching the file extension. It will perform the same operation in reverse when mounting a `desk` to Unix. For this reason, any `mark` you wish to be able to access from the Unix filesystem should have `%mime` conversion routines. In certain cases (such as the scry interface), Eyre will also need to convert your `mark` to a `%mime` in order to encode it in an HTTP response, so you may require a `+mime` arm for that reason as well.
50+
51+The second case of interest is the `+json` arm for converting to and from a `%json` `mark`. If, for example, you want to write a Gall agent to which you can subscribe through Eyre's channel system, it must produce data with a `mark` containing `%json` conversion routines. If it doesn't, Eyre will not be able to deliver the data to the subscribed HTTP client in the SSE stream.
52+
53+## Sections
54+
55+[Writing Marks](/docs/arvo/clay/marks/writing-marks) - A practical walk-through of writing a `mark` file.
56+
57+[Using Marks](/docs/arvo/clay/marks/using-marks) - Details of using `mark` conversion gates and `mark` cores in your own code.
58+
59+[Examples](/docs/arvo/clay/marks/examples) - The example code used in the Writing Marks guide.
content/docs/arvo/clay/marks/using-marks.mdnew file+240
@@ -0,0 +1,240 @@
1++++
2+title = "Using Marks"
3+weight = 3
4+template = "doc.html"
5++++
6+
7+In the last document, [Writing Marks](/docs/arvo/clay/marks/writing-marks), we walked through writing `mark` files and touched on how Clay handles them. They needn't just be left to background vane processes though, you can also use them yourself in your code.
8+
9+There are two kinds of cores that Clay can build for you: A `mark` conversion gate and a `mark` core. Each has two kinds: Statically typed and dynamically typed. Clay has a `care` for producing each of these:
10+
11+- `%b` - Build a dynamically typed `mark` core.
12+- `%c` - Build a dynamically typed `mark` conversion gate.
13+- `%e` - Build a statically typed `mark` core.
14+- `%f` - Build a statically typed `mark` conversion gate.
15+
16+You can either use these by `%pass`ing Clay a [%warp task](/docs/arvo/clay/tasks#warp) with the appropriate `care`, or else with a [Clay scry](/docs/arvo/clay/scry). In the examples here we've used the latter.
17+
18+## mark conversion gates
19+
20+`mark` conversion gates simply convert from one `mark` to another.
21+
22+### Static
23+
24+A static `mark` conversion gate looks like `$-(a b)`, where `a` is the type of the `mark` you're converting _from_, and `b` is type of the `mark` you're converting _to_. For example, a `mark` conversion gate from `%txt` to `%mime` would look like `$-(wain mime)`. You'd simply feed it a `wain` and get a `$mime` in return.
25+
26+#### Example
27+
28+We get our `%txt` to `%mime` `mark` conversion gate with a `%f` scry like so:
29+
30+```
31+> =txt-to-mime .^($-(wain mime) %cf /===/txt/mime)
32+```
33+
34+Note we had to specify the type of the gate as `$-(wain mime)` in the scry - if the type returned by the scry doesn't match that specification it'll fail. This is where a statically typed `mark` conversion gate differs from the dynamically typed gate, which we'll discuss later.
35+
36+Now that we have our conversion gate, we can just call it with a valid `wain` and we'll get our `$mime` in return:
37+
38+```
39+> (txt-to-mime ~['foo'])
40+[p=/text/plain q=[p=3 q=7.303.014]]
41+```
42+
43+### Dynamic
44+
45+A dynamically typed `mark` conversion gate is called a `$tube:clay`, and looks like:
46+
47+```hoon
48++$ tube $-(vase vase)
49+```
50+
51+As you can see from the type definition, it takes and returns a `vase` rather than needing the types explicitly defined. Rather than failing on a type mismatch when the scry is performed, it'll instead fail when it's actually run and fed a `vase` of the wrong type. Apart from handling `vase`s, it otherwise behaves the same as a statically typed `mark` conversion gate.
52+
53+#### Example
54+
55+We get our `%txt` to `%mime` `$tube` with a `%c` scry like so:
56+
57+```
58+> =txt-mime-tube .^(tube:clay %cc /===/txt/mime)
59+```
60+
61+And then we can again feed it the `wain` that a `%txt` `mark` wants, only this time it's wrapped in a `vase`:
62+
63+```
64+> !< mime (txt-mime-tube !>(~['foo']))
65+[p=/text/plain q=[p=3 q=7.303.014]]
66+```
67+
68+We then get our `$mime` back, but also in a `vase`.
69+
70+## mark cores
71+
72+While a `mark` conversion gate is built from functions defined in `+grab` and `+grow`, a `mark` core gives you everything in `+grad` so you can create diffs, merge diffs, patch files, etc. An extra arm `+vale` is also included that lets you convert a `noun` to the type the `%mark` takes by running the `+noun` arm of `+grab` in the original `mark` file.
73+
74+### Static
75+
76+A statically typed `mark` core is a `(nave:clay a b)` where `a` is the type of the `mark` and `b` is the type for diffs (which is the type of the `mark` specified in `+form:grad`). For example, a static `mark` core for a `%txt` `mark` looks like `(nave:clay wain (urge:clay cord))`.
77+
78+`+nave:clay` looks like this in full:
79+
80+```hoon
81+++ nave
82+ |$ [typ dif]
83+ $_
84+ ^?
85+ |%
86+ ++ diff |~([old=typ new=typ] *dif)
87+ ++ form *mark
88+ ++ join |~([a=dif b=dif] *(unit (unit dif)))
89+ ++ mash
90+ |~ [a=[ship desk dif] b=[ship desk dif]]
91+ *(unit dif)
92+ ++ pact |~([typ dif] *typ)
93+ ++ vale |~(noun *typ)
94+ --
95+```
96+
97+In brief, the arms of the core do the following:
98+
99+- `+form` - `mark` for diffs.
100+- `+vale` - Clam `noun` to the `mark`'s type.
101+- `+diff` - Create diff of two files.
102+- `+pact` - Patch a file with a diff.
103+- `+join` - Merge two diffs, returning `~` if there's a conflict.
104+- `+mash` - Force merge of two diffs.
105+
106+#### Examples
107+
108+First we get the `%txt` `mark` core with a `%e` scry:
109+
110+```
111+> =txt-nave .^((nave:clay wain (urge:clay cord)) %ce /===/txt)
112+```
113+
114+Note we specified the `mark` type `wain` and diff type `(urge:clay cord)` in the `nave` returned by the scry.
115+
116+We can see the `mark` for diffs with `+form`:
117+
118+```
119+> form.txt-nave
120+%txt-diff
121+```
122+
123+To clam a noun to the type of the `mark` (a `wain` in the case of a `%txt` `mark`), we can call `+vale` with a `noun`:
124+
125+```
126+> (vale:txt-nave ~['foo' 'bar'])
127+<|foo bar|>
128+```
129+
130+We can create a diff of two files with `+diff`:
131+
132+```
133+> (diff:txt-nave ~['foo' 'bar' 'baz'] ~['foo' 'zoo' 'baz'])
134+~[[%.y p=1] [%.n p=<|bar|> q=<|zoo|>] [%.y p=1]]
135+```
136+
137+Let's create some more diffs for experimentation:
138+
139+```
140+> =diff-a (diff:txt-nave ~['foo' 'bar' 'baz'] ~['foo' 'zoo' 'baz'])
141+> =diff-b (diff:txt-nave ~['foo' 'bar' 'baz'] ~['zap' 'bar' 'baz'])
142+> =diff-c (diff:txt-nave ~['foo' 'bar' 'baz'] ~['foo' 'bla' 'baz'])
143+```
144+
145+If we try merging diffs `a` and `b` with `+join`, we get a new merged diff back in a `unit`:
146+
147+```
148+> (join:txt-nave diff-a diff-b)
149+[~ [~ ~[[%.n p=<|foo|> q=<|zap|>] [%.n p=<|bar|> q=<|zoo|>] [%.y p=1]]]]
150+```
151+
152+If we try merging diffs `a` and `c` however, we get `~` because of a conflict:
153+
154+```
155+> (join:txt-nave diff-a diff-c)
156+[~ ~]
157+```
158+
159+If we run `+mash` on `a` and `b` we get the same diff as with `+join` (sans the `unit`):
160+
161+```
162+> (mash:txt-nave [our %home diff-a] [our %blah diff-b])
163+[~ ~[[%.n p=<|foo|> q=<|zap|>] [%.n p=<|bar|> q=<|zoo|>] [%.y p=1]]]
164+```
165+
166+If we `+mash` `a` and `c`, however, we get a diff with the conflict annotated rather than just `~`:
167+
168+```
169+> (mash:txt-nave [our %home diff-a] [our %blah diff-c])
170+[ ~
171+ ~[
172+ [%.y p=1]
173+ [ %.n
174+ p=<|bar|>
175+ q
176+ <|>>>>>>>>>>>> ~zod/home zoo ++++++++++++ bar ------------ bla <<<<<<<<<<<< ~zod/blah|>
177+ ]
178+ [%.y p=1]
179+ ]
180+]
181+```
182+
183+Note that the `%txt` `mark` annotates conflicts, but there are no specific rules around how the `+mash` arm should force-merge conflicting diffs apart from that it must return a valid diff, however the `mark` specified in `+form` defines that.
184+
185+Finally, we can patch our `wain` with diff `a` and get a new, modified `wain`:
186+
187+```
188+> (pact:txt-nave ~['foo' 'bar' 'baz'] diff-a)
189+<|foo zoo baz|>
190+```
191+
192+### Dynamic
193+
194+A dynamically typed `mark` core is a `$dais:clay`, which looks like:
195+
196+```hoon
197++$ dais
198+ $_ ^|
199+ |_ sam=vase
200+ ++ diff |~(new=_sam *vase)
201+ ++ form *mark
202+ ++ join |~([a=vase b=vase] *(unit (unit vase)))
203+ ++ mash
204+ |~ [a=[ship desk diff=vase] b=[ship desk diff=vase]]
205+ *(unit vase)
206+ ++ pact |~(diff=vase sam)
207+ ++ vale |~(noun sam)
208+ --
209+```
210+
211+It has the same arms as the statically typed `mark` core, the difference is that it takes and returns `vase`s rather than the data directly. Additionally, it's a door rather than an ordinary core, and takes the type of the `mark` wrapped in a `vase` as its argument.
212+
213+#### Examples
214+
215+We can get a `%txt` `mark` `dais` with a `%b` scry:
216+
217+```
218+> =txt-dais .^(dais:clay %cb /===/txt)
219+```
220+
221+Its `+form` arm functions the same as a static core:
222+
223+```
224+> form.txt-dais
225+%txt-diff
226+```
227+
228+So does `+vale` except it returns a `vase`:
229+
230+```
231+> !< wain (vale:txt-dais ~['foo' 'bar'])
232+<|foo bar|>
233+```
234+
235+All the other arms also deal in `vase`s. Because it's a door, the `+pact` and `+diff` arms take the original file in a `vase` as the door sample rather than being given directly to the arm. Calling `+diff` arm, for example, works like so:
236+
237+```
238+> !< (urge:clay cord) (~(diff txt-dais !>(~['foo' 'bar'])) !>(~['foo' 'baz']))
239+~[[%.y p=1] [%.n p=<|bar|> q=<|baz|>]]
240+```
content/docs/arvo/clay/marks/writing-marks.mdnew file+333
@@ -0,0 +1,333 @@
1++++
2+title = "Writing Marks"
3+weight = 2
4+template = "doc.html"
5++++
6+
7+Here we'll walk through a practical example of writing a `mark` file.
8+
9+We'll create a `mark` for CSV (comma separated values) files, a simple format for storing tabular data in a text file. Note that there's already a `csv.hoon` `mark` and library, but we'll create new ones for demonstrative purposes. It shouldn't be an issue to overwrite the existing ones on a fakezod.
10+
11+CSV files separate fields with commas and rows with line breaks. They look something like:
12+
13+```
14+foo,bar,baz
15+blah,blah,blah
16+1,2,3
17+```
18+
19+There is a little complexity surrounding special characters in fields and line endings, but otherwise the only other rule is that all rows must have the same number of fields. You can refer to [RFC4180 on the IETF website](https://datatracker.ietf.org/doc/html/rfc4180) for more details.
20+
21+We'll represent such a structure in Hoon as a `(list (list @t))` like:
22+
23+```hoon
24+[['foo' 'bar' 'baz' ~] ['blah' 'blah' 'blah' ~] ['1' '2' '3' ~] ~]
25+```
26+
27+We could perhaps create the type with a `$|` rune to include row-length validation in the mold itself, but a `(list (list @t))` is simpler for demonstrative purposes.
28+
29+## A simple mark
30+
31+Let's begin with the simplest `mark` file:
32+
33+```hoon
34+|_ csv=(list (list @t))
35+++ grab
36+ |%
37+ ++ noun (list (list @t))
38+ --
39+++ grow
40+ |%
41+ ++ noun csv
42+ --
43+++ grad %noun
44+--
45+```
46+
47+The door takes a `(list (list @t))` as its sample, and we've given it a face of `csv` so we can easily reference it. Note its face could be anything, it needn't be the name of our `mark`. When we're doing something with data that has a `%csv` `mark` like converting it to another `mark` or creating a diff, this is where our data will reside.
48+
49+Next we have the `+grab` arm of our door, which contains a core with arms for converting _to_ our `mark` _from_ other `mark`s. We've given it one arm for the `%noun` `mark` - the most generic `mark` which will take any `noun`. Our `+noun` arm will simply clam whatever it's given with the `(list (list @t))` `mold`.
50+
51+Next is the `+grow` arm which does the inverse of `+grab`, converting _from_ our `mark` _to_ another `mark`. We've also given it a `+noun` arm, this time it will simply return the door's sample named `csv`, which is of course already a `noun`.
52+
53+Note that the `+noun` arm is _mandatory_ in `+grab`. Clay cannot build a `mark` core without it. Conversion arms for any other `mark`s apart from `%noun` are optional.
54+
55+Finally we have the `+grad` arm. This arm specifies functions for revision control like creating diffs, patching files and so on. In our case, rather than writing all those functions, we've just delegated those tasks to the `%noun` `mark`. We can do this because we've specified conversion routines to and from the `%noun` `mark` in our `+grow` and `+grab` arms. When we modify a file with a `%csv` `mark`, Clay will convert our data to a `%noun` `mark`, execute the necessary `+grad` functions from the `%noun` `mark` file, and then convert it back to a `%csv` `mark` again.
56+
57+So now we have a valid `%csv` `mark` file. If we save this as `csv.hoon` in the `/mar` directory we could store `%csv` data in Clay. This may be sufficient for some applications, but what if we want to import a CSV file from Unix or elsewhere? In the next section, we'll look at conversions to and from a `%mime` `mark` to address this.
58+
59+## `%mime` conversions
60+
61+The `$mime` type represents raw data from Unix or elsewhere. For example, if a text file from Unix containing the word `foo` were converted to a `$mime` type in Urbit, it would look something like:
62+
63+```hoon
64+[/text/plain q=[p=3 q=7.303.014]]
65+```
66+
67+`/text/plain` is its [MIME type](https://developer.mozilla.org/en-US/docs/Web/HTTP/Basics_of_HTTP/MIME_types) and `p.q` is the byte-length of `q.q`, which is the data itself as an `atom`.
68+
69+The `%mime` `mark` is used by Clay to store and convert `$mime` data. It's an important `mark` for moving files from Unix to Urbit and vice versa. When you add a file to a `desk` you have mounted to Unix and `|commit` the change, Clay will first receive the file as a `%mime` `mark`, then convert from a `%mime` to whatever `mark` matches the file extension. For example, `foo.txt` will be converted from `%mime` to `%txt`. Additionally, data fetched by Iris over HTTP will come in as a `$mime-data:http`, which is an unvalidated form of `$mime` that you may wish to convert to a `%mime` `mark` and then to another `mark`. Likewise with Eyre, some of the lower-level interfaces receive HTTP requests with `$mime-data:http` in them.
70+
71+So with the nature of the `%mime` `mark` hopefully now clear, the reason we want conversion methods to and from `%mime` in our `%csv` `mark` is so we can import CSV files from Unix and vice versa.
72+
73+Since a CSV file on Unix will just be a long string with ASCII or UTF-8 encoding, we can treat `q.q` in the `$mime` as a `cord`, and thus write a parser to convert it to a `(list (list @t))`. For this purpose, here's a library: `csv.hoon`, which you can view in full on the [Examples](/docs/arvo/clay/marks/examples#libcsvhoon) page.
74+
75+The library contains four functions:
76+
77+- `+de-csv` - Parse a CSV `cord` to a `(list (list @t))`.
78+- `+en-csv` - Encode a `(list (list @t))` as a CSV `cord`.
79+- `+validate` - Check all rows of `(list (list @t))` are the same length.
80+- `+csv-join` - Ignore this for now, we'll use it later on.
81+
82+The decoding and encoding arms use parsing functions from the Hoon standard library. It's not important to be familiar with parsing in Hoon for our purposes here, but you can have a look at the [Parsing Guide](/docs/hoon/guides/parsing) in the Hoon documentation if you're interested. The important thing to note is that `+de-csv` takes a valid CSV-format `@t` and returns a `(list (list @t))`, and `+en-csv` does the reverse - it takes a `(list (list @t))` and returns a CSV-format `@t`.
83+
84+Let's try the library in the dojo. After we've added it to `/lib` and run `|commit`, we can build the file:
85+
86+```
87+> =csv -build-file %/lib/csv/hoon
88+```
89+
90+...try decode a CSV-format `@t`:
91+
92+```
93+> (de-csv:csv 'foo,bar,baz\0ablah,blah,blah\0a1,2,3')
94+~[<|foo bar baz|> <|blah blah blah|> <|1 2 3|>]
95+```
96+
97+...and try encode a `(list (list @t))` as a CSV-format `@t`:
98+
99+```
100+> (en-csv:csv [['foo' 'bar' 'baz' ~] ['blah' 'blah' 'blah' ~] ['1' '2' '3' ~] ~])
101+'foo,bar,baz\0ablah,blah,blah\0a1,2,3\0a'
102+```
103+
104+With that working, we can add an import for our library to our `%csv` `mark` defintion and add a `+mime` arm to both our `+grab` and `+grow` arms:
105+
106+```hoon
107+/+ *csv
108+|_ csv=(list (list @t))
109+++ grab
110+ |%
111+ ++ mime |=((pair mite octs) (de-csv q.q))
112+ ++ noun
113+ |= n=*
114+ ^- (list (list @t))
115+ =/ result ((list (list @t)) n)
116+ ?> (validate result)
117+ result
118+ --
119+++ grow
120+ |%
121+ ++ mime
122+ ?> (validate csv)
123+ [/text/csv (as-octs:mimes:html (en-csv csv))]
124+ ++ noun
125+ ?> (validate csv)
126+ csv
127+ --
128+++ grad %noun
129+--
130+```
131+
132+In `+grab` we've added a `+mime` arm to convert _from_ a `%mime` `mark` _to_ our `%csv` `mark`. It's a simple gate that takes a `$mime` (specified as `(pair mite octs)` to avoid conflict with the arm name), runs the data through the `+de-csv` function and returns a `(list (list @t))` of the CSV data.
133+
134+We've also added a `+mime` arm to `+grow` for converting _from_ our `%csv` `mark` _to_ a `%mime` `mark`. We encode our `(list (list @t))` `csv` sample with our `+en-csv` function and then run that through `as-octs:mimes:html` to get a `$octs` (so it has the byte-length). We also add the `/text/csv` MIME type so it's a valid `$mime`.
135+
136+Additionally, we've used the `+validate` function in a few places to make sure our CSV data has consistent row lengths.
137+
138+If we save the above mark file as `csv.hoon` in `/mar` and `|commit %home`, we should now be able to import CSV files into Urbit. Let's give it a go. In the root of our `%home` `desk`, let's add a file named `foo.csv` with the following contents:
139+
140+```
141+foo,bar,baz
142+blah,blah,blah
143+1,2,3
144+```
145+
146+If we now `|commit %home`, we should see it's been successfully added:
147+
148+```
149+> |commit %home
150+>=
151++ /~zod/home/4/foo/csv
152+```
153+
154+And if we try reading the file with the `-read` thread:
155+
156+```
157+> -read [%x our %home da+now /foo/csv]
158+~[<|foo bar baz|> <|blah blah blah|> <|1 2 3|>]
159+```
160+
161+We can see our `%csv` `mark` has successfully converted our `foo.csv` file to a `(list (list @t))` when it was imported.
162+
163+Let's try the other direction now. We can create a new `bar.csv` files in the root of `%home` from the dojo like so:
164+
165+```
166+> */bar/csv ~[['abc' 'def' ~] ['ghi' 'jkl' ~]]
167++ /~zod/home/5/bar/csv
168+```
169+
170+And if we check it in the terminal on the Unix side we can see it's been correctly encoded:
171+
172+```
173+> cat zod/home/bar.csv
174+abc,def
175+ghi,jkl
176+```
177+
178+So now our `%csv` `mark` lets us move data in and out of Urbit. In the next section, we'll look at the `+grad` arm in more detail.
179+
180+## `+grad`
181+
182+So far we've just delegated `+grad` functions to the `%noun` `mark`, but now we'll look at writing our own.
183+
184+For demonstrative purposes, we can just poach the algorithms used in the `+grad` arm of the `%txt` `mark` and modify them to take our `(list (list @t))` type instead of a `wain`. It's not the most efficient algorithm for a CSV file but it'll do the job.
185+
186+Our diff format will be a `(urge:clay (list @t))`, and we'll use some `differ` functions from `zuse.hoon` like `+loss`, `+lusk` and `+lurk` to produce diffs and apply patches.
187+
188+The [csv.hoon library](/docs/arvo/clay/marks/examples#libcsvhoon) we imported also contains a `+csv-join` function which we'll use in the `+join` arm, just to save space here.
189+
190+Here's the new `%csv` `mark` defintion:
191+
192+```hoon
193+/+ *csv
194+|_ csv=(list (list @t))
195+++ grab
196+ |%
197+ ++ mime |=((pair mite octs) (de-csv q.q))
198+ ++ noun
199+ |= n=*
200+ ^- (list (list @t))
201+ =/ result ((list (list @t)) n)
202+ ?> (validate result)
203+ result
204+ --
205+++ grow
206+ |%
207+ ++ mime
208+ ?> (validate csv)
209+ [/text/csv (as-octs:mimes:html (en-csv csv))]
210+ ++ noun
211+ ?> (validate csv)
212+ csv
213+ --
214+++ grad
215+ |%
216+ ++ form %csv-diff
217+ ++ diff
218+ |= bob=(list (list @t))
219+ ^- (urge:clay (list @t))
220+ ?> (validate csv)
221+ ?> (validate bob)
222+ (lusk:differ csv bob (loss:differ csv bob))
223+ ++ pact
224+ |= dif=(urge:clay (list @t))
225+ ^- (list (list @t))
226+ =/ result (lurk:differ csv dif)
227+ ?> (validate result)
228+ result
229+ ++ join
230+ |= $: ali=(urge:clay (list @t))
231+ bob=(urge:clay (list @t))
232+ ==
233+ ^- (unit (urge:clay (list @t)))
234+ (csv-join ali bob)
235+ ++ mash
236+ |= $: [ship desk (urge:clay (list @t))]
237+ [ship desk (urge:clay (list @t))]
238+ ==
239+ ^- (urge:clay (list @t))
240+ ~|(%csv-mash !!)
241+ --
242+--
243+```
244+
245+In our modified `+grad` arm, we've replaced the `%noun` delegation with a core containing five arms: `+form`, `+diff`, `+pact`, `+join`, and `+mash`. These arms are all required for a valid `+grad` if it's not delegated to another `mark`. We'll now look at each in detail.
246+
247+### `+form`
248+
249+```hoon
250+++ form %csv-diff
251+```
252+
253+`+form` simply specifies the `mark` of the diff file that may be produced by other `+grad` functions. If your diff is the same type as your `mark`, it could just specify itself like `%csv`. In our case our diff is a `(urge:clay (list @t))` rather than a `(list (list @t))`, so we need a separate mark file for the diff itself.
254+
255+Here's another `mark` file which can be saved as `csv-diff.hoon` in `/mar`:
256+
257+```hoon
258+|_ dif=(urge:clay (list @t))
259+++ grab
260+ |%
261+ ++ noun (urge:clay (list @t))
262+ --
263+++ grow
264+ |%
265+ ++ noun dif
266+ --
267+++ grad %noun
268+--
269+```
270+
271+It's very bare-bones, we just need it for our `%csv` `mark` to work. In our `%csv` `mark`, we've specified it as `%csv-diff` in `+form`.
272+
273+### `+diff`
274+
275+```hoon
276+++ diff
277+ |= bob=(list (list @t))
278+ ^- (urge:clay (list @t))
279+ ?> (validate csv)
280+ ?> (validate bob)
281+ (lusk:differ csv bob (loss:differ csv bob))
282+```
283+
284+This arm produces the diff of two `%csv` files. The first `%csv` file will be given as the sample of the parent door, which if you'll recall we gave a face of `csv`. The second `%csv` file will be given as the sample of the gate in `+diff`, which we've named `bob` here. We then just produce the diff of these two files and return it as the type of the mark specified in `+form`, which in our case is `(urge:clay (list @t))` for a `%csv-diff`. Clay will use `+diff` when a file is revised, so it doesn't have to store a whole new copy of the file each time it's modified.
285+
286+### `+pact`
287+
288+```hoon
289+++ pact
290+ |= dif=(urge:clay (list @t))
291+ ^- (list (list @t))
292+ =/ result (lurk:differ csv dif)
293+ ?> (validate result)
294+ result
295+```
296+
297+`+pact` patches a `%csv` file with the given diff. Its gate takes a diff and applies it to the `%csv` given as the sample of the parent door (which we gave a face of `csv`). If the patch succeeds, it will return a new `%csv` file - a valid `(list (list @t))`. When we read a file that's been modified in Clay, Clay will apply all the diffs it has with `+pact` and return the resulting file.
298+
299+### `+join`
300+
301+```hoon
302+++ join
303+ |= $: ali=(urge:clay (list @t))
304+ bob=(urge:clay (list @t))
305+ ==
306+ ^- (unit (urge:clay (list @t)))
307+ (csv-join ali bob)
308+```
309+
310+The `+join` arm merges two different diffs. It takes them both as the sample of its gate (which we've named `ali` and `bob`), and returns a new diff wrapped in a `unit` like `(unit (urge:clay (list @t)))`. The `unit` will be `~` if the merge failed due to a conflict. This is used by Clay in some cases when `desk`s are merged. If diff merges are not possible for your use case, you could just have it always return `~`.
311+
312+### `+mash`
313+
314+```hoon
315+++ mash
316+ |= $: [ship desk (urge:clay (list @t))]
317+ [ship desk (urge:clay (list @t))]
318+ ==
319+ ^- (urge:clay (list @t))
320+ ~|(%csv-mash !!)
321+```
322+
323+This is like `+join` except it forces a diff merge even if there's a conflict. Rather than returning a `unit`, it just returns the diff - a `(urge:clay (list @t))` in our case. Also unlike `+join`, it takes the `ship` and `desk` each diff came from as well as the diff itself.
324+
325+The `+mash` arm is not used by Clay in its file revision operations, so it's safe to just make it a dummy arm that crashes as we've done here. If you were to use it, it would likely just be used manually in an agent, thread or generator.
326+
327+An example of its use would be the `%txt` `mark`, which includes a proper `+mash` function that produces a diff with any conflicts annotated, though how you have `+mash` handle conficts would depend on your use case. If there were no conflicts between the two diffs, it should produce the same diff as the `+join` arm.
328+
329+## Conclusion
330+
331+So there you have it, a fully functional `mark` for CSV files. A `mark` file can be as complex or as simple as you'd like, they're very flexible depending on your use case. Additional conversion methods can always be added as they're needed. For example, with just a few lines of code we could add arms for converting CSV files to `%json` or `%txt` and vice versa.
332+
333+In the next document, we'll look at building and using `mark` cores and `mark` conversion gates in our own code.
content/docs/arvo/clay/scry.md+6−6
@@ -8,7 +8,7 @@ The various Clay scries are specified by a `care`, which is a single character c
88
99```
1010> /===
11−[~.~zod ~.home ~.~2021.4.26..02.29.03..d31b ~]
11+[~.~zod ~.base ~.~2021.4.26..02.29.03..d31b ~]
1212```
1313
1414## %a - Build hoon.
@@ -51,7 +51,7 @@ Example:
5151
5252```
5353> .^((set desk) %cd /===)
54−{%home %kids}
54+{%bitcoin %base %landscape %webterm %garden}
5555```
5656
5757## %e - Static mark core.
@@ -213,12 +213,12 @@ This will return the most recent revision number of a `desk` that has been fully
213213Example:
214214
215215```
216−> .^(=cass:clay %cs /(scot %p (sein:title our now our))/kids/1/late)
216+> .^(=cass:clay %cs /(scot %p (sein:title our now our))/base/1/late)
217217cass=[ud=50 da=~2021.4.22..10.38.50..57a8]
218218```
219219
220220```
221−> .^(=cass:clay %cs /~sampel/kids/1/late)
221+> .^(=cass:clay %cs /~sampel/base/1/late)
222222cass=[ud=0 da=~2000.1.1]
223223```
224224
@@ -229,12 +229,12 @@ This will return the mergebase (i.e. most recent common ancestor) between two `d
229229Examples:
230230
231231```
232−> .^((list tako:clay) %cs /===/base/(scot %p (sein:title our now our))/kids)
232+> .^((list tako:clay) %cs /===/base/(scot %p (sein:title our now our))/base)
233233~[102.787.244.596.033.419.950.995.540.301.493.841.569.518.772.322.508.085.465.561.801.703.148.627.263.473]
234234```
235235
236236```
237−> .^((list tako:clay) %cs /===/base/~sampel/kids)
237+> .^((list tako:clay) %cs /===/base/~sampel/base)
238238~
239239```
240240
content/docs/arvo/clay/tasks.md+3−3
@@ -4,7 +4,7 @@ weight = 6
44template = "doc.html"
55+++
66
7−This document details all the `task`s you're likely to use to interact with Clay, as well as the `gift`s you'll receive in response. Each section has a corresponding practical example in the [Examples](/docs/arvo/clay/examples) document. Many of the types referenced are detailed in the [Data Types](/docs/arvo/clay/data-types) document. It may also be useful to look at the `++ clay` section of `/sys/lull.hoon` in Arvo where these `task`s, `gift`s and data structures are defined.
7+This document details all the `task`s you're likely to use to interact with Clay, as well as the `gift`s you'll receive in response. Each section has a corresponding practical example in the [Examples](/docs/arvo/clay/examples) document. Many of the types referenced are detailed in the [Data Types](/docs/arvo/clay/data-types) document. It may also be useful to look at the `++ clay` section of `/sys/lull.hoon` in Arvo where these `task`s, `gift`s and data structures are defined.
88
99The focus of this document is on interacting with Clay from userspace applications and threads, so it doesn't delve into the internal mechanics of Clay from a kernel development perspective.
1010
@@ -108,7 +108,7 @@ This subscribes to all changes to a `desk` for the specified range of `case`s. N
108108If the `track` is `%.y` it will just return a `%writ` like:
109109
110110```hoon
111−[%writ p=[~ [p=[p=%w q=[%ud p=256] r=%home] q=/ r=[p=%null q=[#t/@n q=0]]]]]
111+[%writ p=[~ [p=[p=%w q=[%ud p=256] r=%base] q=/ r=[p=%null q=[#t/@n q=0]]]]]
112112```
113113
114114...that merely informs you of a change. If you want the actual data you'll have to request it separately.
@@ -494,7 +494,7 @@ Note that if you're reading a whole `desk` or directory, all subfolders and file
494494
495495To merge a foreign `desk` into a local one, you just send Clay a `%merg` `task` (as you would for a local merge) and specify the foreign ship in the `her` field. For details on making such requests, see the [Merge Desks](#merge-desks) section.
496496
497−The foreign ship will respond only if correct permissions have been set. See the [Permissions](#permissions) section for details. By default, a ship's `%kids` desk is set to be publicly readable, so unless permissions have been manually modified, you should be able to merge from any `%kids` `desk`.
497+The foreign ship will respond only if correct permissions have been set. See the [Permissions](#permissions) section for details.
498498
499499Note that all subfolders and individual files within the `desk` must permit your reading in order for the merge to succeed. If even one file does not permit you reading it, the remote ship will not respond to the request at all.
500500
content/docs/arvo/clay/using.md+67−61
@@ -6,50 +6,51 @@ template = "doc.html"
66
77### Reading and Subscribing
88
9−When reading from Clay, there are three types of requests. A
10−`%sing` request asks for data at single revsion. A `%next`
9+When reading from Clay, there are three types of requests. A
10+`%sing` request asks for data at single revsion. A `%next`
1111request asks to be notified the next time there's a change to
12−given file. A `%many` request asks to be notified on every
12+given file. A `%many` request asks to be notified on every
1313change in a `desk` for a range of changes.
1414
1515For `%sing` and `%next`, there are generally three things to be
16−queried. A `%u` request simply checks for the existence of a
17−file at a path. A `%x` request gets the data in the file at a
18−path. A `%y` request gets a hash of the data in the file at the
19−path combined with all its children and their data. Thus, `%y`
16+queried. A `%u` request simply checks for the existence of a
17+file at a path. A `%x` request gets the data in the file at a
18+path. A `%y` request gets a hash of the data in the file at the
19+path combined with all its children and their data. Thus, `%y`
2020of a node changes if it or any of its children change.
2121
22−A `%sing` request is fulfilled immediately if possible. If the
22+A `%sing` request is fulfilled immediately if possible. If the
2323requested revision is in the future, or is on another ship for
2424which we don't have the result cached, we don't respond
25−immediately. If the requested revision is in the future, we wait
26−until the revision happens before we respond to the request. If
25+immediately. If the requested revision is in the future, we wait
26+until the revision happens before we respond to the request. If
2727the request is for data on another ship, we pass on the request
28−to the other ship. In general, Clay subscriptions, like most
28+to the other ship. In general, Clay subscriptions, like most
2929things in Urbit, aren't guaranteed to return immediately.
3030They'll return when they can, and they'll do so in a
3131referentially transparent manner.
3232
3333A `%next` request checks the query at the given revision, and it
3434produces the result of the query the next time it changes, along
35−with the revision number when it changes. Thus, a `%next` of a
35+with the revision number when it changes. Thus, a `%next` of a
3636`%u` is triggered when a file is added or deleted, a `%next` of a
3737`%x` is triggered when a file is added, deleted, or changed, and
3838a `%next` of a `%y` is triggered when a file or any of its
3939children is added, deleted, or changed.
4040
4141A `%many` request is triggered every time the given `desk` has a
42−new revision. Unlike a `%next`, a `%many` has both a start and
43−an end revision, after which it stops returning. For `%next`, a
42+new revision. Unlike a `%next`, a `%many` has both a start and
43+an end revision, after which it stops returning. For `%next`, a
4444single change is reported, and if the caller wishes to hear of
45−the next change, it must resubscribe. For `%many`, every revision
46−from the start to the end triggers a response. Since a `%many`
45+the next change, it must resubscribe. For `%many`, every revision
46+from the start to the end triggers a response. Since a `%many`
4747request doesn't ask for any particular data, there aren't `%u`,
4848`%x`, and `%y` versions for it.
4949
5050### Unix sync
5151
5252Usage:
53+
5354```
5455|mount %/path/to/directory %mount-point
5556|commit %mount-point
@@ -76,123 +77,128 @@ be automatically committed with `|autocommit %mount-point`.
7677### Merging
7778
7879Usage:
80+
7981```
8082|merge %target-desk ~source-ship %source-desk
8183|merge %target-desk ~source-ship %source-desk, =gem %strategy
8284|merge %target-desk ~source-ship %source-desk, =cas ud+5
8385```
8486
85−Clay supports various merge strategies. A "commit" is a snapshot of
86−the files with a list of parents plus a date. Most commits have
87−one parent; a "merge" commit is a commit with two parents. The
88−%home `desk` starts with an initial commit with no parents; commits
87+Clay supports various merge strategies. A "commit" is a snapshot of
88+the files with a list of parents plus a date. Most commits have
89+one parent; a "merge" commit is a commit with two parents. The
90+`%base` `desk` starts with an initial commit with no parents; commits
8991with several parents ("octopus merges") are possible but we don't
9092generate them right now.
91−
93+
9294Unless otherwise specified, all of the following create a new commit
9395with the source and destination commits as parents.
94−
95−Several strategies need a "merge-base". They find it by identifying
96−the most recent common ancestor of the two `desk`s. If none, fail
96+
97+Several strategies need a "merge-base". They find it by identifying
98+the most recent common ancestor of the two `desk`s. If none, fail
9799with `%merge-no-merge-base`; if there are two or more, pick one.
98100
99101#### Strategies
100−
101−**`%init`**: the only way to create a `desk`. Not a true merge, since it
102+
103+**`%init`**: the only way to create a `desk`. Not a true merge, since it
102104simply assigns the source commit to the destination.
103−
105+
104106**`%fine`**: if source or destination are in the ancestry of each other,
105−use the newer one; else abort. If the destination is ahead of the
106−source, succeed but do nothing. If the source is ahead of the
107+use the newer one; else abort. If the destination is ahead of the
108+source, succeed but do nothing. If the source is ahead of the
107109destination, assign the next revision number to the source commit.
108110Some call this "fast-forward".
109−
111+
110112**`%meet`**: combine changes, failing if both sides changed the same file.
111113Specifically, take diff(merge-base,source) and
112114diff(merge-base,destination) and combine them as long as those diffs
113115touch different files.
114−
116+
115117**`%mate`**: combine changes, failing if both sides changed the same part
116−of a file. Identical to `%meet`, except that some marks, like `%hoon`,
118+of a file. Identical to `%meet`, except that some marks, like `%hoon`,
117119allow intelligent merge of changes to different parts of a file.
118−
120+
119121**`%meld`**: combine changes; if both sides changed the same part of a
120122file, use the version of the file in the merge-base.
121−
123+
122124**`%only-this`**: create a merge commit with exactly the contents of the
123125destination `desk`.
124−
126+
125127**`%only-that`**: create a merge commit with exactly the contents of the
126128source commit.
127−
129+
128130**`%take-this`**: create a merge commit with exactly the contents of the
129131destination `desk` except take any files from the source commit which
130132are not in the destination `desk`.
131−
133+
132134**`%take-that`**: create a merge commit with exactly the contents of the
133135source commit except preserve any files from the destination `desk`
134136which are not in the source commit.
135−
137+
136138**`%meet-this`**: merge as in `%meet`, except if both sides changed the same
137139file, use the version in the destination `desk`.
138−
140+
139141**`%meet-that`**: merge as in `%meet`, except if both sides changed the same
140142file, use the version in the source commit.
141−
143+
142144#### Examples and notes:
143−
145+
144146The most common merge strategy is `%mate`, which is a normal 3-way
145147merge which aborts on conflict.
146−
147−`%take-that` is useful to "force" an OTA. After running `%take-that`,
148+
149+`%take-that` is useful to "force" an OTA. After running `%take-that`,
148150you're guaranteed to have exactly the files in the source commit plus
149151any files you separately added.
150−
151−We speak of merging into a destination *`desk`* from a source *commit*
152+
153+We speak of merging into a destination _`desk`_ from a source _commit_
152154because while you can only merge on top of a `desk`, you can merge from
153−historical commits. For example,
154−```
155−|merge %old our %home, =cas ud+5, =gem %init
155+historical commits. For example,
156+
157+```
158+|merge %old our %base, =cas ud+5, =gem %init
156159```
157−will create a new `desk` called `%old` with the 5th commit in `%home`.
160+
161+will create a new `desk` called `%old` with the 5th commit in `%base`.
158162You can revert the contents of a `desk` to what they were yesterday
159163with
164+
160165```
161−|merge %home our %home, =cas da+(sub now ~d1), =gem %only-that
166+|merge %base our %base, =cas da+(sub now ~d1), =gem %only-that
162167```
163−
168+
164169Note this is a normal `%only-that merge`, which means you're creating a
165−*new* commit with the old *contents*.
166−
170+_new_ commit with the old _contents_.
171+
167172`%meld` is rarely used on its own, however if you specify `%auto` or
168173omit the merge strategy, `%kiln` will run a `%meld` merge into a scratch
169174`desk` and then annotate the conflicts there.
170−
175+
171176If you resolve merge conflicts manually, for example by mounting the
172177`desk`s, copying the files in Unix and then running `|commit`, you
173−should usually run an `%only-this merge`. This will not change the
178+should usually run an `%only-this merge`. This will not change the
174179newly-fixed contents of your `desk`, but it will record that the merge
175180happened so that those conflicts don't reappear in later merges.
176−
181+
177182If you get a `%merge-no-merge-base` error, this means you're trying to
178−merge two `desk`s which have no common ancestors. You need to give
183+merge two `desk`s which have no common ancestors. You need to give
179184them a common ancestor by choosing a merge strategy which doesn't
180185need a merge-base, like `%only-this`, `%only-that`, `%take-this`, or
181186`%take-that`.
182−
187+
183188`%take-this` could be useful to install 3rd party software, but you
184189couldn't get subsequent updates this way, since the files would
185−already exist in the destination `desk`. Something like "take only
190+already exist in the destination `desk`. Something like "take only
186191the files which aren't in my OTA source or any other 3rd party app"
187−would be basically correct. This would require a parameter listing
192+would be basically correct. This would require a parameter listing
188193the `desk`s to not conflict with.
189−
194+
190195`%meet-this` and `%meet-that` imply the existence of `%mate-this` and
191196`%mate-that`, but those don't exist yet.
192197
193198### Autosync
194199
195200Usage:
201+
196202```
197203|sync %target-desk ~source-ship %source-desk
198204```
content/docs/arvo/concepts/_index.md+4
@@ -8,6 +8,10 @@ insert_anchor_links = "right"
88
99Other concepts related to the way Arvo works.
1010
11+## [Scries](/docs/arvo/concepts/scries)
12+
13+Details of performing scries.
14+
1115## [Subscriptions](/docs/arvo/concepts/subscriptions)
1216
1317Urbit relies heavily on subscriptions throughout the stack. We strongly prefer reactive data flow compared to querying or polling, which is why for example our equivalent to git natively supports subscriptions to its data.
content/docs/arvo/concepts/scry.mdnew file+77
@@ -0,0 +1,77 @@
1++++
2+title = "Scries"
3+weight = 40
4+template = "doc.html"
5++++
6+
7+### What is a scry?
8+
9+A scry is a read-only request to Arvo's global namespace.
10+
11+Vanes and agents define _scry endpoints_ which allow one to request data from their respective states. The endpoints can process the data in any way before returning it, but they cannot alter the actual state - scries can _only_ read, not modify.
12+
13+### Why scry?
14+
15+The subject available in something like a Gall agent or thread contains a great many functions and structures from the standard library as well as `zuse` and `lull`, but it does not include any of the actual data stored elsewhere in the ship. All it has is its own state, a `bowl` and any `card`s it has been passed. Ordinarily, in order to access such data, one would need to `%poke` or `%watch` other agents, or `%pass` `task`s to vanes, then wait for a response. Arvo's scry system is the one exception to this; it allows direct retrieval of data from other vanes or agents in situ, from any context, without any of the normal messaging rigmarole.
16+
17+### How do I scry?
18+
19+Scries are performed exclusively with the dotket rune: `.^`
20+
21+For details of its usage, see the [dotket](/docs/hoon/reference/rune/dot#-dotket) section of the Nock rune documentation. In addition to the dotket documentation, below is a colour-coded diagram breaking down the structure of a dotket scry expression with some additional notes.
22+
23+![Scry diagram](https://media.urbit.org/docs/arvo/scry-diagram-v2.svg)
24+
25+One further note on `care`s (which can sometimes be confusing): While `care`s are part of the global namespace, they're most extensively used by Clay in particular. In Clay, `care`s specify Clay submodules with specific behaviour, and are used both in scries as well as `task`s and `gift`s. For example, a `%x` `care` reads the data of a file, a `%p` `care` reads file permissions, and so forth. To see all of Clay's `care`s and what they do, you can refer to Clay's [Scry Reference](/docs/arvo/clay/scry).
26+
27+Most other vanes also make use of `care`s in their scry endpoints. While such vanes don't have corresponding submodules with strictly defined behaviour like Clay, the `care`s still confer the general nature of the endpoint. The most widely used `care` is `%x`, which implies reading data in a general sense. Gall has special handling of `%x` scries as described in the [Gall agents](#gall-agents) section below, but otherwise `care`s have no special behaviour for non-Clay vanes (though they must still be included if the endpoint specifies it).
28+
29+### What can I scry?
30+
31+There are two places where scry endpoints are defined:
32+
33+#### Vanes
34+
35+Each of Arvo's eight vanes (kernel modules) include a `+scry` arm which defines that vane's scry endpoints. The number of endpoints and extent of data available varies between vanes. For example, Clay has a very extensive set of scry endpoints which provide read access to all files in all desks across all revisions, as well as the ability to build files, perform `mark` conversions, and various other functions. Jael provides access to a great deal of PKI data. On the other hand, Dill has only a couple of endpoints which are mostly useful for debugging, and Iris has none at all (apart from standard memory reporting endpoints you'd not typically use in your applications).
36+
37+To explore what scry endpoints are available for vanes, you can refer to the Scry Reference section of each vane in the [Arvo](/docs/arvo/overview) section of the documents.
38+
39+#### Gall agents
40+
41+Gall has a single scry endpoint of its own to check for the existence of an agent, but otherwise all Gall scries are passed through to one of the agents it manages. The target agent to scry is specified in place of the `desk` as described in the diagram above. Each Gall agent includes a `+on-peek` arm that defines its own scry endpoints. For example, `%graph-store` has a number of scry endpoints to access the data it stores, such as chat messages and the like.
42+
43+Gall agents can expose scry endpoints with any `care`, but most commonly they'll take a `%x` `care`. Gall handles `%x` scries specially - it expects an extra field at the end of the `path` that specifies a `mark`. Gall will attempt to perform a `mark` conversion from the `mark` returned by the scry endpoint to the `mark` specified. Note the trailing `mark` in the `path` will not be passed through to the agent itself.
44+
45+### What is an endpoint?
46+
47+"Endpoint" refers to a specific scry path in a vane or agent. They will sometimes informally be noted in documentation or source comments like `/x/foo/bar/baz` or maybe just `/foo/bar/baz`. The first part of the former example is the `care`, then the rest is the `path` portion as noted in the diagram earlier.
48+
49+If an agent's scry endpoints don't have formal documentation, you may need to refer to the `+on-peek` arm in its source code to determine its endpoints. While there's no exact pattern that's consistent across different agents, the general pattern will be some initial tests and conversions followed by a `?+` rune, whose cases will typically correspond to the endpoints. The `+on-peek` arm always return a `(unit (unit cage))` (a `cage` is a cell of `[mark vase]`), so each endpoint will typically finish by composing such a structure.
50+
51+Here's an example from the `+on-peek` arm of `%graph-store`:
52+
53+```hoon
54+ [%x %keys ~]
55+:- ~ :- ~ :- %graph-update-2
56+!>(`update:store`[now.bowl [%keys ~(key by graphs)]])
57+```
58+
59+The case in the beginning says it takes a `%x` `care` and has a `path` of `/keys`. Additionally, it returns data with a `mark` of `%graph-update-2`. Assuming we wanted the `%graph-update-2` `mark` converted to a `%json` `mark`, our scry would be composed along the lines of:
60+
61+```hoon
62+.^(json %gx /(scot %p our)/graph-store/(scot %da now)/keys/json)
63+```
64+
65+### Web scries
66+
67+The webserver vane Eyre has a system which allows clients like web browsers to perform scries over HTTP. For details, refer to the [Scry section of Eyre's External API Reference](/docs/arvo/eyre/external-api-ref#scry).
68+
69+### Further reading
70+
71+[dotket](/docs/hoon/reference/rune/dot#-dotket) - Documentation of the `.^` rune which performs scries.
72+
73+[Arvo](/docs/arvo/overview) - Each vane has a Scry Reference section with details of their endpoints as well as examples.
74+
75+[Eyre's External API Reference](/docs/arvo/eyre/external-api-ref#scry) - Documentation of Eyre's scry system which allows web clients to perform scries over HTTP.
76+
77+[The Gall Guide](/docs/userspace/gall/tutorial) - The Gall tutorial includes a section about `+on-peek` and writing scry endpoints.
content/docs/arvo/concepts/subscriptions.md+43−43
@@ -4,7 +4,7 @@ weight = 50
44template = "doc.html"
55+++
66
7−Urbit relies heavily on subscriptions throughout the stack. We strongly
7+Urbit relies heavily on subscriptions throughout the stack. We strongly
88prefer reactive data flow compared to querying or polling, which is why
99for example our equivalent to git natively supports subscriptions to its
1010data.
@@ -12,7 +12,7 @@ data.
1212We have many application-level styles of subscription, but we only have
1313three true subscription types in Arvo, named for the vane they're
1414implemented in: Clay subscriptions (filesystem), Gall subscriptions
15−(applications), and Jael subscriptions (Urbit ID info). They're at
15+(applications), and Jael subscriptions (Urbit ID info). They're at
1616three different points in the idea maze of subscriptions, and we'll
1717encounter each of them here.
1818
@@ -28,9 +28,9 @@ later request.
2828### Exactly-once updates
2929
3030Some subscriptions need the subscriber to receive each update separately
31−instead of collapsing them into a single diff. Sometimes a subscription
31+instead of collapsing them into a single diff. Sometimes a subscription
3232is really a sequence of commands, in which case there's no meaningful
33−way to collapse them. Similarly, software updates may be expected to be
33+way to collapse them. Similarly, software updates may be expected to be
3434applied in order.
3535
3636### Syncing data
@@ -38,79 +38,79 @@ applied in order.
3838Other times, it's more natural to think of a subscription as
3939communicating a data structure, where the only goal is to keep the data
4040structure on the subscriber's side up-to-date with what's on the
41−publisher's side. In this case, it's perfectly fine to collapse several
41+publisher's side. In this case, it's perfectly fine to collapse several
4242updates into one large update, or even to resend the entire data
43−structure. Partial updates exist only as an optimization.
43+structure. Partial updates exist only as an optimization.
4444
4545For this sort of subscription, we commonly use terms like "diff" instead
4646of "message" or "update", and we say that we "apply a diff" instead of
47−"process an update". We also often identify the subscription with the
47+"process an update". We also often identify the subscription with the
4848data structure itself.
4949
5050## Memory pressure
5151
5252Naively implemented, subscriptions pose a memory leak risk if the
5353subscriber can't receive updates as fast as the publisher wants to send
54−them. This commonly happens when the subscriber goes offline for an
55−extended period of time (possibly forever; especially for comets). It's
54+them. This commonly happens when the subscriber goes offline for an
55+extended period of time (possibly forever; especially for comets). It's
5656sufficient to bound the amount of memory dedicated to any particular
5757subscriber.
5858
5959In a synchronous system, you don't have to worry about what happens if
60−one side or the other ceases to be available. All of our subscriptions,
60+one side or the other ceases to be available. All of our subscriptions,
6161though, can happen between ships.
6262
6363### Small data
6464
6565For particularly low-volume subscriptions, it may be acceptable to
66−ignore the problem. Jael uses this approach, since the only time it's
66+ignore the problem. Jael uses this approach, since the only time it's
6767used across ships is to update moon keys, which is very low-volume and
68−less than 1KB per update. If these subscriptions are used for more,
68+less than 1KB per update. If these subscriptions are used for more,
6969this strategy will have to be revisited.
7070
7171### Buffers
7272
73−A common solution to this problem is the venerable buffer. If more than
74−N updates need to be sent, start dropping updates. There are several
73+A common solution to this problem is the venerable buffer. If more than
74+N updates need to be sent, start dropping updates. There are several
7575options for what to do when the buffer is full and the publisher wishes
7676to send another message:
7777
78−- Drop the oldest message. Particularly suitable for systems where new
79−messages obsolete old ones. For example, if you just need the latest
80−ticker price for an asset, you could use a buffer size of one and
81−replaced it any time you have a new price.
78+- Drop the oldest message. Particularly suitable for systems where new
79+ messages obsolete old ones. For example, if you just need the latest
80+ ticker price for an asset, you could use a buffer size of one and
81+ replaced it any time you have a new price.
8282
83−- Don't add the new message to the buffer. Semantically this is usually
84−less helpful, but mechanically it can be simpler and reduce memory
85−churn, since the buffer stops changing and new messages are simply
86−ignored.
83+- Don't add the new message to the buffer. Semantically this is usually
84+ less helpful, but mechanically it can be simpler and reduce memory
85+ churn, since the buffer stops changing and new messages are simply
86+ ignored.
8787
88−- Drop the newest message and close the subscription. Unlike the
89−previous two, this is compatible with the principle of exactly-once
90−messaging. Specifically, it preserves the guarantee that you won't
91−receive two non-consecutive subscription updates, at the cost of making
92−you resubscribe if you fall behind.
88+- Drop the newest message and close the subscription. Unlike the
89+ previous two, this is compatible with the principle of exactly-once
90+ messaging. Specifically, it preserves the guarantee that you won't
91+ receive two non-consecutive subscription updates, at the cost of making
92+ you resubscribe if you fall behind.
9393
94−Gall subscriptions use the last of these. The buffer is bounded by a
94+Gall subscriptions use the last of these. The buffer is bounded by a
9595simple heuristic, and when a subscription exceeds that buffer, it is
9696closed and the app is expected to resubscribe when they come back
97−online. Note that even though the subscription is closed, messages in
97+online. Note that even though the subscription is closed, messages in
9898flight cannot be removed until they've been acknowledged since Ames
9999guarantees exactly-once messaging, so those last few messages will be
100100stuck in memory until the subscriber comes back online.
101101
102102Buffers are commonly bounded by size, but this puts constraints on the
103−types of messages may be sent. They may also be bounded in time: if the
103+types of messages may be sent. They may also be bounded in time: if the
104104subscriber stops taking messages for at least X time, the buffer is
105−full. Gall taks a hybrid approach; currently the heuristic is that the
105+full. Gall taks a hybrid approach; currently the heuristic is that the
106106buffer counts as full if it has at least five messages and it has been
10710730 seconds since a message was acknowledged.
108108
109109### One at a time
110110
111−Another scheme is to avoid multi-message subscriptions. Instead of
111+Another scheme is to avoid multi-message subscriptions. Instead of
112112allowing the subscriber to subscribe to all future updates on a path,
113−allow them to "subscribe" to the *next* update only. When they get that
113+allow them to "subscribe" to the _next_ update only. When they get that
114114update, they subscribe to the new next update, so that they ultimately
115115get every message.
116116
@@ -122,41 +122,41 @@ This is near the theoretical ideal for memory usage, since you'll never
122122queue up several messages to send to the subscriber.
123123
124124It also encourages processing each update in order rather than zooming
125−forward from time to time. It's possible (if a little awkward) to
125+forward from time to time. It's possible (if a little awkward) to
126126simulate this with buffers though, and it's possible to allow zooming
127127forward in the one-at-a-time scheme by having the requests be "most
128128recent after update N" instead of "next after update N".
129129
130130This scheme is at its strongest, then, when you're already storing
131131intermediate states or updates, or when you don't care about
132−intermediate states and always send the most recent one. Otherwise,
132+intermediate states and always send the most recent one. Otherwise,
133133buffers are a convenient place to temporarily store updates that you
134−don't want to store internally. Of course, if it's semantically
134+don't want to store internally. Of course, if it's semantically
135135important that you give each update separately, buffers won't save you
136136from having to store the intermediate updates, since they may fill up.
137137
138138Another conceptual advantage is that it has no notion of "connectivity".
139−It operates forever in a single mode. By contrast, buffer-based
139+It operates forever in a single mode. By contrast, buffer-based
140140solutions must keep track of whether the buffer is full and react to
141−that. This increases complexity in the system, and complexity is the
141+that. This increases complexity in the system, and complexity is the
142142great evil.
143143
144144The biggest disadvantage of this system is that it takes much longer to
145−process many small updates. With buffers, the publisher could have a
145+process many small updates. With buffers, the publisher could have a
146146dozen small updates in flight at the same time, while in this scheme
147147they would only send one at a time, waiting for a response between each
148−one. Losing this pipelining can be quite significant for some
148+one. Losing this pipelining can be quite significant for some
149149applications, but for low-volume subscriptions (certainly anything that
150150updates less than once per minute) this will have no noticeable effect.
151151
152−Clay uses this scheme. It's low-volume, it stores all previous states
152+Clay uses this scheme. It's low-volume, it stores all previous states
153153anyway (since it's a revision-control system), and it's sometimes
154154important to get updates one at a time (for example when downloading OTA
155−software updates). Ships that send OTA updates often have many ships
155+software updates). Ships that send OTA updates often have many ships
156156subscribed to them, and the updates themselves may be large, so it's
157157important they don't queue up when ships inevitably disappear.
158158
159159I tend to think most Gall subscriptions should follow this pattern as
160−well. Our most latency-sensitive subscriptions are chat messages, and
160+well. Our most latency-sensitive subscriptions are chat messages, and
161161while I haven't tested it, I would guess that even those wouldn't be
162162affected by this scheme.
content/docs/arvo/dill/_index.md+16
@@ -5,3 +5,19 @@ sort_by = "weight"
55template = "sections/docs/chapters.html"
66insert_anchor_links = "right"
77+++
8+
9+[Overview](/docs/avro/dill/dill)
10+
11+A brief overview of the Dill vane.
12+
13+[API Reference](/docs/arvo/dill/tasks)
14+
15+The `task`s Dill takes and the `gift`s it returns.
16+
17+[Scry Reference](/docs/arvo/dill/scry)
18+
19+The scry endpoints of Dill.
20+
21+[Data Types](/docs/arvo/dill/data-types)
22+
23+Reference documentation of the data types used by Dill.
content/docs/arvo/dill/data-types.mdnew file+187
@@ -0,0 +1,187 @@
1++++
2+title = "Data Types"
3+weight = 4
4+template = "doc.html"
5++++
6+
7+Here are the data types used by Dill, as defined in `/sys/lull.hoon`.
8+
9+## `$blew`
10+
11+```hoon
12+ +$ blew [p=@ud q=@ud]
13+```
14+
15+Terminal dimension; `p` is columns, `q` is rows. This structure is passed to Dill by the runtime in a [%blew](/docs/arvo/dill/tasks#blew) `task` whenever the dimensions of the terminal changes.
16+
17+## `$belt`
18+
19+```hoon
20++$ belt
21+ $? bolt
22+ $% [%mod mod=?(%ctl %met %hyp) key=bolt]
23+ [%txt p=(list @c)]
24+ [%ctl p=@c]
25+ [%met p=@c]
26+ == ==
27+```
28+
29+Terminal client input.
30+
31+A `$belt` is passed to Dill in a [%belt](/docs/arvo/dill/tasks#belt) `task` by the runtime whenever there is input, such as a user typing in the console. This is only used between the terminal client and Dill, a [$dill-belt](#dill-belt) is used between Dill and Arvo.
32+
33+May either be a [$bolt](#bolt) or one of:
34+
35+- `%mod` - Modifier (Ctrl, Meta or Hyper) plus [key].
36+- `%txt` - A series of characters
37+- `%ctl` - Ctrl+[key], deprecated in favour of `%mod`.
38+- `%met` - Meta+[key], deprecated in favour of `%mod`.
39+
40+## `$bolt`
41+
42+```hoon
43++$ bolt
44+ $@ @c
45+ $% [%aro p=?(%d %l %r %u)]
46+ [%bac ~]
47+ [%del ~]
48+ [%hit r=@ud c=@ud]
49+ [%ret ~]
50+ ==
51+```
52+
53+Simple input.
54+
55+Either a single simple character or one of:
56+
57+- `%aro` - Arrow keys.
58+- `%bac` - Backspace key.
59+- `%del` - Delete key.
60+- `%hit` - Mouse click - `r` is row and `c` is column. Note these are zero-indexed, with `[0 0]` being the _bottom left_ corner.
61+- `%ret` - Return (Enter) key.
62+
63+## `$blit`
64+
65+```hoon
66++$ blit
67+ $% [%bel ~]
68+ [%clr ~]
69+ [%hop p=@ud]
70+ [%klr p=stub]
71+ [%lin p=(list @c)]
72+ [%mor ~]
73+ [%sag p=path q=*]
74+ [%sav p=path q=@]
75+ [%url p=@t]
76+ ==
77+```
78+
79+Terminal client output.
80+
81+A `$blit` is given to the terminal client by Dill in a `%blit` `gift` when it wants to print some text, clear the screen, go _ding_ or what have you.
82+
83+This is only used between Dill and the terminal client, a [$dill-blit](#dill-blit) is used instead between Arvo and Dill.
84+
85+A `$blit` is one of:
86+
87+- `%bel` - Ring the terminal bell.
88+- `%clr` - Clear the screen.
89+- `%hop` - Set cursor position, `p` specifies its position on the prompt line.
90+- `%klr` - Set styled line, the `$stub` specifies the text and style.
91+- `%lin` - Set current line, `p` contains the text.
92+- `%mor` - Newline.
93+- `%sag` - Save to jamfile, typically in `/[pier]/.urb/put/`. `p` is `/[path]/[filename]/[extension]`. For example, `/foo/bar` will save it in `/[pier]/.urb/put/foo.bar`, `/a/b/c/foo/bar` will save it in `/[pier]/.urb/put/a/b/c/foo.bar`, and `/foo` will save it in `/[pier]/.urb/put.foo`. `q` is the `noun` to `jam` and save in the file.
94+- `%sav` - Save to file. Same behaviour as `%sag` except `q` is an `atom` rather than a `noun` and therefore doesn't need to be `jam`med. The `atom` is written to disk as if it were the bytestring in the tail of an `$octs`. That is, `%sav`ing the `cord` `'abcdef'`, whose `@ux` value is `0x6665.6463.6261`, results in a unix file whose hex dump renders as `61 62 63 64 65 66`.
95+- `%url` - Activate URL, `p` is the URL.
96+
97+## `$dill-belt`
98+
99+```hoon
100++$ dill-belt
101+ $% [%aro p=?(%d %l %r %u)]
102+ [%bac ~]
103+ [%cru p=@tas q=(list tank)]
104+ [%ctl p=@]
105+ [%del ~]
106+ [%hey ~]
107+ [%met p=@]
108+ [%ret ~]
109+ [%rez p=@ud q=@ud]
110+ [%txt p=(list @c)]
111+ [%yow p=gill:gall]
112+ ==
113+```
114+
115+Terminal input for Arvo.
116+
117+While [$belt](#belt) is used between the terminal client and Dill, `$dill-belt` is used between Dill and Arvo.
118+
119+a `$dill-belt` is one of:
120+
121+- `%aro` - Arrow keys.
122+- `%bac` - Backspace key.
123+- `%cru` - Echo error, `p` is an error `@tas` and `q` is a traceback.
124+- `%ctl` - Ctrl+[key].
125+- `%del` - Delete key.
126+- `%hey` - Refresh.
127+- `%met` - Meta+[key].
128+- `%ret` - Return key (Enter).
129+- `%rez` - Terminal resized, `p` is columns and `q` is rows.
130+- `%txt` - Text input.
131+- `%yow` - Connect to app.
132+
133+## `$dill-blit`
134+
135+```hoon
136++$ dill-blit
137+ $% [%bel ~]
138+ [%clr ~]
139+ [%hop p=@ud]
140+ [%klr p=stub]
141+ [%mor p=(list dill-blit)]
142+ [%pom p=stub]
143+ [%pro p=(list @c)]
144+ [%qit ~]
145+ [%out p=(list @c)]
146+ [%sag p=path q=*]
147+ [%sav p=path q=@]
148+ [%url p=@t]
149+ ==
150+```
151+
152+Terminal output from Arvo.
153+
154+While [$blit](#blit) is used between Dill and the terminal client, `$dill-blit` is used between Arvo and Dill.
155+
156+A `$dill-blit` is one of:
157+
158+- `%bel` - Terminal bell.
159+- `%clr` - Clear screen.
160+- `%hop` - Set cursor position, `p` is its horizontal position on the prompt line.
161+- `%klr` - Styled text, the `$stub` specifies both the text and style.
162+- `%mor` - Multiple `$dill-blit`.
163+- `%pom` - Styled prompt, the `$stub` specifies both the text and style.
164+- `%pro` - Set prompt, `p` is the text for the prompt.
165+- `%qit` - Close console.
166+- `%out` - Print text.
167+- `%sag` - Save `noun` to jamfile. See [$blit](#blit) section for further details.
168+- `%sav` - Save `atom` to file. See [$blit](#blit) section for further details.
169+- `%url` - Activate URL.
170+
171+## `$flog`
172+
173+```hoon
174++$ flog
175+ $% [%crop p=@ud]
176+ [%crud p=@tas q=(list tank)]
177+ [%heft ~]
178+ [%meld ~]
179+ [%pack ~]
180+ [%text p=tape]
181+ [%verb ~]
182+ ==
183+```
184+
185+Wrapped Dill `task`s.
186+
187+These are a subset of Dill's `task`s which can be wrapped in a `%flog` `task`. See the [API Reference](/docs/arvo/dill/tasks) document for details of each of these `task`s.
content/docs/arvo/dill/dill-api.mddeleted−366
@@ -1,366 +0,0 @@
1−+++
2−title = "API Reference"
3−weight = 10
4−template = "doc.html"
5−+++
6−
7−In this document we describe the public interface for Dill. Namely, we describe
8−each `task` that Dill can be `pass`ed, and which `gift`(s) Dill can `give` in return.
9−
10−Dill is unique among vanes since it is technically the first vane to be booted (though we
11−regard Jael as the "true" first vane). As a result, there are four `task`s in
12−`task:able:dill` for which Dill acts only as a middleman that passes the `task`s
13−directly to the Arvo kernel. Thus we have split this document into a [Dill
14−tasks](#dill-tasks) section and an [Arvo tasks](#arvo-tasks) section.
15−
16−## Dill Tasks
17−
18−
19−### `%belt`
20−
21−Every keystroke entered into the console triggers a `%belt` `task` for Dill which contains information about the keystroke, such as which key was pressed
22−and from which terminal.
23−
24−#### Accepts
25−
26−`%belt` `task`s come in a number of different types, corresponding to different
27−keystrokes. You can find this list in `+dill-belt` in `zuse.hoon`.
28−
29−```hoon
30−++ dill-belt :: new belt
31− $% {$aro p/?($d $l $r $u)} :: arrow key
32− {$bac ~} :: true backspace
33− {$cru p/@tas q/(list tank)} :: echo error
34− {$ctl p/@} :: control-key
35− {$del ~} :: true delete
36− {$hey ~} :: refresh
37− {$met p/@} :: meta-key
38− {$ret ~} :: return
39− {$rez p/@ud q/@ud} :: resize, cols, rows
40− {$txt p/(list @c)} :: utf32 text
41− {$yow p/gill:gall} :: connect to app
42− == ::
43−```
44−
45−#### Returns
46−
47−Dill returns no `gift` in response to a `%belt` `task`.
48−
49−
50−### `%blew`
51−
52−This `task` is called whenever the terminal emulator is resized, so that Dill can adjust
53−the text output to fit the new window size.
54−
55−#### Accepts
56−
57−```hoon
58−[p=@ud q=@ud]
59−```
60−
61−`p` is the number of columns and `q` is the number of rows.
62−
63−#### Returns
64−
65−Dill returns no `gift` in response to a `%blew` `task`.
66−
67−
68−### `%boot`
69−
70−This `task` is used only once, when Arvo first enters the [adult
71−stage](/docs/arvo/overview#structural-interface-core). Dill is
72−technically the first vane to be activated, via the `%boot` `task`, which then
73−send Jael (considered the the "true" first vane) an `%init` `task`, which then goes on to
74−call `%init` `task`s for other vanes (including Dill).
75−
76−#### Accepts
77−
78−`%boot` takes an argument that is either `%dawn` or `%fake`. `%dawn` is the one
79−used in any typical scenario and activates the ordinary vane initialization
80−process outlined above, while `%fake` is a debugging tool.
81−
82−#### Returns
83−
84−`%boot` does not return a `gift`.
85−
86−
87−
88−### `%crud`
89−
90−This `task` is used by Dill to produce error reports. It prints the received
91−error message(s) (a `(list tank)`) to the terminal. The level of detail of the
92−error message is set by `$log-level`, which is either `%hush`, `%soft`, or `%loud`.
93−
94−#### Accepts
95−
96−```hoon
97−[err=@tas tac=(list tank)]
98−```
99−
100−`err` is the type of error and `tac` is the associated error message.
101−
102−#### Returns
103−
104−`%crud` does not return a `gift`.
105−
106−
107−### `%flog`
108−
109−A `%flog` `task` is a wrapper over a `task` sent by another vane. Dill removes the wrapper
110−and sends the bare `task` to itself over the default `duct`.
111−
112−#### Accepts
113−
114−`%flog` `task`s can take any valid Dill `task` as an argument.
115−
116−#### Returns
117−
118−`%flog` never returns a `gift` on its own, but the wrapped `task` might.
119−
120−#### Example
121−
122−`%crud` `task`s from other vanes are typically passed to Dill wrapped in a
123−`%flog` `task` to print errors to the terminal.
124−
125−
126−
127−### `%flow`
128−
129−This `task` is not used.
130−
131−
132−### `%hail`
133−
134−`%hail` refreshes the terminal by sending an empty message to the default duct
135−for Dill,
136−causing the terminal to redraw itself (?)
137−
138−#### Accepts
139−
140−```hoon
141−[ ~ ]
142−```
143−
144−#### Returns
145−
146−`%hail` returns no `gift`s.
147−
148−
149−### `%heft`
150−
151−`%heft` causes Dill to `pass` a `%wegh` `task` to all other vanes (but not to
152−itself), thus obtaining a complete digest of Arvo's memory usage.
153−
154−#### Accepts
155−
156−```hoon
157−[ ~ ]
158−```
159−
160−#### Returns
161−
162−`%heft` does not directly return any `gift`s, but each `%wegh` `task` sent will
163−return a `%mass` `gift`.
164−
165−
166−### `%hook`
167−
168−This task is not used.
169−
170−
171−### `%harm`
172−
173−This `task` is not used.
174−
175−
176−### `%init`
177−
178−This `task` is called only once, when Arvo first enters the [adult
179−stage](/docs/arvo/overview#structural-interface-core). It performs
180−initial setup for Dill, such as setting the width of the console.
181−
182−Note that this is not actually the first `task` passed to Dill - see [%boot](#%boot).
183−
184−#### Accepts
185−
186−`%init` takes no arguments.
187−
188−#### Returns
189−
190−`%init` returns no `gift`s.
191−
192−
193−### `%knob`
194−
195−`%knob` sets the verbosity level for each error tag.
196−
197−#### Accepts
198−
199−```hoon
200−[tag=@tas level=log-level]
201−```
202−
203−`tag` is the error tag. `level` is the verbosity, set to either `%hush`,
204−`%soft`, or `%loud`.
205−
206−#### Returns
207−
208−`%knob` does not return a gift.
209−
210−
211−
212−
213−### `%noop`
214−
215−`%noop` does nothing - it stands for "no operation".
216−
217−#### Accepts
218−
219−```hoon
220−[ ~ ]
221−```
222−
223−#### Returns
224−
225−This `task`, predictably, returns nothing.
226−
227−#### Example
228−
229−This can be useful if a shell command requires a Dill `task` but you don't want
230−Dill to do anything.
231−
232−
233−
234−### `%talk`
235−
236−This `task` is not used.
237−
238−### `%text`
239−
240−This `task` prints a `tape` to the dojo by first converting it from a UTF8
241−`tape` to a `list` of UTF32 codepoints (`@c`'s) and then recursively popping off a character from the
242−`tape` and sending it to to Unix to be printed into the terminal via a `%blit` event.
243−
244−#### Accepts
245−
246−```hoon
247−[p=tape]
248−```
249−
250−#### Returns
251−
252−This `task` returns zero or more `%blit` `gift`s, each containing a .
253−
254−
255−### `%trim`
256−
257−`%trim` is a common vane `task` used to reduce memory usage. However, it does
258−nothing for Dill.
259−
260−#### Accepts
261−
262−```hoon
263−[p=@ud]
264−```
265−
266−This is a common parameter for `%trim` `task`s across all vanes but does nothing
267−for Dill.
268−
269−#### Returns
270−
271−This `task` returns no `gift`s.
272−
273−
274−
275−### `%vega`
276−
277−This is a common vane `task` used to inform the vane that the kernel has been
278−upgraded. Dill does not do anything in response to this.
279−
280−#### Accepts
281−
282−```hoon
283−[ ~ ]
284−```
285−
286−#### Returns
287−
288−This `task` returns no `gift`s.
289−
290−
291−
292−## Arvo tasks
293−
294−These `task`s live in `task:able:dill` but are passed directly to the Arvo
295−kernel for processing.
296−
297−### `%lyra`
298−
299−This `task` updates the kernel.
300−
301−#### Accepts
302−
303−```hoon
304−[p=@t q=@t]
305−```
306−
307−`p` is the contents of the new `hoon.hoon` and `q` is the contents of the new `arvo.hoon`.
308−
309−#### Returns
310−
311−This `task` returns no `gift`s.
312−
313−
314−### `%pack`
315−
316−This `task` defragments and deduplicates Arvo's memory. This is ultimately
317−performed by the interpreter so you won't find the code in `arvo.hoon` but
318−rather under `c3__pack` in `urbit/worker/main.c`.
319−
320−#### Accepts
321−
322−```hoon
323−[ ~ ]
324−```
325−
326−#### Returns
327−
328−This `task` returns no `gift`s.
329−
330−
331−### `%veer`
332−
333−This `task` is used to install `zuse` and vanes. It is handled by `+veer` in
334−`arvo.hoon`.
335−
336−#### Accepts
337−
338−```hoon
339−[p=@ta q=path r=@t]
340−```
341−
342−`p` is the vane letter, `q` is the formal `path` to the
343−vane, and `r` is the source code for the vane. The vane letter is `%` followed
344−by the first letter of the vane in lowercase, such as `%d` for Dill. `p=%$` in
345−the case of `zuse`.
346−
347−#### Returns
348−
349−This `task` returns no `gift`s.
350−
351−
352−### `%verb`
353−
354−This `task` toggles verbose mode for all of Arvo, which is located here since
355−Dill is the vane that prints errors. To be precise, `%verb` toggles the laconic
356−bit `lac` in the [Arvo state](/docs/arvo/overview#the-state).
357−
358−#### Accepts
359−
360−```hoon
361−[ ~ ]
362−```
363−
364−#### Returns
365−
366−This `task` returns no `gift`s.
content/docs/arvo/dill/dill.md+35−18
@@ -4,21 +4,38 @@ weight = 1
44template = "doc.html"
55aliases = ["/docs/learn/arvo/dill/"]
66+++
7−Our terminal driver.
8−
9−Unix sends keyboard events to `%dill` from either the console or telnet,
10−and `%dill` produces terminal output. The only app that should directly
11−talk to `%dill` is the terminal app. Command-line apps are run by,
12−receive input from, and produce output to, the `%shell` app, which is
13−controlled by `%terminal`, which talks to `%dill`, which talks to unix.
14−Clay also uses `%dill` directly to print out the filesystem change
15−events, but this is questionable behavior.
16−
17−`%dill` has two main components. First, it controls the terminal on a
18−very basic, event-by-event level. This includes keeping track of things
19−like the dimensions of the terminal, the prompt type (plain text or
20−password), which duct to produce effects on, and so forth. Second, it
21−handles terminal events, keystroke by keystroke. Most characters are
22−simply pushed onto the buffer and blitted to the screen, but some
23−characters, including control-modified keys, arrow keys, etc. require
24−special handling. Most of the readline functionality is in `%dill`.
7+
8+The terminal driver vane.
9+
10+Keyboard events and the like from Unix are received by Dill as [%belt](/docs/arvo/dill/tasks#belt) `task`s, and Dill sends `%blit` `gift`s containing [$blit](/docs/arvo/dill/data-types#blit)s back to the runtime to be displayed in the Unix terminal. The manner of interacting with Dill differs depending on whether you're in userspace or kernelspace, as we'll explore below.
11+
12+## Kernelspace
13+
14+For technical reasons, Dill performs a handful of system tasks related to booting a ship and some memory operations. Aside from those, other Vanes mostly just pass Dill [tasks](/docs/arvo/dill/tasks) to print error messages and the like to the terminal.
15+
16+## Userspace
17+
18+Unlike in kernelspace, userspace applications are unlikely to `%pass` Dill `task`s directly. Instead, Dill looks at things in terms of sessions. A session is a pipeline between a client and a handler, where:
19+
20+- The client is an external input source and output sink; a terminal with with dimensions and so forth.
21+- The handler is an application in Urbit that interprets input, maybe does something with it, maybe produces output to be displayed in the client, etc.
22+
23+There are plans for Dill to support multiple independent sessions (i.e. independent terminal clients displaying and processing different information at the same time), but at this stage Dill only supports a single session. The client for this default session is just the Unix terminal via the Urbit runtime. The handler for the default session is the `%hood` app, whose `drum` module does the heavy lifting.
24+
25+`drum` is the CLI app manager. By default you'll have a couple of CLI applications running—`%dojo` and `%chat-cli`—which you can switch between with `ctrl+x`. You may also have additional CLI apps which you have attached with the `|link` command. It's `drum` that keeps track of which one is active, which one input should be routed to, which one should be displayed, what each prompt should look like, and so forth. Dill itself is oblivious to the distinction between these CLI apps. It only sees the default session with `drum`, so it just passes all input to `drum` and display whatever `drum` gives it.
26+
27+While `drum` talks with Dill in `$dill-belt`s and `$dill-blit`s, it talks to CLI apps with `$sole-action`s and `$sole-event`s, which are defined in the `sole` library. For more information on the `sole` library and the related `shoe` library, and for information on how to build CLI apps, you can refer to the [CLI app tutorial](/docs/hoon/guides/cli-tutorial).
28+
29+To give a basic idea of how keyboard events flow through these systems and produce terminal output, here's a diagram showing the messages in pseudo-Hoon:
30+
31+![Dill userspace diagram](https://media.urbit.org/docs/arvo/dill/dill-userspace.svg)
32+
33+You can use a [move trace](/docs/arvo/tutorials/move-trace) to get a hands-on feel for this data flow.
34+
35+## Sections
36+
37+[API Reference](/docs/arvo/dill/tasks) - The `task`s Dill takes and the `gift`s it returns.
38+
39+[Scry Reference](/docs/arvo/dill/scry) - The scry endpoints of Dill.
40+
41+[Data Types](/docs/arvo/dill/data-types) - Reference documentation of the data types used by Dill.
content/docs/arvo/dill/scry.mdnew file+45
@@ -0,0 +1,45 @@
1++++
2+title = "Scry Reference"
3+weight = 3
4+template = "doc.html"
5++++
6+
7+Here are the scry endpoints of Dill. They take a `%x` `care` and require the `desk` in the path prefix be empty, so the general format is `.^([type] %dx /=//=/[some-path])`.
8+
9+Dill only has a couple of scry endpoints, both of which begin with `/session//`. The empty `//` would be where the target session would be specified, but at this stage Dill can only return a result for the default session, so it's always empty.
10+
11+## /sessions//line
12+
13+A scry with a `care` of `%x` and a `path` of `/sessions//line` returns the current text of the prompt line of the default session. The type returned is a [$blit](/docs/arvo/dill/data-types#blit).
14+
15+#### Example
16+
17+```
18+> .^(blit:dill %dx /=//=/sessions//line)
19+[ %lin
20+ p
21+ ~[
22+ ~-~~
23+ ~-z
24+ ~-o
25+ ~-d
26+ ~-~3a.
27+ ~-d
28+ ~-o
29+ ~-j
30+ ~-o
31+ ...truncated for brevity...
32+ ]
33+]
34+```
35+
36+## /sessions//cursor
37+
38+A scry with a `care` of `%x` and a `path` of `/sessions//cursor` returns the current horizontal position of the cursor in the default session. The type returned is a `@ud`.
39+
40+#### Example
41+
42+```
43+> .^(@ud %dx /=//=/sessions//cursor)
44+44
45+```
content/docs/arvo/dill/tasks.mdnew file+342
@@ -0,0 +1,342 @@
1++++
2+title = "API Reference"
3+weight = 2
4+template = "doc.html"
5++++
6+
7+In this document we describe the public interface for Dill. Namely, we describe each `task` that Dill can be `pass`ed, and which `gift`(s) Dill can `give` in return.
8+
9+## `%belt`
10+
11+```hoon
12+[%belt p=belt]
13+```
14+
15+Terminal input.
16+
17+The runtime sends a `%belt` `task` to Dill whenever there is input in the terminal, such as a keystroke.
18+
19+The [$belt](/docs/arvo/dill/data-types#belt) in `p` contains the input such as which key was pressed.
20+
21+Dill will convert the `$belt` into a [$dill-belt](/docs/arvo/dill/data-types#dill-belt) and `%poke` the session handler (typically `drum`) with it.
22+
23+This `task` would not typically be used from userspace.
24+
25+#### Returns
26+
27+Dill returns no `gift` in response to a `%belt` `task`.
28+
29+## `%blew`
30+
31+```hoon
32+[%blew p=blew]
33+```
34+
35+Terminal resized.
36+
37+The runtime passes Dill a `%blew` `task` whenever the terminal is resized.
38+
39+The [$blew](/docs/arvo/dill/data-types#blew) specifies the new dimensions.
40+
41+Dill will convert the `$blew` into a `%rez` [$dill-belt](/docs/arvo/dill/data-types#dill-belt) and `%poke`s the session handler (typically `drum`) with it.
42+
43+This `task` would not typically be used from userspace.
44+
45+#### Returns
46+
47+Dill returns no `gift` in response to a `%blew` `task`.
48+
49+## `%boot`
50+
51+```hoon
52+[%boot lit=? p=*]
53+```
54+
55+This `task` is used only once, when Arvo first enters the [adult stage](/docs/arvo/overview#structural-interface-core). Dill is technically the first vane to be activated, via the `%boot` `task`, which then sends Jael (considered the "true" first vane) the `%dawn` or `%fake` `task` wrapped in the `%boot` `task`. Jael then goes on to call `%init` `task`s for other vanes (including Dill).
56+
57+`lit` specifies whether to boot in lite mode. `p` is either a [%dawn](/docs/arvo/jael/data-types#dawn) or [%fake](/docs/arvo/jael/tasks#fake) `task:jael`. `%dawn` is for an ordinary boot and `%fake` is for booting a fake ship.
58+
59+This `task` would not be used from userspace.
60+
61+#### Returns
62+
63+Dill returns no `gift` in response to a `%boot` `task`, but it will `%pass` the wrapped `%dawn` or `%fake` `task` to Jael.
64+
65+## `%crop`
66+
67+```hoon
68+[%crop p=@ud]
69+```
70+
71+Trim kernel state.
72+
73+This `task` is the same as the [%trim](#trim) `task`. Like `%trim`, Dill does nothing with it.
74+
75+#### Returns
76+
77+Dill returns no `gift` in response to a `%crop` `task`.
78+
79+## `%crud`
80+
81+```hoon
82+[%crud p=@tas q=(list tank)]
83+```
84+
85+Print error.
86+
87+Dill prints the given error to the terminal. The verbosity for the particular `@tas` error tag specified in `p` is determined by the `level` set by a [%knob](#knob) `task` - either `%hush`, `%soft` or `%loud`. The default is `%loud`, where it will print the full `(list tank)` specified in `q`. See [%knob](#knob) for details of verbosity levels.
88+
89+#### Returns
90+
91+Dill does not return a `gift` in response to a `%crud` `task`.
92+
93+## `%flee`
94+
95+```hoon
96+[%flee session=~]
97+```
98+
99+Unwatch a session to which you've previously subscribed with [%view](#view).
100+
101+The ability to specify a session is not yet implemented in Dill, so `session` is always `~`, the default session.
102+
103+#### Returns
104+
105+Dill does not return a `gift` in response to a `%flee` `task`.
106+
107+## `%flog`
108+
109+```hoon
110+[%flog p=flog]
111+```
112+
113+A `%flog` `task` is a wrapper over a `task` sent by another vane. Dill removes the wrapper and sends the bare `task` to itself over the default `duct`.
114+
115+A `%flog` `task` takes a [$flog](/docs/arvo/dill/data-types#flog) as its argument. A `$flog` is a subset of Dill's `task`s.
116+
117+#### Returns
118+
119+Dill does not return a `gift` in response to a `%flog` `task`.
120+
121+## `%flow`
122+
123+```hoon
124+[%flow p=@tas q=(list gill:gall)]
125+```
126+
127+Terminal config.
128+
129+This `task` is not used.
130+
131+## `%hail`
132+
133+```hoon
134+[%hail ~]
135+```
136+
137+Refresh.
138+
139+Dill converts a `%hail` `task` into a `%hey` [$dill-belt](/docs/arvo/dill/data-types#dill-belt) and `%poke`s the session handler (typically `drum`) with it to handle the refresh.
140+
141+This `task` would not be used from userspace.
142+
143+#### Returns
144+
145+Dill returns no `gift` in response to a `%hail` `task`.
146+
147+## `%heft`
148+
149+```hoon
150+[%heft ~]
151+```
152+
153+Produce memory report.
154+
155+When Dill receives a `%heft` `task` it passes Arvo a `%whey` `waif` to obtain a memory report and prints it to the terminal.
156+
157+#### Returns
158+
159+Dill does not return a `gift` in response to a `%heft` `task`.
160+
161+## `%hook`
162+
163+```hoon
164+[%hook ~]
165+```
166+
167+This terminal hung up.
168+
169+This task is not used.
170+
171+## `%harm`
172+
173+```hoon
174+[%harm ~]
175+```
176+
177+All terminals hung up.
178+
179+This `task` is not used.
180+
181+## `%init`
182+
183+```hoon
184+[%init ~]
185+```
186+
187+This `task` is called only once, when Arvo first enters the [adult stage](/docs/arvo/overview#structural-interface-core). It performs initial setup for Dill, such as setting the width of the console.
188+
189+Note that this is not actually the first `task` passed to Dill - see [%boot](#%boot).
190+
191+This `task` would not be used from userspace.
192+
193+#### Returns
194+
195+Dill does not return a `gift` in response to a `%init` `task`.
196+
197+## `%meld`
198+
199+```
200+[%meld ~]
201+```
202+
203+Deduplicate persistent state.
204+
205+Dill asks the runtime to perform the memory deduplication.
206+
207+#### Returns
208+
209+Dill does not return a `gift` in response to a `%meld` `task`.
210+
211+## `%noop`
212+
213+```hoon
214+[%noop ~]
215+```
216+
217+No operation.
218+
219+A `%noop` `task` does nothing, as the name implies.
220+
221+#### Returns
222+
223+Dill does not return a `gift` in response to a `%noop` `task`.
224+
225+## `%pack`
226+
227+```hoon
228+[%pack ~]
229+```
230+
231+Defragment persistent state.
232+
233+Dill asks the runtime to perform the defragmentation.
234+
235+#### Returns
236+
237+Dill does not return a `gift` in response to a `%meld` `task`.
238+
239+## `%talk`
240+
241+```hoon
242+[%talk p=tank]
243+```
244+
245+This `task` is not used.
246+
247+## `%text`
248+
249+```hoon
250+[%text p=tape]
251+```
252+
253+Print `tape` to terminal.
254+
255+Upon receiving a `%text` `task`, Dill will convert the `tape` given in `p` to a `(list @c)` and give it to the runtime in a `%blit` `gift` including a `%lin` [$blit](/docs/arvo/dill/data-types#blit).
256+
257+#### Returns
258+
259+Dill does not return a `gift` in response to a `%text` `task`, but it does give a `%blit` `gift` to the runtime which looks like:
260+
261+```hoon
262+[%blit p=(list blit)]
263+```
264+
265+## `%view`
266+
267+```hoon
268+[%view session=~]
269+```
270+
271+Watch session.
272+
273+A `%view` `task` subscribes for a copy of all `%blit` `gift`s which Dill `%give`s for the default session. This `task` is used by the `%herm` app so it can convert the `$blit`s to JSON and render them in the web terminal.
274+
275+The ability to specify a session is not yet implemented in Dill, so `session` is always `~`, the default session.
276+
277+#### Returns
278+
279+Dill will `%give` a copy of all `%blit`s for the default session. A `%blit` `gift` is:
280+
281+```hoon
282+[%blit p=(list blit)]
283+```
284+
285+## `%trim`
286+
287+```hoon
288+[%trim p=@ud]
289+```
290+
291+`%trim` is a common vane `task` used to reduce memory usage. It does nothing for Dill because Dill only keeps a minimal necessary state.
292+
293+#### Returns
294+
295+Dill does not return a `gift` in response to a `%trim` `task`.
296+
297+## `%vega`
298+
299+```hoon
300+[%vega ~]
301+```
302+
303+This is a common vane `task` used to inform the vane that the kernel has been
304+upgraded. Dill does not do anything in response to this.
305+
306+This `task` would not be used from userspace.
307+
308+#### Returns
309+
310+Dill returns no `gift` in response to a `%vega` `task`.
311+
312+## `%verb`
313+
314+```hoon
315+[%verb ~]
316+```
317+
318+This `task` toggles verbose mode for all of Arvo, which is located here since
319+Dill is the vane that prints errors. To be precise, `%verb` toggles the laconic
320+bit `lac` in the [Arvo state](/docs/arvo/overview#the-state) by passing a `%verb` `waif` to Arvo.
321+
322+#### Returns
323+
324+Dill does not return a `gift` in response to a `%verb` `task`.
325+
326+## `%knob`
327+
328+```hoon
329+[%knob tag=term level=?(%hush %soft %loud)]
330+```
331+
332+`%knob` sets the verbosity level for each error tag. The error `tag` can be any `@tas`. The given `tag` and `level` will be added to Dill's `veb` which maps tags to levels. Subsequent [%crud](#crud) `task`s will then print with the specified verbosity.
333+
334+The `level`s behave like so:
335+
336+- `%hush` - Completely silent, print nothing.
337+- `%soft` - Just print `crud: %error-tag event failed`, ignore any `tang` given in the `%crud`.
338+- `%loud` - Print the `%soft` message as well as the full `tang` given in the `%crud` `task`.
339+
340+#### Returns
341+
342+Dill does not return a `gift` in response to a `%knob` `task`.
content/docs/arvo/eyre/examples.md+5−5
@@ -309,9 +309,9 @@ Note that this example does a lot of things manually for demonstrative purposes.
309309Save the above to `/app/eyre-agent.hoon`. Commit it:
310310
311311```
312−> |commit %home
312+> |commit %base
313313>=
314−+ /~zod/home/2/app/eyre-agent/hoon
314++ /~zod/base/2/app/eyre-agent/hoon
315315```
316316
317317...and start it:
@@ -320,7 +320,7 @@ Save the above to `/app/eyre-agent.hoon`. Commit it:
320320> |start %eyre-agent
321321>=
322322gall: loading %eyre-agent
323−activated app home/eyre-agent
323+activated app base/eyre-agent
324324[unlinked from [p=~zod q=%eyre-agent]]
325325```
326326
@@ -430,7 +430,7 @@ Here we'll look at running a generator via Eyre. Eyre doesn't have a mediated JS
430430
431431You can refer to the [%serve](/docs/arvo/eyre/tasks#serve) section of the [Internal API Reference](/docs/arvo/eyre/tasks) document for relevant details.
432432
433−Here's a very simple generator that will just echo back the body of the request (if available) along with the current datetime. You can save it in the `/gen` directory and `|commit %home`.
433+Here's a very simple generator that will just echo back the body of the request (if available) along with the current datetime. You can save it in the `/gen` directory and `|commit %base`.
434434
435435Note that this example does some things manually for demonstrative purposes. In practice you'd likely want to use a library like `/lib/server.hoon` to cut down on boilerplate code.
436436
@@ -478,7 +478,7 @@ The [$binding](/docs/arvo/eyre/data-types#binding) specifies the site and URL pa
478478Let's bind our generator to the `/mygen` URL path with the `|pass` command in the dojo:
479479
480480```
481−|pass [%e [%serve `/mygen %home /gen/eyre-gen/hoon ~]]
481+|pass [%e [%serve `/mygen %base /gen/eyre-gen/hoon ~]]
482482```
483483
484484Note that Eyre responds with a `%bound` `gift` to indicate whether the binding succeeded but `|pass` doesn't take such responses so it's not shown.
content/docs/arvo/eyre/tasks.md+15−15
@@ -20,7 +20,7 @@ This `task` notifies Eyre of the listening HTTPS and HTTP ports. It is automatic
2020
2121The `insecure` field is the HTTP port and `secure` is the optional HTTPS port.
2222
23−### Returns
23+#### Returns
2424
2525Eyre returns no `gift` in response to a `%live` `task`.
2626
@@ -34,7 +34,7 @@ This `task` either configures HTTPS with a certificate and keypair, or configure
3434
3535The [$http-rule](/docs/arvo/eyre/data-types#http-rule) is either tagged with `%cert` or `%turf`. A `%cert` `http-rule` sets an HTTPS certificate and keypair or removes it if null. A `%turf` `http-rule` either adds or removes a DNS binding depending on whether the `action` is `%put` or `%del`. Note that using `%turf` will automatically cause the system to try and obtain a certificate and keypair via Letsencrypt.
3636
37−### Returns
37+#### Returns
3838
3939Eyre returns no `gift` in response to a `%rule` `task`.
4040
@@ -48,7 +48,7 @@ This `task` is how Eyre receives an inbound HTTP request. It will ordinarily be
4848
4949The `secure` field says whether it's over HTTPS. The `address` is the IP address from which the request originated. The [$request:http](/docs/arvo/eyre/data-types#requesthttp) is the HTTP request itself containing the method, URL, headers, and body.
5050
51−### Returns
51+#### Returns
5252
5353Eyre may `pass` a `%response` `gift` on the appropriate `duct` depending on the contents of the `%request`, state of the connection, and other factors.
5454
@@ -60,7 +60,7 @@ Eyre may `pass` a `%response` `gift` on the appropriate `duct` depending on the
6060
6161This `task` is how Eyre receives an inbound HTTP request over the local loopback port. It behaves the same and takes the same arguments as in the [%request](#request) example except it skips any normally required authentication. Just like for a [%request](#request) `task`, you'd not normally use this manually.
6262
63−### Returns
63+#### Returns
6464
6565Eyre may `pass` a `%response` `gift` on the appropriate `duct` depending on the contents of the `%request`, state of the connection, and other factors.
6666
@@ -74,7 +74,7 @@ This `task` is sent to Eyre by the runtime when an HTTP client closes its previo
7474
7575This `task` takes no arguments.
7676
77−### Returns
77+#### Returns
7878
7979Eyre may `pass` a `%response` `gift` on the appropriate `duct` depending on the state of the connection and other factors.
8080
@@ -98,7 +98,7 @@ The `cage` of the second and subsequent `fact`s must have a `mark` of `%http-res
9898
9999Finally, once you've sent all the `fact`s you want, you can `kick` Eyre's subscription and it will complete the response and close the connection to the HTTP client.
100100
101−### Returns
101+#### Returns
102102
103103Eyre will respond with a `%bound` `gift` which says whether the binding was successful and looks like:
104104
@@ -108,7 +108,7 @@ Eyre will respond with a `%bound` `gift` which says whether the binding was succ
108108
109109The `accepted` field says whether the binding succeeded and the `binding` is the requested binding described above.
110110
111−### Example
111+#### Example
112112
113113See the [Direct HTTP Handling With Gall Agents](/docs/arvo/eyre/examples#direct-http-handling-with-gall-agents) section of the [Examples](/docs/arvo/eyre/examples) document for an example.
114114
@@ -140,11 +140,11 @@ The `?` says whether the HTTP request contained a valid session cookie and the [
140140
141141The `simple-payload:http` returned by the generator is similar to the response described in the [%connect](#connect) section except the HTTP headers and body are all contained in the one response rather than staggered across several.
142142
143−### Returns
143+#### Returns
144144
145145Eyre will return a `%bound` `gift` as described at the end of the [%connect](#connect) section.
146146
147−### Example
147+#### Example
148148
149149See the [Generators](/docs/arvo/eyre/examples#generators) section of the [Examples](/docs/arvo/eyre/examples) document for an example.
150150
@@ -158,7 +158,7 @@ This `task` deletes a URL binding previously set by a `%connect` or `%serve` `ta
158158
159159The [$binding](/docs/arvo/eyre/data-types#binding) is the URL path and domain of the binding you want to delete.
160160
161−### Returns
161+#### Returns
162162
163163Eyre returns no `gift` in response to a `%disconnect` `task`.
164164
@@ -172,7 +172,7 @@ This `task` tells Eyre that the web login code has changed, causing Eyre to thro
172172
173173This `task` takes no arguments.
174174
175−### Returns
175+#### Returns
176176
177177Eyre returns no `gift` in response to a `%code-changed` `task`.
178178
@@ -186,11 +186,11 @@ This `task` tells Eyre to start responding positively to CORS requests for the s
186186
187187The [$origin](/docs/arvo/eyre/data-types#origin) is a CORS origin like `http://foo.example` you want to approve.
188188
189−### Returns
189+#### Returns
190190
191191Eyre returns no `gift` in response to a `%approve-origin` `task`.
192192
193−### Example
193+#### Example
194194
195195See the [Managing CORS Origins](/docs/arvo/eyre/examples#managing-cors-origins) section of the [Examples](/docs/arvo/eyre/examples) document for an example.
196196
@@ -204,10 +204,10 @@ This `task` tells Eyre to start responding negatively to CORS requests for the s
204204
205205The [$origin](/docs/arvo/eyre/data-types#origin) is a CORS origin like `http://foo.example` you want want to reject.
206206
207−### Returns
207+#### Returns
208208
209209Eyre returns no `gift` in response to a `%reject-origin` `task`.
210210
211−### Example
211+#### Example
212212
213213See the [Managing CORS Origins](/docs/arvo/eyre/examples#managing-cors-origins) section of the [Examples](/docs/arvo/eyre/examples) document for an example.
content/docs/arvo/iris/_index.md+4−4
@@ -10,14 +10,14 @@ insert_anchor_links = "right"
1010
1111A brief overbview of Iris, Urbit's HTTP client vane.
1212
13−## [Data Types](/docs/arvo/iris/data-types)
14−
15−Reference documentation of the data types used by Iris.
16−
1713## [API Reference](/docs/arvo/eyre/tasks)
1814
1915The `task`s Iris takes and the `gift`s it returns.
2016
17+## [Data Types](/docs/arvo/iris/data-types)
18+
19+Reference documentation of the data types used by Iris.
20+
2121## [Example](/docs/arvo/iris/example)
2222
2323An example of using Iris to fetch a remote HTTP resource.
content/docs/arvo/iris/data-types.md+1−1
@@ -1,6 +1,6 @@
11+++
22title = "Data Types"
3−weight = 2
3+weight = 3
44template = "doc.html"
55+++
66
content/docs/arvo/iris/example.md+1−1
@@ -4,7 +4,7 @@ weight = 4
44template = "doc.html"
55+++
66
7−Here we'll look at a simple example of fetching a remote HTTP resource with Iris. We'll use the following thread, which you can save in the `/ted` directory of your `%home` desk:
7+Here we'll look at a simple example of fetching a remote HTTP resource with Iris. We'll use the following thread, which you can save in the `/ted` directory of your `%base` desk:
88
99`iris-thread.hoon`
1010
content/docs/arvo/iris/tasks.md+4−4
@@ -1,6 +1,6 @@
11+++
22title = "API Reference"
3−weight = 3
3+weight = 2
44template = "doc.html"
55+++
66
@@ -18,7 +18,7 @@ The [$request:http](/docs/arvo/eyre/data-types#requesthttp) is the request itsel
1818
1919The [$outbound-config](/docs/arvo/iris/data-types#outbound-config) specifies the number of redirects to follow before failing and the number of retries to attempt before giving up. The default values are `5` and `3` respectively. As of writing, **retries and auto-following redirects are not implemented**, so what you specify here is irrelevant and you can just use the bunt value of `outbound-config`.
2020
21−### Returns
21+#### Returns
2222
2323Iris returns a `%http-response` `gift` in response to a `%request` task. A `%response` `gift` looks like:
2424
@@ -32,7 +32,7 @@ The `client-response` structure specifies three kinds of responses - `%progress`
3232
3333Note that neither `%progress` partial messages nor `%cancel` responses have been implemented in Vere at the time of writing, so **you will only ever receive a single `%http-response` `gift` with a `%finished` `client-response`**. If the request fails for some reason, you'll still get an empty `%finished` `client-response` with a `504` status code.
3434
35−### Example
35+#### Example
3636
3737See the [Example](/docs/arvo/iris/example) document.
3838
@@ -46,7 +46,7 @@ Cancel a previous request to fetch a remote HTTP resource.
4646
4747A `%cancel-request` `task` does not take any arguments, the [request](#request) to cancel is determined implicitly.
4848
49−### Returns
49+#### Returns
5050
5151Iris does not return any `gift` in response to a `%cancel-request` `task`. You will also not receive any `gift` back from the original `%request` `task` you've cancelled.
5252
content/docs/arvo/jael/examples.md+3−3
@@ -32,7 +32,7 @@ Here we'll look at subscribing to private key updates from Jael. We'll use a thr
3232(pure:m !>(~))
3333```
3434
35−Save the above thread in the `/ted` directory of your `%home` desk and `|commit %home`.
35+Save the above thread in the `/ted` directory of your `%base` desk and `|commit %base`.
3636
3737Now let's run the thread:
3838
@@ -106,7 +106,7 @@ Here's a thread that performs these actions:
106106
107107Note this example was performed on a comet as a fake ship won't have the required information in Jael.
108108
109−Save the above thread in the `/ted` directory and `|commit %home`. The thread takes a `ship` as an argument, so we'll try to subscribe to pubkey updates for `~dopzod`. Let's run the thread:
109+Save the above thread in the `/ted` directory and `|commit %base`. The thread takes a `ship` as an argument, so we'll try to subscribe to pubkey updates for `~dopzod`. Let's run the thread:
110110
111111```
112112> -sub-pub ~dopzod
@@ -197,7 +197,7 @@ Here's a simple thread that'll pass Jael a `%turf` `task`, take the `%turf` `gif
197197(pure:m !>(~))
198198```
199199
200−Save in in the `/ted` directory of your ship and `|commit %home`. Next, let's try running it:
200+Save in in the `/ted` directory of your ship and `|commit %base`. Next, let's try running it:
201201
202202```
203203> -turf
content/docs/arvo/jael/scry.md+15−15
@@ -10,7 +10,7 @@ Jael's scry endpoints never take a `care`. The particular endpoints are specifie
1010
1111A `%step` scry gets the current web login code revision number. It takes your ship name as its `path` and the type returned is a `@ud`.
1212
13−### Example
13+#### Example
1414
1515```
1616> .^(@ud %j /=step=/(scot %p our))
@@ -21,7 +21,7 @@ A `%step` scry gets the current web login code revision number. It takes your sh
2121
2222A `%code` scry gets the current web login code. It takes your ship name as its `path` and the type returned is a `@p`.
2323
24−### Example
24+#### Example
2525
2626```
2727> .^(@p %j /=code=/(scot %p our))
@@ -32,7 +32,7 @@ A `%code` scry gets the current web login code. It takes your ship name as its `
3232
3333A `%life` scry gets the current `life` (key revision number) of a ship if known, otherwise it crashes. It takes a ship as its `path` and the type returned is a `@ud`.
3434
35−### Example
35+#### Example
3636
3737```
3838> .^(@ud %j /=life=/(scot %p our))
@@ -43,7 +43,7 @@ A `%life` scry gets the current `life` (key revision number) of a ship if known,
4343
4444A `%lyfe` scry gets the current unitized `life` (key revision number) of a ship if known, otherwise returns `~`. It takes a ship as its `path` and the type returned is a `(unit @ud)`.
4545
46−### Example
46+#### Example
4747
4848```
4949> .^((unit @ud) %j /=lyfe=/(scot %p our))
@@ -54,7 +54,7 @@ A `%lyfe` scry gets the current unitized `life` (key revision number) of a ship
5454
5555A `%rift` scry gets the current `rift` (continuity number) of a ship if known, otherwise it crashes. It takes a ship as its `path` and the type returned is a `@ud`.
5656
57−### Example
57+#### Example
5858
5959```
6060.^(@ud %j /=rift=/(scot %p our))
@@ -65,7 +65,7 @@ A `%rift` scry gets the current `rift` (continuity number) of a ship if known, o
6565
6666A `%ryft` scry gets the current unitized `rift` (continuity number) of a ship if known, otherwise it returns `~`. It takes a ship as its `path` and the type returned is a `(unit @ud)`.
6767
68−### Example
68+#### Example
6969
7070```
7171> .^((unit @ud) %j /=ryft=/(scot %p our))
@@ -76,7 +76,7 @@ A `%ryft` scry gets the current unitized `rift` (continuity number) of a ship if
7676
7777A `%vein` scry gets your ship's private key for the specified `life`. It takes a `life` `@ud` as its `path` and the type returned is a `ring`.
7878
79−### Example
79+#### Example
8080
8181```
8282> .^(@uw %j /=vein=/1)
@@ -87,7 +87,7 @@ A `%vein` scry gets your ship's private key for the specified `life`. It takes a
8787
8888A `%vile` scry gets your `jam`mmed private boot parameters at your ship's current `life`. It takes no additional arguments in its `path`. The type returned is a `@` which is a `jam`med [$seed](/docs/arvo/jael/data-types#seed).
8989
90−### Examples
90+#### Examples
9191
9292```
9393> .^(@ %j /=vile=)
@@ -108,7 +108,7 @@ A `%vile` scry gets your `jam`mmed private boot parameters at your ship's curren
108108
109109A `%deed` scry gets the `life`, pubkey and maybe a signature if the ship in question is a comet. It takes the target ship and life as its `path` like `/~sampel-palnet/1` and the type returned is a `[life pass (unit @ux)]`.
110110
111−### Example
111+#### Example
112112
113113```
114114> .^([life pass (unit @ux)] %j /=deed=/(scot %p our)/1)
@@ -122,7 +122,7 @@ A `%deed` scry gets the `life`, pubkey and maybe a signature if the ship in ques
122122
123123A `%earl` scry deterministically derives a private key for a moon. Note this is a holdover from an old version of moon infrastructure, the current `|moon` generator doesn't use this and instead generates moon private keys non-deterministically. It takes the moon name and your ship's current `life` (not the moon's `life`) as its `path` like `/~doznec-dozzod-dozzod-dozzod/1`. The type returned is a [$seed](/docs/arvo/jael/data-types#seed), the `life` of the moon in the `lyf` field of the `seed` will always be `1`.
124124
125−### Example
125+#### Example
126126
127127```
128128> .^(seed:jael %j /=earl=/~doznec-dozzod-dozzod-dozzod/1)
@@ -138,7 +138,7 @@ A `%earl` scry deterministically derives a private key for a moon. Note this is
138138
139139A `%sein` scry gets the sponsor for the specified ship. This scry is used implicitly by `sein:title`. It takes the target ship as its `path` and the type returned is a `@p`.
140140
141−### Example
141+#### Example
142142
143143```
144144> .^(@p %j /=sein=/~sampel-palnet)
@@ -149,7 +149,7 @@ A `%sein` scry gets the sponsor for the specified ship. This scry is used implic
149149
150150A `%saxo` scry gets the sponsorship chain for the target ship (including the target ship itself). For example, a `%saxo` scry for a planet will return the planet, its star and the star's galaxy. This scry is used implicitly by `saxo:title`. It takes the target ship as its `path` and the type returned is a `(list @p)`.
151151
152−### Example
152+#### Example
153153
154154```
155155> .^((list @p) %j /=saxo=/~sampel-palnet)
@@ -168,7 +168,7 @@ nel=(set duct) :: trackers of all
168168
169169The `yen` `jug` maps subscribed `duct`s to the `ship`s they're tracking, and `ney` is just the inverse, mapping tracked `ship`s to subscribed `duct`s. The `nel` set contains `duct`s track all public key updates.
170170
171−### Example
171+#### Example
172172
173173```
174174.^([yen=(jug duct ship) ney=(jug ship duct) nel=(set duct)] %j /=subscriptions=/1)
@@ -179,7 +179,7 @@ The `yen` `jug` maps subscribed `duct`s to the `ship`s they're tracking, and `ne
179179
180180A `%sources` scry gets the current state of Jael's sources for PKI updates. It takes no additional arguments in its `path` and returns a [$state-eth-node](/docs/arvo/jael/data-types#state-eth-node).
181181
182−### Example
182+#### Example
183183
184184```
185185> .^(state-eth-node:jael %j /=sources=)
@@ -196,7 +196,7 @@ A `%sources` scry gets the current state of Jael's sources for PKI updates. It t
196196
197197A `%turf` scry gets the list of domain prefixes for galaxies. It takes no additional arguments in its `path`. It returns a `(list turf)`, where a `turf` is a TLD-first `(list @t)`, so `urbit.org` as a `turf` is `~['org' 'urbit']`.
198198
199−### Example
199+#### Example
200200
201201```
202202> .^((list turf) %j /=turf=)
content/docs/arvo/jael/tasks.md+15−15
@@ -34,7 +34,7 @@ This `task` takes a [$dawn-event](/docs/arvo/jael/data-types#dawn-event) as its
3434
3535You would not use this `task` manually.
3636
37−### Returns
37+#### Returns
3838
3939Jael `%give`s an `%init` `gift` to Unix. This occurs after the Dill `%slip` init.
4040
@@ -54,7 +54,7 @@ The `ship` field specifies the `@p` of the fake ship being created.
5454
5555You would not use this `task` manually.
5656
57−### Returns
57+#### Returns
5858
5959Jael `%give`s a `%init` `gift` to Unix.
6060
@@ -72,7 +72,7 @@ Sets the source that the public keys for a set of `ship`s should be obtained fro
7272
7373You are unlikely to use this `task` manually.
7474
75−### Returns
75+#### Returns
7676
7777Jael will not return any `gift`s in response to a `%listen` `task`.
7878
@@ -94,7 +94,7 @@ Register moon keys or otherwise administer a moon.
9494
9595This is what is sent to Jael by `%hood` behind the scenes when you run `|moon`, `|moon-breach` or `|moon-cycle-keys`. The `ship` field is the moon's `@p`. The [$udiff:point](/docs/arvo/jael/data-types#udiffpoint) will contain the bunt of an [$id:block](/docs/arvo/jael/data-types#idblock) (since moons aren't registered in Azimuth) and one of the `udiff` actions depending on what you want to do.
9696
97−### Returns
97+#### Returns
9898
9999Jael does not return any `gift`s in response to a `%moon` `task`.
100100
@@ -110,11 +110,11 @@ If you've subscribed to public or private key updates from Jael with a [%private
110110
111111To cancel a subscription to the ship's private keys you must leave `whos` empty like `[%nuke ~]`.
112112
113−### Returns
113+#### Returns
114114
115115Jael does not return a `gift` in response to a `%nuke` `task`.
116116
117−### Examples
117+#### Examples
118118
119119See the [%public-keys and %nuke](/docs/arvo/jael/examples#public-keys-and-nuke) section of the Examples document for an example of using `%nuke` to cancel a `%public-keys` subscription. See the thread in the [%private-keys](/docs/arvo/jael/examples#private-keys) example for cancelling a `%private-keys` subscription.
120120
@@ -128,7 +128,7 @@ Subscribe to private key updates.
128128
129129Subscribe to be notified of private key updates for the local ship. The subscription will continue until Jael receives a [%nuke](#nuke) `task` to cancel it.
130130
131−### Returns
131+#### Returns
132132
133133Jael responds to a `%private-keys` `task` with a `%private-keys` `gift` which looks like:
134134
@@ -138,7 +138,7 @@ Jael responds to a `%private-keys` `task` with a `%private-keys` `gift` which lo
138138
139139The `life` is the current life of the ship and the `vein` `map` contains the private key for each life up to (and including) the current one. Upon first subscribing, Jael will immediately respond with a `%private-keys` `gift`. Then, whenever the ship's private keys are changed, it'll send a new and updated `%private-keys` `gift`.
140140
141−### Example
141+#### Example
142142
143143See the [%private-keys](/docs/arvo/jael/examples#private-keys) section of the Examples document for a practical example.
144144
@@ -152,7 +152,7 @@ Subscribe to public key (and related) updates from Jael.
152152
153153An agent or thread can subscribe to be notified of public key updates, sponsorship changes and continuity breaches for the `set` of `ship`s specified in the `ships` field. The subscription will continue until Jael receives a [%nuke](#nuke) `task` to cancel it.
154154
155−### Returns
155+#### Returns
156156
157157Jael responds to a `%public-keys` `task` with `%public-keys` `gift`s which look like:
158158
@@ -164,7 +164,7 @@ The [$public-keys-result](/docs/arvo/jael/data-types#public-keys-result) contain
164164
165165Upon subscription, Jael will immeditely respond with a `%public-keys` `gift` containing a `%full` `public-keys-result` with the public key for each `life` up until the current one for each `ship` specified in the original `task`. After than, Jael will send a `%public-keys` `gift` with either a `%diff` or `%breach` `public-keys-result` each time a change occurs for any of the `ship`s to which you're subscribed.
166166
167−### Example
167+#### Example
168168
169169See the [%public-keys and %nuke](/docs/arvo/jael/examples#public-keys-and-nuke) section of the Examples document for a practical example.
170170
@@ -178,7 +178,7 @@ Update private keys.
178178
179179This is what is sent to Jael by `%hood` when you run `|rekey`, as you must after setting new Azimuth keys or running `|cycle-moon-keys` on a moon's parent. It will update your `life` (key revision number) and private keys. The `life` field is the new `life` (typically an increment of the current `life`) and the `ring` is a private key `@`.
180180
181−### Returns
181+#### Returns
182182
183183Jael does not return any `gift` in response to a `%rekey` `task`.
184184
@@ -192,7 +192,7 @@ View domains.
192192
193193The domains returned by a `%turf` `task` are used as the base for individual galaxy domain names (e.g. from `urbit.org` you get `zod.urbit.org`, `bus.urbit.org`, etc). Jael gets these from Azimuth, then Ames gets them from Jael and passes them to the runtime, which will perform the DNS lookups and give Ames back the galaxy IP addresses. A `%turf` task takes no additional arguments. You're unlikely to use this manually - if you want the current `turf`s you'd likely want to do a [turf scry](/docs/arvo/jael/scry#turf) instead.
194194
195−### Returns
195+#### Returns
196196
197197Jael will respond to a `%turf` `task` with a `%turf` `gift`, which looks like:
198198
@@ -202,7 +202,7 @@ Jael will respond to a `%turf` `task` with a `%turf` `gift`, which looks like:
202202
203203The `turf` in the `(list turf)` is a domain as a `(list @t)`, TLD-first. The current default is `[['org' 'urbit' ~] ~]`.
204204
205−### Example
205+#### Example
206206
207207See the [%turf section of the Examples document](/docs/arvo/jael/examples#turf) for a practical example.
208208
@@ -216,10 +216,10 @@ Reset web login code.
216216
217217Jael maintains a `step` value that represents the web login code revision number, and uses it to derive the code itself. It begins at `0` and is incremented each time the code is changed. When Jael updates the web login code, it sends Eyre a `%code-changed` `task:eyre` so that Eyre can throw away all of its current cookies and sessions. A `%step` task takes no additional argument.
218218
219−### Returns
219+#### Returns
220220
221221Jael does not return a `gift` in response to a `%step` `task`.
222222
223−### Example
223+#### Example
224224
225225See the [%step](/docs/arvo/jael/examples#step) section of the Examples document for a practical example.
content/docs/arvo/overview.md+53−56
@@ -119,9 +119,7 @@ the larval stage in more detail in the [larval stage](#larval-stage-core) sectio
119119
120120More information on the structure of the Arvo event log and the Arvo state is given in the section on [the kernel](#the-kernel).
121121
122−
123−
124−## Solid state interpreter
122+## Solid state interpreter
125123
126124Arvo is a _solid state interpreter_. In this section we describe what is meant
127125by this new term, and how this behavior derives from the fact that Arvo is an [ACID database](#acid-database) and a [single-level store](#single-level-store).
@@ -145,7 +143,6 @@ it as a chip. Plug this chip into power and network; packets go in and
145143out, sometimes changing its state. The chip never loses data and has
146144no concept of a reboot; every packet is an [ACID transaction](#acid-database).
147145
148−
149146### Over-the-air updates
150147
151148Arvo can hotpatch any other semantics at any layer in the system (apps, vanes, Arvo or Hoon itself) with automatic over-the-air updates.
@@ -174,22 +171,22 @@ In order to dismantle the client-server model and build a peer-to-peer internet,
174171
175172Database theory studies in precise terms the possible properties of anything that could be considered to be a database. In this context, Arvo has the properties of an [ACID database](https://en.wikipedia.org/wiki/ACID), and the Ames network could be thought of as network of such databases. ACID stands for _atomicity_, _consistency_, _isolation_, and _durability_. We review here how Arvo satisfies these properties.
176173
177− - Atomicity: Events in Arvo are _atomic_, meaning that they either succeed completely or fail completely. In other words, there are no transient periods in which something like a power failure will leave the operating system in an invalid state. When an event occurs in Arvo, e.g. [the kernel](#the-kernel) is `poke`d, the effects of an event are computed, the event is [persisted](https://en.wikipedia.org/wiki/Persistence_(computer_science)) by writing it to the event log, and only then are the actual effects applied.
174+- Atomicity: Events in Arvo are _atomic_, meaning that they either succeed completely or fail completely. In other words, there are no transient periods in which something like a power failure will leave the operating system in an invalid state. When an event occurs in Arvo, e.g. [the kernel](#the-kernel) is `poke`d, the effects of an event are computed, the event is [persisted](<https://en.wikipedia.org/wiki/Persistence_(computer_science)>) by writing it to the event log, and only then are the actual effects applied.
178175
179− - Consistency: Every possible update to the database puts it into another valid state. Given that Arvo is purely functional, this is easier to accomplish than it would be in an imperative setting.
176+- Consistency: Every possible update to the database puts it into another valid state. Given that Arvo is purely functional, this is easier to accomplish than it would be in an imperative setting.
180177
181− - Isolation: Transactions in databases often happen concurrently, and isolation
182− ensures that the transactions occur as if they were performed sequentially,
183− making it so that their effects are isolated from one another. Arvo ensures
184− this simply by the fact that it only ever performs events sequentially. While
185− Arvo
186− transactions are sequential and performed by the daemon, persistence and effect application are performed
187− in parallel by the worker; see [worker and
188− daemon](/docs/vere/) for more detail.
178+- Isolation: Transactions in databases often happen concurrently, and isolation
179+ ensures that the transactions occur as if they were performed sequentially,
180+ making it so that their effects are isolated from one another. Arvo ensures
181+ this simply by the fact that it only ever performs events sequentially. While
182+ Arvo
183+ transactions are sequential and performed by the daemon, persistence and effect application are performed
184+ in parallel by the worker; see [worker and
185+ daemon](/docs/vere/) for more detail.
189186
190− - Durability: Completed transactions will survive permanently. In other words,
191− since the event log is stored on disk, if power is lost you are guaranteed
192− that no transactions will be reversed.
187+- Durability: Completed transactions will survive permanently. In other words,
188+ since the event log is stored on disk, if power is lost you are guaranteed
189+ that no transactions will be reversed.
193190
194191It is easy to think that "completed transaction will survive permanently"
195192along with "the state of Arvo is pure function of its event log" implies that
@@ -219,11 +216,9 @@ This is known as
219216[non-preemptive](https://en.wikipedia.org/wiki/Cooperative_multitasking) or
220217cooperative multitasking.
221218
222−
223219> Parts of the remainder of this document are out of date as of 2020.07.20, please use information here with
224220> caution. This message will be removed once it is up to date.
225221
226−
227222# The kernel
228223
229224The Arvo kernel, stored in `sys/arvo.hoon`, is about 1k lines of Hoon whose primary purpose is to implement the transition function, `+poke`. In this section we point out the most important parts of `arvo.hoon` and describe their role in the greater system. We also give brief descriptions of Arvo's kernel modules, known as vanes, and how Arvo interfaces with them.
@@ -237,12 +232,13 @@ which applies many of the concepts covered below.
237232## Overall structure
238233
239234`arvo.hoon` contains five top level cores as well as a "formal interface" consisting of a single [gate](/docs/glossary/gate/) that implements the transition function. They are nested with the `=<` and `=>` runes like so, where items lower on the list are contained within items higher on the list:
240− + Types
241− + Section 3bE Arvo Core
242− + Implementation core
243− + Structural interface core, or adult core
244− + Larval stage core
245− + Formal interface
235+
236+- Types
237+- Section 3bE Arvo Core
238+- Implementation core
239+- Structural interface core, or adult core
240+- Larval stage core
241+- Formal interface
246242
247243See [Section 1.7](/docs/hoon/hoon-school/arms-and-cores) of the Hoon tutorial for further explanation of what is meant here by "nesting". We now describe the functionality of each of these components.
248244
@@ -311,7 +307,6 @@ initial element of the empty span, so this is routed to Unix, which applies the
311307
312308This is a call stack, with a crucial feature: the stack is a first-class citizen. You can respond over a `duct` zero, one, or many times. You can save `duct`s for later use. There are definitely parallels to Scheme-style continuations, but simpler and with more structure.
313309
314−
315310#### `wire`
316311
317312```hoon
@@ -419,31 +414,31 @@ described within the current type system. Then the `wire` here is the default Un
419414
420415A short summary of the purpose of each these arms are as follows:
421416
422− - `+poke` is the transition function that `move`s Arvo from one state to the
423− next. It is the most fundamental arm in the entire system. It is a typed
424− transactional message that is processed at most once. If the `+poke` causes
425− Arvo to send an message over [Ames](/docs/arvo/ames/ames) Ames
426− guarantees that the message will be delivered exactly once. This is sometimes said
427− to be impossible, and it is for standard operating systems, but that is not the case for single-level stores engaged in
428− a permanent session, as is the case among Arvo ships.
429− - `+peek` is an arm used for inspecting things outside of the kernel. It grants
430− read-only access to `scry` Arvo's global referentially transparent namespace.
431− It takes in a `path` and returns a `unit (unit)`. If the product is `~`, the
432− path is unknown and its value cannot be produced synchronously. If its
433− product is `[~ ~]` the `path` is known to be unbound and can never become
434− bound. Otherwise the product is a `mark` and a noun.
435− - `+wish` is a function that takes in a core and then parses and compiles it
436− with the standard library, `zuse`. It is useful from the outside if you ever
437− want to run code within. One particular way in which it is used is by the
438− runtime to read out the version of `zuse` so that it knows if it is
439− compatible with this particular version of the kernel.
440− - `+load` is used when upgrading the kernel. It is only ever called by Arvo
441− itself, never by the runtime. If upgrading to a kernel where types are
442− compatible, `+load` is used, otherwise `+come` is used.
443− - `+come` is used when the new kernel has incompatible types, but ultimately
444− reduces to a series of `+load` calls.
445−
446− The [Section 3bE core](#section-3be-core) does not follow this pattern.
417+- `+poke` is the transition function that `move`s Arvo from one state to the
418+ next. It is the most fundamental arm in the entire system. It is a typed
419+ transactional message that is processed at most once. If the `+poke` causes
420+ Arvo to send an message over [Ames](/docs/arvo/ames/ames) Ames
421+ guarantees that the message will be delivered exactly once. This is sometimes said
422+ to be impossible, and it is for standard operating systems, but that is not the case for single-level stores engaged in
423+ a permanent session, as is the case among Arvo ships.
424+- `+peek` is an arm used for inspecting things outside of the kernel. It grants
425+ read-only access to `scry` Arvo's global referentially transparent namespace.
426+ It takes in a `path` and returns a `unit (unit)`. If the product is `~`, the
427+ path is unknown and its value cannot be produced synchronously. If its
428+ product is `[~ ~]` the `path` is known to be unbound and can never become
429+ bound. Otherwise the product is a `mark` and a noun.
430+- `+wish` is a function that takes in a core and then parses and compiles it
431+ with the standard library, `zuse`. It is useful from the outside if you ever
432+ want to run code within. One particular way in which it is used is by the
433+ runtime to read out the version of `zuse` so that it knows if it is
434+ compatible with this particular version of the kernel.
435+- `+load` is used when upgrading the kernel. It is only ever called by Arvo
436+ itself, never by the runtime. If upgrading to a kernel where types are
437+ compatible, `+load` is used, otherwise `+come` is used.
438+- `+come` is used when the new kernel has incompatible types, but ultimately
439+ reduces to a series of `+load` calls.
440+
441+The [Section 3bE core](#section-3be-core) does not follow this pattern.
447442
448443#### Section 3bE core
449444
@@ -461,10 +456,10 @@ This core could be thought of as the primary "adult core" - the one that is in o
461456
462457This core is in use only during the larval stage of Arvo, which is after the Arvo kernel has compiled itself but before it has "broken symmetry" by acquiring identity and entropy, the point at which the larval stage has concluded. We call this breaking symmetry because prior to this point, every Urbit is completely identical. The larval stage performs the following steps in order:
463458
464− + The standard library, `zuse`, is installed.
465− + Entropy is added
466− + Identity is added
467− + Metamorph into the next stage of Arvo
459+- The standard library, `zuse`, is installed.
460+- Entropy is added
461+- Identity is added
462+- Metamorph into the next stage of Arvo
468463
469464Once the larval stage has passed its functionality will never be used again.
470465
@@ -497,6 +492,7 @@ Let's investigate the state piece by piece.
497492```hoon
498493=/ pit=vase !>(..is) ::
499494```
495+
500496This `vase` is part of the state but does not get directly migrated when `+poke`
501497is called. `!>(..is)` consists of the code in `arvo.hoon` written above this core contained in
502498a `vase`. Thus this part of the state changes only when that code changes in an
@@ -506,6 +502,7 @@ update.
506502=/ vil=vile (viol p.pit) :: cached reflexives
507503
508504```
505+
509506This is a cache of specific types that are of fundamental importance to Arvo -
510507namely `type`s, `duct`s, `path`s, and `vase`s. This is kept because it is
511508unnecessarily wasteful to recompile these fundamental types on a regular basis.
@@ -519,6 +516,7 @@ Again, this part of the state is never updated directly by `+poke`.
519516 vanes=(list [label=@tas =vane]) :: modules
520517 ==
521518```
519+
522520This is where the real state of the Arvo kernel is kept. `lac` detemines whether
523521Arvo's output is verbose, which can be set using the `|verb` command in the
524522dojo. `eny` is the current entropy. `our` is the ship, which is permanently
@@ -528,7 +526,6 @@ is of course the list of vanes, which have their own internal states.
528526As you can see, the state of Arvo itself is quite simple. Its primary role is that of
529527a traffic cop, and most of the interesting part of the state lies in `vanes`.
530528
531−
532529## Vanes
533530
534531The Arvo kernel can do very little on its own. Its functionality is extended in a careful and controlled way with vanes, also known as kernel modules.
content/docs/development/environment.md+1−1
@@ -14,7 +14,7 @@ To do work with Hoon, we recommended using a "fake" ship -- one that's not
1414connected to the network.
1515
1616Because such a ship has no presence on the network, you don't need an Azimuth
17−identity. You just need to have [installed the Urbit binary](/getting-started).
17+identity. You just need to have [installed the Urbit binary](/getting-started/cli).
1818
1919To create a fake ship named `~zod`, run the command below. You can replace `zod`
2020with any valid Urbit ship-name.
content/docs/development/project-repositories.md+2−5
@@ -38,11 +38,8 @@ large, so here's some links to its various high-level components
3838### Content
3939
4040- [urbit.org](https://github.com/urbit/urbit.org): the source for the urbit.org
41− website.
42−- [docs](https://github.com/urbit/docs): the source for the documentation that
43− you're currently reading.
44− - _Note:_ the documentation is loaded into the
45− [urbit.org](https://github.com/urbit/urbit.org) repo as a submodule.
41+ website and documentation.
42+
4643
4744### Community
4845
content/docs/glossary/desk.md+1−1
@@ -8,7 +8,7 @@ category = "arvo"
88
99A **desk** is an independently revision-controlled branch of a [ship](/docs/glossary/ship) that uses the [Clay](/docs/glossary/clay) filesystem. Each desk contains its own apps, [mark](/docs/glossary/mark) definitions, files, and so forth.
1010
11−Traditionally a ship has at least a base desk and a home desk. The base desk has all the system software from the distribution, and the home desk is a fork of base with all the items specific to the user of the ship. A desk is a series of numbered commits, the most recent of which represents the current state of the desk. A commit is composed of `1` an absolute time when it was created, `2` a list of zero or more parents, and `3` a map from paths to data.
11+Traditionally a ship has at least a `%base` desk, and typically `%garden` and `%landscape` desk among others. The `%base` desk has the kernel and base system software, while other desks are usually each for different apps. A desk is a series of numbered commits, the most recent of which represents the current state of the desk. A commit is composed of `1` an absolute time when it was created, `2` a list of zero or more parents, and `3` a map from paths to data.
1212
1313### Further Reading
1414
content/docs/hoon/guides/_index.md+2
@@ -11,3 +11,5 @@ insert_anchor_links = "right"
1111## [CLI Apps](/docs/hoon/guides/cli-tutorial)
1212
1313## [Parsing](/docs/hoon/guides/parsing)
14+
15+## [Strings](/docs/hoon/guides/strings)
content/docs/hoon/guides/strings.mdnew file+531
@@ -0,0 +1,531 @@
1++++
2+title = "Strings"
3+weight = 4
4+template = "doc.html"
5++++
6+
7+This document discusses hoon's two main string types: `cord`s (as well as its
8+subsets `knot` and `term`) and `tape`s. The focus of this
9+document is on their basic properties, syntax and the most common text-related
10+functions you'll regularly encounter. In particular, it discusses conversions
11+and the encoding/decoding of atom auras in strings.
12+
13+Hoon has a system for writing more elaborate functional parsers, but that is not
14+touched on here. Instead, see the [Parsing](/docs/hoon/guides/parsing) guide.
15+Hoon also has a type for UTF-32 strings, but those are rarely used and not
16+discussed in this document.
17+
18+There are a good deal more text manipulation functions than are discussed here.
19+See the [Further Reading](#further-reading) section for details.
20+
21+## `tape`s vs. text atoms
22+
23+As mentioned, urbit mainly deals with two kinds of strings: `tape`s and
24+`cord`/`knot`/`term`s. The former is a list of individual UTF-8 characters.
25+The latter three encode UTF-8 strings in a single atom.
26+
27+Cords may contain any UTF-8 characters, while `knot`s and `term`s only allow a
28+smaller subset. Each of these are discussed below in the [Text
29+atoms](#text-atoms) section.
30+
31+Text atoms like `cord`s are more efficient to store and move around. They are
32+also more efficient to manipulate with simple bitwise operations. Their downside
33+is that UTF-8 characters vary in their byte-length. ASCII characters are all
34+8-bit, but others can occupy up to four bytes. Accounting for this variation in
35+character size can complicate otherwise simple functions. Tapes, on the other
36+hand, don't have this problem because each character is a separate item in the
37+list, regardless of it byte-length. This fact makes it much easier to process
38+tapes in non-trivial ways with simple list functions.
39+
40+In light of this, a general rule of thumb is to use cords for simple things like
41+storing chat messages or exchanging them over the network. If text requires
42+complex processing on the other hand, it is generally easier with tapes. Note
43+there _are_ cord manipulation functions in the standard library, so you needn't
44+always convert cords to tapes for processing, it just depends on the case.
45+
46+Next we'll look at these different types of strings in more detail.
47+
48+## Text atoms
49+
50+### `cord`
51+
52+A [`cord`](/docs/hoon/reference/stdlib/2q#cord) has an aura of `@t`. It denotes
53+UTF-8 text encoded in an atom, little-endian. That is, the first character in
54+the text is the least-significant byte. A cord may contain any UTF-8 characters,
55+there are no restrictions.
56+
57+The `hoon` syntax for a cord is some text wrapped in single-quotes like:
58+
59+```hoon
60+'This is a cord!'
61+```
62+
63+single-quotes and backslashes must be escaped with a backslash like:
64+
65+```hoon
66+'\'quotes\' \\backslashes\\'
67+```
68+
69+Characters can also be entered as hex, they just have to be escaped by a
70+backslash. For example, `'\21\21\21'` will render as `'!!!'`. This is useful for
71+entering special characters such as line breaks like `'foo\0abar'`.
72+
73+Cords divided over multiple lines are allowed. There are two ways to do this.
74+The first is to start and end with three single-quotes like:
75+
76+```hoon
77+'''
78+foo
79+bar
80+baz
81+'''
82+```
83+
84+The line endings will be encoded Unix-style as line feed characters like:
85+
86+```hoon
87+'foo\0abar\0abaz'
88+```
89+
90+The second is to begin with a single-quote like usual, then break the line by
91+ending it with a backslash and start the next line with a forward-slash like:
92+
93+```hoon
94+'foo\
95+/bar\
96+/baz'
97+```
98+
99+This will be parsed to:
100+
101+```hoon
102+'foobarbaz'
103+```
104+
105+### `knot`
106+
107+A [`knot`](/docs/hoon/reference/stdlib/2q#knot) has an aura of `@ta`, and is a
108+subset of a [`cord`](#cord). It allows lower-case letters, numbers, and four
109+special characters: Hyphen, tilde, underscore and period. Its restricted set of
110+characters is intended to be URL-safe.
111+
112+The `hoon` syntax for a knot is a string containing any of the aforementioned
113+characters prepended with `~.` like:
114+
115+```hoon
116+~.abc-123.def_456~ghi
117+```
118+
119+### `term`
120+
121+A [`term`](/docs/hoon/reference/stdlib/2q#term) has an aura of `@tas`, and is a
122+subset of a [`knot`](#knot). It only allows lower-case letters, numbers, and
123+hyphens. Additionally, the first character cannot be a hyphen or number. This is
124+a very restricted text atom, and is intended for naming data structures and the
125+like.
126+
127+The `hoon` syntax for a term is a string conforming to the prior description,
128+prepended with a `%` like:
129+
130+```hoon
131+%foo-123
132+```
133+
134+#### A note about `term` type inference
135+
136+There is actually an even more restricted text atom form with the same `%foo`
137+syntax as a term, where the type of the text is the text itself. For example, in
138+the dojo:
139+
140+```
141+> `%foo`%foo
142+%foo
143+```
144+
145+The hoon parser will, by default, infer the type of `%foo`-style syntax this
146+way. If we try with the dojo type printer:
147+
148+```
149+> ? %foo
150+ %foo
151+%foo
152+```
153+
154+This type-as-itself is used for many things, such as unions like:
155+
156+```hoon
157+?(%foo %bar %bas)
158+```
159+
160+In order to give `%foo` the more generic `@tas` aura, it must be explicitly
161+upcast like:
162+
163+```
164+> ? `@tas`%foo
165+ @tas
166+%foo
167+```
168+
169+This is something to be wary of. For example, if you wanted to form a `(set @tas)` you might think to do:
170+
171+```hoon
172+(silt (limo ~[%foo %bar %baz]))
173+```
174+
175+However, this will actually form a set of the union `?(%foo %bar %baz)` due to
176+the specificity of type inference:
177+
178+```
179+> ? (silt (limo ~[%foo %bar %baz]))
180+ ?(%~ [?(n=%bar n=%baz n=%foo) l=nlr(?(%bar %baz %foo)) r=nlr(?(%bar %baz %foo))])
181+[n=%baz l={%bar} r={%foo}]
182+```
183+
184+One further note about the type-as-itself form: Ocassionally you may wish to
185+form a union of strings which contain characters disallowed in `term`s. To get
186+around this, you can enclose the text after the `%` with single-quotes like
187+`%'HELLO!'`.
188+
189+### Aura type validity
190+
191+The hoon parser will balk at `cord`s, `knot`s and `term`s containing invalid
192+characters. However, because they're merely auras, any atom can be cast to them.
193+When cast (or clammed), they will **not** be validated in terms of whether the
194+characters are allowed in the specified aura.
195+
196+For example, you can do this:
197+
198+```
199+> `@tas`'!%* $@&'
200+%!%* $@&
201+```
202+
203+This means you cannot rely on mere aura-casting if you need the text to conform
204+to the specified aura's restrictions. Instead, there are a couple of function in
205+the standard library to check text aura validity:
206+[`+sane`](/docs/hoon/reference/stdlib/4b#sane) and
207+[`+sand`](/docs/hoon/reference/stdlib/4b#sane).
208+
209+The `+sane` function takes an argument of either `%ta` or `%tas` to validate
210+`@ta` and `@tas` respectively (you can technically give it `%t` for `@t` too but
211+there's no real point). It will return `%.y` if the given atom is valid for the
212+given aura, and `%.n` if it isn't. For example:
213+
214+```
215+> ((sane %tas) 'foo')
216+%.y
217+> ((sane %tas) 'foo!')
218+%.n
219+```
220+
221+The `+sand` function does the same thing, but rather than returning a `?` it
222+returns a `unit` of the given atom, or `~` if validation failed. For example:
223+
224+```
225+> `(unit @tas)`((sand %tas) 'foo')
226+[~ %foo]
227+> `(unit @tas)`((sand %tas) 'foo!')
228+~
229+```
230+
231+## `tape`
232+
233+A [`tape`](/docs/hoon/reference/stdlib/2q#tape) is the other
234+main string type in hoon. Rather than a single atom, it's instead a list of
235+individual `@tD` characters (the `D` specifies a bit-length of 8, see the
236+[Auras](/docs/hoon/reference/auras#bitwidth) documentation for
237+details). The head of the list is the first character in the string.
238+
239+The `hoon` syntax for a tape is some text wrapped in double-quotes like:
240+
241+```hoon
242+"This is a tape!"
243+```
244+
245+Double-quotes, backslashes and left-braces must be escaped by a backslash
246+character:
247+
248+```hoon
249+"\"double-quotes\" \\backslash\\ left-brace:\{"
250+```
251+
252+Like with `cord`s, characters can also be entered as hex escaped by a backslash
253+so `"\21\21\21"` renders as `"!!!"`.
254+
255+Tapes divided over multiple lines are allowed. Unlike [`cord`](#cord)s, there is
256+only one way to do this, which is by starting and ending with three
257+double-quotes like:
258+
259+```hoon
260+"""
261+foo
262+bar
263+baz
264+"""
265+```
266+
267+The line endings will be encoded Unix-style as line feed characters like:
268+
269+```hoon
270+"foo\0abar\0abaz"
271+```
272+
273+As mentioned earlier, tapes are lists of single characters:
274+
275+```
276+> `tape`~['f' 'o' 'o']
277+"foo"
278+```
279+
280+This means they can be manipulated with ordinary list functions:
281+
282+```
283+> `tape`(turn "foobar" succ)
284+"gppcbs"
285+```
286+
287+### Interpolation
288+
289+Tapes, unlike cords, allow string interpolation. Arbitrary `hoon` may be
290+embedded in the tape syntax and its product will be included in the resulting
291+tape. There are two ways to do it:
292+
293+#### Manual
294+
295+In the first case, the code to be evaluated is enclosed in braces. The type of
296+the product of the code must itself be a tape. For example, if the `@p` of our
297+ship is stored in `our`, simply doing `"{our}"` will fail because its type will
298+be `@p` rather than `tape`. Instead, we must explicitly use the
299+[`+scow`](/docs/hoon/reference/stdlib/4m#scow) function to
300+render `our` as a tape:
301+
302+```
303+> "{(scow %p our)}"
304+"~zod"
305+```
306+
307+Another example:
308+
309+```
310+> "[{(scow %p our)} {(scow %da now)}]"
311+"[~zod ~2021.10.3..08.59.10..2335]"
312+```
313+
314+#### Automatic
315+
316+Rather than having to manually render data as a `tape`, angle brackets _inside_
317+the braces tell the interpreter to automatically pretty-print the product of the
318+expression as a tape. This way we needn't use functions like `+scow` and can
319+just reference things like `our` directly:
320+
321+```
322+> "{<our>}"
323+~zod
324+```
325+
326+Another example:
327+
328+```
329+> "{<(add 1 2)>}"
330+"3"
331+```
332+
333+And another:
334+
335+```
336+> "{<our now>}"
337+"[~zod ~2021.10.3..09.01.14..1654]"
338+```
339+
340+## Conversions
341+
342+Tapes can easily be converted to cords and vice versa. There are two stdlib
343+functions for this purpose: [`+crip`](/docs/hoon/reference/stdlib/4b#crip) and
344+[`+trip`](/docs/hoon/reference/stdlib/4b#trip). The former converts a `tape` to
345+a `cord` and the latter does the opposite. For example:
346+
347+```
348+> (crip "foobar")
349+'foobar'
350+> (trip 'foobar')
351+"foobar"
352+```
353+
354+Knots and terms can also be converted to tapes with `+trip`:
355+
356+```
357+> (trip %foobar)
358+"foobar"
359+> (trip ~.foobar)
360+"foobar"
361+```
362+
363+Likewise, the output of `+crip` can be cast to a knot or term:
364+
365+```
366+> `@tas`(crip "foobar")
367+%foobar
368+> `@ta`(crip "foobar")
369+~.foobar
370+> `@tas`(need ((sand %tas) (crip "foobar")))
371+%foobar
372+```
373+
374+## Encoding in text
375+
376+It's common to encode atoms in cords or knots, particularly when constructing a
377+[scry](/docs/arvo/concepts/scry) [`path`](/docs/hoon/reference/stdlib/2q#path)
378+or just a `path` in general. There are two main functions for this purpose:
379+[`+scot`](/docs/hoon/reference/stdlib/4m#scot) and
380+[`+scow`](/docs/hoon/reference/stdlib/4m#scow). The former produces a `knot`,
381+and the latter produces a `tape`. Additionally, there are two more functions for
382+encoding `path`s in cords and tapes respectively:
383+[`+spat`](/docs/hoon/reference/stdlib/4m#spat) and
384+[`+spud`](/docs/hoon/reference/stdlib/4m#spud).
385+
386+### `+scot` and `+spat`
387+
388+`+scot` encodes atoms of various auras in a `knot` (or `cord`/`term` with
389+casting). It takes two arguments: the aura in a `@tas` and the atom to be
390+encoded. For example:
391+
392+```
393+> (scot %p ~zod)
394+~.~zod
395+
396+> (scot %da now)
397+~.~2021.10.4..07.35.54..6d41
398+
399+> (scot %ux 0xaa.bbbb)
400+~.0xaa.bbbb
401+```
402+
403+Note the aura of the atom needn't actually match the specified aura:
404+
405+```
406+> (scot %ud ~zod)
407+~.0
408+```
409+
410+Hoon can of course be evaluated in its arguments as well:
411+
412+```
413+> (scot %ud (add 1 1))
414+~.2
415+```
416+
417+You'll most commonly see this used in constructing a `path` like:
418+
419+```
420+> /(scot %p our)/garden/(scot %da now)/foo/(scot %ud 123.456)
421+[~.~zod %garden ~.~2021.10.4..07.43.14..a556 %foo ~.123.456 ~]
422+
423+> `path`/(scot %p our)/garden/(scot %da now)/foo/(scot %ud 123.456)
424+/~zod/garden/~2021.10.4..07.43.23..9a0f/foo/123.456
425+```
426+
427+`+spat` simply encodes a `path` in a cord like:
428+
429+```
430+> (spat /foo/bar/baz)
431+'/foo/bar/baz'
432+```
433+
434+### `+scow` and `+spud`
435+
436+`+scow` is the same as [`+scot`](#scot-and-spat) except it produces a tape
437+rather than a knot. For example:
438+
439+```
440+> (scow %p ~zod)
441+"~zod"
442+
443+> (scow %da now)
444+"~2021.10.4..07.45.25..b720"
445+
446+> (scow %ux 0xaa.bbbb)
447+"0xaa.bbbb"
448+```
449+
450+`+spud` simply encodes a `path` in a tape:
451+
452+```
453+> (spud /foo/bar/baz)
454+"/foo/bar/baz"
455+```
456+
457+## Decoding from text
458+
459+For decoding atoms of particular auras encoded in cords, there are three
460+functions: [`+slat`](/docs/hoon/reference/stdlib/4m#slat),
461+[`+slav`](/docs/hoon/reference/stdlib/4m#slav), and
462+[`+slaw`](/docs/hoon/reference/stdlib/4m#slaw). Additionally, there is
463+[`+stab`](/docs/hoon/reference/stdlib/4m#stab) for decoding a cord to a path.
464+
465+`+slav` parses the given cord with the aura specified as a `@tas`, crashing if
466+the parsing failed. For example:
467+
468+```
469+> `@da`(slav %da '~2021.10.4..11.26.54')
470+~2021.10.4..11.26.54
471+
472+> `@p`(slav %p '~zod')
473+~zod
474+
475+> (slav %p 'foo')
476+dojo: hoon expression failed
477+```
478+
479+`+slaw` is like `+slav` except it produces a `unit` which is null if parsing
480+failed, rather than crashing. For example:
481+
482+```
483+> `(unit @da)`(slaw %da '~2021.10.4..11.26.54')
484+[~ ~2021.10.4..11.26.54]
485+
486+> `(unit @p)`(slaw %p '~zod')
487+[~ ~zod]
488+
489+> (slaw %p 'foo')
490+~
491+```
492+
493+`+slat` is a curried version of `+slaw`, meaning it's given the aura and
494+produces a new gate which takes the actual cord. For example:
495+
496+```
497+> `(unit @da)`((slat %da) '~2021.10.4..11.26.54')
498+[~ ~2021.10.4..11.26.54]
499+
500+> `(unit @p)`((slat %p) '~zod')
501+[~ ~zod]
502+
503+> ((slat %p) 'foo')
504+~
505+```
506+
507+Finally, `+stab` parses a cord containing a path to a `path`. For example:
508+
509+```
510+> (stab '/foo/bar/baz')
511+/foo/bar/baz
512+```
513+
514+## Futher reading
515+
516+- [Parsing](/docs/hoon/guides/parsing) - A guide to writing fully-fledged
517+ functional parsers in hoon.
518+
519+- [Auras](/docs/hoon/reference/auras) - Details of auras in hoon.
520+
521+- [stdlib 2b: List logic](/docs/hoon/reference/stdlib/2b) - Standard library
522+ functions for manipulating lists, which are useful for dealing with tapes.
523+
524+- [stdlib 2q: Molds and Mold-builders](/docs/hoon/reference/stdlib/2q) - Several
525+ text types are defined in this section of the standard library.
526+
527+- [stdlib 4b: Text processing](/docs/hoon/reference/stdlib/4b) - Standard
528+ library functions for manipulating and converting tapes and strings.
529+
530+- [stdlib 4m: Formatting functions](/docs/hoon/reference/stdlib/4m) - Standard
531+ library functions for encoding and decoding atom auras in strings.
content/docs/hoon/reference/_index.md+6−3
@@ -36,15 +36,18 @@ The full story on Hoon's type system.
3636
3737A list of aura types for atoms.
3838
39−### [Runes](/docs/hoon/reference/rune/)
39+## [Runes](/docs/hoon/reference/rune/)
4040
4141Syntax and semantics for Hoon's rune system.
4242
43−### [Limbs and Wings](/docs/hoon/reference/limbs/)
43+## [Limbs and Wings](/docs/hoon/reference/limbs/)
4444
4545How to find data inside Hoon subjects.
4646
47−### [Standard Library](/docs/hoon/reference/stdlib/)
47+## [Standard Library](/docs/hoon/reference/stdlib/)
4848
4949Reference material for the Hoon standard library.
5050
51+## [Zuse](/docs/hoon/reference/zuse/)
52+
53+Reference material for the Zuse library.
content/docs/hoon/reference/cheat-sheet.md+3−13
@@ -5,24 +5,14 @@ template = "doc.html"
55aliases = ["docs/reference/cheat-sheet/"]
66+++
77
8−Download the cheat sheet PDF [here](https://storage.googleapis.com/media.urbit.org/docs/hoon-cheat-sheet-2020-07-24.pdf).
8+Download the cheat sheet PDF [here](https://media.urbit.org/docs/hooncard-unbranded-2021-09-12.pdf)
99
1010We've found it's useful to have a quick reference of Hoon's syntax always at
11−hand. So above is a download link to a Hoon cheatsheet .pdf. It's missing a
12−few of the literal syntaxes, but it covers the most common ones.
11+hand. So above is a download link to a Hoon cheatsheet PDF.
1312
14−This doesn't list any of the Ford runes, although there is now at least
15−some documentation for those [here](/docs/arvo/ford/ford).
16−
17−The following runes also exist, but are currently undocumented and not listed in
13+The following rune also exists, but is currently undocumented and not listed in
1814the cheat sheet:
1915
2016```
21−!: :: turn on debugging printfs
22−!. :: turn off debugging printfs
23−!; :: using the "type of type", emit the type for an expression
24−!, :: emit AST of expression
2517$* :: bunt (irregular form is *)
26−^. :: use gate to transform type
27−^& :: zinc (covariant) -- see the docs on advanced types
2818```
content/docs/hoon/reference/rune/cen.md+1−1
@@ -360,7 +360,7 @@ AST:
360360
361361##### Semantics
362362
363−A `%*` expression evaluates some arbitrary Hoon expression, `b`, and then resolves a wing of of that result, with changes. `a` is the wing to be resolved, and one or more changes is defined by the subexpressions after `b`.
363+A `%*` expression evaluates some arbitrary Hoon expression, `b`, and then resolves a wing of that result, with changes. `a` is the wing to be resolved, and one or more changes is defined by the subexpressions after `b`.
364364
365365##### Expands to
366366
content/docs/hoon/reference/rune/ket.md+12−3
@@ -63,9 +63,18 @@ Regular: **1-fixed**.
6363
6464##### Discussion
6565
66−A mold is an idempotent gate that is guaranteed to produce a noun of that type. If an input value isn't of the correct type, the bunt value of that type is returned. (See `^*`.)
67−
68−`^:` is used to produce a gate that is much like a mold, except that instead of producing a bunt value when the input value is of the wrong type, it crashes.
66+A mold is an idempotent gate that is guaranteed to produce a noun of that type.
67+If an input value isn't of the correct type, the bunt value of that type is
68+returned. (See `^*`.)
69+
70+`^:` is used to produce a gate that is much like a mold, except that instead of
71+producing a bunt value when the input value is of the wrong type, it crashes.
72+
73+One may expect that `^:(path /foo)` would result in a syntax error since `^:`
74+only takes one child, but instead it will parse as `=< ^ %:(path /foo)`. Since
75+`:` is the irregular syntax for `=<` this is is parsed as "get `^` (i.e. the
76+mold for cells) from a subject of `(path /foo)`", with `:` being the irregular
77+syntax for `=<`.
6978
7079##### Examples
7180
content/docs/hoon/reference/rune/tis.md+9−3
@@ -423,11 +423,11 @@ Regular: **running**.
423423
424424### `=*` "tistar"
425425
426−`[%tstr p=term q=hoon r=hoon]`: define a macro.
426+`[%tstr p=term q=hoon r=hoon]`: define a deferred expression.
427427
428428##### Produces
429429
430−`r`, compiled with a subject in which `p` is a macro for `q`.
430+`r`, compiled with a subject in which `p` is a deferred expression for `q`.
431431
432432##### Syntax
433433
@@ -435,7 +435,13 @@ Regular: **3-fixed**.
435435
436436##### Discussion
437437
438−The difference between macroing and pinning is that pinning changes the subject, but for macroing the subject noun stays the same. The macro'd expression, `q`, is recorded in the type information of `p`. `q` is calculated every time you use the `p` macro.
438+`=*` assigns a name to an expression that will be evaluated in each place the
439+name is dereferenced. This allows you to "write" through it to the original
440+subject `axis`. `q` is recorded in the type information of `p`, and `q` is
441+calculated every time you use `p`.
442+
443+This rune has some similarities with macros, and some similarities with aliases,
444+but it is not really either.
439445
440446##### Examples
441447
content/docs/hoon/reference/rune/zap.md+1−1
@@ -196,7 +196,7 @@ The syntax difference is that a test for equality takes two subexpressions, and
196196##### Produces
197197
198198`q`, if `p` is greater than or equal to the Hoon kelvin version.
199−(Versions count down; the current version is 141.)
199+(Versions count down; the current version is 140.)
200200
201201##### Syntax
202202
content/docs/hoon/reference/stdlib/1a.md+403−284
@@ -4,7 +4,7 @@ weight = 1
44template = "doc.html"
55+++
66
7−### `++add`
7+## `++add`
88
99Add
1010
@@ -23,41 +23,54 @@ An [`atom`](/docs/glossary/atom).
2323#### Source
2424
2525```hoon
26− ++ add
27− ~/ %add
28− |= [a=@ b=@]
29− ^- @
30− ?: =(0 a) b
31− $(a (dec a), b +(b))
26+++ add
27+ ~/ %add
28+ |= [a=@ b=@]
29+ ^- @
30+ ?: =(0 a) b
31+ $(a (dec a), b +(b))
3232```
3333
3434#### Examples
3535
3636```
37− > (add 2 2)
38− 4
37+> (add 2 2)
38+4
39+```
3940
40− > (add 1 1.000.000)
41− 1.000.001
41+```
42+> (add 1 1.000.000)
43+1.000.001
44+```
4245
43− > (add 1.333 (mul 2 2))
44− 1.337
46+```
47+> (add 1.333 (mul 2 2))
48+1.337
49+```
4550
46− > (add 'a' 4)
47− 101
51+```
52+> (add 'a' 4)
53+101
54+```
4855
49− > (add 'a' 'b')
50− 195
56+```
57+> (add 'a' 'b')
58+195
59+```
5160
52− > (add 0xc 0xf)
53− 27
61+```
62+> (add 0xc 0xf)
63+27
64+```
5465
55− > `@ux`(add 0xc 0xf)
56− 0x1b
66+```
67+> `@ux`(add 0xc 0xf)
68+0x1b
5769```
5870
5971---
60−### `++dec`
72+
73+## `++dec`
6174
6275Decrement
6376
@@ -74,41 +87,47 @@ An [`atom`](/docs/glossary/atom).
7487#### Source
7588
7689```hoon
77− ++ dec
78− ~/ %dec
79− |= a=@
80− ~| %decrement-underflow
81− ?< =(0 a)
82− =+ b=0
83− |- ^- @
84− ?: =(a +(b)) b
85− $(b +(b))
90+++ dec
91+ ~/ %dec
92+ |= a=@
93+ ~_ leaf+"decrement-underflow"
94+ ?< =(0 a)
95+ =+ b=0
96+ |- ^- @
97+ ?: =(a +(b)) b
98+ $(b +(b))
8699```
87100
88101#### Examples
89102
90103```
91− > (dec 7)
92− 6
93−
94− > (dec 0)
95− ! decrement-underflow
96− ! exit
104+> (dec 7)
105+6
106+```
97107
98− > (dec 'b')
99− 97
100− > `@t`(dec 'b')
101− 'a'
108+```
109+> (dec 0)
110+! decrement-underflow
111+! exit
112+```
102113
103− > (dec 0xc)
104− 11
105− > `@ux`(dec 0xc)
106− 0xb
114+```
115+> (dec 'b')
116+97
117+> `@t`(dec 'b')
118+'a'
107119```
108120
121+```
122+> (dec 0xc)
123+11
124+> `@ux`(dec 0xc)
125+0xb
126+```
109127
110128---
111−### `++div`
129+
130+## `++div`
112131
113132Divide
114133
@@ -127,43 +146,52 @@ An [`atom`](/docs/glossary/atom).
127146#### Source
128147
129148```hoon
130− ++ div
131− ~/ %div
132− |: [a=`@`1 b=`@`1]
133− ^- @
134− ~_ leaf+"divide-by-zero"
135− ?< =(0 b)
136− =+ c=0
137− |-
138− ?: (lth a b) c
139− $(a (sub a b), c +(c))
149+++ div
150+ ~/ %div
151+ |: [a=`@`1 b=`@`1]
152+ ^- @
153+ ~_ leaf+"divide-by-zero"
154+ ?< =(0 b)
155+ =+ c=0
156+ |-
157+ ?: (lth a b) c
158+ $(a (sub a b), c +(c))
140159```
141160
142161#### Examples
143162
144163```
145− > (div 4 2)
146− 2
164+> (div 4 2)
165+2
166+```
147167
148− > (div 17 8)
149− 2
168+```
169+> (div 17 8)
170+2
171+```
150172
151− > (div 20 30)
152− 0
173+```
174+> (div 20 30)
175+0
176+```
153177
154− > (div 'ab' 'a')
155− 259
156− > `@`'ab'
157− 25.185
158− > `@`a
159− 97
178+```
179+> (div 'ab' 'a')
180+259
181+> `@`'ab'
182+25.185
183+> `@`a
184+97
185+```
160186
161− > (div 0x9f 0x29)
162− 6
187+```
188+> (div 0x9f 0x29)
189+6
163190```
164191
165192---
166−### `++dvr`
193+
194+## `++dvr`
167195
168196Divide with remainder
169197
@@ -182,38 +210,47 @@ A cell of [`atoms`](/docs/glossary/atom).
182210#### Source
183211
184212```hoon
185− ++ dvr
186− ~/ %dvr
187− |= [a=@ b=@]
188− ^- [p=@ q=@]
189− [(div a b) (mod a b)]
213+++ dvr
214+ ~/ %dvr
215+ |= [a=@ b=@]
216+ ^- [p=@ q=@]
217+ [(div a b) (mod a b)]
190218```
191219
192220#### Examples
193221
194222```
195− > (dvr 17 8)
196− [p=2 q=1]
223+> (dvr 17 8)
224+[p=2 q=1]
225+```
197226
198− > (dvr 17 6)
199− [p=2 q=5]
227+```
228+> (dvr 17 6)
229+[p=2 q=5]
230+```
200231
201− > (dvr 18 6)
202− [p=3 q=0]
232+```
233+> (dvr 18 6)
234+[p=3 q=0]
235+```
203236
204− > (dvr 4 2)
205− [p=2 q=0]
237+```
238+> (dvr 4 2)
239+[p=2 q=0]
240+```
206241
207− > (dvr 'ab 'a')
208− [p=259 q=62]
209− > `@`'a'
210− 97
211− > `@`'ab'
212− 25.185
242+```
243+> (dvr 'ab 'a')
244+[p=259 q=62]
245+> `@`'a'
246+97
247+> `@`'ab'
248+25.185
213249```
214250
215251---
216−### `++gte`
252+
253+## `++gte`
217254
218255Greater-than/equal
219256
@@ -232,28 +269,33 @@ A flag.
232269#### Source
233270
234271```hoon
235− ++ gte
236− ~/ %gte
237− |= [a=@ b=@]
238− ^- ?
239− !(lth a b)
272+++ gte
273+ ~/ %gte
274+ |= [a=@ b=@]
275+ ^- ?
276+ !(lth a b)
240277```
241278
242279#### Examples
243280
244281```
245− > (gte 100 10)
246− %.y
282+> (gte 100 10)
283+%.y
284+```
247285
248− > (gte 4 4)
249− %.y
286+```
287+> (gte 4 4)
288+%.y
289+```
250290
251− > (gte 3 4)
252− %.n
291+```
292+> (gte 3 4)
293+%.n
253294```
254295
255296---
256−### `++gth`
297+
298+## `++gth`
257299
258300Greater-than
259301
@@ -272,29 +314,33 @@ A flag.
272314#### Source
273315
274316```hoon
275− ++ gth
276− ~/ %gth
277− |= [a=@ b=@]
278− ^- ?
279− !(lte a b)
317+++ gth
318+ ~/ %gth
319+ |= [a=@ b=@]
320+ ^- ?
321+ !(lte a b)
280322```
281323
282−
283324#### Examples
284325
285326```
286− > (gth 'd' 'c')
287− %.y
327+> (gth 'd' 'c')
328+%.y
329+```
288330
289− > (gth ~h1 ~m61)
290− %.n
331+```
332+> (gth ~h1 ~m61)
333+%.n
334+```
291335
292− > (gth 'steak' 'brisket')
293− %.n
336+```
337+> (gth 'steak' 'brisket')
338+%.n
294339```
295340
296341---
297−### `++lte`
342+
343+## `++lte`
298344
299345Less-than/equal
300346
@@ -313,45 +359,56 @@ A flag.
313359#### Source
314360
315361```hoon
316− ++ lte
317− ~/ %lte
318− |= [a=@ b=@]
319− |(=(a b) (lth a b))
362+++ lte
363+ ~/ %lte
364+ |= [a=@ b=@]
365+ |(=(a b) (lth a b))
320366```
321367
322368#### Examples
323369
324370```
325− > (lte 4 5)
326− %.y
327−
328− > (lte 5 4)
329− %.n
330−
331− > (lte 5 5)
332− %.y
371+> (lte 4 5)
372+%.y
373+```
333374
334− > (lte 0 0)
335− %.y
375+```
376+> (lte 5 4)
377+%.n
378+```
336379
380+```
381+> (lte 5 5)
382+%.y
383+```
337384
338− > (lte 'a' 'b')
339− %.y
340− > `@`'a'
341− 97
342− > `@`'b'
343− 98
385+```
386+> (lte 0 0)
387+%.y
388+```
344389
345− > (lte 'abraham' 'bob')
346− %.n
390+```
391+> (lte 'a' 'b')
392+%.y
393+> `@`'a'
394+97
395+> `@`'b'
396+98
397+```
347398
348− > (lte ~m61 ~h1)
349− %.n
399+```
400+> (lte 'abraham' 'bob')
401+%.n
350402```
351403
404+```
405+> (lte ~m61 ~h1)
406+%.n
407+```
352408
353409---
354−### `++lth`
410+
411+## `++lth`
355412
356413Less-than
357414
@@ -370,46 +427,57 @@ A flag.
370427#### Source
371428
372429```hoon
373− ++ lth
374− ~/ %lth
375− |= [a=@ b=@]
376− ^- ?
377− ?& !=(a b)
378− |-
379− ?| =(0 a)
380− ?& !=(0 b)
381− $(a (dec a), b (dec b))
382− == == ==
430+++ lth
431+ ~/ %lth
432+ |= [a=@ b=@]
433+ ^- ?
434+ ?& !=(a b)
435+ |-
436+ ?| =(0 a)
437+ ?& !=(0 b)
438+ $(a (dec a), b (dec b))
439+ == == ==
383440```
384441
385442#### Examples
386443
387444```
388− > (lth 4 5)
389− %.y
445+> (lth 4 5)
446+%.y
447+```
390448
391− > (lth 5 4)
392− %.n
449+```
450+> (lth 5 4)
451+%.n
452+```
393453
394− > (lth 5 5)
395− %.n
454+```
455+> (lth 5 5)
456+%.n
457+```
396458
397− > (lth 5 0)
398− %.n
459+```
460+> (lth 5 0)
461+%.n
462+```
399463
400− > (lth 'a' 'b')
401− %.y
402− > `@`'a'
403− 97
404− > `@`'b'
405− 98
464+```
465+> (lth 'a' 'b')
466+%.y
467+> `@`'a'
468+97
469+> `@`'b'
470+98
471+```
406472
407− > (lth 'abraham' 'bob')
408− %.n
473+```
474+> (lth 'abraham' 'bob')
475+%.n
409476```
410477
411478---
412−### `++max`
479+
480+## `++max`
413481
414482Maximum
415483
@@ -428,44 +496,59 @@ An [`atom`](/docs/glossary/atom).
428496#### Source
429497
430498```hoon
431− ++ max
432− ~/ %max
433− |= [a=@ b=@]
434− ^- @
435− ?: (gth a b) a
436− b
499+++ max
500+ ~/ %max
501+ |= [a=@ b=@]
502+ ^- @
503+ ?: (gth a b) a
504+ b
437505```
438506
439507#### Examples
440508
441509```
442− > (max 10 100)
443− 100
510+> (max 10 100)
511+100
512+```
444513
445− > (max 10.443 9)
446− 10.443
514+```
515+> (max 10.443 9)
516+10.443
517+```
447518
448− > (max 1 1)
449− 1
519+```
520+> (max 1 1)
521+1
522+```
450523
451− > (max 'abraham' 'bob')
452− 30.787.873.400.840.801
524+```
525+> (max 'abraham' 'bob')
526+30.787.873.400.840.801
527+```
453528
454− > `@t`(max 'abraham' 'bob')
455− 'abraham'
529+```
530+> `@t`(max 'abraham' 'bob')
531+'abraham'
532+```
456533
457− > `@t`(max 'abraham' 'benjamin')
458− 'benjamin'
534+```
535+> `@t`(max 'abraham' 'benjamin')
536+'benjamin'
537+```
459538
460− > `@dr`(max ~m6 ~h1)
461− ~h1
539+```
540+> `@dr`(max ~m6 ~h1)
541+~h1
542+```
462543
463− >`@ux`(max 0xe1 0x1e)
464− 0xe1
544+```
545+>`@ux`(max 0xe1 0x1e)
546+0xe1
465547```
466548
467549---
468−### `++min`
550+
551+## `++min`
469552
470553Minimum
471554
@@ -484,42 +567,54 @@ An [`atom`](/docs/glossary/atom).
484567#### Source
485568
486569```hoon
487− ++ min
488− ~/ %min
489− |= [a=@ b=@]
490− ^- @
491− ?: (lth a b) a
492− b
570+++ min
571+ ~/ %min
572+ |= [a=@ b=@]
573+ ^- @
574+ ?: (lth a b) a
575+ b
493576```
494577
495578#### Examples
496579
497580```
498− > (min 10 100)
499− 10
500−
501− > (min 10.443 9)
502− 9
581+> (min 10 100)
582+10
583+```
503584
504− > (min 1 1)
505− 1
585+```
586+> (min 10.443 9)
587+9
588+```
506589
507− > (min 'abraham' 'bob')
508− 6.451.042
590+```
591+> (min 1 1)
592+1
593+```
509594
510− > `@t`(min 'abraham' 'bob')
511− 'bob'
595+```
596+> (min 'abraham' 'bob')
597+6.451.042
598+```
512599
513− > `@t`(min 'abraham' 'benjamin')
514− 'abraham'
600+```
601+> `@t`(min 'abraham' 'bob')
602+'bob'
603+```
515604
516− > `@dr`(min ~m6 ~h1)
517− ~m6
605+```
606+> `@t`(min 'abraham' 'benjamin')
607+'abraham'
518608```
519609
610+```
611+> `@dr`(min ~m6 ~h1)
612+~m6
613+```
520614
521615---
522−### `++mod`
616+
617+## `++mod`
523618
524619Modulus
525620
@@ -538,39 +633,48 @@ An [`atom`](/docs/glossary/atom).
538633#### Source
539634
540635```hoon
541− ++ mod
542− ~/ %mod
543− |: [a=`@`1 b=`@`1]
544− ^- @
545− ?< =(0 b)
546− (sub a (mul b (div a b)))
636+++ mod
637+ ~/ %mod
638+ |: [a=`@`1 b=`@`1]
639+ ^- @
640+ ?< =(0 b)
641+ (sub a (mul b (div a b)))
547642```
548643
549644#### Examples
550645
551646```
552− > (mod 5 2)
553− 1
647+> (mod 5 2)
648+1
649+```
554650
555− > (mod 5 5)
556− 0
651+```
652+> (mod 5 5)
653+0
654+```
557655
558− > (mod 2 5)
559− 2
656+```
657+> (mod 2 5)
658+2
659+```
560660
561− > (mod 40 20)
562− 0
661+```
662+> (mod 40 20)
663+0
664+```
563665
564− > `@`'c'
565− 99
566− >`@`'a'
567− 97
568− > (mod 'c' 'a')
569− 2
666+```
667+> `@`'c'
668+99
669+>`@`'a'
670+97
671+> (mod 'c' 'a')
672+2
570673```
571674
572675---
573−### `++mul`
676+
677+## `++mul`
574678
575679Multiply
576680
@@ -589,39 +693,45 @@ An [`atom`](/docs/glossary/atom).
589693#### Source
590694
591695```hoon
592− ++ mul
593− ~/ %mul
594− |: [a=`@`1 b=`@`1]
595− ^- @
596− =+ c=0
597− |-
598− ?: =(0 a) c
599− $(a (dec a), c (add b c))
696+++ mul
697+ ~/ %mul
698+ |: [a=`@`1 b=`@`1]
699+ ^- @
700+ =+ c=0
701+ |-
702+ ?: =(0 a) c
703+ $(a (dec a), c (add b c))
600704```
601705
602706#### Examples
603707
604708```
605− > (mul 3 4)
606− 12
607−
608− > (mul 0 1)
609− 0
709+> (mul 3 4)
710+12
711+```
610712
611− > `@`'a'
612− 97
613− > `@`'b'
614− 98
615− > (mul 'a' 'b')
616− 9.506
713+```
714+> (mul 0 1)
715+0
716+```
617717
618− >`@ux`(mul 0x1f 0xe)
619− 0x1b2
718+```
719+> `@`'a'
720+97
721+> `@`'b'
722+98
723+> (mul 'a' 'b')
724+9.506
620725```
621726
727+```
728+>`@ux`(mul 0x1f 0xe)
729+0x1b2
730+```
622731
623732---
624−### `++sub`
733+
734+## `++sub`
625735
626736Subtract
627737
@@ -640,41 +750,50 @@ An [`atom`](/docs/glossary/atom).
640750#### Source
641751
642752```hoon
643− ++ sub
644− ~/ %sub
645− |= [a=@ b=@]
646− ~_ leaf+"subtract-underflow"
647− ^- @
648− ?: =(0 b) a
649− $(a (dec a), b (dec b))
753+++ sub
754+ ~/ %sub
755+ |= [a=@ b=@]
756+ ~_ leaf+"subtract-underflow"
757+ ^- @
758+ ?: =(0 b) a
759+ $(a (dec a), b (dec b))
650760```
651761
652−
653762#### Examples
654763
655764```
656− > (sub 10 5)
657− 5
765+> (sub 10 5)
766+5
767+```
658768
659− > (sub 243 44)
660− 199
769+```
770+> (sub 243 44)
771+199
772+```
661773
662− > (sub 5 0)
663− 5
774+```
775+> (sub 5 0)
776+5
777+```
664778
665− > (sub 0 5)
666− ! subtract-underflow
667− ! exit
779+```
780+> (sub 0 5)
781+! subtract-underflow
782+! exit
783+```
668784
669− > (sub 'c' 'a')
670− 2
671− > `@`'c'
672− 99
673− > `@`'a'
674− 97
785+```
786+> (sub 'c' 'a')
787+2
788+> `@`'c'
789+99
790+> `@`'a'
791+97
792+```
675793
676− > (sub 0x1f 0xe)
677− 17
678− > `@ux`(sub 0x1f 0xe)
679− 0x11
680−```
794+```
795+> (sub 0x1f 0xe)
796+17
797+> `@ux`(sub 0x1f 0xe)
798+0x11
799+```
content/docs/hoon/reference/stdlib/1b.md+125−89
@@ -7,7 +7,7 @@ template = "doc.html"
77Check out the Nock [explanation](/docs/nock/) for more
88information on the tree-addressing system.
99
10−### `++cap`
10+## `++cap`
1111
1212Tree head
1313
@@ -15,7 +15,6 @@ Tests whether the tree address `a` is in the head or the tail of a [`noun`](/doc
1515Produces the constant [`atom`](/docs/glossary/atom) `%2` if it is within the head (subtree `+2`), or
1616the constant [`atom`](/docs/glossary/atom) `%3` if it is within the tail (subtree `+3`).
1717
18−
1918#### Accepts
2019
2120`a` is an [`atom`](/docs/glossary/atom).
@@ -27,46 +26,57 @@ A constant [`atom`](/docs/glossary/atom).
2726#### Source
2827
2928```hoon
30− ++ cap
31− ~/ %cap
32− |= a=@
33− ^- ?($2 $3)
34− ?- a
35− $2 %2
36− $3 %3
37− ?(%0 %1) !!
38− * $(a (div a 2))
39− ==
29+++ cap
30+ ~/ %cap
31+ |= a=@
32+ ^- ?(%2 %3)
33+ ?- a
34+ %2 %2
35+ %3 %3
36+ ?(%0 %1) !!
37+ * $(a (div a 2))
38+ ==
4039```
4140
4241#### Examples
4342
4443```
45− > (cap 4)
46− %2
44+> (cap 4)
45+%2
46+```
4747
48− > (cap 6)
49− %3
48+```
49+> (cap 6)
50+%3
51+```
5052
51− > (cap (add 10 9))
52− %2
53+```
54+> (cap (add 10 9))
55+%2
56+```
5357
54− > (cap 1) ::address '1' is in neither the head nor the tail
55− ! exit
58+```
59+> (cap 1) ::address '1' is in neither the head nor the tail
60+! exit
61+```
5662
57− > (cap 0x40))
58− %2
59− > `@`0x40
60− 64
63+```
64+> (cap 0x40))
65+%2
66+> `@`0x40
67+64
68+```
6169
62− > (cap 'a')
63− %3
64− > `@`'a'
65− 97
70+```
71+> (cap 'a')
72+%3
73+> `@`'a'
74+97
6675```
6776
6877---
69−### `++mas`
78+
79+## `++mas`
7080
7181Address within head/tail
7282
@@ -84,51 +94,66 @@ An [`atom`](/docs/glossary/atom).
8494#### Source
8595
8696```hoon
87− ++ mas
88− ~/ %mas
89− |= a=@
90− ^- @
91− ?- a
92− 1 !!
93− 2 1
94− 3 1
95− * (add (mod a 2) (mul $(a (div a 2)) 2))
96− ==
97+++ mas
98+ ~/ %mas
99+ |= a=@
100+ ^- @
101+ ?- a
102+ ?(%2 %3) 1
103+ ?(%0 %1) !!
104+ * (add (mod a 2) (mul $(a (div a 2)) 2))
105+ ==
97106```
98107
99108#### Examples
100109
101110```
102− > (mas 3)
103− 1
111+> (mas 3)
112+1
113+```
104114
105− > (mas 4)
106− 2
115+```
116+> (mas 4)
117+2
118+```
107119
108− > (mas 5)
109− 3
110− > (cap 5) ::`(cap a)` computes whether address `a` is in the head or the tail
111− %2
120+```
121+> (mas 5)
122+3
123+> (cap 5) ::`(cap a)` computes whether address `a` is in the head or the tail
124+%2
125+```
112126
113− > (mas 7)
114− 3
115− > (cap 7)
116− %3
127+```
128+> (mas 7)
129+3
130+> (cap 7)
131+%3
132+```
117133
118− > (mas 11)
119− 7
134+```
135+> (mas 11)
136+7
137+```
120138
121− > (mas (mas 11))
122− 3
139+```
140+> (mas (mas 11))
141+3
142+```
123143
124− > (cap (mas 6))
125− %3
144+```
145+> (cap (mas 6))
146+%3
147+```
126148
127− > (mas 0)
128− ! exit ::address `0` is in neither the head nor the tail
149+```
150+> (mas 0) ::address `0` is in neither the head nor the tail
151+! exit
152+```
129153
130− > (mas 1)
131− ! exit ::address `1` is in neither the head nor the tail
154+```
155+> (mas 1) ::address `1` is in neither the head nor the tail
156+! exit
132157```
133158
134159#### Discussion
@@ -166,7 +191,8 @@ Notice how the old values in the head (subtree `+2`) were not illustrated in
166191this case, because `+7` is within the tail (subtree `+3`).
167192
168193---
169−### `++peg`
194+
195+## `++peg`
170196
171197Address within address
172198
@@ -186,43 +212,54 @@ An [`atom`](/docs/glossary/atom).
186212#### Source
187213
188214```hoon
189− ++ peg
190− ~/ %peg
191− |= [a=@ b=@]
192− ?< =(0 a)
193− ^- @
194− ?- b
195− $1 a
196− $2 (mul a 2)
197− $3 +((mul a 2))
198− * (add (mod b 2) (mul $(b (div b 2)) 2))
199− ==
215+++ peg
216+ ~/ %peg
217+ |= [a=@ b=@]
218+ ?< =(0 a)
219+ ^- @
220+ ?- b
221+ %1 a
222+ %2 (mul a 2)
223+ %3 +((mul a 2))
224+ * (add (mod b 2) (mul $(b (div b 2)) 2))
225+ ==
200226```
201227
202228#### Examples
203229
204230```
205− > (peg 4 1)
206− 4
207−
208− > (peg 1 4)
209− 4
231+> (peg 4 1)
232+4
233+```
210234
211− > (peg 4 2)
212− 8
235+```
236+> (peg 1 4)
237+4
238+```
213239
214− > (peg 4 8)
215− 32
240+```
241+> (peg 4 2)
242+8
243+```
216244
217− > (peg 4 (4 2))
218− 32
245+```
246+> (peg 4 8)
247+32
248+```
219249
220− > (peg 8 45)
221− 269
250+```
251+> (peg 4 (4 2))
252+32
253+```
222254
223− > (cap (peg 4 2)) ::`(cap a)` computes whether address `a` is in the head or the tail
224− %2
255+```
256+> (peg 8 45)
257+269
258+```
225259
260+```
261+> (cap (peg 4 2)) ::`(cap a)` computes whether address `a` is in the head or the tail
262+%2
226263```
227264
228265#### Discussion
@@ -269,5 +306,4 @@ Notice how relative address `+4` is at the same position as absolute address
269306 (continues...)
270307```
271308
272−
273309---
content/docs/hoon/reference/stdlib/1c.md+201−122
@@ -4,7 +4,7 @@ weight = 3
44template = "doc.html"
55+++
66
7−### `$bite`
7+## `+$bite`
88
99Atom slice specifier.
1010
@@ -42,7 +42,7 @@ supplied, it defaults to a value of 1.
4242 0
4343```
4444
45−### `$bloq`
45+## `+$bloq`
4646
4747Blocksize
4848
@@ -105,33 +105,40 @@ See the [bit arithmetic](/docs/hoon/reference/stdlib/2c) section for operations
105105
106106---
107107
108−### `++each`
108+## `++each`
109109
110110Mold of fork between two types
111111
112112A mold generator. Produces a discriminated fork between two types, defaulting to
113−`a`.
113+`this`.
114114
115115#### Source
116116
117− ++ each
118− |*([a=mold b=mold] $%([$| p=b] [$& p=a]))
119−
117+```hoon
118+++ each
119+ |$ [this that]
120+ $% [%| p=that]
121+ [%& p=this]
122+ ==
123+```
120124
121125#### Examples
122126
123127```
124− > ? *(each cord time)
125− ?({$.y p/@t} {$.n p/@da})
126− [%.y p='']
128+> ? *(each cord time)
129+ ?([%.y p=@t] [%.n p=@da])
130+[%.y p='']
131+```
127132
128− > ? *(each * tape)
129− ?({$.y p/*} {$.n p/""})
130− [%.y p=0]
133+```
134+> ? *(each * tape)
135+ ?([%.y p=*] [%.n p=""])
136+[%.y p=0]
131137```
132138
133139---
134−### `++gate`
140+
141+## `++gate`
135142
136143Function
137144
@@ -139,7 +146,6 @@ A [`core`](/docs/glossary/core) with one arm, `$`--the empty name--which transfo
139146product noun. If used dryly as a type, the subject must have a sample type of
140147`*`.
141148
142−
143149#### Source
144150
145151```hoon
@@ -150,16 +156,23 @@ product noun. If used dryly as a type, the subject must have a sample type of
150156#### Examples
151157
152158```
153− > ? gate
154− <1.rdl {* <31.ohr 1.jmk $143>}>
155− <1.rdl {* <31.ohr 1.jmk $143>}>
159+> ? gate
160+ <1.ddq [* <46.hgz 1.pnw %140>]>
161+<1.ddq [* <46.hgz 1.pnw %140>]>
162+```
156163
157− > (`gate`|=(a=* [a 'b']) 1)
158− [1 98]
164+```
165+> (`gate`|=(a=* [a 'b']) 1)
166+[1 98]
167+```
159168
160− > (`gate`|=(a=@ [a 'b']) 1)
161− ! nest-fail
162− ! exit
169+```
170+> (`gate`|=(a=@ [a 'b']) 1)
171+mint-nice
172+-need.@
173+-have.*
174+nest-fail
175+dojo: hoon expression failed
163176```
164177
165178#### Discussion
@@ -171,43 +184,51 @@ mathematical sense. Any `gate` normalizes to an iron `gate`.
171184See also: [`++lift`](/docs/hoon/reference/stdlib/2a#lift), [`++cork`](/docs/hoon/reference/stdlib/2n#cork)
172185
173186---
174−### `++list`
187+
188+## `++list`
175189
176190List
177191
178192A mold generator. Generates a mold of a null-terminated list of a
179193homogenous type.
180194
181−
182195#### Source
183196
184197```hoon
185− ++ list
186− |*(a=mold $@($~ (lest a)))
198+++ list
199+ |$ [item]
200+ $@(~ [i=item t=(list item)])
187201```
188202
189203#### Examples
190204
191205```
192− > *(list)
193− ~
194−
195− > `(list @)`"abc"
196− ~[97 98 99]
206+> *(list)
207+~
208+```
197209
198− > (snag 0 "abc")
199− 'a'
210+```
211+> `(list @)`"abc"
212+~[97 98 99]
213+```
200214
201− > `(list @)`[1 2 'j' ~]
202− ~[1 2 106]
215+```
216+> (snag 0 "abc")
217+'a'
218+```
203219
204220```
221+> `(list @)`[1 2 'j' ~]
222+~[1 2 106]
223+```
224+
205225#### Discussion
206226
207227See also: [`++turn`](/docs/hoon/reference/stdlib/2b#turn), [`++snag`](/docs/hoon/reference/stdlib/2b#snag)
208228
209229---
210−### `++lone`
230+
231+## `++lone`
211232
212233Face on mold
213234
@@ -216,56 +237,68 @@ A mold generator. Puts face of `p` on the passed-in mold.
216237#### Source
217238
218239```hoon
219− ++ lone
220− |*(a=mold [p=a])
240+++ lone
241+ |$ [item]
242+ p=item
221243```
222244
223245#### Examples
224246
225247```
226− > ? *cord
227− @t
228− ''
229− > ? *(lone cord)
230− p/@t
231− p=''
248+> ? *cord
249+@t
250+''
251+```
252+
253+```
254+> ? *(lone cord)
255+ p=@t
256+p=''
257+```
258+
259+```
260+> ? *(lone @)
261+ p=@
262+p=0
263+```
232264
233− > ? *(lone @)
234− p/@
235− p=0
236− > ? *@
237− @
238− 0
265+```
266+> ? *@
267+ @
268+0
239269```
240270
241271---
242−### `++pair`
272+
273+## `++pair`
243274
244275Mold of pair of types
245276
246277A mold generator. Produces a tuple of two of the types passed in.
247278
248−
249279#### Source
250280
251281```hoon
252− ++ pair
253− |*([a=mold b=mold] [p=a q=b])
282+++ pair
283+ |$ [head tail]
284+ [p=head q=tail]
254285```
255286
256287#### Examples
257288
258289```
259− > *(pair ? cord)
260− [p=%.y q='']
261−
262− > *(pair tape @)
263− [p="" q=0]
290+> *(pair ? cord)
291+[p=%.y q='']
292+```
264293
294+```
295+> *(pair tape @)
296+[p="" q=0]
265297```
266298
267299---
268−### `++pole`
300+
301+## `++pole`
269302
270303Faceless [`list`](/docs/hoon/reference/stdlib/1c#list)
271304
@@ -274,24 +307,26 @@ A mold generator. A [`list`](/docs/hoon/reference/stdlib/1c#list) without the fa
274307#### Source
275308
276309```hoon
277− ++ pole
278− |*(a=mold $@($~ [a (pole a)]))
310+++ pole
311+ |$ [item]
312+ $@(~ [item (pole item)])
279313```
280314
281−
282315#### Examples
283316
284317```
285− > =/(a "asdf" ?>(?=(^ a) `(lest @tD)`a))
286− [i='a' t=[i='s' t=[i='d' t=[i='f' t=~]]]]
287−
288− > `(pole char)`"asdf"
289− ['a' ['s' ['d' ['f' ~]]]]
318+> =/(a "asdf" ?>(?=(^ a) `(lest @tD)`a))
319+[i='a' t=[i='s' t=[i='d' t=[i='f' t=~]]]]
290320```
291321
322+```
323+> `(pole char)`"asdf"
324+['a' ['s' ['d' ['f' ~]]]]
325+```
292326
293327---
294−### `++qual`
328+
329+## `++qual`
295330
296331Mold of 4-type tuple
297332
@@ -300,43 +335,49 @@ A mold generator. Produces a tuple of four of the types passed in.
300335#### Source
301336
302337```hoon
303− ++ qual
304− |* [a=mold b=mold c=mold d=mold]
305− [p=a q=b r=c s=d]
338+++ qual
339+ |$ [first second third fourth]
340+ [p=first q=second r=third s=fourth]
306341```
307342
308343#### Examples
309344
310345```
311− > *(qual date time tape cord)
312− [p=[[a=%.y y=0] m=0 t=[d=0 h=0 m=0 s=0 f=~]] q=~292277024401-.1.1 r="" s='']
346+> *(qual date time tape cord)
347+[p=[[a=%.y y=0] m=0 t=[d=0 h=0 m=0 s=0 f=~]] q=~2000.1.1 r="" s='']
348+```
313349
314− > *(qual (list @) @u @ud @ux)
315− [p=~ q=0 r=0 s=0x0]
350+```
351+> *(qual (list @) @u @ud @ux)
352+[p=~ q=0 r=0 s=0x0]
316353```
317354
318355---
319−### `++quip`
356+
357+## `++quip`
320358
321359Mold of pair of [`list`](/docs/hoon/reference/stdlib/1c#list) and type
322360
323−A mold generator. Produces a tuple of a [`list`](/docs/hoon/reference/stdlib/1c#list) of `a` and the mold of `b`.
361+A mold generator. Produces a tuple of a [`list`](/docs/hoon/reference/stdlib/1c#list) of `item` and the mold of `state`.
324362
325363#### Source
326364
327365```hoon
328− ++ quip
329− |*([a=mold b=mold] [(list a) b])
366+++ quip
367+ |$ [item state]
368+ [(list item) state]
330369```
331370
332371#### Examples
333372
334373```
335− > *(quip @ _'hi')
336− [~ 'hi']
374+> *(quip @ _'hi')
375+[~ 'hi']
376+```
337377
338− > `(quip @ @ux)`[[1 2 3 4 ~] 0x10]
339− [~[1 2 3 4] 0x10]
378+```
379+> `(quip @ @ux)`[[1 2 3 4 ~] 0x10]
380+[~[1 2 3 4] 0x10]
340381```
341382
342383#### Discussion
@@ -345,7 +386,33 @@ A common pattern in Hoon code is to return a `list` of changes, along with a
345386new state. You'll often see `quip` used in Gall apps.
346387
347388---
348−### `++trap`
389+
390+## `++step`
391+
392+Atom size or offset, in [bloq](#bloq)s.
393+
394+#### Source
395+
396+```
397+++ step
398+ _`@u`1
399+```
400+
401+#### Examples
402+
403+```
404+> `step`0
405+0
406+```
407+
408+```
409+> `step`2
410+2
411+```
412+
413+---
414+
415+## `++trap`
349416
350417[`Core`](/docs/glossary/core) with one arm `$`
351418
@@ -354,26 +421,31 @@ A trap is a [`core`](/docs/glossary/core) with one arm `$`.
354421#### Source
355422
356423```hoon
357− ++ trap
358− |*(a=mold _|?(*a))
424+++ trap
425+ |$ [product]
426+ _|?($:product)
359427```
360428
361429#### Examples
362430
363431```
364− > (*trap)
365− <1?dxy 1.oeg {a/<1|rbb {* <31.ohr 1.jmk $143>}> <31.ohr 1.jmk $143>}>
366−
367− > *(*trap)
368− 0
432+> (*trap)
433+<1?ruo 1.mhl [product=<1|xpg [* * *]> <46.hgz 1.pnw %140>]>
434+```
369435
370− > (|.(42))
371− 42
436+```
437+> *(*trap)
438+0
372439```
373440
441+```
442+> (|.(42))
443+42
444+```
374445
375446---
376−### `++tree`
447+
448+## `++tree`
377449
378450Tree mold generator
379451
@@ -383,20 +455,21 @@ left/right sub `tree` of the same type. Pretty-printed with `{}`.
383455#### Source
384456
385457```hoon
386− ++ tree
387− |*(a=mold $@($~ [n=a l=(tree a) r=(tree a)]))
458+++ tree
459+ |$ [node]
460+ $@(~ [n=node l=(tree node) r=(tree node)])
388461```
389462
390463#### Examples
391464
392465```
393− > `(tree [@ tape])`[[1 "hi"] [[2 "bye"] ~ ~] ~]
394− {[2 "bye"] [1 "hi"]}
466+> `(tree [@ tape])`[[1 "hi"] [[2 "bye"] ~ ~] ~]
467+{[2 "bye"] [1 "hi"]}
395468```
396469
397−
398470---
399−### `++trel`
471+
472+## `++trel`
400473
401474Mold of three types
402475
@@ -405,49 +478,55 @@ A mold generator. A mold of the tuple of the three types passed in.
405478#### Source
406479
407480```hoon
408− ++ trel
409− |*([a=mold b=mold c=mold] [p=a q=b r=c])
481+++ trel
482+ |$ [first second third]
483+ [p=first q=second r=third]
410484```
411485
412486#### Examples
413487
414488```
415− > *(trel @ud @t @s)
416− [p=0 q='' r=--0]
489+> *(trel @ud @t @s)
490+[p=0 q='' r=--0]
491+```
417492
418− > *(trel cord bloq tape)
419− [p='' q=0 r=""]
493+```
494+> *(trel cord bloq tape)
495+[p='' q=0 r=""]
420496```
421497
422498---
423−### `++unit`
499+
500+## `++unit`
424501
425502Maybe
426503
427−A mold generator. A `unit` is either `~` or `[~ u=a]`, where `a` is the
504+A mold generator. A `unit` is either `~` or `[~ u=item]`, where `item` is the
428505type that was passed in.
429506
430−
431507#### Source
432508
433509```hoon
434− ++ unit
435− |*(a=mold $@($~ [$~ u=a]))
510+++ unit
511+ |$ [item]
512+ $@(~ [~ u=item])
436513```
437514
438515#### Examples
439516
440517```
441− > ? *(unit time)
442− ?({$~ u/@da} $~)
443− ~
518+> ? *(unit time)
519+ u(@da)
520+~
521+```
444522
445− > =a |= a=@
446− ^- (unit @)
447− ?~ a ~
448− [~ a]
449− > (a 2)
450− [~ u=2]
523+```
524+> =a |= a=@
525+ ^- (unit @)
526+ ?~ a ~
527+ [~ a]
528+> (a 2)
529+[~ 2]
451530```
452531
453532#### Discussion
content/docs/hoon/reference/stdlib/2a.md+298−131
@@ -4,7 +4,7 @@ weight = 4
44template = "doc.html"
55+++
66
7−### `++biff`
7+## `++biff`
88
99[`Unit`](/docs/hoon/reference/stdlib/1c#unit) as argument
1010
@@ -24,25 +24,27 @@ A [`unit`](/docs/hoon/reference/stdlib/1c#unit).
2424#### Source
2525
2626```hoon
27− ++ biff
28− |* [a=(unit) b=$-(* (unit))]
29− ?~ a ~
30− (b u.a)
27+++ biff
28+ |* [a=(unit) b=$-(* (unit))]
29+ ?~ a ~
30+ (b u.a)
3131```
3232
3333#### Examples
3434
3535```
36− > (biff (some 5) |=(a=@ (some (add a 2))))
37− [~ u=7]
38−
39− > (biff ~ |=(a=@ (some (add a 2))))
40− ~
36+> (biff (some 5) |=(a=@ (some (add a 2))))
37+[~ u=7]
4138```
4239
40+```
41+> (biff ~ |=(a=@ (some (add a 2))))
42+~
43+```
4344
4445---
45−### `++bind`
46+
47+## `++bind`
4648
4749Non-unit function to [`unit`](/docs/hoon/reference/stdlib/1c#unit), producing [`unit`](/docs/hoon/reference/stdlib/1c#unit)
4850
@@ -63,27 +65,28 @@ A [`unit`](/docs/hoon/reference/stdlib/1c#unit).
6365#### Source
6466
6567```hoon
66− ++ bind
67− |* [a=(unit) b=gate]
68− ?~ a ~
69− [~ u=(b u.a)]
68+++ bind
69+ |* [a=(unit) b=gate]
70+ ?~ a ~
71+ [~ u=(b u.a)]
7072```
7173
72−
7374#### Examples
7475
7576```
76− > (bind ((unit @) [~ 97]) ,@t)
77− [~ u='a']
78−
79− > =a |=(a=@ (add a 1))
80− > (bind ((unit @) [~ 2]) a)
81− [~ u=3]
77+> (bind ((unit @) [~ 97]) ,@t)
78+[~ u='a']
8279```
8380
81+```
82+> =a |=(a=@ (add a 1))
83+> (bind ((unit @) [~ 2]) a)
84+[~ u=3]
85+```
8486
8587---
86−### `++bond`
88+
89+## `++bond`
8790
8891Replace null
8992
@@ -103,11 +106,11 @@ Either the product of `a` or the value inside of [`unit`](/docs/hoon/reference/s
103106#### Source
104107
105108```hoon
106− ++ bond
107− |* a=(trap)
108− |* b=(unit)
109− ?~ b $:a
110− u.b
109+++ bond
110+ |* a=(trap)
111+ |* b=(unit)
112+ ?~ b $:a
113+ u.b
111114```
112115
113116#### Examples
@@ -117,14 +120,16 @@ Either the product of `a` or the value inside of [`unit`](/docs/hoon/reference/s
117120 1.024
118121 > ((bond |.((bex 10))) ~)
119122 1.024
123+```
120124
125+```
121126 > ((bond |.((bex 10))) (slaw %ud '123'))
122127 123
123128```
124129
125−
126130---
127−### `++both`
131+
132+## `++both`
128133
129134Group [`unit`](/docs/hoon/reference/stdlib/1c#unit) values into pair
130135
@@ -145,31 +150,36 @@ A [`unit`](/docs/hoon/reference/stdlib/1c#unit) of the two initial values.
145150#### Source
146151
147152```hoon
148− ++ both
149− |* [a=(unit) b=(unit)]
150− ?~ a ~
151− ?~ b ~
152− [~ u=[u.a u.b]]
153+++ both
154+ |* [a=(unit) b=(unit)]
155+ ?~ a ~
156+ ?~ b ~
157+ [~ u=[u.a u.b]]
153158```
154159
155160#### Examples
156161
157162```
158− > (both (some 1) (some %b))
159− [~ u=[1 %b]]
163+> (both (some 1) (some %b))
164+[~ u=[1 %b]]
165+```
160166
161− > (both ~ (some %b))
162− ~
167+```
168+> (both ~ (some %b))
169+~
163170```
164171
165172---
166−### `++clap`
167173
168−Apply function to two [`units`](/docs/hoon/reference/stdlib/1c#unit)
174+## `++clap`
175+
176+Combine two [`units`](/docs/hoon/reference/stdlib/1c#unit) with function
169177
170178Applies a binary function `c`--which does not usually accept or produce a
171179[`unit`](/docs/hoon/reference/stdlib/1c#unit)-- to the values of two [`units`](/docs/hoon/reference/stdlib/1c#unit), `a` and `b`, producing a [`unit`](/docs/hoon/reference/stdlib/1c#unit).
172180
181+If `a` is null, produces `b`. If `b` is null, produces `a`. Otherwise, produces the produce of `c` in a `unit`.
182+
173183#### Accepts
174184
175185`a` is a [`unit`](/docs/hoon/reference/stdlib/1c#unit).
@@ -185,32 +195,82 @@ A [`unit`](/docs/hoon/reference/stdlib/1c#unit).
185195#### Source
186196
187197```hoon
188− ++ clap :: combine
189− |* [a=(unit) b=(unit) c=_|=(^ +<-)]
190− ?~ a b
191− ?~ b a
192− [~ u=(c u.a u.b)]
198+++ clap
199+ |* [a=(unit) b=(unit) c=_=>(~ |=(^ +<-))]
200+ ?~ a b
201+ ?~ b a
202+ [~ u=(c u.a u.b)]
193203```
194204
195205#### Examples
196206
197207```
198− > =u ((unit @t) [~ 'a'])
199− > =v ((unit @t) [~ 'b'])
200− > (clap u v |=([a=@t b=@t] (welp (trip a) (trip b))))
201− [~ u="ab"]
208+> (clap ~ `'b' |=([a=@tD b=@tD] `tape`[a b ~]))
209+[~ u='b']
210+```
211+
212+```
213+> (clap `'a' ~ |=([a=@tD b=@tD] `tape`[a b ~]))
214+[~ u='a']
215+```
216+
217+```
218+> (clap `'a' `'b' |=([a=@tD b=@tD] `tape`[a b ~]))
219+[~ u="ab"]
220+```
221+
222+---
223+
224+## `++clef`
225+
226+Compose two [`units`](/docs/hoon/reference/stdlib/1c#unit) with function
227+
228+Applies a binary function `c`--which does not usually accept [`units`](/docs/hoon/reference/stdlib/1c#unit)-- to the values of two [`units`](/docs/hoon/reference/stdlib/1c#unit), `a` and `b`, producing a [`unit`](/docs/hoon/reference/stdlib/1c#unit).
229+
230+If `a` or `b` are null, produces null. Otherwise, produces the produce of `c`.
231+
232+#### Accepts
233+
234+`a` is a `unit`.
235+
236+`b` is a `unit`.
237+
238+`c` is a `gate` that takes a `cell` and produces a `unit`.
239+
240+#### Produces
241+
242+A `unit`.
243+
244+#### Source
245+
246+```hoon
247+++ clef
248+ |* [a=(unit) b=(unit) c=_=>(~ |=(^ `+<-))]
249+ ?~ a ~
250+ ?~ b ~
251+ (c u.a u.b)
252+```
253+
254+#### Examples
202255
203− > =a ((unit @u) [~ 1])
204− > =b ((unit @u) [~ 2])
205− > =c |=([a=@ b=@] (add a b))
256+```
257+> (clef ~ `'b' |=([a=@tD b=@tD] `(unit tape)`[~ [a b ~]]))
258+~
259+```
206260
207− > (clap a b c)
208− [~ 3]
261+```
262+> (clef `'a' ~ |=([a=@tD b=@tD] `(unit tape)`[~ [a b ~]]))
263+~
209264```
210265
266+```
267+> (clef `'a' `'b' |=([a=@tD b=@tD] `(unit tape)`[~ [a b ~]]))
268+[~ "ab"]
269+```
211270
212271---
213−### `++drop`
272+
273+## `++drop`
214274
215275[`Unit`](/docs/hoon/reference/stdlib/1c#unit) to list
216276
@@ -227,27 +287,29 @@ A list.
227287#### Source
228288
229289```hoon
230− ++ drop :: enlist
231− |* a=(unit)
232− ?~ a ~
233− [i=u.a t=~]
290+++ drop
291+ |* a=(unit)
292+ ?~ a ~
293+ [i=u.a t=~]
234294```
235295
236296#### Examples
237297
238298```
239− > =a ((unit @) [~ 97])
240− > (drop a)
241− [i=97 t=~]
242−
243− > =a ((unit @) [~])
244− > (drop a)
245− ~
299+> =a ((unit @) [~ 97])
300+> (drop a)
301+[i=97 t=~]
246302```
247303
304+```
305+> =a ((unit @) [~])
306+> (drop a)
307+~
308+```
248309
249310---
250−### `++fall`
311+
312+## `++fall`
251313
252314Give [`unit`](/docs/hoon/reference/stdlib/1c#unit) a default value
253315
@@ -266,32 +328,125 @@ Either a [`noun`](/docs/glossary/noun) `b` or the unwrapped value of [`unit`](/d
266328#### Source
267329
268330```hoon
269− ++ fall :: default
270− |* [a=(unit) b=*]
271− ?~(a b u.a)
331+++ fall
332+ |* [a=(unit) b=*]
333+ ?~(a b u.a)
334+```
335+
336+#### Examples
337+
338+```
339+> (fall ~ 'a')
340+'a'
341+> (fall [~ u=0] 'a')
342+0
343+```
344+
345+---
346+
347+## `++flit`
348+
349+Make filter
350+
351+Accepts gate `a` which produces a `?`. Applies `a` to `b`, producing `b` wrapped in a `unit` if true, otherwise produces null.
352+
353+`+flit` is a wet gate that takes `a` and produces a new wet gate that takes `b`.
354+
355+#### Accepts
356+
357+`a` is a `gate` which produces `?`, and is the sample of the outer wet gate.
358+
359+`b` is any `noun`, and is the sample of the inner wet gate.
360+
361+#### Produces
362+
363+`(unit [type])`, where `[type]` is the type of `b`.
364+
365+#### Source
366+
367+```hoon
368+++ flit
369+ |* a=$-(* ?)
370+ |* b=*
371+ ?.((a b) ~ [~ u=b])
372+```
373+
374+#### Examples
375+
376+```
377+> =f (flit |=(=@ud ?:(=(ud 1) %.y %.n)))
378+> (f 1)
379+[~ 1]
380+> (f 2)
381+~
382+```
383+
384+---
385+
386+## `++hunt`
387+
388+First of units
389+
390+Apply binary gate `ord`, which produces a `?`, to units `a` and `b`. Produce `a` if true and `b` if false. If `a` is null, produce `b`. If `b` is null, produce `a`.
391+
392+This allows selecting between two units by some rule.
393+
394+#### Accepts
395+
396+`ord` is a `$-(^ ?)` - a binary gate that produces `?`.
397+
398+`a` is a `unit`.
399+
400+`b` is a `unit`.
401+
402+#### Produces
403+
404+A `unit`.
405+
406+#### Source
407+
408+```hoon
409+++ hunt
410+ |* [ord=$-(^ ?) a=(unit) b=(unit)]
411+ ^- %- unit
412+ $? _?>(?=(^ a) u.a)
413+ _?>(?=(^ b) u.b)
414+ ==
415+ ?~ a b
416+ ?~ b a
417+ ?:((ord u.a u.b) a b)
272418```
273419
274420#### Examples
275421
276422```
277− > (fall ~ 'a')
278− 'a'
279− > (fall [~ u=0] 'a')
280− 0
423+> (hunt gte ~ `20)
424+[~ 20]
425+```
426+
427+```
428+> (hunt gte `10 ~)
429+[~ 10]
430+```
431+
432+```
433+> (hunt gte `10 `20)
434+[~ 20]
281435```
282436
283437---
284−### `++lift`
438+
439+## `++lift`
285440
286441Curried bind
287442
288−Accepts a `++gate` `a` and produces a function that accepts [`unit`](/docs/hoon/reference/stdlib/1c#unit)
443+Accepts function `a` and produces a function that accepts [`unit`](/docs/hoon/reference/stdlib/1c#unit)
289444`b` to which it applies `a`. Used when you want a function that does not accept
290445or produce a [`unit`](/docs/hoon/reference/stdlib/1c#unit) to both accept and produce a [`unit`](/docs/hoon/reference/stdlib/1c#unit).
291446
292447#### Accepts
293448
294−`a` is a gate.
449+`a` is a `mold`.
295450
296451`b` is a [`unit`](/docs/hoon/reference/stdlib/1c#unit).
297452
@@ -302,25 +457,27 @@ A [`unit`](/docs/hoon/reference/stdlib/1c#unit).
302457#### Source
303458
304459```hoon
305− ++ lift :: lift gate (fmap)
306− |* a=gate :: flipped
307− |* b=(unit) :: curried
308− (bind b a) :: bind
460+++ lift
461+ |* a=mold
462+ |* b=(unit)
463+ (bind b a)
309464```
310465
311466#### Examples
312467
313468```
314− > ((lift dec) `(unit @)`~)
315− ~
316−
317− > ((lift dec) `(unit @)`[~ 20])
318− [~ 19]
469+> ((lift dec) `(unit @)`~)
470+~
319471```
320472
473+```
474+> ((lift dec) `(unit @)`[~ 20])
475+[~ 19]
476+```
321477
322478---
323−### `++mate`
479+
480+## `++mate`
324481
325482Choose
326483
@@ -343,36 +500,40 @@ A [`unit`](/docs/hoon/reference/stdlib/1c#unit) or crash.
343500#### Source
344501
345502```hoon
346− ++ mate :: choose
347− |* [a=(unit) b=(unit)]
348− ?~ b a
349− ?~ a b
350− ?.(=(u.a u.b) ~|('mate' !!) a)
503+++ mate
504+ |* [a=(unit) b=(unit)]
505+ ?~ b a
506+ ?~ a b
507+ ?.(=(u.a u.b) ~>(%mean.'mate' !!) a)
351508```
352509
353510#### Examples
354511
355512```
356− > =a ((unit @) [~ 97])
357− > =b ((unit @) [~ 97])
358− > (mate a b)
359− [~ 97]
360−
361− > =a ((unit @) [~ 97])
362− > =b ((unit @) [~])
363− > (mate a b)
364− [~ 97]
513+> =a ((unit @) [~ 97])
514+> =b ((unit @) [~ 97])
515+> (mate a b)
516+[~ 97]
517+```
365518
366− > =a ((unit @) [~ 97])
367− > =b ((unit @) [~ 98])
368− > (mate a b)
369− ! 'mate'
370− ! exit
519+```
520+> =a ((unit @) [~ 97])
521+> =b ((unit @) [~])
522+> (mate a b)
523+[~ 97]
371524```
372525
526+```
527+> =a ((unit @) [~ 97])
528+> =b ((unit @) [~ 98])
529+> (mate a b)
530+! 'mate'
531+! exit
532+```
373533
374534---
375−### `++need`
535+
536+## `++need`
376537
377538Unwrap [`unit`](/docs/hoon/reference/stdlib/1c#unit)
378539
@@ -389,31 +550,36 @@ Either the unwrapped value of `a` (`u.a`), or crash.
389550#### Source
390551
391552```hoon
392− ++ need :: demand
393− |* a=(unit)
394− ?~ a ~|(%need !!)
395− u.a
553+++ need
554+ ~/ %need
555+ |* a=(unit)
556+ ?~ a ~>(%mean.'need' !!)
557+ u.a
396558```
397559
398560#### Examples
399561
400562```
401− > =a ((unit [@t @t]) [~ ['a' 'b']])
402− > (need a)
403− ['a' 'b']
404−
405− > =a ((unit @ud) [~ 17])
406− > (need a)
407− 17
563+> =a ((unit [@t @t]) [~ ['a' 'b']])
564+> (need a)
565+['a' 'b']
566+```
408567
409− > =a ((unit @) [~])
410− > (need a)
411− ! exit
568+```
569+> =a ((unit @ud) [~ 17])
570+> (need a)
571+17
412572```
413573
574+```
575+> =a ((unit @) [~])
576+> (need a)
577+! exit
578+```
414579
415580---
416−### `++some`
581+
582+## `++some`
417583
418584Wrap value in a [`unit`](/docs/hoon/reference/stdlib/1c#unit)
419585
@@ -430,20 +596,21 @@ A [`unit`](/docs/hoon/reference/stdlib/1c#unit).
430596#### Source
431597
432598```hoon
433− ++ some :: lift (pure)
434− |* a=*
435− [~ u=a]
599+++ some
600+ |* a=*
601+ [~ u=a]
436602```
437603
438604#### Examples
439605
440606```
441− > (some ['a' 'b'])
442− [~ u=['a' 'b']]
443−
444− > (some &)
445− [~ u=%.y]
607+> (some ['a' 'b'])
608+[~ u=['a' 'b']]
446609```
447610
611+```
612+> (some &)
613+[~ u=%.y]
614+```
448615
449616---
content/docs/hoon/reference/stdlib/2b.md+664−431
@@ -4,7 +4,53 @@ weight = 5
44template = "doc.html"
55+++
66
7−### `++fand`
7+## `++bake`
8+
9+**Note:** This function isn't specifically a list function but is included in section 2b of the standard library so is documented here for completeness.
10+
11+Convert wet gate `f` to a dry gate by specifying argument mold `a`.
12+
13+`+bake` is a wet gate that takes a wet gate and produces a dry gate.
14+
15+#### Accepts
16+
17+`f` is a `gate`.
18+
19+`a` is a `mold`.
20+
21+#### Produces
22+
23+A dry `gate` whose sample type is `a`.
24+
25+#### Source
26+
27+```hoon
28+++ bake
29+ |* [f=gate a=mold]
30+ |= arg=a
31+ (f arg)
32+```
33+
34+#### Examples
35+
36+```
37+> =wet-gate |*(a=* [a a])
38+> (wet-gate 42)
39+[42 42]
40+> (wet-gate ['foo' 'bar'])
41+[['foo' 'bar'] 'foo' 'bar']
42+> =dry-gate (bake wet-gate @ud)
43+> (dry-gate 42)
44+[42 42]
45+> (dry-gate ['foo' 'bar'])
46+-need.@ud
47+-have.[@t @t]
48+nest-fail
49+```
50+
51+---
52+
53+## `++fand`
854
955All indices in `list`
1056
@@ -24,42 +70,48 @@ A `list`.
2470#### Source
2571
2672```hoon
27− ++ fand
28− ~/ %fand
29− |= [nedl=(list) hstk=(list)]
30− =| i=@ud
31− =| fnd=(list @ud)
32− |- ^+ fnd
33− =+ [n=nedl h=hstk]
34− |-
35− ?: |(?=($~ n) ?=($~ h))
36− (flop fnd)
37− ?: =(i.n i.h)
38− ?~ t.n
39− ^$(i +(i), hstk +.hstk, fnd [i fnd])
40− $(n t.n, h t.h)
41− ^$(i +(i), hstk +.hstk)
73+++ fand
74+ ~/ %fand
75+ |= [nedl=(list) hstk=(list)]
76+ =| i=@ud
77+ =| fnd=(list @ud)
78+ |- ^+ fnd
79+ =+ [n=nedl h=hstk]
80+ |-
81+ ?: |(?=(~ n) ?=(~ h))
82+ (flop fnd)
83+ ?: =(i.n i.h)
84+ ?~ t.n
85+ ^$(i +(i), hstk +.hstk, fnd [i fnd])
86+ $(n t.n, h t.h)
87+ ^$(i +(i), hstk +.hstk)
4288```
4389
4490#### Examples
4591
4692```
47− > (fand ~[3] ~[1 2 3])
48− ~[2]
49−
50− > (fand ~[4] ~[1 2 3])
51− ~
93+> (fand ~[3] ~[1 2 3])
94+~[2]
95+```
5296
53− > (fand ~['a'] "cbabab")
54− ~[2 4]
97+```
98+> (fand ~[4] ~[1 2 3])
99+~
100+```
55101
56− > (fand "ba" "cbabab")
57− ~[1 3]
102+```
103+> (fand ~['a'] "cbabab")
104+~[2 4]
58105```
59106
107+```
108+> (fand "ba" "cbabab")
109+~[1 3]
110+```
60111
61112---
62−### `++find`
113+
114+## `++find`
63115
64116First index in `list`
65117
@@ -79,43 +131,52 @@ The `unit` of an atom.
79131#### Source
80132
81133```hoon
82− ++ find
83− ~/ %find
84− |= [nedl=(list) hstk=(list)]
85− =| i=@ud
86− |- ^- (unit @ud)
87− =+ [n=nedl h=hstk]
88− |-
89− ?: |(?=($~ n) ?=($~ h))
90− ~
91− ?: =(i.n i.h)
92− ?~ t.n
93− `i
94− $(n t.n, h t.h)
95− ^$(i +(i), hstk +.hstk)
134+++ find
135+ ~/ %find
136+ |= [nedl=(list) hstk=(list)]
137+ =| i=@ud
138+ |- ^- (unit @ud)
139+ =+ [n=nedl h=hstk]
140+ |-
141+ ?: |(?=(~ n) ?=(~ h))
142+ ~
143+ ?: =(i.n i.h)
144+ ?~ t.n
145+ `i
146+ $(n t.n, h t.h)
147+ ^$(i +(i), hstk +.hstk)
96148```
97149
98150#### Examples
99151
100152```
101− > (find [3]~ ~[1 2 3])
102− [~ u=2]
153+> (find [3]~ ~[1 2 3])
154+[~ u=2]
155+```
103156
104− > (find [4]~ ~[1 2 3])
105− ~
157+```
158+> (find [4]~ ~[1 2 3])
159+~
160+```
106161
107− > (find ['c']~ "cbabab")
108− [~ u=0]
162+```
163+> (find ['c']~ "cbabab")
164+[~ u=0]
165+```
109166
110− > (find "ab" "cbabab")
111− [~ u=1]
167+```
168+> (find "ab" "cbabab")
169+[~ u=1]
170+```
112171
113− > (find "bab" "cbabab")
114− [~ u=2]
172+```
173+> (find "bab" "cbabab")
174+[~ u=2]
115175```
116176
117177---
118−### `++flop`
178+
179+## `++flop`
119180
120181Reverse
121182
@@ -132,31 +193,33 @@ A `list`.
132193#### Source
133194
134195```hoon
135− ++ flop
136− ~/ %flop
137− |* a=(list)
138− => .(a (homo a))
139− ^+ a
140− =+ b=`_a`~
141− |-
142− ?~ a b
143− $(a t.a, b [i.a b])
196+++ flop
197+ ~/ %flop
198+ |* a=(list)
199+ => .(a (homo a))
200+ ^+ a
201+ =+ b=`_a`~
202+ |-
203+ ?~ a b
204+ $(a t.a, b [i.a b])
144205```
145206
146−
147207#### Examples
148208
149209```
150− > =a [1 2 3 ~]
151− > (flop a)
152− ~[3 2 1]
210+> =a [1 2 3 ~]
211+> (flop a)
212+~[3 2 1]
213+```
153214
154− > (flop (flop a))
155− ~[1 2 3]
215+```
216+> (flop (flop a))
217+~[1 2 3]
156218```
157219
158220---
159−### `++gulf`
221+
222+## `++gulf`
160223
161224List from range
162225
@@ -176,24 +239,28 @@ a `list`.
176239#### Source
177240
178241```hoon
179− ++ gulf
180− |= [a=@ b=@]
181− ^- (list @)
182− ?:(=(a +(b)) ~ [a $(a +(a))])
242+++ gulf
243+ |= [a=@ b=@]
244+ ?> (lte a b)
245+ |- ^- (list @)
246+ ?:(=(a +(b)) ~ [a $(a +(a))])
183247```
184248
185249#### Examples
186250
187251```
188− > (gulf 1 6)
189− ~[1 2 3 4 5 6]
252+> (gulf 1 6)
253+~[1 2 3 4 5 6]
254+```
190255
191− > `(list @t)`(gulf 99 106)
192− <|c d e f g h i j|>
256+```
257+> `(list @t)`(gulf 99 106)
258+<|c d e f g h i j|>
193259```
194260
195261---
196−### `++homo`
262+
263+## `++homo`
197264
198265Homogenize
199266
@@ -212,7 +279,7 @@ a `list`.
212279#### Source
213280
214281```hoon
215−++ homo :: homogenize
282+++ homo
216283 |* a=(list)
217284 ^+ =< $
218285 |@ ++ $ ?:(*? ~ [i=(snag 0 a) t=$])
@@ -223,23 +290,60 @@ a `list`.
223290#### Examples
224291
225292```
226− > lyst
227− [i=1 t=[i=97 t=[i=2 t=[i=98 t=[i=[~ u=10] t=~]]]]]
293+> lyst
294+[i=1 t=[i=97 t=[i=2 t=[i=98 t=[i=[~ u=10] t=~]]]]]
295+> (homo lyst)
296+~[1 97 2 98 [~ u=10]]
297+```
298+
299+```
300+> =a (limo [1 2 3 ~])
301+> a
302+[i=1 t=[i=2 t=[i=3 t=~]]]
303+> (homo a)
304+~[1 2 3]
305+```
306+
307+---
308+
309+## `++into`
310+
311+Insert item at index
312+
313+Accepts a `list` `a`, an atom `b`, and a noun `c`, producing the list of `a` with the item `c` inserted at index `b`.
228314
229− > (homo lyst)
230− ~[1 97 2 98 [~ u=10]]
315+#### Accepts
316+
317+`a` is a list.
318+
319+`b` is a atom.
320+
321+`c` is a noun.
322+
323+#### Produces
324+
325+the list of `a` with the item `c` inserted at index `b`.
326+
327+#### Source
328+
329+```hoon
330+++ into
331+ ~/ %into
332+ |* [a=(list) b=@ c=*]
333+ ^+ a
334+ (weld (scag b a) [c (slag b a)])
335+```
231336
232− > =a (limo [1 2 3 ~])
233− > a
234− [i=1 t=[i=2 t=[i=3 t=~]]]
337+#### Examples
235338
236− > (homo a)
237− ~[1 2 3]
339+```
340+> (into (limo ~[2 3 4]) 1 11)
341+~[2 11 3 4]
238342```
239343
240344---
241345
242−### `++join`
346+## `++join`
243347
244348Constructs a new `list`, placing `sep` between every element of `lit`.
245349
@@ -256,29 +360,32 @@ a `list`.
256360#### Source
257361
258362```hoon
259− ++ join
260− |* [sep=* lit=(list)]
261− =. sep `_?>(?=(^ lit) i.lit)`sep
262− ?~ lit ~
263− =| out=(list _?>(?=(^ lit) i.lit))
264− |- ^+ out
265− ?~ t.lit
266− (flop [i.lit out])
267− $(out [sep i.lit out], lit t.lit)
363+++ join
364+ |* [sep=* lit=(list)]
365+ =. sep `_?>(?=(^ lit) i.lit)`sep
366+ ?~ lit ~
367+ =| out=(list _?>(?=(^ lit) i.lit))
368+ |- ^+ out
369+ ?~ t.lit
370+ (flop [i.lit out])
371+ $(out [sep i.lit out], lit t.lit)
268372```
269373
270374#### Examples
271375
272376```
273− > (join ' ' "hoon")
274− "h o o n"
377+> (join ' ' "hoon")
378+"h o o n"
379+```
275380
276− > (join 0 `(list @)`~[1 2 3])
277− ~[1 0 2 0 3]
381+```
382+> (join 0 `(list @)`~[1 2 3])
383+~[1 0 2 0 3]
278384```
279385
280386---
281−### `++lent`
387+
388+## `++lent`
282389
283390List length
284391
@@ -295,29 +402,31 @@ an atom.
295402#### Source
296403
297404```hoon
298− ++ lent
299− ~/ %lent
300− |= a=(list)
301− ^- @
302− =+ b=0
303− |-
304− ?~ a b
305− $(a t.a, b +(b))
405+++ lent
406+ ~/ %lent
407+ |= a=(list)
408+ ^- @
409+ =+ b=0
410+ |-
411+ ?~ a b
412+ $(a t.a, b +(b))
306413```
307414
308415#### Examples
309416
310417```
311− > (lent [1 2 3 4 ~]))
312− 4
313−
314− > (lent [1 'a' 2 'b' (some 10) ~])
315− 5
418+> (lent [1 2 3 4 ~]))
419+4
316420```
317421
422+```
423+> (lent [1 'a' 2 'b' (some 10) ~])
424+5
425+```
318426
319427---
320−### `++levy`
428+
429+## `++levy`
321430
322431Logical "and" on list
323432
@@ -336,31 +445,32 @@ A boolean.
336445#### Source
337446
338447```hoon
339− ++ levy
340− ~/ %levy :: all of
341− |* [a=(list) b=$-(* ?)]
342− |- ^- ?
343− ?~ a &
344− ?. (b i.a) |
345− $(a t.a)
448+++ levy
449+ ~/ %levy
450+ |* [a=(list) b=$-(* ?)]
451+ |- ^- ?
452+ ?~ a &
453+ ?. (b i.a) |
454+ $(a t.a)
346455```
347456
348457#### Examples
349458
350459```
351− > =a |=(a=@ (lte a 1))
352− > (levy `(list @)`[0 1 2 1 ~] a)
353− %.n
354−
355− > =a |=(a=@ (lte a 3))
356− > (levy `(list @)`[0 1 2 1 ~] a)
357− %.y
460+> =a |=(a=@ (lte a 1))
461+> (levy `(list @)`[0 1 2 1 ~] a)
462+%.n
358463```
359464
465+```
466+> =a |=(a=@ (lte a 3))
467+> (levy `(list @)`[0 1 2 1 ~] a)
468+%.y
469+```
360470
361471---
362472
363−### `++lien`
473+## `++lien`
364474
365475Logical "or" on list
366476
@@ -376,30 +486,32 @@ every element of `++list` `a`.
376486#### Source
377487
378488```hoon
379− ++ lien
380− ~/ %lien
381− |* [a=(list) b=$-(* ?)]
382− |- ^- ?
383− ?~ a |
384− ?: (b i.a) &
385− $(a t.a)
489+++ lien
490+ ~/ %lien
491+ |* [a=(list) b=$-(* ?)]
492+ |- ^- ?
493+ ?~ a |
494+ ?: (b i.a) &
495+ $(a t.a)
386496```
387497
388498#### Examples
389499
390500```
391− > =a |=(a=@ (gte a 1))
392− > (lien `(list @)`[0 1 2 1 ~] a)
393− %.y
394−
395− > =a |=(a=@ (gte a 3))
396− > (lien `(list @)`[0 1 2 1 ~]) a)
397− %.n
501+> =a |=(a=@ (gte a 1))
502+> (lien `(list @)`[0 1 2 1 ~] a)
503+%.y
398504```
399505
506+```
507+> =a |=(a=@ (gte a 3))
508+> (lien `(list @)`[0 1 2 1 ~]) a)
509+%.n
510+```
400511
401512---
402−### `++limo`
513+
514+## `++limo`
403515
404516List Constructor
405517
@@ -416,7 +528,7 @@ A `++list`.
416528#### Source
417529
418530```hoon
419−++ limo :: listify
531+++ limo
420532 |* a=*
421533 ^+ =< $
422534 |@ ++ $ ?~(a ~ ?:(*? [i=-.a t=$] $(a +.a)))
@@ -427,18 +539,18 @@ A `++list`.
427539#### Examples
428540
429541```
430− > (limo [1 2 3 ~])
431− [i=1 t=[i=2 t=[i=3 t=~]]]
542+> (limo [1 2 3 ~])
543+[i=1 t=[i=2 t=[i=3 t=~]]]
432544```
433545
434−
435546---
436−### `++murn`
547+
548+## `++murn`
437549
438550Maybe transform
439551
440552Passes each member of `list` `a` to gate `b`, which must produce a
441−`unit`. Produces a new list with all the results that do not produce
553+`unit`. Produces a new list with all the results that do not produce
442554`~`.
443555
444556#### Accepts
@@ -454,28 +566,28 @@ A unit.
454566#### Source
455567
456568```hoon
457− ++ murn :: maybe transform
458− ~/ %murn
459− |* [a=(list) b=$-(* (unit))]
460− |-
461− ?~ a ~
462− =+ c=(b i.a)
463− ?~ c
464− $(a t.a)
465− [i=u.c t=$(a t.a)]
569+++ murn
570+ ~/ %murn
571+ |* [a=(list) b=$-(* (unit))]
572+ => .(a (homo a))
573+ |- ^- (list _?>(?=(^ a) (need (b i.a))))
574+ ?~ a ~
575+ =/ c (b i.a)
576+ ?~ c $(a t.a)
577+ [+.c $(a t.a)]
466578```
467579
468580#### Examples
469581
470582```
471− > =a |=(a=@ ?.((gte a 2) ~ (some (add a 10))))
472− > (murn `(list @)`[0 1 2 3 ~] a)
473− [i=12 t=[i=13 t=~]]
583+> =a |=(a=@ ?.((gte a 2) ~ (some (add a 10))))
584+> (murn `(list @)`[0 1 2 3 ~] a)
585+[i=12 t=[i=13 t=~]]
474586```
475587
476−
477588---
478−### `++oust`
589+
590+## `++oust`
479591
480592Remove
481593
@@ -493,25 +605,27 @@ A `++list`.
493605#### Source
494606
495607```hoon
496− ++ oust :: remove
497− ~/ %oust
498− |* [[a=@ b=@] c=(list)]
499− (weld (scag a c) (slag (add a b) c))
608+++ oust
609+ ~/ %oust
610+ |* [[a=@ b=@] c=(list)]
611+ (weld (scag +<-< c) (slag (add +<-< +<->) c))
500612```
501613
502614#### Examples
503615
504616```
505− > (oust [4 5] "good day, urbit!")
506− "good urbit!"
507−
508− > (oust [2 2] `(list @)`[1 2 3 4 ~])
509− ~[1 2]
617+> (oust [4 5] "good day, urbit!")
618+"good urbit!"
510619```
511620
621+```
622+> (oust [2 2] `(list @)`[1 2 3 4 ~])
623+~[1 2]
624+```
512625
513626---
514−### `++reap`
627+
628+## `++reap`
515629
516630Replicate
517631
@@ -530,30 +644,71 @@ A list.
530644#### Source
531645
532646```hoon
533− ++ reap :: replicate
534− ~/ %reap
535− |* [a=@ b=*]
536− |- ^- (list _b)
537− ?~ a ~
538− [b $(a (dec a))]
647+++ reap
648+ ~/ %reap
649+ |* [a=@ b=*]
650+ |- ^- (list _b)
651+ ?~ a ~
652+ [b $(a (dec a))]
539653```
540654
541655#### Examples
542656
543657```
544− > (reap 20 %a)
545− ~[%a %a %a %a %a %a %a %a %a %a %a %a %a %a %a %a %a %a %a %a]
658+> (reap 20 %a)
659+~[%a %a %a %a %a %a %a %a %a %a %a %a %a %a %a %a %a %a %a %a]
660+```
546661
547− > (reap 5 ~s1)
548− ~[~s1 ~s1 ~s1 ~s1 ~s1]
662+```
663+> (reap 5 ~s1)
664+~[~s1 ~s1 ~s1 ~s1 ~s1]
665+> `@dr`(roll (reap 5 ~s1) add)
666+~s5
667+```
668+
669+---
549670
550− > `@dr`(roll (reap 5 ~s1) add)
551− ~s5
671+## `++rear`
672+
673+Last item of list
674+
675+Produces the last item in list `a`, crashing if `a` is null.
676+
677+#### Accepts
678+
679+`a` is a `list`.
680+
681+#### Produces
682+
683+The type of the last element in `a`.
684+
685+#### Source
686+
687+```hoon
688+++ rear
689+ ~/ %rear
690+ |* a=(list)
691+ ^- _?>(?=(^ a) i.a)
692+ ?> ?=(^ a)
693+ ?: =(~ t.a) i.a
694+ $(a t.a)
552695```
553696
697+#### Examples
698+
699+```
700+> (rear ~[1 2 3])
701+3
702+```
703+
704+```
705+> (rear ~)
706+dojo: hoon expression failed
707+```
554708
555709---
556−### `++reel`
710+
711+## `++reel`
557712
558713Right fold
559714
@@ -582,30 +737,31 @@ The accumulator, which is a noun.
582737#### Source
583738
584739```hoon
585− ++ reel
586− ~/ %reel
587− |* [a=(list) b=_|=([* *] +<+)]
588− |- ^+ +<+.b
589− ?~ a
590− +<+.b
591− (b i.a $(a t.a))
740+++ reel
741+ ~/ %reel
742+ |* [a=(list) b=_=>(~ |=([* *] +<+))]
743+ |- ^+ ,.+<+.b
744+ ?~ a
745+ +<+.b
746+ (b i.a $(a t.a))
592747```
593748
594749#### Examples
595750
596751```
597− > (reel `(list @)`[1 2 3 4 5 ~] add)
598− 15
752+> (reel `(list @)`[1 2 3 4 5 ~] add)
753+15
599754
600− > (reel `(list @)`[6 3 1 ~] sub)
601− 4
755+> (reel `(list @)`[6 3 1 ~] sub)
756+4
602757
603− > (reel `(list @)`[3 6 1 ~] sub)
604− ! subtract-underflow
605− ! exit
758+> (reel `(list @)`[3 6 1 ~] sub)
759+! subtract-underflow
760+! exit
606761```
607762
608763`+mul`'s default sample is 1, so calling `+reel` with `+mul` yields the expected behavior:
764+
609765```
610766> *mul
6117671
@@ -613,22 +769,38 @@ The accumulator, which is a noun.
613769> (reel `(list @)`~[1 2 3 4] mul)
61477024
615771```
772+
616773However, if you build a gate that uses `+mul` like so, the sample defaults to 0
617774since that is the bunt of `@`:
775+
618776```
619777> (reel `(list @)`~[1 2 3 4] |=([a=@ b=@] (mul a b)))
6207780
621779```
780+
622781We can fix this with `|:`:
782+
623783```
624784> (reel `(list @)`~[1 2 3 4] |:([a=1 b=1] (mul a b)))
62578524
626786```
627787
788+If you check the definition of `+mul`, you'll see that it also utilizes this
789+pattern.
790+
791+We can check explicitly what sequence of operations `+reel` performs like this:
792+```
793+> =f |: [l='e_l' r='e_r']
794+ ^- @t
795+ :((cury cat 3) '(' l '*' r ')')
796+> (reel "abcde" f)
797+'(a*(b*(c*(d*(e*e_r)))))'
798+```
628799
629800
630801---
631−### `++roll`
802+
803+## `++roll`
632804
633805Left fold
634806
@@ -657,13 +829,13 @@ The accumulator, which is a noun.
657829#### Source
658830
659831```hoon
660− ++ roll :: left fold
661− ~/ %roll
662− |* [a=(list) b=_|=([* *] +<+)]
663− |- ^+ +<+.b
664− ?~ a
665− +<+.b
666− $(a t.a, b b(+<+ (b i.a +<+.b)))
832+++ roll
833+ ~/ %roll
834+ |* [a=(list) b=_=>(~ |=([* *] +<+))]
835+ |- ^+ ,.+<+.b
836+ ?~ a
837+ +<+.b
838+ $(a t.a, b b(+<+ (b i.a +<+.b)))
667839```
668840
669841#### Examples
@@ -681,6 +853,7 @@ q=4
681853```
682854
683855`+mul`'s default sample is 1, so calling `+roll` with `+mul` yields the expected behavior:
856+
684857```
685858> *mul
6868591
@@ -688,21 +861,49 @@ q=4
688861> (roll `(list @)`~[1 2 3 4] mul)
68986224
690863```
864+
691865However, if you build a gate that uses `+mul` like so, the sample defaults to 0
692866since that is the bunt of `@`:
867+
693868```
694869> (roll `(list @)`~[1 2 3 4] |=([a=@ b=@] (mul a b)))
6958700
696871```
872+
697873We can fix this with `|:`:
874+
698875```
699876> (roll `(list @)`~[1 2 3 4] |:([a=1 b=1] (mul a b)))
70087724
701878```
879+If you check the definition of `+mul`, you'll see that it also utilizes this
880+pattern.
702881
882+We can check explicitly what sequence of operations `+roll` performs like this:
883+```
884+> =f |: [l='e_l' r='e_r']
885+ ^- @t
886+ :((cury cat 3) '(' l '*' r ')')
887+> (roll "abcde" f)
888+'(e*(d*(c*(b*(a*e_r)))))
889+```
890+This is in contrast to what one might expect:
891+```
892+> =foldl
893+ |* [l=(list) f=$-([* *] *)]
894+ ^- f
895+ ?~ l +<-.f
896+ %= $
897+ +<-.f (f +<-.f i.l)
898+ l t.l
899+ ==
900+> (foldl "abcde" f)
901+'(((((e_l*a)*b)*c)*d)*e)'
902+```
703903
704904---
705−### `++scag`
905+
906+## `++scag`
706907
707908Prefix
708909
@@ -722,27 +923,29 @@ A list of the same type as `b`.
722923#### Source
723924
724925```hoon
725− ++ scag :: prefix
726− ~/ %scag
727− |* [a=@ b=(list)]
728− |- ^+ b
729− ?: |(?=(~ b) =(0 a)) ~
730− [i.b $(b t.b, a (dec a))]
926+++ scag
927+ ~/ %scag
928+ |* [a=@ b=(list)]
929+ |- ^+ b
930+ ?: |(?=(~ b) =(0 a)) ~
931+ [i.b $(b t.b, a (dec a))]
731932```
732933
733934#### Examples
734935
735936```
736− > (scag 2 `(list @)`[1 2 3 4 ~])
737− [i=1 t=~[2]]
738−
739− > (scag 10 `(list @)`[1 2 3 4 ~])
740− [i=1 t=~[2 3 4]]
937+> (scag 2 `(list @)`[1 2 3 4 ~])
938+[i=1 t=~[2]]
741939```
742940
941+```
942+> (scag 10 `(list @)`[1 2 3 4 ~])
943+[i=1 t=~[2 3 4]]
944+```
743945
744946---
745−### `++skid`
947+
948+## `++skid`
746949
747950Separate
748951
@@ -765,27 +968,26 @@ A cell of two lists.
765968#### Source
766969
767970```hoon
768− ++ skid :: separate
769− ~/ %skid
770− |* [a=(list) b=$-(* ?)]
771− |- ^+ [p=a q=a]
772− ?~ a [~ ~]
773− =+ c=$(a t.a)
774− ?:((b i.a) [[i.a p.c] q.c] [p.c [i.a q.c]])
971+++ skid
972+ ~/ %skid
973+ |* [a=(list) b=$-(* ?)]
974+ |- ^+ [p=a q=a]
975+ ?~ a [~ ~]
976+ =+ c=$(a t.a)
977+ ?:((b i.a) [[i.a p.c] q.c] [p.c [i.a q.c]])
775978```
776979
777−
778980#### Examples
779981
780982```
781− > =a |=(a=@ (gth a 1))
782− > (skid `(list @)`[0 1 2 3 ~] a)
783− [p=[i=2 t=~[3]] q=[i=0 t=~[1]]]
983+> =a |=(a=@ (gth a 1))
984+> (skid `(list @)`[0 1 2 3 ~] a)
985+[p=[i=2 t=~[3]] q=[i=0 t=~[1]]]
784986```
785987
786−
787988---
788−### `++skim`
989+
990+## `++skim`
789991
790992Suffix
791993
@@ -806,25 +1008,26 @@ A list.
8061008#### Source
8071009
8081010```hoon
809− ++ skim :: only
810− ~/ %skim
811− |* [a=(list) b=$-(* ?)]
812− |-
813− ^+ a
814− ?~ a ~
815− ?:((b i.a) [i.a $(a t.a)] $(a t.a))
1011+++ skim
1012+ ~/ %skim
1013+ |* [a=(list) b=$-(* ?)]
1014+ |-
1015+ ^+ a
1016+ ?~ a ~
1017+ ?:((b i.a) [i.a $(a t.a)] $(a t.a))
8161018```
8171019
8181020#### Examples
8191021
8201022```
821− > =a |=(a=@ (gth a 1))
822− > (skim `(list @)`[0 1 2 3 ~] a)
823− [i=2 t=~[3]]
1023+> =a |=(a=@ (gth a 1))
1024+> (skim `(list @)`[0 1 2 3 ~] a)
1025+[i=2 t=~[3]]
8241026```
8251027
8261028---
827−### `++skip`
1029+
1030+## `++skip`
8281031
8291032Except
8301033
@@ -845,26 +1048,26 @@ A list of the same type as `a`.
8451048#### Source
8461049
8471050```hoon
848− ++ skip :: except
849− ~/ %skip
850− |* [a=(list) b=$-(* ?)]
851− |-
852− ^+ a
853− ?~ a ~
854− ?:((b i.a) $(a t.a) [i.a $(a t.a)])
1051+++ skip
1052+ ~/ %skip
1053+ |* [a=(list) b=$-(* ?)]
1054+ |-
1055+ ^+ a
1056+ ?~ a ~
1057+ ?:((b i.a) $(a t.a) [i.a $(a t.a)])
8551058```
8561059
8571060#### Examples
8581061
8591062```
860− > =a |=(a=@ (gth a 1))
861− > (skip `(l)`[0 1 2 3 ~]) a)
862− [i=0 t=[i=1 t=~]]
1063+> =a |=(a=@ (gth a 1))
1064+> (skip `(l)`[0 1 2 3 ~]) a)
1065+[i=0 t=[i=1 t=~]]
8631066```
8641067
865−
8661068---
867−### `++slag`
1069+
1070+## `++slag`
8681071
8691072Suffix
8701073
@@ -884,27 +1087,27 @@ A list of the same type as `b`.
8841087#### Source
8851088
8861089```hoon
887− ++ slag :: suffix
888− ~/ %slag
889− |* [a=@ b=(list)]
890− |- ^+ b
891− ?: =(0 a) b
892− ?~ b ~
893− $(b t.b, a (dec a))
1090+++ slag
1091+ ~/ %slag
1092+ |* [a=@ b=(list)]
1093+ |- ^+ b
1094+ ?: =(0 a) b
1095+ ?~ b ~
1096+ $(b t.b, a (dec a))
8941097```
8951098
8961099#### Examples
8971100
8981101```
899− > (slag 2 (limo [1 2 3 4 ~]))
900− [i=3 t=[i=4 t=~]]
901− > (slag 1 (limo [1 2 3 4 ~]))
902− [i=2 t=[i=3 t=[i=4 t=~]]]
1102+> (slag 2 (limo [1 2 3 4 ~]))
1103+[i=3 t=[i=4 t=~]]
1104+> (slag 1 (limo [1 2 3 4 ~]))
1105+[i=2 t=[i=3 t=[i=4 t=~]]]
9031106```
9041107
905−
9061108---
907−### `++snag`
1109+
1110+## `++snag`
9081111
9091112Index
9101113
@@ -924,134 +1127,144 @@ Produces an element of `b`, or crashes if no element exists at that index.
9241127#### Source
9251128
9261129```hoon
927− ++ snag :: index
928− ~/ %snag
929− |* [a=@ b=(list)]
930− |-
931− ?~ b
932− ~|('snag-fail' !!)
933− ?: =(0 a) i.b
934− $(b t.b, a (dec a))
1130+++ snag
1131+ ~/ %snag
1132+ |* [a=@ b=(list)]
1133+ |- ^+ ?>(?=(^ b) i.b)
1134+ ?~ b
1135+ ~_ leaf+"snag-fail"
1136+ !!
1137+ ?: =(0 a) i.b
1138+ $(b t.b, a (dec a))
9351139```
9361140
9371141#### Examples
9381142
9391143```
940− > (snag 2 "asdf")
941− ~~d
942− > (snag 0 `(list @ud)`~[1 2 3 4])
943− 1
1144+> (snag 2 "asdf")
1145+'d'
9441146```
9451147
1148+```
1149+> (snag 0 `(list @ud)`~[1 2 3 4])
1150+1
1151+```
9461152
9471153---
948−### `++snoc`
9491154
950−Append
1155+## `++snap`
9511156
952−Accepts a `++list` `a` and a noun `b`, producing the list of `b` appended to `a`.
1157+Replace item at index
1158+
1159+Accepts a `list` `a`, an atom `b`, and a noun `c`, producing the list of `a` with the item at index `b` replaced with `c`.
9531160
9541161#### Accepts
9551162
9561163`a` is a list.
9571164
958−`b` is a noun.
1165+`b` is a atom.
1166+
1167+`c` is a noun.
9591168
9601169#### Produces
9611170
962−Produces a list of `b` appended to `a`.
1171+the list of `a` with the item at index `b` replaced with `c`.
9631172
9641173#### Source
9651174
9661175```hoon
967− ++ snoc
968− |* [a/(list) b/*]
969− (weld a ^+(a [b]~))
1176+++ snap
1177+ ~/ %snap
1178+ |* [a=(list) b=@ c=*]
1179+ ^+ a
1180+ (weld (scag b a) [c (slag +(b) a)])
9701181```
9711182
9721183#### Examples
9731184
9741185```
975− > `tape`(zing (snoc `(list tape)`~["a" "bc" "def"] "g"))
976− "abcdefg"
977− > (snoc `(list @ud)`~[1 2 3] 4)
978− ~[1 2 3 4]
1186+> (snap (limo ~[2 3 4]) 1 11)
1187+~[2 11 4]
9791188```
9801189
9811190---
982−### `++snap`
9831191
984−Replace item at index
1192+## `++snip`
9851193
986−Accepts a `list` `a`, an atom `b`, and a noun `c`, producing the list of `a` with the item at index `b` replaced with `c`.
1194+Drop tail off list
9871195
988−#### Accepts
1196+Removes the last element from list `a`.
9891197
990−`a` is a list.
991−
992−`b` is a atom.
993−
994−`c` is a noun.
1198+#### Accepts
9951199
1200+`a` is a `list`.
9961201
9971202#### Produces
9981203
999−the list of `a` with the item at index `b` replaced with `c`.
1204+A `list`.
10001205
10011206#### Source
10021207
10031208```hoon
1004− ++ snap
1005− |* [a/(list) b/@ c/*]
1006− ^+ a
1007− (weld (scag b a) [c (slag +(b) a)])
1209+++ snip
1210+ ~/ %snip
1211+ |* a=(list)
1212+ ^+ a
1213+ ?~ a ~
1214+ ?: =(~ t.a) ~
1215+ [i.a $(a t.a)]
10081216```
10091217
10101218#### Examples
10111219
10121220```
1013− > (snap (limo ~[2 3 4]) 1 11)
1014− ~[2 11 4]
1221+> `tape`(snip "foobar")
1222+"fooba"
1223+```
1224+
1225+```
1226+> (snip ~)
1227+~
10151228```
10161229
10171230---
1018−### `++into`
10191231
1020−Insert item at index
1232+## `++snoc`
10211233
1022−Accepts a `list` `a`, an atom `b`, and a noun `c`, producing the list of `a` with the item `c` inserted at index `b`.
1234+Append
1235+
1236+Accepts a `++list` `a` and a noun `b`, producing the list of `b` appended to `a`.
10231237
10241238#### Accepts
10251239
10261240`a` is a list.
10271241
1028−`b` is a atom.
1029−
1030−`c` is a noun.
1031−
1242+`b` is a noun.
10321243
10331244#### Produces
10341245
1035−the list of `a` with the item `c` inserted at index `b`.
1246+Produces a list of `b` appended to `a`.
10361247
10371248#### Source
10381249
10391250```hoon
1040− ++ into
1041− |* [a/(list) b/@ c/*]
1042− ^+ a
1043− (weld (scag b a) [c (slag b a)])
1251+++ snoc
1252+ |* [a=(list) b=*]
1253+ (weld a ^+(a [b]~))
10441254```
10451255
10461256#### Examples
10471257
10481258```
1049− > (into (limo ~[2 3 4]) 1 11)
1050− ~[2 11 3 4]
1259+> `tape`(zing (snoc `(list tape)`~["a" "bc" "def"] "g"))
1260+"abcdefg"
1261+> (snoc `(list @ud)`~[1 2 3] 4)
1262+~[1 2 3 4]
10511263```
10521264
10531265---
1054−### `++sort`
1266+
1267+## `++sort`
10551268
10561269Quicksort
10571270
@@ -1072,28 +1285,29 @@ A list
10721285#### Source
10731286
10741287```hoon
1075− ++ sort !. :: quicksort
1076− ~/ %sort
1077− |* [a=(list) b=$-([* *] ?)]
1078− => .(a ^.(homo a))
1079− |- ^+ a
1080− ?~ a ~
1081− %+ weld
1082− $(a (skim t.a |=(c/_i.a (b c i.a))))
1083− ^+ t.a
1084− [i.a $(a (skim t.a |=(c/_i.a !(b c i.a))))]
1288+++ sort !.
1289+ ~/ %sort
1290+ |* [a=(list) b=$-([* *] ?)]
1291+ => .(a ^.(homo a))
1292+ |- ^+ a
1293+ ?~ a ~
1294+ =+ s=(skid t.a |:(c=i.a (b c i.a)))
1295+ %+ weld
1296+ $(a p.s)
1297+ ^+ t.a
1298+ [i.a $(a q.s)]
10851299```
10861300
10871301#### Examples
10881302
10891303```
1090− > (sort `(list @)`[0 1 2 3 ~] gth)
1091− ~[3 2 1 0]
1304+> (sort `(list @)`[0 1 2 3 ~] gth)
1305+~[3 2 1 0]
10921306```
10931307
1094−
10951308---
1096−### `++spin` {#spin}
1309+
1310+## `++spin` {#spin}
10971311
10981312Gate to list, with state
10991313
@@ -1118,35 +1332,39 @@ A pair of a list and a noun.
11181332#### Source
11191333
11201334```hoon
1121− ++ spin
1122− ~/ %spin
1123− |* [a=(list) b=* c=_|=(^ [** +<+])]
1124− => .(c `$-([_?>(?=(^ a) i.a) _b] [_-:(c) _b])`c)
1125− =/ acc=(list _-:(c)) ~
1126− |- ^- (pair _acc _b)
1127− ?~ a
1128− [(flop acc) b]
1129− =^ res b (c i.a b)
1130− $(acc [res acc], a t.a)
1335+++ spin
1336+ ~/ %spin
1337+ |* [a=(list) b=* c=_|=(^ [** +<+])]
1338+ => .(c `$-([_?>(?=(^ a) i.a) _b] [_-:(c) _b])`c)
1339+ =/ acc=(list _-:(c)) ~
1340+ |- ^- (pair _acc _b)
1341+ ?~ a
1342+ [(flop acc) b]
1343+ =^ res b (c i.a b)
1344+ $(acc [res acc], a t.a)
11311345```
11321346
11331347#### Examples
11341348
11351349```
1136− > %^ spin (limo ~[4 5 6]) :: Trivial example -- does nothing with the state
1137− 0
1138− |=([n=@ a=@] [n a])
1139− [p=~[4 5 6] q=0]
1350+> %^ spin (limo ~[4 5 6]) :: Trivial example -- does nothing with the state
1351+ 0
1352+ |=([n=@ a=@] [n a])
1353+[p=~[4 5 6] q=0]
1354+```
11401355
1141− > %^ spin (limo ~[4 5 6]) :: Form a pair with `p` as the index and `q` as the list element
1142− 0
1143− |=([n=@ a=@] [`(pair)`[a n] +(a)])
1144− [p=~[[p=0 q=4] [p=1 q=5] [p=2 q=6]] q=3]
1356+```
1357+> %^ spin (limo ~[4 5 6]) :: Form a pair with `p` as the index and `q` as the list element
1358+ 0
1359+ |=([n=@ a=@] [`(pair)`[a n] +(a)])
1360+[p=~[[p=0 q=4] [p=1 q=5] [p=2 q=6]] q=3]
1361+```
11451362
1146− > %^ spin (reap 10 0) :: Create 10 random numbers less than `10`
1147− ~(. og eny)
1148− |=([n=@ rng=_og] (rads:rng 10))
1149− [p=~[7 8 6 0 1 5 4 7 9 3] q=<4.rvi {a/@uvJ <51.qyl 129.pdd 41.mac 1.ane $141>}>]
1363+```
1364+> %^ spin (reap 10 0) :: Create 10 random numbers less than `10`
1365+ ~(. og eny)
1366+ |=([n=@ rng=_og] (rads:rng 10))
1367+[p=~[7 8 6 0 1 5 4 7 9 3] q=<4.rvi {a/@uvJ <51.qyl 129.pdd 41.mac 1.ane $141>}>]
11501368```
11511369
11521370#### Discussion
@@ -1155,10 +1373,9 @@ A pair of a list and a noun.
11551373with entropy (`eny`). The head of the product is the random number, the tail
11561374is the continuation of the RNG.
11571375
1158−
1159−
11601376---
1161−### `++spun` {#spun}
1377+
1378+## `++spun` {#spun}
11621379
11631380Gate to list, with state
11641381
@@ -1183,28 +1400,30 @@ A list.
11831400#### Source
11841401
11851402```hoon
1186− ++ spun
1187− ~/ %spun
1188− |* [a=(list) b=_|=(^ [** +<+])]
1189− p:(spin a +<+.b b)
1403+++ spun
1404+ ~/ %spun
1405+ |* [a=(list) b=_|=(^ [** +<+])]
1406+ p:(spin a +<+.b b)
11901407```
11911408
11921409#### Examples
11931410
11941411```
1195− > %+ spun (limo ~[4 5 6]) :: `p` as the index and `q` as the list element
1196− |=([n=@ a=@] [`(pair)`[a n] +(a)])
1197− ~[[p=0 q=4] [p=1 q=5] [p=2 q=6]]
1198−
1199− > =l (limo ~[7 8 9])
1200− > %+ spun (limo ~[4 5 6]) :: joins two lists into a list of pairs
1201− |=([n=@ a=@] [`(pair)`[(snag a l) n] +(a)])
1202− ~[[p=7 q=4] [p=8 q=5] [p=9 q=6]]
1412+> %+ spun (limo ~[4 5 6]) :: `p` as the index and `q` as the list element
1413+ |=([n=@ a=@] [`(pair)`[a n] +(a)])
1414+~[[p=0 q=4] [p=1 q=5] [p=2 q=6]]
12031415```
12041416
1417+```
1418+> =l (limo ~[7 8 9])
1419+> %+ spun (limo ~[4 5 6]) :: joins two lists into a list of pairs
1420+ |=([n=@ a=@] [`(pair)`[(snag a l) n] +(a)])
1421+~[[p=7 q=4] [p=8 q=5] [p=9 q=6]]
1422+```
12051423
12061424---
1207−### `++swag`
1425+
1426+## `++swag`
12081427
12091428Infix
12101429
@@ -1226,24 +1445,26 @@ A list of the same type as `c`.
12261445#### Source
12271446
12281447```hoon
1229− ++ swag
1230− |* [[a=@ b=@] c=(list)]
1231− (scag +<-> (slag +<-< c))
1448+++ swag
1449+ |* [[a=@ b=@] c=(list)]
1450+ (scag +<-> (slag +<-< c))
12321451```
12331452
12341453#### Examples
12351454
12361455```
1237− > (swag [2 5] "roly poly")
1238− "ly po"
1239−
1240− > (swag [2 2] (limo [1 2 3 4 ~]))
1241− [i=3 t=[i=4 t=~]]
1456+> (swag [2 5] "roly poly")
1457+"ly po"
12421458```
12431459
1460+```
1461+> (swag [2 2] (limo [1 2 3 4 ~]))
1462+[i=3 t=[i=4 t=~]]
1463+```
12441464
12451465---
1246−### `++turn`
1466+
1467+## `++turn`
12471468
12481469Gate to list
12491470
@@ -1263,23 +1484,27 @@ A list.
12631484#### Source
12641485
12651486```hoon
1266− ++ turn
1267− ~/ %turn
1268− |* [a=(list) b=gate]
1269− |-
1270− ?~ a ~
1271− [i=(b i.a) t=$(a t.a)]
1487+++ turn
1488+ ~/ %turn
1489+ |* [a=(list) b=gate]
1490+ => .(a (homo a))
1491+ ^- (list _?>(?=(^ a) (b i.a)))
1492+ |-
1493+ ?~ a ~
1494+ [i=(b i.a) t=$(a t.a)]
12721495```
12731496
12741497#### Examples
12751498
12761499```
1277− > (turn (limo [104 111 111 110 ~]) @t)
1278− <|h o o n|>
1500+> (turn (limo [104 111 111 110 ~]) @t)
1501+<|h o o n|>
1502+```
12791503
1280− > =a |=(a=@ (add a 4))
1281− > (turn (limo [1 2 3 4 ~]) a)
1282− ~[5 6 7 8]
1504+```
1505+> =a |=(a=@ (add a 4))
1506+> (turn (limo [1 2 3 4 ~]) a)
1507+~[5 6 7 8]
12831508```
12841509
12851510#### Discussion
@@ -1287,7 +1512,8 @@ A list.
12871512`turn` is Hoon's version of 'map' in Haskell.
12881513
12891514---
1290−### `++weld`
1515+
1516+## `++weld`
12911517
12921518Concatenate
12931519
@@ -1300,28 +1526,30 @@ Concatenate two `++list`s `a` and `b`.
13001526#### Source
13011527
13021528```hoon
1303− ++ weld
1304− ~/ %weld
1305− |* [a=(list) b=(list)]
1306− => .(a ^.(homo a), b ^.(homo b))
1307− |- ^+ b
1308− ?~ a b
1309− [i.a $(a t.a)]
1529+++ weld
1530+ ~/ %weld
1531+ |* [a=(list) b=(list)]
1532+ => .(a ^.(homo a), b ^.(homo b))
1533+ |- ^+ b
1534+ ?~ a b
1535+ [i.a $(a t.a)]
13101536```
13111537
13121538#### Examples
13131539
13141540```
1315− > (weld "urb" "it")
1316− "urbit"
1317−
1318− > (weld (limo [1 2 ~]) (limo [3 4 ~]))
1319− ~[1 2 3 4]
1541+> (weld "urb" "it")
1542+"urbit"
13201543```
13211544
1545+```
1546+> (weld (limo [1 2 ~]) (limo [3 4 ~]))
1547+~[1 2 3 4]
1548+```
13221549
13231550---
1324−### `++welp`
1551+
1552+## `++welp`
13251553
13261554Perfect weld
13271555
@@ -1341,7 +1569,7 @@ A list.
13411569#### Source
13421570
13431571```hoon
1344−++ welp :: faceless weld
1572+++ welp
13451573 ~/ %welp
13461574 =| [* *]
13471575 |@
@@ -1355,23 +1583,27 @@ A list.
13551583#### Examples
13561584
13571585```
1358− > (welp "foo" "bar")
1359− "foobar"
1360−
1361− > (welp ~[60 61 62] ~[%a %b %c])
1362− [60 61 62 %a %b %c ~]
1586+> (welp "foo" "bar")
1587+"foobar"
1588+```
13631589
1364− > ? (welp ~[60 61 62] ~[%a %b %c])
1365− {@ud @ud @ud $a $b $c $~}
1366− [60 61 62 %a %b %c ~]
1590+```
1591+> (welp ~[60 61 62] ~[%a %b %c])
1592+[60 61 62 %a %b %c ~]
13671593
1368− > (welp [sa+1 so+2 ~] si=3)
1369− [[%sa 1] [%so 2] si=3]
1594+> ? (welp ~[60 61 62] ~[%a %b %c])
1595+ {@ud @ud @ud $a $b $c $~}
1596+[60 61 62 %a %b %c ~]
13701597```
13711598
1599+```
1600+> (welp [sa+1 so+2 ~] si=3)
1601+[[%sa 1] [%so 2] si=3]
1602+```
13721603
13731604---
1374−### `++zing`
1605+
1606+## `++zing`
13751607
13761608Turns a `++list` of lists into a single list by promoting the elements of
13771609each sublist into the higher.
@@ -1387,7 +1619,7 @@ A list.
13871619#### Source
13881620
13891621```hoon
1390−++ zing :: promote
1622+++ zing
13911623 ~/ %zing
13921624 =| *
13931625 |@
@@ -1398,15 +1630,16 @@ A list.
13981630 --
13991631```
14001632
1401−
14021633#### Examples
14031634
14041635```
1405− > (zing (limo [(limo ['a' 'b' 'c' ~]) (limo ['e' 'f' 'g' ~]) (limo ['h' 'i' 'j' ~]) ~]))
1406− ~['a' 'b' 'c' 'e' 'f' 'g' 'h' 'i' 'j']
1636+> (zing (limo [(limo ['a' 'b' 'c' ~]) (limo ['e' 'f' 'g' ~]) (limo ['h' 'i' 'j' ~]) ~]))
1637+~['a' 'b' 'c' 'e' 'f' 'g' 'h' 'i' 'j']
1638+```
14071639
1408− > (zing (limo [(limo [1 'a' 2 'b' ~]) (limo [3 'c' 4 'd' ~]) ~]))
1409− ~[1 97 2 98 3 99 4 100]
1640+```
1641+> (zing (limo [(limo [1 'a' 2 'b' ~]) (limo [3 'c' 4 'd' ~]) ~]))
1642+~[1 97 2 98 3 99 4 100]
14101643```
14111644
14121645---
content/docs/hoon/reference/stdlib/2c.md+738−651

This diff is too big to show here.

content/docs/hoon/reference/stdlib/2d.md+55−54

This diff is too big to show here.

content/docs/hoon/reference/stdlib/2e.md+98−178

This diff is too big to show here.

content/docs/hoon/reference/stdlib/2f.md+163−285

This diff is too big to show here.

content/docs/hoon/reference/stdlib/2g.md+26−26

This diff is too big to show here.

content/docs/hoon/reference/stdlib/2h.md+345−345

This diff is too big to show here.

content/docs/hoon/reference/stdlib/2i.md+720−436

This diff is too big to show here.

content/docs/hoon/reference/stdlib/2j.md+267−156

This diff is too big to show here.

content/docs/hoon/reference/stdlib/2k.md+191−135

This diff is too big to show here.

content/docs/hoon/reference/stdlib/2l.md+5−3

This diff is too big to show here.

content/docs/hoon/reference/stdlib/2m.md+40−32

This diff is too big to show here.

content/docs/hoon/reference/stdlib/2n.md+161−138

This diff is too big to show here.

content/docs/hoon/reference/stdlib/2o.md+99−86

This diff is too big to show here.

content/docs/hoon/reference/stdlib/2p.md+125−119

This diff is too big to show here.

content/docs/hoon/reference/stdlib/2q.md+350−139

This diff is too big to show here.

content/docs/hoon/reference/stdlib/3a.md+25−5

This diff is too big to show here.

content/docs/hoon/reference/stdlib/3b.md+200−29

This diff is too big to show here.

content/docs/hoon/reference/stdlib/3c.md+26−10

This diff is too big to show here.

content/docs/hoon/reference/stdlib/3d.md+26−12

This diff is too big to show here.

content/docs/hoon/reference/stdlib/3f.md+20−4

This diff is too big to show here.

content/docs/hoon/reference/stdlib/3g.md+23−42

This diff is too big to show here.

content/docs/hoon/reference/stdlib/4a.md+5−1

This diff is too big to show here.

content/docs/hoon/reference/stdlib/4b.md+36−37

This diff is too big to show here.

content/docs/hoon/reference/stdlib/4c.md+12−16

This diff is too big to show here.

content/docs/hoon/reference/stdlib/4d.md+4−4

This diff is too big to show here.

content/docs/hoon/reference/stdlib/4e.md+20−33

This diff is too big to show here.

content/docs/hoon/reference/stdlib/4f.md+49−53

This diff is too big to show here.

content/docs/hoon/reference/stdlib/4g.md+8−8

This diff is too big to show here.

content/docs/hoon/reference/stdlib/4h.md+66−64

This diff is too big to show here.

content/docs/hoon/reference/stdlib/4i.md+70−72

This diff is too big to show here.

content/docs/hoon/reference/stdlib/4j.md+62−64

This diff is too big to show here.

content/docs/hoon/reference/stdlib/4k.md+5−5

This diff is too big to show here.

content/docs/hoon/reference/stdlib/4l.md+11−13

This diff is too big to show here.

content/docs/hoon/reference/stdlib/4m.md+20−18

This diff is too big to show here.

content/docs/hoon/reference/stdlib/4n.md+15−13

This diff is too big to show here.

content/docs/hoon/reference/stdlib/4o.md+31−127

This diff is too big to show here.

content/docs/hoon/reference/stdlib/5c.md+77−1

This diff is too big to show here.

content/docs/hoon/reference/stdlib/5f.md+18−23

This diff is too big to show here.

content/docs/hoon/reference/stdlib/table-of-contents.md+95−63

This diff is too big to show here.

content/docs/hoon/reference/style.md+108−108

This diff is too big to show here.

content/docs/hoon/reference/zuse/2d_1-5.mdnew file+587

This diff is too big to show here.

content/docs/hoon/reference/zuse/2d_6.mdnew file+1551

This diff is too big to show here.

content/docs/hoon/reference/zuse/2d_7.mdnew file+1307

This diff is too big to show here.

content/docs/hoon/reference/zuse/2e_2-3.mdnew file+67

This diff is too big to show here.

content/docs/hoon/reference/zuse/_index.mdnew file+31

This diff is too big to show here.

content/docs/hoon/reference/zuse/table-of-contents.mdnew file+247

This diff is too big to show here.

content/docs/userspace/_index.md+3

This diff is too big to show here.

content/docs/userspace/dist/_index.mdnew file+29

This diff is too big to show here.

content/docs/userspace/dist/dist.mdnew file+105

This diff is too big to show here.

content/docs/userspace/dist/docket.mdnew file+296

This diff is too big to show here.

content/docs/userspace/dist/glob.mdnew file+102

This diff is too big to show here.

content/docs/userspace/dist/guide.mdnew file+286

This diff is too big to show here.

content/docs/userspace/dist/tools.mdnew file+342

This diff is too big to show here.

content/docs/userspace/graph-store/overview.md+15−21

This diff is too big to show here.

content/docs/userspace/graph-store/sample-application-overview.mdnew file+369

This diff is too big to show here.

content/docs/userspace/graph-store/validator-walkthrough.md+38−49

This diff is too big to show here.

content/docs/userspace/overview.md+5

This diff is too big to show here.

content/docs/userspace/threads/basics/bind.md+10−10

This diff is too big to show here.

content/docs/userspace/threads/basics/input.md+23−23

This diff is too big to show here.

content/docs/userspace/threads/basics/output.md+18−18

This diff is too big to show here.

content/docs/userspace/threads/basics/summary.md+16−10

This diff is too big to show here.

content/docs/userspace/threads/examples/child-thread.md+33−33

This diff is too big to show here.

content/docs/userspace/threads/examples/get-json.md+5−4

This diff is too big to show here.

content/docs/userspace/threads/examples/main-loop.md+8−8

This diff is too big to show here.

content/docs/userspace/threads/examples/poke-agent.md+2−2

This diff is too big to show here.

content/docs/userspace/threads/examples/scry.md+10−10

This diff is too big to show here.

content/docs/userspace/threads/examples/take-fact.md+2−2

This diff is too big to show here.

content/docs/userspace/threads/gall/poke-thread.md+8−9

This diff is too big to show here.

content/docs/userspace/threads/gall/start-thread.md+9−9

This diff is too big to show here.

content/docs/userspace/threads/gall/stop-thread.md+8−8

This diff is too big to show here.

content/docs/userspace/threads/gall/take-facts.md+8−8

This diff is too big to show here.

content/docs/userspace/threads/gall/take-result.md+9−9

This diff is too big to show here.

content/docs/userspace/threads/http-api.md+1−1

This diff is too big to show here.

content/docs/userspace/threads/reference.md+5−13

This diff is too big to show here.

content/events/2017-08-11-after-hours-bootstrapping-urbit-from-the-ethereum-blockchain.md+10−8

This diff is too big to show here.

content/events/2017-09-22-after-hours-fun-with-arvo-the-urbit-os.md+9−8

This diff is too big to show here.

content/events/2017-10-26-after-hours-designing-robust-human-systems.md+11−10

This diff is too big to show here.

content/events/2017-11-16-after-hours-visiting-contributors.md+8−8

This diff is too big to show here.

content/events/2018-01-26-urbit-irl-20181.md+9−8

This diff is too big to show here.

content/events/2018-02-23-urbit-irl-20182.md+9−8

This diff is too big to show here.

content/events/2018-03-11-20183-hoon-school.md+9−8

This diff is too big to show here.

content/events/2018-03-23-urbit-irl-20183.md+9−8

This diff is too big to show here.

content/events/2018-04-08-20184-hoon-school.md+9−8

This diff is too big to show here.

content/events/2018-05-25-urbit-irl-20185.md+9−8

This diff is too big to show here.

content/events/2018-08-03-after-hours-decentralized-web-summit.md+8−7

This diff is too big to show here.

content/events/2018-08-17-urbit-irl-20188.md+9−8

This diff is too big to show here.

content/events/2018-09-21-urbit-irl-20189.md+9−8

This diff is too big to show here.

content/events/2018-10-10-urbit-zcash-blockchain-week.md+9−8

This diff is too big to show here.

content/events/2018-12-20-after-hours-its-just-a-party-man.md+9−8

This diff is too big to show here.

content/events/2019-03-01-after-hours-ask-galen-anything.md+9−8

This diff is too big to show here.

content/events/2019-03-08-urbit-irl-austin-tx.md+9−8

This diff is too big to show here.

content/events/2019-04-19-urbit-irl-20194.md+9−8

This diff is too big to show here.

content/events/2019-05-17-urbit-irl-20195.md+9−8

This diff is too big to show here.

content/events/2019-06-21-urbit-irl-20196.md+9−8

This diff is too big to show here.

content/events/2019-07-19-urbit-irl-20197.md+8−9

This diff is too big to show here.

content/events/2019-08-29-urbit-austin-20198.md+8−9

This diff is too big to show here.

content/events/2019-10-04-urbit-irl-201910.md+8−9

This diff is too big to show here.

content/events/2019-11-15-urbit-irl-201911.md+8−9

This diff is too big to show here.

content/events/2019-12-13-urbit-irl-201912.md+8−9

This diff is too big to show here.

content/events/2020-01-24-urbit-irl-20201.md+9−8

This diff is too big to show here.

content/events/2020-02-28-urbit-irl-20202.md+8−9

This diff is too big to show here.

content/events/2020-04-03-urbit-os1-launch-party.md+8−9

This diff is too big to show here.

content/events/2020-10-09-urbit-hosting-launch-event.md+8−8

This diff is too big to show here.

content/events/2020-11-05-developer-call-graph-store.md+12−6

This diff is too big to show here.

content/events/2020-11-19-developer-call-bittorrent-tracking-on-urbit.md+12−8

This diff is too big to show here.

content/events/2020-12-10-developer-call-injecting-external-services-into-urbit.md+13−6

This diff is too big to show here.

content/events/2021-02-04-developer-call-architectural-idea-maze.md+13−7

This diff is too big to show here.

content/events/2021-03-04-developer-call-scaling-azimuth.md+9−6

This diff is too big to show here.

content/events/2021-03-18-developer-call-pressure-and-protolith.md+11−6

This diff is too big to show here.

content/events/2021-04-01-developer-call-javascript-apps-on-urbit.md+12−7

This diff is too big to show here.

content/events/2021-04-15-developer-call-software-distribution.md+16−7

This diff is too big to show here.

content/events/2021-04-27-bitcoin-launch.md+9−7

This diff is too big to show here.

content/events/2021-04-29-developer-call-real-time-communications-on-urbit.md+11−6

This diff is too big to show here.

content/events/2021-05-13-developer-call-versioned-networking.md+11−6

This diff is too big to show here.

content/events/2021-05-27-town-hall.md+16−7

This diff is too big to show here.

content/events/2021-07-01-developer-call-runtime-future.md+14−11

This diff is too big to show here.

content/events/2021-07-15-developer-call-yakshaving.md+14−11

This diff is too big to show here.

content/events/2021-09-02-21q3-dc-meetup.md+12−10

This diff is too big to show here.

content/events/2021-09-16-developer-call-azimuth-scaled.mdnew file+46

This diff is too big to show here.

content/events/2021-09-24-urbit-outside.mdnew file+23

This diff is too big to show here.

content/events/2021-10-15-assembly.mdnew file+26

This diff is too big to show here.

content/events/20211007-developer-call-visor.mdnew file+38

This diff is too big to show here.

content/faq.md+49−47

This diff is too big to show here.

content/getting-started/_index.md+9

This diff is too big to show here.

content/getting-started/planet.md+5−3

This diff is too big to show here.

content/gifts/sample.md+1−1

This diff is too big to show here.

content/grants/a-book-about-urbit.md+5−3

This diff is too big to show here.

content/grants/a-collaborative-web-mapping-system-for-urbit.md → content/grants/a-network-enabled-spatial-database-and-demonstration-app.mdrenamed+31−24

This diff is too big to show here.

content/grants/analytics-script.md+7−4

This diff is too big to show here.

content/grants/antechamber.md+5−3

This diff is too big to show here.

content/grants/art-by-urbit.md+6−3

This diff is too big to show here.

content/grants/authenticate-with-urbit.mdnew file+36

This diff is too big to show here.

content/grants/azimuth-cli.mdnew file+164

This diff is too big to show here.

content/grants/bart-train-tracker-landscape-tile.md+5−3

This diff is too big to show here.

content/grants/bitcoin-full-node-provider-and-wallet.md+5−3

This diff is too big to show here.

content/grants/bitcoin-key-derivation.md+5−3

This diff is too big to show here.

content/grants/bitcoin-node-json-rpc-api-part-1.md+5−3

This diff is too big to show here.

content/grants/bitcoin-node-json-rpc-api-part-2.md+5−3

This diff is too big to show here.

content/grants/bitcoin-node-json-rpc-api-part-3.md+5−3

This diff is too big to show here.

content/grants/bitcoin-node-json-rpc-api-part-4.md+5−3

This diff is too big to show here.

content/grants/bitcoin-wallet-maintenance.md+5−3

This diff is too big to show here.

content/grants/bitcoin-wallet-on-bridge.md+5−3

This diff is too big to show here.

content/grants/boston-t-train-tracker-landscape-tile.md+5−3

This diff is too big to show here.

content/grants/bridge-l2-revamp.md+6−3

This diff is too big to show here.

content/grants/calendar-ui.md+6−3

This diff is too big to show here.

content/grants/calendar.md+5−3

This diff is too big to show here.

content/grants/comprehensive-local-server-and-mum-explanation-video.md+7−4

This diff is too big to show here.

content/grants/contacts.md+6−3

This diff is too big to show here.

content/grants/content-producer.md+6−3

This diff is too big to show here.

content/grants/content-saver.md+5−3

This diff is too big to show here.

content/grants/cross-platform-desktop-urbit-app.md+7−4

This diff is too big to show here.

content/grants/cta-train-tracker-landscape-tile.md+5−3

This diff is too big to show here.

content/grants/cypherscope-bot.mdnew file+80

This diff is too big to show here.

content/grants/display-eth-data.md+5−3

This diff is too big to show here.

content/grants/docker-image-for-cloud-container-orchestration.md+5−3

This diff is too big to show here.

content/grants/educational-guide-todomvc-urbit-edition.md+6−3

This diff is too big to show here.

content/grants/escape.md+5−3

This diff is too big to show here.

content/grants/ethereum-abi-parser.md+6−3

This diff is too big to show here.

content/grants/feed-aggregator.md+6−3

This diff is too big to show here.

content/grants/gall-api-documentation.md+5−3

This diff is too big to show here.

content/grants/go-airlock-library.md+5−3

This diff is too big to show here.

content/grants/graph-store-documentation-guide.md+6−3

This diff is too big to show here.

content/grants/guide-to-s3.md+6−3

This diff is too big to show here.

content/grants/haskell-airlock-library.md+5−3

This diff is too big to show here.

content/grants/hoon-001-learner-efficiency-and-early-learner-resources.md+5−3

This diff is too big to show here.

content/grants/host-three-college-university-urbit-meetups-1.md+5−3

This diff is too big to show here.

content/grants/host-three-college-university-urbit-meetups-2.md+5−3

This diff is too big to show here.

content/grants/host-three-college-university-urbit-meetups-3.md+5−3

This diff is too big to show here.

content/grants/host-three-virtual-urbit-meetups.md+5−3

This diff is too big to show here.

content/grants/host-two-urbit-meetups-1.md+5−3

This diff is too big to show here.

content/grants/host-two-urbit-meetups-10.md+5−3

This diff is too big to show here.

content/grants/host-two-urbit-meetups-11.md+5−3

This diff is too big to show here.

content/grants/host-two-urbit-meetups-12.md+7−4

This diff is too big to show here.

content/grants/host-two-urbit-meetups-13.mdnew file+59

This diff is too big to show here.

content/grants/host-two-urbit-meetups-14.mdnew file+59

This diff is too big to show here.

content/grants/host-two-urbit-meetups-15.mdnew file+59

This diff is too big to show here.

content/grants/host-two-urbit-meetups-2.md+5−3

This diff is too big to show here.

content/grants/host-two-urbit-meetups-3.md+5−3

This diff is too big to show here.

content/grants/host-two-urbit-meetups-4.md+5−3

This diff is too big to show here.

content/grants/host-two-urbit-meetups-5.md+5−3

This diff is too big to show here.

content/grants/host-two-urbit-meetups-6.md+5−3

This diff is too big to show here.

content/grants/host-two-urbit-meetups-7.md+5−3

This diff is too big to show here.

content/grants/host-two-urbit-meetups-8.md+5−3

This diff is too big to show here.

content/grants/host-two-urbit-meetups-9.md+5−3

This diff is too big to show here.

content/grants/json-jet.md+7−4

This diff is too big to show here.

content/grants/links-in-urbit-reference-docs.md+7−4

This diff is too big to show here.

content/grants/llelogram.md+5−3

This diff is too big to show here.

content/grants/login-with-urbit.md+7−4

This diff is too big to show here.

content/grants/machine-learning.mdnew file+122

This diff is too big to show here.

content/grants/market-interface.mdnew file+61

This diff is too big to show here.

content/grants/matrices-in-hoon.md+6−4

This diff is too big to show here.

content/grants/matrixriotim-bridge-bot.md+5−3

This diff is too big to show here.

content/grants/minimal-urbit-os.md+6−3

This diff is too big to show here.

content/grants/network-explorer-data-pipeline-http-api.md+7−4

This diff is too big to show here.

content/grants/network-explorer.mddeleted−231

This diff is too big to show here.

content/grants/nuck-jet.md+6−3

This diff is too big to show here.

content/grants/open-street-maps-data-importation.md+5−3

This diff is too big to show here.

content/grants/overhaul-the-urbitorg-website.md+8−5

This diff is too big to show here.

content/grants/planet-sales.mdnew file+66

This diff is too big to show here.

content/grants/pokur.mdnew file+90

This diff is too big to show here.

content/grants/ra-debugging-tools.mdnew file+25

This diff is too big to show here.

content/grants/ra-page-tracking.md+5−3

This diff is too big to show here.

content/grants/ra-segfaults.md+5−3

This diff is too big to show here.

content/grants/ra-stack-overflow.md+5−3

This diff is too big to show here.

content/grants/ragnarok-online-on-urbit.md+5−3

This diff is too big to show here.

content/grants/search-in-groups.md+6−4

This diff is too big to show here.

content/grants/slaw-scot-jets.md+6−4

This diff is too big to show here.

content/grants/-smol-future-sustained-knowledge-sharing-and-marketing.md → content/grants/smol-future-sustained-knowledge-sharing-and-marketing.mdrenamed+5−3

This diff is too big to show here.

content/grants/speech-recognition.mdnew file+78

This diff is too big to show here.

content/grants/staff-the-urbit-help-desk-1.md+5−3

This diff is too big to show here.

content/grants/staff-the-urbit-help-desk-2.md+5−3

This diff is too big to show here.

content/grants/staff-the-urbit-helpdesk-east.md+5−3

This diff is too big to show here.

content/grants/staff-the-urbit-helpdesk-west.md+5−3

This diff is too big to show here.

content/grants/static-site-generation.mdnew file+80

This diff is too big to show here.

content/grants/the-complete-guide-to-gall-and-landscape.md+5−3

This diff is too big to show here.

content/grants/thread-documentation.md+5−3

This diff is too big to show here.

content/grants/tor-nodes-relay-search-tile.md+5−3

This diff is too big to show here.

content/grants/translate-key-parts-of-urbitorg-into-german.md+6−3

This diff is too big to show here.

content/grants/translate-key-parts-of-urbitorg-into-korean.md+6−3

This diff is too big to show here.

content/grants/translate-key-parts-of-urbitorg-into-norwegian.md+5−3

This diff is too big to show here.

content/grants/translate-key-parts-of-urbitorg-into-spanish.md+6−3

This diff is too big to show here.

content/grants/try-urbit-website.md+7−4

This diff is too big to show here.

content/grants/typescript-airlock-library.md+5−3

This diff is too big to show here.

content/grants/ua-collaborative-text-editor.md+6−4

This diff is too big to show here.

content/grants/ua-filesharer.md+5−3

This diff is too big to show here.

content/grants/ua-heads-up-poker.md+5−3

This diff is too big to show here.

content/grants/ua-invoice-system.md+5−3

This diff is too big to show here.

content/grants/ua-marketplace.md+5−3

This diff is too big to show here.

content/grants/ucal-google-and-outlook-integration.md+6−3

This diff is too big to show here.

content/grants/udon-syntax-highlighter.md+5−3

This diff is too big to show here.

content/grants/unit-tests-for-json-parsing.md+5−3

This diff is too big to show here.

content/grants/unit-tests-for-pure-algorithms.md+5−3

This diff is too big to show here.

content/grants/unit-tests-for-sha-functions.md+5−3

This diff is too big to show here.

content/grants/unit-tests-for-zuse-cryptographic-functions.md+5−3

This diff is too big to show here.

content/grants/up-to-date-hoon-reference-card.md+5−3

This diff is too big to show here.

content/grants/urbian-a-customized-linux-distribution-for-urbit-appliances.md+6−3

This diff is too big to show here.

content/grants/urbit-api-for-elixir.md+5−3

This diff is too big to show here.

content/grants/urbit-community-concierge-east-coast-2q2021.md+7−4

This diff is too big to show here.

content/grants/urbit-community-concierge-east-coast.md+7−4

This diff is too big to show here.

content/grants/urbit-community-concierge-west-coast-2q2021.md+7−4

This diff is too big to show here.

content/grants/urbit-community-concierge-west-coast.md+7−4

This diff is too big to show here.

content/grants/urbit-event-series.md+7−4

This diff is too big to show here.

content/grants/urbit-explainer-video.md+6−3

This diff is too big to show here.

content/grants/urbit-http-api-for-emacs-elisp.md+6−3

This diff is too big to show here.

content/grants/urbit-http-api-for-kotlin.md+6−3

This diff is too big to show here.

content/grants/urbit-http-api-for-python.md+6−3

This diff is too big to show here.

content/grants/urbit-http-api-for-rust.md+6−3

This diff is too big to show here.

content/grants/urbit-http-interface-java-edition.md+6−3

This diff is too big to show here.

content/grants/urbit-http-library-for-ruby.md+6−3

This diff is too big to show here.

content/grants/urbit-irc-bridge.md+6−3

This diff is too big to show here.

content/grants/urbit-lfs-filehosting.md+6−3

This diff is too big to show here.

content/grants/urbit-notes.mdnew file+102

This diff is too big to show here.

content/grants/urbit-online-meetup.md+5−3

This diff is too big to show here.

content/grants/urbit-react-cookbook.md+6−3

This diff is too big to show here.

content/grants/urbit-ship-and-star-hosting-and-troubleshooting-docs.md+5−3

This diff is too big to show here.

content/grants/verifying-urbit-id-on-keybase.md+5−3

This diff is too big to show here.

content/grants/video-content-manager.md+6−3

This diff is too big to show here.

content/grants/volt-lightning-on-urbit.md+6−3

This diff is too big to show here.

content/grants/web-scraper.md+5−3

This diff is too big to show here.

content/grants/webrtc-gall-agent-and-external-app.md+18−18

This diff is too big to show here.

content/grants/webrtc.mddeleted−78

This diff is too big to show here.

content/grants/~home-urbit.mdnew file+120

This diff is too big to show here.

content/media/blockchannel-episode-19-virtual-land-in-the-clouds-with-urbit.md+3−1

This diff is too big to show here.

content/media/blueprint-2017-galen-wolfe-pauly-on-the-distributed-web.md+5−2

This diff is too big to show here.

content/media/epicenter-episode-205-urbit-a-digital-republic-reinventing-the-internet.md+5−2

This diff is too big to show here.

content/media/governing-the-future-e09-urbit-a-user-owned-internet-on-top-of-the-internet.md+6−2

This diff is too big to show here.

content/media/lambdaconf-2016-curtis-yarvin-urbit-a-clean-slate-functional-operating-stack.md+5−2

This diff is too big to show here.

content/media/lambdaconf-2018-ted-blackman-ford-urbits-build-system.md+5−2

This diff is too big to show here.

content/media/on-the-brink-castle-island.md+3−3

This diff is too big to show here.

content/media/the-ether-review-46-curtis-yarvin-and-galen-wolfe-pauly-on-urbit.md+5−2

This diff is too big to show here.

content/media/urbit-and-the-not-so-dark-future-of-the-internet.md+3−2

This diff is too big to show here.

content/media/what-is-urbit.md+2−1

This diff is too big to show here.

content/updates/2016-10-6-update.md+73−72

This diff is too big to show here.

content/updates/2016-5-16-roadmap.md+62−61

This diff is too big to show here.

content/updates/2016-7-20-update.md+34−33

This diff is too big to show here.

content/updates/2016-8-30-update.md+48−47

This diff is too big to show here.

content/updates/2017-1-30-update.md+124−123

This diff is too big to show here.

content/updates/2017-10-7-update.md+3−2

This diff is too big to show here.

content/updates/2017-11-14-update.md+33−34

This diff is too big to show here.

content/updates/2017-12-16-update.md+11−9

This diff is too big to show here.

content/updates/2017-12-2-update.md+17−16

This diff is too big to show here.

content/updates/2017-12-22-update.md+13−12

This diff is too big to show here.

content/updates/2017-3-1-update.md+41−40

This diff is too big to show here.

content/updates/2017-4-17-update.md+37−36

This diff is too big to show here.

content/updates/2017-5-11-roadmap.md+71−70

This diff is too big to show here.

content/updates/2017-8-11-update.md+30−31

This diff is too big to show here.

content/updates/2017-9-23-update.md+3−2

This diff is too big to show here.

content/updates/2017-9-29-update.md+3−2

This diff is too big to show here.

content/updates/2018-1-13-update.md+3−2

This diff is too big to show here.

content/updates/2018-1-6-update.md+11−10

This diff is too big to show here.

content/updates/2018-10-12-update.md+13−12

This diff is too big to show here.

content/updates/2018-10-24-update.md+8−7

This diff is too big to show here.

content/updates/2018-11-20-update.md+12−11

This diff is too big to show here.

content/updates/2018-11-6-update.md+8−7

This diff is too big to show here.

content/updates/2018-12-18-update.md+9−8

This diff is too big to show here.

content/updates/2018-2-17-update.md+6−4

This diff is too big to show here.

content/updates/2018-2-24-update.md+10−9

This diff is too big to show here.

content/updates/2018-2-5-update.md+10−10

This diff is too big to show here.

content/updates/2018-2-9-update.md+9−8

This diff is too big to show here.

content/updates/2018-3-24-update.md+12−11

This diff is too big to show here.

content/updates/2018-3-5-update.md+8−7

This diff is too big to show here.

content/updates/2018-4-14-update.md+16−15

This diff is too big to show here.

content/updates/2018-4-7-update.md+9−8

This diff is too big to show here.

content/updates/2018-5-16-update.md+13−13

This diff is too big to show here.

content/updates/2018-5-23-update.md+11−11

This diff is too big to show here.

content/updates/2018-5-29-update.md+3−2

This diff is too big to show here.

content/updates/2018-5-30-update.md+11−10

This diff is too big to show here.

content/updates/2018-6-14-update.md+13−12

This diff is too big to show here.

content/updates/2018-6-21-update.md+12−12

This diff is too big to show here.

content/updates/2018-6-6-update.md+13−12

This diff is too big to show here.

content/updates/2018-7-13-update.md+12−11

This diff is too big to show here.

content/updates/2018-7-20-update.md+20−20

This diff is too big to show here.

content/updates/2018-7-3-update.md+13−13

This diff is too big to show here.

content/updates/2018-7-30-update.md+18−18

This diff is too big to show here.

content/updates/2018-8-23-update.md+16−15

This diff is too big to show here.

content/updates/2018-8-30-update.md+11−10

This diff is too big to show here.

content/updates/2018-8-8-update.md+18−17

This diff is too big to show here.

content/updates/2018-9-11-update.md+17−16

This diff is too big to show here.

content/updates/2019-11-06-update.md+6−2

This diff is too big to show here.

content/updates/2019-12-06-update.md+2−1

This diff is too big to show here.

content/updates/2019-2-11-update.md+8−6

This diff is too big to show here.

content/updates/2019-2-25-update.md+7−5

This diff is too big to show here.

content/updates/2019-2-26-network-update.md+4−2

This diff is too big to show here.

content/updates/2019-2-4-update.md+9−7

This diff is too big to show here.

content/updates/2019-3-11-update.md+8−6

This diff is too big to show here.

content/updates/2019-3-27-update.md+6−4

This diff is too big to show here.

content/updates/2019-3-4-update.md+7−5

This diff is too big to show here.

content/updates/2019-4-11-update.md+7−5

This diff is too big to show here.

content/updates/2019-5-10-update.md+4−3

This diff is too big to show here.

content/updates/2019-5-17-update.md+4−3

This diff is too big to show here.

content/updates/2019-5-31-update.md+7−6

This diff is too big to show here.

content/updates/2019-6-14-update.md+10−7

This diff is too big to show here.

content/updates/2019-7-25-update.md+9−5

This diff is too big to show here.

content/updates/2020-02-06-update.md+5−3

This diff is too big to show here.

content/updates/2020-04-04-update.md+2−1

This diff is too big to show here.

content/updates/2020-06-15-update.md+2−1

This diff is too big to show here.

content/updates/2020-07-27-update.md+2−1

This diff is too big to show here.

content/updates/2020-09-30-update.md+2−1

This diff is too big to show here.

content/updates/2020-10-29-update.md+2−1

This diff is too big to show here.

content/updates/2020-12-01-update.md+2−1

This diff is too big to show here.

content/updates/2021-01-15-update.md+2−1

This diff is too big to show here.

content/updates/2021-02-19-update.md+2−1

This diff is too big to show here.

content/updates/2021-04-01-update.md+2−1

This diff is too big to show here.

content/updates/2021-05-05-update.md+2−1

This diff is too big to show here.

content/updates/2021-06-16-update.md+5−3

This diff is too big to show here.

content/using/_index.md+3−3

This diff is too big to show here.

content/using/id/guide-to-breaches.md+1−3

This diff is too big to show here.

content/using/os/_index.md+1−1

This diff is too big to show here.

content/using/os/getting-started.md → content/using/os/basics.mdrenamed+4−4

This diff is too big to show here.

content/using/os/dist-faq.mdnew file+162

This diff is too big to show here.

content/using/os/ship-troubleshooting.md+2−2

This diff is too big to show here.

lib/constants.js+55−1

This diff is too big to show here.

lib/glossary.js+1261−532

This diff is too big to show here.

lib/hooks.js+22

This diff is too big to show here.

lib/lib.js+57−23

This diff is too big to show here.

lib/rss.js+1−1

This diff is too big to show here.

next.config.js+1−8

This diff is too big to show here.

package-lock.json+874−3152

This diff is too big to show here.

package.json+3−5

This diff is too big to show here.

pages/bitcoin-wallet.jsnew file+21

This diff is too big to show here.

pages/blog.js+3−2

This diff is too big to show here.

pages/blog/[slug].js+12−21

This diff is too big to show here.

pages/events.js+65−71

This diff is too big to show here.

pages/events/[slug].js+103−74

This diff is too big to show here.

pages/grants.js+40−16

This diff is too big to show here.

pages/grants/[slug].js+2−1

This diff is too big to show here.

pages/index.js+77−34

This diff is too big to show here.

pages/media.js+57−2

This diff is too big to show here.

pages/media/[slug].js+8−4

This diff is too big to show here.

pages/updates.js+3−2

This diff is too big to show here.

pages/updates/[slug].js+3−1

This diff is too big to show here.

pages/using/[[...slug]].js+3−3

This diff is too big to show here.

scripts/date_to_string_upgrade.jsnew file+43

This diff is too big to show here.

scripts/event_date_upgrade.jsnew file+51

This diff is too big to show here.

styles/globals.css+23−21

This diff is too big to show here.

styles/markdown.css+20−8

This diff is too big to show here.

vercel.json+5

This diff is too big to show here.

yarn.lockdeleted−1865

This diff is too big to show here.