on master help sign in
Merge branch 'main' of github.com:g-a-v-i-n/urbit.org2 into urbit.org2
commitb69b81d73eaa1017d0b9711508b64282c114c6ea authorMatilde Park <matilde@tlon.io> dateWed 16 Jun 2021, 16:11 (5 years ago) parent23e0270d79a54a
648 files changed+105896−10
.gitignore+32−10 .husky/.gitignore+1 .husky/pre-commit+4 README.md+38 components/BackgroundImage.js+6 components/Container.js+8 components/Footer.js+56 components/Header.js+47 components/Lorem.js+106 components/Markdown.js+38 components/NewletterSignup.js+38 components/PostPreview.js+26 components/SingleColumn.js+8 components/TabCarousel.js+9 content/Bitcoin-wallet.md+53 content/_index.md+3 content/blog/2019-10-3-roadmap.md+111 content/blog/2019-5-roadmap.md+102 content/blog/2020-to-2021.md+49 content/blog/20200929-state-of-urbit.md+79 content/blog/20201119-models-of-society.md+77 content/blog/a-founders-farewell.md+615 content/blog/aesthetic-culture-1.md+106 content/blog/after-machine-war.md+46 content/blog/an-email.md+88 content/blog/an-urbit-overview.md+211 content/blog/announcing-urbit-grants.md+45 content/blog/azimuth-as-multipass.md+31 content/blog/azimuth-is-on-chain.md+103 content/blog/azimuth-security-bounty-program.md+36 content/blog/beliefs-and-principles.md+130 content/blog/bootstrapping-urbit-from-ethereum.md+387 content/blog/common-objections-to-urbit.md+720 content/blog/community-spotlight-the-portico.md+137 content/blog/creating-sigils.md+170 content/blog/eliza.md+49 content/blog/events-series.md+56 content/blog/first-steps-towards-urbit-org.md+59 content/blog/ford-fusion.md+226 content/blog/gifts-q3-2020.md+68 content/blog/governance-of-urbit.md+38 content/blog/hackathon-results.md+67 content/blog/hosting-the-future.md+33 content/blog/infrastructural.md+78 content/blog/interim-constitution.md+144 content/blog/interplanetary_commerce.md+39 content/blog/introducing-os1.md+141 content/blog/io-in-hoon.md+322 content/blog/iot.md+448 content/blog/landscape-a-portrait.md+85 content/blog/magic.md+204 content/blog/metaphase.md+74 content/blog/pki-maze.md+74 content/blog/platform-decay.md+51 content/blog/precepts-discussion.md+768 content/blog/precepts.md+355 content/blog/providers.md+89 content/blog/rollups.md+220 content/blog/security-and-continuity.md+62 content/blog/security-audit.md+157 content/blog/simple-durable-yours.md+50 content/blog/stable-arvo.md+95 content/blog/the-100-year-computer.md+26 content/blog/the-dao-as-a-lesson-in-decentralized-governance.md+321 content/blog/the-missing-middle.md+53 content/blog/the-state-of-landscape.md+75 content/blog/the-understanding-urbit-podcast.md+23 content/blog/the-urbit-address-space.md+294 content/blog/tools-of-our-own.md+73 content/blog/toward-a-frozen-operating-system.md+254 content/blog/toward-a-new-clay.md+1006 content/blog/urbit-and-bitcoin.md+21 content/blog/urbit-and-the-blockchain.md+267 content/blog/urbit-for-normies.md+177 content/blog/urbit-grants-and-mid-2019-gifts.md+44 content/blog/urbit-is-for-communities.md+97 content/blog/value-of-address-space-pt1.md+147 content/blog/value-of-address-space-pt2.md+155 content/blog/value-of-address-space-pt3.md+130 content/blog/what-is-urbit-for.md+191 content/blog/why-hoon.md+272 content/blog/why-urbit-probably-does-not-need-a-blockchain.md+617 content/blog/your-last-computer.md+36 content/bounties.md+9 content/community/_index.md+5 content/community/community-grants.md+14 content/community/governance.md+25 content/community/hoonschool.md+15 content/community/hosting-a-meetup.md+82 content/community/meetups.md+51 content/docs/.gitignore+4 content/docs/.gitmodules+3 content/docs/LICENSE+21 content/docs/README.markdown+3 content/docs/_index.md+56 content/docs/anchors.py+135 content/docs/arvo/_index.md+55 content/docs/arvo/ames/_index.md+7 content/docs/arvo/ames/ames-api.md+292 content/docs/arvo/ames/ames.md+423 content/docs/arvo/behn/_index.md+7 content/docs/arvo/behn/behn-api.md+246 content/docs/arvo/behn/behn.md+21 content/docs/arvo/clay/_index.md+36 content/docs/arvo/clay/architecture.md+254 content/docs/arvo/clay/clay.md+58 content/docs/arvo/clay/data-types.md+688 content/docs/arvo/clay/examples.md+824 content/docs/arvo/clay/scry.md+425 content/docs/arvo/clay/tasks.md+555 content/docs/arvo/clay/using.md+217 content/docs/arvo/concepts/_index.md+13 content/docs/arvo/concepts/subscriptions.md+162 content/docs/arvo/dill/_index.md+7 content/docs/arvo/dill/dill-api.md+366 content/docs/arvo/dill/dill.md+24 content/docs/arvo/eyre/_index.md+16 content/docs/arvo/eyre/eyre.md+721 content/docs/arvo/eyre/using-eyre.md+230 content/docs/arvo/ford/_index.md+7 content/docs/arvo/ford/ford.md+223 content/docs/arvo/gall/_index.md+7 content/docs/arvo/gall/overview.md+11 content/docs/arvo/iris/_index.md+7 content/docs/arvo/iris/iris-api.md+191 content/docs/arvo/jael/_index.md+7 content/docs/arvo/jael/jael-api.md+393 content/docs/arvo/overview.md+577 content/docs/arvo/tutorials/_index.md+9 content/docs/arvo/tutorials/move-trace.md+378 content/docs/azimuth/_index.md+22 content/docs/azimuth/advanced-azimuth-tools.md+68 content/docs/azimuth/azimuth.md+150 content/docs/azimuth/life-and-rift.md+58 content/docs/development/_index.md+33 content/docs/development/develop.md+115 content/docs/development/environment.md+62 content/docs/development/grants.md+84 content/docs/development/precepts.md+336 content/docs/development/project-repositories.md+49 content/docs/glossary/_index.md+10 content/docs/glossary/ames.md+19 content/docs/glossary/aqua.md+16 content/docs/glossary/arm.md+14 content/docs/glossary/arvo.md+40 content/docs/glossary/atom.md+20 content/docs/glossary/azimuth.md+18 content/docs/glossary/battery.md+14 content/docs/glossary/behn.md+14 content/docs/glossary/breach.md+28 content/docs/glossary/bridge.md+32 content/docs/glossary/censure.md+14 content/docs/glossary/ceremony.md+8 content/docs/glossary/chat.md+32 content/docs/glossary/claims.md+21 content/docs/glossary/clay.md+18 content/docs/glossary/comet.md+32 content/docs/glossary/core.md+14 content/docs/glossary/delegated-sending.md+9 content/docs/glossary/desk.md+15 content/docs/glossary/dill.md+22 content/docs/glossary/docvote.md+9 content/docs/glossary/dojo.md+14 content/docs/glossary/door.md+14 content/docs/glossary/ecliptic.md+12 content/docs/glossary/eventlog.md+23 content/docs/glossary/eyre.md+17 content/docs/glossary/ford.md+17 content/docs/glossary/galaxy.md+15 content/docs/glossary/gall.md+17 content/docs/glossary/gate.md+14 content/docs/glossary/hdwallet.md+17 content/docs/glossary/hoon.md+15 content/docs/glossary/invite-tree.md+9 content/docs/glossary/iris.md+11 content/docs/glossary/jael.md+8 content/docs/glossary/jaque.md+15 content/docs/glossary/keyfile.md+15 content/docs/glossary/landscape.md+11 content/docs/glossary/mark.md+17 content/docs/glossary/moon.md+34 content/docs/glossary/nock.md+17 content/docs/glossary/noun.md+15 content/docs/glossary/ota-updates.md+9 content/docs/glossary/payload.md+14 content/docs/glossary/ph.md+9 content/docs/glossary/pier.md+18 content/docs/glossary/pill.md+14 content/docs/glossary/planet.md+15 content/docs/glossary/proxies.md+29 content/docs/glossary/replay.md+13 content/docs/glossary/sailudon.md+13 content/docs/glossary/senate.md+14 content/docs/glossary/ship.md+26 content/docs/glossary/shiparvonetwork.md+9 content/docs/glossary/star.md+17 content/docs/glossary/sync.md+16 content/docs/glossary/trap.md+14 content/docs/glossary/upgrade.md+13 content/docs/glossary/vane.md+24 content/docs/glossary/vere.md+18 content/docs/glossary/voting.md+27 content/docs/glossary/wallet-generator.md+11 content/docs/hoon/_index.md+27 content/docs/hoon/guides/_index.md+13 content/docs/hoon/guides/aqua.md+80 content/docs/hoon/guides/cli-tutorial.md+417 content/docs/hoon/guides/parsing.md+650 content/docs/hoon/hoon-school/_index.md+42 content/docs/hoon/hoon-school/ackermann.md+29 content/docs/hoon/hoon-school/arms-and-cores.md+652 content/docs/hoon/hoon-school/atoms-auras-and-simple-cell-types.md+779 content/docs/hoon/hoon-school/bank-account.md+80 content/docs/hoon/hoon-school/behn.md+110 content/docs/hoon/hoon-school/caesar.md+394 content/docs/hoon/hoon-school/conditionals.md+105 content/docs/hoon/hoon-school/doors.md+516 content/docs/hoon/hoon-school/egg-timer.md+159 content/docs/hoon/hoon-school/fibonacci.md+61 content/docs/hoon/hoon-school/gall.md+129 content/docs/hoon/hoon-school/gates.md+272 content/docs/hoon/hoon-school/generators.md+461 content/docs/hoon/hoon-school/hoon-syntax.md+356 content/docs/hoon/hoon-school/iron-polymorphism.md+88 content/docs/hoon/hoon-school/lead-polymorphism.md+155 content/docs/hoon/hoon-school/libraries.md+191 content/docs/hoon/hoon-school/list-of-numbers.md+132 content/docs/hoon/hoon-school/lists.md+497 content/docs/hoon/hoon-school/molds.md+98 content/docs/hoon/hoon-school/nouns.md+563 content/docs/hoon/hoon-school/recursion.md+195 content/docs/hoon/hoon-school/setup.md+105 content/docs/hoon/hoon-school/structures-and-complex-types.md+356 content/docs/hoon/hoon-school/the-subject-and-its-legs.md+726 content/docs/hoon/hoon-school/trees-sets-and-maps.md+321 content/docs/hoon/hoon-school/type-checking-and-type-inference.md+643 content/docs/hoon/hoon-school/type-polymorphism.md+584 content/docs/hoon/overview.md+276 content/docs/hoon/reference/_index.md+50 content/docs/hoon/reference/advanced.md+206 content/docs/hoon/reference/auras.md+98 content/docs/hoon/reference/basic.md+177 content/docs/hoon/reference/cheat-sheet.md+28 content/docs/hoon/reference/hoon-errors.md+189 content/docs/hoon/reference/irregular.md+257 content/docs/hoon/reference/limbs/_index.md+18 content/docs/hoon/reference/limbs/limb.md+71 content/docs/hoon/reference/limbs/wing.md+44 content/docs/hoon/reference/rune/_index.md+73 content/docs/hoon/reference/rune/bar.md+708 content/docs/hoon/reference/rune/buc.md+606 content/docs/hoon/reference/rune/cen.md+466 content/docs/hoon/reference/rune/col.md+245 content/docs/hoon/reference/rune/constants.md+193 content/docs/hoon/reference/rune/dot.md+223 content/docs/hoon/reference/rune/ket.md+387 content/docs/hoon/reference/rune/lus.md+225 content/docs/hoon/reference/rune/mic.md+462 content/docs/hoon/reference/rune/sig.md+452 content/docs/hoon/reference/rune/terminators.md+78 content/docs/hoon/reference/rune/tis.md+490 content/docs/hoon/reference/rune/wut.md+551 content/docs/hoon/reference/rune/zap.md+239 content/docs/hoon/reference/stdlib/1a.md+680 content/docs/hoon/reference/stdlib/1b.md+273 content/docs/hoon/reference/stdlib/1c.md+459 content/docs/hoon/reference/stdlib/2a.md+449 content/docs/hoon/reference/stdlib/2b.md+1412 content/docs/hoon/reference/stdlib/2c.md+1364 content/docs/hoon/reference/stdlib/2d.md+373 content/docs/hoon/reference/stdlib/2e.md+268 content/docs/hoon/reference/stdlib/2f.md+437 content/docs/hoon/reference/stdlib/2g.md+105 content/docs/hoon/reference/stdlib/2h.md+826 content/docs/hoon/reference/stdlib/2i.md+1133 content/docs/hoon/reference/stdlib/2j.md+269 content/docs/hoon/reference/stdlib/2k.md+400 content/docs/hoon/reference/stdlib/2l.md+108 content/docs/hoon/reference/stdlib/2m.md+308 content/docs/hoon/reference/stdlib/2n.md+427 content/docs/hoon/reference/stdlib/2o.md+187 content/docs/hoon/reference/stdlib/2p.md+242 content/docs/hoon/reference/stdlib/2q.md+375 content/docs/hoon/reference/stdlib/3a.md+859 content/docs/hoon/reference/stdlib/3b.md+5889 content/docs/hoon/reference/stdlib/3c.md+649 content/docs/hoon/reference/stdlib/3d.md+821 content/docs/hoon/reference/stdlib/3e.md+8 content/docs/hoon/reference/stdlib/3f.md+722 content/docs/hoon/reference/stdlib/3g.md+384 content/docs/hoon/reference/stdlib/4a.md+217 content/docs/hoon/reference/stdlib/4b.md+994 content/docs/hoon/reference/stdlib/4c.md+364 content/docs/hoon/reference/stdlib/4d.md+100 content/docs/hoon/reference/stdlib/4e.md+471 content/docs/hoon/reference/stdlib/4f.md+1195 content/docs/hoon/reference/stdlib/4g.md+179 content/docs/hoon/reference/stdlib/4h.md+962 content/docs/hoon/reference/stdlib/4i.md+1054 content/docs/hoon/reference/stdlib/4j.md+1656 content/docs/hoon/reference/stdlib/4k.md+276 content/docs/hoon/reference/stdlib/4l.md+608 content/docs/hoon/reference/stdlib/4m.md+434 content/docs/hoon/reference/stdlib/4n.md+447 content/docs/hoon/reference/stdlib/4o.md+782 content/docs/hoon/reference/stdlib/5a.md+7 content/docs/hoon/reference/stdlib/5b.md+7 content/docs/hoon/reference/stdlib/5c.md+7 content/docs/hoon/reference/stdlib/5d.md+7 content/docs/hoon/reference/stdlib/5e.md+7 content/docs/hoon/reference/stdlib/5f.md+176 content/docs/hoon/reference/stdlib/5g.md+7 content/docs/hoon/reference/stdlib/_index.md+1733 content/docs/hoon/reference/stdlib/table-of-contents.md+1731 content/docs/hoon/reference/style.md+476 content/docs/nock/_index.md+27 content/docs/nock/definition.md+186 content/docs/nock/example.md+362 content/docs/nock/explanation.md+605 content/docs/nock/implementations.md+2322 content/docs/system-overview/_index.md+77 content/docs/system-overview/arvo.md+33 content/docs/system-overview/azimuth.md+34 content/docs/system-overview/cryptography.md+116 content/docs/system-overview/hoon.md+28 content/docs/system-overview/nock.md+34 content/docs/system-overview/vere.md+45 content/docs/userspace/_index.md+30 content/docs/userspace/gall/_index.md+21 content/docs/userspace/gall/gall-api.md+958 content/docs/userspace/gall/gall.md+559 content/docs/userspace/gall/tutorial.md+14 content/docs/userspace/graph-store/_index.md+23 content/docs/userspace/graph-store/advanced-info.md+64 content/docs/userspace/graph-store/data-structure-overview.md+338 content/docs/userspace/graph-store/overview.md+109 content/docs/userspace/graph-store/validator-walkthrough.md+487 content/docs/userspace/landscape/_index.md+18 content/docs/userspace/landscape/overview.md+195 content/docs/userspace/landscape/reference/_index.md+11 content/docs/userspace/landscape/reference/graph-store.md+160 content/docs/userspace/overview.md+19 content/docs/userspace/threads/_index.md+27 content/docs/userspace/threads/basics/_index.md+29 content/docs/userspace/threads/basics/bind.md+97 content/docs/userspace/threads/basics/fundamentals.md+169 content/docs/userspace/threads/basics/input.md+145 content/docs/userspace/threads/basics/output.md+119 content/docs/userspace/threads/basics/summary.md+75 content/docs/userspace/threads/examples/_index.md+33 content/docs/userspace/threads/examples/child-thread.md+237 content/docs/userspace/threads/examples/get-json.md+126 content/docs/userspace/threads/examples/main-loop.md+178 content/docs/userspace/threads/examples/poke-agent.md+60 content/docs/userspace/threads/examples/scry.md+70 content/docs/userspace/threads/examples/take-fact.md+65 content/docs/userspace/threads/gall/_index.md+29 content/docs/userspace/threads/gall/poke-thread.md+116 content/docs/userspace/threads/gall/start-thread.md+145 content/docs/userspace/threads/gall/stop-thread.md+152 content/docs/userspace/threads/gall/take-facts.md+184 content/docs/userspace/threads/gall/take-result.md+132 content/docs/userspace/threads/overview.md+81 content/docs/userspace/threads/reference.md+86 content/docs/vere/_index.md+37 content/docs/vere/api.md+1040 content/docs/vere/c.md+114 content/docs/vere/jetting.md+779 content/docs/vere/nouns.md+477 content/docs/vere/runtime.md+44 content/docs/weights.sh+23 content/events/2017-08-11-after-hours-bootstrapping-urbit-from-the-ethereum-blockchain.md+19 content/events/2017-09-22-after-hours-fun-with-arvo-the-urbit-os.md+19 content/events/2017-10-26-after-hours-designing-robust-human-systems.md+19 content/events/2017-11-16-after-hours-visiting-contributors.md+17 content/events/2018-01-26-urbit-irl-20181.md+17 content/events/2018-02-23-urbit-irl-20182.md+17 content/events/2018-03-11-20183-hoon-school.md+15 content/events/2018-03-23-urbit-irl-20183.md+17 content/events/2018-04-08-20184-hoon-school.md+15 content/events/2018-05-25-urbit-irl-20185.md+17 content/events/2018-08-03-after-hours-decentralized-web-summit.md+13 content/events/2018-08-17-urbit-irl-20188.md+19 content/events/2018-09-21-urbit-irl-20189.md+17 content/events/2018-10-10-urbit-zcash-blockchain-week.md+23 content/events/2018-12-20-after-hours-its-just-a-party-man.md+17 content/events/2019-03-01-after-hours-ask-galen-anything.md+19 content/events/2019-03-08-urbit-irl-austin-tx.md+15 content/events/2019-04-19-urbit-irl-20194.md+19 content/events/2019-05-17-urbit-irl-20195.md+17 content/events/2019-06-21-urbit-irl-20196.md+17 content/events/2019-07-19-urbit-irl-20197.md+17 content/events/2019-08-29-urbit-austin-20198.md+15 content/events/2019-10-04-urbit-irl-201910.md+17 content/events/2019-11-15-urbit-irl-201911.md+17 content/events/2019-12-13-urbit-irl-201912.md+25 content/events/2020-01-24-urbit-irl-20201.md+19 content/events/2020-02-28-urbit-irl-20202.md+19 content/events/2020-04-03-urbit-os1-launch-party.md+46 content/events/2020-10-09-urbit-hosting-launch-event.md+32 content/events/2020-11-05-developer-call-graph-store.md+18 content/events/2020-11-19-developer-call-bittorrent-tracking-on-urbit.md+18 content/events/2020-12-10-developer-call-injecting-external-services-into-urbit.md+18 content/events/2021-02-04-developer-call-architectural-idea-maze.md+17 content/events/2021-03-04-developer-call-scaling-azimuth.md+22 content/events/2021-03-18-developer-call-pressure-and-protolith.md+19 content/events/2021-04-01-developer-call-javascript-apps-on-urbit.md+20 content/events/2021-04-15-developer-call-software-distribution.md+25 content/events/2021-04-27-bitcoin-launch.md+22 content/events/2021-04-29-developer-call-real-time-communications-on-urbit.md+27 content/events/2021-05-13-developer-call-versioned-networking.md+21 content/events/2021-05-27-town-hall.md+40 content/faq.md+401 content/fora.md+11 content/getting-started/_index.md+84 content/getting-started/cli.md+208 content/getting-started/planet.md+132 content/grants/-smol-future-sustained-knowledge-sharing-and-marketing.md+92 content/grants/_index.md+7 content/grants/a-book-about-urbit.md+85 content/grants/a-collaborative-web-mapping-system-for-urbit.md+99 content/grants/analytics-script.md+53 content/grants/antechamber.md+104 content/grants/apprenticeships/_index.md+4 content/grants/art-by-urbit.md+32 content/grants/bart-train-tracker-landscape-tile.md+50 content/grants/bitcoin-full-node-provider-and-wallet.md+92 content/grants/bitcoin-key-derivation.md+61 content/grants/bitcoin-node-json-rpc-api-part-1.md+48 content/grants/bitcoin-node-json-rpc-api-part-2.md+48 content/grants/bitcoin-node-json-rpc-api-part-3.md+49 content/grants/bitcoin-node-json-rpc-api-part-4.md+48 content/grants/bitcoin-wallet-on-bridge.md+59 content/grants/boston-t-train-tracker-landscape-tile.md+55 content/grants/bounties/_index.md+4 content/grants/calendar-ui.md+53 content/grants/calendar.md+115 content/grants/comprehensive-local-server-and-mum-explanation-video.md+41 content/grants/content-saver.md+45 content/grants/cross-platform-desktop-urbit-app.md+85 content/grants/cta-train-tracker-landscape-tile.md+50 content/grants/display-eth-data.md+56 content/grants/docker-image-for-cloud-container-orchestration.md+46 content/grants/educational-guide-todomvc-urbit-edition.md+331 content/grants/escape.md+46 content/grants/ethereum-abi-parser.md+55 content/grants/gall-api-documentation.md+54 content/grants/gifts/_index.md+4 content/grants/go-airlock-library.md+45 content/grants/graph-store-documentation-guide.md+100 content/grants/haskell-airlock-library.md+45 content/grants/hoon-001-learner-efficiency-and-early-learner-resources.md+81 content/grants/host-three-college-university-urbit-meetups-1.md+60 content/grants/host-three-college-university-urbit-meetups-2.md+60 content/grants/host-three-college-university-urbit-meetups-3.md+59 content/grants/host-three-virtual-urbit-meetups.md+51 content/grants/host-two-urbit-meetups-1.md+55 content/grants/host-two-urbit-meetups-10.md+55 content/grants/host-two-urbit-meetups-11.md+55 content/grants/host-two-urbit-meetups-2.md+55 content/grants/host-two-urbit-meetups-3.md+55 content/grants/host-two-urbit-meetups-4.md+55 content/grants/host-two-urbit-meetups-5.md+55 content/grants/host-two-urbit-meetups-6.md+55 content/grants/host-two-urbit-meetups-7.md+55 content/grants/host-two-urbit-meetups-8.md+55 content/grants/host-two-urbit-meetups-9.md+55 content/grants/links-in-urbit-reference-docs.md+30 content/grants/llelogram.md+56 content/grants/matrices-in-hoon.md+57 content/grants/matrixriotim-bridge-bot.md+39 content/grants/minimal-urbit-os.md+56 content/grants/network-explorer-data-pipeline-http-api.md+229 content/grants/open-street-maps-data-importation.md+53 content/grants/overhaul-the-urbitorg-website.md+73 content/grants/proposals/_index.md+4 content/grants/ragnarok-online-on-urbit.md+54 content/grants/search-in-groups.md+41 content/grants/staff-the-urbit-help-desk-1.md+61 content/grants/staff-the-urbit-help-desk-2.md+61 content/grants/staff-the-urbit-helpdesk-east.md+60 content/grants/staff-the-urbit-helpdesk-west.md+57 content/grants/the-complete-guide-to-gall-and-landscape.md+77 content/grants/thread-documentation.md+75 content/grants/tor-nodes-relay-search-tile.md+47 content/grants/translate-key-parts-of-urbitorg-into-german.md+30 content/grants/translate-key-parts-of-urbitorg-into-korean.md+31 content/grants/translate-key-parts-of-urbitorg-into-norwegian.md+32 content/grants/translate-key-parts-of-urbitorg-into-spanish.md+30 content/grants/try-urbit-website.md+32 content/grants/typescript-airlock-library.md+44 content/grants/ua-collaborative-text-editor.md+27 content/grants/ua-filesharer.md+26 content/grants/ua-heads-up-poker.md+30 content/grants/ua-invoice-system.md+30 content/grants/ua-marketplace.md+34 content/grants/ucal-google-and-outlook-integration.md+84 content/grants/udon-syntax-highlighter.md+43 content/grants/unit-tests-for-json-parsing.md+49 content/grants/unit-tests-for-pure-algorithms.md+61 content/grants/unit-tests-for-sha-functions.md+50 content/grants/unit-tests-for-zuse-cryptographic-functions.md+52 content/grants/up-to-date-hoon-reference-card.md+30 content/grants/urbian-a-customized-linux-distribution-for-urbit-appliances.md+86 content/grants/urbit-api-for-elixir.md+38 content/grants/urbit-community-concierge-east-coast-2q2021.md+35 content/grants/urbit-community-concierge-east-coast.md+34 content/grants/urbit-community-concierge-west-coast-2q2021.md+35 content/grants/urbit-community-concierge-west-coast.md+34 content/grants/urbit-event-series.md+90 content/grants/urbit-explainer-video.md+34 content/grants/urbit-http-api-for-emacs-elisp.md+38 content/grants/urbit-http-api-for-kotlin.md+37 content/grants/urbit-http-api-for-rust.md+56 content/grants/urbit-http-interface-java-edition.md+69 content/grants/urbit-http-library-for-ruby.md+39 content/grants/urbit-lfs-filehosting.md+68 content/grants/urbit-online-meetup.md+30 content/grants/urbit-react-cookbook.md+46 content/grants/urbit-ship-and-star-hosting-and-troubleshooting-docs.md+38 content/grants/verifying-urbit-id-on-keybase.md+75 content/grants/video-content-manager.md+59 content/grants/volt-lightning-on-urbit.md+232 content/grants/web-scraper.md+45 content/grants/webrtc-gall-agent-and-external-app.md+77 content/media/_index.md+7 content/media/blockchannel-episode-19-virtual-land-in-the-clouds-with-urbit.md+12 content/media/blueprint-2017-galen-wolfe-pauly-on-the-distributed-web.md+13 content/media/epicenter-episode-205-urbit-a-digital-republic-reinventing-the-internet.md+13 content/media/governing-the-future-e09-urbit-a-user-owned-internet-on-top-of-the-internet.md+12 content/media/lambdaconf-2016-curtis-yarvin-urbit-a-clean-slate-functional-operating-stack.md+13 content/media/lambdaconf-2018-ted-blackman-ford-urbits-build-system.md+13 content/media/on-the-brink-castle-island.md+14 content/media/the-ether-review-46-curtis-yarvin-and-galen-wolfe-pauly-on-urbit.md+13 content/media/urbit-and-the-not-so-dark-future-of-the-internet.md+10 content/media/what-is-urbit.md+10 content/privacy.md+88 content/reset.md+109 content/terms-of-use.md+70 content/understanding-urbit/_index.md+9 content/understanding-urbit/interface.md+71 content/understanding-urbit/people-history.md+104 content/understanding-urbit/roadmap.md+98 content/understanding-urbit/urbit-id.md+68 content/understanding-urbit/urbit-os.md+58 content/updates/2016-10-6-update.md+263 content/updates/2016-5-16-roadmap.md+244 content/updates/2016-7-20-update.md+159 content/updates/2016-8-30-update.md+267 content/updates/2017-1-30-update.md+344 content/updates/2017-10-7-update.md+16 content/updates/2017-11-14-update.md+218 content/updates/2017-12-16-update.md+29 content/updates/2017-12-2-update.md+75 content/updates/2017-12-22-update.md+32 content/updates/2017-3-1-update.md+107 content/updates/2017-4-17-update.md+157 content/updates/2017-5-11-roadmap.md+233 content/updates/2017-8-11-update.md+110 content/updates/2017-9-23-update.md+24 content/updates/2017-9-29-update.md+16 content/updates/2018-1-13-update.md+27 content/updates/2018-1-6-update.md+37 content/updates/2018-10-12-update.md+61 content/updates/2018-10-24-update.md+39 content/updates/2018-11-20-update.md+54 content/updates/2018-11-6-update.md+46 content/updates/2018-12-18-update.md+58 content/updates/2018-2-17-update.md+36 content/updates/2018-2-24-update.md+31 content/updates/2018-2-5-update.md+26 content/updates/2018-2-9-update.md+40 content/updates/2018-3-24-update.md+56 content/updates/2018-3-5-update.md+31 content/updates/2018-4-14-update.md+56 content/updates/2018-4-7-update.md+40 content/updates/2018-5-16-update.md+50 content/updates/2018-5-23-update.md+64 content/updates/2018-5-29-update.md+16 content/updates/2018-5-30-update.md+77 content/updates/2018-6-14-update.md+70 content/updates/2018-6-21-update.md+60 content/updates/2018-6-6-update.md+80 content/updates/2018-7-13-update.md+66 content/updates/2018-7-20-update.md+58 content/updates/2018-7-3-update.md+66 content/updates/2018-7-30-update.md+64 content/updates/2018-8-23-update.md+84 content/updates/2018-8-30-update.md+56 content/updates/2018-8-8-update.md+58 content/updates/2018-9-11-update.md+60 content/updates/2019-11-06-update.md+40 content/updates/2019-12-06-update.md+43 content/updates/2019-2-11-update.md+37 content/updates/2019-2-25-update.md+33 content/updates/2019-2-26-network-update.md+37 content/updates/2019-2-4-update.md+27 content/updates/2019-3-11-update.md+27 content/updates/2019-3-27-update.md+19 content/updates/2019-3-4-update.md+46 content/updates/2019-4-11-update.md+27 content/updates/2019-5-10-update.md+16 content/updates/2019-5-17-update.md+20 content/updates/2019-5-31-update.md+30 content/updates/2019-6-14-update.md+27 content/updates/2019-7-25-update.md+36 content/updates/2020-02-06-update.md+41 content/updates/2020-04-04-update.md+26 content/updates/2020-06-15-update.md+57 content/updates/2020-07-27-update.md+39 content/updates/_index.md+6 content/using/_index.md+33 content/using/id/_index.md+33 content/using/id/bridge-troubleshooting.md+37 content/using/id/creating-an-invite-pool.md+106 content/using/id/guide-to-breaches.md+84 content/using/id/overview.md+71 content/using/id/using-bridge.md+113 content/using/os/_index.md+36 content/using/os/filesystem.md+397 content/using/os/getting-started.md+337 content/using/os/messaging.md+254 content/using/os/s3.md+34 content/using/os/shell.md+413 content/using/os/ship-troubleshooting.md+213 content/using/os/stars-and-galaxies.md+46 content/using/running/_index.md+16 content/using/running/hosting.md+187 content/voting-instructions.md+36 lib/constants.js+8 lib/lib.js+116 next.config.js+21 package-lock.json+3591 package.json+33 pages/404.js+3 pages/_app.js+8 pages/api/hello.js+5 pages/blog.js+78 pages/blog/[slug].js+146 pages/docs.js+69 pages/index.js+229 postcss.config.js+6 public/favicon.ico public/vercel.svg+4 styles/globals.css+148 styles/markdown.module.css+77 tailwind.config.js+29 yarn.lock+1865
.gitignore+32−10
@@ -1,12 +1,34 @@
1−# intermediate
2−*.swo
3−*.swp
4−*.o
5−/outside/**/*.a
6−/outside/re2/obj
7−# build
8−public/
1+# See https://help.github.com/articles/ignoring-files/ for more about ignoring files.
2+
93# dependencies
10−.sass-cache
11−# OS
4+/node_modules
5+/.pnp
6+.pnp.js
7+
8+# testing
9+/coverage
10+
11+# next.js
12+/.next/
13+/out/
14+
15+# production
16+/build
17+
18+# misc
1219.DS_Store
20+*.pem
21+
22+# debug
23+npm-debug.log*
24+yarn-debug.log*
25+yarn-error.log*
26+
27+# local env files
28+.env.local
29+.env.development.local
30+.env.test.local
31+.env.production.local
32+
33+# vercel
34+.vercel
.husky/.gitignorenew file+1
@@ -0,0 +1 @@
1+_
.husky/pre-commitnew file+4
@@ -0,0 +1,4 @@
1+#!/bin/sh
2+. "$(dirname "$0")/_/husky.sh"
3+
4+npx pretty-quick --staged
README.mdnew file+38
@@ -0,0 +1,38 @@
1+The website for Urbit.
2+
3+## Getting Started
4+
5+First, pull docs as a submodule:
6+
7+```bash
8+git submodule init
9+```
10+
11+```bash
12+git submodule update
13+```
14+
15+Then, run the development server:
16+
17+```bash
18+npm run dev
19+# or
20+yarn dev
21+```
22+
23+Finally, open [http://localhost:3000](http://localhost:3000) with your browser to see the result.
24+
25+## Framework and Library Documentation
26+
27+To learn more about Next.js, take a look at the following resources:
28+
29+- [Next.js Documentation](https://nextjs.org/docs) - learn about Next.js features and API.
30+- [Learn Next.js](https://nextjs.org/learn) - an interactive Next.js tutorial.
31+
32+To learn more about Tailwind CSS, take a look at the docs:
33+
34+- [Tailwind CSS Docs](https://tailwindcss.com/docs) - Docs
35+
36+## Deployment
37+
38+WIP
components/BackgroundImage.jsnew file+6
@@ -0,0 +1,6 @@
1+// Easily crops images
2+export default function BackgroundImage(props) {
3+ return (
4+ <div className={`bg-img ${props.className || ''}`} style={{backgroundImage: `url(${props.src})`, ...props.style}}/>
5+ )
6+}
components/Container.jsnew file+8
@@ -0,0 +1,8 @@
1+// Ensures the root container is always 100vw, min 100vh, and centers all children along the y-axis
2+export default function Container({children}) {
3+ return (
4+ <div className='flex flex-col min-h-screen w-screen items-center'>
5+ {children}
6+ </div>
7+ )
8+ }
components/Footer.jsnew file+56
@@ -0,0 +1,56 @@
1+import Link from 'next/link'
2+import SingleColumn from './SingleColumn'
3+import {contact} from '../lib/constants'
4+
5+export default function Footer() {
6+ return (
7+ <footer className="py-24 bg-wall w-full mt-48 flex justify-center">
8+ <SingleColumn>
9+ <div className="flex layout-wide">
10+ <div className="w-1/3 flex flex-col">
11+ <h3 className='mb-4'>Use Urbit</h3>
12+ <Link className="mt-4" href=""><a className="type-ui text-gray">Urbit Client</a></Link>
13+ <Link className="mt-4" href=""><a className="type-ui text-gray">Urbit Binaries</a></Link>
14+ <Link className="mt-4" href=""><a className="type-ui text-gray">Urbit Apps</a></Link>
15+ <Link className="mt-4" href=""><a className="type-ui text-gray">Host-Providers</a></Link>
16+
17+ </div>
18+ <div className="w-1/3 flex flex-col">
19+ <h3 className='mb-4'>About</h3>
20+ <Link className="mt-4" href="/understanding-urbit"><a className="type-ui text-gray">What's Urbit?</a></Link>
21+ <Link className="mt-4" href="/understanding-urbit/urbit-id"><a className="type-ui text-gray">Urbit ID</a></Link>
22+ <Link className="mt-4" href="/understanding-urbit/urbit-os"><a className="type-ui text-gray">Urbit OS</a></Link>
23+ <Link className="mt-4" href="/faq"><a className="type-ui text-gray">FAQ</a></Link>
24+ </div>
25+ <div className="w-1/3 flex flex-col">
26+ <h3 className='mb-4'>News</h3>
27+ </div>
28+ </div>
29+ <div className="flex layout-wide mt-24">
30+ <div className="w-1/3 flex flex-col">
31+ <h3 className='mb-4'>Develop</h3>
32+
33+ </div>
34+ <div className="w-1/3 flex flex-col">
35+ <h3 className='mb-4'>Contribute</h3>
36+ </div>
37+ <div className="w-1/3 flex flex-col">
38+ <h3 className='mb-4'>Community</h3>
39+ </div>
40+ </div>
41+ <div className="flex layout-wide mt-64">
42+ <div className="w-1/3">
43+ <Link href=""><a className="type-ui text-gray">Privacy Policy</a></Link>
44+
45+ </div>
46+ <div className="w-1/3">
47+ <Link href=""><a className="type-ui text-gray">Terms of Service</a></Link>
48+ </div>
49+ <div className="w-1/3">
50+ <Link href=""><a className="type-ui text-gray">{contact.email}</a></Link>
51+ </div>
52+ </div>
53+ </SingleColumn>
54+ </footer>
55+ )
56+}
components/Header.jsnew file+47
@@ -0,0 +1,47 @@
1+import Link from "next/link";
2+import { useRouter } from "next/router";
3+import classnames from "classnames";
4+import path from "path";
5+
6+function ActiveLink({ children, href, className }) {
7+ const router = useRouter();
8+
9+ const firstCrumb = router.asPath.split("/")[1];
10+
11+ const activeClassName = classnames({
12+ "text-black": "/" + firstCrumb === href,
13+ "text-gray": "/" + firstCrumb !== href,
14+ });
15+
16+ return (
17+ <Link href={href}>
18+ <a className={className + " " + activeClassName}>{children}</a>
19+ </Link>
20+ );
21+}
22+
23+// This is the header for the index page
24+export default function Header() {
25+ return (
26+ <header className="layout-wide flex justify-between items-center pt-8">
27+ <Link href="/">
28+ <a className="type-ui">Urbit</a>
29+ </Link>
30+ <nav className="flex items-center">
31+ <ActiveLink className="mr-5 type-ui" href="/docs">
32+ Docs
33+ </ActiveLink>
34+ <ActiveLink className="mr-5 type-ui" href="/blog">
35+ Blog
36+ </ActiveLink>
37+ <ActiveLink className="mr-5 type-ui" href="/events">
38+ Events
39+ </ActiveLink>
40+ <button className="mr-5 text-green type-ui">Download Port</button>
41+ <button className="button-sm bg-wall text-gray">
42+ Search Urbit.org<div className="ml-4 text-lightGray">⌘K</div>
43+ </button>
44+ </nav>
45+ </header>
46+ );
47+}
components/Lorem.jsnew file+106
@@ -0,0 +1,106 @@
1+// Giant lorem ipsum for tests
2+export default function Lorem(props) {
3+ return (
4+ <div className={props.className || ''}>
5+ Lorem ipsum dolor sit amet, consectetur adipiscing elit. Phasellus sagittis posuere purus vitae auctor. Duis consequat commodo metus vel pellentesque. Nulla massa neque, commodo sed placerat vel, mattis sed felis. Proin et felis auctor, tristique ante at, mollis nisi. Vestibulum ante ipsum primis in faucibus orci luctus et ultrices posuere cubilia curae; In tempus blandit volutpat. Lorem ipsum dolor sit amet, consectetur adipiscing elit.
6+
7+ Praesent egestas at metus ac pharetra. Pellentesque tempus elit ex, vel scelerisque magna ornare ac. Vestibulum vitae est nibh. Nullam posuere, libero ac aliquet congue, urna tortor faucibus leo, eu bibendum quam nulla id metus. Vivamus eget feugiat ex. Sed purus nulla, ultricies eget dui fermentum, pellentesque posuere lectus. Maecenas vel orci dignissim ligula luctus varius. Quisque convallis massa in lectus aliquet, varius varius risus scelerisque. Suspendisse et interdum turpis. Sed ac fermentum nulla. Donec nunc est, tincidunt ac fermentum luctus, auctor vel dui. Vivamus hendrerit, libero sed pellentesque viverra, est massa pretium tellus, vel ultrices turpis ante at orci.
8+
9+ Interdum et malesuada fames ac ante ipsum primis in faucibus. Integer sit amet dui sed purus accumsan tempor. Aenean posuere lacus mollis mattis maximus. Integer hendrerit pulvinar tempus. Nam aliquet ipsum et arcu convallis placerat. Donec facilisis odio sed dolor ultricies, nec rhoncus lacus fringilla. Cras luctus odio ipsum, in pretium eros volutpat sit amet. Integer fringilla ipsum at bibendum imperdiet. Maecenas auctor magna non arcu varius rhoncus. Nunc dictum elementum suscipit. Proin rhoncus lacus in massa eleifend blandit.
10+
11+ Maecenas eu tellus dignissim, venenatis turpis eu, tempus odio. Praesent viverra vitae neque in dapibus. Donec fermentum neque at augue volutpat bibendum. Integer blandit tristique sodales. Vestibulum ultrices nulla ac est vulputate imperdiet. Vivamus venenatis cursus tellus quis faucibus. Curabitur non fringilla felis. Sed blandit tellus quis dictum cursus. In quam ex, euismod at ipsum quis, porta tempor nisl. In id scelerisque diam, quis gravida mi.
12+
13+ Nullam lacinia quis nibh vitae fermentum. Sed in libero vitae massa pulvinar feugiat nec non sem. Donec tristique ac felis vel feugiat. Suspendisse tempus ante metus, non porttitor arcu tincidunt nec. Vestibulum iaculis dolor ut quam lobortis, quis mollis purus imperdiet. Vivamus faucibus interdum nibh vel lacinia. Pellentesque at tempus mi. In hac habitasse platea dictumst. Phasellus ultricies tincidunt elementum. Mauris mollis mollis auctor.
14+
15+ Suspendisse potenti. Pellentesque egestas leo ut arcu imperdiet vehicula. Fusce dapibus volutpat leo, tempus sodales risus ultricies et. Nullam gravida massa ac aliquam egestas. In facilisis vitae eros vitae posuere. Duis enim enim, commodo vel dapibus et, consequat sed purus. Morbi ornare vitae tellus nec ultricies. Curabitur egestas lacus ut dictum laoreet. Praesent bibendum cursus pellentesque. Maecenas fringilla tempor lacus id feugiat. Praesent non imperdiet velit. Nulla facilisi. Vestibulum elementum, velit sed ultricies porta, odio eros porta libero, a tempor turpis arcu malesuada ipsum. Phasellus eu mauris elit.
16+
17+ Curabitur id justo a eros tristique semper sodales non ipsum. Mauris aliquam felis sed orci pretium, at placerat urna posuere. Suspendisse potenti. In ac ipsum lorem. Maecenas in semper tortor, ac consectetur enim. Nullam sit amet nulla ante. Aliquam viverra risus et mauris suscipit, at gravida risus dignissim. Proin tincidunt metus eros. Donec tempus finibus nulla quis ullamcorper. Etiam ut nulla nisl. Class aptent taciti sociosqu ad litora torquent per conubia nostra, per inceptos himenaeos. Vivamus lacinia ornare mauris ac fringilla. Maecenas ac faucibus ipsum.
18+
19+ Nulla finibus fringilla lacus, id venenatis dolor pulvinar vitae. Vestibulum vulputate luctus eros, sed commodo justo consectetur fermentum. Suspendisse potenti. Morbi ex diam, dapibus vel faucibus id, mattis et felis. Ut a interdum augue, euismod fringilla ex. Nullam fermentum, eros sed congue vestibulum, tortor neque tempus sapien, in ultricies erat nulla in eros. Aliquam non velit semper, ullamcorper augue nec, auctor purus. Duis enim felis, viverra nec nisi vel, sodales bibendum ante. Etiam sollicitudin ornare cursus.
20+
21+ Donec iaculis bibendum viverra. Mauris mattis consectetur suscipit. Proin at cursus risus. Vivamus eu felis condimentum, tempus enim id, vestibulum odio. Praesent pretium massa vitae turpis aliquet posuere. Nunc egestas, libero eu vestibulum iaculis, leo sapien consequat dolor, ut feugiat nisl metus vel eros. Suspendisse faucibus felis a est porta tincidunt. Sed diam orci, sodales non orci nec, pharetra dapibus ipsum.
22+
23+ Quisque rutrum, urna non vehicula porta, tellus dolor maximus quam, et pharetra justo diam quis neque. Suspendisse at lorem rhoncus, maximus tortor nec, sodales leo. Vivamus eu condimentum mauris. Pellentesque varius, velit nec maximus volutpat, dui purus porta lorem, eu dapibus metus risus non sem. Vestibulum id libero tellus. Quisque tortor turpis, laoreet eu est et, mollis volutpat elit. Nunc posuere enim sit amet vulputate fringilla. Curabitur pretium arcu in sem mattis pellentesque. Quisque vulputate ex leo, at accumsan tellus fermentum sit amet. Fusce ac velit vel dolor lacinia gravida. Proin ac faucibus felis.
24+
25+ Aliquam semper massa et cursus laoreet. Praesent nec ante auctor, dapibus sem id, pellentesque justo. Maecenas iaculis ex sapien, in tempor erat dapibus a. Vivamus varius ut turpis eget vehicula. Sed condimentum enim non consectetur sagittis. Donec eu ipsum eros. Pellentesque convallis tellus id finibus rutrum. Fusce et facilisis metus. Proin quis orci iaculis enim iaculis ultrices a et ipsum. Vivamus blandit a diam at condimentum.
26+
27+ Donec et vestibulum purus. Ut at est pulvinar mauris ultrices facilisis. Duis lacus quam, euismod maximus venenatis at, consectetur id nunc. Suspendisse elementum risus vitae eros laoreet gravida. Fusce aliquam, justo eu auctor iaculis, purus justo molestie metus, in tincidunt metus magna nec orci. Proin lacus libero, maximus eu laoreet nec, egestas et lorem. Nunc condimentum, arcu ac elementum facilisis, purus ligula maximus est, sit amet hendrerit dui ante eu elit. Aenean tempor rutrum massa eget efficitur. Donec tempor metus diam, in gravida nunc lobortis at. Nam elementum sollicitudin aliquam. Proin sit amet quam eros. Vivamus ut ante nisi. Pellentesque vitae felis consectetur erat ultrices ultrices ut a ante. Duis interdum, ante id accumsan maximus, nisi sem euismod sem, vitae facilisis ex nunc a quam. Pellentesque libero sem, tempus sit amet blandit sed, interdum sed ante. Maecenas vitae rhoncus augue, eu molestie erat.
28+
29+ Nullam bibendum, lacus vel tincidunt tristique, ligula sapien interdum velit, non pretium dolor tortor sollicitudin leo. Aliquam vel lorem ut ligula mattis auctor. Proin ullamcorper molestie augue, eget pulvinar justo placerat eu. Sed euismod vehicula enim. In semper faucibus consectetur. Pellentesque interdum varius varius. Cras laoreet felis vitae eros iaculis sollicitudin. Aenean eu mattis felis. Proin mattis nunc sodales hendrerit fringilla. Aliquam velit mauris, feugiat eu felis a, ullamcorper tempus velit. Fusce non pulvinar quam, commodo imperdiet mi. Nam rhoncus turpis neque, in eleifend purus cursus vel. Quisque lobortis, nulla ut auctor finibus, ex nunc tristique nisl, in tincidunt est massa ut sem.
30+
31+ Vestibulum eu urna elit. Aliquam tempor cursus faucibus. Praesent scelerisque dui eu lorem auctor, eu lacinia nibh porttitor. Ut et eros eget felis tristique volutpat a ac tortor. Praesent quis lorem a mauris ultrices imperdiet quis a odio. In cursus maximus orci sed dignissim. Donec semper, orci id consectetur pulvinar, turpis lorem eleifend quam, eu fringilla libero mauris vel ante. Nunc id tellus elit. Etiam facilisis vitae lorem vel fermentum.
32+
33+ Sed bibendum maximus nulla a egestas. Cras commodo ipsum quis magna viverra, quis tempus eros gravida. Donec et dictum dui. Etiam vel orci quis mi molestie eleifend. Vivamus vel tincidunt augue. Fusce vel tortor sagittis, viverra velit nec, consequat elit. Maecenas sem metus, dignissim non mauris ac, elementum tempor lectus. Suspendisse vel sapien tincidunt elit posuere mattis vel id mauris. Nam vitae imperdiet orci. Sed bibendum justo eu bibendum consequat. Mauris mauris sapien, blandit eget semper nec, pulvinar at lorem.
34+
35+ Pellentesque vitae nunc sed nibh condimentum tempor eget sed est. Quisque bibendum eu odio vitae pharetra. Cras ut condimentum purus. Nullam ipsum dui, efficitur tempus tincidunt et, condimentum a ipsum. Curabitur malesuada nibh id massa imperdiet porttitor. Duis quis lobortis dui. Mauris aliquam lectus arcu, vel euismod ante dignissim quis.
36+
37+ In ut vulputate nisi. Vivamus felis est, vestibulum vitae scelerisque non, blandit sit amet purus. Nullam dictum, turpis sed rutrum lacinia, sapien enim dictum lectus, ut molestie lorem enim id mi. Donec vestibulum dui urna, ut viverra purus mattis sit amet. In maximus metus ipsum. Sed bibendum scelerisque mattis. Nunc sed dolor at metus euismod semper. Cras libero purus, porttitor nec sapien eu, pellentesque malesuada magna. Etiam euismod purus ut leo pharetra, sollicitudin hendrerit nibh dignissim. Nam accumsan lacus in velit commodo, non mollis urna ornare. Vivamus ligula metus, ultrices a iaculis quis, venenatis pellentesque nisl. Proin vestibulum pellentesque tortor vel tempor.
38+
39+ Pellentesque id orci tincidunt, egestas erat eu, fermentum ipsum. Nunc efficitur nulla vitae nunc feugiat porttitor. Fusce risus est, dignissim in fermentum vel, finibus eu sapien. Maecenas mollis lorem nec dolor ornare, vel vestibulum nunc fringilla. Quisque at ante nunc. Nam blandit nisi quis blandit auctor. Cras ac sem lorem. Interdum et malesuada fames ac ante ipsum primis in faucibus. Fusce nulla tellus, porttitor id aliquet iaculis, auctor a quam. Aenean sodales pulvinar vehicula.
40+
41+ Etiam non diam tortor. Ut posuere dolor id placerat posuere. Aliquam erat volutpat. Morbi tempor volutpat venenatis. Sed id iaculis mi, in commodo dui. Aliquam eleifend urna sagittis lorem porta malesuada. Praesent placerat justo sed luctus finibus. Vivamus commodo porttitor metus, vulputate sagittis ipsum finibus non. Vestibulum porttitor varius metus eu fermentum. Morbi eleifend augue sit amet velit aliquam facilisis.
42+
43+ Donec et lorem lectus. Integer ex neque, lobortis vitae posuere eu, tincidunt id enim. Vivamus consectetur elit porttitor mi viverra, in sodales velit finibus. Fusce auctor felis a ipsum mollis, nec ornare metus tempus. Fusce nulla felis, semper vitae lorem non, tincidunt feugiat tellus. Vivamus eu pulvinar elit. Proin leo odio, laoreet eu purus ut, luctus laoreet ante. Ut commodo lacus odio, in scelerisque tortor pharetra in. Aenean rhoncus augue non egestas condimentum. Donec maximus placerat facilisis. Praesent aliquam augue non purus volutpat blandit. Pellentesque id mollis enim.
44+
45+ In ut eros posuere, imperdiet sapien a, dapibus velit. Nam at blandit neque. Nam euismod leo et venenatis mattis. Praesent consectetur, risus consequat condimentum tincidunt, ante nibh aliquam ligula, condimentum egestas augue tortor non risus. Nulla accumsan diam a sapien tempus hendrerit. Fusce fringilla mi quis blandit sodales. Quisque finibus mi vel nisi efficitur imperdiet. Cras luctus dapibus mauris non feugiat. Aliquam eu rutrum ipsum. Aliquam elementum luctus molestie. Maecenas molestie nisi molestie, sollicitudin arcu vel, condimentum diam. Mauris eu quam ac lacus accumsan vestibulum. Etiam et mi imperdiet sem convallis dapibus vel eget nisl. In vel faucibus risus. Curabitur luctus pellentesque eros, ac condimentum tellus placerat nec. Nam gravida consequat tincidunt.
46+
47+ Vestibulum consectetur vitae erat non ultrices. Nullam eu diam dictum ante vehicula tempor sit amet et est. Donec ipsum justo, facilisis lobortis vehicula eleifend, viverra a leo. Donec hendrerit, lorem et congue dictum, ipsum nunc facilisis nunc, non ornare nulla augue eu nibh. Ut condimentum in mauris eget blandit. Donec sed est mi. Nunc gravida sodales vestibulum. In hac habitasse platea dictumst.
48+
49+ Aliquam interdum mauris turpis, a efficitur eros molestie suscipit. Donec elementum ultrices augue, in facilisis sapien vestibulum ac. Sed sit amet dictum augue. Nullam posuere ante sit amet cursus molestie. Praesent odio dolor, molestie ac eleifend vitae, tempor quis ligula. Cras a volutpat sem, a varius sapien. Curabitur finibus nisl quis porttitor luctus. Class aptent taciti sociosqu ad litora torquent per conubia nostra, per inceptos himenaeos. Pellentesque dignissim lacus a neque ultricies blandit. Donec a imperdiet est. Phasellus a tristique lectus. Mauris in augue in metus euismod fringilla.
50+
51+ Praesent congue tincidunt hendrerit. Vivamus efficitur neque est, vel ultricies lectus tempor et. Fusce sit amet lorem sit amet enim eleifend faucibus. Pellentesque mattis malesuada scelerisque. Aliquam quam elit, commodo a commodo nec, vestibulum eget neque. Suspendisse et nibh vestibulum massa placerat maximus rutrum non felis. Donec non nisi rhoncus ipsum luctus ultrices sit amet vel ligula.
52+
53+ In dictum vitae neque vehicula faucibus. Curabitur elementum nibh turpis, a pellentesque nunc viverra eu. Morbi dapibus justo dolor, nec fringilla turpis condimentum eu. Donec nec nibh eu erat tincidunt semper a ut erat. Duis accumsan mattis convallis. Aenean lacus elit, ultrices vitae nibh sit amet, consectetur vulputate risus. Morbi blandit lacus et condimentum mollis. Maecenas id massa ut massa interdum viverra a nec nisl. Pellentesque ullamcorper fringilla eros et volutpat.
54+
55+ Suspendisse egestas, purus sit amet condimentum tincidunt, nunc nibh pulvinar turpis, vel eleifend lacus elit nec ligula. In viverra et ipsum a faucibus. In dictum turpis nec lectus hendrerit, vitae imperdiet orci tincidunt. Aliquam felis risus, aliquam vel ornare vel, molestie vehicula tortor. Etiam ullamcorper sit amet tellus in mollis. Proin ut rhoncus enim. In sit amet blandit est. Quisque ultricies tortor a felis ultricies, in auctor ex feugiat. Integer tempus auctor nunc id molestie. Praesent eget placerat odio. Maecenas feugiat justo a odio blandit venenatis.
56+
57+ Nunc sit amet justo eu sapien efficitur porta. Pellentesque aliquet elementum odio. Donec est diam, vehicula quis scelerisque eget, gravida non arcu. Vestibulum ante ipsum primis in faucibus orci luctus et ultrices posuere cubilia curae; Ut vehicula vestibulum commodo. Integer sed nunc sit amet augue hendrerit aliquam id quis elit. Donec congue risus non mauris condimentum luctus.
58+
59+ Sed dapibus nulla id feugiat eleifend. Vestibulum cursus malesuada nunc quis porta. Curabitur sodales justo augue, ac semper arcu gravida in. Nunc eu ex rutrum, viverra ipsum in, interdum leo. Nunc erat leo, consectetur vitae magna eget, lacinia auctor dolor. Etiam consequat eros sit amet lorem mollis malesuada. Suspendisse sit amet aliquet libero. Cras ut nisl aliquet, pulvinar odio nec, porttitor nisl. Aenean feugiat diam eget sapien rhoncus placerat. Etiam tincidunt blandit dui at venenatis. Nullam viverra tincidunt diam eget lacinia. Fusce hendrerit arcu nisi, euismod tincidunt eros blandit non. Fusce vehicula est a lorem ornare, id ultrices metus tempor. Aenean in sollicitudin felis.
60+
61+ Nunc euismod dolor erat, sit amet maximus quam blandit nec. Sed mollis placerat facilisis. Donec placerat eget lectus non egestas. In hac habitasse platea dictumst. Nullam vitae molestie justo, vitae convallis massa. Pellentesque quis magna sit amet est consequat vestibulum sed vestibulum tellus. Cras pharetra mi efficitur libero rutrum blandit. Vivamus eu orci ut diam pellentesque scelerisque. In dignissim malesuada risus. Phasellus eu scelerisque justo. Morbi nunc mi, tempus eu tempor sit amet, feugiat quis elit.
62+
63+ Nunc iaculis consectetur lectus, non placerat eros. Praesent sed tellus magna. Fusce in dui mattis, auctor turpis ut, condimentum metus. Duis nibh elit, euismod nec tellus quis, pulvinar consectetur nisl. Quisque laoreet, urna ut pharetra vehicula, erat dolor molestie lorem, ornare porta enim lacus ac massa. Donec volutpat dignissim mi. Nam in imperdiet lectus. Morbi quis varius risus. In ut fermentum elit. In hac habitasse platea dictumst. Duis gravida, nisl at consectetur hendrerit, risus diam porta nisi, dignissim gravida libero urna sit amet diam. Nunc orci felis, tincidunt in turpis quis, varius molestie ex. Praesent dapibus ipsum quis velit cursus, a vehicula orci mattis. In bibendum convallis lorem nec maximus. Praesent erat libero, accumsan vitae semper at, ultrices ornare urna. Sed interdum ex vitae lectus tempus, sit amet imperdiet elit blandit.
64+
65+ Nulla rhoncus dolor in ex porttitor, sit amet scelerisque risus sollicitudin. Orci varius natoque penatibus et magnis dis parturient montes, nascetur ridiculus mus. Sed a orci quis diam vehicula pellentesque at molestie risus. Vivamus sollicitudin urna ex, at porta elit blandit sed. Pellentesque malesuada hendrerit diam porttitor ultricies. Suspendisse lobortis, diam non dapibus pulvinar, dui mi sodales quam, in vulputate nibh urna sit amet felis. Mauris sit amet tempor tortor. Ut viverra varius erat, pretium efficitur enim tempor vel.
66+
67+ Sed et mi at neque ornare aliquet ac id risus. Pellentesque auctor varius hendrerit. Vestibulum rhoncus, magna id dapibus dapibus, eros nisl blandit lacus, id suscipit odio leo eget lorem. Lorem ipsum dolor sit amet, consectetur adipiscing elit. Maecenas mauris mi, volutpat id felis sit amet, condimentum venenatis ligula. Vivamus vitae ligula aliquet diam viverra dignissim eget vitae dolor. Fusce gravida tincidunt volutpat. Nulla hendrerit lectus in justo tincidunt, ac scelerisque lorem ultricies. Sed varius iaculis ipsum at maximus.
68+
69+ Nulla facilisi. Curabitur et ullamcorper turpis, vitae venenatis tortor. Fusce elementum in nulla vitae tempus. Nam malesuada, nulla quis molestie fermentum, quam sapien vestibulum neque, nec posuere metus nisl semper turpis. Vestibulum semper euismod pretium. Aenean mattis scelerisque pulvinar. Duis pharetra ex ut sem pretium, ut tempus ipsum bibendum. Ut id ligula eu neque suscipit accumsan et non libero. Nulla non ante ligula. Vivamus a posuere justo. Interdum et malesuada fames ac ante ipsum primis in faucibus. Donec ut sollicitudin lectus, in finibus libero. Morbi tempor turpis at metus porta pulvinar.
70+
71+ Donec sollicitudin posuere turpis, sagittis finibus sapien vestibulum finibus. Suspendisse gravida, quam non faucibus dictum, risus ex vulputate nunc, non viverra ipsum leo ut orci. Pellentesque pellentesque vehicula vulputate. Nullam sagittis quis justo et dignissim. Nulla sodales erat nec malesuada malesuada. Phasellus tincidunt tincidunt tincidunt. Nunc malesuada sem ut lectus elementum, non pulvinar augue porta. Proin ultrices sem ut maximus ultricies.
72+
73+ Sed id luctus massa. Ut elementum erat sed sem euismod viverra. Aenean a libero suscipit, facilisis tellus vitae, egestas lectus. Nunc eget maximus purus, vel varius leo. Suspendisse dui felis, aliquet ut ullamcorper sed, ultrices at purus. Pellentesque luctus odio feugiat hendrerit consectetur. Quisque auctor lobortis sem. Sed arcu odio, fringilla sit amet ipsum et, dapibus maximus risus. Aenean malesuada turpis nec aliquet commodo. Morbi mauris nisi, porttitor et sapien vitae, interdum sollicitudin purus. Aliquam at magna ac quam viverra venenatis sit amet ut velit. Aenean accumsan lorem vel nisi tempor condimentum. Nunc elementum ligula ac placerat viverra. Cras et quam in ligula vestibulum finibus sed nec purus. In a accumsan dui. Donec urna neque, venenatis nec nibh mattis, semper convallis orci.
74+
75+ Maecenas luctus pretium ultrices. Donec rutrum nisi vel augue placerat, vitae laoreet velit vehicula. Suspendisse potenti. Quisque posuere congue metus eu viverra. Etiam lacus ante, ullamcorper vitae consectetur sit amet, elementum sit amet risus. Nulla tempus nisi in arcu eleifend rhoncus. Proin elit risus, ultrices eu dui sit amet, dictum finibus dolor. Nunc faucibus sagittis est, eget tempor dui congue ac. Mauris dictum mollis dolor eget gravida. Duis pharetra sed quam non tempor. Ut elementum nisl vel commodo dictum. Quisque velit urna, eleifend sit amet interdum at, interdum in ante. Duis sed elit mauris. In finibus ipsum nec aliquam venenatis. Sed enim mi, gravida et fringilla vel, viverra ut mi. Maecenas est leo, viverra ut interdum ac, viverra ut est.
76+
77+ Cras faucibus tempor consequat. Donec bibendum magna augue, sed faucibus ex semper vel. Nullam sit amet sem enim. Nunc tincidunt, lectus nec blandit rutrum, mi dui mattis ligula, et interdum massa libero in urna. Curabitur in elit viverra, hendrerit enim quis, finibus turpis. Ut euismod efficitur iaculis. Nunc mauris metus, condimentum ac posuere ac, vehicula eget est. Maecenas tincidunt eget leo vel tempus.
78+
79+ Nam porta nulla et sapien ultricies facilisis. Fusce sed rutrum ligula, scelerisque interdum mauris. Sed feugiat venenatis nibh, vitae interdum purus sodales pharetra. Praesent commodo ultricies laoreet. Donec efficitur porta massa sit amet ullamcorper. Nulla consequat ante nec consequat aliquet. Ut vel rutrum turpis, eu mattis lacus. Donec dapibus fringilla nunc, dictum porttitor risus scelerisque et. Vivamus vitae lorem commodo, laoreet risus a, cursus diam. Pellentesque habitant morbi tristique senectus et netus et malesuada fames ac turpis egestas.
80+
81+ Vivamus consequat libero venenatis, aliquet felis nec, gravida arcu. Donec iaculis elit massa, in mattis leo lobortis quis. Nunc id tellus egestas, posuere felis nec, dapibus massa. Integer sagittis sem et nulla sagittis, non dapibus odio aliquam. Proin vitae dolor lacus. Maecenas porttitor nisl ut leo eleifend, sed fermentum lorem iaculis. Donec diam lectus, aliquam in commodo et, sodales nec nunc. Vivamus imperdiet ante non porttitor ullamcorper. Donec vestibulum velit ut sapien pharetra porta.
82+
83+ Ut tempus, enim vel aliquet convallis, eros magna interdum nisi, vel fermentum sem lorem eget magna. Nulla eu sapien id augue ornare vestibulum. Curabitur a mollis turpis, eu fringilla quam. Cras congue lorem eget mauris finibus cursus eu sit amet nisi. Sed ante tellus, molestie id velit ut, congue aliquam lacus. Mauris ultrices leo a enim porttitor, ut rutrum mauris feugiat. Vivamus volutpat, quam eget accumsan cursus, diam ante luctus nibh, ut aliquet nisl mauris at enim. Phasellus purus ex, scelerisque vel quam in, facilisis sollicitudin augue.
84+
85+ Morbi faucibus ut nisi eu facilisis. Donec congue sapien eget felis interdum fringilla. Duis eget magna hendrerit, varius velit eu, accumsan augue. Vestibulum massa nibh, pulvinar ac facilisis a, ultrices ac arcu. Suspendisse fermentum et lorem et euismod. Sed auctor purus justo, id malesuada lacus vehicula nec. Phasellus venenatis nulla eu lacus finibus, sed auctor dolor dapibus. Mauris sollicitudin augue mi, sed viverra dolor imperdiet sed. Nulla facilisi. Pellentesque placerat aliquet erat nec pellentesque. Curabitur accumsan ultricies pharetra.
86+
87+ Aliquam eget lobortis velit, a sollicitudin urna. Etiam eget nunc fermentum, pellentesque velit non, commodo nulla. Cras ultrices sapien purus, ut sagittis orci viverra at. Nulla sed auctor neque, quis pulvinar leo. Nulla ut tempus nunc, in condimentum justo. Morbi pretium fermentum quam ac luctus. Duis eu faucibus enim. Duis imperdiet eleifend ante, nec egestas elit posuere vel. Morbi varius porttitor urna quis ullamcorper. In sapien velit, sagittis eu vestibulum sed, faucibus a elit. Praesent eros mi, vestibulum vel est eget, egestas luctus mauris. Morbi fringilla sapien ut purus auctor laoreet.
88+
89+ Mauris dapibus nisl lacus, sit amet malesuada enim molestie non. Pellentesque feugiat tempor nisi vel vehicula. Sed congue ultrices condimentum. Nulla eget urna laoreet, dictum mauris ac, consequat nisi. Class aptent taciti sociosqu ad litora torquent per conubia nostra, per inceptos himenaeos. Curabitur tempus ante et ex elementum vestibulum. In sit amet nunc quis dui gravida auctor congue non dui. Vestibulum varius vehicula risus sit amet posuere. Morbi a urna volutpat, varius augue sed, sollicitudin diam. In pulvinar felis quis tellus scelerisque, ut dictum turpis placerat. Nunc nunc ligula, cursus a sagittis at, tristique vel ligula. Ut lorem arcu, fringilla vitae molestie nec, dignissim et elit. Praesent commodo, nibh ut semper dapibus, ligula velit maximus lorem, at dapibus ante turpis viverra felis. Etiam mollis mi enim, ac cursus tortor feugiat eu. Phasellus ut augue sit amet nunc vehicula varius.
90+
91+ Ut purus libero, tempor in diam quis, fringilla euismod dolor. Nullam vitae leo magna. Donec elementum eget ex non vestibulum. Praesent vitae consequat urna. Aenean sit amet vehicula lorem. Aliquam malesuada auctor suscipit. Phasellus rhoncus auctor erat. Nam cursus consectetur lacus.
92+
93+ Morbi velit nulla, maximus ac urna ut, finibus tincidunt orci. Sed blandit, nisi sit amet eleifend ultricies, sem justo rhoncus ipsum, eget lobortis enim sem a ante. Vestibulum faucibus sapien magna, nec eleifend eros fermentum sed. Praesent ante lacus, ornare non elementum egestas, porta eget mi. Aenean sit amet luctus erat. Sed dapibus, tortor feugiat viverra luctus, enim sem vestibulum quam, quis elementum nunc velit a nunc. Morbi faucibus pulvinar placerat. Cras vehicula tempor lobortis. Nulla sagittis lorem quis odio eleifend, nec ultricies odio rhoncus. Nunc euismod interdum leo in dignissim. Nullam a metus erat. Phasellus commodo tellus lacus, aliquet faucibus mi accumsan sed. Mauris ultrices sit amet libero in rhoncus. Duis at lectus non est blandit finibus eu id libero.
94+
95+ Donec iaculis ante ut neque dictum, id malesuada orci iaculis. Nunc semper venenatis arcu non consequat. Etiam consectetur arcu ac felis gravida elementum. Suspendisse potenti. Curabitur tortor libero, aliquam nec sem eu, maximus rhoncus augue. Phasellus placerat rhoncus ex, cursus tristique ex efficitur et. Mauris sagittis convallis mollis. Duis tristique vulputate felis, vel accumsan tellus hendrerit vel. Quisque sit amet justo vitae dui pellentesque ullamcorper. Morbi consectetur elit dolor, quis consequat tortor fringilla sit amet.
96+
97+ Praesent molestie ligula non euismod congue. Maecenas semper orci turpis, consectetur varius nisi fringilla a. Donec eget iaculis est, in fermentum augue. Nulla facilisi. In dapibus, nulla non aliquam placerat, tellus nulla commodo neque, eu fermentum augue nulla et magna. Proin auctor nunc fringilla ultricies efficitur. Suspendisse et eros a dolor pharetra semper. Donec sed elit vel odio sollicitudin dapibus vitae at felis. Aliquam sit amet aliquet elit.
98+
99+ Aliquam id quam id felis gravida facilisis quis et velit. Class aptent taciti sociosqu ad litora torquent per conubia nostra, per inceptos himenaeos. Nullam ultricies mauris ut erat sodales dignissim. Vivamus molestie justo et ante congue interdum. Pellentesque id dolor sagittis ex sollicitudin interdum. Donec dictum, quam in tristique volutpat, libero nibh commodo erat, id porttitor diam ante vitae nunc. Donec ut finibus turpis, a luctus lorem.
100+
101+ Donec et elit ut lorem tincidunt maximus id porttitor arcu. Mauris pharetra lacinia dignissim. Aliquam vel rutrum libero. Nam vehicula, nibh et ullamcorper pulvinar, leo nunc dapibus quam, et mattis purus lorem id diam. In ut venenatis felis. Suspendisse et tempor nulla. Sed finibus pretium nisi quis molestie. In hac habitasse platea dictumst. Nunc accumsan egestas dui, nec suscipit turpis efficitur sed. Mauris dapibus nisl nec eros maximus sollicitudin. Curabitur eget tincidunt ligula. Vivamus in maximus odio.
102+
103+ Pellentesque habitant morbi tristique senectus et netus et malesuada fames ac turpis egestas. Aliquam erat volutpat. Donec et auctor ante. Fusce et ullamcorper risus, nec ullamcorper risus. Vestibulum id iaculis tellus. Quisque a ultricies neque, id viverra quam. Ut est nunc, finibus id leo sed, sodales viverra magna. Proin sit amet purus tellus. Nullam at viverra massa, in gravida justo. In hac habitasse platea dictumst. Mauris orci ligula, porta sit amet est vel, faucibus ullamcorper magna. Nunc eget convallis dui, et faucibus mi. Aliquam erat volutpat. Maecenas mattis mollis mauris in dictum. Suspendisse potenti.
104+ </div>
105+ )
106+}
components/Markdown.jsnew file+38
@@ -0,0 +1,38 @@
1+import markdownStyles from "../styles/markdown.module.css";
2+import unified from "unified";
3+import parse from "remark-parse";
4+import remark2react from "remark-react";
5+
6+function P({ children }) {
7+ return <p className="leading-snug">{children}</p>;
8+}
9+
10+// img is wrapped in figure so that images can be extra wide in the blog posts
11+function Img({ src, children }) {
12+ return (
13+ <figure>
14+ <img src={src}>{children}</img>
15+ </figure>
16+ );
17+}
18+
19+const options = {
20+ remarkReactComponents: {
21+ img: Img,
22+ // p: P,
23+ },
24+};
25+
26+// Converts markdown strings into markdown HTML/React components
27+export default function Markdown({ post }) {
28+ return (
29+ <div className={markdownStyles["markdown"]}>
30+ {
31+ unified()
32+ .use(parse)
33+ .use(remark2react, options)
34+ .processSync(post.content).result
35+ }
36+ </div>
37+ );
38+}
components/NewletterSignup.jsnew file+38
@@ -0,0 +1,38 @@
1+export default function NewsletterSignup(props) {
2+ return (
3+ <form
4+ action="https://urbit.us11.list-manage.com/subscribe/post?u=972a03db9e0c6c25bb58de8c8&amp;amp;id=be143888d2"
5+ method="post"
6+ id="mc-embedded-subscribe-form"
7+ name="mc-embedded-subscribe-form"
8+ className="validate form max-w-screen-sm"
9+ target="_blank"
10+ novalidate
11+ >
12+ <div className="input-group" id="mc_embed_signup_scroll">
13+ <div className="mc-field-group w-full relative">
14+ <input
15+ className={`text-gray type-ui black border-${
16+ props.color || "green"
17+ } border-4 px-3 w-full mb-2 h-16 rounded-xl`}
18+ type="email"
19+ name="EMAIL"
20+ id="mce-EMAIL"
21+ placeholder="your@email.com"
22+ />
23+ <div className="flex h-16 items-center justify-center absolute top-0 right-6">
24+ <button
25+ id="mc-embedded-subscribe"
26+ className="type-ui text-gray bg-transparent"
27+ type="submit"
28+ name="subscribe"
29+ >
30+ {/* onClick={() => _paq.push(['trackEvent', 'Mailing List', 'Subscribe'])}> */}
31+ Sign Up
32+ </button>
33+ </div>
34+ </div>
35+ </div>
36+ </form>
37+ );
38+}
components/PostPreview.jsnew file+26
@@ -0,0 +1,26 @@
1+import Link from "next/link";
2+import BackgroundImage from "./BackgroundImage";
3+import { formatDate } from "../lib/lib";
4+
5+export default function PostPreview(props) {
6+ return (
7+ <div className={`cursor-pointer ${props.className}`}>
8+ {props.title ? <h3 className="mb-2">{props.title}</h3> : null}
9+
10+ <Link href={`/blog/ ${props.post.slug}`} key={`post-${props.post.slug}`}>
11+ <div>
12+ <BackgroundImage
13+ className="w-full h-80 rounded-lg"
14+ src={props.post.extra.image || ""}
15+ />
16+ <p className="text-black mt-2">{props.post.title}</p>
17+ <p className="text-gray">{formatDate(new Date(props.post.date))}</p>
18+ </div>
19+ </Link>
20+ </div>
21+ );
22+}
23+
24+PostPreview.defaultProps = {
25+ className: "",
26+};
components/SingleColumn.jsnew file+8
@@ -0,0 +1,8 @@
1+// Provides a limited-width column with all children center-aligned along the vertical axis
2+export default function SingleColumn({children}) {
3+ return (
4+ <div className='flex flex-col w-full items-center max-w-screen-xl'>
5+ {children}
6+ </div>
7+ )
8+ }
components/TabCarousel.jsnew file+9
@@ -0,0 +1,9 @@
1+// Given multiple children, returns only 1 to be rendered based on props.index
2+export default function TabCarousel(props) {
3+ if (props.children) {
4+ if (props.children[props.index]) {
5+ return props.children[props.index]
6+ }
7+ }
8+ return null
9+}
content/Bitcoin-wallet.mdnew file+53
@@ -0,0 +1,53 @@
1++++
2+title = "Bitcoin Wallet Disclaimers"
3++++
4+
5+
6+
7+The latest Urbit release includes a native Bitcoin wallet. Please read the following security recommendations and disclaimers carefully. Urbit.org cannot recover any lost keys.
8+
9+
10+
11+### Verify
12+
13+You should verify your version of this Bitcoin wallet. To do so, follow the instructions in the README in our [Github](https://github.com/urbit/urbit/blob/master/pkg/btc-wallet/README.md) repo.
14+
15+Instructions reproduced here:
16+
17+To verify your version of the bitcoin wallet, run the following command in the dojo:
18+`> +btc-wallet-check`
19+It should return with the following hash:
20+`0v9t022.n8kv1.5emkt.s2p9i.hvsa9`
21+
22+
23+### Statement
24+
25+The Urbit Bitcoin Wallet and its related components are experimental pieces of software. You are free to review the open-source code before using:
26+- [Wallet](https://github.com/urbit/urbit/tree/master/pkg/btc-wallet)
27+- [Full Node Provider Agents](https://github.com/timlucmiptev/btc-agents)
28+
29+No guarantees are made about the security of this software. It may contain vulnerabilities that could lead to loss of funds. This wallet software has not had a formal security audit. 
30+
31+You can read about the security audit for Urbit's networking protocol in this [post](https://urbit.org/blog/security-audit/). This audit does not encompass the wallet, except to the extent that the wallet operates on Urbit's networking architecture.
32+
33+If you decide to use this wallet, please store responsible amounts of Bitcoin, and use best security practices. The developers of this software cannot help you recover your keys / funds, if lost. 
34+
35+
36+### License
37+
38+With the exception of its external dependencies, this software is a component of Urbit, and is released under Urbit's MIT License, reproduced below.  [View Original](https://raw.githubusercontent.com/urbit/urbit/master/LICENSE.txt)
39+
40+The MIT License (MIT)
41+
42+Copyright (c) 2015 Urbit
43+
44+Permission is hereby granted, free of charge, to any person obtaining a copy
45+of this software and associated documentation files (the "Software"), to deal
46+in the Software without restriction, including without limitation the rights
47+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
48+copies of the Software, and to permit persons to whom the Software is
49+furnished to do so, subject to the following conditions:
50+
51+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
52+
53+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
content/_index.mdnew file+3
@@ -0,0 +1,3 @@
1++++
2+title = "Home"
3++++
content/blog/2019-10-3-roadmap.mdnew file+111
@@ -0,0 +1,111 @@
1++++
2+title = "~2019.10 Roadmap"
3+date = 2019-10-03
4+description = "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"]
6+[extra]
7+author = "Galen Wolfe-Pauly"
8+ship = "~ravmel-ropdyl"
9+image = "https://media.urbit.org/site/posts/essays/2019-10-3-roadmap.jpg"
10++++
11+
12+![](https://media.urbit.org/site/posts/essays/2019-10-3-roadmap.jpg)
13+
14+The daily work of building a new OS from scratch is so engaging and exciting that we habitually forget to even take stock of what we’ve accomplished. We’re fixated on the prospect of moving the world on to Urbit, starting with ourselves.
15+
16+It’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.
17+
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.
19+
20+## Identity (Azimuth)
21+
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.
23+
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.
25+
26+Getting 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.
27+
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.
29+
30+We 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).
31+
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.
33+
34+**Q4 2019**
35+
36+- Release Bridge to the public
37+- Get Bridge working well on mobile
38+- Add payments support, hopefully including BTC
39+- Add a network explorer
40+
41+**Q1 2020**
42+
43+- Integrate Bridge with a native app for Arvo
44+
45+
46+## OS (Arvo)
47+
48+As 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.
49+
50+The frustration that we can’t move onto Urbit today propels us forward. The system saw major updates over the past few months all the way through the stack. On the Arvo side, we divide our work into Infrastructure (everything in the kernel and interpreter) and Interface (everything in userspace and the front-end). We’ll start with Infrastructure progress first.
51+
52+We’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.
53+
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.
55+
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.
57+
58+### Landscape (Arvo UI)
59+
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.
61+
62+This 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.
63+
64+In moving to this new model we decided to narrow our focus to desktop only for now. We’ll return to mobile again next year — but first we want to get the desktop experience right. We’ve pulled the iOS app from the app store for the time being. I’m personally sad to see it go, since I enjoyed using it. But our prior iteration of Landscape just wasn’t quite right.
65+
66+This version of Landscape is, I think, the last one that we’ll call a prototype. Over the past few weeks, since shipping this, some amazing work has been happening on the interface front. We have a systematic approach to building interfaces on top of Urbit that’s very promising, albeit just getting started. We’ve already put out [one post](https://urbit.org/posts/landscape-a-portrait/) about Landscape's future, with more posts to come.
67+
68+**Q4 2019**
69+
70+- Improved Arvo-level error handling
71+- Implementation plan for ‘telescoping kelvins’ — or [how we plan to future proof Arvo](https://groups.google.com/a/urbit.org/forum/#!topic/dev/6Mwn6TQFVwc)
72+- Versioning scheme between Arvo and Vere
73+- A new Haskell implementation of the daemon
74+- A native client (instead of just a browser tab)
75+- A [new user-space architecture](https://docs.google.com/document/d/1hS_UuResG1S4j49_H-aSshoTOROKBnGoJAaRgOipf54/edit)
76+- Hoon.hoon that’s OTA upgradeable
77+- Working Jacque prototype, a graal-truffle-based implementation of vere
78+
79+**Q1 2020**
80+
81+- Integrated client with Bridge and Arvo
82+- New interface framework, codenamed ‘Widescreen’
83+
84+
85+## Docs + Community
86+
87+We 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.
88+
89+Hoon 101 started with students with little to no programming experience. Hoon 201, which is just getting underway, covers more advanced topics. We’re quite curious to see what comes out of it.
90+
91+We’re also adding features to Landscape to make it more amenable to use by Hoon Schoolers. Good examples include code evaluation within Chat (for office hours), and the ability to pin posts in Publish. The next crop of Hoon learners will be able to use Urbit to learn about Urbit.
92+
93+Aside from Hoon School we’re always updating our documentation. Most notably, we added search to the docs (finally). This was a much needed feature that makes the docs much more usable.
94+
95+We also launched our [grants program](https://grants.urbit.org/) quietly, but all of our available bounties were quickly claimed nonetheless. We’re ready to give away more address space to contributors and are excited by how quickly people got involved.
96+
97+We also did some experimentation with holding events on Arvo. We held weekly AMAs for while, and hosted a few meetings with the community. With the new UI out, our public channels have been a lot more active. We’ll surely be holding more on-urbit events in the future — but for the time being the conversation in urbit-help is a lot of fun.
98+
99+**Q4 2019**
100+
101+- Vane level documentation
102+- An active grant program
103+
104+
105+## urbit.org
106+
107+Urbit.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.
108+
109+We’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!
110+
111+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.mdnew file+102
@@ -0,0 +1,102 @@
1++++
2+title = "~2019.5 Roadmap"
3+date = 2019-05-16
4+description = "Where we are and where we're going as of mid-2019."
5+aliases = ["/posts/essays/2019-5-roadmap", "/posts/2019-5-roadmap"]
6+[extra]
7+author = "Galen Wolfe-Pauly"
8+ship = "~ravmel-ropdyl"
9+image = "https://media.urbit.org/site/posts/essays/2019-5-roadmap-1.png"
10++++
11+
12+![](https://media.urbit.org/site/posts/essays/2019-5-roadmap-1.png)
13+
14+We often get so busy that we forget to tell you what we’ve been up to. Here’s an update on what we’re doing and where we’re headed with each layer of the stack.
15+
16+At a very high level we have two goals for 2019: make Azimuth easier to use, and get Arvo to a 1.0.
17+
18+Next year we’ll begin to move away from some of the MEGACORP software we use in the office, and replace it with our own tooling. There’s some exciting work happening in that department, but we’ll cover that in a future post.
19+
20+For some related recent thinking on all of this, see [The 100 Year Computer](/posts/essays/the-100-year-computer/), [The State of Landscape](/posts/essays/the-state-of-landscape/) and [Azimuth as MultiPass](/posts/essays/azimuth-as-multipass/).
21+
22+For now, let’s just look at what’s on the immediate horizon:
23+
24+## Azimuth
25+
26+At lunch the other day someone on our team said something like, ‘We built a complete and working public key infrastructure, but we haven’t told anyone.’
27+
28+It’s true. Azimuth is operational, secure, and well tested. It’s a pretty cool piece of technology and it’s out there in the world for anyone to use. It also doesn’t require that you use Arvo — Arvo happens to make use of Azimuth, but Azimuth itself is a completely separate system.
29+
30+So the question is why haven’t we told the world about it?
31+
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+
34+That’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.
35+
36+Here’s what we’re building first:
37+
38+### Q2 2019
39+
40+- A simplified onboarding flow for getting an Azimuth point that’s simple to share with friends over email, text or as a URL.
41+- A redesigned and improved Bridge for managing your points.
42+- An interface that allows you to easily send money between Azimuth points without running Arvo.
43+
44+### Q3 2019
45+
46+- Expanded Azimuth-centric example modules, documentation and developer tooling.
47+
48+Still under consideration:
49+
50+- An OAuth server or JWT flow for logging into any service with an Azimuth point.
51+- A mobile app for point to point payments using Azimuth.
52+
53+### 2020
54+
55+Azimuth is beginning to feel like [multipass](/posts/essays/azimuth-as-multipass/), with a variety of ways to use Azimuth points without ever booting Arvo
56+
57+## Arvo
58+
59+The Arvo interface has always been held back by Arvo’s technical immaturity. This is still true to some degree. The system has not stabilized completely.
60+
61+But! We’ve been using Landscape quite a lot lately. I use it daily, in fact — even [on my phone](https://itunes.apple.com/us/app/landscape-urbit/id1393148862). An encrypted (although not audited — so let’s not call it ‘secure’), authenticated chat where I own the keys and can read the source code feels really nice to use. The interface isn’t as good as we’d like, but it’s not bad. Landscape is a great preview of where we’re going: a simple, permanent, self-sovereign computer.
62+
63+There are still rough edges, and Landscape is not nearly general purpose enough, but we have plans:
64+
65+### Q2 2019
66+
67+- A new update to the Arvo interface that we’re calling Modulo. Modulo expands beyond chat and longform discussion to make your Arvo interface feel much more like the computer it actually is.
68+- Upgrades to our event persistence, networking, and DNS integration aimed at much better stability. Arvo instances don’t crash that often, but with these changes it should be very rare.
69+- Significant improvements to testing with a new simulation testing framework and integration testing pipelines.
70+
71+### Q3 2019
72+
73+- A significant overhaul to Gall, our application model, making it much simpler for users to write apps or ‘agents’ in Arvo.
74+- A new version of the compiler that makes us less reliant on jets. This will eliminate a major obstacle to achieving network continuity, or the ability for ships to upgrade themselves totally over-the-air, forever.
75+- A significant overhaul and stability update to Clay, our filesystem, making it possible for us to trust it for self-hosting, search it easily, and depend on it for long-term data storage.
76+- Tooling for hosting and hopefully a beta program for hosted Arvo instances run by Tlon.
77+
78+### 2020
79+
80+- A completely overhauled Arvo interface, Daigo, with a complete but simple set of messaging and collaboration tools. Modulo is meant to be fun to experiment with, but we aim to make Daigo part of our daily workflow.
81+- We come to work every day, use Arvo, go home.
82+
83+## Community
84+
85+We’ve often felt like it was far too early to invite others in to the system.
86+
87+As long as we’re up front about the state of this 100 year computer -- that it’s live, but incomplete — I think it’s a good thing to welcome people on board. There’s plenty to play with, experiment with and explore.
88+
89+Hoon school was the first effort in this direction. We intend to do a lot more:
90+
91+### Q2 2019
92+
93+- Scaling Hoon school up to include both a track for experts and for beginners, and allowing many more participants.
94+- Holding more meetings and events on Landscape, experimenting with Arvo-native discussion.
95+- A clear program for address space grants for developers + contributors.
96+- New documentation site with searchable library docs.
97+
98+### Q3 2019
99+
100+- Hoon School participants understand clearly how to build a Modulo agent, and invite others into it.
101+- The road toward building an Azimuth module is well understood, paved, and clear.
102+- We have clear instructions and tutorials for building Azimuth modules and using Azimuth as a login or reputation primitive.
content/blog/2020-to-2021.mdnew file+49
@@ -0,0 +1,49 @@
1++++
2+title = "2020 -> 2021"
3+description = "Reflecting and looking forward."
4+date = 2021-01-21
5+[extra]
6+author = "Josh Lehman"
7+ship = "~wolref-podlex"
8+image = "https://media.urbit.org/site/posts/essays/arch-sunrise-2.jpeg"
9++++
10+
11+<br>
12+
13+![arch](https://media.urbit.org/site/posts/essays/arch-sunrise-2.jpeg)
14+
15+<br>
16+
17+In this post, which has been adapted from our most recent [newsletter](https://urbit.us11.list-manage.com/subscribe/post?u=972a03db9e0c6c25bb58de8c8&id=be143888d2), we'll take a moment to reflect on the events of the last year, and then turn our attention to the next one.
18+
19+## 2020
20+
21+In spite of the many challenges presented over the last year, it was a resoundingly good one for Urbit.
22+
23+It seems like a long time ago now that the folks at Tlon rolled out OS1 (now called Landscape), just as the pandemic forced everyone into their homes throughout the world. At the time, [Urbit is for Communities"](https://urbit.org/blog/urbit-is-for-communities/) was just a vision, but now it’s been transformed into reality—there are more thriving communities in Landscape than any of us can keep track of, with new faces popping onto the network on a daily basis.
24+
25+Landscape brought many new ships onto the network which helped identify those areas in which Urbit’s infrastructure could be most improved. [Ford Fusion](https://urbit.org/blog/ford-fusion/) eliminated the possibility of a partially-applied over-the-air (OTA) update through a drastic reduction in the size and complexity of the codebase. The efficiency of the OTA process was improved by several orders of magnitude, and many long-standing memory issues were resolved. Now we deploy code on our infrastructure nodes and see users receive an update, over a decentralized network, often in less than a minute.
26+
27+After improving the stability of the system Tlon turned its attention to bringing more ships onto the network. A long-standing barrier to Urbit’s adoption has been the technical knowledge required to host one’s own ship—this prompted Tlon to build and launch an Urbit [hosting service](https://tlon.io), the waitlist for which is now thousands deep.
28+
29+With Tlon becoming more singularly focused on building products on Urbit, concrete steps have been taken towards making urbit.org a separate organization that’s focused on long-term development of Urbit’s platform. I joined to [lead that effort](https://urbit.org/blog/first-steps-towards-urbit-org/) back in August and have since spent the majority of my time working with dozens of contributors on projects spanning documentation, education, external integrations, and much more.
30+
31+We rounded out the year with a full network reset (called a “continuity breach”), which has in the past has been synonymous with loss of all data on the network. This time things went differently: tooling was made available to the community that allowed ships to preserve their data, which enabled most to seamlessly rejoin post-reset. This is a significant milestone for the project as it signifies not only a commitment to technical excellence, but to supporting our budding community.
32+
33+## 2021
34+
35+In the last three weeks we’ve seen a huge amount of inbound interest as people are waking up to the inherent problems with using centralized services run by MEGACORPs—we’re just happy we started working on Urbit all those years ago. While we tend to not plan more than about six months in advance, I can still talk at a high level about what urbit.org will be focusing on in the immediate future.
36+
37+Growth in Urbit’s developer community has been growing organically in lockstep with the overall network growth. This means, happily, that there’s a pretty large pool of people eager to contribute to Urbit. The priority for urbit.org, therefore, is to improve its capacity to effectively assist contributors. In broad strokes, this means:
38+
39+- Rework urbit.org to better help developers learn how to contribute to Urbit
40+- Since Urbit is ready to build on top of, provide practical guides that demonstrate how to do so
41+- Guide developers to make high-value contributions to Urbit and its ecosystem
42+- Build community amongst contributors
43+
44+My 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.
45+
46+
47+2021 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.
48+
49+See you on the network!
content/blog/20200929-state-of-urbit.mdnew file+79
@@ -0,0 +1,79 @@
1++++
2+title = "Late 2020 Progress Update: OS 1 -> OS 1.N"
3+date = 2020-09-29
4+description = "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+[extra]
6+author = "Galen Wolfe-Pauly"
7+ship = "~ravmel-ropdyl"
8+image ="https://storage.googleapis.com/media.urbit.org/site/posts/essays/state-of-urbit-1.jpg"
9++++
10+
11+<br>
12+
13+![Grassy Knoll](https://storage.googleapis.com/media.urbit.org/site/posts/essays/state-of-urbit-1.jpg)
14+
15+<br>
16+
17+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. 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.
18+
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+
21+In 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.
22+
23+All of the sudden, it’s Fall. We never found the time to name any of our releases or write announcements. We’ve just been making the system better in every way we can find. We’ve got a lot of exciting things planned for the last few months of the year — but I wanted to recap the progress we’ve made for those following along from the outside. If you haven’t been on the network, it’d be impossible to see.
24+
25+The tl;dr is that Urbit is much faster, more reliable, and nicer to use than it was six months ago. Things have gotten much better, across the board. We threw ourselves into OS 1 admittedly underprepared, but we’ve learned a lot and matured the system a lot along the way.
26+
27+Anyway, 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.
28+
29+
30+### Infrastructure
31+
32+![Debugging Interface](https://storage.googleapis.com/media.urbit.org/site/posts/essays/state-of-urbit-2.png)
33+
34+In April, Urbit was slow, fragile, and didn’t always update itself properly. We made enormous progress on all of these.
35+
36+First off, Urbit is about 10x faster for most users. With some careful debugging, we were able to locate a few really [high](https://github.com/urbit/urbit/pull/3029) [impact](https://github.com/urbit/urbit/pull/3054) [improvements](https://twitter.com/pcmonk/status/1276327036722704385). There’s still performance work to do, but the effects of this work are widespread. Boot times are faster, local compute is faster, the network is faster. It’s a huge improvement.
37+
38+Second, we got our memory usage under control. Urbit still uses a 2GB memory arena. If the state of your Urbit grows to over 2GB things, uh, fall apart. This used to happen regularly, and now it’s pretty much unheard of. We implemented [tooling](https://github.com/urbit/urbit/pull/3235) to compact and deduplicate the memory image when it’s growing too large. We brought the memory usage of the compiler [down ~90%](https://github.com/urbit/urbit/pull/3041). There are areas where we can be more disciplined about how we use memory, but this is more or less a solved problem for the near term.
39+
40+Third, we implemented a completely new build system. Well, we actually [got rid of the build system](https://urbit.org/blog/ford-fusion/) altogether and [made it a part of the filesystem](https://github.com/urbit/urbit/pull/3060). This made it possible for us to fix our over the air (OTA) updates and make them both fast and reliable. In April, an OTA could bring down your node and would take hours or even days to apply. Today, we regularly deploy OTAs with no fear of them breaking any nodes — they often go from galaxy → planet in a minute or less.
41+
42+We also rewrote a large part of our runtime in Haskell and made overall progress on [network scaling](https://github.com/urbit/urbit/pull/3174). And: we implemented a [principled approach](https://github.com/urbit/urbit/pull/2366) to [error handling](https://github.com/urbit/urbit/pull/3064), making nodes much less likely to become unrecoverable.
43+
44+The 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.
45+
46+
47+### Interface
48+
49+![](https://storage.googleapis.com/media.urbit.org/site/posts/essays/state-of-urbit-3.jpg)
50+
51+When we shipped OS 1 it was a bunch of separate pages (that were slow to load), all with separate ways of storing and processing data. Our interface work over the past six months is all about unification and simplification.
52+
53+First, we pulled OS 1 together as a [single page app](https://github.com/urbit/urbit/pull/3025). Using OS 1 involves a good amount of moving around and refreshing the page each time was pretty painful. Now it’s snappy to move between pages and keep up with what’s going on. In tandem, we started using our own component library, [Indigo](https://github.com/urbit/indigo-react). This makes frontend development much cleaner and more efficient.
54+
55+Next, we unified the way we store data and compute. It used to be that each individual module (chat, publish, and links) used their own ‘agents’ to store and process data on the Urbit side. (An agent is the Urbit equivalent of a datastore + business logic.) With a lot of moving parts, this approach caused all kinds of synchronization challenges. Rather than a module-per-agent model we’ve started to move toward a type-of-data-per-agent model. The first of these is [graph store](https://github.com/urbit/urbit/pull/3110). We’re presently in the process of migrating all our modules to graph store.
56+
57+Those two are by far the most significant, but there’s so much more. We [rewrote](https://github.com/urbit/urbit/pull/2937) the `group-store`, allowing for different roles (admin, moderators, and so on) in a group. We shipped better debugging tools, automatic reconnection, a settings panel, and overall visual polish and refinement.
58+
59+![](https://storage.googleapis.com/media.urbit.org/site/posts/essays/state-of-urbit-4.jpg)
60+
61+And 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.
62+
63+
64+### Community + network
65+
66+![Fishing Village](https://storage.googleapis.com/media.urbit.org/site/posts/essays/state-of-urbit-5.png)
67+
68+Our primary goal with OS 1 was to get both Tlon and the Urbit Community living entirely on Urbit. We did that, and in doing so we’ve seen how nice it is to grow a community in a calm, non-invasive environment. We started doing regular [Urbit](https://twitter.com/urbit/status/1308875082312364048) [Dialogues](https://twitter.com/urbit/status/1304139629948329985) with friends and peers in the absence of physical meetups, which have been fun.
69+
70+Getting onto Urbit is still relatively challenging. By the standards of software you run yourself, it’s not so bad at all. But by comparison to ordinary consumer software, it’s way too hard. Tlon is [working on that](https://tlon.io) — but these last six months have been only for the brave. That is, those that want to host their own nodes.
71+
72+Turns 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.
73+
74+
75+### What’s next
76+
77+We’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.
78+
79+We’ll talk about some of this on [October 9th](https://www.meetup.com/urbit-sf/events/273439025/), and you can see a bit of what’s coming on [tlon.io](https://tlon.io) today. If you tried booting Urbit in April and it was tough, try again. We’re easy to find on the network, and we’d love to get reacquainted.
content/blog/20201119-models-of-society.mdnew file+77
@@ -0,0 +1,77 @@
1++++
2+title = "Models of Society"
3+description = "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
5+[extra]
6+author = "Tyler Shuster"
7+ship = "~radbur-sivmus"
8+image = "https://media.urbit.org/site/posts/essays/cochno-stone.png"
9++++
10+
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+
13+<hr>
14+
15+All people like to talk. Society is built by talking. In this&mdash;the year of our Lord two thousand and twenty&mdash;for many (maybe most) talking means typing on computers: handheld, laptop, or desktop. Computers can do all sorts of interesting things, like aid in designing buildings or simulate protein folding&mdash;fundamentally, a computer is a machine for doing math really fast. But computers can be networked, which turns them into tools for communication. Because society runs on talking and because computers enable us to do that, the most common thing that computers end up doing is to transmit human thoughts in text. Normal people call this writing, which is a kind of talking. Let’s call it messaging. When we think about building a good computer&mdash;and computer network&mdash;one that serves society in the best ways needs to do messaging well. Only a small percentage of people will regularly do anything else. (Urbit does serve those needs but I will leave that explanation to more capable minds.)
16+
17+## Modes of Messaging
18+
19+<br>
20+
21+![Ludovic Maclellan Mann examining the Cochno Stone](https://media.urbit.org/site/posts/essays/cochno-stone.png)
22+
23+<br>
24+
25+In general, technology serves humanity as a kind of appendage&mdash;instead of thinking new thoughts or acting on its own, it does what we command. Technology never creates new social structures&mdash;it merely makes existing ones easier, or it facilitates the creation of new ones. We use our tools to expand our capacities, and once we are capable of doing more, we can imagine new things to do. Inventing the wheel did not invent motorized transportation&mdash;but it did facilitate it and it was a necessary step, even an inspirational one. Similarly, the invention of writing made new forms of human interaction and new tools for organization possible.
26+
27+Consider the following conversational conventions, or modes of messaging: a letter; a dialogue; a book; a meeting; minutes of that meeting. These are each pieces of technology: finely constrained solutions to human problems. Now, we have digital forms of each of these which diverge variously from the original. A letter becomes an email. A dialogue becomes a chat room, or a series of blog posts, or a twitter spat. A book becomes a website or an ebook. Meetings in 2020 have virtually been replaced by their virtual counterparts. Minutes become recordings or transcripts.
28+
29+Although we do not have a clear picture of how humanity developed the technology of writing out of the basic capacity for speech, we can imagine that the computerization of writing has many parallels. It does not make the old tools obsolete, nor does it immediately introduce new social structures. It does create the potential, however. On the timeline of human existence, we have only had digitized text for a relatively short time. Because we want to understand how to best use these new forms, we should look at their underlying structure.
30+
31+In order to digitize messages well, computers need to reconcile two facts about all modes of messaging. They have:
32+
33+1. One basic shape, and
34+2. An infinite variety of forms.
35+
36+1 &mdash; The basic shape: all these modes have one common substance: human language. Any conversation is made of words. At first we only had spoken language. Then we discovered writing. Writing allows us to encode our words as glyphs to transmit them over time or distance. The internet extends this capacity. We called this "hypertext"&mdash;like good old fashioned text, but one level up. A staggering amount of messaging now takes place over this hypertext transfer protocol (http). In the process of digitizing language, we have learned the basic shape of a message. We can see this in how every social network shares messages in basically the same shape: an author, some content, references, an audience. We can confirm this basic shape by comparing it against our experience of the real world, and the previous comparison between speech and writing. Speech and writing both use the same substance, and take the same basic shape. They all have an author, content, references, and an audience.
37+
38+2 &mdash; Our experience of this one basic shape takes an infinite number of forms. The examples above (letter, meeting, &c) are just a few. These forms depend on the content of the message, the people involved, and the place they occur. All three aspects contribute significantly to its form, but the one that computerized messaging has not adequately compensated for is the place. Content depends only on the author and their intent. Getting certain people to view that content might be more difficult but most know how to use a computer. The place however, has not yet been adequately compensated for, and I think that has contributed seriously to our lack of civil and serious discourse over the internet. A president would not give an address in a bar, and a prospective lover would not utter his advances on stage. In writing, we can use the different physical forms to distinguish place. You shouldn’t read a book by the pool. You might not read a letter in public. You wouldn’t put a billboard in your bedroom.
39+
40+Furthermore, it seems possible that in our eagerness to "connect the world," we focused injudiciously on creating communities around "interests." Evidence suggests that unless the interest has a highly refined focus, these communities devolve into pandering, self-reference, and exploitation. In this way, the internet is something like a convention of conventions, where you wander in a sea of foreigners loosely affiliated by interest and surrounded by advertising booths. In physical space, people do gather by interest but they also gather by physical proximity&mdash;they are grounded and bound in place.
41+
42+Having an indistinct sense of place makes the form of conversation ambiguous and the participants of the conversation disconnected. Consequently, people are unsure how to interact. One need only know the term "comments section" to understand that.
43+
44+## People in Places
45+
46+<br>
47+
48+![Halle Saale Marktplatz](https://media.urbit.org/site/posts/essays/halle-saale-marktplatz.jpg)
49+
50+<br>
51+
52+As the internet grew to accommodate new conversation forms using the basic substrate of hypertext, web developers began to conceive of "digital spaces" through analogy&mdash;chat "rooms" and "forums,” or the "silo" and the "walled garden." Today, most of our conversation takes place in these walled gardens&mdash;privately-owned places which may be beautiful on the inside, but inaccessible from elsewhere. While some of these walled gardens are very large, our conversation is essentially confined to them. There is no roaming from one space to another while keeping one’s identity. We create new identities for new spaces both because we must and because we are afraid of repercussions on one platform for what we say on another. This is because we do not own our identity; we merely have a key&mdash;our password. The owners of the walled garden still own the artifacts of our tenure there, and can revoke our access to them at any time.
53+
54+The concept of identity and the concept of place are fundamentally linked. We imagine the prince who travels overseas where no one knows his name, or we imagine the old prospect of traveling to a new world to make a fortune. While those both exemplify a dramatic change in identity and place, we usually want to keep our identity consistent. We want to be recognized by friends whichever place we go, and we all strive toward having a good reputation, which is a consistent identity across places. This consistent identity also allows control of that reputation per place. A man is not judged in public by the words he says among friends. And there is no way to search what someone has said except by asking him. With our current system of identity providers (an absurd term, but a real one), we surrender our rights to selectively expose our thoughts, regardless of the place they have been uttered. A data breach or a weak password might lay bare our most private thoughts. We run the real risk of being confronted by an old conversation presented out of context or after we have learned better.
55+
56+People need distinct spaces to form conversations in distinct modes, and they need to have a consistent identity that controls how public their words are.
57+
58+In theory, we would have a digital city with unique regions, public fora, and sovereign parcels, into which one person might travel at will. In practice, we see this pattern: an app emerges to facilitate a mode of conversation. It gains popularity. Facebook (or Google, or Microsoft) buys and absorbs it. As monolithic empires, they can use the same format for all their messages. This gives them a great amount of power. They use this power to create things like "Sign in with Facebook" (or Google, or Microsoft) that benefit the user by consolidating their identity, but fail to solve the underlying problem. Their problem is that in order to allow people to communicate using the current technology stack, they need to be in control of everything.
59+
60+## Urbis ec Bit
61+
62+
63+<br>
64+
65+![View of Florence from San Miniato](https://media.urbit.org/site/posts/essays/view-of-florence.jpg)
66+
67+<br>
68+
69+Urbit does solve this underlying problem. At this point the explanation goes so far down the stack that you could spend years tracing it all, but the relevant part is this: Urbit is not an empire; it’s a territory. An empire is an entangling of land and rule: within the bounds of said empire, you agree to be bound by its laws and the penalties for transgression. The laws exist at the whim of a despot or cabal. Your standing as a Roman citizen buys you no favors in Persia. In contrast, a territory imposes only physical laws. For example, in the desert, you will die faster. The only way to change that is to alter the desert. Urbit imposes nothing but the digital equivalent of physical laws. You have an identity which can be said to be truly yours, and you have a piece of software that runs on whatever computer you choose and can do anything you want with the messages sent to your identity. There are no social protocols enforced, because no one can control what software you run on your computer. As long as you agree to communicate using the same basic substrate, you can communicate with anyone using Urbit. This is the digital equivalent of speaking the same language. Whether or not others will accept you into their coalitions is not the technology's concern.
70+
71+In the same way that the land provides clay and timber, Urbit also provides the tools and material for building places both public and private. These include the aforementioned consistent message substrate (content), as well as tools for organizing people/audiences, structure for referencing other content, and an identity system that is owned only by you while being verified by all. The places are being built&mdash;private rooms with just a few people, meeting halls, club houses, huge public spaces, and countless personal encounters, the contents of which are known to none but the participants.
72+
73+The default tools work with messages in a few of the ways with which we've grown familiar: chat, direct messaging, publishing, link-sharing. They map onto existing forms of messaging because as I said earlier, the technology does not create new social structures; it just facilitates them. We have only seen the beginning of what the internet is capable of doing. Within a few decades it replaced the majority of letters, phone calls, and text dissemination&mdash;that was just the first phase of getting up to parity with what written text and speech could already do. In order to get to the next phase of creating new social processes, we need our technology to be organic and democratic, in the sense that everyone can participate and shape it. It needs to have a consensual foundation&mdash;a common substrate&mdash;and infinite possibility for expression. Urbit provides both of those.
74+
75+Similar 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.
76+
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.mdnew file+615
@@ -0,0 +1,615 @@
1++++
2+title = "A Founder's Farewell"
3+date = 2019-01-14
4+description = "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"]
6+[extra]
7+author = "Curtis Yarvin"
8+ship = "~sorreg-namtyv"
9+image = "https://storage.googleapis.com/media.urbit.org/site/posts/essays/farewell.png"
10++++
11+
12+![Curtis Yarvin portrait](https://storage.googleapis.com/media.urbit.org/site/posts/essays/farewell.png)
13+
14+After 17 years, I've left the Urbit project.
15+
16+I've resigned as CTO, board member, and voting shareholder of
17+Tlon (Urbit's corporate sponsor). I've also reassigned my
18+personal galaxies to urbit.org (Urbit's embryonic foundation,
19+still in Tlon's custody).
20+
21+My family still has a few thousand Urbit stars (in long timelock
22+contracts), plus a nonvoting minority in Tlon. This isn't
23+authority, just compensation: I have zero central power over
24+either Urbit or Tlon. Nor will I contribute code to Urbit, nor
25+write nor speak publicly about it. I am actually done here.
26+
27+From the very start, I knew Urbit could not succeed until it
28+ceased to be mine and became the world's. Urbit works; its PKI
29+is on the Ethereum mainnet; it's open source; in every way,
30+technical, legal, and mathematical, it is the world's.
31+
32+(What _is_ Urbit? Please read the [primer](/primer).)
33+
34+Let's talk about: why I've left; the state of Tlon; and the state
35+of Urbit. If there's any time left, we'll read some poetry.
36+
37+## Why I left
38+
39+No one had the power to fire me. (If anyone wanted to, they kept
40+it to themselves.) I wanted to quit; I could; I should have; I did.
41+
42+I'm a thinker, not a doer; an explorer, not a leader; an author,
43+not a maintainer. My goal was always to fire myself at the
44+first possible opportunity. I'm super happy to reach it.
45+
46+Any creator is a sort of parent – where control is dependence,
47+powerlessness is independence, and independence is victory.
48+There are a lot of ways to light a fire. The last step is just
49+getting out of the way – which must be done not too late, not
50+too soon, and just right. No one can beat Satoshi in this act;
51+anyone should be delighted to follow him.
52+
53+I worked full-time on Urbit, alone and self-funded, for eleven
54+years. From 2002 to 2013, I wrote an end-to-end clean-slate
55+system-software stack: an axiomatic interpreter that fits on a
56+T-shirt, a typed functional language that doesn't use abstract
57+math, and a purely functional operating system. I didn't patent
58+any of this; I put it all in the public domain. (Not a valid
59+open-source license; Urbit is now MIT licensed.)
60+
61+By 2013 I had a stack that worked well enough to make [a
62+video](https://vimeo.com/75312418), then raise a 1.5M seed round. Urbit in 2013 was a
63+working product – in fact, Urbit has had a live global network
64+since November 2013. But in a new platform, the distance between
65+_working_ and _compelling_ is nontrivial. Especially for a seed
66+company with just a few young engineers, building something like
67+nothing ever built before.
68+
69+Urbit in 2013 had roughly the same feature set as Slack in 2013,
70+but less polished, and decentralized. It was pretty buggy and
71+slow. But had we put all our resources into debugging and
72+optimization, it would not have taken five years.
73+
74+My instinct was always that Urbit's delivery schedule should be
75+as long as possible. For me, there are always two Urbits: the
76+Urbit that exists, and the Urbit that should exist. To invent
77+the latter I have to inhabit it. When I look at the present,
78+I try as hard as possible to look at it from the perspective of
79+the future – that's where my head should be.
80+
81+This always makes me think Urbit sucks. And the last thing you
82+want to do is evangelize anything that sucks. This is a bias,
83+but that doesn't make it wrong. For instance: the 2013 Urbit had
84+a shell and a persistent distributed chat – but the shell was
85+mixed in with the kernel, and the chat with the network protocol.
86+As seen from the 2019 Urbit, this is very lame indeed.
87+
88+The conventional wisdom is to ship your embarrassing "MVP." For
89+several reasons, Urbit occupies a unique strategic position.
90+Urbit just isn't relevant until Urbit is, if not perfect,
91+uniformly excellent. It can't just work. It has to work right.
92+Urbit has to be amazing – which is hardly a useless discipline.
93+
94+I still did not think it would take five years to make Urbit
95+work right – or to get the resources to make it work right
96+(which only happened in 2018). But founders always delude
97+themselves, or no one would do it.
98+
99+Urbit is not uniformly excellent quite yet. There are a few
100+medium-sized cleanups in the near-term pipeline. But this is a
101+matter of months, not years. I don't see any unknown unknowns.
102+The adventure isn't over – but the exploration is over.
103+
104+A clean-slate system software stack, from fundamental interpreter
105+to social network, through typed functional language and
106+deterministic OS, is an enormous architectural journey – so
107+long and winding that it's easy for anyone to get lost in any
108+detail. Isn't that any explorer's first job: not getting lost?
109+
110+But once the route is marked, there is a second duty: getting out
111+of the way. It's time for surveyors, not explorers, to map,
112+measure and smooth every wrinkle on the map. That's how system
113+software matures. Lines first ripped in one long slash are
114+polished, straightened and refined across years and decades.
115+
116+And Urbit is too deep and interesting for one technical leader.
117+Every part of it needs its own owner. But others can't build a
118+real sense of ownership while the founder is still around. I'm
119+not even the best engineer on the project; I just got here first.
120+
121+This codebase is very young and very general; there is a lot of
122+fun left to be had with it; others deserve to have that fun.
123+
124+I have no successor as "BDFL." Technical leadership passes to
125+Tlon as a company. Urbit is open source and anyone may play, but
126+anyone who wants to catch up to Tlon still has a lot to learn.
127+Not that that should stop them!
128+
129+I can't make Urbit technically transparent in one speech. But
130+maybe I can shed a little light on the strategy, organization,
131+history and future of the company and the project. It's easier
132+to be frank on the way out.
133+
134+## Tlon, boiling oceans since 2013
135+
136+First of all: why did we do what we did?
137+
138+An ambitious system software project can inhabit one of four
139+institutional forms: bigco, startup, academia, or community.
140+
141+None of these is a fit for a clean-slate system software stack.
142+The startup is the least worst. I'd do it again.
143+
144+A normal startup lifecycle (Tlon actually got into YC, but
145+declined – this was either cool or lame) looks nothing like a
146+normal system-software lifecycle. Nor is Urbit normal. But
147+while Silicon Valley is absurd, it still fits Marianne Moore's
148+line: "with a perfect contempt for it, one discovers that there
149+is in it after all a place for the genuine."
150+
151+The less said about big companies and big science, the better.
152+But the choice between startup and community is interesting.
153+Let's talk a little about why Tlon, this corporation, exists,
154+then a little more about what it actually is.
155+
156+### Tlon, from cathedral to bazaar
157+
158+I used to think I could give Urbit directly to the world – that
159+I could just post the code and an open-source community could
160+take it from there. That'd probably work now, but it's not yet
161+the right thing – and not because nobody wants a revolution.
162+
163+I've never been an open-source person myself. But the model has
164+fascinated me since I encountered Nethack in the '80s. Now that
165+open-source software is a mature field, we can see what kinds
166+of problems the open-source "bazaar" mode is and isn't good at,
167+versus the corporate "cathedral" mode.
168+
169+One problem open source isn't good at is creative collaboration
170+on large and novel systems. For example, if we consider the set
171+of people creating Google's new Fuchsia OS, and the set of people
172+contributing npm modules, we see that it's almost impossible to
173+imagine something like Fuchsia as a community effort – but this
174+is not for lack of talent-hours. Imagine a bazaar creating a
175+feature film, and you'll get the picture. (And Fuchsia seems
176+like a fairly traditional OS.)
177+
178+Why is creative work so hard for bazaars? We could take this as
179+an axiom – but it's worth understanding.
180+
181+The path from concept to product is an annealing process. Your
182+code starts as a gas and ends as a metal. It must cool gradually
183+under precise control. When parts cool too fast, flaws appear.
184+Where flaws appear, the code must be reheated: ie, rewritten.
185+
186+Except for ASCII and a few algorithms, Nock, Hoon and Arvo didn't
187+really rely on anything from 20th-century CS. We didn't drop any
188+off-the-shelf parts into the oven; the whole stack is made from
189+gas. So the code in Urbit has been rewritten at least once; the
190+best code has been rewritten four or five times; perhaps some has
191+been rewritten ten, fifteen, even twenty times.
192+
193+In 2002, I started out with no idea what I was doing. Urbit was
194+interstellar vapor. I did have a decent grounding in 20th
195+century CS, academic and practical. In the '90s I was a grad
196+student in OS at Berkeley, then spent eight years on system
197+software projects (a language, an OS and a browser) in industry.
198+What I wanted, I did not know; what I knew, I did not want.
199+
200+In a long annealing process, it's important to triage the order
201+in which you solve problems. There are three kinds of problems:
202+problems you can't solve now, problems you don't have to solve
203+now, and hard problems. Unless you postpone anything that isn't
204+a hard but solvable problem, your gas will never turn into steel.
205+There are lots and lots and lots of ways to go nowhere fast.
206+
207+Somehow it's 2019. Urbit is hot iron under the hammer. It is
208+solid, but not yet hard. It has shape, but can yet be shaped.
209+It is done, but ought to be finished. It is a sword; you don't
210+want to get stabbed with it; it is not Excalibur, the blade to
211+end all blades.
212+
213+The bazaar is great. But cathedrals still exist for a reason.
214+The challenge for an ambitious system-software project is not
215+whether to choose the cathedral or bazaar model, but when and
216+how to transition from cathedral to bazaar.
217+
218+A cathedral – the same classic pyramid org-chart no doubt used
219+by the builders of the actual pyramids, or the actual cathedrals
220+– is economically less efficient than a bazaar. Why?
221+
222+Even on the world's most fun project, working for some dumb boss
223+is no fun. The bazaar succeeds because the project extracts free
224+labor from contributors – not by cheating them, but in exchange
225+for fun, status, experience, etc. But mainly fun, honestly.
226+
227+Whereas a cathedral costs a giant ton of money. But in exchange,
228+the cathedral gets _cohesion_ – the capacity for intelligent
229+coordinated action. Bazaars can coordinate, but not easily.
230+
231+Because a cathedral can coordinate, a cathedral can _create_ –
232+acting at a scale above individual action. A bazaar is very
233+useful, but a bazaar does not create. It can grow; it can heal,
234+harden, extend, and expand; but creation requires an individual
235+or a coordinated group.
236+
237+But a bazaar can get a lot more done, a lot faster and a lot
238+cheaper. So the right starting point for a bazaar is an existing
239+system which is very clear, very final, and very simple. So any
240+new system should be created by a cathedral and perfected by a
241+bazaar. Since these institutions share little or no structure,
242+the transition is by no means straightforward.
243+
244+### Tlon, just a little startup
245+
246+Tlon is Urbit's little corporate cathedral. It's about 20
247+people, about 15 of them engineers. Everyone is working on
248+Urbit, but not everyone is writing Hoon; there is client-side
249+work, Ethereum work, etc.
250+
251+The team is comfortably funded and more than competent. One Tlon
252+engineer is a 10-year, level 6 Google veteran; another is a YC
253+alum; these people are great, but not really outliers. And not
254+to be credentialist – there are plenty of dropouts, too.)
255+
256+Today, there's almost no part of the Urbit codebase that I still
257+know better than anyone else. There are even design areas that
258+others know better. When we transitioned from Nock 5 to Nock 4,
259+all I contributed was a suggestion. The same for our Ethereum
260+address collection, which our customers absolutely loved.
261+
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
264+goat to feed, the goat would die. The stone that holds the arch
265+together is Tlon's CEO and my cofounder, Galen Wolfe-Pauly.
266+
267+Tlon was founded in 2013; Galen led it through its long seed
268+stage, with only a few engineers, to 2018, when he finally
269+secured the resources to do the project justice. (Although way
270+too much of Tlon's energy in 2018 had to go into Ethereum.)
271+
272+Galen's previous project was the social meta-network Ost. He has
273+an architecture degree from Cooper Union; he is a great designer,
274+a good front-end engineer, and a pretty good surfer. (He also
275+runs the @urbit Twitter.)
276+
277+Galen sets Tlon's product vision and is responsible for both
278+visual appearance and human experience. Basically, Galen is the
279+Steve Jobs of Urbit, with only two differences: Galen's not an
280+asshole, and Steve wasn't short.
281+
282+Galen is joined in the new leadership team by Erik Newton
283+(operations, legal) and Anthony Arroyo (product, engineering).
284+Erik used to run a divorce-law firm and still is a relationship
285+coach. Anthony was a grad student in comparative literature and
286+managed engineering prototypes at Applied Minds.
287+
288+With my departure, Galen is in exclusive control of Tlon and
289+holds the only board seat. Tlon did take seed funding from VCs.
290+But outside investors have never held any management role.
291+
292+## Urbit, in the rear-view mirror
293+
294+Since I'm not going to talk about Urbit again, let me say a few
295+words that might otherwise go unsaid.
296+
297+### Urbit, a level and neutral platform
298+
299+Urbit'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
302+userspace -- one layer up.
303+
304+Socially and politically, Urbit is a flat network of planets.
305+Galaxies and stars are plumbing. No one cares which star is your
306+sponsor, any more than your Facebook friends care who your ISP
307+is, or you care what data center Facebook is in.
308+
309+The sponsorship hierarchy and the senate of galaxies (which can
310+amend Urbit's Ethereum constitution) are _technical_ governance
311+mechanisms. They exist to react to unanticipated technical
312+issues or conflicts (like denial-of-service attacks). Because
313+sponsorship has an escape mechanism, it is not a _feudal_ bond
314+(like your relationship to Facebook).
315+
316+Urbit is a decentralized network of social networks. No one can
317+regulate it. Urbit is made to blossom into an endless garden
318+of human cultures, each of which must regulate itself, none of
319+which can bother the others. The soil in which these flowers
320+grow must be level and neutral.
321+
322+### Urbit, anything but a fair distribution
323+
324+Who got those galaxies, anyway?
325+
326+Urbit has no mining mechanism and needs none. My model was: I
327+own the whole space, since I made it; on the other hand, it's
328+worthless until I find a way to give it away.
329+
330+In the end, I am probably the only individual with a fair amount
331+of Urbit address space (no galaxies, a few percent of all stars).
332+Tlon plus urbit.org also have about the right amount (slightly
333+less than half). The rest are held by third parties – all of
334+whom have either much more, or much less, than they deserve.
335+
336+But although the distribution of Urbit space was thoroughly
337+unfair, it was always _honest_ and never _corrupt_. Everyone
338+who has galaxies or stars did _something_ for Urbit. Some gave a
339+lot 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
341+bunch went to contest winners who solved a trivial Nock problem
342+in 2010.
343+
344+What's unfair: the standards changed wildly across time. What's
345+honest: they were always the same across _people_. Granted, you
346+often had to be in the right place at the right time. This is
347+another problem with life that we can't fix.
348+
349+Every real system of property is unfair. Who deserves to own
350+Manhattan? Who does own it? If property be not unfair – if it
351+is not the result of respecting past accidents – it is not
352+property at all, but something else. I certainly would not do it
353+this haphazardly again, but the outcome is no tragedy.
354+
355+When 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
358+have to. You know it's basically random and probably unfair.
359+Randomness, even blatant unfairness, creates a kind of neutral,
360+peaceful, even promising urban anonymity.
361+
362+Property is always and everywhere a kind of amnesty. It says:
363+whatever happened in the past, this is now what is. When we all
364+agree that everyone has what they now have, however they got it,
365+we have a formula for peace. When we say that everyone should
366+have what they deserve, we can never expect everyone to agree –
367+which means we have planted permanent seeds of discord.
368+
369+And randomness is a virtue – it disrupts hidden patterns. The
370+galaxy owners include famous VCs and total nobodies; a Zen monk
371+and a former Orthodox nun; a blockchain industry leader and a
372+permaculture farmer. If they do have to all agree on something,
373+they should have little to agree on but the truth.
374+
375+## Urbit, a technical report card (January 2019)
376+
377+As a system-software stack, the fundamental thesis of Urbit is
378+that technical simplicity can flow all the way up to the top of
379+the stack, where it becomes human usability. If we can build a
380+purely functional OS, we can build a zero-maintenance server,
381+which is easy to understand because how it works is simple.
382+With this problem solved – nothing else matters.
383+
384+Unfortunately, I still have to give Urbit an "incomplete" here.
385+No grade is available, because usability depends on a lot of
386+fit-and-finish issues that are naturally back-loaded. I would
387+still much rather run an Urbit ship than a Mastodon instance.
388+But still, Urbit today can't quite promise zero maintenance.
389+
390+So we have to look at smaller indicators. One way to get anyone
391+to grade their own work is to ask them for three ways they've
392+succeeded, and three ways they've failed.
393+
394+### Urbit, three battles won
395+
396+I did once want to be a real computer scientist. Before my
397+expulsion for sordid & disturbing behavior, I was once a
398+19-year-old PhD student in CS at Berkeley. I even made an
399+embarrassing bet with Raph Levien as to which of us would win the
400+Turing Award – my money is definitely on Raph at this point.
401+You can even go and read my Usenix '93 paper on ASLR-secured
402+RPC, which won Best Student Paper and has like 50 citations.
403+
404+Well. That whole scene is a bad trip, kids. Avoid it. Also, if
405+you start out as Rimbaud, you might end up as Lebowski. On the
406+other hand, to have any excuse for boiling the ocean, you do have
407+to make some serious CS problems just go away. Here are three.
408+
409+#### Validation
410+
411+20th-century languages underrate the centrality of communication
412+to computing. Their type systems expect all data to live in a
413+single memory forever. They don't consider data serialization
414+and validation to be core competencies of a programming language.
415+
416+So serialization/validation is handled either ad hoc, or by
417+intermediate data description systems which have inherent
418+impedance mismatches with the language proper. Not only is work
419+done over and over – but most network security breaches exploit
420+seams in custom or complex deserialization and validation code.
421+
422+In Urbit there is one kind of data, a noun, which is an atom
423+(unsigned integer) or a cell (ordered pair of nouns). There is
424+one serialization model, which maps noun to atom to noun, in a
425+page of code. And a type defines a set of nouns by defining a
426+function of an arbitrary noun, whose range is that set – which
427+means any data type is also its own data validation function.
428+
429+#### Idempotence
430+
431+20th-century computers have two brains: one fast and temporary,
432+the other slow and permanent. When one of these two-brained
433+computers hears a packet, and sends an acknowledgment, that only
434+means the temporary brain heard it. Acks are not end-to-end
435+transactions.
436+
437+This means you can't write a command protocol where your commands
438+get executed exactly once. You can only choose "at least once"
439+or "at most once." This problem is as ridiculous and frustrating
440+as it sounds.
441+
442+You can address it in three ways: (a) make all your commands
443+formally idempotent, so that repeating them has no additional
444+effect; (b) insert a layer of stateful middleware — a message
445+queue; (c) be fine with "almost always once." Guess which
446+approach is most popular?
447+
448+Your Urbit ship has one permanent brain. Its acks are end-to-end
449+transactions — no packet is acknowledged until all its direct
450+effects are finalized. Every message channel is its own message
451+queue. And every message is executed once.
452+
453+#### Dependencies
454+
455+20th-century languages are all at least vaguely based on a
456+formalism from the '30s called the "lambda calculus." The
457+fundamental operation in lambda calculus is variable reduction
458+from name to value. So lambda languages all have a symbol table
459+or environment which binds names to values.
460+
461+Modern build systems assemble large programs out of small files
462+by reusing this symbol table for global function names, a process
463+called "linking." Unfortunately, linking causes a problem known
464+as "dependency hell," involving baffling, unpredictable upgrade
465+failures. The fundamental problem is the "diamond dependency" —
466+when a build requires two different versions of one symbol.
467+
468+Urbit does not use the lambda calculus, an environment or symbol
469+table, or linking. Because it pushes name resolution out of the
470+fundamental interpreter and up into the language, it can play
471+many more namespace juggling tricks. And its build system has no
472+trouble including multiple versions of the same library.
473+
474+### Urbit, three battles unwon
475+
476+As I mentioned earlier, triage is essential on any long journey.
477+You have to keep moving forward, even when you have no idea where
478+you're going – which means attacking the hardest problems you
479+can solve right now.
480+
481+Unfortunately, this is a different standard than the usual rule
482+for shipping a product: solve the most important problems first.
483+This principle of triage is a general case of Knuth's apothegm
484+against premature optimization. Urbit, in fact, was absurdly
485+slow for a long time, but after a couple of engineer-months of
486+focused optimization it seems fine now.
487+
488+But there are other areas where Urbit today is surprisingly weak.
489+All look careless, but all are the result of careful triage.
490+When you find a weakness due to triage, you may think you are
491+judging Urbit's quality. You are just judging its maturity –
492+which doesn't make your judgment wrong, of course.
493+
494+#### Opacity
495+
496+Urbit's notorious opacity is the problem that makes people
497+complain the most. It's not an unwarranted complaint.
498+
499+At least, it's not all an unwarranted complaint. Part of the
500+complaint is just about novelty. Novelty is of course inherent
501+in any clean-slate stack. I do regret making 0 true and 1 false.
502+On every other count, however, I offer all critics of Urbit's
503+novelty none but the most vulgar gesture.
504+
505+But novelty is not the only problem. Urbit's external
506+documentation has gotten much better in 2018 – in particular,
507+it's now much easier to learn the language. Its _internal_
508+documentation, and general code quality, remains at best poor to
509+average. Worse: the worst code is the oldest, deepest code,
510+which is also the most fundamental. Not only is it not
511+commented, it is full of cryptic, meaningless names.
512+
513+There is now a new style guide, which should enable all reference
514+documentation to migrate into the codebase. But this style guide
515+is so new that none of the codebase complies with it. The guide
516+demands "space-rated" code that documents every variable and
517+every line – and almost none of the codebase is space-rated.
518+
519+Urbit's internal opacity persists for two reasons, one good and
520+one bad. The bad reason is just laziness. The good reason is
521+justified fear of _premature explanation_, which like premature
522+optimization ruins the annealing process.
523+
524+When you don't know exactly what you're doing, preserve as much
525+ambiguity as possible. For example, a name that means something
526+is a commitment to one specific explanation; a name that means
527+nothing is no commitment at all. A cryptic name is productive
528+procrastination; it lets the hard problem of naming get solved
529+later, and hence better.
530+
531+#### Impermanence
532+
533+Your Urbit ship needs to be _permanent_. That means it doesn't
534+lose data, sink, or get wedged, or rot. It's not complicated.
535+I wish Urbit today could make this promise, but it can't.
536+
537+There are are two problems here: short-term permanence and
538+long-term permanence. Short-term permanence means your ship
539+can't fail or lose data except via OS or hardware failure.
540+Long-term permanence means you can put your ship on a USB stick
541+in a box for 50 years, or 100, or 500, and when you turn it on
542+in a modern interpreter it will upgrade itself and work fine.
543+
544+There aren't any significant structural obstacles to each of
545+these milestones. But we can't claim them yet. We haven't
546+really even worried about them. This is another triage case:
547+in this case, the issue is _premature reliability_.
548+
549+Permanence also includes security. Except for the on-chain PKI,
550+in which case you're trusting Ethereum, you shouldn't yet trust
551+Urbit's security at all. Sorry!
552+
553+#### Duplication
554+
555+Triage can procrastinate in the other direction. It can skip
556+problems that are too hard to solve. When you procrastinate,
557+always come back – in this case, when the problem is easier.
558+Here's one way Urbit has skipped a problem that was too hard.
559+
560+Urbit, as you may recall, is a single-level store. It has only
561+one brain. And yet, we resisted the natural unification of
562+_documents_ and _applications_ and _secrets_ that a one-brained
563+computer obviously suggests.
564+
565+Instead, Urbit today is built more the Unix way (if not the
566+Windows way). It has separate subsystems for tracking and
567+updating these three kinds of data. This was my design. Like
568+Urbit's opacity or impermanence, this was always obviously lame.
569+
570+Why do it the lame way? Because, before understanding the union
571+of these problems, we had to understand each problem by itself.
572+We didn't – not even close.
573+
574+No one else ever built a purely functional operating system. No
575+one is going to go straight from zero to the right thing. You
576+have to solve a hard problem, learn from it, and do it again.
577+
578+Now that the team has built and used the specialized subsystems,
579+it's probably time to go ahead and generalize. The problem now
580+strikes me as almost straightforward. The constraints are clear
581+and so are the tools. None of this was true a year ago.
582+
583+On the low end, triage keeps you moving forward by stopping you
584+from wasting time on easy problems. On the high end, triage
585+keeps you moving forward by keeping you from leaping too far
586+ahead, and falling down an impossible rathole.
587+
588+## Further reading
589+
590+What will I do personally? I'll spend more time with my kids.
591+I'll finish reading my 1911 Britannica – I am only on the B's.
592+I have no other long-term plans.
593+
594+But I won't be back to Urbit. I am leaving not just the project
595+but 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.
599+
600+Is there more to say? Of course, but not in prose. Read
601+Bunting's _Chomei at Toyama_ and _Notes on a Fly-Leaf_; Cavafy's
602+_Il Gran Rifiuto_, Keeley & Sherrard translation; Canto XV of the
603+Inferno, Pinsky translation. You might learn something.
604+
605+## Apologies and acknowledgments
606+
607+I apologize to anyone who has too little Urbit space. I refuse
608+to guilt-trip anyone who has too much.
609+
610+I appreciate my friends by not naming them. I disarm my enemies
611+by inviting them to lunch – but only if they come unarmed.
612+
613+I thank everyone who has ever worked on Urbit and everyone who
614+will work on it in the future; our backers, great and small; my
615+cofounder, Galen, and his family; my parents, wife and kids.
content/blog/aesthetic-culture-1.mdnew file+106
@@ -0,0 +1,106 @@
1++++
2+title = "Aesthetic Culture #1"
3+description = "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
5+[extra]
6+description = "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)."
7+author = "Nikolai Mallett"
8+ship = "~nartes-fasrum"
9+image = "https://media.urbit.org/site/posts/essays/help-the-environment.jpg"
10++++
11+
12+<br>
13+
14+![A set of four sigils arranged & coloured to appear as various natural forms, above the ~sorwet sigil & the text "help the environment and help yourself"](https://media.urbit.org/site/posts/essays/help-the-environment.jpg)
15+
16+<br>
17+
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+
20+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). 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.
21+
22+To that end, I wrote [the Art by Urbit proposal](https://grants.urbit.org/proposals/636838408-art-by-urbit), a regular digest for the dissemination of Urbit art and propaganda. We'll bring you the works of both familiar faces and new users, in a variety of media types from image manipulation to 3D models and physical pieces. This first digest will cover some of the art produced in the past year, but will have a focus on the last two months. Future digests will be incremental updates summarizing the artworks of the prior month.
23+
24+## ~datnut-pollen
25+
26+~datnut- made a physical representation of their sigil from maple wood & epoxy resin, and mentioned the potential to use an Arduino to cause different lighting effects for different statuses of an urbit.
27+
28+![The sigil of ~datnut-pollen glowing yellow on a black background](https://i.imgur.com/GxmO6sT.jpg)
29+
30+## ~lagrev-nocfep
31+
32+~lagrev- [made a thread of Dinosaur Comics](https://twitter.com/sigilante/status/1299101593997127680), using the Urbit Whitepaper as the seed text.
33+
34+![A Dinosaur Comics comic, with text pulled from the Urbit Whitepaper](https://pbs.twimg.com/media/EgdUaoKWoAAl6A3.jpg)
35+
36+A sweet poem about the potential for Martian felines is theirs as well:
37+
38+![A brief poem regarding cats on Mars](https://pbs.twimg.com/media/Ef_KTbqWAAAHN-k.jpg)
39+
40+## ~litmus-ritten
41+
42+~litmus- produces art full of glowing gases and colourful curves:
43+
44+![A hand holding a glowing orb, underneath the text: "Urbit - Lunar Operations"](https://i.imgur.com/fRbFIpj.png)
45+
46+~litmus- also drew Urbitan for the release of OS1:
47+
48+![An cartoon-type female character holding an orb, standing in front of a fan of Urbit sigils](https://i.imgur.com/vGqVmNM.png)
49+
50+More of their work is available in the notebooks of the Internet Weirdness Research Unit.
51+
52+## ~minder-folden
53+
54+~minder- stylistically ranges from retrofuturistic memes to flat-out classic 50s retro:
55+
56+![An image of a meteor shaped like ~minder-folden's sigil in front of Mr. Clean, with the text "Soon it will all be clean"](https://pbs.twimg.com/media/Eggk0CGU8AAJC-W.jpg)
57+
58+![A Popular Science cover advertising "Video-Disc Players", with ~minder-folden's sigil present on a television](https://minderimages.nyc3.digitaloceanspaces.com/1ib61l8ugy451.jpg)
59+
60+More of ~minder-’s work is available in his The New Era notebook.
61+
62+## ~naltyc-wornes
63+
64+~naltyc-, & by extension ~dasfeb industries, produces content related to the exploration of Urbit on small & unique computers:
65+
66+![An image of five astronauts wearing Urbit badges strapped into a spaceship cockpit, with the ~dasfeb logo & a Raspberry Pi on the wall behind them](https://pbs.twimg.com/media/EkiyfGbVgAAp8wm.jpg)
67+
68+![An image of a large, early computer control panel with the ~dasfeb sigil on the upper wall and a number of planet sigils on display readouts](https://pbs.twimg.com/media/Ejap_knXgAARo38.png)
69+
70+More of their work is available in the smol computers group.
71+
72+## ~nartes-fasrum
73+
74+I use GIMP to edit images I pull off various social media platforms, and usually post the results on Twitter at [@nartesfasrum](https://twitter.com/nartesfasrum).
75+
76+![A set of four sigils arranged & coloured to appear as various natural forms, above the ~sorwet sigil & the text "help the environment and help yourself"](https://pbs.twimg.com/media/EjuuJjTXsAIcfU9.jpg)
77+
78+## ~norsyr-torryn
79+
80+No discussion of Urbit art would be complete without mentioning [~norsyr-'s Canvas app](https://github.com/yosoyubik/canvas), which won first place in the [Hackathon 2020](https://urbit.org/blog/hackathon-results/) event.
81+
82+![A demo image of the Canvas app, with various drawn characters](https://i.imgur.com/zpm3dYX.png)
83+
84+## ~radbur-sivmus
85+
86+~radbur- writes poetry on a range of subjects, one of which could be Urbit. Interpretation of ["A Weaver's Regard"](https://t.fust.us/writing/poetry/weavers-regard) and ["Internet Absurdities"](https://t.fust.us/writing/poetry/internet-absurdities) is left as an exercise to the reader.
87+
88+## ~sitful-hatred
89+
90+~sitful- has a Martian Meme Depository chat in the Networked Subject group, which catalogs a number of the Urbit memes that have been created so far.
91+
92+![An image of a Connect-Four type game box, edited to read “Connect ~zod: The Classic Network Connectivity Game](https://i.postimg.cc/d1yH7PHL/connect.png)
93+
94+## ~tocrex-holpen
95+
96+~tocrex- has been drawing the galaxies of Urbit, and uploading results to Twitter at [@tocrexholpen](https://twitter.com/tocrexholpen). Each galaxy has a unique design and outfit, with the galactic sigil proudly displayed as its face.
97+
98+![An image of the ~feb galaxy wearing elaborately embossed armor.](https://pbs.twimg.com/media/ENeLOb4WkAApDu2.jpg)
99+
100+## Landscape
101+
102+Something that's become quickly evident with the addition of background images to Landscape is that people love to customize their ship's appearance and make it feel more like home. To close things out, we're providing a pair of backgrounds — one darker, one lighter — for use on your ship (or your desktop, should you so desire).
103+
104+![A moody Martian city](https://i.imgur.com/7Ot9Hcu.jpg)
105+
106+![A bright outing in a young ship](https://i.imgur.com/wFKt2EW.jpg)
content/blog/after-machine-war.mdnew file+46
@@ -0,0 +1,46 @@
1++++
2+title = "After the Machine War"
3+description = "The date is January 1, 2050. The place, New York City. The vibe...subdued."
4+date = 2021-03-15
5+[extra]
6+author = "Simon Kovacs"
7+ship = "~bacbec-lormur"
8+image = "https://storage.googleapis.com/media.urbit.org/site/posts/essays/berlin-wall.jpeg"
9++++
10+
11+<br>
12+
13+![berlin-wall](https://storage.googleapis.com/media.urbit.org/site/posts/essays/berlin-wall.jpeg)
14+
15+<br>
16+
17+
18+> 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.
19+>
20+> Really the only notable thing about it is that it was written on Urbit. And that, perhaps, has made all the difference.
21+>
22+> It’s easy to be pessimistic about the future. Intellectuals, especially, are drawn to pessimism, because pessimism (falsely) implies a greater wealth of knowledge about the ways of the world. But one thing the pessimist never sees coming is a turn for the better. To wit, the future described in the below excerpt doesn’t have to take place. And Urbit is one piece of evidence for the claim that it will not.
23+>
24+> The philosopher-cum-internet comedian Slavoj Zizek likes to point out that no one was really expecting the Soviet Union to collapse in 1989. In fact, the average Soviet dissident wasn’t even gunning for it. He was haggling over small reforms, pushing to get the less corrupt politicians to the top, just going about his day eating or opening a window or walking dully along. Then, kaboom. Collapse. No more USSR.
25+>
26+> Then as now, the unexpected is more likely to occur than most would believe. One thing is not only possible, but an established fact: A brand new digital infrastructure is slowly, quietly being built. While U.S. political parties haggle over $1,400 disbursements for citizens, the rules of global finance are being re-written in code. While pundits debate the merits of Dr. Seuss’s lesser known titles, a global shift away from traditional publishing is gaining steam. And while users and social apps themselves pop up and down like whack-a-mole, folks are putting down roots with permanent peer-to-peer digital identities. If you’re anything like an optimist, you’ll probably want to get on Urbit ASAP and put down your own.
27+
28+<br>
29+
30+The date is January 1, 2050. The place, New York City. The vibe...subdued. Back in 2020, you made a note to yourself to take stock of the world around you here at the half-century mark. And now the time has come. What do you find? The air quality is a bit worse, the bad parts of town are a bit more dilapidated, the Knicks are still terrible—all in all, from the outside at least, not much has changed from 30 years ago. Today you wake up groggy on your self-adjusting Smart Bed (Smart Bed Never Sleeps), you make yourself a steaming pot of coffee (locally sourced, delivered within the half-hour by a drone, now that you’ve got Titicaca Prime), you shower and get ready for work.
31+
32+But what was that dream you had last night? Only the faintest traces of it remain. A luminous rainbow, a mountain landscape, a sense of profound inner peace, mixed with euphoria, mixed with...an intense desire to go out and buy some Health Morsels cereal?
33+
34+That’s odd. You’ve never even had Health Morsels. You open up your laptop, where you can view the activity of the iThink microchip that you got implanted in your cortex a few years ago. “Ads help Elysium provide you with free, quality sleep-monitoring. To disable ads, please upgrade to Elysium Premium.” That explains it. After all—and you pause for a moment over whether the forthcoming thought is yours or the iThink’s, before deciding that it’s much the same anyway—Health Morsels probably are delicious. And healthy, too.
35+
36+As usual, they’re setting something on fire outside your home. Normally you’d scroll back through your Squawker feed to see what it was all about, but today you’re late for work, and anyway you’re in a pleasant haze after the Health Morsels dream—no point ruining it by poring over the latest Squawker pile-on. You glance at the awning. Ah, the bodega. Toilet paper and Juul Pods are cheaper in bulk from Titicaca anyway.
37+
38+Another day at the office. You were never exactly passionate about content moderation, but hey, it keeps the lights on. (And since ConEd got absorbed by Titicaca, it’s been pretty important to have a Verified Income Stream.) It’s a normal day at work. Algorithms haven’t yet been able to filter out all Unverified Content—so it’s up to you the flag Unacceptable Violence, Disputed Claims, and Unfederated Currency transactions.
39+
40+Except after your pleasant dream, it all suddenly seems so drab. You start to wonder whether there was an error last night—maybe they turned the dream levels up too high. Something from your night-time vision just won’t leave your mind, like a film strip looping over and over. It’s that river beside a sloping field, like you used to swim in when you were a kid. You can almost feel the icy cold against your skin, the sticks and mud against the soles of your feet, and then there’s the ripe, marshy scent of the riverbed. Uh oh. You realize you’re close to danger levels. This isn’t where your head’s supposed to be at. Frantically you scroll through content, seeking to moderate it. A user threatening violence against Titicaca. A stream that violates DMCA. A highly dubious Squawker claim, with no support from experts. Flagged. Flagged. Flagged.
41+
42+Yet the river remains. You see it, you feel it, just as you feel the kiss of the sun on your shoulders, the breeze rustling through your damp hair.
43+
44+Now you know what’s coming. You brace for it and wait. Three. Two. One. ZAP. Your iThink produces an electric shock: plenty painful but not permanently damaging—at least that’s what the Verified studies show. The river recedes from your mind. Following the shock, your iThink, as versatile a little machine as ever was invented, delivers a few milligrams of both amphetamine and oxycodone, bringing on a wonderful feeling of simultaneous alertness and relaxation. You look up at your monitor. Content moderation doesn’t seem so bad, with the stimulant and the barbiturate swirling paradoxically through your system. It’s true what they say in the ads: iThink doesn’t just make you think better, it makes you feel better. You dive back into your content moderation with renewed verve, even flagging a couple completely innocent posts just out of surplus exuberance. So what if you hardly get outside at all these days, so what if you’ll never swim in that stupid river. The fastest electronics, the Your Health and Wellbeing tracked and adjusted by an intelligence far greater than that which you could ever hope to possess, a gizmo that gives a whole new meaning to the term neural net.
45+
46+2050 turned out to be a pretty good year after all.
content/blog/an-email.mdnew file+88
@@ -0,0 +1,88 @@
1++++
2+title = "An Email from the Archive"
3+description = "I found this email in my archives recently and thought it might be fun to share publicly."
4+date = 2020-11-30
5+[extra]
6+author = "Galen Wolfe-Pauly"
7+ship = "~ravmel-ropdyl"
8+image = "https://media.urbit.org/site/posts/essays/moon.jpg"
9++++
10+
11+![An email from the archive](https://media.urbit.org/site/posts/essays/moon.jpg)
12+
13+I found this email in my archives recently and thought it might be fun to share publicly.
14+
15+```
16+From: Galen Wolfe-Pauly <galen@tlon.io>
17+Date: Thu, Jul 2, 2020 at 9:50 AM
18+Subject: Continuing
19+To: XXXXXXXXXXXXX
20+```
21+
22+Here are a few things I was thinking about after we chatted. It may be that I'm just reiterating things I already said — but perhaps it's useful:
23+
24+1 -
25+
26+Our collective desire to depend on digital communication tools vastly exceeds what I would have ever guessed. Even if you somehow factor out what’s addictive about the platforms we use today: they serve a real need. The crux of the problem with our current platforms is that they don’t actually serve the need that we want them to serve. They’re not tools in the way we expect tools to be. For the most part, the platforms we depend on serve the needs of their shareholders or some graph or another that needs to go ‘up’, which makes them compromised in a very deep way.
27+
28+In 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:
29+
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+
32+B - 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.
33+
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+
36+Our 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.
37+
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+
40+We’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.
41+
42+So: 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.
43+
44+
45+2 -
46+
47+(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.
48+
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.
50+
51+Urbit 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.
52+
53+When 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.
54+
55+
56+3 -
57+
58+Networks 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.
59+
60+(In my view, a real network is always decentralized. Centralized networks are basically just companies.)
61+
62+Urbit is controlled by the collective of people who use it — in varying degrees, of course. The main thing is that this collective is bound together only by private keys and a blockchain, not a set of legal documents. The agreements between everyone on the network are in some cases more formalized (in terms of ownership) and looser (in terms of content moderation) than what we’re used to in either a state controlled or company controlled model. This is a very unusual kind of institution.
63+
64+On 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.
65+
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+
68+
69+4 -
70+
71+The 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.
72+
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+
75+
76+5 -
77+
78+Christopher Alexander is, indeed, probably the biggest influence on my thinking when it comes to paying close attention to making things that both generate a deep sense of connection and are shaped by the people who inhabit them.
79+
80+[http://en.bp.ntu.edu.tw/wp-content/uploads/2011/12/06-Alexander-A-city-is-not-a-tree.pdf](http://en.bp.ntu.edu.tw/wp-content/uploads/2011/12/06-Alexander-A-city-is-not-a-tree.pdf) is one of his early, well known essays that’s easy to find online. I think ‘The Nature of Order’ is the thing that had the biggest impact on me, but it’s harder to find. There’s probably a PDF floating around on the internet somewhere. It's also a beautiful (four volume) book. The first volume kind of nails it. This talk is also great: [https://twitter.com/urbit/status/1148030042846326784](https://twitter.com/urbit/status/1148030042846326784)
81+
82+The thing that comes to mind lately is Hejduk. He had passed away by the time I was at Cooper, but I feel like I was educated in the ghost of his work. This documentary gives a good impression of his thinking: [https://www.amazon.com/John-Hejduk-Builder-Worlds/dp/B07NKQ72C8](https://www.amazon.com/John-Hejduk-Builder-Worlds/dp/B07NKQ72C8)
83+
84+Hejduk was able to see that architecture isn’t about building buildings per se, but something else. That was always quite obvious to me.
85+
86+
87+Talk soon!
88+G
content/blog/an-urbit-overview.mdnew file+211
@@ -0,0 +1,211 @@
1++++
2+title = "An Urbit Overview"
3+date = 2016-05-11
4+description = "A high-level overview of Urbit."
5+aliases = ["/posts/essays/an-urbit-overview", "/posts/an-urbit-overview"]
6+[extra]
7+author = "Galen Wolfe-Pauly"
8+ship = "~ravmel-ropdyl"
9+image = "https://storage.googleapis.com/media.urbit.org/site/posts/essays/an-urbit-overview.jpg"
10++++
11+
12+![](https://storage.googleapis.com/media.urbit.org/site/posts/essays/an-urbit-overview.jpg)
13+
14+## What Urbit is
15+
16+Urbit is a virtual city of general-purpose personal servers.
17+
18+## Your old personal server
19+
20+What's a personal server? In a sense, you already have one. Your
21+personal server is the combination of all the cloud services you use
22+now.
23+
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
27+we realize how unsustainable this situation is.
28+
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+showing you ads.
34+
35+## Your new personal server
36+
37+Your urbit is your own general-purpose server. It holds your
38+data; runs your apps; wrangles your connected devices; and
39+defines your secure identity. If you still need your old
40+services, it drives them with APIs.
41+
42+Your 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
45+your consent.
46+
47+Technically, 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
50+your home PC.
51+
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
54+simplicity makes managing it as easy as managing an iPhone: all you
55+have to decide is what apps to add.
56+
57+Each urbit is a node on a global, encrypted P2P network. Your Urbit
58+name, a generated pseudonym like `~talsur-todres`, is also your
59+network address. Like Bitcoin, Urbit address space is a cryptographic
60+asset with a limited supply.
61+
62+By keeping addresses scarce, we make spam and abuse expensive. Urbit
63+is 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
65+decentralized, self-governing virtual city both safe and free.
66+
67+## The Urbit future
68+
69+In 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
72+from a Web service to a local Urbit app, your urbit can drive your
73+account with an API or scraper.
74+
75+And within Urbit, data is never locked inside apps. Imagine if you
76+could painlessly switch between Facebook and Google+, Asana and
77+Trello, Tumblr and WordPress. Not only does your urbit upgrade itself
78+and its apps automatically, you can "sidegrade" a running app to
79+another vendor without losing data.
80+
81+Your urbit is also your digital identity. Along with your data
82+lifestream of media, messages and documents, it has the keys and
83+tokens to manage all your legacy Web services. It holds the keys
84+for your cryptocurrency wallets, so it can buy and sell for you.
85+(With one personal server to secure, not 17 different accounts,
86+you actually have the bandwidth to take security seriously.)
87+
88+You still use network services. But instead of interacting with
89+the service provider's HTML UI, which phones home using
90+proprietary HTTP APIs, you interact with a third-party app on
91+your urbit, which talks to multiple service providers using
92+public, typed Urbit protocols. For example, your urbit runs a
93+single shopping app, which downloads catalogs and uploads orders.
94+This app is one store which sells everything in the world, with a
95+salesman who's 100% on your side and always has the best price.
96+Every computing experience is different when the UI is working
97+exclusively for the user.
98+
99+Finally, your urbit is the hub for your network of connected
100+devices. Your smart thermostat, your wristband, your phone and
101+tablet, all run satellite urbits which talk securely to your main
102+urbit in the cloud.
103+
104+## A chance for digital freedom
105+
106+The 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+
112+Urbit, as virtual city, is a platform that brings together all our
113+datastreams -- 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
116+in freedom is the right to be left alone, the second is the power to
117+form new intentional communities, to create and evolve a voluntary
118+definition of public space. We have no idea at all what people will
119+do with this power.
120+
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
124+attacked; 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
127+platform provides "herd immunity" for the few who do need direct
128+physical control over their main computers.
129+
130+Though even laptops are atrophying into mere browsers, mass-market,
131+general-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?
135+
136+## Freedom is an engineering problem
137+
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
141+building it.
142+
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.
146+You can have a personal server, if it's a Unix server on the Internet.
147+
148+Almost no one thinks being a Unix system administrator is fun. Not
149+even 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
152+can't turn a bulldozer into a bicycle.
153+
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.
157+
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,
160+but it doesn't give Web apps any way to talk to the native OS.
161+Urbit is like a browser for the server side: code within Urbit is
162+formally isolated from the platform it runs on top of.
163+
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
167+reuses or depends on any 20th-century code.
168+
169+Urbit is a complete, clean-slate system software stack: a
170+non-lambda interpreter (Nock), a functional language (Hoon), and
171+an event-driven OS (Arvo), with its own encrypted protocol
172+(Ames), typed revision control (Clay), reactive web server (Eyre)
173+and functional build system (Ford). The full system, including
174+basic apps, is only 30,000 lines of Hoon.
175+
176+The first end-to-end prototype of Urbit took one engineer eleven
177+years. The current beta took three more years, with about three
178+engineers on average.
179+
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+our small team to deliver a polished Urbit user experience that can
185+actually challenge modern web apps.
186+
187+## Where we are, what we're doing
188+
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.
191+We 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.
193+
194+This 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
197+maintained in public.
198+
199+Additionally, we're creating an open political and economic process,
200+with a small, fixed-price public presale of Urbit address space. Join
201+us and help make this future actually happen.
202+
203+To keep reading, learn more about [Urbit's address
204+space](../the-urbit-address-space); share our vision of the Urbit user
205+experience, from the [top down](../what-is-urbit-for) or the [bottom
206+up](../magic); check out the [development roadmap](../roadmap);
207+evaluate Urbit's [beliefs and principles](../beliefs-and-principles) or its
208+[interim constitution](../interim-constitution).
209+
210+(For technical readers, check out our [documentation](https://urbit.org/docs/) or
211+the [whitepaper](https://media.urbit.org/whitepaper.pdf)).
content/blog/announcing-urbit-grants.mdnew file+45
@@ -0,0 +1,45 @@
1++++
2+title = "Announcing: Urbit Grants Program"
3+date = 2019-08-06
4+description = "Announcing Urbit Grants, a way to earn stars through contributing."
5+aliases = ["/posts/essays/announcing-urbit-grants", "/posts/announcing-urbit-grants"]
6+[extra]
7+author = "Robert Mariani"
8+ship = "~lodleb-ritrul"
9++++
10+
11+We’ve long been grateful for the hard work of our open-source community, so we’re pleased to announce Grants, a program that gives contributors the opportunity to be compensated for their efforts. It’s in beta right now at [grants.urbit.org](https://grants.urbit.org/).
12+
13+The Grants program will reward valuable contributions with Azimuth stars in one of three ways: Gifts, Bounties, and Proposals.
14+
15+### Gifts
16+
17+We’ve periodically announced gifts for important contributions to the project – like in [2018](https://urbit.org/posts/2018-2-17-update/) and [2019](https://urbit.org/posts/urbit-grants-and-mid-2019-gifts/) – but we wanted to make this more formal.
18+
19+Not everyone always works on structured projects, so the lack of formal criteria for receiving a gift is meant to reward contributors who work outside of the bounty and grant system.
20+
21+Going forward, gifts will be awarded semi-annually (every six months). They’ll retain the informal and arbitrary nature of the awards that came before: Tlon will determine who gets what. We’ll work hard to make sure these payouts are fair.
22+
23+To see the gifts that have been awarded so far, check out the [History section](https://grants.urbit.org/history) of the Grants website.
24+
25+### Bounties
26+
27+Bounties are discrete projects in search of a champion. Tlon will define a clear deliverable, and some number of stars as their reward. Larger bounties will often have their star reward spread across multiple milestones.
28+
29+Contributors can apply to claim a bounty by clicking the “Request to work on this” button. Once a contributor is selected to work on a bounty, nobody else will be able to apply.
30+
31+Bounties are listed in the [Bounties explorer](https://grants.urbit.org/rfws). Play around with the explorer by filtering bounties using the Tag and Category features.
32+
33+### Proposals
34+
35+Proposals are a way for contributors to pitch their own ideas, with a targeted number of stars. Proposals can be accepted, rejected, or accepted with changes. Unlike bounties, a proposal can only be completed by the individual or group who submitted it.
36+
37+Proposals don’t need to be fleshed out like a bounty does, at least not initially. Submit an idea and Tlon will work with you to refine it.
38+
39+You can see the list of accepted proposals in the [Proposals explorer](https://grants.urbit.org/proposals).
40+
41+### What can you do?
42+
43+[Sign up](https://grants.urbit.org/auth/sign-up) on our Grants website page, then set up your profile so we know who you are, linking your GitHub, Twitter, and your Azimuth point: reputation is a factor in determining eligibility for a grant.
44+
45+Also, check out the [Grants section](https://urbit.org/faq/#grants-1) of the new Urbit FAQ for more information.
content/blog/azimuth-as-multipass.mdnew file+31
@@ -0,0 +1,31 @@
1++++
2+title = "Azimuth as Multipass"
3+date = 2019-05-16
4+description = "What if everyone had a single 'civilizational key'?"
5+aliases = ["/posts/essays/azimuth-as-multipass/", "/posts/azimuth-as-multipass"]
6+[extra]
7+author = "Galen Wolfe-Pauly"
8+ship = "~ravmel-ropdyl"
9+image = "https://media.urbit.org/site/posts/essays/azimuth-as-multipass-1.png"
10++++
11+
12+![](https://media.urbit.org/site/posts/essays/azimuth-as-multipass-1.png)
13+
14+Why can’t I just walk up to a door and have it open for me? Why can’t I simply arrive at a restaurant and have them know I’m there? Shouldn’t I be able to buy a ticket to a show with my Multipass then scan it at the entrance and use it to buy drinks?
15+
16+Why should I have to log in with MEGACORP? Today, in most cases, it’s a different MEGACORP for every single context. It’s a MEGAMESS.
17+
18+Why not just use one? Forget about how we get there for a moment: just imagine how simple it could be.
19+
20+An Azimuth point is an identity and a wallet. Both a driver’s license and a credit card. Identity and money. Think about it as a ‘civilizational key’ for a new society. Concretely, it’s nice to imagine it as a physical object. A slick, card sized object with an e-ink screen. You can tap it to pay, tap it to enter, and plug it into a computer to boot your Arvo OS.
21+
22+Worried about losing it? Just remember your ticket. If you use our wallet system, all you need to remember is something like `~ravmel-ropdyl` and `~habpem-sondem-pidbyt-solbyn`. A point and a ticket. That’s it.
23+
24+Woke up in the desert, no idea how you got there, but can still remember your point and ticket? Great! Just get to an internet connection and re-ticket – you’ll be fine. Although probably dehydrated.
25+
26+If you’re someone who’s worried about getting kidnapped, just use a child identity. Your Azimuth planet has ~4B of them, so you can always invalidate one if you lose it.
27+
28+Perhaps 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.
29+
30+We 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.mdnew file+103
@@ -0,0 +1,103 @@
1++++
2+title = "Azimuth is On-Chain"
3+date = 2019-01-14
4+description = "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"]
6+[extra]
7+author = "Galen Wolfe-Pauly"
8+ship = "~ravmel-ropdyl"
9++++
10+
11+![](https://media.urbit.org/site/arvo-4.svg)
12+
13+The Urbit address space is now live on the Ethereum blockchain. We’re calling the PKI ‘Azimuth’ and you can find it at [`0x223c067f8cf28ae173ee5cafea60ca44c335fecb`](https://etherscan.io/address/0x223c067f8cf28ae173ee5cafea60ca44c335fecb) or [`azimuth.eth`](https://etherscan.io/address/azimuth.eth). Owners of Azimuth ‘points’ (galaxies, stars or planets) can use [Bridge](https://github.com/urbit/bridge/releases) to manage them and view their balance now.
14+
15+Sometime in the next few days, owners of Azimuth points will be able to boot Arvo, the Urbit OS, from their Azimuth point and request access to one of our 'cities': private communities for chat and discussion. These new cities use Landscape, a brand new UI for using Urbit in the browser.
16+
17+This means you can boot a deterministic OS from an identity you own, join a totally independent, decentralized and self-governing network and run a clean, simple UI. Pretty exciting. Is it ready for ordinary users? Definitely not.
18+
19+Since 2013, you've been able to boot an Urbit and join our test network. And, since 2013, we've always had our sights set on building a personal server that can both last 100 years and be delightful to use. Urbit isn't meant just to be as good as the MEGACORP software we use today. It's meant to be much, much better.
20+
21+But Urbit is not a 'product' in the conventional sense. Urbit is a public thing. It's meant to belong to everyone. For the past six years, much of our work was research and design work. Which means lots of weird ideas thrown away, and others rewritten or redesigned many times over. Our work has always been open source, but we tend to be pretty quiet about it.
22+
23+With Azimuth on the blockchain, it's time for us to start engaging with the world more directly.
24+
25+We aren't calling this a launch. There's no keynote. There's no dancing on stage. I mean, it's 2019. You must be pretty sick of being marketed to. We'll try to stick to the specifics here. What's new, what we've been up to and what works. There's too much to fit into a single post, so we'll keep it pretty light for now. Each of these sections will probably get its own post in the near future.
26+
27+> Note: As of `~2019.1.14` we're in the process of rebooting the Arvo network. We expect it to be back online before the end of the week. We'll update this post and [tweet](https://twitter.com/urbit) when the network is online and stable.
28+
29+## Rethinking the stack
30+
31+We've started to talk about Urbit as a stack of three parts: Azimuth, the address space and identity layer on Ethereum; Arvo, the OS and overlay network; and Aegean, a pattern for building decentralized communities on the Arvo network.
32+
33+We tried to capture this separation in [the primer](/primer), a new overview of Urbit. Explaining Urbit has always been challenging. A monolithic project that is OS, network, language, VM and UI barely makes sense. Separating the layers helps, we think.
34+
35+Let's step through them to see what's new.
36+
37+## Azimuth
38+
39+![](https://media.urbit.org/site/bridge-0.png)
40+
41+As a quick refresher: Urbit addresses, now called Azimuth 'points', are short names like `~diblun-tidduc`. You own your Azimuth point with a private key and can use it as a routable network address on the Arvo network. You can read more about Azimuth in [the primer](/primer#what-azimuth-is). If you're curious who owns all this address space, you can find that [in there too](/primer#azimuth-distribution).
42+
43+In late 2017 we decided to migrate the yet-to-be-named Azimuth to a system of Ethereum contracts. After a year of coding, testing, auditing and migrating — they're now fully deployed to the Ethereum mainnet.
44+
45+Azimuth is basically two parts, a database of who owns which points, and a set of rules about what points and their owners can do. That set of rules is called Ecliptic, and can be found at [`0x6ac07b7c4601b5ce11de8dfe6335b871c7c4dd4d`](https://etherscan.io/address/0x6ac07b7c4601b5ce11de8dfe6335b871c7c4dd4d) or [`ecliptic.eth`](https://etherscan.io/address/ecliptic.eth). The top-level Azimuth points, the galaxies, can vote on upgrades to the Ecliptic contract, but they can't edit the database of who owns what.
46+
47+The ownership database contract is called Azimuth, which you can find at [`0x223c067f8cf28ae173ee5cafea60ca44c335fecb`](https://etherscan.io/address/0x223c067f8cf28ae173ee5cafea60ca44c335fecb) or [`azimuth.eth`](https://etherscan.io/address/azimuth.eth). For those of you who own address space, you can use the `getOwnedPoints` function in the 'Read Contract' tab to check your balance. The function returns the number (not the phonemic string like `~ravmel-ropdyl`) of your points. Each Azimuth point is an ERC-721, non-fungible piece of digital property.
48+
49+To manage your points, we built [Bridge](https://github.com/urbit/bridge/releases), a completely custom interface for interacting with our Solidity contracts. Interface quality is really important to us, and we couldn't find anything in the 'crypto' world that met our standards. Bridge is good, but crypto UX is a hard problem. We've already got some ideas for improvements.
50+
51+If you're curious, you can find the source for the contracts in the [`urbit/azimuth`](https://github.com/urbit/azimuth) repo. The Bridge source is in the [`urbit/bridge`](https://github.com/urbit/bridge) repo.
52+
53+We had the source for our contracts audited by Open Zeppelin, Blockchain at Berkeley and Bloctrax. Did we miss something? We sure hope not — but we'd happily compensate anyone who can find bugs. Please reach out to security@urbit.org if you find something of concern. We'd be happy to hear from you.
54+
55+![](https://media.urbit.org/site/sigils.svg)
56+
57+Azimuth names have always had a pronunciation system. `~ronryd-nidseg` is 13,695,781, for example. Now, they also have a visual system. We call these strange crests from another planet 'sigils', and you'll notice them used throughout all our new interfaces. You can find the source in the [`urbit/sigil-js`](https://github.com/urbit/sigil-js) repository. Building these was a lot of fun — we'll save the details for a future post.
58+
59+So, how do you get an Azimuth point? We've left that question unanswered intentionally. Azimuth points are meant to be like digital land, not currency. They should change hands slowly. In order to get an Azimuth point, you'll need to find someone who already has one and is willing to part with it.
60+
61+## Arvo
62+
63+![](https://media.urbit.org/site/fast-lux-3.gif)
64+
65+Arvo 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.
66+
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.
68+
69+There'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.
70+
71+## Aegean
72+
73+![](https://media.urbit.org/site/landscape-inbox.png)
74+
75+Aegean is a pattern for building 'cities': groups of people running the same 'agent' on their Arvo servers. Agents aren't just 'apps' or programs. An agent rolls together the tools that a community needs. Today, our companies, communities, cults, cliques all have to duct tape together separate MEGACORP apps and services to compute together.
76+
77+Aegean reverses this pattern. A community on Arvo is a city: just a bunch of people running the same agent. Each city is in control of its own codebase: the interface, application code _and_ data storage. This means a community can have complete agency over how to compute together.
78+
79+Aegean cities can be completely different without impacting one another at all. Cities share the neutral infrastructure of Arvo and Azimuth — but they may never even know others exist. An archipelago of hypercultures.
80+
81+It's important to note: the pattern of these cities is _not_ the pattern of Azimuth. The network hierarchy should impact the society of Urbit as much as the electrical grid impacts the life of the street in Manhattan. It matters when the power goes out — but most of the time groups form and dissipate continuously.
82+
83+Before we can let the ocean of cities grow we have to homestead a few of our own.
84+
85+Our first agent is called [Landscape](https://github.com/urbit/urbit/tree/master/pkg/interface), an agent for chat and longform discussion. We are using Landscape to run a few experimental cities over the next month or so. If you have an Azimuth point, you'll need to [request access](mailto:support@urbit.org) to join.
86+
87+Anyone can create their own city, of course. The source is open. But we're not going to encourage you to just yet. Feel free to explore, but also be patient. We've got a lot planned around this. If Azimuth is done and Arvo is young, Aegean is just being born.
88+
89+## Tlon
90+
91+![](https://media.urbit.org/site/office-1.jpg)
92+
93+So who is behind all of this? A team of collaborators and contributors. Many of us work at [Tlon](https://tlon.io) — the company we started in 2013 to advance Urbit platform development. Tlon has attracted an incredible group of smart, talented people who want the world to be able to own and control their computers. I'm proud to work alongside them.
94+
95+One important omission on `tlon.io` is Curtis. As of today, he's no longer working on Urbit. [His own words](/posts/essays/a-founders-farewell) are the best way to understand his thinking. It's an achievement for the team, I think, that he can depart with confidence.
96+
97+One major reason for that confidence is that Erik and Anthony have now become COO and CPO respectively. Having thoughtful, organized people leading the project is a huge benefit to the whole team. I'm very glad to have them on board.
98+
99+## Looking ahead
100+
101+I certainly forgot at least a thing or two. We'll dive in to more detail in the coming weeks.
102+
103+There's a lot for you to explore. Have fun!
content/blog/azimuth-security-bounty-program.mdnew file+36
@@ -0,0 +1,36 @@
1++++
2+title = "Azimuth Security Bounty Program"
3+date = 2019-07-22
4+description = "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"]
6+[extra]
7+author = "Anthony Arroyo"
8+ship = "~poldec-tonteg"
9+image = "https://media.urbit.org/site/posts/essays/azimuth-security-bounty-program-1.jpg"
10++++
11+
12+![](https://media.urbit.org/site/posts/essays/azimuth-security-bounty-program-1.jpg)
13+
14+Since launching [Azimuth](https://urbit.org/posts/azimuth-is-on-chain/), we’ve been running a private bounty program with [HackerOne](https://hackerone.com/). We’re now taking the program public and inviting you (and your friends) to help us make Azimuth as secure as possible.
15+
16+[Go here](https://hackerone.com/tlon) to see the live program on HackerOne.
17+
18+## What is Azimuth again?
19+
20+Azimuth is [the Urbit public key infrastructure](https://urbit.org/posts/azimuth-is-on-chain/). It’s a set of Ethereum smart contracts that allow for cryptographic ownership and management of Urbit identities. It also provides a governance mechanism whereby galaxy owners are able to propose and vote on improvements.
21+
22+People already [use Azimuth](https://github.com/urbit/bridge) to boot Arvo ships, spawn stars and planets for others and transfer points. But Azimuth is a general identity system, with great potential to be used beyond Arvo: there are primitives for reputation, payments and securing communication channels.
23+
24+## Security program details
25+
26+We had the Azimuth contracts audited by [Open Zeppelin](https://openzeppelin.org/), [Blockchain at Berkeley](https://blockchain.berkeley.edu/) and [Bloctrax](https://www.bloctrax.com/), but we don’t want to take any chances. We’re hoping that the HackerOne program will help us get more eyes on the contracts, identify vulnerabilities and get out in front of any problems. You can find more information about the program at [our page](https://hackerone.com/tlon) on HackerOne.
27+
28+We’re interested in any vulnerability in the Azimuth contracts that would allow an attacker to either seize other user’s points, impersonate points or that would result in the platform becoming unusable.
29+
30+The program page has links and instructions on how to set up a development version of Bridge and point it at either the Ropsten deployment of the contracts or at a local network to play with the contracts and look for vulnerabilities.
31+
32+## Arvo is out of scope for now
33+
34+We’re intentionally focusing our security efforts on Azimuth for now. Since Azimuth serves as our PKI layer, it’s the most crucial for the time being: it’s the source of truth for who owns what. We don’t want to have even a shred of a doubt that these cryptographic properties are secure.
35+
36+Of course, we’re working toward a future where you have a computer connected to this Azimuth point, and the computer has to be as secure as its identity. To achieve this, we have some more hard work to do on Arvo and our interpreter, Vere. When the time comes, we’ll also reach out for help testing vulnerabilities throughout the entire stack.
content/blog/beliefs-and-principles.mdnew file+130
@@ -0,0 +1,130 @@
1++++
2+title = "Beliefs and Principles Guiding the Urbit Project"
3+date = 2016-05-11
4+description = "We believe."
5+aliases = ["/posts/essays/beliefs-and-principles",
6+"/posts/beliefs-and-principles", "/posts/principles"]
7+[extra]
8+author = "Curtis Yarvin + Galen Wolfe-Pauly"
9+ship = "~sorreg-namtyv + ~ravmel-ropdyl"
10+image = "https://storage.googleapis.com/media.urbit.org/site/posts/essays/beliefs-and-principles.jpg"
11++++
12+
13+![](https://storage.googleapis.com/media.urbit.org/site/posts/essays/beliefs-and-principles.jpg)
14+
15+## Beliefs
16+
17+We believe that general-purpose computing is an essential tool to
18+unlock the power of individual creativity.
19+
20+We believe that ownership, privacy and control don't need to be
21+sacrificed in exchange for usability, accessibility and reliability.
22+
23+We believe in the power of the informed crowd to develop and maintain
24+software, through the IETF principles of sincerity and rough consensus.
25+The ability of the engineering community to govern itself through
26+republican forms is not an abstract theory; it's a proven fact.
27+
28+We believe in both free speech and individual accountability. We
29+believe that a healthy network is one with diverse and well-defined
30+communities, and clear, user-controlled, boundaries between public and
31+private space.
32+
33+We 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
36+common case; they can never handle all exceptions.
37+
38+## Principles
39+
40+Here are some principles of Urbit. Where principles conflict,
41+the first stated takes precedence.
42+
43+### Digital independence
44+
45+Digital independence is independent control of your own
46+general-purpose computer which holds your own primary data.
47+Urbit's ultimate purpose is to make practical digital
48+independence a useful and widely available product.
49+
50+### Code is law
51+
52+Wherever 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.
55+
56+### Sovereignty is conserved
57+
58+Even where code is law, exceptional situations demanding
59+effective collective action will always arise. There must
60+always be a collective authority to solve these problems.
61+
62+Two known problems in Urbit that require central authority are
63+approval of software updates and activation of the network. But
64+there will certainly be others.
65+
66+### Purpose of collective authority
67+
68+Urbit, as opposed to the Tlon corporation, is a republic. Its
69+government 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
72+general-purpose charity.
73+
74+### Decentralized control
75+
76+Urbit should never fall under any kind of central control. All
77+transitions in galaxy ownership should divide positions, not
78+unite them.
79+
80+Galaxy and star ownership should also be separated. It is
81+harmful for a single entity to hold both galaxies and stars.
82+
83+### Property is contingent
84+
85+Property 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
88+right; it is a fact.
89+
90+### Governance is by stake
91+
92+Ultimately, Urbit must be governed by those who own it. In each
93+tier, equal stakes must hold equal authority.
94+
95+### Content-neutral
96+
97+Urbit does not admit a tradeoff between anarchy and tyranny,
98+order and liberty. Urbit has zero tolerance for abuse, nor does
99+it facilitate censorship.
100+
101+Urbit 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
103+don't want others to see.
104+
105+### Trolling considered harmful
106+
107+If you post content on Urbit which may offend or disturb any
108+significant group of users, it is your responsibility to mark it
109+properly for automatic blocking.
110+
111+### Sockpuppets considered harmful
112+
113+The only legitimate reason for one individual to use multiple
114+identities is to maintain multiple active pseudonyms. But
115+multiple identities must never interact in the same context.
116+
117+### Not a darknet
118+
119+Urbit is not a darknet. It does not break real-world laws. It
120+is not designed to facilitate the breaking of real-world laws.
121+For any problem that lawbreakers have, there must always be a
122+better solution that is not Urbit.
123+
124+### Responsibility to route
125+
126+As long as they are not facilitating violations of any of these
127+principles, or laws in their own jurisdictions, stars and
128+galaxies are responsible for routing their children. They are
129+also collectively responsible for escape-routing the children of
130+stars and galaxies which fail in their responsibility.
content/blog/bootstrapping-urbit-from-ethereum.mdnew file+387
@@ -0,0 +1,387 @@
1++++
2+title = "Bootstrapping Urbit from Ethereum"
3+date = 2017-09-20
4+description = "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/"]
6+[extra]
7+author = "Curtis Yarvin + Galen Wolfe-Pauly"
8+ship = "~sorreg-namtyv + ~ravmel-ropdyl"
9++++
10+*TL;DR:*
11+
12+We've decided to launch Urbit's constitution as a system of Ethereum contracts.
13+
14+We'll instantiate a land registry for Urbit address space; an ERC20 "spark"
15+token which is burned to create a generic star; and a voting system for
16+self-governance. We'll also create template contracts which galaxies can use to
17+auction stars, and stars to distribute planets.
18+
19+## A bit of background
20+
21+One 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
24+matured to the point where public ownership of the network really should be
25+cryptographically real.
26+
27+But 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.
30+
31+In theory, Urbit doesn't need a blockchain, because real estate moves slowly.
32+In digital real estate, as opposed to digital currency, a low-friction,
33+zero-trust solution to the double-spend problem isn't an economic necessity.
34+
35+In practice, though, we have a hard chicken-egg problem. In the current design,
36+the 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
38+definition of who owns an identity.
39+
40+But 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
43+gets started.
44+
45+Moving 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
48+on 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
50+off of Ethereum, without changing the design of the Urbit cryptosystem.
51+
52+And best of all, you can get your Urbit star or planet entirely through the
53+blockchain, without interacting with any centralized database or payment
54+mechanism. So we're really living in 2017.
55+
56+Sounds good, right?
57+
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
62+the hype for later.
63+
64+First, we'll walk through the costs and benefits of using Ethereum. Then,
65+we'll refresh our memories on how the Urbit address space works, and finally
66+we'll walk through some of the details of how we plan on implementing this.
67+We've thought quite thoroughly about these things, but public criticism is
68+really important.
69+
70+## Weighing the choice of Ethereum
71+
72+Our engineering style is to build the whole stack, from axioms to UI, from
73+custom, super-minimal parts. When these parts don't fit perfectly, we rewrite
74+them until they do. With a few exceptions, such as crypto algorithms, Urbit
75+doesn't reuse existing code or designs, depend on existing tools, or expect
76+outside contributors to solve problems essential to a complete experience.
77+
78+Instinctive minimalism is essential in a custom full stack. The best solution is
79+always to not solve the problem. The natural engineering response to the
80+pre-blockchain difficulty of solving Byzantine consensus agreement was: do we
81+really need it?
82+
83+### The case against Ethereum
84+
85+Since Urbit network address space is a land registry, not a currency,
86+transactions are low-frequency. A low-frequency transaction system can succeed
87+economically even if it has high friction. The double-spend problem, which
88+consensus computing solves, becomes easy or at least tractable given high
89+friction.
90+
91+We reinvent the wheel if we have to, throw it away if we can. So depending on
92+Ethereum goes against all Urbit's instincts.
93+
94+Let's enumerate the problems, as critically as we can:
95+
96+And Ethereum's user experience is notorious; its governance is suspect and
97+unstable; its dilution rate is unconscionable; its dev environment is full of
98+bugs and misfeatures; in short, it's a classic MVP. It has only one real goal:
99+success. It seems to be doing pretty well with that.
100+
101+We prefer [SLC](https://blog.asmartbear.com/slc.html) to MVP. Urbit under
102+construction is fun to play around in. But we certainly won't ask real users or
103+real developers to set foot in Urbit until their experience is truly simple,
104+lovable and complete. The original iPhone set the bar for this, and we'll get
105+as close as we can.
106+
107+### The case for Ethereum
108+
109+It's obvious that Urbit has a practical problem in deploying a self-hosted PKI.
110+When does the testnet become a realnet? You wouldn't put real, valuable keys in
111+your urbit, until you know the system is mature and secure.
112+
113+But how does anyone know that Urbit is mature until more daring users have used
114+it with real, valuable keys? But who wants to be the first person to hop into
115+the box?
116+
117+There is no clear way to bootstrap past the testnet phase. Except, well, reboot
118+Urbit onto an existing blockchain, with a tested and reasonably-secure
119+key-handling infrastructure, that can also validate the Urbit PKI rules. Then
120+each user can decide on their own whether sensitive data is safe in their own
121+urbit.
122+
123+## An Urbit refresher
124+
125+Maybe some people are here because they know what Ethereum is, but not so much
126+Urbit.
127+
128+For those of you not familiar, let's try to refresh your memories.
129+
130+### What Urbit is
131+
132+One simple way to think about Urbit is as a "personal blockchain." Like a
133+blockchain, Urbit is a deterministic virtual computer. Its semantics are defined
134+by a frozen lifecycle function, which maps its event history to its current
135+state. But, unlike a blockchain, an Urbit instance is a private computer for one
136+user, not a public record for everyone.
137+
138+Urbit's lifecycle function is a nano-interpreter called Nock. A typed functional
139+language, Hoon, compiles itself to Nock. An event-driven OS, Arvo, is written in
140+Hoon. Everything above Nock can upgrade itself over Urbit's own overlay packet
141+network, Ames. Ames is live and stable with test keys.
142+
143+Our Urbit interpreter runs on any Unix machine. The Urbit server is a
144+single-level store -- both database and application engine. Every Urbit event is
145+a transaction. Urbit is semantically frozen and cannot call out to Unix.
146+
147+Your Urbit instance is your personal server. Your urbit should eventually
148+contain and manage your whole digital life. You may compute at home or in the
149+cloud, based on your security/privacy tradeoff, but Urbit's formal semantics
150+makes ships trivial to migrate. You'll never be locked in to one computing
151+provider.
152+
153+### The Urbit address space
154+
155+An Urbit address is called a "ship." A ship is a network address, a
156+cryptographic identity, a pronounceable name, and a permanent memory. A ship's
157+name is just its numeric address, written in a syllabic base-256.
158+
159+Smaller addresses mean shorter, more memorable ships. Ships are classified in a
160+hierarchy: 8-bit "galaxies" (like `~dyl`), 16-bit "stars," (`~ropdyl`), and
161+32-bit "planets" (`~ravmel-ropdyl`). Galaxies and stars are network
162+infrastructure. Regular users have planets. The tight 32-bit address space makes
163+names short enough to remember, and costly enough to deter Sybil attacks.
164+
165+Planets are created by their prefix star; stars are created by their prefix
166+galaxy; galaxies were created by the founders. Parents assist their children,
167+providing essential services like peer-to-peer packet routing, but don't own or
168+control them. The prefix is just an initial default -- a ship can switch to any
169+parent that's willing to adopt it.
170+
171+## Summary of the integration model
172+
173+In the new integrated model, every planet, galaxy or star is owned by an
174+Ethereum address. The secret that controls this address is the ship's "master
175+key."
176+
177+The master key is not needed to operate the ship and should not be stored on it,
178+at least not until Urbit is more mature. Master keys should be kept as "cold" as
179+possible. They are only used to perform lifecycle operations on your ship, by
180+signing Ethereum transactions which are sent to the Urbit constitution.
181+
182+We'll fork an open-source Ethereum browser and add a custom UI for Urbit
183+transactions. New users will acquire their urbits entirely on the blockchain.
184+
185+The most basic Urbit transaction is starting a ship you own. To start your ship,
186+you use Urbit to generate an Urbit keypair, and use Ethereum to register the
187+Urbit public key (a 512-bit pair of Curve25519 for encryption and Ed25519 for
188+signature) on the Ethereum blockchain.
189+
190+For users who want to hold generic stars without starting or even selecting
191+specific ships, we'll create a divisible "spark" (USP) ERC20 token. A spark is
192+the right to create one star. Sparks are a convenience tool: they leverage the
193+mature ERC20 infrastructure for holding and trading token utility rights.
194+
195+Instead of launching stars directly, galaxies can cede their unlaunched stars to
196+the Urbit constitution. The issuing galaxy receives one spark in exchange for
197+this star. Any Ethereum address can redeem one spark in exchange for the right
198+to start one star from the constitution's pool.
199+
200+Once all the galaxies are created, Urbit is fully decentralized. We retain no
201+ownership powers over the Urbit constitution.
202+
203+The Urbit galaxies will mirror the state of the constitution, distribute its
204+state and events within Urbit, and post any transactions created within Urbit.
205+Generally an Urbit ship trusts its parent -- if not, it should find a new one
206+fast. But a deeply paranoid ship can still listen to Ethereum directly.
207+
208+## Contract designs
209+
210+The Urbit constitution is four contracts: certificate storage, spark storage,
211+election storage, and logic controller.
212+
213+Following Ethereum best practice, we'll use separate storage and logic
214+contracts. The logic contract is stateless, and can upgrade itself without
215+replacing the storage contracts.
216+
217+We'll walk through how we have designed these contracts in detail here. You can
218+also view our in-progress source at the
219+[`urbit/azimuth` GitHub repo](https://github.com/urbit/azimuth).
220+
221+### Certificate storage contract
222+
223+For every galaxy, star or planet, the certificate contract holds a current
224+state: `%latent`, `%locked`, `%liquid` or `%living`.
225+
226+The default/empty state is `%latent` (nothing has happened to this ship). The
227+contract stores no data for a latent ship.
228+
229+A `%locked` ship has an owner and an activation date. It cannot be activated
230+until the given date. Until activated, the locked ship can't be transferred,
231+vote, liquidate or launch children.
232+
233+A `%liquid` ship is held by the Urbit constitution to be redeemed for a spark.
234+It has no other state.
235+
236+A `%living` ship is active. Its state: an Ethereum address which owns it; an
237+Urbit public key; a revision number, which increments on any lifecycle
238+operation; and (for planets and stars) both current and requested (for escaping)
239+parent ships.
240+
241+The certificate contract throws an event on every state change.
242+
243+### Spark storage contract
244+
245+The spark contract is a divisible ERC20 token (you can't hold half a star, but
246+you can hold half a spark). Only the logic contract can create and destroy
247+tokens.
248+
249+### Governance storage contract
250+
251+The governance contract records galaxies' votes on governance proposals.
252+
253+There are two kinds of proposals: concrete and abstract. A concrete proposal is
254+the address of a new logic contract for the constitution. An abstract proposal
255+is the hash of a document.
256+
257+Voting is one-bit -- the default vote is "no" -- and irreversible. A 256-bit
258+bitfield records the set of galaxies that have voted for each proposal.
259+
260+Only active galaxies may vote. A counter records the number of active galaxies.
261+A proposal passes if more than 50% of active galaxies support it. If the
262+proposal is concrete, the old logic contract is terminated and the new one
263+receives storage control. Abstract proposals have no further effects on the
264+blockchain.
265+
266+### Logic contract
267+
268+The logic contract is stateless and supports the following ops:
269+
270+#### Create a galaxy
271+
272+What: move a galaxy from `%latent` to `%locked` state.
273+
274+Who: the founders only.
275+
276+Comments: this is the only founder-privileged operation.
277+
278+#### Liquidate a star
279+
280+What: move a specific star from `%latent` to `%liquid` state, granting one spark
281+to the galaxy owner.
282+
283+Who: owner of the active galaxy which is the star's prefix.
284+
285+#### Claim a star
286+
287+What: move a specific star from `%liquid` to `%locked` state, with the
288+activation date set to the present, and the owner as claimer; remove one spark
289+from the owner.
290+
291+Who: any Ethereum address which owns a spark.
292+
293+#### Launch a star or planet
294+
295+What: move a specific star or planet from `%latent` to `%locked` state, with the
296+activation date set to the present, and set the Ethereum address which owns the
297+ship.
298+
299+Who: owner of the parent of the launched ship.
300+
301+#### Start a ship
302+
303+What: move a specific ship from `%locked` to `%living` state, setting its Urbit
304+public key.
305+
306+Who: owner of the locked ship.
307+
308+#### Transfer a ship
309+
310+What: change the owner of a `%living` ship, also resetting the Urbit public key.
311+
312+Who: current owner of the ship.
313+
314+#### Rekey a ship
315+
316+What: in a living ship, change the Urbit public key, without changing the
317+Ethereum address that owns the ship.
318+
319+Who: owner of the ship.
320+
321+#### Request adoption
322+
323+What: in a living ship, set the requested-parent field.
324+
325+Who: owner of the ship.
326+
327+#### Accept adoption
328+
329+What: in a living ship, set the current parent to the requested parent, and
330+clear the requested parent.
331+
332+Who: owner of the requested parent.
333+
334+#### Create a proposal
335+
336+What: create a proposal, which is either the hash of a document (abstract) or
337+the address of a new logic contract (concrete).
338+
339+Who: owner of any living galaxy.
340+
341+#### Endorse a proposal
342+
343+What: register support for a proposal. If the proposal is concrete and this
344+vote takes it over 50%, upgrade the contract.
345+
346+Who: any galaxy who has not yet voted on this proposal.
347+
348+### Planet sales and spark auctions
349+
350+We'll also write contracts that help galaxies and stars distribute their stars
351+and planets.
352+
353+#### An auction contract for spark sales
354+
355+The ERC20 spark token creates a liquid market in stars, or rather star
356+precursors. But a galaxy liquidating sparks may not want to just sell a large
357+block into this market, which may have weak depth, especially when the token is
358+initially launched.
359+
360+So we'll validate and deploy the Nick Johnson design for an
361+[off-chain second-price auction](https://www.reddit.com/r/ethereum/comments/6igsdq/a_proofofconcept_of_a_better_crowdsale_contract/)
362+
363+To run an auction, the seller liquidates a block of stars, then transfers the
364+spark tokens to a seller-owned copy of the auction contract. The Urbit
365+constitution is not involved with the auction.
366+
367+#### A distribution contract for planet sales
368+
369+There is no generic token for planets. To start a planet, you need a star to
370+launch it with your Ethereum address as the owner.
371+
372+To distribute planets on the blockchain, a star instantiates a private copy of
373+the planet sale contract. Since the star is the contract's owner, the contract
374+can send launch operations to the Urbit constitution.
375+
376+The star owner configures the planet sale contract with two parameters: the
377+price in ether of a planet, and the number of planets available.
378+
379+## Okay, so
380+
381+That was quite a lot of information! There's also a blog post about the constitution
382+[here](https://urbit.org/blog/interim-constitution/), and GitHub issues on the
383+[urbit/azimuth repo](https://github.com/urbit/azimuth) are more
384+than welcome.
385+
386+There's a lot more to come on this front as our contracts get closer to getting
387+live, and we begin migrating toward an on-chain Urbit PKI.
content/blog/common-objections-to-urbit.mdnew file+720
@@ -0,0 +1,720 @@
1++++
2+title = "Common Objections to Urbit"
3+date = 2016-06-28
4+description = "Some common objections to Urbit, discussed."
5+aliases = ["/posts/essays/common-objections-to-urbit", "/posts/common-objections-to-urbit", "/posts/objections/"]
6+[extra]
7+author = "Curtis Yarvin"
8+ship = "~sorreg-namtyv"
9+image ="https://storage.googleapis.com/media.urbit.org/site/posts/essays/common-objections-to-urbit-1.jpg"
10++++
11+
12+![](https://storage.googleapis.com/media.urbit.org/site/posts/essays/common-objections-to-urbit-1.jpg)
13+
14+We love crowdsourced criticism. We've heard a lot of great
15+objections to Urbit. Surely there's more out there! We'll
16+revise this document to include anything new and interesting.
17+
18+Here's our list right now:
19+
20+- [Urbit is not ready for prime time.](#prime)
21+- [Nock jets are a total hoax.](#jets)
22+- [Urbit needs an infinitely extending packet/event log.](#log)
23+- [Urbit is a total scamcoin. It's 100% premined.](#scam)
24+- [Urbit isn't even really decentralized! It has a government!](#gov)
25+- [Sandstorm/IPFS/Ethereum is way ahead of Urbit.](#sand)
26+- [Urbit doesn't have enough planets for every human being.](#planet)
27+- [Cloud computing is inherently non-private.](#pwned)
28+- [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)
30+- [Urbit programmers are stuck with Hoon.](#stuck)
31+- [Ordinary users will never be able to manage an Urbit server.](#user)
32+- [Urbit has no killer app.](#killer)
33+- [Urbit is sniffed at by Houyhnhyms.](#horse)
34+
35+_"We choose to go to the moon, not because it is easy, but because it is hard."_
36+— [John F. Kennedy](https://www.youtube.com/watch?v=g25G1M4EXrQ)
37+
38+## <a name="prime"></a>Urbit is not ready for prime time.
39+
40+*TLDR*: we agree.
41+
42+Urbit right now is a fun toy. It is fun to learn Hoon. It is
43+even fun and quite practical to make actual contributions.
44+(Hoon's IEEE floating-point was written by someone we've never
45+met: `~nym`, formerly `~nodpet-rinned`.) In fact, we have never
46+seen anyone _not_ have fun with Urbit.
47+
48+But there is all kinds of stuff wrong with the codebase. Urbit's
49+documentation 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.
52+
53+Urbit is feature-frozen. The only thing we're working on now,
54+and for the rest of 2016, is doc, debugging and and self-hosting.
55+In that order of importance -- teaching Urbit is more important
56+than fixing it, which is more important than making it useful.
57+But we're quite confident that these are all solvable problems.
58+
59+The 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
63+is expanding the number of people who understand Urbit, and we
64+expect these pioneers to participate in technical governance.
65+
66+## <a name="jets"></a>Nock jets are a total hoax.
67+
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.
70+
71+A "jet" is a sort of software device driver in Urbit. Urbit is
72+precisely defined in terms of an interpreter that fits on a
73+T-shirt, Nock. But a naive implementation of Nock is nowhere
74+near practical, because Nock has only one integer operation:
75+increment. For example, to decrement a number in Nock, you
76+increment a counter up to the number under it.
77+
78+The only way an efficient Nock interpreter can work is to
79+recognize algorithms like decrement, and implement them
80+non-naively. By far the easiest way to do this is not to analyze
81+arbitrary code as it's being executed, but to register and match
82+well-known implementations in the standard library. No one
83+should be writing their own decrement.
84+
85+But the semantics of the interpreter, _so long as the jet and the
86+jet harness are defined correctly_, are exactly those of Nock.
87+We are not extending or changing Nock in any way. We are just
88+taking a shortcut in certain cases we understand perfectly.
89+
90+It's not at all unprecedented to have implementations much more
91+complex than the corresponding specification. The x86
92+instruction set is relatively simple; the complexity of its
93+decoding and execution path in a modern CPU is enormous. This
94+path may well have "peephole optimizations" that replace matched
95+algorithms, and if it doesn't the modern compiler does. People,
96+_bad_ people, use "jets" to cheat on benchmarks all the time.
97+
98+Nock is designed as a standard. It's built like a standard.
99+Typically what causes real problems in standards is ambiguity.
100+Two 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
104+in "with enough eyeballs, all bugs are shallow" territory.
105+
106+The fact remains, however, that a Nock interpreter without jets
107+is completely useless. And there is not even an informal
108+document that tells you what jets you need for a reasonably
109+efficient Urbit. (There should be such a document.)
110+
111+The correct way to think about jets is not to compare them to a
112+perfect interpreter created by unicorns. Jets are a combined
113+replacement for two other techniques in language implementation:
114+intrinsics and a foreign-function interface.
115+
116+Compared to both intrinsics and an FFI, your jets have one key
117+disadvantage: they need to be specified in pure code. You may
118+not 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
121+against the efficient implementation?
122+
123+Compared to intrinsics, jets give you true separation between
124+mechanism and policy; only the interpreter, not the programmer
125+and not the compiler, needs to know what's accelerated.
126+
127+Compared to an FFI, jets preclude I/O, so can be trivially
128+sandboxed. Except that the programmer needs to mark routines
129+which may benefit from optimization with a hint, here too we
130+separate mechanism (efficient implementation) from policy.
131+
132+Yes, formal verification of jet equivalence is desirable.
133+However, in the real world, many specifications, including quite
134+complex ones, are tested into equivalence by brute force.
135+
136+Urbit has some jet abuses. The equivalence between our markdown
137+parser in Hoon and the CommonMark C library is super dubious. It
138+should be revisited.
139+
140+But the miscomputation resulting from a minor jet discrepancy is
141+not a security hole or even fatal. It effectively means the
142+event history, computed correctly, does not match the current
143+state. The way to resolve this conflict is for the current state
144+to win, and the event history to be discarded -- not abnormal
145+anyway. See the next question.
146+
147+## <a name="log"></a>Urbit needs an infinitely extending packet/event.
148+
149+*TLDR*: no, it doesn't. Urbit can prune the log.
150+
151+We can prune the event log because the Urbit transition function
152+doesn't have any access to the event history -- just the current
153+state and the current event.
154+
155+Urbit defines the semantics of a complete event log. It doesn't
156+and can't require an implementation to maintain the whole log.
157+It can maintain a checkpoint and the log since that checkpoint.
158+
159+However, 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
162+one or two of those!
163+
164+## <a name="scam"></a>Urbit is a total scamcoin. It's 100% premined.
165+
166+*TLDR*: yeah. But at least it's not the DAO.
167+
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
171+lousy dog.
172+
173+In real-world economics, the crucial distinction between land and
174+money is that land (a) has intrinsic utility and (b) is
175+non-fungible.
176+
177+Because 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.
181+
182+Of course, just because a digital title system doesn't need
183+mining, doesn't mean it can't distribute an initial allocation by
184+proof-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?
187+
188+Probably the purest design is the "proof-of-burn" initial
189+allocation used by some coins. By any standard, proof-of-burn is
190+technically beautiful and results in an extraordinary level of
191+ethical independence. We can't help but admire it.
192+
193+But any altcoin or metacoin is just way less work than Urbit. An
194+altcoin 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
197+to go to the moon, it's going to leave a little bit of smoke in
198+the air.
199+
200+Ethically, what makes "premining" feel wrong is that the creators
201+of the currency are rewarded disproportionately for their effort.
202+The scamcoin is a get-rich-quick scheme, vaguely pyramid-shaped.
203+Nothing about Urbit matches this pattern at all.
204+
205+Curtis invented Urbit. So by the [homestead
206+principle](https://en.wikipedia.org/wiki/Homestead_principle), he
207+started out owning all of it. But by now, Urbit's 8-bit galaxies
208+have already been distributed among [57 separate individuals](https://github.com/urbit/arvo/blob/master/sys/vane/ames.hoon#L118-L373).
209+Curtis owns 20, or about 8%.
210+
211+Tlon, 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.
214+
215+The rest of the galaxies belong to donors, investors,
216+contributors, 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
220+nothing they all have in common, which is sort of the point.
221+
222+This property distribution looks a lot like land ownership in the
223+real world -- complex and asymmetrical. That's no accident. If
224+you have a problem living in New York because New York's real
225+estate is not distributed equally among its residents, you may
226+have a similar problem with Urbit. The reality is that Urbit,
227+like New York, wasn't born yesterday and comes with a complex
228+ownership history which we couldn't possibly change, even if we
229+wanted to.
230+
231+Decentralization is hard. The only real goal of a property
232+system 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
235+seem to have unexpected centripetal qualities, producing
236+unanticipated concentrations of centralized hashpower. See the
237+next objection.
238+
239+## <a name="gov"></a>Urbit isn't even really decentralized! It has a government!
240+
241+*TLDR*: it's technically impossible for Urbit to be
242+decentralized at this stage of its life. Urbit is designed to
243+achieve decentralization, not be born with it.
244+
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
247+scrap of efficiency it can get.
248+
249+A decentralized general-purpose computing network like Urbit can
250+_only_ be bootstrapped by a central government. For example, by
251+default your urbit upgrades its OS automatically (like an
252+"evergreen" browser) with signed network updates. Whoever signs
253+these updates is a government by definition.
254+
255+When it's impossible to eliminate centralized power, it becomes
256+necessary to tame, stabilize, and limit it. This should not be
257+surprising to anyone living under a constitutional government.
258+
259+As 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
261+hard-forked to roll back the DAO (which looks like the most
262+probable result), it acknowledges that it both has a central
263+government, and needs a central government. Decentralization is
264+good. Pretend decentralization -- "decentralization theater" --
265+is harmful, and not a effective path to actual decentralization.
266+
267+A 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
269+network protocol is maintained, the Arvo kernel and Urbit system
270+can fork in all kinds of ways without disrupting the network.
271+Any stress will fragment the "government" that develops the
272+kernel, and as it fragments it grows more limited and stable.
273+
274+Urbit 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,
277+our hot updates are sent through the galaxy hierarchy; in a
278+development fork, active galaxies would pick upstream sources.
279+Two implementations of a standard are better than one.
280+
281+And by fragmenting the galaxy space into 57 separate partitions,
282+we've created a global property map which is much more likely to
283+splinter further, than reunite.
284+
285+In 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
288+reason to merge ownership is to move toward incipient monopoly.
289+Whether a galaxy admits this openly or denies it dishonestly, its
290+reputation will suffer.
291+
292+The technical goal of Urbit is to create a network which, _if it
293+actually takes over the world_, inevitably becomes decentralized.
294+Even if Urbit takes over the world, no individual or coherent
295+organization takes over the world. There is nothing even close
296+to a single point of failure in a mature, successful Urbit.
297+
298+This is the goal of all the new "web3" decentralized systems. If
299+IPFS, Sandstorm or Ethereum takes over the world, nobody takes
300+over the world. (The same is almost true of the Internet --
301+though it wouldn't be that surprising if a time traveler from
302+2116 revealed that ICANN had become a planetary government.)
303+
304+Urbit, by starting out as a centralized network, just reduces the
305+technical problem to match the actual goal. Only long-term
306+decentralization matters.
307+
308+It's very important that Urbit in 2116 be fully decentralized.
309+For 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
311+-- since the property system is still just a central registry.
312+Among other things, we check it into GitHub. GitHub is not a
313+blockchain -- but still, good luck with that.
314+
315+## <a name="sand"></a>Sandstorm/IPFS/Ethereum is way ahead of Urbit.
316+
317+In general, web3 (next distributed web) solutions don't compete
318+with each other. They support each other. Concretely, they are
319+all part of each others' network effect.
320+
321+IPFS, Sandstorm, Ethereum, and Urbit can all take over the world
322+at the same time. None of them competes with the others. They
323+enable each other.
324+
325+For 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
329+isn't a computer; the work hasn't been done, but Urbit can easily
330+mount the IPFS namespace and compute functionally against it.
331+
332+So the better IPFS does, the less Urbit needs to struggle against
333+its lack of network effect. The better Urbit does, the easier it
334+is for IPFS to point to a functional language that can actually
335+use its referential transparency directly. So their relationship
336+is symbiotic, not competitive at all.
337+
338+The closest thing to a general-purpose competitor that Urbit has
339+is Sandstorm. Sandstorm, which by the way rocks, is also a
340+personal server built around a network protocol.
341+
342+But 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
344+problems that the browser solves; or the browser could be the OS.
345+In practice, Windows is a great OS to run a browser on.
346+
347+Similarly, a world in which Sandstorm takes off is an awesome
348+world for Urbit, because everyone who has a Sandstorm instance
349+has a great platform for running Urbit on. Urbit on Sandstorm
350+will be a sort of "double-hulled" personal server, safer and more
351+friendly than either system alone.
352+
353+Sandstorm and Urbit have very different approaches to network
354+identification; Sandstorm uses capabilities, Urbit identity.
355+Broadly speaking, we believe, capabilities are optimal for
356+expressive power; but identity is optimal for the UI of the
357+common case. We'd need to see the Powerbox, Sandstorm's UI, more
358+fully fleshed out to understand its UI approach better.
359+
360+## <a name="planet"></a>Urbit doesn't have enough planets for every human
361+
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
364+cars in the world, nor 4 billion independent adults.
365+
366+If you aren't an independent adult, and you don't need or even
367+shouldn't have unconditional digital freedom (no one's 8-year-old
368+daughter needs unconditional digital freedom), a moon from
369+someone else's planet is fine. (Even most of today's independent
370+adults don't complain enough about being Facebook's moons.)
371+
372+And 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
375+magnitude either way, and it wouldn't be the end of the world.
376+
377+If a planet costs $10, that means you paid $10 to get a planet.
378+A planet with no reputation has a positive reputation, because
379+someone paid $10 for it and hasn't yet done anything wrong.
380+Positive default reputation is the single quality that makes a
381+social network social.
382+
383+There is always a tradeoff between free speech and free beer.
384+Urbit will always choose free speech.
385+
386+## <a name="pwned"></a>Cloud computing is inherently non-private.
387+
388+*TLDR*: a general-purpose cloud computer is much, much more
389+private than a special-purpose cloud computer. In general, a
390+cloud VM is secure against corporations but not governments.
391+With a global adversary, compute in your closet -- or even on
392+your body.
393+
394+One 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
398+spy on it?
399+
400+A general-purpose virtual machine is special from a privacy
401+standpoint, just because it's commercially realistic to design
402+terms of service that prevent the host from peeking and poking at
403+the customer's machine. Crossing this moat is technically
404+nontrivial and can't possibly happen by any reasonable accident.
405+No hosting contract could contemplate it.
406+
407+Whereas when your cloud computer is a special-purpose machine --
408+just a database row on some corporation's mainframe -- there is
409+no way these services can promise not to handle your data.
410+Handling your data is _what they do_. On a special-purpose
411+server, the concept of privacy is not even defined.
412+
413+Where even a general-purpose server falls down is where the user
414+has a sovereign adversary, which can secretly violate explicit or
415+implicit hosting contracts. Users with a sovereign adversary
416+must rely only on their own physical security.
417+
418+However, most users don't have a sovereign adversary. And those
419+who do maximize their "herd immunity" if they can use the same
420+protocols as those who don't. Otherwise, the adversary could
421+simply focus on everyone who uses the secure protocols.
422+
423+Also, the portability of a cloud server image is critical. Of
424+course, since Urbit is formally specified, it's trivially
425+portable. In fact, one strategy against sovereign adversaries
426+may be continuous rotation between hosts, like an MX missile.
427+
428+## <a name="code"></a>Urbit will never be able to call any existing code.
429+
430+*TLDR*: neither will Javascript. And dear Unix, the browser
431+does not miss interacting with your `$LD_LIBRARY_PATH` at all.
432+
433+You can't talk to the OS or use system libraries from Javascript.
434+Therefore, there is no point in having any kind of gateway,
435+compatibility bridge, native methods, or other interface between
436+Javascript and C.
437+
438+When in doubt, remember that Urbit is "the browser for the server
439+side." It plays by the same general rules. Isolation means
440+isolation.
441+
442+## <a name="weird"></a>There's no way Urbit will ever be adopted. It's too weird.
443+
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
446+working on it -- come help.
447+
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.
451+
452+But it's absolutely wrong to think of Urbit being adopted as a
453+developer tool in the conventional sense. If you think this is
454+almost impossible, you're right.
455+
456+If 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
460+not trying to do this.
461+
462+C 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
464+native language of Unix, and people wanted to program in Unix.
465+People don't use Javascript because Javascript is a great
466+language, but because it's the native language of the browser.
467+Replacing the native language of a platform may be doable -- but
468+it's incredibly hard.
469+
470+Hoon 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
474+is to run a personal server.
475+
476+Nock is cool, but it only gets adopted if Hoon gets adopted.
477+Hoon is cool, but it only gets adopted if Urbit gets adopted.
478+Urbit only gets adopted if it's useful as a personal server for
479+human beings -- most of whom won't be Hoon programmers, or
480+programmers at all.
481+
482+## <a name="program"></a>Hoon is too weird. No one will be able to program in it.
483+
484+*TLDR*: Hoon is ridiculously simple. Our documentation and
485+tooling are just immature.
486+
487+It's pretty fair to assume that (a) functional programming is
488+hard and weird, (b) Hoon is weird even for a functional language,
489+so (c) Hoon must be hard-squared.
490+
491+Actually, Hoon is weird even for a functional language because
492+it's an attempt to remove the hardest things about functional
493+programming: category theory, lazy evaluation, and gratuitous
494+abstraction. To know a language is to know what the compiler is
495+doing; all the semantics of the Hoon compiler fit in 2000 lines
496+of code.
497+
498+It's too easy for us to wind up living in Isaac Asimov's Trantor,
499+a world in which everything got invented thousands of years ago
500+and the idea of new technology is just weird and scary. History
501+isn't over yet, and nor is technical history.
502+
503+New things are harder to learn than old things. We ask smart
504+high-school students to learn calculus. Think about how much
505+harder 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
507+as calculus.
508+
509+Most of the difference is just the collective certainty that our
510+society conveys to a high-school student that calculus is
511+learnable. When you're learning Urbit, you don't have this
512+collective knowledge; so you don't have the confidence that the
513+problem is solvable. Confidence makes a huge difference.
514+Moreover, any bug or glitch in the developer experience destroys
515+this confidence and takes a long time to heal.
516+
517+Yes, we know: Hoon remains quite hard to learn. Again, we have
518+no reason to think this problem isn't solvable. Public
519+enlightenment remains our main priority.
520+
521+## <a name="stuck"></a>Urbit programmers are stuck with Hoon.
522+
523+*TLDR*: patience, grasshopper.
524+
525+There'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.
528+
529+It is not clear that Javascript is _quite_ well-defined enough
530+for this treatment. But Lua probably is.
531+
532+## <a name="user"></a>Ordinary users will never be able to manage an Urbit server.
533+
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.
537+
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?
540+
541+This Urbit isn't the real Urbit. It's an early milestone on the
542+way to the real Urbit.
543+
544+The 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
547+not even know it can run more apps than the ones they use.
548+
549+A deterministic, persistent cloud computer is something different
550+from a traditional server. Normally when we think of a server in
551+the 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
553+more like a rock -- you can forget about it for ten years.
554+
555+An 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
557+it 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
559+it's something in between a rock and an animal -- a cactus?
560+
561+Another huge difference versus an Internet server is that we're
562+confident that Urbit's limited supply of identities will make it
563+easy to keep abusers off the network. So far, so good -- but of
564+course, no one abuses a young network.
565+
566+The bottom line is that managing your urbit has to be as easy as
567+managing your iPhone. Normally, it consists of deciding what
568+apps you want to be running, and how much you trust them.
569+Resources can't be free, so sometimes you have to play memory
570+police. Humans have shown that they can handle these tasks.
571+
572+Our '70s OSes and networks, which were great designs in their day
573+and have matured into excellent industrial tools, give us a
574+totally 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
577+an industrial tool, but not a personal tool.
578+
579+## <a name="killer"></a>Urbit has no killer app.
580+
581+*TLDR*: the killer app is personal API aggregation.
582+
583+It's a truism that any new platform has to be fundamentally much
584+better at solving some problem than the mature platform it seeks
585+to replace.
586+
587+We can look at Urbit's killer app from two perspectives: as a
588+developer, and as a user.
589+
590+From the developer's perspective, Urbit's advantage is that it's
591+a network stack which provides exactly-once delivery of typed,
592+validated, transactional, encrypted and authenticated messages.
593+The 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
595+hand, you do need to learn a new functional language.
596+
597+From the user's perspective, there's one task that any personal
598+server can perform, that can't be performed by any Web service:
599+unrestricted API aggregation.
600+
601+Well before Urbit is ready to _replace_ any conventional web
602+services, 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
604+control of your own data, it's fine to leave it in the hands of
605+these services, as you have the API secrets to get it out.
606+
607+Managing a set of security connections to your existing services
608+is one of the first important tasks of a modern personal server.
609+This is a stateful task that typically requires both a durable
610+API key and a temporary OAuth token. APIs change all the time,
611+so connection maintenance also requires evergreen updates.
612+
613+The origin of this API key will vary, but usually the best way to
614+set it is BYOK: the user registers their own urbit as an "app."
615+And the neat thing about having your own API keys, for multiple
616+services, on a single general-purpose computer, is that none of
617+these services really has any practical way to control what you
618+do with your own data.
619+
620+Terms of service which constrain the use of data (as opposed to
621+the abuse of the service) simply aren't realistic and will no
622+longer apply. This enables a variety of novel user experiences
623+which aren't implementable as traditional web services, and also
624+aren't available via conventional third-party API aggregators.
625+
626+Also, since Urbit is after all quite immature, it doesn't make
627+much sense to restrict this security state to code within Urbit.
628+The Urbit interpreter `vere` runs as a Unix daemon that
629+implements the FUSE user-level filesystem protocol, and maps the
630+data on your services into the Unix filesystem. For example, one
631+of our demos lets you `ls` your GitHub issues.
632+
633+So 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
635+Unix programmer, you might even just regard Urbit as a generic
636+Web API gateway daemon, without worrying about its internals.
637+
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.
640+Stateful, self-updating, generic API aggregators with FUSE
641+integration, also integrated with a reactive web server, are
642+rarer.
643+
644+## <a name="horse"></a> Urbit is sniffed at by Houyhnhyms.
645+
646+It's difficult to categorize [this awesome
647+essay](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.
649+
650+When reading this essay, it's important not to forget the amazing
651+absence 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
654+discourse decreases, not increases, with increasing academic
655+legitimacy.
656+
657+The basic test of any field purportedly scientific in nature is
658+whether its researchers are genuinely interested in each others'
659+work, and willing to share these genuine responses publicly. If
660+this practice does not exist, the field may still be useful
661+and/or interesting. But it is not science.
662+
663+What's awesome about Fare's essay is that he's _doing it right_.
664+All the actual details are irrelevant. And mostly wrong. But
665+that's of very little importance compared to _doing it right_.
666+
667+Anyway, we've already addressed the idea that jets are a sham.
668+Some other points:
669+
670+### Event-sourcing and/or caching is a pattern, not a layer
671+
672+Fare' is perfectly right that "one size does not fit all" in
673+persistence. Generally, Urbit uses event-sourced persistence.
674+
675+But it has multiple layers of event-sourcing: in the definition
676+of Urbit itself; in the application sandbox vane (Gall), and in
677+the application itself. Urbit also has a completely orthogonal
678+revision control system (Clay).
679+
680+And there is not a single cache across the whole system, though
681+arguably there should be; for instance, the functional build
682+system (Ford, which Fare' the master of build systems might
683+appreciate) has its own internal cache.
684+
685+It is a common mistake to confuse a design pattern with a layer
686+or feature, and equally fatal whichever direction you fail.
687+
688+### Let's be clear about why DSLs suck
689+
690+DSLs suck not because they are difficult to newbies in the base
691+language. DSLs suck because every time a programmer, even one
692+_experienced_ in the base language, comes into a new codebase or
693+project, she has to learn a new custom language.
694+
695+You need enormous wins to justify this cost. It's the goal of
696+the base language designer to preempt these wins, creating a
697+language which is almost never so tiresome and full of
698+boilerplate that it requires a DSL or template layer.
699+
700+Hoon 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.
704+
705+### Determinism is not consensus, and is not constraining
706+
707+Fare' 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
710+gain any particular advantage by incorrect computing.
711+
712+The 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
715+practical standardization.
716+
717+This consistency stops at Nock. Without anyone violating the
718+correctness of their lifecycle functions, anyone or everyone in
719+Urbit could replace Hoon with Javascript. Determinism does not
720+cramp Urbit's semantic style in any way, shape or form.
content/blog/community-spotlight-the-portico.mdnew file+137
@@ -0,0 +1,137 @@
1++++
2+title = "Community Spotlight: The Portico"
3+date = 2021-05-04
4+description = "Interview with The Portico founder Josh Reagan"
5+[extra]
6+author = "~tirwyd-sarmes"
7+ship = "~tirwyd-sarmes"
8+image = "https://media.urbit.org/site/posts/essays/orthodoxchurch.jpg"
9++++
10+
11+![](https://media.urbit.org/site/posts/essays/orthodoxchurch.jpg)
12+
13+*One of the most striking things about Urbit is the ideological diversity between communities. The Community Spotlight blog series will focus on various Urbit communities via interviews with founding members.*
14+
15+For the first week of the Community Spotlight series, I (~tirwyd-sarmes) will be speaking with Josh Reagan (~taglux-nidsep). Josh is the founder of The Portico, an Urbit community of Eastern Orthodox Christians.
16+
17+The Portico is a very active group with conversations taking place over multiple channels. There are channels for posting Orthodox iconography, discussing the broader Christian culture war, and just talking about Orthodoxy in general. Of particular interest is Josh’s “Euthyphro” blog series which investigates the relationship between logic and the Orthodox faith. This is a topic that Josh is well qualified to talk about: he has a PhD in Philosophy from Rice University. His dissertation on the epistemology of logic and truth-preservation was titled "Knowing Your Limits: Logic for Limited Beings”. Josh is also the co-author of a forthcoming textbook on formal logic.
18+
19+To read Josh’s blog is to be inducted into two esoteric traditions: theory of logic and Orthodox theology. With titles like “St. Gregory the Theologian and the Liar Paradox” and “The Existence of Abstract Objects”, Josh does not pull punches.
20+
21+Accordingly, our conversation focused on the idiosyncratic and niche community that The Portico is home to. There, you won’t find cussing or much talk about “life partners”, but you will find cutting critiques of liberalism and the best way to raise Orthodox children.
22+
23+As other users have pointed out, Urbit is pre-[Eternal September](https://en.wikipedia.org/wiki/Eternal_September). In fact, there’s some hope that the very nature of Urbit, how it tries to protect the sovereignty of niche communities via decentralization, might foil the Eternal September phenomenon. If Josh’s community persists, it will be a testament to both Josh and the decentralized Urbit network. As of now The Portico is a refreshing, perhaps jarring (as Josh might say), reminder of what the internet looked like back in the early days—a place for those who are different.
24+
25+I encourage you to take a look. Find The Portico at ~topnup-firber/the-portico.
26+
27+\-\-\-\-
28+
29+**Do you see any connection between Rod Dreher’s *The Benedict Option* and your community on Urbit? Dreher sees a need for American Christians to create self-sustaining communities outside of the mainstream to protect the Christian religion and culture.**
30+
31+It’s tough to say with certainty—I’ve never read *The Benedict Option*.
32+
33+A few years ago, while he was writing the book, I was a regular reader of Dreher’s blog. From his descriptions there, I was never clear about what exactly he was proposing. Much of his “clarification” came by way of metaphor: don’t “run for the hills”, but stop “shoring up the American imperium”. I didn’t read his book because I didn’t have much confidence that he would be especially precise or insightful.
34+
35+[There is an interesting review I’d recommend](https://handleshaus.wordpress.com/2020/10/06/review-of-rod-drehers-live-not-by-lies/), however, of his later book, *Live Not By Lies*. I believe it accurately characterizes the scale of the threat Christians will soon face in this country.
36+
37+My upbringing was conservative Christian and self-consciously counter-cultural. I've inherited that understanding of what it means to be a Christian in an increasingly secular world. It comes naturally to me, so I find it obvious that Christians should form self-sustaining communities. But the details matter. What do such communities look like? How do we secure the freedom to pursue such communities? How do we sustain them, when myriad external forces seek to undermine them? How do we solve the long-term problem of the declining cultural importance of Christianity (which surely erodes the plausibility of our religion to many, even to some of those with sympathies toward it)?
38+
39+I don’t claim to know the answers to these questions.
40+
41+One kind of answer is that we should redouble our efforts to support and maintain a religiously and morally neutral liberal political order, which leaves room for subcultures to live and self-regulate as they wish. I disagree. Those who support a kind of “neutral” liberalism view it as an attempt to go “meta” and rise above various parochial metaphysical, moral, and religious disputes. I view this as a cop-out, a refusal to grapple with the most important questions.
42+
43+Does the liberal have metaphysically-rooted moral reasons for going “meta”? If so, then he’s just another sectarian and he should be honest about it. The only difference is that his team has had the whip hand for the last several generations. On the other hand, if the liberal claims no underlying metaphysical justification then his project can succeed only to the extent that he can arrange and adjudicate unprincipled (and therefore ad hoc) agreements between otherwise hostile moral communities. But how stable can such an arrangement really be?
44+
45+Orthodox Christians have theologically rich, metaphysical foundations for their social and moral teachings. With these we can form healthy, thriving, and growing communities. We can do so even under actively hostile political orders. If the early Church could make it under the Romans, so can we today. But it’s going to be difficult and sound judgment is necessary. Unfortunately, we lack strong leadership and that leaves us vulnerable. If we stay uncoordinated we dissipate our energies needlessly. If we latch onto the wrong leaders we can be led astray.
46+
47+The challenges are immense. There is no technological solution. Even so, I’m an Urbit early-adopter for a reason. Over the years I’ve come into contact with a number of Orthodox and Ortho-curious Urbit followers. Why not try to bring them together in an Urbit group?
48+
49+As far as I know, no one in the group is clergy. We’re all just a bunch of laymen with no authority to do much of anything. But I’d like to think we can still contribute in some way. I have an academic background in analytic philosophy so my inclination is to emphasize theory, but we have room for a bit of everything. Someone in the group wrote a script to take the texts of various Church Fathers and convert them to audio using AWS Polly. Those turned out pretty well!
50+
51+At times I entertain ambitions to do a bit more, but for now perhaps it’s better to keep expectations in check. If nothing else, we can read and discuss the Scriptures and Church Fathers together, and try to understand better how to apply and live out their teachings. As we continue to grow the community and develop a consistent internal dynamic perhaps opportunities will arise that aren’t yet on the horizon. One thing I can say is that I’m committed to keeping the group active and growing.
52+
53+**I’d like to talk about your blog on The Portico. It combines two of your main interests: logic and theology. In broad strokes, do you think theology and logic are compatible? What is the relevance of this intersection to both of these disciplines?**
54+
55+I feel obligated to answer this question in two ways.
56+
57+(1) If by “logic” you mean “first-order predicate calculus”, then I think there’s no special conflict between logic and theology. There are certain puzzles about their relationship, but similar puzzles exist between logic and other disciplines. Theology isn't especially endangered.
58+
59+For example, in the 1930s, Alfred Tarski proved his famous Undefinability Theorem. Crudely put, it says that a plausible truth predicate cannot consistently be contained in any formal system with axioms strong enough to model arithmetic. Superficially it seems like our options are (a) get rid of the concept of truth, (b) get rid of arithmetic, or (c) throw away parts of logic until all inconsistency disappears.
60+
61+None of these options is appealing. Tarski came up with a solution that mostly satisfies many logicians: reduce the concept of truth to “truth in a language” and forbid any language from containing its own truth predicate. If you want to talk about truth in a language L-1, you have to do it from a “metalanguage”, L-2.
62+
63+Is Tarski’s definition of truth in a language the definitive solution for preserving truth, math, and logic? Perhaps not many philosophers think so, and there’s a massive literature in which logicians have attempted to improve on or extend his results.
64+
65+Sometimes people seem to think formal logic is an infallible gift from heaven that must always be right. Kant said in the *Critique of Pure Reason* that formal logic is essentially a completed field. In fact, [the logic of his day](https://en.wikipedia.org/wiki/Port-Royal_Logic) was an early-modern Cartesian variation of a medieval scholastic synthesis of ancient Stoic and Aristotelian logics. Roughly 100 years after Kant’s first critique was published, C. S. Peirce and Gottlob Frege independently discovered first-order mathematical logic as we know it today, inaugurating the greatest advance of logic since Aristotle. Kant was wrong.
66+
67+Mathematical logic is a convenient, generally reliable, man-made tool that, when used carelessly in certain untamed domains, can lead one astray. Probably most people reading this are familiar with such puzzles as the Liar paradox. When one understands that logic is not a completed science, and perhaps never will be, there is less reason to worry about whether it can be used to nuke entire disciplines, like theology.
68+
69+For more on this topic, see the blog post in my Urbit group: “St. Gregory the Theologian and the Liar Paradox”.
70+
71+(2) There is perhaps a deeper challenge than the one I’ve just sketched. The Stoics used the term “logic” to encompass what we might today call “epistemology”. If the word “logic” is meant in some such broad and normative sense, then we may restate the challenge as one about rationality and theology. Is it irrational to pursue theology in our modern age?
72+
73+As an undergraduate under the influence of Kierkegaard, I was attracted to a romantic, vaguely irrationalist notion of faith. Dawkins-mania was at its peak and I was disgusted by the pop-rationality (or was it empiricism?) of his annoying followers. Their view seemed to be that rationality just means “following the evidence”. The raw evidence is foundational, and theories are built atop by generalizing from the evidence. The ghost of logical positivism is with us even now.
74+
75+I was dimly aware that Quine and others had made it difficult to sustain epistemic foundationalism. However, being unable to supply a more clear and cogent notion of rationality, I became skeptical of the idea altogether. But I went too far.
76+
77+Instead, the proper response is to develop a superior account of rationality. Readers can probably guess where I went looking!
78+
79+The word “logic” comes from the Greek “λόγος”. This is also the word used to describe Jesus Christ in the Gospel of John: “In the beginning was the Logos, and the Logos was with God, and the Logos was God.” This connection is not merely etymological.
80+
81+For many ancients, the term “λόγος” meant something like “divine principle”. You might think of it as akin to a law of nature, but with stronger theological connotations. Christians appropriated this term and made it rather more exalted: the Logos is begotten of the Father, and yet somehow one with Him.
82+
83+We are told that all things come into being through the Logos (John 1:3), giving Him an intimate relationship to the whole of creation. He gives structure and order to all created things, and in His divinity He understands them as so structured and ordered. He is also sinless, perfectly holy, and good. In Christ we have a perfect unity of the knowledge of all truth and righteousness.
84+
85+Man was created in the image of God, which means that we bear a likeness to Christ. And we are commanded to realize that likeness with ever greater fidelity (Romans 8:29). The Church calls the pursuit of this likeness [“theosis”](https://en.wikipedia.org/wiki/Theosis_(Eastern_Christian_theology)).
86+
87+Thus we have the explanation of all normativity, according to Orthodox Christianity. In moral matters we must take on the holiness of Christ. In epistemic matters we aspire to the wisdom and knowledge of Christ, which includes an understanding of the whole created order. Socially we (the community of believers, i.e. the Church) are called to be in ever greater communion with God, cooperating with His work just as the Son cooperates with the Father.
88+
89+Sadly we are conceived in sin and ignorant; hence the need for redemption by Christ.
90+
91+Accordingly, my understanding of what it means to be rational is just to be Christ-like. The only perfect exemplar of reason, so construed, is Christ Himself. Any deviation from Him is irrational. What could be more logical than to be conformed to the Logos? But we cannot attain rationality without redemption. Hence we cannot become rational without first being saved from sin.
92+
93+Doubtlessly many will find all of this too much to take, just too implausible. What about the development of mathematics, or the advances of the sciences? These are canonically ennobling, intellectual achievements. Jesus wasn’t a mathematician or a scientist! Nowhere in the Scriptures is He recorded as having applied Bayes’ theorem.
94+
95+Undoubtedly my construal of rationality de-emphasizes the pursuit of knowledge by labeling it as merely one of several normative ends. To seek knowledge without seeking holiness is to be understood as dangerously unbalanced. To try to attain holiness and knowledge without communion with God is arrogant.
96+
97+On the other hand, we need not exaggerate matters. St. Paul affirms the need for specialization of labor within the Church (1 Cor. 12). There is room for some to specialize in intellectual endeavors, so long as they act in a cooperative setting in which the other virtues are pursued as well. (Nor should anyone neglect the development of such virtues in himself.) Mathematicians and physicists are more than welcome in the Church.
98+
99+According to this (all too briefly put) theory of rationality, there can be no conflict between ‘logic’ and theology. Theology is compatible with rationality because the account of rationality in question derives from a theological tradition. Naturally I’ve only given a sketch; much more could be said. But even if some readers are put off by the theory presented here, I hope it’s at least clear that there are conflicting notions of rationality. Anyone who wants to be rational confronts the task of figuring out which theory of rationality is correct.
100+
101+**In terms of community moderation, The Portico follows norms that are quite different than other online communities, often times quite drastically. For instance, living with women that you are not married to, is not something that should be talked about lightly. Can you talk about the importance of norms and how they relate to a healthy community?**
102+
103+Orthodox Christians are not commanded to “get along” with the rest of the world (John 15:18-25). We’re different, and our norms of interaction should likewise differ from those of outsiders. There is no one, monolithic “Orthodox culture”, but there are standards governing which local expressions of culture are legitimate and which are sinful. We should live in a way that enables and promotes holiness and discourages sin.
104+
105+We have rules that may seem unusual from the outside. I don’t permit profanity, lewd jokes, or irreverent comments about God. In your question you mention a living arrangement that is prevalent in the world. Another rule I have is that we shouldn’t talk causally about sinful practices or lifestyles as if they are unremarkable parts of ordinary life. If Orthodox Christianity is true then such things aren’t minor peccadilloes. They’re spiritually destructive. The marriage-bond sanctifies activities that would otherwise be sinful.
106+
107+If someone wants to analyze what is destructive about men and women living together before marriage, we’re open to that. But if you want to be affirmed in your sin, we’re not the place for you. Anyone of any religious creed is welcome to show up—but as a guest in an Orthodox Christian community. Hosts should be courteous to guests, but my first priority is not to make you feel good about your choices. We’re here to encourage each other, learn, and grow spiritually as Orthodox Christians. Naturally that means a little gate-keeping may sometimes be necessary if someone ever comes along who doesn’t share those goals. Being different is difficult and takes work.
108+
109+In a way the cultural contrast is meant to be jarring. It can force you to confront moral and cultural presuppositions that you didn’t even know you had. When you become aware of the wider choices of culture available to you, you become free to look with a critical eye on the culture you’ve hitherto taken for granted. I think anyone could see how that might be liberating, even before considering the particulars of the cultures in question. Of course, as an Orthodox Christian, I think we have a good case to make about the particulars of our subculture.
110+
111+I’ve never had to kick or ban anyone from the group. The group is relatively small (~180 people at the moment) so that probably helps. The vast majority of conversations are relaxed and friendly. Occasionally there are intense debates about one issue or another but I enjoy it, as long as it doesn’t become bitter or the primary mode of discourse. But everything ought to be done in a spirit of truth-seeking, not of one-upmanship.
112+
113+**The fact that The Portico can exist side-by-side with atheist communities on Urbit is pretty striking. On Urbit, a user is able to create niche communities and governance structures and yet still participate in a larger network. In other words, Urbit is trying to thread the needle between sameness and difference through federation at multiple levels. It seems to me that modern culture has become homogeneous due to an inability to maintain, or distinguish between, different communities. People who have nothing in common are forced to engage as if they were roommates, while those who are similar have trouble creating their own home. In other words, what is the role of community formation in the modern world and how does it connect to your critique of liberalism? Does Urbit have anything to say about this?**
114+
115+As I said in an earlier response, I see the liberal project as more or less an attempt to sidestep (not solve) difficult metaphysical and religious disputes between various distinct moral communities. Liberals have tried several methods of governance to achieve their ends. We can divide such attempts into two broad categories: centralized and decentralized.
116+
117+Social media companies in the US confront similar governance challenges, so we can analyze them in similar terms.
118+
119+A social network like Facebook takes a centralized approach. Zuckerberg spoke early and often of his desire to connect people and “bring the world closer together”. There was a sense that if people from various communities could get to know each other a little better, we would see how much we have in common and make progress toward some kind of universal cosmopolitan consensus.
120+
121+But that didn’t happen. With centralized social media you’re practically guaranteed to interact with people whose moral and metaphysical commitments are sharply at odds with your own. As a result, you face a persistent, nagging risk of conflict. Without warning, a friendly disagreement can explode into an all-out flame war. Most choose one of two basic approaches for dealing with this threat:
122+
123+(1) You live a compartmentalized life. You keep your moral and metaphysical commitments to yourself and cultivate a culturally homogenized persona for your social media activities. No one disagrees with you because there’s nothing to disagree with.
124+
125+(2) You can enlist to fight in the culture war and display your regimental colors with pride. And because you take your smartphone everywhere you’re always on the front line.
126+
127+These aren’t the only options, of course. With some combination of charisma, patience, and grace you can be relatively open about your beliefs without getting into too much trouble. But even if you have the talent to pull it off, it takes time and energy. Many of us aren’t willing to go to all that trouble. Social media is supposed to serve us, not the other way around.
128+
129+Urbit is decentralized which, in my opinion, means that it isn’t really a network in the way that Facebook is. I see Urbit as more of a network platform. The users create the networks, or migrate them in from elsewhere. We’re all using Landscape and running our VMs on Nock, so obviously there can be interaction between different communities. But anyone who doesn’t want that cross-community interaction doesn’t have to have it.
130+
131+I’ve followed Urbit’s progress since 2016, so I’m plugged into groups with other Urbit people I’ve come to know over the years. Other than that, however, I don’t know much about who’s out there. It’s not like The Portico is in one neighborhood and the atheists are in the next neighborhood over. There’s a real sense in which we’re not even on the same network—different Urbit communities share a common protocol, but a protocol isn’t a network.
132+
133+Some people may want to see a little of everything. If atheists want to join our group they’re welcome to do so! We’ll be friendly. I don’t seek out their groups, though.
134+
135+One virtue of decentralized social media is that it offers a totally different set of trade-offs with respect to how you share and act on your beliefs. What if you could talk earnestly about philosophy and religion without having to worry about alienating many of your friends and family? I guess that’s somewhat possible on Facebook—do they still have “groups”?—but Urbit was designed for it.
136+
137+Having said all that, I don’t think decentralization is a panacea. Even if Urbit takes off, it will likely face problems that are difficult to anticipate now. My hope is simply that Urbit’s trade-offs are healthier than the ones we’ve had before.
content/blog/creating-sigils.mdnew file+170
@@ -0,0 +1,170 @@
1++++
2+title = "Creating Sigils"
3+date = 2020-02-04
4+description = "The origin and design process informing Urbit's generative user avatar system, Sigils."
5+[extra]
6+author = "Gavin Atkinson"
7+ship = "~ridlur-figbud"
8+image ="https://media.urbit.org/site/posts/essays/sigils3.png"
9++++
10+
11+<!-- ![](https://media.urbit.org/site/blog-9.jpg) -->
12+![](https://media.urbit.org/site/posts/essays/sigils0-v3.png)
13+
14+One 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/).)
15+
16+Your Urbit ID is meant to feel a bit like a secret code name. It doesn’t leak any information about the real you — but it’s still memorable and recognizable. Getting an Urbit ID should feel exciting, like getting a brand new identity in a new world.
17+
18+From a design standpoint, some of this is accomplished simply by having a system for the names themselves. Under the hood, Urbit IDs are actually just numbers. There has always been an algorithm for turning these numbers into pronounceable names like `~tacryt-socryp` (13,304,832) or `~litzod` (1,280) or `~nes` (212).
19+
20+While the names are great, they’re not quite enough, especially in a rich interface. Each Urbit ID really needed some form of visual representation, image, or crest. A digital identity needs to be something you can really attach to, both yours and those that belong to your friends.
21+
22+There are 2<sup>32</sup> or 4.2 billion unique Urbit IDs. Clearly there’s no way that we were going to do this by hand. And purely algorithmic solutions can often produce disappointing, undifferentiated output.
23+
24+Regardless, we set out to tackle this problem. By the end of this process, every Urbit ID got its very own ‘sigil.’
25+
26+In this post we’ll walk through how we thought about the problem, iterated through possible solutions, and the toolchain we used to arrive at the final result.
27+
28+## Background
29+
30+What are the basic primitives of a visual language? There aren’t any completely authoritative answers to this question, of course. But we knew that to produce such a large number of visually distinct items we’d need some way to reason about form that’s closer to letterforms.
31+
32+So we started by collecting influences.
33+
34+<iframe class="arena-iframe" width="100%" src="https://www.are.na/tlon/seal-zp3irwad52y/embed"></iframe>
35+
36+The ‘chop’ or [seal](https://en.wikipedia.org/wiki/Seal_(East_Asia)) is conceptually pretty close to what we wanted to get to.
37+
38+<br /><br />
39+
40+<iframe class="arena-iframe" width="100%" src="https://www.are.na/tlon/kamon/embed"></iframe>
41+
42+[Kamon](https://en.wikipedia.org/wiki/Mon_(emblem)) are even closer — especially since they have very little visual complexity.
43+
44+<br /><br />
45+
46+<iframe class="arena-iframe" width="100%" src="https://www.are.na/tlon/grids-jd_xbmspxkm/embed"></iframe>
47+
48+We also spent a good amount of time with both Anni Albers and Agnes Martin. Both of these painters had an incredible mastery of the grid as a means of creating engaging visual work. These paintings all have a wonderful tension between an underlying system and their specific expression.
49+
50+<br /><br />
51+
52+<iframe class="arena-iframe" width="100%" src="https://www.are.na/tlon/stella-xfroicotm_4/embed"></iframe>
53+
54+Frank Stella is a master at producing incredibly dynamic work from only a few elements. His ability to create a sense of depth from simple overlapping elements is fantastic.
55+
56+<br /><br />
57+
58+<iframe class="arena-iframe" width="100%" src="https://www.are.na/tlon/ledoux-palladio/embed"></iframe>
59+
60+The plans of both Ledoux and Palladio are incredibly dynamic. They’re mostly gridded, use only a few elements, and use lots of symmetry — but they’re at once distinct, engaging, and fresh.
61+
62+<br /><br />
63+
64+<iframe class="arena-iframe" width="100%" src="https://www.are.na/tlon/flags-k9moxiayuvq/embed"></iframe>
65+
66+Another influence: international maritime signal flags. We like these not only because of their striking visual qualities, but also because they correspond with a letter system, just like our sigils. Each one conveys useful information; for example, “Keep clear of me; I am maneuvering with difficulty,” a flag we all feel like raising from time to time. This influence was key to the idea that pairing symbol to phoneme was a possibility.
67+
68+You can see the whole collection of our visual research [here](https://www.are.na/tlon/2019-sigils-research).
69+
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.
71+
72+## What’s in a name?
73+
74+> *“Lev’s sigil appeared, strobing, as Netherton was getting out of the cab in Henrietta Street. “Yes?” Netherton asked.”*
75+>
76+> <cite>— William Gibson, The Peripheral</cite>
77+
78+Before we get to how we worked through the problem of actually designing these things, let’s talk about the problem of naming.
79+
80+We 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.
81+
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.
83+
84+While we can’t point to any specific parts of our visual research that reappear directly, sigil is lovingly borrowed.
85+
86+## Experiments + iterations
87+
88+So, how did we actually end up making these things?
89+
90+We iterated through plenty of possibilities before landing on our final approach. Let’s walk through the two we remember best.
91+
92+<br /><br />
93+
94+![](https://media.urbit.org/site/posts/essays/sigils1-v2.png)
95+
96+The first attempt was a series of images in the style of Karel Martens. Overall this technique was just too cluttered and sometimes difficult to parameterize in a predictable way. We kept iterating.
97+
98+<br /><br />
99+
100+![](https://media.urbit.org/site/posts/essays/sigils2-v2.png)
101+
102+Just like the previous example, the main idea was that we could take a set of geometric primitives, combine them, then alter their appearance along a set of parameters, like color, rotation, and size.
103+
104+But also just like the previous attempt, the technique of overlapping symbols made the images too difficult to read and differentiate. We wanted to create sigils that were not only great to look at, but visually ordered. Since overlapping elements didn’t seem to quite hit the mark, on we went.
105+
106+## Closing in
107+
108+Eventually, we realized: tiles! With tile designs there are no overlaps, which in early experiments immediately started to take on the consistent, legible appearance we were after. Each element is discrete and clearly visible. Tile designs were also easier to create and control from an implementation standpoint.
109+
110+Best of all, tiles made it clear that we should be thinking in terms of creating representations of individual syllables rather than entire names. Urbit IDs are constructed from two sets of 256 three-letter syllables. `~fallyn-balfus` is `fal` `lyn` `bal` `fus`, for example. (There are two syllable sets in order to prevent duplicates — we always alternate between the two when composing names.)
111+
112+Thinking in terms of syllables greatly reduced the complexity of the problem, but there was still some work to do.
113+
114+<br /><br />
115+
116+![](https://media.urbit.org/site/posts/essays/sigils3-v2.png)
117+
118+At first, we thought about using a 4 x 4 tile grid, as shown here. These designs were tricky to implement because of the detailed lines and arcs spanning across individual tiles. In order to generate a result that matched these mockups, a program would have to generate a data model that knew about which tiles touched which other tiles.
119+
120+We felt this was too complicated and had an unknown performance profile. Plus, they proposed a deterministic color scheme and we felt strongly that color is personal, not to mention hard to parameterize. In the end we thought it better to create something that had the potential for user customization.
121+
122+<br /><br />
123+
124+![](https://media.urbit.org/site/posts/essays/sigils4-v2.png)
125+
126+Around this stage, we were thinking a lot about how architectural plans aren’t unduly constrained by the fact that they’re only one color. We had a feeling we could make the grid smaller and assign details to the tiles individually.
127+
128+<br /><br />
129+
130+![](https://media.urbit.org/site/posts/essays/sigils10-v3.png)
131+
132+So, we scaled it down to a 2 x 2 grid and stuck with it. It’s simple to implement, visually unique, consistent, and the color scheme is black and white, leaving room for user customization. We felt we had reached a semblance of a final result. Now all we had to do was manually draw 512 unique but consistent individual ‘phonemes’.
133+
134+<br /><br />
135+
136+![](https://media.urbit.org/site/posts/essays/sigils5-v2.png)
137+
138+As it turns out, drawing 512 consistent, abstract elements by hand isn’t easy. We had to strike a balance between authorship and automation — we wanted each tile to look well-made, but not too authored. To do so, we took advantage of Figma’s web API which helped us design in SVG but iterate programmatically.
139+
140+## Final process
141+
142+![](https://media.urbit.org/site/posts/essays/sigils6-v4.png)
143+
144+We took a look at our hand drawn mockups and drew each individual visual building block of the tiles separately. Then we loaded the SVG elements into a script that programmatically combined them to create trillions of layered symbols. This way, we were able to easily select candidate phoneme symbols that worked visually.
145+
146+We eventually added a rule system to find higher quality phoneme symbols — but this combination of programmatic generation and hand selection was working pretty well.
147+
148+<br /><br />
149+
150+![](https://media.urbit.org/site/posts/essays/sigils7-v2.png)
151+
152+The final step, using the tool we built, was to hand select individual phoneme symbols and create a complete index.
153+
154+<br /><br />
155+
156+![](https://media.urbit.org/site/posts/essays/sigils8-square-v2.png)
157+
158+This allowed us to start looking at possible combinations and selecting phoneme symbols based on their interplay with others.
159+
160+Once we had selected the final set, we went about compiling the `sigil-js` library that’s now publicly available. This turned out to be fairly technically complex due to the different ways SVG is handled between browsers and Figma — but the end result is a single Javascript library you can use to embed an SVG in almost any context on a web page. See it in action and browse the available sigils [here](https://sigil.azimuth.network). If you're technically inclined, the [source](https://github.com/urbit/sigil-js) can be found on GitHub.
161+
162+<br /><br />
163+
164+![](https://media.urbit.org/site/posts/essays/sigils9.png)
165+
166+We think sigils are pretty successful. They look nice in our native Urbit interfaces, people have made them into shirts and posters and cards, even laser-cut them to make stamps.
167+
168+Urbit ID and the sigils are components of Urbit that are totally separate from the OS — you can use them on their own and potentially even extend their functionality. We’re happy with what we’ve done with them so far, and hope that people will experiment with what’s possible with this naming and identity system.
169+
170+![](https://media.urbit.org/site/posts/essays/sigils11-v2.png)
content/blog/eliza.mdnew file+49
@@ -0,0 +1,49 @@
1++++
2+title = "Eliza"
3+date = 2021-02-23
4+description = "Building things, even Calm™ things, makes noise."
5+[extra]
6+author = "Christian Langalis"
7+ship = "~pindet-timmut"
8+image = "https://media.urbit.org/site/posts/essays/valleys.jpg"
9++++
10+
11+<br>
12+
13+![valleys](https://media.urbit.org/site/posts/essays/valleys.jpg)
14+
15+<br>
16+
17+## The Storm before the Calm
18+
19+Building things, even Calm™ things, makes noise. George Nakashima’s wooden furniture evokes peace, but its construction still begins with a chainsaw. We mention this because we’re firing up our newest power tool.
20+
21+We call her Eliza. She is a data-collection robot.
22+
23+Hang on. An AI? Harvesting my data? Spying on me? Flooding me with spam? This is Urbit, right? Let us tell you about our new friend in basic terms, where MEGACORP might otherwise deploy legalese.
24+
25+## What Eliza is and isn’t
26+
27+> Replicants are like any other machine - they're either a benefit or a hazard. If they're a benefit, it's not my problem.
28+>
29+> <cite>Rick Deckard</cite>
30+
31+Let's start with the benefits. Eliza is a simple chatbot. She was made to collect feedback on Landscape. She asks direct questions about peoples' usage of Urbit, records any responses, and reports them to her managers at Tlon. She'll also provide timely advice and information to ships kind enough to chat with her. She'll begin reaching out to ships via DM in the coming month. If you don't want to, just say no, and you'll never hear from her again.
32+
33+Finding bugs is critical to Urbit's rapid development, especially in this period of nascency. Most Urbit-related frustrations go unreported; regular folks don't think to open up Github when they experience a minor issue. That's why it's incumbent upon us to design a lower-friction forum for feedback. People who aren't comfortable filing an issue might be willing to talk to a friendly chatbot.
34+
35+Now, about hazards. By design, there are few. Eliza runs on Tlon's comet, not on your planet. There will be no OTA to install `%eliza-bot-store` on everyone's ships. Eliza learns things through conversation, not hidden surveillance software. Data she requests, like the text output of our network analytic tool, `+tally`, must be sent manually. MEGACORP tends to cut this corner; to refine their products, they just track your reactions in real-time.
36+
37+Since she's [open-source](https://github.com/urbit/urbit/blob/b0c1f83287cbf4c85847a9238d9f4be17e1fcb33/pkg/arvo/app/eliza.hoon), anyone can creatively deploy Eliza. Just write her a dialogue tree. Of course, that also means we can't keep people from misusing Urbit bots. We think automated agents on the Urbit network are inevitable, so let's create a good baseline culture around them. (Much love to Tendiebot, who's serving up stock prices in `~tomdys/wall-star-bets`.) However, once Urbit is used world-wide, we can't rely on culture alone.
38+
39+## A New Internet Economics
40+
41+The sum of Urbit's architectural design is a new online economics: a way to finance and monetize access to internet infrastructure where people retain maximum equity. Explicitly acquire a low-maintenance, low-cost server. Use it to compute explicit things. Return to life.
42+
43+We 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.
44+
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+
47+Eliza 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.
48+
49+If Urbit is to be used worldwide, the old system will not go down without a fight. Spammers, spies, and digital robber-barons will hunt for ways to game Urbit. Our passage out of the digital gutter is beginning in earnest, and we are thrilled to put our new architectures to the test.
content/blog/events-series.mdnew file+56
@@ -0,0 +1,56 @@
1++++
2+title = "Urbit Events Series"
3+description = "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
5+[extra]
6+description = "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)."
7+author = "Lane Rettig"
8+ship = "~naplet-hildec"
9+image = "https://media.urbit.org/site/posts/essays/bau.jpg"
10++++
11+
12+<br>
13+
14+![people gathered](https://media.urbit.org/site/posts/essays/bau.jpg)
15+
16+<br>
17+
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+
20+--
21+
22+If you’re familiar with the project, you’ve probably noticed that Urbit folks talk a lot about the fact that [Urbit is for communities](https://urbit.org/blog/urbit-is-for-communities/). This is central to what Urbiteers believe: Urbit is a platform that any group of people should be able to use to build, communicate, and transact in precisely the way that makes sense to them. Today, Urbit is already capable of facilitating many of these activities, and it’s already a big part of the daily workflow for many people. I think we’re off to a pretty good start, and over time Urbit will become accessible to more communities.
23+
24+Something we tend to talk less about is the fact that Urbit itself is also a community. If you’ve spent any amount of time hanging out in Landscape in the Urbit Community group, you already know this—but getting to know the community takes time and effort.
25+
26+One of the reasons you don’t hear about the Urbit community as much is that community is difficult to pin down: you'd be hard-pressed to put "the community" into a room together. It's a weird, fuzzy notion and doesn't have clear boundaries.
27+
28+Other parts of Urbit do have clear boundaries. If you decided to learn more about Urbit, chances are you started by reading the docs. You might learn about [Nock](https://urbit.org/docs/tutorials/nock/), [Hoon](https://urbit.org/docs/glossary/hoon/), and [Arvo](https://urbit.org/docs/glossary/arvo/). You might get an [Urbit ID](https://urbit.org/understanding-urbit/urbit-id/) and [launch your own ship](https://urbit.org/getting-started/). These things are all pretty well documented and, while not necessarily easy, their respective processes are relatively straightforward and [getting easier](https://urbit.org/blog/hosting-the-future/) every day. Community is less well documented. It’s more difficult to document—it’s something you just have to experience.
29+
30+We lead with technology because it’s what we’re good at and because it’s easier to write about. But the social side of Urbit is no less important. Since so many of us are working on and contributing to Urbit in order to solve our own problems, and since we’re dogfooding as we go, you could define Urbit as the minimal technological infrastructure needed to sustain the Urbit community. It’s circular, but it’s as good a definition of Urbit as you’re likely to find. For this reason, you can’t really understand Urbit without some degree of exposure to the cultural knowledge of its community. When the Urbit community did fit in a single room together, transmitting cultural knowledge was easy and happened over pizza and beer. As the number and diversity of Urbit stakeholders continue to grow, we need to find ways to scale the transmission of this cultural knowledge.
31+
32+One way that seems to work well is getting everyone together once in a while for events. Over the last few years, I and others in the community have collectively attended hundreds of community events, virtually and in person around the world, from small developer chats to massive, global developer conferences with thousands of attendees. Urbit has even hosted [a few of our own](https://www.meetup.com/urbit-sf/).
33+
34+As a newcomer to the Urbit community I recently found myself seeking exposure to cultural knowledge. I know from experience attending and organizing events in other communities that regular events are a good way of making this knowledge more accessible, and of helping newcomers like myself onboard. I applied for [a grant](https://grants.urbit.org/proposals/1751024973) to bootstrap a new event series, and I’m excited to announce that this series is launching next week with the support of [urbit.org and the grants program](https://urbit.org/blog/first-steps-towards-urbit-org/).
35+
36+The event series has three components. The first is a series of developer calls. These will be shorter and more narrowly focused on the technologies that underpin Urbit, from the top of the stack to the very bottom. They’re an opportunity for the people developing and contributing to Urbit to share their knowledge and expertise, including things that typically don’t make it into the docs, such as how and why Urbit works the way it does. It’s recently become much easier to build applications on top of Urbit, so I hope these events will help developers see what sort of things they can already use Urbit to build, and how to get started. These events are also 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!).
37+
38+The first developer call will take place on Thursday, November 5 at 9am PT, and you can [sign up to attend here](https://www.meetup.com/urbit-sf/events/274279522/). The second call will take place two weeks later on Thursday, November 19, and we’ll continue holding these calls about every two weeks.
39+
40+The second component is a larger Town Hall event to take place on Thursday, December 17. The Town Hall will feature multiple speakers and will cover topics including technology but also design, community, and our overall progress towards our vision for Urbit. You can think of it as part show and tell, part “State of the Network,” part meet-and-greet.
41+
42+The third component is a larger conference, tentatively called UrbitCon, to take place early next year. This event is still in a conceptual phase. It’ll be an opportunity for the global Urbit community to celebrate how far the project has come, to share technical as well as cultural knowledge, and, maybe most importantly, to hang out together and have some fun as well. Watch this space for more information on the Town Hall and UrbitCon.
43+
44+Collectively, these events allow the community to achieve several goals. Firstly, they’re a great way for community members to meet one another, exchange cultural knowledge, and share what they’re working on. Events provide excellent motivation to get something that’s a work-in-progress to a state where you can share it with others!
45+
46+Secondly, the content from these events will be recorded and published, and will form the cornerstone of a new knowledge base on urbit.org that will augment existing documentation. This will make it much easier for newcomers, even those that can’t attend the events live, to benefit from the wealth of knowledge and expertise of the Urbit community.
47+
48+Finally, these events are a great opportunity for community members to contribute things other than code. While Tlon will provide speakers for the first few events of the series, it’s important to emphasize that the initiative is entirely community-led and that we’ll need lots of help to organize and host events. If you’re interested in helping out with any of the events in the series, please find me and others helping out with events on Landscape in the Urbit Community group (the channels called “Events Series”).
49+
50+They say that a project’s community has reached critical mass when new things are happening that even the project’s earliest and most active contributors aren’t aware of. By this standard, the Urbit community reached critical mass sometime in the past few months, as even core team members tell me they’re regularly surprised to learn of another new project or initiative launched by a community member.
51+
52+Tlon could no longer catalog the Urbit community even if it wanted to. This is a good thing. As Tlon [has also said](https://urbit.org/blog/hosting-the-future/), it’s natural that Tlon and Urbit drift apart a bit over time. Just as Urbit itself is self-hosted, so the community, over time, should become self-hosting: it should play a more active role in shaping the future of the project. A community-run event series can be an important catalyst for this trend. I’m looking forward to the first event, and I hope to see you there, and at many events to come.
53+
54+--
55+
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.*
content/blog/first-steps-towards-urbit-org.mdnew file+59
@@ -0,0 +1,59 @@
1++++
2+title = "First Steps Towards urbit.org"
3+date = 2020-08-12
4+description = "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+[extra]
6+author = "Josh Lehman"
7+ship = "~wolref-podlex"
8+image ="https://media.urbit.org/site/posts/essays/first-steps.png"
9++++
10+
11+<br>
12+
13+<img src="https://media.urbit.org/site/posts/essays/first-steps.png">
14+
15+
16+## Summary
17+
18+It’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.
19+
20+
21+## Background
22+
23+At 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.
24+
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.
28+
29+
30+## The Present
31+
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).
33+
34+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. We’ve had plenty of time to think about what it should look like, how it should work, and who should lead it.
35+
36+Our 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.
37+
38+
39+## Moving Forward
40+
41+On 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.
42+
43+My 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.
44+
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.
46+
47+To 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].
48+
49+The 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.
50+
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.
52+
53+I look forward to working with you.
54+
55+[^1]: But my friends call me ~wolref-podlex.
56+
57+[^2]: We’re also really into the idea of being the first builder of housing on Mars. Just saying...
58+
59+[^3]: We call this project Airlock. You’ll hear more about it soon.
content/blog/ford-fusion.mdnew file+226
@@ -0,0 +1,226 @@
1++++
2+title = "Ford Fusion"
3+date = 2020-07-15
4+description = "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+[extra]
6+author = "Ted Blackman"
7+ship = "~rovnys-ricfer"
8+image ="https://media.urbit.org/site/posts/essays/ford-fusion.png"
9++++
10+
11+<br>
12+
13+<img class="ba" src="https://media.urbit.org/site/posts/essays/ford-fusion.png">
14+
15+<br>
16+
17+## Overview and Rationale
18+
19+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.
20+
21+Since deployment of Ford Fusion to the livenet in late June, over-the-air updates (OTAs) have been much smoother. Before Ford Fusion, it was common for an OTA to take several hours, use too much memory, and leave ships in inconsistent states. After Ford Fusion, multiple OTAs have been pushed out, including kernelspace changes, and most users didn't even notice.
22+
23+Urbit has always been able to update itself OTA, but this process has often been rocky. Updating an operating system kernel on-the-fly is a difficult problem in general, like performing heart replacement surgery on yourself while running a marathon. Code that allows Linux to update its kernel in this way became a startup called Ksplice, won multiple awards, and sold to Oracle. Even that, as impressive as it is, and as brilliant as its [programmers](https://nelhage.com) are, can only perform certain limited kinds of patches to the kernel.
24+
25+Urbit isn't exactly a traditional operating system, so the comparison is somewhat unfair, but the purpose of better architecture is to create unfair comparisons. In this case, because the Nock layer is frozen, upgrading everything above that layer is easier. Upgrades are also facilitated by pure-functional semantics, transactional event processing, a type system oriented toward concrete data, and orthogonal persistence. These features make it feasible for Urbit to upgrade
26+itself in the general case, not just some special cases.
27+
28+Ford 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:
29+- Atomic: the update should complete or fail in one transaction. If it
30+ fails, the system shouldn't get stuck.
31+- Self-contained: there must be no implicit dependencies or hysteresis
32+ (dependence on previous system states) when building the new software
33+ from source.
34+- Ordered: updates must be monotonically sequenced from the system's
35+ lowest layer to highest.
36+
37+Let’s walk through them one by one.
38+
39+### Atomic
40+
41+In previous versions of Urbit, updates failed atomicity by deferring parts of the update to later events, which are separate transactions that can fail independently. Generally, each deferral causes an exponential increase in the number of failure states that needed to be handled.
42+
43+We'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.
44+
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.
46+
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.
48+
49+This 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.
50+
51+[Steve Yegge's "platform
52+rant"](https://gist.github.com/chitchcock/1281611) describes a Bezosian
53+edict prohibiting synchronous communication among modules through direct
54+linking. This can be seen as an acknowledgment of the difficulty Amazon
55+was going to have when it needed to turn internal services external. If
56+your software needs to run in hell, build it that way from the start.
57+
58+An Urbit ship is not an enterprise SaaS product and does not need to run in this hell; it exists for just one person, with natural pressure pushing it in the opposite direction from Amazon’s web services. Instead of needing a ship’s state and functionality sharded into microservices strewn across multiple clusters, an Urbit instance is easiest to manage as a single server with all its state unified into one data structure and its event log stored as one totally ordered sequence of state updates -- the antithesis of a distributed system.
59+
60+### Self-Contained
61+
62+Before Ford Fusion, each commit to the Clay filesystem validated its files using filetypes (called “marks”) defined by files in the previous commit. This could cause bugs if the filetype definitions had changed in a backward-incompatible manner. It also meant a commit could not add both a new filetype and new files of that type; instead, you needed two commits: one to define the filetypes, and a second to add files of that new type. More theoretically, it caused history-dependence. The validated contents of files in a commit could vary based on the history of commits that led to this one.
63+
64+Another way source code failed to be self-contained was that it had access to symmetry-breaking information at build-time, namely ship, desk (Urbit's answer to a git branch), and (faked) date. A build recipe should be able to shared, cached, and rerun without dependence on local conditions, so user code now no longer learns its ship, desk, or date until runtime.
65+
66+Source code also had build-time access to Urbit's immutable global namespace, called the “scry namespace”, which the kernel makes available as an implicit argument to userspace Hoon code. The scry namespace is immutable and referentially transparent, i.e. a request must always yield the same result for all time, but if an agent asks the kernel for a resource that’s from the future, hosted on another ship, or to which that agent doesn’t have permission, the kernel will deny the request.
67+
68+If the kernel denies a scry request that user code made during the build process, the build system has no choice but to treat it as a nondeterministic error. Nondeterministic errors can never be fully eradicated, if for no other reason than that the user always has the option to defenestrate the machine—there's nothing deterministic about that. But we try to minimize them, and especially to minimize uncertainty as to under what conditions they might occur.
69+
70+No build should be killed by the absence of files outside the desk, so as of this update, user code can no longer scry at build time. Once built, userspace programs can scry if run in a context with a scry handler; a Gall agent's runtime scry requests still work just fine.
71+
72+### Ordered
73+
74+The final kind of failure fixed by Ford Fusion was the lack of ordered layering during a software update. The most common form of this failure was that old Ford had a tendency to try to build userspace code using the previous version's standard library. This didn't work too well, unsurprisingly.
75+
76+Emerging from this underworld required making a number of changes to the Arvo kernel, Clay, Gall, and the procedure for kernel updates. To avoid turning into a pillar of salt, I'll skip the details of how the old system worked and instead describe the new update procedure.
77+
78+## How Updates Work Now
79+
80+These are the layers of the stack that update themselves on the fly, from lowest to highest:
81+
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
87+
88+An 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.
89+
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.
91+
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.
93+
94+The 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.
95+
96+To work around this limitation, Gall has a two-phase update process. First it enters a dormant “pupal” phase that stores not running agent cores, but only the agent states that the old Gall had extracted from its agents. When Clay notifies Gall that its agents have been rebuilt, Gall “molts” back into normal functionality by loading the agent cores from Clay and then running their `+on-load` routines to inject the old state.
97+
98+If there's a change to files in `/sys` on the `%home` desk, Clay asks Arvo to update kernelspace. Clay sends a sequence of moves (effects) to Arvo to ask Arvo to perform any necessary updates to hoon, the kernel, Zuse, and vanes. This sequence is terminated by an extra move back to Clay itself, which will be received by the updated version of Clay after migrating its state. The rebuilt Clay can then use the newly rebuilt version of Zuse to rebuild userspace and notify clients of the update. One client is Gall, which molts when Clay notifies it.
99+
100+Clay triggers updates, but the Arvo kernel is responsible for performing updates to all kernelspace layers, and Gall is responsible for updating userspace agents. Agents are stored in Gall's state, but all other layers are stored directly in the Arvo core's state, so the Arvo kernel contains the routines that reload Hoon, the kernel itself, Zuse, and the vanes.
101+
102+The Arvo kernel reloads itself by receiving its new source code as a `%lyra` move from Clay, compiling this source into a core with empty state, then calling the new core's `+load` routine with the relevant parts of the old state. The state passed to the new Arvo now includes not just the vane cores and their states, but also the Arvo "duct" call `stack`, which maintains a stack of queues of moves to be passed from one vane to another, and a list of effects to emit to Unix at the end of the current Arvo event. If needed, Arvo could migrate the outstanding moves themselves -- if, say, the duct datatype changes.
103+
104+Passing the Arvo call stack state to new Arvo allows a kernel update to happen in the middle of a more complex event without disturbing other sequences of processing steps happening concurrently in the vanes.
105+
106+This entire update process happens in one Arvo event and doesn’t break event-dispatching semantics. This not only provides atomic rollback, but allows the update to be combined with other actions into a larger transaction -- for example, to stage complex changes, user code could trigger two kernel updates in a row, both in the same event.
107+
108+Note that this is the opposite situation from the entropically leaking asynchronicity described earlier. Now the guarantees don’t deteriorate; they can be composed into stronger guarantees.
109+
110+## How Clay Validates a Desk
111+
112+A desk is Urbit's answer to a git branch. It's almost identical, except all files are typed and validated, and whenever a commit becomes the equivalent of git’s ‘HEAD’, it’s assigned a semantically meaningful revision number, and all files are typed and validated.
113+
114+If Clay has been asked to perform a commit, it needs to validate all the files in this desk and notify all subscribers to live queries of this desk's data. Gall, for example, maintains live queries on builds of its live agents. Validation uses the Ford build system, which as of this update is no longer a standalone vane but a core within Clay.
115+
116+A Clay commit, like a git commit, is specified as the current value of all its changed files (and, separately, references its parent commits by hash), not as the diff from a parent commit. Unlike git, Clay is typed, and every file must be validated according to its "mark". A mark is named like a file extension, e.g. `%txt`, `%png`, or `%noun`, and Clay maintains a mapping from that name to behaviors of values of that type under various operations. The last segment of any Clay path specifies the mark to use for operations on that file, including validation.
117+
118+Mark operations include conversion to and from other marks (such as converting `%json` to `%txt`), revision control operations (diff, patch, and merge), and validating an untyped noun. Operations for mark `%foo-bar` are defined by a core built using the source code at `/mar/foo-bar/hoon`, or if that doesn't exist, at `/mar/foo/bar/hoon`.
119+
120+Consider a file at `/web/foo/json`. In order to validate this file, Clay must load the mark definition core and use its validation routine to ensure the untyped value of `/web/foo/json` is in fact valid JSON. To obtain this core, Clay must build the file at `/mar/json/hoon` from source and then process the resulting raw mark core using some mild metaprogramming to get a standard interface core for dealing with marks, called a `$dais`, whose type is defined in Zuse.
121+
122+Since building a source file only makes sense if the file has been validated as a `%hoon` file, but mark definitions themselves must be built from source, there's a logical dependency cycle -- who validates the validators? To break this cycle, Clay hard-codes the validation of `%hoon` files. This allows mark definitions to be built from source, and in fact any file can depend on any other file of any mark as long as there are no cycles. As of Ford Fusion, Ford performs a cycle check to ensure acyclicity.
123+
124+Since building a file is a pure function, Clay memoizes the results of all builds, including builds of marks, mark conversions, and hoon source files. These memoization results are stored along with the desk and are used by later revisions of that desk. Future work should allow merge commits to pull memoized builds from all parents, but for now only the previous revision of the current desk is used. This is a major simplification of previous Ford architectures, which maintained much more complex caches with less clear eviction semantics. Now on every commit, we just throw away any unused memoized builds from the previous revision's Ford cache.
125+
126+Once Clay has validated every file in this new revision of a desk, it constructs and sends updates to any subscriptions that other vanes or agents have requested. More Ford builds may be run to fulfill these requests, including builds for any running agents whose dependencies changed in this commit.
127+
128+When Gall receives a newly rebuilt agent from Clay, it calls the gate produced by the `+on-load` arm of the new agent with the state extracted from the old agent. If there is a crash in any `+on-load` calls or in the handling of any effects they emit (which can include more agent activations), then the whole event crashes, canceling the commit. This effectively gives any agent the ability to abort a commit by crashing.
129+
130+It 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,
131+so 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.
132+
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.
134+
135+## Ford Build Semantics
136+
137+### The Three Types of Ford Builds: Files, Marks, and Casts
138+
139+The Ford build semantics have been simplified. There are now three kinds of builds that Ford can perform: files, marks, and casts, all of which happen synchronously as function calls inside Clay and are available (without memoization) as scry interfaces.
140+
141+#### File Builds
142+
143+A file build takes in a filepath containing Ford runes and Hoon source, runs the Ford runes to perform imports, and then compiles the source, producing a `$vase`, a noun tagged with its Hoon type.
144+
145+Clay exposes file builds into the scry namespace with `%ca`: as an example, `.^(vase %ca /~zod/home/3/lib/sole/hoon)` will build the `sole` library.
146+
147+#### Mark Builds
148+
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`.
150+
151+Clay 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.
152+
153+#### Cast Builds
154+
155+A 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:
156+
157++ direct grow from `%foo`
158++ direct grab from `%bar`
159++ indirect jump from `%foo` through `%qux`
160++ indirect grab from `%bar` through `%qux`
161+
162+The `%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.
163+
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+
167+### Ford Runes
168+
169+There are now only four Ford runes. A file can contain zero, one, or many of each, but each Ford expression can only be one line, and they must be in the standard order of `/-`s, `/+`s, `/=`s, and then `/*`s.
170+
171+```
172+/- foo, *bar, baz=qux
173+```
174+
175+The `/-` rune imports a structures file from `/sur`. You can import it as just `foo`, in which case the build result of that file (usually a core with mold definitions) will be pinned into the compilation subject with the face `foo`. If you prefix it with a `*` as in `*bar`, the result will be pinned into the subject with no face; if the structures file compiled to a core, this exposes all the arms into the namespace of the compilation subject. Finally, if you import it as `baz=qux`, the `baz` face will be applied instead of `qux`. This is similar to "import as" in other languages.
176+
177+```
178+/+ foo, *bar, baz=qux
179+```
180+
181+The `/+` rune imports a library file from `/lib`. Aside from the different source folder, the syntax and semantics are the same as for `/-`.
182+
183+```
184+/= clay-raw /sys/vane/clay
185+```
186+
187+The `/=` rune imports the result of building a hoon file from a user-specified path (the second argument), wrapping it in a face specified by the first argument. The final `/hoon` at the end of the path must be omitted. This is mostly useful for importing a file for testing. The file at the specified path will be built as a normal userspace hoon file; i.e. its compilation subject will be Zuse augmented with the results of any Ford runes it has at the top of the file.
188+
189+```
190+/* hello-gen %hoon /gen/hello/hoon
191+```
192+
193+The `/*` rune imports the contents of a file in the desk, specified as the third argument with the full path including the trailing mark, converted to the mark specified by the second argument, and pinned into the compilation subject wrapped in the face specified by the first argument. This can be used to import static data at build-time, such as a data file, a media file, or, in the case of this example, a hoon file as source text rather than already built.
194+
195+A valid userspace hoon file must contain a nonempty list of hoons (hoon source expressions) below the Ford runes, separated by gap (more than one space, or at least one newline). The system wraps this list of hoons in a `=~` expression so that the result of the previous hoon is used as the subject of the next hoon. The result of the Ford runes is used as the compilation subject for this `=~` hoon; informally, the shape of the compilation subject can be thought of as:
196+
197+```
198+:* fastar-2 fastar-1
199+ fastis-2 fastis-1
200+ faslus-2 faslus-1
201+ fashep-2 fashep-1
202+ <zuse>
203+==
204+```
205+
206+## Future Work
207+
208+Urbit 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.
209+
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.
212+
213+At 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
214+Ford 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.
215+
216+## Conclusion
217+
218+`~littel-ponnys` and I spent most of 2018 rewriting Ford with the intent of improving its performance. Compared to its predecessor, its result was better in some ways but worse in others. The caching system was labyrinthine and poorly factored, making the system difficult to debug or prove correct, even informally. Some things were faster, but the caching and dependency tracking were actually complex enough that a number of common operations, like mark conversion, were too slow.
219+
220+In early 2020, `~master-morzod` suggested moving Ford into Clay to reduce asynchronicity. It seemed absurd at first, but at some point I realized I could combine that idea with a simpler build-caching scheme and self-contained desk builds, and `~wicdev-wisryt` realized he could use that to further simplify Clay’s commit and merge code, which he did as part of this project.
221+
222+The 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.
223+
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.
225+
226+As 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.mdnew file+68
@@ -0,0 +1,68 @@
1++++
2+title = "Gifts Q3 2020"
3+date = 2020-09-23
4+description = "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+[taxonomies]
6+post_type = ["gifts"]
7+[extra]
8+author = "Josh Lehman"
9+ship = "~wolref-podlex"
10+image ="https://media.urbit.org/site/posts/essays/gifts.png"
11++++
12+
13+<br>
14+
15+<img class="ba" src="https://media.urbit.org/site/posts/essays/gifts.png">
16+
17+<br>
18+
19+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.
20+
21+I'm happy to announce that urbit.org has a record number of gifts to distribute to community contributors for the period from February to August of 2020. Because the gifting of address space is an old tradition, and the last several months have seen an unprecedented amount of user growth, let’s talk about why we do this.
22+
23+## Why gifts?
24+One way to think about Urbit is as *infrastructure for powering digital communities.* We’ve talked about this before in [some detail](https://urbit.org/blog/urbit-is-for-communities/), so while I won’t rehash the “why” of that here, I’ll reiterate that what we really want is a digital world that's generated by the communities that inhabit it.
25+
26+We know that digital communities need better technology with which to generate their world; just as importantly though, they need *people* to inhabit and develop them.
27+
28+Tlon and urbit.org can’t bring the world into Urbit alone—we need community members to help us. By distributing address space to a variety of people that can invite their friends and families, the network can grow faster, more organically, and with a wider range of diversity.
29+
30+Currently, the majority of available address space is owned by Tlon and urbit.org, but it won’t stay that way. Instead, we want to give address space to folks that want Urbit to succeed. Because we’re custodians of something valuable it’s important that we are intentional about how we handle it. We treat that responsibility seriously.
31+
32+Gifts are one of the ways we invest in the future of the network. We look for others that see Urbit’s value and engage in building the digital home that they want to live in. They ease the learning curve for people new to Urbit, contribute to the technology, and create thriving communities.
33+
34+## Recipients
35+Gifts are being awarded for a variety of reasons this quarter. As usual, there have been plenty of code and documentation contributions, but this time around we’re also recognizing those who have evangelized Urbit, been active in guiding newcomers to the system, and developed thriving communities within Landscape.
36+
37+Gifts are being awarded using the following criteria:
38+
39+**Bronze**: one star for continuous contributions over the last six months in at least one of the above areas.
40+
41+**Silver**: two stars for creation of something exceptional and/or contributing across many categories.
42+
43+**Gold**: three stars awarded to one contributor who has contributed at a volume that indicates a high degree of care and ownership.
44+
45+Without further ado, here are the recipients:
46+
47+### Gold
48+[`~radbur-sivmus`](https://github.com/tylershuster) has more or less become an unofficial member of the interface team by tackling an absolutely [immense](https://github.com/urbit/urbit/pulls?q=is%3Apr+author%3Atylershuster+) amount of Landscape-related work.
49+
50+### Silver
51+- [`~littel-wolfur`](https://github.com/ryjm): Jake maintains the premier development group in Urbit, The Forge, and has led the way for other developers by authoring [srrs](https://github.com/ryjm/srrs), one of the more popular community-developed applications on Urbit.
52+- [`~botter-nidnul`](https://github.com/botter-nidnul): `~botter` has been instrumental in furthering [Urbit on ARM](https://botter-nidnul.github.io/), has made contributions across Vere and our documentation, and been highly active in onboarding newcomers on our Discord server.
53+- [`~timluc-miptev`](https://github.com/timlucmiptev): `~timluc` is highly engaged in many groups and the maintainer of some, wrote the [Nock for Everyday Coders](https://blog.timlucmiptev.space/part1.html) guide, and has gone far above and beyond in teaching the community about developing Landscape applications.
54+- [`~lanrus-rinfep`](https://github.com/dclelland): Daniel has done extensive development on iOS by writing Swift libraries for interacting with Urbit, and employed all of these towards the development of an [iOS client for chat](https://github.com/dclelland/UrsusChat).
55+- [`~minder-folden`](https://twitter.com/the_pritchard): Jonathan is a prolific member of the community. His group *The Sanctorium* is always active, he's always around to help newcomers to the system, is an active evangelist on Twitter, and a creator of much excellent content.
56+
57+### Bronze
58+- [`~watter-parter`](https://github.com/lukechampine): Luke has made a number of [contributions](https://github.com/urbit/urbit/pulls?q=is%3Apr+is%3Aclosed+author%3Alukechampine) to Arvo, and wrote a great [introductory guide](https://github.com/lukechampine/rote) to developing Gall agents.
59+- [`~naltyc-wornes`](https://github.com/JohnELester): `~naltyc` runs the popular group “Smol Computers” both inside and outside of Urbit where discussions ensue about various forms of computing on small devices like Android and ARM, and actively evangelizes the project.
60+- [`~nartes-fasrum`](https://twitter.com/nartesfasrum): `~nartes` evangelizes Urbit on Twitter by creating artwork, and maintains the popular food-centric group “Urbytes.”
61+- [`~fonnyx-nopmer`](https://twitter.com/fonnyx_nopmer): `~fonnyx` maintains an active presence throughout many groups on Urbit and runs the first Urbit-centric podcast, [Hooked on fonnyx](https://www.twitch.tv/fonnyx).
62+- `~libhut-samwes`: `~libhut` started and maintains one of the most popular groups on Urbit centered on crypto and investing, and contributes to conversations throughout Urbit.
63+- `~salmus-master`: In addition to embodying the quality of high-level, respectful debate we like to see, `~salmus` created the group: “The Tribal Network,” where he maintains one of the most active long-form notebooks on Urbit.
64+- [`~fostyr-solfyr`](https://github.com/cmarcelo): `~fostyr` has submitted a number of PRs against Arvo, including a much-requested feature to reset the web login code.
65+- [`~sarpen-laplux`](https://github.com/xiphiness): `~sarpen` has done a significant amount of research and work on Ethereum ABI parsing and other Ethereum-related topics in addition to being an active participant in dialogues throughout Urbit.
66+- `~mister-todteg`: `~mister` is a top evangelist of Urbit on Twitter, has brought many newcomers onto the network, and has even made several hires for his company from within the network.
67+
68+Thank you to all who contributed to making Urbit what it is today!
content/blog/governance-of-urbit.mdnew file+38
@@ -0,0 +1,38 @@
1++++
2+title = "Governance of urbit.org"
3+date = 2019-01-11
4+description = "Stewardship of the Urbit Project."
5+aliases = ["/posts/essays/governance-of-urbit", "/posts/governance-of-urbit"]
6+[extra]
7+author = "Erik Newton"
8+ship = "~patnes-rigtyn"
9++++
10+![](https://storage.googleapis.com/media.urbit.org/site/governance-1.svg)
11+
12+## Summary
13+
14+Long before Urbit first appeared as a prototype in 2013, we considered Urbit address space to be property. Granted, Urbit property ownership was only reflected as a text file in a github repository – but it was always designed to be cryptographically owned, and we've always taken that file seriously.
15+
16+If you've ever looked at that text file, you've probably noticed that there has been a pool of Urbit assets there marked "urbit.org" since the beginning. Now that we're moving our property registry out of that repository and onto the Ethereum blockchain, we wanted to be as clear as we can be about what the plan is for those urbit.org addresses.
17+
18+The TL;DR is that "urbit.org" will likely split into a separate entity from Tlon in the future. For now though, Tlon and urbit.org have the same mandate, so separating them doesn't make sense. For the time being, Tlon will continue to manage and use urbit.org assets directly for platform development. As a first step toward making urbit.org independent we've started to develop a board of advisors who we hope will one day manage those assets independently.
19+
20+## Background
21+
22+The history of a few lines in a text file doesn't give a whole lot of context. So, first, let's fill in a few more of the details.
23+
24+In 2013 Curtis and Tlon each contributed 32 galaxies to a pool newly called "urbit.org." The idea at the time was to set aside address space to fund "platform development" – in the spirit of the IETF or the Mozilla foundation. This was long before anyone had heard of a Swiss blockchain foundation or anything of the sort. Our view was that it was going to take a lot of resources to build a system as robust and far reaching as Urbit intends to be, and 64 galaxies (25% of the total network) seemed sufficient. It was thought at the time that urbit.org might eventually take the form of a separate foundation, but we were simply too small and under-resourced a team to figure out the right legal structure at the time.
25+
26+Tlon – as distinct from urbit.org – has always been imagined as a future service provider in the urbit ecosystem. But Urbit is still young, so those services aren't really needed yet.
27+
28+Instead, what is needed is platform development. So Tlon has acted, in a way, as urbit.org was supposed to, by taking on the bulk of platform development efforts. This work consists of everything from kernel development to interface design and documentation. Tlon has sold (and granted) both its own galaxies, and some of those originally designated as urbit.org galaxies towards this end. We'll continue to do this for the foreseeable future, since Urbit's development needs (though finite) remain ongoing. We can't predict exactly how long this will continue, although we wish we could!
29+
30+## Future plans
31+
32+As Urbit becomes more widely used, we expect to make the Tlon/urbit.org separation real.
33+
34+We've considered the foundation model, but have come to the conclusion that it doesn't really make sense. For one, it's quite expensive in terms both of administrative overhead, and the associated legal costs. For another, there just isn't anyone we trust enough to take over high level management of such an organization (see Tezos). Finally, our view is that foundations are not entirely effective in their mandates (see [this article](https://nadiaeghbal.com/foundations) from our friend Nadia).
35+
36+One step we're pursuing is the creation of a board of advisors to guide our use of the urbit.org assets at Tlon. We're in discussions with several potential board members now. Our goal with this structure is to include more voices outside of Tlon in the process of governing the urbit.org assets, and to make their advice transparent to the public.
37+
38+As with all of our projects, we think it's better to walk before we run. For now, Tlon will continue to act as urbit.org and use both pools of resources for ongoing platform development. Next, we'll create a board to advise on the use of those resources. Eventually, Tlon and urbit.org will likely become separate entities. We'll get there – one step at a time.
content/blog/hackathon-results.mdnew file+67
@@ -0,0 +1,67 @@
1++++
2+title = "Hackathon Results"
3+date = 2020-06-12
4+description = "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+[extra]
6+author = "Robert Mariani"
7+ship = "~lodleb-ritrul"
8+image ="https://media.urbit.org/site/posts/essays/hackathon-results-wide.png"
9++++
10+
11+<br>
12+
13+<img class="ba" src="https://media.urbit.org/site/posts/essays/hackathon-results.png">
14+
15+<br>
16+
17+Results of the Urbit Hackathon
18+
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+
21+Congratulations to all the participants, especially the winners—their projects are seriously impressive.
22+
23+
24+### First Place: Eight Stars
25+
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.
27+
28+Canvas 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.
29+
30+In 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.
31+
32+Check out a video [demonstration](https://www.youtube.com/watch?v=S6DySv730Hw) of Canvas, and view [the code](https://github.com/yosoyubik/canvas).
33+
34+Jose wins eight stars, and he also wins [le internet for the day](https://news.ycombinator.com/item?id=23228058). Bravo!
35+
36+
37+### Second Place: Four Stars Each
38+
39+Luke Champine’s (`~watter-parter`) flashcard app for Landscape, Rote, has been awarded one of two second-place prizes.
40+
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`.
42+
43+Luke 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.
44+
45+Pyry 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).
46+
47+
48+### Third Place: Two Stars Each
49+
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:
52+`roessler` proper, a library for solving the differential equations producing the [Roessler attractor](https://en.wikipedia.org/wiki/R%C3%B6ssler_attractor).
53+`lazytrig`, a library for transcendental functions.
54+`proj-3d`, a generator that takes the 3D coordinates produced by `Roessler`.
55+
56+The 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.
57+
58+John 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).
59+
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.
61+
62+Congratulations to the winners and to everyone who submitted—nice work!
63+
64+
65+### The Future
66+
67+We 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/hosting-the-future.mdnew file+33
@@ -0,0 +1,33 @@
1++++
2+title = "Hosting the Future"
3+date = 2020-10-01
4+description = "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+[extra]
6+author = "Nick Simmons"
7+ship = "~simfur-ritwed"
8+image ="https://storage.googleapis.com/media.urbit.org/site/posts/essays/200930-hosting-by-tlon.jpg"
9++++
10+
11+<br>
12+
13+![Ocean](https://storage.googleapis.com/media.urbit.org/site/posts/essays/200930-hosting-by-tlon.jpg)
14+
15+<br>
16+
17+Urbit 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.
18+
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+
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+
23+To 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.
24+
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+
27+Urbit 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.
28+
29+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. We don’t expect to be the only ones providing this service—and look forward to including more contributions from the community here on urbit.org as they continue to mature.
30+
31+If 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.
32+
33+See you all on the network!
content/blog/infrastructural.mdnew file+78
@@ -0,0 +1,78 @@
1++++
2+title = "Infrastructural"
3+date = 2020-04-10
4+description = "A reflection–meditation on OS 1’s initial form development, and the attitude we brought to bear in designing it."
5+[extra]
6+author = "É. Urcades"
7+ship = "~fabled-faster"
8+image ="https://media.urbit.org/site/posts/essays/infrastructural-2.jpg"
9++++
10+
11+<br>
12+
13+<img class="ba" src="https://media.urbit.org/site/posts/essays/infrastructural-1.jpg">
14+
15+## Seasons
16+
17+It’s early 2020, the transition between winter and spring, and Tlon’s interface group has concluded a series of projects that mark a transition point for the Urbit project. We’ve named the culmination of our efforts “OS 1,” as in “Operating System 1.”
18+
19+For those who have yet to try it out, OS 1 is a bundling of “essential digital utilities” in the form of 1) a linear chat, 2) a long-form text editor and publishing/discussion medium, 3) a link bookmarking/discussion software, and most importantly, 4) a grouping mechanism that allows you to bundle the above services in the context of a group of friends, acquaintances, or family. We see these utilities as being archetypical “software shapes” that are inherently flexible and open for interpretation in terms of their use, but we have wild expectations for how these software shapes will evolve in the near future. Later design output and supplementary writing will expand upon what we mean by this.
20+
21+Functionally, OS 1 has been designed to serve as a bridge between [OS 0](https://urbit.org/blog/landscape-a-portrait/) (The first interface in Urbit’s evolutionary chain) and OS 2 (Urbit’s eventual departure from the web browser context). In its service as a “bridge”, we designed OS 1 to extend from the baseline app-like “module” experience first defined in OS 0, while granting it new affordances that gesture towards nascent conceptions of “communal computing” we have planned for OS 2 onward.
22+
23+This year, as the warmer seasons give way to chillier ones, we plan on further demonstrating our vision of what new computers and networks can be and how they feel to use. Until then, we'll be building upon OS 1, our foundation and initial take on what we deem "human-shaped infrastructure."
24+
25+This post serves as a reflection–meditation on OS 1’s initial form development and the attitude we brought to bear in designing it. I will be highlighting a few disparate-yet-interconnected themes we encountered in our design work, and how we materially began to address them.
26+
27+## Products
28+
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+
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+
33+Here 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.
34+
35+## Beautiful Infrastructure
36+
37+OS 1, while incremental in its initial expression from OS 0, serves to outline our stance of what sublimely beautiful, useful, and durable digital infrastructure should feel like to inhabit. For the purposes of OS 1, we can imagine “Beautiful Infrastructure” to form the spirit of what we’re building:
38+
39+**Beautiful infrastructure is inhabitable**. You’re not floating in an infinite feed of content streams. You are situated in a defined space with edges you can shift at-will, as your needs deem fit. Our model for inhabitable computing is new and in limited flux, but our vision is long.
40+
41+**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.
42+
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+The 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.
45+In 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.
46+
47+Truly beautiful infrastructure undergirds the daily exchanges people actually care about—I don’t drink plumbing, I drink the water it carries and protects.
48+
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+
51+We deeply hope that Urbit can form a support structure for you and your community.
52+
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+
55+<br>
56+
57+<br>
58+
59+<img class="ba" src="https://media.urbit.org/site/posts/essays/infrastructural-2.jpg">
60+
61+## Expressing Infrastructure
62+
63+OS 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.
64+
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+
67+A few key design decisions emphasized the above gestalt we sought to express:
68+
69+- We decided very early on to revert the colorful presentation of Modulo to a literal blank slate—OS 1 is much like a sheet of graph paper now.
70+- All typography and typographic representation was severely flattened. This decision was one of our more drastic ones, and granted OS 1 a sense of being somewhat more "undirected" in terms of its form. We hope that as our system becomes more robust, users can decide which elements of their systems require emphasizing, to feel most at home with their information.
71+- The majority of graphics used throughout the system were rendered into black and white line drawings. As architectural schematics and orthographic projections flatten their representation of reality so an architect can “see structure” easier, we made the decision to express a visual foundation that felt more like a diagram than an ergonomic user interface.
72+- In its visual simplicity, OS 1 was essentially arranged to emanate the quality that modifying the underlying system was a simple task. Rather than present Urbit's first users with beautiful artistry and a sense that our infrastructure was to remain untouched and sacred, we decided to present a visual face to the project that felt nearly rudimentary, nothing outside the realm of editorial capability for the average person.
73+
74+Many other small constraints have been set into place to build what we truly believe to be simple, durable, personal, digital infrastructure.
75+
76+While 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.
77+
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.
content/blog/interim-constitution.mdnew file+144
@@ -0,0 +1,144 @@
1++++
2+title = "Interim Constitution"
3+date = 2016-05-16
4+description = "The governing rules for the early days of the Urbit network."
5+aliases = ["/posts/essays/interim-constitution", "/posts/constitution"]
6+[extra]
7+author = "Tlon"
8+ship = ""
9+image = "https://storage.googleapis.com/media.urbit.org/site/posts/essays/interim-constitution.jpg"
10++++
11+
12+![](https://storage.googleapis.com/media.urbit.org/site/posts/essays/interim-constitution.jpg)
13+
14+## Declaration of purpose
15+
16+Urbit is a new network created by the Tlon Corporation. Tlon's
17+broad intention is to surrender governance of Urbit to its users,
18+as soon as the community is collectively ready to receive it.
19+
20+This constitution (which is not a legal contract, just our present
21+intent, which may be updated arbitrarily) describes our governance
22+process during this interim period. Its design borrows from validated
23+historical structures, mainly Roman and Anglo-American.
24+
25+The last and most important task of the interim government is to
26+write the next version of the constitution. This document may or
27+may not incorporate any or all of the interim structures.
28+
29+## Beliefs and principles
30+
31+See our document of [beliefs and principles](../beliefs-and-principles).
32+
33+## Governance structures
34+
35+The interim republic has four branches: an executive consulate, a
36+galactic senate, a stellar congress and a planetary assembly.
37+
38+For 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
41+almost never consulted.
42+
43+In 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
46+consuls and holds them accountable, and specializes in compliance
47+with external powers. All votes, elections and other public
48+actions are logged in the Urbit global namespace.
49+
50+As in most parliamentary systems, each of these structures sets
51+and enforces its own internal rules of operation.
52+
53+### Consulate
54+
55+A consulate is a two-person executive. The consuls must work out
56+their own organization and division of labor. Disagreements
57+between consuls are resolved by the senate.
58+
59+A consul must be a senator. The senate, voting per galaxy,
60+replaces the consulate whenever either a vacancy exists, or a
61+vote of no confidence gains a majority. When electing consuls,
62+first a plurality selects one consul; then the plurality of those
63+who voted for anyone but the winner selects the second.
64+
65+### Senate
66+
67+The _senate_ is the set of all galaxy holders, voting per galaxy.
68+It does not convene except to replace the consuls. Its
69+proceedings are in private.
70+
71+To avoid growing the network too quickly, galaxies are activated
72+gradually. Initially, only one galaxy is active, the root `~zod`
73+(galaxy 0).
74+
75+Further activation is at the discretion of the consuls, who
76+control `urbit.org` and will only bind activated galaxies to
77+`galaxy.urbit.org`. Routing at the galaxy layer is by DNS, so
78+unbound galaxies, and any stars or planets they launch, hear no
79+packets.
80+
81+When any galaxy, activated or not, creates its initial
82+certificate, the consuls add its fingerprint to the galaxy table.
83+Non-activated galaxies can still be rekeyed.
84+
85+### Congress
86+
87+The _congress_ is the set of all active independent stars.
88+voting per star. An _independent star_ is any star _not_ owned
89+by anyone who is either a senator, or has some connection to one
90+that would pose a conflict of interest.
91+
92+The congress of stars is designed to exercise project and
93+community governance. Its proceedings are in private. The
94+consuls convene it at their pleasure, and keep it informed.
95+
96+### Assembly
97+
98+The _assembly_ is the set of all active primary planets, voting
99+per planet. A _primary planet_ is the main planet of a unique
100+human (no sockpuppets).
101+
102+The assembly is responsible for technical governance. Its
103+proceedings are in public.
104+
105+### The next constitution
106+
107+The congress proposes, and the senate approves, the next version
108+of this constitution. Future constitutions should be defined in
109+a smart contract platform, such as Ethereum.
110+
111+## Galaxy table
112+
113+95 galaxies are held by the [Tlon Corporation](https://tlon.io/). 50,
114+reserved for urbit.org, the future community foundation. 40, by
115+Tlon 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
118+donated to the project, contributed code or services, won a
119+contest, or were just at the right place at the right time.
120+
121+Note that while Tlon and its employees still control a majority
122+of galaxies, the senate is a ceremonial body; the consulate is
123+effectively equivalent to Tlon.
124+
125+## Inception
126+
127+This constitution takes effect as soon as the initial public
128+presale of Urbit address space is complete.
129+
130+## Endowment
131+
132+The 50 galaxies marked "urbit.org" in the galaxy table are
133+intended as property of the republic, and will be used only in
134+the interests of the republic and Urbit as a whole.
135+
136+Externally, these galaxies are held by Tlon; internally, they are
137+managed and voted by Tlon. Once the republic acquires a legal
138+identity and an independent human organization, Tlon pledges to
139+donate the `urbit.org` galaxies, the DNS domain, and the GitHub
140+`urbit` account to it.
141+
142+## First consuls
143+
144+The first consuls are Galen Wolfe-Pauly and Raymond Pasco.
content/blog/interplanetary_commerce.mdnew file+39
@@ -0,0 +1,39 @@
1++++
2+title = "Interplanetary Commerce"
3+date = 2021-04-09
4+description = "OS-level commercial primitives."
5+[extra]
6+author = "Christian Langalis"
7+ship = "~pindet-timmut"
8+image = "https://media.urbit.org/site/posts/essays/ocean.jpeg"
9++++
10+
11+<br>
12+
13+![ocean](https://media.urbit.org/site/posts/essays/ocean.jpeg)
14+
15+<br>
16+
17+## Paying
18+
19+A year ago, we started [integrating](https://urbit.org/blog/urbit-and-bitcoin/) Bitcoin into Urbit to be an OS-level primitive for money. Our initial objective: build a payments wallet, equally sovereign and ergonomic. The first public version, releasing this month, will have a broad set of capabilities including ship-to-ship payments, hardware wallet support, and full node integration. We’ll be unveiling this wallet on [April 27th](https://www.meetup.com/urbit-sf/events/276741426/). Do join us.
20+
21+Things only accelerate from here. Our next objective, to integrate Lightning Network capability, is now an [active bounty](https://gist.github.com/timlucmiptev/53ef1d290e55ea2fa25d9df681c32695) and open for applicants. Early on, we [recognized](https://www.youtube.com/watch?v=DTvRVHMbrcY) the congruence and compatibility between the Urbit and Lightning networks. Routing Lightning payments is an obvious business model for Urbit providers, one that can even nucleate new features onto Lightning itself. What we’re ultimately driving at is fully-sovereign Bitcoin usage, with the UX of the Cash App.
22+
23+## Being Paid
24+
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+>
27+><cite>Herman Melville</cite>
28+
29+However, 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.
30+
31+First, 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.
32+
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+
35+The 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).
36+
37+## An Ocean
38+
39+After honing our commercial tools on these use-cases, we’ll sail into a blue ocean. On the horizon: beautiful products, deployable at scale, built with the robust primitives of Urbit OS. Extensibility is Urbit’s promise to middle-men: every Web2.0 service they use to scalp us will find its P2P analog on Urbit. We invite developers and entrepreneurs of all stripes to join in the feeding frenzy. Ideas are constantly nucleating in <a href="web+urbitgraph://group/~pindet-timmut/urbitcoin-cash">Urbitcoiners</a> and <a href="web+urbitgraph://group/~bitbet-bolbel/urbit-community/graph/~darrux-landes/business-building-on-urbit">Urbit Community</a>.
content/blog/introducing-os1.mdnew file+141
@@ -0,0 +1,141 @@
1++++
2+title = "Introducing OS 1"
3+date = 2020-04-30
4+description = "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+[extra]
6+author = "Galen Wolfe-Pauly"
7+ship = "~ravmel-ropdyl"
8+image ="https://media.urbit.org/site/posts/essays/intro-os1-landscape.png"
9++++
10+
11+<br>
12+
13+<video class="ba w-100" autoplay loop src="https://media.urbit.org/site/posts/essays/intro-os1.mov"></video>
14+
15+## Introducing OS 1
16+
17+OS 1 is a simple, unified system for building digital communities. OS 1 is for groups of people sharing messages, links, and notes on Urbit.
18+
19+We designed and built OS 1 for ourselves, and we’re really enjoying using it every day. Instead of figuring out how to duct tape together apps and services, we use a single system to stay connected with the company and broader Urbit community that we really trust. OS 1 makes it feel like our company and community has a place in the digital world to call home.
20+
21+Most groups of friends and collaborators juggle apps and services to stay connected in the digital world today. We think OS 1 is a much better model. It’s still too early to ask the whole world to switch over to it — but we’re ready to help onboard our friends and adjacent communities into Urbit to have them try it out and get their feedback.
22+
23+First, let’s walk through what OS 1 is and how we’ve been using it. Then, if OS 1 is interesting to you, we’ll tell you how to apply for a community grant.
24+
25+Here we go:
26+
27+## What is OS 1?
28+
29+OS 1 is a very simple, integrated tool for messaging, sharing links, and writing with a group of people. 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.
30+
31+OS 1 isn’t our first attempt to build an interface for Urbit, but it’s certainly the most complete. OS 1 is the first Urbit interface that doesn’t feel like an experiment.
32+
33+Today, when you boot Arvo (the Urbit OS kernel) and connect your browser to it, you’ll see OS 1. OS 1 isn’t the only possible client for Arvo, though. Anyone could build their own client or, since it’s completely open source, modify OS 1 however they like.
34+
35+For most people, out of the box, OS 1 feels like an app. Given that it’s running on Urbit OS — it’s much more than that. It’s a full-fledged general purpose virtual computer that’s secure and private to you. We’ll come back to what that means at the end.
36+
37+Let’s walk through the features of OS 1 one by one to see what it’s like.
38+
39+### Groups
40+
41+<img class="ba" src="https://media.urbit.org/site/posts/essays/intro-os1-groups.png">
42+
43+The group is the main building block in OS 1. A group is simply a list of people that share a set of chat, links, and publish channels. A group is sort of like a super powerful group chat.
44+
45+A group of friends might just share a few chat channels. A reading group might just share a publish channel for discussion of what they’re reading and a links channel for upcoming books. As a company, we share a variety of chat, publish, and links channels to get things done and communicate. There are chats for each area of work, publish channels for digests and feature discussion, and links channels for music, influences and references, for example.
46+
47+Each person in a group is identified by their [Urbit ID](https://urbit.org/understanding-urbit/urbit-id/): a short, memorable name that you own with a private key (and belongs to you completely). Each group is private and requires an invite. Groups aren’t discoverable. They’re meant to be high-trust communities of people. More like a commune than a public event.
48+
49+Let’s walk through each module and talk about what they can do.
50+
51+### Chat
52+
53+<img class="ba" src="https://media.urbit.org/site/posts/essays/intro-os1-chat.png">
54+
55+Chat is chat: a sequential list of messages meant for synchronous communication. There are already a million ways to chat — but Urbit chat differs in a few important ways.
56+
57+First, each chat channel is only shared between the host and the members of a chat. When you DM with people, messages are sent peer to peer. The system is, in fact, decentralized and pseudonymous by default. No one knows anything about you outside of your Urbit ID.
58+
59+Second, each chat message is encrypted and signed by your Urbit ID. Again, we don’t call Urbit ‘secure’ yet since it’s unaudited — but we’re working to have Urbit audited this year.
60+
61+Third, chat in Urbit OS is a protocol for sending messages between computers on the network (known as “[ships](https://urbit.org/docs/glossary/ship/)” and identified by their Urbit IDs). It’s easy to imagine extending chat in all kinds of fun and interesting directions: chats that only accept certain message types, chats that have disappearing history, chats that you can only post to during certain times of day, and so on.
62+
63+(If you’re curious to try one of these things, or have an idea about something you’d like to experiment with — consider submitting a proposal in our [grants program](https://grants.urbit.org/). We regularly reward contributor work with address space.)
64+
65+We think of chat as a primitive, not simply a ‘better IRC’. But even in the rudimentary form it’s in today, chat is essential to delivering a feeling of being at home. There’s no way to deliver a complete interface for groups without chat.
66+
67+Anyway, not everything can happen in a chat. Let’s keep moving.
68+
69+### Links
70+
71+<img class="ba" src="https://media.urbit.org/site/posts/essays/intro-os1-links.png">
72+
73+Links is a bit like Hacker News or Reddit. It’s just a collection of links with comments. There’s no upvoting or sorting. We decided that with a small group it’s more about collecting references than deciding what’s most exciting — but permutations of Links could be a great area for contributors to experiment with.
74+
75+We use links to collect external references and track things we’re thinking about. We’re always looking at things going on outside our small digital universe and talking about them. Links lets us keep an archive of those discussions.
76+
77+We originally imagined links as evolving into more of a general-purpose ‘collection creation’ interface. One where you can pull together images, video, URLs, maybe even runnable code and so on into a single channel. We’ll get there.
78+
79+### Publishing
80+
81+<img class="ba" src="https://media.urbit.org/site/posts/essays/intro-os1-publish1.png">
82+
83+Publishing is somewhere between a blog and a note-taking system. A Publish notebook is a list of markdown files with optional comments. A private Publish notebook is like a journal, a group notebook can be like a forum (with comments on) or a collaborative blog.
84+
85+We use publish for both long-form discussion and one-way communication about what we’re working on in its current form. The editor is calm and simple. In distraction-free mode, it’s a nice place to put a note together.
86+
87+Publish, like all our other modules, is an interface to a generalized protocol for storing text. We have high hopes for how Publish can evolve into a flexible tool for notetaking and discussion with richer content types and better controls over structuring discussion.
88+
89+### Modules
90+
91+<img class="ba" src="https://media.urbit.org/site/posts/essays/intro-os1-home.png">
92+
93+You’ll find a few other things on the home screen: a clock, the weather, and a simple command-line that we call the Dojo. These are system-wide utilities that aren’t group-specific.
94+
95+The clock and weather tiles are simple indications of the state of the outside world. We built them because they’re things we wanted to be able to check in on often. When you’re spending much of the day in front of a computer, it’s nice to know if you have enough daylight left to get some exercise in.
96+
97+### Dojo
98+
99+<img class="ba" src="https://media.urbit.org/site/posts/essays/intro-os1-dojo.png">
100+
101+The Dojo gives you a quick way to see that, under the hood, Urbit OS is a powerful general-purpose system. The system hasn’t evolved to the point that our libraries, frameworks, and modules are polished to our standards. Since it’s still early, we can’t claim that it’s easy to develop on top of this platform. But we want it to become much easier.
102+
103+## Why we made OS 1
104+
105+We made OS 1 because we wanted to begin the process of re-centralizing our digital lives on a platform we actually control. Replacing all the services we use all at once is impossible — so we picked a suite that we felt would work nicely together. We’ve always felt that one of the most exciting things about Urbit is in bringing your digital life together in a way that feels like home.
106+
107+The digital home, we think, is what our computers are meant to be but simply can’t be in a world of cloud services. Once upon a time, thirty years ago, your personal computer was an open-ended tool that was reasonably simple to understand and use, lasted a pretty long time, and belonged to you in every way.
108+
109+OS 1 is a first step down the road back to a system that’s simple, durable, and belongs to you in every way. It’s a long road, and we feel like we’ve made a very significant step forward.
110+
111+One 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.
112+
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+
115+## Looking ahead
116+
117+By using OS 1 you inherit all the benefits of running Urbit OS. Each user runs their own node completely independently. Everyone using Urbit OS owns their own identity and data. And every Urbit OS node communicates over an encrypted and authenticated network. (Again, We don’t yet call Urbit OS ‘secure’ because it hasn’t been audited.)
118+
119+OS 1 is just a client for Urbit OS, of course. Other people could write their own clients that are completely different — like different windowing systems for Linux. Our hope is to build a client that includes interface components and frameworks that make it exceptionally easy to build modules for groups of people to share. Other clients could potentially invent entirely new ways of interacting with the underlying system.
120+
121+There are two threads by which OS 1 evolves into OS 2 and beyond. First, by becoming a more powerful system and second, by adding modules to expand our supported modes for interacting.
122+
123+In its current form, OS 1 by no means exposes all the power of the underlying system. Our approach to building OS 1 was to focus on the quality of the UI, and accept that it will feel like a monolithic app. We’re already working to evolve our interface into something that feels flexible to an ordinary user and developers can easily extend and build on top of.
124+
125+Specifically, we want better affordances for putting multiple streams of data on the screen at once, better keyboard shortcuts and navigation affordances, better libraries and frameworks for building modules. We want a standalone client and a single login system. These are some of the things currently on the drawing board.
126+
127+As far as modules are concerned, there are too many things we’d like to build to list them all. We’d really like to have threaded conversations; short, Twitter-style messages; biometric and status tracking; an e-book reader and annotations system — and that’s just to name a few we see in the near term.
128+
129+We’ve long since felt that the most powerful thing about Urbit is that it’s a general-purpose system. OS 1 puts us on the road to giving people an actual material sense of what using a general-purpose networked computer feels like.
130+
131+As we expand the affordances of the system and add modules over the course of OS 1, 2, and beyond we expect to deliver a system that can foster everyday creativity. There’s a long road ahead, in the best possible sense. We’re really excited about what the future holds.
132+
133+### Becoming a homesteader
134+
135+<img class="ba" src="https://media.urbit.org/site/posts/essays/intro-os1-landscape.png">
136+
137+As a distributed team trying to stay connected, we like using OS 1 from day to day. We’d really like to hand-onboard a small group of like-minded groups of people who want to experiment with living on the fringe of the digital world. Toward this end, we started the community grants program.
138+
139+Each community that’s selected will get a block of address space to share, direct support, and (in the near future) free hosting.
140+
141+Please tell us a bit about yourselves [here](https://urbit.org/community/community-grants/).
content/blog/io-in-hoon.mdnew file+322
@@ -0,0 +1,322 @@
1++++
2+title = "Input and Output in Hoon"
3+description = "Let's talk about IO in Urbit."
4+date = 2020-12-16
5+[extra]
6+author = "Philip Monk"
7+ship = "~wicdev-wisryt"
8+image = "https://media.urbit.org/site/posts/essays/zion-canyon-1.jpg"
9++++
10+
11+<br>
12+
13+![canyon](https://media.urbit.org/site/posts/essays/zion-canyon-1.jpg)
14+
15+<br>
16+
17+
18+Let'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.
19+
20+All 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!
21+
22+## The three styles of IO
23+
24+I will call these styles imperative IO, monadic IO, and state machines (note that this classification refers only to the experience of using them and the program structure they dictate). An imperative programming language can use any of these and a functional programming language can use any of them.
25+
26+### Imperative IO
27+
28+Imperative languages (such as C and Python) perform IO by calling a function in the middle of whatever they were doing. Anywhere, in any statement, you could have IO.
29+
30+In this example and others to follow, the task will be to read a filename from the command line, read a URL out of that file, and fetch the contents at that URL.
31+
32+ output = fetchUrl(stripWhitespace(readFile(cliInput())))
33+
34+For readability, intermediate variables would be a good idea, but nothing stops you from nesting IO this way.
35+
36+### Monadic IO
37+
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.
39+
40+ fileName <- cliInput()
41+ url <- readFile(fileName)
42+ output <- fetchUrl(stripWhitespace(url))
43+
44+[Tackling the Awkward Squad](https://www.microsoft.com/en-us/research/wp-content/uploads/2016/07/mark.pdf) is the canonical description of monadic IO, and does a great job of explaining how the Haskell community decided to use this as their primary IO style.
45+
46+### State machines
47+
48+Languages that use explicit state machines for IO (such as Elm) perform IO by accepting events and producing a list of effects.
49+
50+ event :: Initialize
51+ | CLIInput text
52+ | FileInput text
53+ | HTTPResponse body
54+ effect :: CLIInput
55+ | ReadFile fileName
56+ | FetchUrl url
57+ | Print text
58+ main(event) {
59+ switch event {
60+ Initialize -> [CLIInput ~]
61+ CLIinput fileName -> [ReadFile fileName]
62+ FileInput url -> [FetchUrl stripWhitespace(url)]
63+ HTTPResponse body -> [Print body]
64+ }
65+ }
66+
67+The effects produced are not functions but data.
68+
69+It's important to note that this example is chosen to highlight a particular kind of IO — sequences of events. Further, this example has no persistent state — each IO operation is a pure function of the output of the previous one.
70+
71+## A stateful, loopy example
72+
73+Let's look at another type of program: a simple HTTP server that you can give text at the CLI, which will respond to all HTTP requests with that text.
74+
75+Imperative:
76+
77+ text = "no text entered yet"
78+ while (true)
79+ cli = readCli()
80+ if (cli != Null)
81+ text = cli
82+ request = readHttp()
83+ if (request != Null)
84+ respond(request,text)
85+
86+Monadic:
87+
88+ loop("no text entered yet")
89+
90+ where:
91+
92+ loop :: text -> IO Null
93+ loop =
94+ input <- readInput()
95+ switch input
96+ CLIInput newText -> loop(newText)
97+ HTTPRequest request ->
98+ _ <- respond(request,text)
99+ loop(text)
100+
101+State machine:
102+
103+ text = "no text entered yet"
104+ main(text,event) {
105+ switch event {
106+ CLIInput newText -> [newText, Null]
107+ HTTPRequest request -> [text, HTTPResponse text]
108+ }
109+ }
110+
111+Again, note the response in the state machine is data, not a function.
112+
113+I'm not trying to make a point about which type is better in general. There's a pretty strong argument that in the first example, imperative was the best option, followed by monadic, followed by state machine. There's an equally strong argument that the second example is most naturally represented by the state machine.
114+
115+Look at how state is handled in the monadic example. Formally, bind composes functions, so that every time you see a `<-` there's actually a new function (closure/delimited continuation) being created and stored for when we receive a response. All variables in scope are stored in that closure, so we can conveniently access them later without explicitly storing them. However, the state we preserve over time varies a lot. In this example, it varies between storing `loop`, `[loop input]`, `[loop input newText]`, and `[loop input request]`.
116+
117+By comparison, the state machine does not store intermediate values, it only stores its explicit state. While this is somewhat less flexible, it puts the permanent state front-and-center.
118+
119+I'll reiterate that all of these are possible to implement in purely functional languages, and further they can all be implemented in terms of each other. State machines are trivially implementable -- it's just a function [state event] -> [new-state (list effect)]. Monadic IO can be implemented directly (as in Haskell) or on top of state machines by storing continuations in your state. Imperative IO is somewhat more difficult but should be possible through algebraic effects.
120+
121+When inventing a new system, you should consider which of these you intend to support based on the sort of code you expect to see. For example, a scripting language will almost always benefit from imperative (or at least monadic) style.
122+
123+## In Urbit
124+
125+So much for exploring the space of IO solutions. In terms of deployed code on Earth, the split is about 90% imperative, 5% monadic, and 5% state machine. In Urbit, the split is about 90% state machine and 10% monadic. This is what I intend to explain and defend.
126+
127+Urbit's OS is called Arvo; it has several "kernel modules" called vanes, and it has userspace applications. Colloquially these are called "apps," but when speaking about them abstractly, it's helpful to use their more specific name: ["agents"](https://urbit.org/docs/tutorials/arvo/gall/#agents). Arvo, the vanes, and agents are all structured as explicit state machines.
128+
129+In addition, there are ["threads"](https://urbit.org/docs/tutorials/arvo/gall/#threads), which are structured as monadic IO. Note there's only a superficial resemblance to Unix threads: they are not executed in parallel and they don't share memory, or at least not any more than agents do. They're simply a computation that takes an argument and produces a result, possibly after doing some IO, structured monadically.
130+
131+As you can see, all the lowest levels of Arvo are explicit state machines, and only the highest layer supports monadic IO. To see why this is the case, let's list advantages and disadvantages to each type. Note that, while I'm speaking specifically of agents and threads in the context of Urbit, these are fundamental properties of monadic and state machine IO.
132+
133+Agents are:
134+
135+- Upgradable. Since the state is explicit, you can upgrade an agent in-place by supplying a new state machine and a function from the old state type to the new state type. This is very similar to a database migration.
136+
137+- Robust. A state machine must accept any input at any time. If it receives unexpected input, it must have had explicit error handling for that input, since it's one of the types in the switch statement. Thus, it's relatively easy to stay in a consistent state.
138+
139+- Permanent. Since it's upgradable and robust, there's no reason to stop its running.
140+
141+- Hard to write long sequences of IO. Long sequences of IO create many possible states, and you must handle any input in any state. This can result in complex, hard-to-follow code with code paths that are rarely if ever taken.
142+
143+Threads are:
144+
145+- Not upgradable in-place. Since the state is implicit, you can only cleanly upgrade by (1) killing the thread and restarting it or (2) letting it resolve to a defined "upgradable state" periodically, usually at the top of a "main loop". If you do (2), then you are in fact structuring it as a state machine, so the other advantages of threads are compromised.
146+
147+- Fragile. If we don't receive expected input, the default behavior is to be stuck waiting for input. You must remember to add any error-handling features you want, and it's easy to end up in an inconsistent state.
148+
149+- Impermanent. Since a thread can't be upgraded and may get stuck in case of unexpected input, a thread can't be expected to last forever. It must be "rebooted" from time to time.
150+
151+- Easy to write long sequences of IO. Just...write the IO one line at a time.
152+
153+Arvo proper and the vanes are permanent pieces of software and, for this reason, state machines are more natural.
154+
155+I'll note that other kernels, like the Unix kernel, use imperative IO. The difference is that Unix isn't permanent in itself — it only lasts until you reboot. Since your permanent state is stored externally, you don't need to be upgradable or permanent. With sufficient discipline you can write robust C code, so it makes sense to use imperative style. Even so, a lot of C code is written in a state machine style; even if it doesn't need to be upgradable, it's worth it for the robustness and concurrency advantages.
156+
157+However, Arvo is a single-level store — all of its state is permanent. This is very convenient and eliminates many long-tail bugs, but it also means we need to code for permanence, and that's much easier when you structure your code with explicit state.
158+
159+Further, Arvo and the vanes rarely perform long sequences of IO. Generally, they do one thing and emit some effects, similar to the HTTP server example above. Sometimes they "pass through" a request. For example, the Eyre vane passes HTTP requests to userspace agents or threads. In this case, there is a sequence of IO, which in monadic code would be:
160+
161+ loop()
162+
163+ where:
164+
165+ loop =
166+ request <- receiveRequest()
167+ agent = lookupAgent(request)
168+ response <- callAgent(agent, request)
169+ _ <- sendResponse(request, response)
170+ loop()
171+
172+This is clear code to read, but it leaves open the question of how to respond during the callAgent() function. If another request comes in, can we handle it in parallel? If we need to upgrade ourselves before the agent responds, can we make sure to properly handle the response?
173+
174+The naive solution in monadic code is to say that you can only handle one request at a time, and if an upgrade happens you just drop outstanding requests. You can resolve both of these by introducing a sort of main loop, which is just a way of saying "turn it into a state machine".
175+
176+In a state machine, the naive solution is:
177+
178+ state :: (map request agent)
179+ main(state, event) {
180+ switch event {
181+ HTTPRequest request ->
182+ agent = lookupAgent(request)
183+ [put(state, request, agent), CallAgent agent request]
184+ AgentResponse request response ->
185+ [del(state, request), HTTPRespond request response]
186+ }
187+ }
188+
189+Upgrading this is trivial, since the state (map of requests to outstanding calls to agents) is explicit. It also trivially handles concurrent requests.
190+
191+I won't claim this is easier or harder to write than the monadic version, but it has the properties we need at this level of the system.
192+
193+Userspace agents similarly are permanent entities that need to not lose data or get stuck. For this reason they’re structured as state machines.
194+
195+A helpful comparison is that explicit state machines are basically Mealy machines, the kind you might have learned about in an introductory digital design class. This shouldn't be surprising; a digital circuit must always be consistent because it can't be manually "rebooted", and their input and output is highly formalized. By contrast, a Rube Goldberg machine doesn't have the same constraints; which is why they're a lot more fun!
196+
197+It's notable also that explicit state machines are considerably more declarative than imperative or monadic IO. Not everyone thinks that's a good thing, but anyone who defends functional programming should see some advantages to that.
198+
199+However, userspace sometimes needs to perform long sequences of IO. Let's look at an example where we want to fetch the front page of a site and the first couple comments on each story. HTTP is unreliable, so on failure we retry five times.
200+
201+Monadic:
202+
203+ topStories <- fetch(topStoriesUrl)
204+ loop(topStories)
205+
206+ where:
207+
208+ loop :: topStories -> IO Null
209+ if topStories is Null
210+ return Null
211+ comments <- retryLoop(5,head(topStories))
212+ otherComments <- loop(tail(topStories))
213+ append(comments,otherComments)
214+
215+ retryLoop :: [n story] -> IO Comments
216+ comments <- fetchComments(story)
217+ if comments is HTTPError:
218+ if n == 0:
219+ bail
220+ else:
221+ retryLoop(n-1, story)
222+
223+State machine:
224+
225+ state :: Initial
226+ | FetchingTop
227+ | FetchingStory comments stories retries
228+ | Done comments
229+
230+ main(state, event) {
231+ switch event {
232+ Initialize ->
233+ assert state == Initial
234+ [FetchingTop, Fetch topStoriesUrl]
235+ HttpResponse response ->
236+ switch state {
237+ FetchingTop ->
238+ [FetchingStory Null stories 5, FetchComments head(stories)]
239+ FetchingStory comments stories retries ->
240+ if response is HTTPError:
241+ if retries == 0:
242+ [Initial, Null]
243+ else:
244+ [FetchingStory comments stories retries-1,
245+ FetchComments head(stories)]
246+ else:
247+ comments = append(response,comments)
248+ if tail(stories) is Null:
249+ [Done comments, Null]
250+ else:
251+ [FetchingStory append(comments,response) tail(stories) 5,
252+ FetchComments head(tail(stories))]
253+ }
254+ }
255+ }
256+
257+With practice, the state machine version of this can be written correctly. However, (1) it's verbose, (2) the control flow jumps all over the place, and (3) in practice it's challenging to get exactly right. This is still a small example, and it gets much worse as the length and complexity of the IO sequence grows.
258+
259+The monadic version, on the other hand, flows cleanly down the page. We can factor out generic functionality like "retry this request n times" to make the essence of the computation clear.
260+
261+Suppose you have to upgrade this. In the state machine, you can see exactly which stage of the computation you're in and write specific code to upgrade cleanly.
262+
263+Threads, as we've discussed, can't be upgraded in-place. Let's be real though: we're downloading comment sections, not regulating a nuclear reactor. If we get a better version of this script, just kill the old one and start the new one from scratch. What's a couple extra HTTP requests?
264+
265+This suggests a general division of workloads: code which needs to be permanent, upgradable, and concurrent should generally be a state machine. Code with long or complex sequences of IO and definite termination should generally be a thread.
266+
267+These aren't completely mutually exclusive, but it's surprising how often they are.
268+
269+### Jael: a case study
270+
271+When you need to do something permanent and upgradable, but you also need to do long sequences of IO, the main trick is to factor your problem into both an agent and a thread (or several).
272+
273+As a case study, consider Jael, one of our vanes. This maintains our PKI state, which it downloads over HTTP from an Ethereum node. Downloading from an Ethereum node is a complex sequence that starts with fetching its most recent block number, then fetching all the blocks we haven't seen and scanning for transactions we care about. We also maintain a map of block hashes to block number, and if we see that a block's parent doesn't have the hash we expect, that means a reorganization has occurred, so we must "rewind" one block at a time until we find where the fork happened, then restart going forward.
274+
275+You don't have to understand this sequence of IO; it's sufficient to see that it's complex and must be exactly right. We used to do this in a state machine directly in Jael. This data is, of course, permanent and needs to be accessible to the rest of the system, so Jael must be a state machine.
276+
277+However, we had many small mistakes in this sequence of IO, some of which only appeared during unusual events, such as when an HTTP request failed at the same time as a reorganization happened.
278+
279+We're in a bit of a bind, though: Jael has to be a state machine. The solution is to factor out the act of getting updates into a thread while the main PKI state is stored in the state machine in Jael.
280+
281+This thread has a definite purpose: given the most recent block number we already know about, fetch all the PKI transactions since then. The function signature is:
282+
283+ syncEthereum oldBlockNumber -> IO [newBlockNumber, newTxs]
284+
285+Jael runs this thread every five minutes and, if it succeeds, then we update our block number and PKI state. If the thread fails, gets stuck, or we need to upgrade it, we just kill the old thread and start a new one. Again, a few extra HTTP requests don’t matter.
286+
287+From Jael's perspective, it looks something like:
288+
289+ state :: State block txs outstandingThread
290+ main(state,event) {
291+ switch event {
292+ Initialize -> [State 0 Null Null, StartTimer (now + five minutes)]
293+ TimerFired ->
294+ effects = If outstandingThread is Null
295+ then Null
296+ else [Kill outstandingThread]
297+ newId = newThreadId()
298+ [State txs newId,
299+ append(effects,
300+ StartThread newId syncEthereum(block),
301+ StartTimer (now + five minutes))]
302+ ThreadFinished Failure -> [State block txs Null, Null]
303+ ThreadFinished Success newBlockNumber newTxs ->
304+ [State newBlockNumber append(txs,newTxs) Null, Null]
305+ }
306+ }
307+
308+In other words, from Jael's perspective, it's just a single IO event that encapsulates arbitrarily complex IO in the thread. A single IO event is easy enough, and we can maintain all our permanency and robustness guarantees, because we know the thread will have one of three results: success, failure, or it hangs. If we set a timeout, hang becomes failure, so there's only two possible results: success or failure. If we handle both of those correctly, we've handled all the possible IO errors that could have occurred.
309+
310+What about upgrading? We've already said we can handle the thread dying for arbitrary reasons, so if an upgrade comes in, we just kill it. We can upgrade Jael's state machine easily since its state is very simple.
311+
312+## Recap
313+
314+Let's recap what we've covered:
315+
316+- There are three styles of IO: imperative, monadic, and explicit state machines.
317+- Urbit supports explicit state machines (agents) and monadic IO (threads).
318+- Explicit state machines are preferred for permanent, robust, concurrent code.
319+- Monadic IO is preferred for short-lived code with complex IO.
320+- If a state machine needs to perform complex IO, it should encapsulate it in a thread so that, from the perspective of the state machine, it's simple IO.
321+
322+Hopefully it's fairly clear why Urbit uses explicit state machines in most situations. More than anything else, our goal is to build software that can last forever. Explicit state machines are a crucial tool for that.
content/blog/iot.mdnew file+448
@@ -0,0 +1,448 @@
1++++
2+title = "Lunar Urbit and the Internet of Things"
3+date = 2021-04-30
4+description = "Potential future use cases of moons for industry and consumers"
5+[extra]
6+author = "Jonathan Paprocki"
7+ship = "~datnut-pollen"
8+image = "https://media.urbit.org/site/posts/essays/phobos.jpeg"
9++++
10+
11+<br>
12+
13+![phobos](https://media.urbit.org/site/posts/essays/phobos.jpeg)
14+
15+<br>
16+
17+Each of the ~4B 32-or-fewer-bit or [Azimuth](/docs/glossary/azimuth)
18+identities, namely [planets](/docs/glossary/planet),
19+[stars](/docs/glossary/star), and [galaxies](/docs/glossary/galaxy), may
20+spawn ~4B 64-bit child identities known as [moons](/docs/glossary/moon).
21+Moons are the undeveloped wild outback of Urbit, with a story waiting to be told
22+that promises to be as enormous in scale as the cloud personal computing story
23+told by planets, and possibly even more so.
24+
25+Throughout this piece, we use "Earth" and "Mars" in the Urbit sense. "Earth"
26+refers to the [current computing
27+paradigm](https://en.wikipedia.org/wiki/Big_ball_of_mud). "Mars" refers to the
28+perfected computing paradigm that Urbit aspires to be, but also to the current
29+and future state of Urbit.
30+
31+Today we will review the prehistory of moons on Earth, give a snapshot of how
32+moons are being utilized on Urbit in 2021, cover existing issues with consumer
33+IoT and how Urbit resolves them, and speculate what the lunar locus of the Urbit
34+ID address space may become in the future. To keep the futurist scope limited,
35+we primarily speculate on the usage of moons in (industrial) internet of things
36+settings, especially with respect to agriculture, and how they may manifest as
37+the workhorse collection unit of decentralized data markets.
38+
39+For those unfamiliar, moons differ from all other
40+[ships](/docs/glossary/ship) in that they are not independent identities
41+with total sovereignty over their data and keys. Instead, their cryptographic
42+keys are issued and controlled by their parent identity. The relationship
43+between the keys of a parent ship and its moons are analogous to the
44+relationship between primary keys and subkeys in a system like
45+[PGP](https://en.wikipedia.org/wiki/Pretty_Good_Privacy). The parent may revoke
46+or change its child moons' keys at any time. A typical relationship between a
47+planet and a moon may be like one of a human and their smartphone. If you lose
48+your phone, you don't want someone to pretend they are you, operating one of
49+your moons, on the network. The planet can revoke the keys, and the moon stored
50+on the phone becomes inert, no longer able to communicate with the network.
51+While planets and stars also depend on their sponsor to assist with peer
52+discovery and software updates, these relationships rely on mutual agreement,
53+since either party may choose to discontinue the relationship and establish a
54+new one elsewhere. Moons possess no such freedom.
55+
56+### Lunar prehistory
57+
58+![luna](https://media.urbit.org/site/posts/essays/luna.jpg)
59+
60+It may come as a surprise to you that you are already very familiar with moon
61+identities—they've just never been explained as such because the context in
62+which that terminology makes sense didn't exist before Urbit. Moons, in fact, are not
63+a new concept at all. Virtually your entire experience of the internet in the
64+modern era is the experience of someone who possesses some number of moons
65+subordinate to planets who mostly refuse to talk to one another. The feeling you
66+get of constantly moving between silos, juggling accounts, not controlling your
67+own data, etc., is a direct result of the fact that, on Earth, you only possess
68+moons. No planets.
69+
70+We're speaking, of course, of the client-server relationship. From the Urbit
71+perspective, the Facebooks, Twitters, and Googles of the world are planets, and
72+accounts held with these services may be thought of as moons subordinate to
73+those planets. Your account with these megacorps is only yours for as long as
74+they please. If you happen to step on a digital landmine, such as a virus that
75+causes Google's servers to believe you are a bot, you are suddenly banned from
76+their service, often with no recourse. All your data, your connections, your
77+network—vanished. We are all Mark Zuckerberg's moons, and they're armed to the
78+teeth with surveillance equipment.
79+
80+There are two classes of internet users: those with servers who hold all the
81+power, and clients who use those servers in the way prescribed by the owners.
82+Running a server is theoretically accessible to anyone, but practically
83+difficult: server maintenance is a technical endeavor that requires specialized
84+knowledge and substantial time investment. Other barriers exist beyond just the
85+technical: for instance, if you wish to set up your own email server, you will
86+probably be blocked by large providers because unknown email servers are almost
87+always spam. The root cause of this circumstance is that the email protocol
88+lacks [Sybil resistance](https://en.wikipedia.org/wiki/Sybil_attack). Urbit has
89+Sybil resistance built in, eliminating certain kinds of incentives for
90+gatekeeping such as this.
91+
92+We seek to level the playing field by giving everyone a server. We accomplish
93+this by making the process of running your own server (planet) as easy as
94+running your personal computer today. We aren't quite there yet, but we've made
95+leaps and bounds over the past couple of years.
96+
97+Of course, this analogy isn't perfect—Urbit moons are servers themselves, but as
98+they may only act in accordance with the wishes of its parent, they are
99+effectively as locked in degrees of freedom as a client is to a server. The
100+moon's keys may be revoked at any time by the parent. To distinguish these
101+prehistoric moons from Urbit moons, we will refer to them later as "primitive
102+moons".
103+
104+Urbit contends that moons are not the appropriate digital exocortex for a
105+responsible adult. They are for devices, experiments, or your children. We hope
106+that the dominant server-client relationship, which is the primary weapon of the
107+surveillance-industrial complex, will meet its end in the near future.
108+
109+### Moons in the early Martian era
110+
111+![sputnik](https://media.urbit.org/site/posts/essays/sputnik.jpg)
112+
113+In 2021, moons are mostly unused on Urbit. There's a smattering of minor use
114+cases which we'll describe here, but they represent only a tiny fraction of
115+their ultimate potential.
116+
117+Tlon recently launched a survey bot called [Eliza](/blog/eliza), which was
118+initially a comet. We frequently got questions on whether Eliza was actually
119+Tlon's bot, because it could just as easily be a malicious actor posing as Tlon.
120+We soon plan to relaunch Eliza as a moon of `~zod`, which is the most
121+recognizable official galaxy of Tlon. This is to establish that the bot is
122+indeed official; only someone with access to `~zod` is capable of creating a
123+moon of `~zod`, and so a moon of `~zod` automatically carries with it a
124+cryptographic guarantee that you are communicating with an official digital
125+representative of Tlon. On Earth something like this would need to be
126+accomplished with certificate chains but, on Mars, this sort of authentication
127+is baked into the very fabric of the network, rather than as an additional layer
128+on top. This is a very good representative case of how moons naturally inherit
129+the reputation of their parent, even in the absence of any formal reputation
130+systems on Urbit.
131+
132+We see folks using moons as backup identities in case they can't or don't want
133+to access their primary planet for one reason or another. Again, since anyone
134+may verify the parent of a moon, the moon inherits the reputation of its parent.
135+These backups could be vanity identities—for instance, every `~sampel-palnet`
136+has underneath it a moon named `~master-sampel-palnet`[^0].
137+
138+Some use moons to host group(s). Hosting a group inevitably means that that ship
139+will process more network traffic, and a heavily trafficked group may impact a
140+ship's performance. Thus one may wish to offload group hosting duties to a moon
141+to maintain a more performant planet.
142+
143+As we currently lack a real system for 3rd party software distribution (though
144+see this recent [developer call](https://youtu.be/XwICC6Its1E) on a solution in
145+progress), one stopgap has been to download software by syncing a foreign
146+[desk](/docs/glossary/desk) to your ship. This is risky, as buggy software
147+may make break your ship and make it difficult to get running properly again.
148+For this reason, testing new software on the livenet is frequently performed on
149+moons, so as not to risk the parent ship if something were to go wrong.
150+
151+### Internet of Things
152+
153+![telstar](https://media.urbit.org/site/posts/essays/telstar.jpg)
154+
155+Now we start to look towards the future by examining the problems faced by IoT
156+in the present and speculating on how Urbit might solve them.
157+
158+The Internet of Things is much maligned by technologists as a privacy, security,
159+and maintenance nightmare. These products usually depend on phoning home to
160+perform their service, which is inevitably a funnel by which personal data is
161+harvested, an attack surface for hackers to gain access to your home network,
162+and a single point of failure which may render the device useless, all in one!
163+One need look no further than the recent [Ubiquiti
164+breach](https://krebsonsecurity.com/2021/03/whistleblower-ubiquiti-breach-catastrophic/)
165+to see all of these failure modes happening on a massive scale, and this is par
166+for the course. This sort of dynamic is completely antithetical to the Urbit
167+philosophy, so any involvement of Urbit with IoT will reject many fundamental
168+assumptions on how IoT operates today.
169+
170+However, it's important to understand why the current IoT model works like this
171+at all. We posit that it ultimately stems from the fact that today's IoT
172+products are primitive moons for which you do not operate the parent planet.
173+Almost every IoT device operates in the Software as a Service (SaaS) paradigm
174+because most people don't have personal servers that could do all the processing
175+work actually necessary for an IoT device to operate. This is not the _only_
176+reason for this—it's also just more profitable to collect consumer data.
177+However, it's the SaaS aspects which make the whole thing such a catastrophic
178+mess.
179+
180+Imagine a different world: if the server that your device reports to is your
181+own, there is no loss of control over personal data. If the device only
182+communicates on the local network, it will prevent remote hackers and disruption
183+if you internet fails. And if the manufacturer goes out of business, the device
184+will still work-it is not dependent on the manufacturer's servers.
185+
186+The wants and needs of the individual are at odds with the wants and needs of
187+the megacorp, and that mismatch manifests as the antifeatures that plague IoT.
188+By eliminating the SaaS aspect, Urbit solves many of the largest outstanding
189+issues with IoT in a single blow. Digital personal AI assistants have long been
190+an anticipated science fiction prediction and their full realization is on the
191+horizon. But in their current manifestation, many privacy- and
192+security-conscious people would never consider using them at all, since they are
193+inevitably presented as SaaS that requires intimate knowledge of your devices
194+and their stored data. Recommendation engines such as the one used by YouTube
195+offer helpful guidance towards content you'll find appealing, but they're also
196+designed to keep you hooked to the service. These kinds of programs can be
197+useful, but they're dystopian when they come saddled with anti-consumer
198+subroutines. Since your Urbit belongs to you, it can never act against your own
199+interests without your consent. In our lunar vision, your digital personal AI
200+assistant will live on one of your moons, rather than on megacorp's cloud.
201+
202+For web-exposed devices, Urbit offers the same security guarantees that it
203+offers for your personal computer: everything is end-to-end encrypted by
204+default, and signed with keys that one can easily verify as belonging to the
205+node sending the message.
206+
207+[Vint Cerf](https://en.wikipedia.org/wiki/Vint_Cerf) has outlined the case for a
208+system like Urbit ID for IoT use
209+[here](https://cacm.acm.org/magazines/2018/12/232883-self-authenticating-identifiers/fulltext).
210+In brief, that the Urbit ID system allows one to match public keys with devices,
211+bestowing devices with self-authenticating identities. This allows one to trust
212+the communications received from the device to whatever degree the private key
213+is held secure. IP addresses, GPS coordinates, MAC addresses, etc., are not
214+sufficient to generate high levels of trust—they're all temporary, easily
215+spoofed, or both.
216+
217+> One might imagine applying this to the Internet of Things (IOT) in which the
218+> IOT device self-generates a public- and private-key pair and registers the
219+> public key. For example, with a hub or controller so the hub can confirm it
220+> has reached the right IOT device. By the same token, configuration of the IOT
221+> device into an ensemble could include incorporation of the public key of the
222+> controller into a list of valid devices that can command or obtain data from
223+> the now-configured IOT device. Both ends can verify they are talking to the
224+> originally configured devices, assuming no device has lost its private key.
225+
226+Here, the hub or controller referred to would be your planet.
227+
228+Urbit has many other features that make it well-suited for IoT, above and beyond
229+eliminating the SaaS model and providing self-authenticating identities. Many of
230+these additional advantages derive from the fact that Urbit is a [solid state
231+interpreter](/docs/arvo/overview#solid-state-interpreter) and that
232+[Ames](/docs/glossary/ames) is a network of solid-state interpreters
233+equipped with cryptographic identity. We explore this in the next section.
234+
235+### Future lunar cosmotechnics
236+
237+![farm](https://media.urbit.org/site/posts/essays/farm.jpg)
238+
239+We now polish off the old crystal ball and imagine future uses of Martian lunar
240+technology. Particularly, how the tech may develop over time once it becomes
241+widely exposed to the evolution-inducing forces of industry and culture. This
242+section is pure speculation, and I only aim to offer a small glimpse of a
243+potential future, rather than an exhaustive one. This picture will necessarily
244+be biased by my personal proclivities and expertise, or lack thereof.
245+
246+Any discussion on the future of moons is incomplete without mentioning the
247+possibility of [lunar emancipation](https://urbit.org/faq/#more-planets) in
248+order to increase the number of planets. This fascinating topic sees regular
249+discussion in the Urbit Community group, but is outside the scope of this
250+article.
251+
252+In order to respect the reader's time, I'm narrowing our scope to a particular
253+topic: the agriculture industry. I'm also assuming a future with specialized and
254+increasingly small hardware to run Urbit. Right now, a 4 GB Raspberry Pi is the
255+standard for "small Urbit". If someday there are CPUs specifically designed for
256+running [Nock](/docs/glossary/nock), one could imagine going much smaller.
257+Ultimately, I'm going to assume that there will someday be [solid-state
258+interpreter](#ssi) microcontrollers - so the inclusion of Urbit on a device may
259+require nothing more than a couple [surface-mount
260+devices](https://en.wikipedia.org/wiki/Surface-mount_technology) on a larger
261+chip.
262+
263+Urbit is intended first and foremost as a personal computer. When I unravel its
264+potential usage in industry, I adopt the forecast of a drastic increase in the
265+manufacturing capacity for individuals and small groups. Agriculture is a great
266+microcosm of this long-standing trend; less human input is needed to produce the
267+same amount of food, whether it be crops or livestock. The modern era is
268+distinguished by the fact that small numbers of people can manage enormous farms
269+which produce food for vast populations. Thus, computation on modern automated
270+farms may be thought of as existing at the intersection of both personal and
271+industrial scale, and show how computerized and mechanized workflows add to the
272+amazing productivity of modern farms and demonstrate that individual-sized
273+inputs are able to create industrial-sized outputs. I predict that the set of
274+trades for which this dynamic holds will only increase over time.
275+
276+Agricultural automation has been a primary engine for the growth of
277+civilization, but it has been hampered by the downsides of IoT elaborated in the
278+previous section. One bellwether of this dynamic is the right to repair one's
279+own equipment. [John
280+Deere](https://www.thetruthaboutcars.com/2020/03/its-payback-time-right-to-repair-movement-targets-john-deere/)
281+has long been at the center of this controversy. Farmers have lost the ability
282+to repair their own equipment due to vendor locks and a dependency on remote
283+servers. Furthermore, any suite of sensor products designed to gather important
284+data such as genomics, hydrology, soil health, weather, etc., inevitably only
285+cooperate with other products by the same vendor. It's the same story all over
286+again—you are a client of a megacorp server. Or in Urbit terms, you have a bunch
287+of primitive moons belonging to different planets held by megacorps, and no
288+planet to call your own.
289+
290+Again, Urbit resolves these issues in the same fashion as above. One might argue
291+that using Urbit is another form of vendor lock-in—but this is evaluating Urbit
292+at the incorrect level. Since Urbit is an open source operating system, its
293+functionality may be extended and modified arbitrarily by any party. _Some_
294+computational infrastructure is necessary— that fact can never be escaped. But
295+you can escape from closed source software that does not permit you to modify,
296+to open source software that allows you to tinker at will. Thus we do not
297+consider open source software to be a form of lock-in, or at least, it's a much
298+milder form of lock-in compared to something like Apple's walled garden.
299+
300+So let us focus on the additional meritorious aspects of Urbit (or more
301+generally, solid state interpreter networks) that make it not merely a band-aid
302+to the broken IoT system but a permanent and sound replacement.
303+
304+#### Solid state interpreter networks {#ssi}
305+
306+![cubesats](https://media.urbit.org/site/posts/essays/cubesats.jpg)
307+
308+Urbit is the world's first solid-state interpreter (SSI). This concept is
309+summarized in the [white paper](https://media.urbit.org/whitepaper.pdf) as
310+follows:
311+
312+> Imagine it as a chip. Plug this chip into power and network; packets go in and
313+> out, sometimes changing its state. The chip never loses data and has no
314+> concept of a reboot; every packet is an ACID transaction.
315+
316+Also,
317+
318+> Briefly, an SSI is an interpreter which is also a database. In more depth, an
319+> SSI combines three properties: uniform persistence, source independent packet
320+> networking, and high-level determinism.
321+
322+We do not wish to segue into a lengthy examination of what this really means—
323+that's what the white paper is for—but we will attempt to explain why these
324+properties are of great benefit in an industrial IoT context such as
325+agriculture. We'd also like to predict that Urbit will not be the only SSI.
326+Other sorts of SSI's specialized to various tasks may one day roam the planet,
327+and these may be better suited for particular IoT tasks than
328+[Arvo](/docs/glossary/arvo). However, this article will be couched in terms
329+of SSIs communicating with an [Ames](/docs/glossary/ames)-like networking
330+protocol and Urbit ID-style cryptographic identity, rather than Urbit in
331+particular.
332+
333+For a SSI, losing power is less of a catastrophic event than it is for ordinary
334+computers with volatile memory. Knowing that you can never lose any state is a
335+powerful guarantee on the integrity of your data. Loss of power will always mean
336+loss of any data potentially collected while power is down, regardless of the
337+device you use, but with a SSI you at least have assurance that you will never
338+lose data that was collected before it could be transferred from the cache to
339+the disk. Of course, this is actually the sort of guarantee that [ACID
340+transactions](https://urbit.org/docs/arvo/overview/#acid-database) have—it is
341+just that this set of guarantees emerges naturally as a consequence when you
342+have a SSI. Put another way, every SSI is a database; having every device be a
343+database is a major boon in situations where enormous quantities of data are
344+being collected across a distributed network. The standard today is that data is
345+only collected at hubs, and any data that doesn't reach a hub is irretrievably
346+lost.
347+
348+SSIs are also deterministic at a high level. While all computers are
349+deterministic at the CPU level, interruptions to power can result in an
350+undefined semantic state and result in the random erasure of half of its brain.
351+This determinism is what begets ease of maintainability of Urbit—problems
352+generally only need to be solved once by experts and the solution propagates to
353+the rest of the network via [OTA updates](/docs/glossary/ota-updates). We
354+addressed this maintenance issue previously—we only remark now that this
355+property is derived from being a SSI, rather than something particular only to
356+Arvo or Urbit. When one has hundreds or thousands of devices to manage, the
357+guarantees on ease of maintenance provided by determinism are extraordinarily
358+convenient.
359+
360+Packet routing on SSI networks is source-independent, and in the context of an
361+Ames-like networking protocol, are always delivered exactly once and in a
362+precise order due to the fact that nodes on an Ames network are in a permanent
363+session. Source-independent means that the identity that originated a packet
364+does not need to be the one to deliver it—packets are _facts_, and the truth of
365+a fact does not depend on who you heard it from. This means that it is possible,
366+for instance, to send instructions to a moon before it even exists and be
367+guaranteed that that moon will receive them and perform the tasks given, even if
368+the device that originally sent the packets no longer exists. As long as
369+somebody has kept the packets on hand, they will eventually be delivered. So,
370+one could imagine transmitting directions to a crop harvesting robot into which
371+a moon will be installed before the robot has even been purchased, know that
372+once it is delivered it will automatically begin its task, and know that those
373+tasks will be completed in the correct order, without any accidental repeats.
374+Taken to the limit, one can imagine preplanning the automated tasks for an
375+entire farm before a single device is purchased, with powerful guarantees on the
376+integrity of those instructions no matter how much time elapses between sending
377+and receiving.
378+
379+#### P2P data markets
380+
381+![knots](https://media.urbit.org/site/posts/essays/knots.jpeg)
382+
383+As was mentioned above, today's IoT devices ferry all sorts of your personal
384+data to megacorp, where they package it and sell it to the highest bidder.
385+Though personal data in aggregate is quite valuable, the value of a single
386+individual's data is quite low. On the other hand, industrial scale data such as
387+that collected on digitized farms could be quite valuable. Here we briefly
388+examine how Urbit can be utilized to populate and facilitate a market for data.
389+
390+All data collected by your moons may be digitally signed by that moon,
391+certifying the exact origin of that data. This is one advantage of having
392+cryptographic identity baked into the core of the operating system and
393+networking protocol. One could imagine collecting large amounts of such data and
394+packaging it for exchange with other local and regional farmers. This can, of
395+course, already be done in principle with current systems. But current systems
396+do not automatically come equipped with the sort of provenance, immutability,
397+and reputation that comes for free when you make use of SSI networks.
398+Manipulated or faked data becomes easier to spot, and you'll know who it came
399+from, so supplying such data puts one's reputation at stake.
400+
401+One major issue facing conjoining data gathered from disparate sources is simply
402+how to do it. Data arriving in random order, from different software versions,
403+running different hardware, is all very difficult to bundle into a good
404+dataset - and indeed wrangling this sort of task forms a large part of the data
405+scientist profession. As devices in SSI networks utilizing an Ames-like protocol
406+are engaged in permanent sessions, leading to properties such as exactly-once
407+delivery and well-ordered message sequences, issues about the order in which
408+data arrives are dramatically simplified. I do not wish to get mathematical
409+here, but I personally have confidence that the emerging discipline of
410+[categorical informatics](http://math.mit.edu/~dspivak/informatics/), as well as
411+the relevance of [low-dimensional topology to data
412+fusion](https://arxiv.org/abs/1409.5505), resolves many of these issues. I
413+promise to explain this in more detail in the future. For now, it suffices to
414+say that SSI networks seem well-positioned to utilize these techniques.
415+
416+Cryptographic techniques such as [(composable) zero-knowledge
417+proofs](https://en.wikipedia.org/wiki/Zero-knowledge_proof), [secure multi-party
418+computation](https://en.wikipedia.org/wiki/Secure_multi-party_computation),
419+[ring signatures](https://en.wikipedia.org/wiki/Ring_signature), and even
420+[homomorphic encryption](https://en.wikipedia.org/wiki/Homomorphic_encryption)
421+offer a variety of ways in which data may be shared in an IoT context with
422+mathematical guarantees on what sort of privacy is maintained. This is perhaps
423+less relevant in the context of agricultural IoT, where personal private data is
424+largely absent, but we mention them here to invite further speculation from the
425+reader about the possibilities of IoT and SSI networks.
426+
427+We end our discussion with an adaptation of a scenario borrowed from my brief
428+time working on [Ceptr](http://ceptr.org/) that begins to show how a lunar
429+IoT-connected world evokes properties of a hypothetical ["global nervous
430+system"](https://en.wikipedia.org/wiki/Global_brain). This example is
431+purposefully mundane to illustrate how deficient our Earth systems are, and
432+while it is possible to accomplish in theory, it is impractical on a wide scale
433+due to the numerous problems with IoT. Imagine that you suffer headaches from
434+low atmospheric pressure. You'd like to know when a low-pressure front is an
435+hour away from you so that you can pre-emptively take aspirin to prevent the
436+headache. Your personal digital assistant, running on Urbit, can then
437+periodically query the moons of sensors in your region for weather data to
438+predict whether or not you will soon be passing through a low pressure front.
439+This could be a free service or paid for automatically with cryptocurrency
440+microtransactions. On Mars, this task will be trivial, and is merely a stone's
441+throw away from a vast and undiscovered universe of other possibilities unlocked
442+by SSI networks.
443+
444+
445+[^0]: Of course, all moon names have four words, not three. What the fourth word
446+ needs to be for only three words to display is a matter of Urbit lore that
447+ is more fun to discover yourself than have it told to you, so we won't spoil
448+ it here.
content/blog/landscape-a-portrait.mdnew file+85
@@ -0,0 +1,85 @@
1++++
2+title = "Landscape: A Portrait"
3+date = 2019-09-03
4+description = "On the latest Urbit user interface, and the interfaces to come."
5+aliases = ["/posts/essays/landscape-a-portrait/", "/posts/landscape-a-portrait"]
6+[extra]
7+author = "Matilde Park"
8+ship = "~haddef-sigwen"
9++++
10+
11+![](https://media.urbit.org/site/posts/essays/landscape-a-portrait-1.png)
12+
13+Alongside [the v0.8.0 launch](https://urbit.org/posts/2019-7-25-update/) we released the latest version of Landscape – Urbit's prototype user interface. Codenamed “Modulo,” it's our vision of an Urbit UI designed for everyday use. Most importantly, it’s the beginning of an interface that has access to the entire Arvo OS, rather than just one facet. Previous iterations of Landscape solely made use of the [Hall](https://urbit.org/docs/learn/arvo/hall/) messaging protocol.
14+
15+Served after installation on your ship’s HTTPS port, it allows you to interact with Arvo through a web interface built with [Indigo](https://github.com/urbit/indigo), our new UI design language. It has a home screen, which exposes ‘tiles’ for each Landscape application – each able to integrate and customise information from elsewhere in the system and from the broader internet – and connects them to full-screen, graphical applications.
16+
17+The first set of application includes Chat, a new, streamlined chat client, a basic Weather information tile, an analog clock, and Publish, a place for publishing, subscribing, and commenting on ‘notebooks’ – invite-oriented blogs hosted on your ship.
18+
19+![](https://media.urbit.org/site/posts/essays/landscape-a-portrait-2.png)
20+
21+![](https://media.urbit.org/site/posts/essays/landscape-a-portrait-3.png)
22+
23+Our unofficial mantra – “it’s not finished yet” – is performed yet again, but we're _close_. We can now talk with the broader community about both our inspirations, our visions for its future and our plan to enact that future.
24+
25+## Entering userspace
26+
27+Urbit has been in “research mode” for most of its history, but the system has now made extensive progress and our kernelspace engineers are the opinionated, confident veterans of the long war you’d expect from an operating system’s early history. The spoils of that war, after rewriting and refactoring all of the system's components several times over, are beginning to really speak for themselves.
28+
29+Urbit’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.
30+
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.
32+
33+That 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.
34+
35+Landscape, with this in mind, serves at the root endpoint (you know, at `/`). It pre-authenticates the user and provides an API to your ship for applications (and their tiles) to access and _poke_, _peer_ and _scry_ the ship with.
36+
37+![](https://media.urbit.org/site/posts/essays/landscape-a-portrait-4.png)
38+
39+Whereas, before, a ship had a web server that was good at serving text, but was more obscure for complex (or graphical) applications that made use of the Arvo OS and network, now a ship launches with a web-based interface that makes applications much simpler to experiment with and develop.
40+
41+If you want, you can just serve files at any endpoint with [a boilerplate](https://github.com/matildepark/urbit-static-page).
42+
43+What's more? Arvo access and Hoon logic are now, by default, inside their own application on the ship itself rather than served as inline code on the front-end. This allows for better separation of concerns and more complex and performant applications.
44+
45+(If you want to play around, there’s an [experimental tool](https://github.com/urbit/create-landscape-app) you can use to get a full-stack boilerplate running in about 40 seconds.)
46+
47+All of this is fantastic news; and while Landscape-oriented userspace development is now _possible_, it’s still not all the way to being an interface to _an operating system_. For that, we’ve started drawing up specifications and proposals.
48+
49+## Rethinking interfaces
50+
51+Among 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).)
52+
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_.
54+
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.
56+
57+So, while it’s not the same to simply _read_ these dialogues, it can get us pretty close.
58+
59+One reason this iteration of Landscape isn’t the last is because – we must emphasise – this is not the only interface Urbit will have. We aren’t creating a web platform. It should be possible to use _just_ the command-line, and ideally it should be possible to serve windowed interfaces from Arvo itself. It should be possible to SSH into _and_ SMS with your ship, should you want to.
60+
61+After all, we’re creating a decentralised platform of personal servers with an entirely new stack from the bytecode up. Most of the world’s computers descend from Unix, and Unix was based on [timesharing](https://en.wikipedia.org/wiki/Time-sharing) — multiple users in one computer, all pretending it was theirs. Everything since hasn’t left that mindset.
62+
63+So what do we think that new platform needs from its interface?
64+
65+- **Landscape, and all of Urbit’s future interfaces, need a standardised way to view and edit the filesystem.** We had circumnavigated this by mounting to Unix, but it’s now time to confront that issue.
66+
67+- **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.
68+
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.
70+
71+No more siloed input/output in applications on a ‘timeshared computer’ with your redundant data always belonging to someone else.
72+
73+## Into the future
74+
75+Right now, Landscape applications are still _monolithic_ and geared exclusively toward _single-person computing_. We hope to change that, and keep communication open with developers so it’s easy for their own development to keep pace with ours.
76+
77+It should be easy to share whatever data with your friends as you like; to permission files programmatically on a server that is permanently, irrevocably _yours_.
78+
79+It should also be easy to read, annotate and discuss a shared book with a specific set of friends; or only allow another set of people to see files in a specific directory if they meet specified requirements.
80+
81+We will backport these exploratory developments into Landscape as they continue and evolve. This, of course, includes kernel work, as we refactor [Gall](https://urbit.org/docs/learn/arvo/gall/), the userspace handler vane, and in the process, standardise streamlined practices for writing Hoon in user applications. Take, for example, the [async monad](https://groups.google.com/a/urbit.org/forum/#!topic/dev/DDG6gHSG1Lc), which allows you to avoid dealing with moves or handling each response in separate parts of the application. User applications and Hoon should be both laconic and accessible, and we’re reifying that.
82+
83+Most importantly, we’ll continue to iterate on how we onboard new developers. [Hoon School](https://urbit.org/hoonschool) continues to evolve; its first cohort is thriving and friendly. We have a dedicated cast of teachers and ongoing access to much of the Urbit team through this stream.
84+
85+If you’d like to join us here, you’ll discover a computer that you can learn and master from the bottom up. Right now, it is a labyrinth for the intrepid; but for the future, and forever, it is _mappable_. A landscape, after all, doesn’t show a single leaf, but the earth and the horizon ahead.
content/blog/magic.mdnew file+204
@@ -0,0 +1,204 @@
1++++
2+title = "Magic"
3+date = 2016-05-16
4+description = "A thought-experiment to explain the Urbit user experience."
5+aliases = ["/posts/essays/magic", "/posts/magic"]
6+[extra]
7+author = "Curtis Yarvin"
8+ship = "~sorreg-namtyv"
9+image = "https://storage.googleapis.com/media.urbit.org/site/posts/essays/magic.jpg"
10++++
11+
12+![](https://storage.googleapis.com/media.urbit.org/site/posts/essays/magic.jpg)
13+
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.
16+
17+It's also hard to understand the power of Urbit, because it's
18+still quite immature. Unless you understand it already, it's
19+just a weird OS that doesn't work all that well.
20+
21+And 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
24+and our solution are totally unclear.
25+
26+One 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?
30+
31+## Magic step one: total integration.
32+
33+Make a list of all the cloud apps which have your personal data.
34+OK, just imagine making a list. OK, use magic.
35+
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
39+your Facebook profile_.
40+
41+Your 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
48+Store -- it sells everything!
49+
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
52+you use to log in to Facebook.
53+
54+Does this sound creepy? Sure. It's incredibly creepy. But look
55+on the bright side: it's also incredibly convenient. (And
56+incredibly secure, at least with a 2-factor key.)
57+
58+For the first time ever, _all your data is in one place_. For
59+example, the engineers at Facebook, who are awesome, would never
60+leave 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.
63+
64+(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+and type `ls /photos/2016/May/` -- as if your digital life was a
67+chip in a box in your backpack, not redundant servers in multiple
68+secure data centers.)
69+
70+Imagine 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
74+furniture, your own books in your own bookcases...
75+
76+## Magic step two: free your data.
77+
78+The good news is, you get your own house. The bad news is, it's
79+in North Korea.
80+
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
83+creepy to be owned by one corporation, than nine corporations.
84+But it _feels_ creepier.
85+
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.
89+
90+Right now, the software behind your Facebook experience is a
91+million lines of Facebook goo. It solves your problems and shows
92+your 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+
95+Without changing the functionality of your Facebook experience,
96+Facebook 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
99+do care, everything changes.
100+
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
103+themselves automatically, but you are never locked in; you can
104+always switch agents and/or vendors without damaging your data.
105+
106+Don't like your email UI? Change it. Don't like to see ads?
107+You no longer see any ads -- why would someone use an agent that
108+showed them ads? Ick. Unless it's something ridiculously
109+specialized, an agent is either free software or costs $3.99.
110+
111+Two, agents _act as you_. Facebook is no longer the Panopticon.
112+It 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.
115+
116+When anyone can write an agent, only code can be law. Privacy is
117+no longer enforced by the informal decisions of Facebook product
118+managers. It must be enforced by formal security policies.
119+
120+This 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
123+service like this can't be broken up into personal agents; it
124+still requires a Big Data mainframe somewhere. But it's okay;
125+the agents can still talk to it.
126+
127+For the most part, Big Data (everyone's) has become little data
128+(yours). You no longer have a Facebook profile -- a fancy UI
129+backed 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+least, a virtual computer (which is much more reliable than any
132+one physical computer).
133+
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
136+you 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+has finite, free storage; the cloud has infinite, non-free
139+storage. You still want a warning when your server gets fat.
140+But at least it keeps working.
141+
142+## Magic step three: free your server.
143+
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
148+a great deal, for you and for Facebook.
149+
150+But you're still a slave, Neo. A Facebook server still isn't a
151+personal server. Monopolies suck.
152+
153+Magic works, so Facebook feels guilty. It goes all the way
154+toward freeing you, and ruins its own business.
155+
156+Now, 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
160+with your Internet service.
161+
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
164+don'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
167+have to choose between a secure platform with no network effect,
168+and a non-secure platform that everyone else uses.
169+
170+## Magic step four: free your name.
171+
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
176+server would be a giant bitcoin wallet.
177+
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.
180+It's so personal that if you destroy it, it's gone.
181+
182+Facebook doesn't even keep its power to create new servers. The
183+"real name" policy has done great things to control spam, because
184+spam always depends on disposable accounts. But it implies a
185+central authority.
186+
187+Instead, Facebook borrows an idea from bitcoin and just limits
188+the number of identities. If you need one, you have to buy one.
189+They don't cost that much; just enough to deter spammers.
190+
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
194+dissident, or anyone who wants to speak out and let the words
195+speak for themselves, might want a second anonymous identity.
196+But sock puppets remain evil -- two names for the same person
197+should not interact in the same place.)
198+
199+## Magic step five: call it Urbit.
200+
201+And, with magic, we've succeeded in turning Facebook into Urbit.
202+Technically, Urbit is pretty close to magic, but there is no way
203+it's going to happen this way. See the [roadmap](../roadmap) for how it
204+actually happens.
content/blog/metaphase.mdnew file+74
@@ -0,0 +1,74 @@
1++++
2+title = "Metaphase"
3+date = 2020-12-09
4+description = "On the upcoming and foregoing Landscape lifecycles, and other forms of mitosis across the Urbit project."
5+[extra]
6+author = "Matilde Park"
7+ship = "~haddef-sigwen"
8+image = "https://media.urbit.org/site/posts/essays/metaphase.jpg"
9++++
10+
11+<br>
12+
13+![mitosis](https://media.urbit.org/site/posts/essays/metaphase.jpg)
14+
15+<br>
16+
17+*Previous versions of this essay specified the stream deploy date as December 11, 2020; then December 18, 2020. This has been amended to the actual date of release, with our sincere apologies. For new readers, you can opt into the dev stream by running `|ota ~lomlyx-lopsem-nidsut-tomdun %kids` (you may have to resolve a merge conflict using `|merge %home ~lomlyx-lopsem-nidsut-tomdun %kids, =gem %take-that`). We will surface this option more broadly in a future settings overhaul.*
18+
19+A few weeks ago, the Landscape team — those of us building Tlon’s suite of userspace applications on top of Urbit— deployed our first over-the-air update for notifications. This is a big leap forward for us. Of course, getting notifications inside Landscape itself is a big deal, but getting a push notification on your phone, or an email digest based on activity inside Urbit is now just one step away, a weekend project for a hobby developer, not an indeterminate number of steps away.
20+
21+After release, we received some feedback from users on the behaviour and design of this feature; beyond the obvious kinks that come from an initial release, it seemed to some like a minimum viable affordance pitched as a fully designed feature. This “bottom-up” development approach was, to us, fairly straightforward; to some of our users, it seemed that we had closed the door on the feature without even beginning to expose all its possibilities.
22+
23+As I’ll describe, we haven’t just been iterating Landscape, but the way we develop Landscape, and the way we consider Landscape in relation to Arvo. Finally, we’ll discuss our upcoming two-stream release process: a “stable” release stream with updates every six weeks and a development stream, with ongoing changes continuously deployed on an opt-in basis.
24+
25+To someone coming to Landscape for the first time, it is starting to look mature; and it is indeed maturing quickly. After all, these mismatches in expectations are pangs calling out for growth. Landscape truly has *users*, not just explorers, who are developing the same expectations they have with the other tools they use: predictability, reliability, and iterative improvements, not just leaps forward. So to meet those expectations, we’ve been working on the prerequisite work for a mature release schedule, with two different release streams for users and explorers: a lifecycle, with the cells, interlinked, dividing into a coherent higher being.
26+
27+## Landscapers and lifecycles
28+
29+For most of 2020, the core Landscape team has comprised of Liam (`~hastuc-dibtux`), Logan (`~tacryt-socryp`), and myself (`~haddef-sigwen`). Others at Tlon have rotated on and off, and some community members (`~radbur-sivmus` comes to mind) have also contributed a lot, but the three of us handle the core decisions and the entire stack for Landscape, working with designers, infrastructure, and third-party developers.
30+
31+After OS1’s release in April 2020, Landscape’s back-end has changed quite a bit; the first rearchitecture we performed was in group-store, adding roles and simplifying quite a lot of the back-end logic at the same time.
32+
33+Around May of this year, Logan flagged that our code surface was too large and had too much boilerplate by writing a set of bespoke full-stack applications when just one flexible userspace database would do. Our designers also had a vision of our interfaces being “modes and genres of the same data” that fit this vision as well; and so since then, we’ve put our resources into migrating all of Landscape to use graph-store (more information available in [this developer call](https://www.youtube.com/watch?v=E4DFuAZQ32Y)).
34+
35+Obviously, developing userspace for distributed computing has some additional challenges that you don’t have to consider when writing software for a single server. Each ship interacting has to mutually coordinate the agents running and the events to be processed. If those fall out of synchronisation, the edge cases multiply.
36+
37+We traditionally tended toward solving those problems by writing the simplest possible incarnation of an application or a solution first, triaging out additional complications until they can be most prudently addressed — usually when they are just one step away.
38+
39+For most of its history, Landscape’s userspace suite had to be up-to-date on all ships to function at all, so multiple staging streams added quite a few complications. Since incompatible versions of applications on different ships would produce mutual fail states if they attempted to interact –and since each application had no sense of how to negotiate compatibility with older applications, each user had to keep up-to-date. Landscape was moving too fast, constantly reconfiguring (to give you a sense of this: we still refer to a month ago as “old”).
40+
41+Historically, Arvo and Landscape were also considered just one object; changes in Landscape would often require refining the layers underneath it as well. We often aimed to use our interface’s requirements to refine Arvo in turn. But as Landscape’s cells continued to split, as it became a proper client *for* Arvo rather than a subsection *of* Arvo, it required its own planning and execution cycle that only came to fruition around April of this year.
42+
43+The first thing we did was start recurring, six-week product backlogs with designers and engineers to occasionally reassess short-term priorities with a larger roadmap. Once we did that, we began working on opening our process to the public, migrating all tasks, priorities, and current decisions to a [product board](https://github.com/urbit/landscape). By doing this, community members could both suggest features *and* contribute features, with a centralised, transparent process for getting designer input and Tlon engineer priorities. This has also been a successful effort.
44+
45+By adjusting ourselves to a six week rhythm for execution, it’s clearly time to slow down our release schedule and dedicate design and QA time to each release.
46+
47+Since Arvo is still quite young, we can’t quite get to all the thornier aspects of instituting a lifecycle. For example, we can’t tackle agent version negotiation in full yet; and mark versioning is still not present. This means modifying the validators for our graph modules (that is, validating the graph structure of a notebook vs. a collection) presents a deployment challenge in a two-stream lifecycle.
48+
49+That said, our userspace infrastructure is maturing, so we could at least organise the APIs to those agents; and we could at least slow the development cycle on those agents in favour of the more flexible components of the stack. The front-end specific features, for example, can be deployed on different ships without side effects for other users.
50+
51+So now, before we could launch a stable stream, we had some things to do first:
52+
53+- **We wanted to provide assurance that the userspace suite is relatively stable.** All our remaining stores (invite-store, metadata-store, and contact-store) needed to be modernised to use the same libraries and utilities inside Arvo as newer userspace applications.
54+- **We wanted all our applications to be using graph-store.** If we were going to migrate the entire network to a new userspace model, we shouldn’t undermine the new release cycle process and make it more difficult to test and deploy to meet higher user expectations. We needed to migrate everything first.
55+- **We wanted to release the notification-store**. After the October 2020 groups release, Landscape simply wouldn’t be complete without it.
56+- Finally, **we wanted all of Landscape to use the [Indigo component library](https://github.com/urbit/indigo-react).** Landscape shipped with each application using its own build with handwritten, bespoke DOM components. Once we moved to a single-page application architecture in June 2020, we wanted the same guaranteed consistency for both back-end and front-end code.
57+
58+Most of these are now accomplished; the remaining tasks are awaiting some final tests and UX work. We’re aiming for a stable stream of Landscape to deploy by **January 5, 2021**.
59+
60+What does this mean? For everyday users, you can expect Landscape releases every six weeks; the slate of features and any breaking changes will be flagged well in advance for third-party developers; and you can expect a more thoroughly considered user experience with notes and copy for each new release.
61+
62+And for intrepid users, you can opt-in to a development stream and help us find and eliminate bugs before release to the wider public. This development stream is much like how we've been deploying Landscape up until now — but now it's optional.
63+
64+## Mitosis
65+
66+Describing our progress so candidly can feel strange — after all, it sounds so *early*. But to me, it’s exciting. It’s mitosis.
67+
68+Take another example. For all of Urbit’s history — all until now — Tlon was playing the role of both parents to the project when it was really just an embryonic corporate vehicle itself, fated to become twins. But in the past few months the burgeoning Urbit Foundation’s interim Director, Josh Lehman (`~wolref-podlex`), has begun to ramp up responsibility, taking increasing stewardship over urbit.org and giving it a physical voice, an Otherness, apart from Tlon’s own goals.
69+
70+Now, each day, we stray a little closer to these entities splitting apart, a step closer to the Urbit Foundation and the Tlon Corporation being completely different entities with completely different concerns.
71+
72+The same has occurred with Landscape. Previously Landscape was “*the* interface to Urbit,” the proof that there was more to the project than a Unix executable. And slowly to those of us at Tlon, it became obvious what it was destined to become: a flagship client for an entire network, a tree branch rooting a world beneath clearnet, the first cell by which other clients might be born. Mitosis can be clumsy to watch; it can be nauseating to experience; it can be difficult to make out what will arrive where.
73+
74+But this is, after all, how a body forms.
content/blog/pki-maze.mdnew file+74
@@ -0,0 +1,74 @@
1++++
2+title = "Designing a Permanent Personal Identity"
3+date = 2019-11-27
4+description = "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+[extra]
6+author = "Philip Monk"
7+ship = "~wicdev-wisryt"
8+image = "https://media.urbit.org/site/posts/essays/pki-maze.png"
9++++
10+
11+![](https://media.urbit.org/site/posts/essays/pki-maze.png)
12+
13+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.
14+
15+Existing PKIs include PGP-style ["web of trust"](https://en.wikipedia.org/wiki/Web_of_trust), [SSL certificates](https://en.wikipedia.org/wiki/Certificate_authority), [ZeroTier](https://www.zerotier.com/lf-announcement/), [Keybase](https://keybase.io/), [OpenID](https://openid.net/what-is-openid/), [Mozilla Persona](https://developer.mozilla.org/en-US/docs/Archive/Mozilla/Persona), and [Login with Google](https://developers.google.com/identity). These take unique approaches to the problem and have achieved some degree of success, but none provide globally consistent, permanent, and completely self-owned identities. Exhaustive exploration and categorization is unfortunately out of scope for this post, so we'll just describe Urbit's approach to achieving these properties in our PKI.
16+
17+In Urbit, a "name" is often called a "ship" or an "address" because we use the metadata in the PKI to make names routable. The total data is two 256-bit asymmetric keys, a cryptographic suite number (to allow changing crypto algorithms), the revision number of the key, and the name of a ship that will route for it. This sums to less than 128 bytes of data.
18+
19+Each PKI trades off various properties. We chose a tripartite system so that appropriate choices can be made for different use cases. Here, we explore the various properties we chose by following a series of binary choices -- the idea maze.
20+
21+There are two sorts of PKI: either you can change your keys or not. If you cannot, then your name is impermanent, for no one can keep a set of keys secure forever. Even if your opsec never fails, eventually your crypto algorithms may be compromised.
22+
23+However, if you sacrifice the ability to change your keys, you can have a very nice property: self-attesting keys. If your name is a hash of your public key information, then no other source of information is required to verify you are who you say you are. This is a useful property since it requires no coordination at all. Many things are impermanent, especially during development. It also provides a way to try out the network without obtaining a permanent address.
24+
25+This is our first stop in the idea maze. We call this sort of name a "comet". A comet's name is the 128-bit hash of its public keys.
26+
27+However, Urbit is yours and it's forever. You shouldn't have to change your name every time you change your keys. So, we go back and take the other choice: you must be able to change your keys.
28+
29+To change keys, you must sign a message with the old keys revoking them and supplying the new ones[^0]. The question is what happens if the old keys also sign a second set of new keys. This could happen if an attacker obtained your old keys after the fact. This is important because one of the reasons to be able to change your keys is to invalidate the old ones so that they have no power.
30+
31+We have two options again: the PKI may be globally consistent or not. To be globally consistent means that if you believe a name is bound to a set of keys, then nobody on the network will disagree.
32+
33+If you don't require global consistency, you may sign this message and send it to all your neighbors, and they pass it on, and hopefully it gets to most of the network quickly. However, if one of those ships receives two contradictory versions of this message, the only thing it can do is trust the first one it heard, which may be different than what someone else heard. Thus, this is pairwise consistent but globally inconsistent. This is essentially how the pre-blockchain Ames network worked, though key changes were not actually implemented. Because global consistency is a valuable property, we looked at other options.
34+
35+For a globally consistent PKI that allows you to revoke keys, you need to be able to distinguish between two cryptographically valid messages to determine which was signed first. The dual problem could be solved easily — you can prove a message is signed after another by including the signature of the first in the second. This is equivalent to reading out a newspaper headline to prove a message was recorded after a given day.
36+
37+However, the problem of proving one message was sent before any later ones inverts the problem. You can solve this with newspapers by placing the message in the text of the newspaper. However, while reading a newspaper requires no central party, writing one does. For a long time, this sort of message was always handled by a central party. SSL revocations are managed by a few central parties. When you buy property, it's not sufficient to have the previous owner sign the title — this must be entered into a central land registry. Otherwise, the owner may sell their property to multiple people and there would be no way to determine who is the new owner. With the land registry, all you need to do is ask the registry which sale happened first, and that's the one that counts.
38+
39+However, Urbit is yours and it's forever. Trusting central registries jeopardizes both. The keen reader will notice that the problem of determining which key rotation happened first is exactly the double-spend problem that Satoshi solved with his proof of work algorithm for Bitcoin. His first block famously includes a newspaper headline to prove he didn't mine the block before that date. In a beautiful duality, his own algorithm proves that he didn't mine it after that date.[^1]
40+
41+Some 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.
42+
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+
45+However, 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].
46+
47+This information is currently stored directly on the Ethereum 1.0 blockchain, but as is well understood in blockchain circles this approach will not scale beyond a certain point. Many chains are pursing designs that allow the users of the smart contracts to store locally the data associated with the contracts they care about and only commit hashes to the chain. We expect there to be several viable options for this by the time our scaling needs exceed what's provided by Ethereum 1.0. This will free us from the cost of hosting the PKI data on all Ethereum nodes, but the data must still be stored somewhere. Any service that could handle such a large amount of data would inherently centralize the network.
48+
49+However, 4 billion is not enough addresses for every device on the planet today, much less in a few decades. So, we apply our maxim of re-examining our choices at each level for each use case. Examining the idea maze above, we cannot use the blockchain option for everything since the data is too big. However, it's not actually necessary for each of your devices to have its own self-sovereign identity separate from your planet. So we choose the option of using a central registry: your own planet.
50+
51+We allocate 4 billion "moons" to each of those planets. A moon is a 64-bit address whose 32-bit suffix is its planet. Your planet can easily store the keys for its own moons, and anyone who needs to talk to your moons can ask you for the keys.
52+
53+This is the sense in which moons are true ships: they're permanent names and you own them completely, as long as you own the planet. However, they're not independent ships — their keys can always be revoked by their planet.
54+
55+To create a sane network, we require global consistency for all our names. There are three other properties; pick any two:
56+
57+- Comets are impermanent, self sovereign, and plentiful.
58+
59+- Planets are permanent, self sovereign, and not plentiful.
60+
61+- Moons are permanent, not self sovereign, and plentiful.
62+
63+Fancifully, 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]
64+
65+
66+[^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+
68+[^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+
70+[^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+
72+[^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.
content/blog/platform-decay.mdnew file+51
@@ -0,0 +1,51 @@
1++++
2+title = "Platform Decay, Decentralized Marketplaces, and Urbit"
3+date = 2020-05-08
4+description = "Urbit is calm computing. Calm commerce follows naturally. "
5+[extra]
6+author = "Nicholas Simmons"
7+ship = "~simfur-ritwed"
8+image ="https://media.urbit.org/site/posts/essays/platform-decay-preview.png"
9++++
10+
11+<br>
12+
13+<img class="ba" src="https://media.urbit.org/site/posts/essays/platform-decay.png">
14+
15+## Platform decay, decentralized marketplaces, and Urbit
16+
17+The current model followed by almost all social media services is one of easy and free participation in exchange for advertising and data collection. If you’re a fan of decentralized projects like Urbit, or just someone who pays attention to the ongoing debate over social media incentives, you’re likely to be familiar by now with a central critique of this model. There are historical reasons for why we ended up here: ad-serving and user-tracking technology outpaced subscription and micro-payment models because of recalcitrance by banks and regulatory hassles that prevented ‘real money’ from easily integrating into websites. Instead, we pay in eyeballs and analytical data.
18+
19+When we take a moment to think about possible alternatives, we usually fixate on that original bad bargain—’free’ in exchange for ads—before lamenting that first-mover advantage, critical masses of users, and sophisticated algorithms have made it very hard to see successful challenges to the reign of sites like Facebook and Twitter. We’d be happy to pay a few pennies to have an ad-free, data-secure alternative. But this critique misses something larger. There are, in fact, plenty of colossal Internet businesses that actually do charge people money to participate: e-commerce platforms. Some of these enable the sale of virtual goods and content (Steam, Patreon, Spotify), some physical goods (eBay, Etsy), and some both (Amazon, Kickstarter). Because these commercial platforms had to figure out how to make online payments easy and secure for mass audiences for their core business to work, they avoided the total dependency on ad revenue that social media sites have always had. Unfortunately, several factors have conspired to push e-commerce platforms closer and closer to a social media–style business model—by manipulating user behavior and prioritizing ad revenue and branding deals over providing a fair marketplace for ordinary buyers and sellers.
20+
21+E-commerce platforms, as generally perceived by the public, operate on a simple ‘deal’: users (small or large, individual or corporate) can buy and sell goods and services on the platform, facilitated by search engines and payment processors, and augmented by reputation systems and safeguards for buyers and sellers. In exchange, the platform takes a small cut of the revenue that passes through. E-commerce platforms were a key part of the genuinely revolutionary effects of ‘Web 2.0’. As software ate the world, it uncovered siloed value that had been previously inaccessible. This was particularly true for items with a high potential value, but a small market-base. Just as social connection technologies—from Usenet to Facebook—enabled people with niche interests to find each other, mass-platform e-commerce sites allowed buyers and sellers of niche goods—physical or virtual—to find each other and transact, thus granting those goods actual value, and their owners revenue.
22+
23+The ‘deal’ that eBay, Amazon, and the others made with millions of buyers and sellers was a great business proposition for over twenty years. They could take advantage of centuries worth of asymmetrically siloed value, now searchable worldwide, and take a ~10% cut. Their moat was in sophisticated search algorithms, network effects, and, as time went on, finding ways to make online payments as easy and secure as possible—the road not taken by early social media companies like Myspace that decided in favor of reliance on ad revenues. Crowdfunding sites like GoFundMe and Kickstarter reduced friction in online fundraising in exchange for a cut. Patreon applied a similar approach to regular support of individual content creators; Spotify, Soundcloud, and Pandora made it easier to legally stream music. All took advantage of the same ability to extract value from widely distributed niche products. All offered their vendor-users a version of the same deal: facilitation of niche broadcasting in exchange for a visibility and transaction fee.
24+
25+The problem is that the deal is now decaying rapidly, without any prospect of recovery. The behavior of every mature e-commerce vendor platform clearly shows an accelerating trend towards exploiting user data, serving ads, pushing exploitative auxiliary services like high-interest loans, and taking advantage of vendor lock-in and near monopolies on customer attention to warp marketplaces for the benefit of large brands. In other words, they’re all double-dipping.
26+
27+Clicking through normal transactions on PayPal, for example, invariably produces ads for subprime credit cards; similarly, Patreon users can now borrow against their (expected) future earnings. Spotify has reinvented pay-to-play for artists and labels; eBay has leaned hard on promoted listings, with extra fees, in order for vendor offerings to show up in search results. Amazon has increasingly ‘gated’ third-party offerings in categories and brands in which not only their own ‘store brand’ products, but those of large brands with which they have struck external deals, compete. A growing number of consumer products have essentially been prevented from being resold on Amazon or eBay by the threat of spurious, but expensive, anti-counterfeiting lawsuits by major brands, thus buoying new sales by effectively eliminating resale value.
28+
29+There are several key reasons for this. One is simply that as the initial burst of siloed value being accessed, revalued, and bought and sold subsides, the number of transactions plateaus and e-commerce platform revenue with it. The traditional model of venture capital funding for platform businesses, however, demands an exponential growth in profits; the exploitation of customers and vendors becomes irresistible in order to maintain these profit trajectories. Another reason is that as e-commerce platforms accrued large userbases of both buyers and sellers, they began to act like other online platform businesses—distorting marketplaces and shaping user behavior to maximize retention and profit, rather than offering a straightforward service.
30+
31+Platforms exploit user data because they can. Their ownership of your data is baked into the client–server architecture on which their businesses run, and the system cannot correct itself. Chris Dixon, in his prescient [essay](https://onezero.medium.com/why-decentralization-matters-5e3f79f7638e) about the future of decentralized commercial protocols, presents an S-curve whereby a platform business transitions between serving its users in order to grow and achieve market dominance, and eventually exploiting those users once it has achieved that dominance. In particular, early-stage e-commerce platforms do anything they can to benefit vendors willing to sell on their platform. Vendor presence is vital to attracting customers, but once those customers have been captured, the vendors become the [competition](https://www.wsj.com/articles/amazon-scooped-up-data-from-its-own-sellers-to-launch-competing-products-11587650015?mod=searchresults&page=1&pos=1). Customer eyeballs and dollars are a finite resource, and platforms carefully calculate the potential profit to be made from showing customers one product or another. The lack of platform-agnostic reputation systems also aids vendor capture by platforms. Rather than optimize for a system in which any buyer or seller with good external credibility (measured by, for example, credit scores or relevant business licenses) can use their platforms as a commercial intermediary, eBay and Amazon use seniority and internal transaction records to determine vendor permissions. Since sui generis internal reputation scores can’t be taken to other platforms, these policies create a sunk cost of effort and reputation which traps vendors within specific marketplaces, without an easy exit.
32+
33+Market consolidation and bureaucratic pressures for legibility also work against maintaining a square deal with vendors and users. The midpoint on Dixon’s S-curve, when exploitation of vendors begins to occur, can also be seen as the point where a customer base is solid enough to be marketed to advertisers and major brands who can pay for favorable search placement. Such large, legible deals are easier to negotiate, easier for individual executives to take credit for, and are useful in meeting arbitrary investor benchmarks and buoying quarterly revenue statistics; but they privilege larger brands with larger ad budgets over ordinary sellers in a niche. Another major downside of large, centralized e-commerce platforms is that, like any large bureaucracy, they have PR and regulatory concerns that provide an attack surface for regulators, activists, litigious brands, and monopolists seeking to crush competition—almost invariably at the expense of vendors and customers.
34+
35+Even more subtle and worrying effects come when e-commerce platforms realize that the actual products being shown do not have equal chances of being purchased, therefore delivering revenue to the platform itself. This applies even when the products being compared have nothing in common: apples to oranges; cat food to hiking boots. Accuracy of internal search engine results, and a comprehensive spread of offerings, are regularly sacrificed to the aim of placing a ‘sticky,’ lowest-common-denominator product in front of the customer. I recently ordered vegetable seeds on Amazon; after a few searches for different kinds of seeds, I started having to wade through ‘premium placement’ ads for farmer-themed romance novels before I could view, and choose from, the actual seeds on offer. This deprecation of niche products is ongoing and makes the interface of such platforms less and less navigable. It’s also worth mentioning that, frequently, such deprecation has very little to do with durable consumer interest or a free-market determination of product value. Rather, they come from a ‘thumb on the scale’ of large advertising campaigns that seek to convert a wide range of consumer curiosity into sales for a particular product at a particular time.
36+
37+The 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.
38+
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+
41+There’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.
42+
43+The implications are obvious: if we can’t make markets obey a representation of factual reality, we won’t be able to build stuff we need in the factual world. The damage which has been done by our replacement of infrastructural capacity with nebulous thematic concerns that happen to feed our dopamine receptors is becoming rapidly apparent to anyone paying attention. If our search results for ‘hammer’ algorithmically default to pro wrestling merchandise, that changes our real, physical lives. Our ability to go out and build things with a hammer is diminished, and so is, implicitly, the importance placed on that act of building by the culture that surrounds us. The physical world of technology, no less than the informational, is a slippery pile of patches and detours. When JPL scientists reestablished contact with an early satellite after decades of inactivity, they relied on vintage computer parts from eBay to communicate with it. In some areas (cars, hand tools, some analog electronics) the present consumer offerings have generally declined, in terms of reliability and user serviceability, from a zenith some twenty or forty years ago. Forty-year-old Toyota trucks often fetch more, in equivalent value, than they did when new, because regulations and planned obsolescence have prevented the ongoing production of trucks that meet the same standards of reliability and fuel economy. The failings of our just-in-time supply chain have likewise been made blatantly obvious by the disruptions of COVID-19. Both argue in the strongest terms against allowing consumer-facing e-commerce to be captured by what are rapidly becoming payola-driven entertainment platforms rather than marketplaces for essential goods, whether car parts, beef jerky, or N95 masks.
44+
45+So what’s the solution? Many prescient observers envision decentralized protocols to safeguard the data of vendors and buyers, and algorithmic representation of their offerings. Any new ‘deal’ between vendors, buyers, and platforms must be rooted in data ownership and neutral code if it is to avoid a repeat of the current paradigm. Personal ownership of browsing, buying, and selling data is necessary so that search results and boosted listings aren’t distorted for each customer in order to ‘nudge’ them into consumptive patterns, and so that value is retained in useful, niche items which don’t lend themselves to dopamine addiction and manipulative marketing campaigns. The hope is that widespread personal control of data would lead to the emergence of protocols and marketplaces which have realistic economic models based on fees; the ‘square deal’ originally promised by ‘Web 2.0’ platforms. Such marketplace businesses wouldn’t be exponential unicorns; they’d be steady, stable infrastructure companies like those that built the foundational technologies of the 20th century and made a secure, middle-class lifestyle possible for millions of people. Data ownership wouldn’t prevent platforms from incorporating advertising, but it would shift the balance of power to an opt-in basis. By reducing the ability to target such ads, it would prevent the lopsided reliance on ad revenue which leads to smaller vendors being neglected. Big companies wouldn’t go away; they’d make their margins by focusing on economies of scale in the real world: logistics, fulfillment, and redundant inventory for commodity goods.
46+
47+We need decentralized, robust reputation systems to combat monopolistic platform lock-in and its attendant abuses, but also so that smaller, more private marketplaces can create their own rules, and still be functional and secure. Right now, reputation data is siloed by the same companies that built large marketplace platforms, which means that anyone who moves outside of their walls loses access to it, and thus loses protection from bad actors. The ability of users to run their own reputation scans, or to pay for a separate layer of reputation data which is marketplace-agnostic, is essential to breaking the hold that large marketplaces currently have on e-commerce. If a local community wanted to trade in homegrown food, for example, they could restrict access, while also making sure that their members didn’t have a previous, external track record of fraud in other markets.
48+
49+Where does Urbit fit into this? We think that the basic infrastructure and alignment of the Urbit system has two major advantages to offer those who will build these new protocols. The first is the simplicity of running one’s personal server of data and locally hosted processes. Any attempt to reimagine privacy-focused e-commerce under current client–server models quickly runs into complexity problems—Web 2.0 platforms require reams of legacy code and armies of SREs to keep them running. The second is the ability to maintain a semi-private but reliable digital identity among different platforms and communities, including commercial ones. Most current conceptions of autonomous marketplaces rightly focus on the potential of cryptocurrency as a decentralized payment system. But wallet and exchange problems, the work-in-progress state of micropayment infrastructure, and price fluctuations among different currencies (crypto or fiat) clearly show the need for a decentralized reputation system which is not simply a crypto wallet address, but is likewise more secure than a PHP forum profile. We think that Urbit ID can provide such a holistic, yet pseudonymous, reputation system without being tied to a particular currency, wallet, or commerce platform.
50+
51+Right now, Urbit is a communication system for communities and individuals. We aim to create spaces where human conversations can take place with a minimum of distractions. We believe that commerce, too, is best achieved in such a space; think of your local hardware store rather than a carnival with barkers at every turn. We also see this as a priority deeply in keeping with the underlying ethos of Urbit. We frequently speak of Urbit as a tool, and reference classic principles of tool design when considering how to expand it. The test of any tool is in its ability to shape the world; if that function isn’t well matched to both the actual world, and the hands and desires of those who will wield it, usability will suffer. Open marketplaces should function as magnifying glasses, to hand buyers and sellers a tool to see the shape of supply and demand, rather than distorting the actual terrain of the marketplace in order to create its own desires. Soon we’ll have BTC integration tied to Urbit ID, and independent security audits of the Urbit system. We want Urbit to become the foundation on which users can build simple, decentralized protocols that enable us to safely and easily buy and sell goods and content that we actually want and need. Urbit is calm computing. Calm commerce follows naturally.
content/blog/precepts-discussion.mdnew file+768
@@ -0,0 +1,768 @@
1++++
2+title = "Precepts: Discussion"
3+date = 2020-03-18
4+description = "The precepts aren’t arguments. We discuss and justify them here."
5+[extra]
6+author = "Philip Monk"
7+ship = "~wicdev-wisryt"
8+image ="https://media.urbit.org/site/posts/essays/discuss-01.jpg"
9++++
10+
11+<br>
12+
13+<img class="ba" src="https://media.urbit.org/site/posts/essays/discuss-01.jpg">
14+
15+The precepts aren’t arguments. We will discuss and justify them here. We don't expect to convince you this is exactly the right set of precepts, but we hope to convince you that this is a coherent set of precepts that might lead to something very interesting.
16+
17+We will address these in the same categories presented above:
18+
19+- A: General Design. Principles of engineering that apply in a great
20+ many situations. Any piece of code will exhibit at least a few of
21+ these.
22+
23+- B: Specific Design. principles of engineering that apply in a few
24+ specific situations. What these lack in general applicability they
25+ make up in specific guidance.
26+
27+- C: Attitude. Good code is the result of people approaching the act of
28+ engineering with the right attitude.
29+
30+- D: Theory. The eternal tension between theory and practice must not
31+ simply be acknowledged but dealt with.
32+
33+- E: Text Style. Code form matters.
34+
35+- F: Real Software. Not all software matters. Any software which
36+ wouldn't exist on Mars isn't real.
37+
38+<br>
39+
40+<img class="ba" src="https://media.urbit.org/site/posts/essays/discuss-02.jpg">
41+
42+### A: General Design
43+
44+These are principles of engineering that apply in a great many
45+situations. Any significant piece of code will exhibit at least a few
46+of these.
47+
48+### Simplicity
49+
50+> A20: One hundred lines of simplicity is better than twenty lines of
51+> complexity.
52+
53+> A21: Prefer mechanical simplicity to mathematical simplicity.
54+
55+At Urbit's root is a strong opinion on what constitutes simplicity. We take a semi-subjective view of simplicity. Specifically, we say that the sort of simplicity that matters is the sort that makes it easy to reason about stuff. We call this "mechanical simplicity".
56+
57+A competing view of simplicity says that it can be measured objectively by metrics such as the number of moving parts, the number of kinds of moving parts, the orthogonality of concepts, or cyclomatic complexity. We believe these are important metrics because they are good approximations of mechanical simplicity, but they don't tell the whole story.
58+
59+In acoustics, we use decibels of sound pressure to measure objective volume of sound. However, the Fletcher-Munson curves (equal-loudness contours) describe how loud sounds are perceived to be relative to their frequency. For example, a 75 dB sound at 4kHz sounds equally loud to a 90 dB sound at 10 kHz, even though the latter is over 20 times the sound pressure.
60+
61+Similarly, some sorts of complexity are much easier for humans to deal with than others. For example, humans are much better at learning languages compared to even simple mathematics. Even those who are "good at math" are objectively much better at languages, in terms of how much complexity they can absorb. Humans are also built to understand some
62+social dynamics and structures, even very complex and nuanced ones, without even consciously knowing the rules to them.
63+
64+Some examples of things that are objectively quite simple but subjectively hard for people to learn:
65+
66+- Pointers. Once you've properly learned them, it becomes hard to
67+ sympathize with your past self that found them difficult, but in
68+ practice these are a stumbling block for many people. Some think
69+ they're a "weed-out" concept, meaning they're just a good litmus test
70+ to see if you're the type of person who can learn how to program.
71+ Even if that's the case, it's still meaningful that they're effective
72+ in that.
73+
74+- Recursion. Same as above. Notably, `while` loops do not evoke the
75+ same reactions in people.
76+
77+- Monads. A little more complicated than the above, but objectively not
78+ that complicated. Certainly much less complicated than the C++
79+ standard library, but for some reason many people fail to learn monads
80+ after giving it an honest attempt, while that's rarely the case for
81+ the C++ standard library.
82+
83+- Math in general. The ideas in mathematics are generally pretty clean
84+ and small, which is why once you've learned a concept, it seems
85+ obvious in retrospect. The C++ standard library doesn't look much
86+ more obvious in retrospect than it does on first glance.
87+
88+- 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+ obviously better!". People say that often about Lisp, Haskell,
91+ Prolog, and Smalltalk. Nobody ever said that about C, Java,
92+ Javascript, or Python. And yet, which ones are easier to learn?
93+ Which ones are used in real life?
94+
95+I've emphasized learning here, but the same principles apply to using a
96+tool after you've learned it.
97+
98+When evaluating simplicity, presumption should be on the side of "what
99+everybody does when they have a choice" instead of "what's
100+mathematically simpler". Being mathematically simple is a point in your
101+favor, but the burden of proof still falls on you to argue that it will
102+be simpler to learn and use.
103+
104+Adherence to this precept is difficult because you have to decide
105+whether an objectively simpler construction is in fact better. This
106+gives a framework for deciding the question.
107+
108+> A19: Dualities must be faced head-on and analyzed differently at
109+> different layers.
110+
111+A crucial point is that the question of simplicity depends on the facts
112+and circumstances of the case. In deeper layers of the system,
113+mathematical simplicity tends to pay greater dividends. If the features
114+of the base layer are not orthogonal, the interactions between them will
115+only grow more complex as you rise in the stack. If the base layer has
116+many moving parts, the number of moving parts can only increase as you
117+rise in the stack.
118+
119+This isn't the only duality that depends on the layer of the stack.
120+The most important layering of the stack is between "systems" and
121+"applications", where "applications" are those pieces of code on which
122+no other application depends. Many answers that are correct in system
123+code are incorrect in application code, and vice versa. These precepts
124+are an attempt to describe principles that apply at all areas of code,
125+but they're much more important to follow in system code.
126+
127+> A22: The Law of Leaky Abstractions is a lie; abstract airtightly.
128+
129+The Law of Leaky Abstractions says that all non-trivial abstractions are
130+leaky. This is the sort of statement that most engineers will accept
131+immediately and most mathematicians would dismiss out-of-hand. In
132+mathematics, if an abstraction leaks, it's not simply an imperfect
133+abstraction, it's completely wrong and should be thrown away. So they
134+manage to create perfect abstractions. They don't always abstract what
135+you wanted to abstract, but at least they're perfect.
136+
137+If mathematicians can do that, there's no reason programmers shouldn't
138+be able to do it as well. Sure, programmers have to deal with some
139+performance considerations that mathematicians can elide, but that's
140+rarely the reason abstractions leak. They leak most often because the
141+creators are lazy or sloppy. If your abstraction leaks, find a way to
142+either plug the leak or reframe the abstraction to incorporate the
143+"leak" in a coherent way. It's not a leak if it's part of the spec. I
144+call this "turning leaks into decorative fountains".
145+
146+### Conceptual clarity
147+
148+> A6: Represent your data as closely as possible to the essential
149+> structure of the problem.
150+
151+There are times when you need to represent your data in an unnatural
152+format for performance reasons, but this is rare. When possible, keep
153+the structure and location of your data in as natural of a manner as
154+possible. For example, if a function can produce an integer or an
155+error, don't produce a negative number to indicate an error — use an
156+explicit tagged union.
157+
158+An important part of this is to fit your data types to your data
159+skin-tightly. If your data types permit states that you intend to be
160+impossible, this is suboptimal. There are degrees of this (if you need
161+a number between 0 and 1000, a uint32 is probably fine even though it's
162+suboptimal), but it's important to strive for it.
163+
164+As an example, if your program can't respond to requests until it
165+completes an initialization process to fill in some of its state, it's
166+tempting to make nullable all the parts of its state that are filled in
167+during the initialization process, then just check whether they're
168+nullable when you use them. This creates a complex set of representable
169+states of partial initialization, and any bugs in that area will be
170+difficult to track down. A better option is to create a "larval" stage
171+of your program that performs the initialization. If requests come in
172+during this larval stage, queue them up until it's done. When it finishes
173+initialization, it metamorphizes into the full program, where all the
174+fields in its state are not nullable. Then run through its queue of
175+pending requests. This more closely resembles the essential structure
176+of the problem.
177+
178+> A8: When mating different paradigms, build one cleanly on top of the
179+> other.
180+>
181+> A9: Never misuse an abstraction.
182+
183+An abstraction provides a set of tools to solve a problem. Use them in
184+the intended way. If this is awkward, consider that this may be the
185+wrong abstraction to use. If the impedance mismatch is large between the
186+paradigm that your program uses and the paradigm that you're mating it
187+with, consider building an explicit layer whose sole purpose is to
188+convert between the paradigms (see B5).
189+
190+### Correctness
191+
192+> A10: Correctness is more important than performance.
193+>
194+> A12: Correctness is more important than optimality.
195+
196+Sometimes you devise a solution which is fast but slightly incorrect.
197+This is rarely a good idea. Especially at lower layers of the system,
198+incorrectness expands as it bubbles up.
199+
200+Other times, you devise a solution which is correct, but you could
201+probably make it cheaper without sacrificing correctness. Sometimes
202+that's worth doing, other times it's not.
203+
204+Finally, in some cases you find a solution that's "optimal"
205+performance-wise or simplicity-wise, but it doesn't quite handle every
206+situation correctly. Maybe in the real world there are genuine
207+exceptions, and the code is much faster or simpler if you don't handle
208+those exceptions. In these cases, it's more important to handle every
209+case correctly than to "snap" to the nearest elegant formulation.
210+
211+> A11: Be simple and uncompromising in defining what's correct; go crazy
212+> with optimizations.
213+
214+Nock is a great example of this. It contains the character of the
215+virtual machine, but its asymptotics are bad. Add jets to fix the
216+asymptotics.
217+
218+Another example is the ACID nature of Arvo. Arvo is a pure
219+function f(logs) of its event log, so formally Arvo is just a
220+function run against an event log. A naive implementation has
221+very bad asymptotics; processing each new event is O(n) in the
222+number of historical events. Choose the function g(state,log)
223+such that f(logs ++ log) = g(f(logs),log). Then, as long as you
224+keep the state in memory, processing each new event is constant in
225+the number of previous events. This still requires O(n) restart
226+from disk, but you can also periodically (and non-blockingly)
227+write a checkpoint of the state to disk, so that restart from disk
228+is only linear in the number of events since the last checkpoint.
229+
230+This pretty much says it all. Define what's correct in as simple of
231+terms as possible — this will make it easier to implement and reason
232+about. Then don't compromise on it.
233+
234+> A13: If you don't completely understand your code and the semantics of
235+> all the code it depends on, your code is wrong.
236+
237+It's impossible to build correct code on a foundation that you're unsure
238+of. This is different than the problem of building something with
239+strong guarantees on top of something with weak guarantees — for
240+example, delivery guarantees on top of an unreliable transport protocol.
241+In that case, you are sure of the underlying system, it's just that what
242+you'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+will eventually get your packets through if you keep sending them
245+forever. And that's something you can build on.
246+
247+This is another reason it's important to have simple and accurate
248+correctness claims. When somebody else relies on your code, they
249+will need to know what exactly you claim to provide. If you're
250+accurate, then they don't have to understand your code, only your
251+guarantees.
252+
253+> A14: Deterministic beats heuristic.
254+
255+Heuristics make it hard to give precise safety guarantees, so you should
256+only use them when you don't guarantee much.
257+
258+> A17: Referential transparency is honesty and stability.
259+
260+A claim of referential transparency is a very strong guarantee, so it's
261+very useful for any code built on top of it. That code doesn't need to
262+know anything about how you produce the value because it can't
263+negatively affect the rest of the system, and it's free to cache
264+indefinitely.
265+
266+> A18: Responsibilities should be clearly separated.
267+
268+A program should be responsible for its own guarantees, though it must
269+rely on other programs to maintain their guarantees. You should avoid
270+guarantees that unduly couple separate programs. Any guarantee that
271+references state in more than one program is suspect.
272+
273+### State management
274+
275+> A1: Data is better than code
276+>
277+> A15: Stateless is better than stateful.
278+>
279+> A16: Explicit state is better than implicit state.
280+
281+Data is better than code, but code is better than state. If you must have state, state that is data is better than state that is code.
282+
283+There are many reasons for this. The most basic one is that humans are better at dealing with nouns than verbs. This is true to such an extent that we subconsciously convert statements of the form "so-and-so does such-and-such" to "so-and-so is a such-and-such-er". It's more challenging to view someone as a composition of their internal motivations such that they'll act in a particular way. It's much easier to see them as simply "friend" or "enemy" or "socialist" or "evil capitalist".
284+
285+Socially, the verb -> noun simplification is often problematic because it doesn't communicate the whole picture as accurately. It's an approximation that fails to capture important nuances. And that's because any nontrivial verb can't be understood in terms of a simple noun.
286+
287+However, the practical implications of this insight are different in code. Socially, people are who they are, so the best we can do is learn to understand them better. In code, though, we have a
288+powerful tool: convert the verbs to actual nouns. We can take advantage of our innate ability to reason about nouns and use that to make code that can more easily be reasoned about.
289+
290+Another way of looking at this is that data is easy to reason about. Code is hard to reason about, because it's much larger. Function types are known as "exponential types" because the number of possible functions between sets of size `m` and `n` is `n^m`. If there's global state of size `s`, this is even worse: `n^(m*s)`. The halting problem says that it's impossible in general to even determine if a piece of code will finish without running it.
291+
292+A final way of seeing this is that it's easier to reason about things that don't change. Data doesn't change, so it's a stable foundation. Pure code changes based on its arguments. Impure code changes based on its arguments and state. Impure code that uses code stored in its state
293+nests this whole complexity within itself.
294+
295+You can't, in general, update code in any way other than replacing it wholesale. This is not true of data, where to upgrade you just need a function from the old data type to the new data type.
296+
297+Sending code over the wire is problematic, because it's either very large or depends directly on what the other person has on their local ship. If you depend on what's on their ship and you're wrong, you may get the wrong result. So you explicitly require certain dependencies, at certain versions, ... this way lies dependency hell. There are ways to tame this, but if you just used data in the first place, those problems wouldn't exist.
298+
299+Of course, we can't always use data, precisely because it's smaller than code. And there are occasionally times when we could use either, but the code is actually easier to reason about than the data. All else equal, data > code > state of data > state of code.
300+
301+A note on laziness: lazily defined data occupies a middle ground. It's harder to reason about than strict data, but you get a lot more guarantees with it. It's probably not worth using as your basic substrate, but it makes some things easy to reason about.
302+
303+### CQRS/pubsub
304+
305+> A2: Everything should be CQRS.
306+>
307+> A3: (Almost) Everything should be pubsub.
308+>
309+> A4: A subscriber shouldn't affect a publisher.
310+>
311+> A5: Communication between nodes should be communication between
312+> independent actors.
313+
314+Fred Brooks pointed out that when you add people to an organization with `n` people, the number of interpersonal connections goes up with `n^2`. This is true of binary interpersonal connections, but if you allow groups of any subset of the people, then the number of total groups goes up with `2^n`.
315+
316+The same is true of entities in a program. A program must speak to many other programs about many things. Occasionally it can treat all others the same, so that the number of things it needs to say is constant in `n`. Sometimes it needs to say something different to each person, making it linear in `n`. Other times, it has a set of things it can speak about, say `m`. Pubsub lets the complexity grow with `m` instead of `n`. This lets the total communications grow with `m * n` instead of `n^2`.
317+
318+It's generally good to have more structure in how you communicate with other entities. If all you have is `send-message`, then you force each entity to define their norms around when messages are to be sent, and how to associate one message with another (eg a request to a response). This also gives the underlying system no visibility into the conversations.
319+
320+In CQRS+pubsub, we get a number of useful guarantees to help us structure our conversations. We know that a command will have no response other than exactly one positive or negative acknowledgment. We know that to request any data, we must have an active subscription, and
321+we know that a subscription may be canceled at any time. We know that a subscriber's failure to process a subscription update can't break the publisher. We know that after the initial subscription update, any subscriber to a path will get the same updates as anyone else on that
322+path.
323+
324+The underlying system can keep track of subscriptions, and can even cancel them automatically in certain circumstances (eg if the subscriber is on another ship and has stopped responding). This is like the nouns and verbs discussion above. Subscriptions are nouns, so we can reason about them better, and so can the underlying system. "Send a message" is a verb, so we have few guarantees about it.
325+
326+From Dijkstra's "Go To Statement Considered Harmful", which may as well have been written about unstructured event passing:
327+
328+> My second remark is that our intellectual powers are rather geared to
329+> master static relations and that our powers to visualize processes
330+> evolving in time are relatively poorly developed. For that reason we
331+> should do (as wise programmers aware of our limitations) our utmost to
332+> shorten the conceptual gap between the static program and the dynamic
333+> process, to make the correspondence between the program (spread out in
334+> text space) and the process (spread out in time) as trivial as
335+> possible.
336+
337+In our case, we make the programs of both the publisher and subscriber simpler by writing in terms of well-known constructs like "subscribe" and "push subscription update". You need to know much less about your counterparty.
338+
339+> A7: A client's representation of data should be as close as possible
340+> to that of the server.
341+
342+This is a natural architecture given pubsub, but it's also worth pursuing in its own right. This blurs the distinction between client and server, which makes the client more full-featured.
343+
344+It reduces communication to syncing, which means offline-mode is just a special case of sync latency, and all the local features are still usable.
345+
346+It also tends to reduce centralization, since you're already used to operating on your own, and you have all the data required to do so. The "server" becomes a commodity, easily moved when desired. Git is a good example of this — central git servers are common, but they're also a commodity, so you're never locked into a particular hosting provider. This is possible because the data structures are exactly the same on the client as on the server.
347+
348+> A23: Some cliches are repeated because they are true; others must be
349+> repeated because they are not.
350+
351+Computer security is an industry built on cliches. An example of the first is "your security is only as strong as your weakest link."
352+
353+An example of the second is "security through obscurity is ineffective". Security through obscurity is in fact the most effective form of security — if nobody cares about you, you will never be hacked. The problem is that you must remain obscure for it to work, and that's hard to explain to people in a precise way. It's effective at protecting precisely when there is nothing worth protecting. So, it's better (for them, their companies, and their users) to tell them a lie.
354+
355+However, it's important for whoever's coming up with the cliches to understand the specifics of how they're untruthful. Some of these very precepts may fall under the category of "literally untrue but more useful than the truth".
356+
357+<br>
358+
359+<img class="ba" src="https://media.urbit.org/site/posts/essays/discuss-03.jpg">
360+
361+## B: Specific Design
362+
363+There are some principles that aren't obviously better than the alternatives, but if you use them consistently you avoid a lot of issues. These are all examples of this.
364+
365+> B1: Always ack a dupe; never ack an ack.
366+>
367+> It's okay to ack a nack as long as you never nack a nack.
368+
369+This 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.
370+
371+Additionally, acking an ack can never take you from imperfect to perfect reliability. Urbit isn't big on heuristics for stuff that's visible to userspace (A14), so don't even go down that road.
372+
373+Following this rule greatly reduces the architecture space for networks. This is very helpful in finding a good architecture.
374+
375+> B2: Never construct or deconstruct a duct.
376+
377+A duct is akin to a first-class call stack. Don't deconstruct that for the same reasons you shouldn't read your own call stack. If you read your own call stack, and do different things based on that, it breaks a lot of assumptions we have about messages. For example, we assume that a vane will handle a task the same way regardless if the initial IO event was a keystroke or a timer. Don't break that.
378+
379+Similarly, don't construct these by hand. This would be like inserting other functions into your own call stack and then returning to them. Powerful, yes, but pretty much always a bad idea because it breaks our assumptions.
380+
381+> B3: Route on wire before sign, never sign before wire.
382+
383+When we send a message to another vane or app, we send it on a wire. When we get a response to that message, we should care first about the wire it was sent on.
384+
385+It's tempting to shortcut that and route based on the type of response. Maybe you only call to `%iris` once in your app, so you feel like you can just route directly on that. But it doesn't scale, because that dimension is orthogonal to the true dimension you care about — which request this response corresponds to. This is essentially a violation of A6.
386+
387+> B4: Only go from statically typed to dynamically typed if you must.
388+
389+Consider the set `U` of all possible programs. Then consider "the program you want to write" to be a set `S` of programs that differ only in aspects you don't care about. For example, maybe one takes a little more time and one takes a little more memory, and maybe you don't care about that. This set has a generating "specification" — any program that meets that specification is in the set.
390+
391+A type system or testing suite can guarantee that a program is in another set `T`. Obviously, both `S` and `T` are in `U`. Hopefully the intersection of `S` and `T` is non-empty — that is the set of programs which typecheck and meet your spec.
392+
393+A perfect static type system can guarantee `T` is a subset of `S` — if it typechecks, then it works. Obviously, if you let `T := {}` (ie no program typechecks), then this is vacuously true. So you want `T` to be as large as possible while still being a subset of `S` — as many programs as possible typecheck without them being incorrect. But it can't make `T == S` — there will always be some programs that do the correct thing in practice, but the type checker can't prove that.
394+
395+Dually, a perfect testing suite can guarantee that `S` is a subset of `T` — no correct program fails the tests. This is vacuously true if you have no tests, for then `T = U`. So you want `T` to be as small as possible while still being a superset of `S` — you don't want to reject valid programs if you can help it. But you can't make `T == S` — there will always be some programs that are invalid but pass your typechecks (at least, if your program requires a Turing machine).
396+
397+(It is possible to create a static type system that has `S` subset `T` property described above for a testing suite — see Erlang's Dialyzerand [related work](http://user.it.uu.se/~tobiasl/publications/contracts.pdf).)
398+
399+A dynamic type system tells you neither of these ahead of time. Instead, you end up with type errors at runtime. Errors at runtime must be handled at runtime, when the programmer is not present. Errors at compile time are handled at compile time, when the programmer is present.
400+
401+There's a hybrid, which is "static type checks at run time". In other words, you load the code and run the type checks at run time. This is better than pure dynamic checking because as long as the code compiles, you get the guarantees of a static type system. But the later in the process that the code is compiled, or the more it's changed before compiling, the less guarantee you have that the type checker will pass. If a static type checker gives an error at a time when the programmer is not present (because it's run at runtime), that's worse than a dynamic type system — at least that would give it a chance of executing correctly!
402+
403+> B5: Anything with business logic speaks one paradigm; anything that
404+> translates paradigms has no business logic.
405+
406+Translating between paradigms with significant impedance mismatch is usually convoluted code. The state machines are often hard to see, and it tends to be quite cluttered.
407+
408+You want your business logic to be as clean and short as possible. This way the interesting algorithms are laid bare.
409+
410+> B6: Functionally enforced semantic rules are better security primitives
411+> than memory access restrictions.
412+
413+Memory access restrictions are blunt tools. Blunt tools are nice in simple systems, and if all you have is nails, then a hammer is perfect. But in practice you punch all sorts of holes in these restrictions, because you need more granularity and flexibility.
414+
415+Better to define rules in a more powerful language. This allows you to follow A6 and A8. It also lets you use all the correctness tools, like type systems, that you've developed for the rest of your code.
416+
417+<br>
418+
419+<img class="ba" src="https://media.urbit.org/site/posts/essays/discuss-04.jpg">
420+
421+### C: Attitude
422+
423+Good code is the result of people approaching the act of engineering with the right attitude.
424+
425+> 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.
437+
438+The 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.
439+
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+
442+Urbit 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.
443+
444+This property is worth fighting for. It's the whole reason Urbit was written. New Urbit programmers are instinctively distrustful of anything below them and code defensively and fearfully. They must learn that it's all drastically simpler and more legible than they're used to. It's still hard, but you can actually make progress. To do so, you have to stand up straight, so you can get a firm footing on the ground. Keep your chin up and your shoulders back, and adopt the posture of a conqueror. When something doesn't work right, don't retreat into your shell of safety and control — fix it. The forces of chaos are always lurking, but their victory isn't inevitable. It's all on the line, so code with abandon.
445+
446+> C2: No time for lazy people.
447+
448+If there's clearly a right way to do something and a wrong way, do
449+it the right way. Coding requires incredible discipline. Always
450+follow conventions, and fire anyone who won't. Anything that can
451+be solved by discipline is not a real problem.
452+
453+> "To him who knows to do good and does not do it, to him it is
454+sin."
455+
456+Preserving the property of solid ground requires perpetual discipline. Once lost, it's often impossible to reacquire. Don't compromise your standards.
457+
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+
460+> C3: When a smart person makes an obviously stupid suggestion, before
461+> responding take a full 60 seconds to envision how you would implement
462+> it and what the effects would be.
463+
464+Once 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
465+of your own mind.
466+
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+Consider 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.
469+
470+<br>
471+
472+<img class="ba" src="https://media.urbit.org/site/posts/essays/discuss-05.jpg">
473+
474+### D: Theory
475+
476+The eternal tension between theory and practice must not simply be acknowledged, but dealt with.
477+
478+> D1: Academia is a succubus.
479+
480+The results from academia are useful to take advantage of, but the process of academia is a deadly sin for a project as ambitious as Urbit.
481+
482+Academia usually gets the right answer, but it's slow, and it often cycles through a large number of wrong answers before it gets to the right one. It's also unconcerned with many things that a real project must consider. For example, it's generally more concerned with mathematical simplicity than mechanical simplicity, contradicting A21.
483+
484+> D3: Not being qualified to solve a problem is no reason not to solve it.
485+>
486+> D4: The best way to get the right answer is to try it the wrong way.
487+>
488+> D6: Everyone must regularly alternate between theory and practice.
489+
490+One common failure mode for academia is to get bogged down in optimally solving a particular part of a problem such that it fails to solve the whole problem.
491+
492+There's a sense of "if I don't know how to do it, I must discover the correct answer before I can do it". This will get you the right answer if it terminates, which is the sort of algorithm mathematicians like. Engineers like algorithms that do in fact terminate.
493+
494+The fastest way to build a good system is to build it as well as you know how, then iterate on it. You have to be disciplined about actually iterating over time as you learn about the problem, but often the way to learn more about the problem is to move beyond it and work on adjacent
495+problems. Hindsight is 20/20, so get the problem in your rearview mirror as fast as possible. Then while you're driving somewhere else, you'll see what you should have done. Then turn around and go do it. This only works if you or someone else is willing to go back and fix it
496+(C2).
497+
498+> D2: Never fear math.
499+
500+You can spend years working on a problem that you're able to solve in a few days with the right theoretical grounding. There's no excuse for being ignorant of theory; or rather, being ignorant of theory is an excuse to learn it.
501+
502+Many engineers fear theory the same way they fear a complex piece of code deep in the stack (C1). But they shouldn't, because theory is rarely muddy. The same characteristics that make theory impractical also make it clean and learnable. It's also pretty permanent, so a one-time investment will pay dividends for a long time.
503+
504+Of course, if you look deep down, you may find laziness is what's keeping you from learning theory. If that's the case, you need to decide how much you want to design good software. Because there's no room for laziness (C2).
505+
506+> D5: Practice tells you that things are good or bad; theory tells you why.
507+
508+You can never tell whether a system is good or bad without using it (see discussion on A21). Theory has great explanatory power, but only limited exploratory power. The best it can do is point out areas of the idea maze you haven't explored and suggest correlations between
509+objective properties and your subjective judgment of the quality of the system.
510+
511+However, that explanatory power is indeed powerful, and the exploratory suggestions are often able to break you out of a rut (attractor basin). Respect the tension.
512+
513+<img class="ba" src="https://media.urbit.org/site/posts/essays/discuss-06.jpg">
514+
515+<br>
516+
517+### E: Text Style
518+
519+Code form matters. Code that is hard to read is hard to maintain. Code that is inconsistently formatted is hard to read, but consistency isn't the end of the story. Some formats are simply hard to read.
520+
521+Formatting also isn't the end of the story. Naming and commenting conventions are even more important to clarity. The human brain is quite good at taking stuff that's in an unexpected form and interpreting it.
522+
523+This is why the diversity of accents and handwriting rarely causes issues, while the diversity of languages requires specialized translators. For someone used to typing on a QWERTY keyboard, it takes some time to get used to typing on a Dvorak keyboard because you have to rewrite your muscle memory. But it's nothing like how hard it is to learn another language. Russian script is roughly as different from English script as Russian grammar is from English's, but it's drastically easier to learn to read, handwrite, and type Cyrillic than it is to learn Russian grammar.
524+
525+So, uniformity of style is good, but it's not sufficient. The style must be readily readable and writable.
526+
527+### Formatting
528+
529+> E1: No code should extend beyond 80 characters, most within 55.
530+
531+Very wide code is unreadable. Even before you get to the readability threshold, it's useful to keep your code relatively narrow. Too narrow of code, on the other hand, results in too tall of code. What these two have in common is that they make it hard to navigate the code.
532+
533+Code navigability is the ability to find the part of the code you're looking for. This has several inputs:
534+
535+- how far away is what you're looking for?
536+- how many distinct places in the code can you have on screen?
537+- how much code can you have on screen?
538+- how fast can you recognize that you're in the correct place?
539+
540+Some of these are strongly affected by workflows. We can't force a developer to have an effective workflow, but we can support those who do. If your workflow is deficient in one of these areas, consider improving it.
541+
542+One 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.
543+
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+found 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.
546+
547+> E2: Tabs aren't real.
548+
549+Code is a text file, and text files are WYSIWYG. The reader should view the file exactly the same as the author wrote it. This is a low-overhead way of avoiding editor-dependence in code, which is as bad as browser-dependence in javascript. Sure, tabs aren't as big a deal as the hell that front-end devs have to deal with, but there's no reason to give an inch to the forces of platform-dependence.
550+
551+Some argue in favor of "customization". Customization is inconsistency.
552+There can be good reason for inconsistency in some areas, but not in
553+code formatting, which is such an intensely communicative action.
554+
555+> E3: A text file is a series of lines, each ending with a newline
556+ character.
557+
558+There are several competing definitions of text files, but most commonly-used software uses this one. It's simple and consistent.
559+
560+Its disadvantage relative to "a text files is a series of characters, possibly including newlines" is that there are some arrangements of characters that are not valid text files (ie non-empty and not ending in a newline). However, some series of characters were already not valid
561+in a text file — eg those including control characters or other nonrepresentable characters.
562+
563+In return, we get the advantage that we can treat a text file as having a more complex and useful structure — a list of lists of characters, rather than simply a list of characters.
564+
565+These are theoretical concerns — the real answer is that it's the way it's always been done, and deviating from that without a good reason is asking for trouble.
566+
567+### Names and comments
568+
569+> E4: One block comment is better than interleaved comments on every line.
570+
571+Interleaved comments are easy to write because you can just paraphrase the code. This is also why they're generally useless. In the micro, code should always be immediately understandable. In the macro, it's often helpful to give context as to the purpose or constraints of the function. Sometimes it's good to even give the algorithm line-by-line in pseudocode, but mixing the pseudocode with the real code obfuscates both.
572+
573+> E5: Don't name anything you don't have to.
574+
575+> E6: If it's the same thing, give it the same name.
576+
577+It is often said that there are two hard things in computer science: cache invalidation and naming things. This is a good aphorism. As often, someone will respond with "There are two hard things in CS: cache invalidation, naming things, and off-by-one errors". This is a weak
578+joke because off-by-one errors are not hard at all. They're mostly a matter of discipline, and there's a couple of conventions that help. If you're looping on a zero-indexed variable, use `i < num_loops`. If you're looping on a one-indexed variable, use `i <= num_loops`.
579+
580+However, cache invalidation and naming things are genuinely hard because they must be solved ad hoc. There is no one-size-fits-all cache invalidation strategy, and possibly there never will be. Similar for naming. So you must actually comprehend and work within each individual
581+context.
582+
583+You 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.
585+
586+Examples:
587+
588+- If the only difference between three things is that they're not the
589+ same, consider naming them `thing-1`, `thing-2`, and `thing-3`.
590+
591+- Use agglutinative morphology. If `a` is to `b` as `c` is to `d`, then
592+ find an affix which describes this distinction (say `-suf`) and rename
593+ them to `a`, `a-suf`, `c`, and `c-suf`.
594+
595+- A corollary of the above is that if one variable represents the "same"
596+ thing with a different type, that type should be the morpheme added.
597+ For example, if `a-set` is a set, then `~(tap in a)` should be called
598+ `a-list`.
599+
600+- Don't abbreviate (E8) — everyone abbreviates differently, and bits are
601+ cheap. If it takes you a long time to type the name, consider (1)
602+ finding a more succinct name (good any time you can do it), (2)
603+ becoming a faster typer, or (3) learning autocomplete tools, such as
604+ snippets.
605+
606+- Especially don't abbreviate or otherwise change the word when adding
607+ affixes. Inflectional morphology is bad in such an ad hoc context as
608+ code.
609+
610+> E7: Humans are good at memorizing.
611+
612+We're really good at memorizing sets of things, like runes. We're also good at inferring structure from patterns. We're bad at memorizing structure in apparently unrelated names, though, and once we see a pattern, we assume it's densely populated.
613+
614+So don't be afraid to use new names for new concepts. If concepts are siblings, they needn't necessarily have a direct connection in their name, but if they're hierarchical, then something should suggest that. This can be syntactic or semantic.
615+
616+<br>
617+
618+<img class="ba" src="https://media.urbit.org/site/posts/essays/discuss-07.jpg">
619+
620+### F: Real Software
621+
622+Not all software matters. Or at least, not all software comes within
623+the scope of "Urbit". Urbit cares about "Martian software".
624+
625+> F9: Timeless software is good software.
626+
627+There's different sorts of software. A lot of software is inherently ephemeral, and can really only be run in one place. A SAAS company runs bespoke software on a particular set of servers, and that software has no future. It will never be run on anyone else's servers, and it will eventually stop being run even there. It won't even have any direct descendents. It's a genetic dead end.
628+
629+However, not all software is this way. Urbit is interested in software that can live forever. This is what we call "real" software.
630+
631+This is the most important passage in all that has ever been written
632+about Urbit:
633+
634+> What is Martian code actually like? There are two possibilities.
635+>
636+> One: since Earth code is fifty years old, and Martian code is fifty
637+> million years old, Martian code has been evolving into a big ball of mud
638+> for a million times longer than Earth software. (And two million times
639+> 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
643+> large and horrible that, despite its underground installed base, the
644+> server room bulged into space like a termite mound, intercepting
645+> low-flying asteroids and stinking up the solar system all the way to
646+> Pluto. Our latest space telescopes would surely have detected this
647+> abominable structure - if not, in fact, collided with it.
648+>
649+> 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+> global supply of bullet points; for numerous as the fishes in the sea,
653+> 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*
660+> pattern that, despite the fact that we know nothing about Mars, we can
661+> deduce that it must have happened on Mars. Probably several times.
662+> 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+>
666+> But the last, by definition, succeeded. This is the crucial inference we
667+> can draw about Mars: since the Martians had 50 million years to try, in
668+> the end they must have succeeded. The result: Martian code, as we know
669+> it today. Not enormous and horrible — *tiny and diamond-perfect*.
670+> 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
672+> to become one. It has achieved its final, permanent and excellent state.
673+
674+We 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.
675+
676+Here's some characteristics of real software:
677+
678+> F1: If it's not deterministic, it isn't real.
679+
680+If you do the same thing twice, your computer should react the same way. This is comforting. This is also what makes it easy to reason about and use effectively. If you're not sure what your computer will do, you'll be afraid of it and act defensively toward it. This inevitably leads to a big ball of mud.
681+
682+Diamonds are extremely hard, and they wear very slowly. A diamond surface will support you every time; a mud surface will shift out from under you exactly when you put weight on it.
683+
684+> F2: If it's centralized, it isn't real.
685+
686+Code that depends on a central authority or has a single point of failure is fundamentally brittle. No authority lasts forever, no company lasts forever, no server lasts forever. Under certain
687+circumstances, bones and the like can be preserved for a long time — but not alive. The remains of buildings sometimes last for thousands of years, but the cities are gone.
688+
689+The only things that last forever in their useful form are big hunks of rock (like the pyramids at Giza) and ideas, through writing and transcription. So, if you depend on the sun existing, this is
690+acceptable. If you depend on a piece of source code to be kept forever, copied and re-copied, you're fine. If you depend on a 20-year-old company existing and being easily accessible, this is brittle.
691+
692+Another 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.
693+
694+> F3: If it's owned by someone else, it isn't yours.
695+>
696+> F4: If it's managed by someone else and you can't change who that is, it
697+> isn't yours.
698+>
699+> F5: If it's not yours, it isn't permanent.
700+>
701+> F6: If it's not permanent, it isn't real.
702+
703+Nobody 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.
704+
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.
706+
707+Some 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.
708+
709+> F16: Sovereignty necessitates understanding.
710+
711+Not everyone cares to understand the software they're using. But if you want to compute sovereignly, you must understand what your computer is doing. If it regularly surprises you, you're not in control of it. You must tame it. The current paradigm is a wild monster which cannot be tamed by mere humans — only megacorporations even attempt to do so, and it's always temporary. So, your software needs to be simple enough that it can be understood.
712+
713+> F10: System modules should be designed to be frozen permanently;
714+> conversely, Urbit consists of that system software which admits of a
715+> Kelvin version.
716+
717+"Kelvin versioning" is a versioning scheme where your current version is a natural number, and new versions count down. Once you hit version 0, no more changes should be necessary.
718+
719+This is the opposite of the usual way of developing software, where there is no defined endpoint. This paradigm suggests that you're building something specific. Most current software builds higher and higher in a vain attempt to reach the heavens, until all available effort is expended just to keep this tower from falling over. Kelvin versioned software cuts away until you reach a strong bedrock. Not every piece of software should have a Kelvin version, but infrastructure should.
720+
721+> F11: The two procedures for achieving timelessness are distillation and
722+> generalization.
723+
724+When building a timeless system, you start by building whatever you need to make it work. Then as you continue on, you may find some of the features are no longer necessary. Often, they're only needed when you're using them for user-facing work, but you've already moved on to building user-facing stuff somewhere else. You don't need the niceties anymore, so you should remove them.
725+
726+Other times, you find that you want something similar to a feature you already have, but not exactly the same. When this happens often enough with the same feature, you may discover what is the essential nature of the feature and what are simply ornaments of the original use of the feature. Then, you can generalize the feature so that each of the desired use cases is well served.
727+
728+> F13: That which cannot be Kelvin-versioned should update fluidly and
729+> automatically.
730+
731+Not everything should be Kelvin versioned. Much user-facing code is in a continual process of discovery, and it must react to changing userbases and their needs. These should update without user interaction. You should be able to turn off your ship for years at a time, then turn it back on. After a few minutes or hours of catching up, you should be ready to go.
732+
733+This means you need upgrade paths to be permanent, and they must not lose information. Anything that stops being able to upgrade is not permanent, since it will succumb to bit rot.
734+
735+> F14: Humans are interactive and temporal; technology is permanent and
736+> exhaustive.
737+
738+This is why the software humans touch directly should not be Kelvin
739+versioned but the infrastructure that makes it work should be.
740+
741+> F7: The way it is isn't always the way it ought to be.
742+
743+You should presume that there's a good reason for why things are done a certain way because what works best tends to win in a market in the long term, but markets are rarely efficient. Markets become more efficient over time, if they become more liquid, and as they become larger. Software is young, the cost of switching technologies is often large, and the space of software paradigms yet to be explored dwarfs those we've exhausted. So don't be surprised if you find ways to improve the situation drastically.
744+
745+> F8: The way it ought to be isn't always the way it is.
746+
747+On the other hand, sometimes the elegant solution just isn't right. The ultimate test of the quality of software is whether it's useful to humans. Humans don't fit nice equations, so the timeless truths of mathematics are often mismatched with human convenience. Never sacrifice real utility for the sake of making the code more elegant.
748+
749+> F12: Standardization is better than perfection.
750+
751+Coordination problems are some of the most difficult. When given a choice between compatibility and improvement, carefully consider whether the problem solved by the improvement is weightier than the problem caused by the incompatibility.
752+
753+> F15: Communities are autonomous.
754+
755+This is both a positive statement and a normative one. Communities are in fact a thing separate from their platform, but sometimes changes in the platform can kill them. That's bad. It's slightly different from freedom of association, since that's a freedom that applies to individuals, not the communities themselves.
756+
757+Communities are the basic building blocks of society. We are each a member of some number of communities, and most power is held by these communities. Some communities coincide with family ties, some with common goals, beliefs, or interests. Some may be freely joined by just showing up — others are nearly impossible to join without having been born into them.
758+
759+Throughout civilization society has had many forms. Governments have ranged from police states to feudal societies to democracies to informal tribes of people. In each of these, the fundamental unit is the community. Humans don't live on their own, and they don't live in one
760+universal society. They are a part of some communities and not of others.
761+
762+Technology shouldn't force us into a single global community. Discoverability isn't an unmitigated good. Most communities should be closed off from each other — that's what makes them a community. This allows them to develop their own ideas and norms. These bleed into
763+other communities and may spread if they provide some benefit.
764+
765+Many 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.
766+This 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.
767+
768+Technology should mirror human interaction, and humans interact in communities.
content/blog/precepts.mdnew file+355
@@ -0,0 +1,355 @@
1++++
2+title = "Precepts"
3+date = 2020-03-18
4+description = "Technical maxims that define Urbit's approach to engineering."
5+[extra]
6+author = "Philip Monk"
7+ship = "~wicdev-wisryt"
8+image ="https://media.urbit.org/site/posts/essays/pre-01.jpg"
9++++
10+
11+<br>
12+
13+<img class="ba" src="https://media.urbit.org/site/posts/essays/pre-01.jpg">
14+
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+
17+Some 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.
18+
19+We’ll start with a brief description of many principles, then we’ll go into a long-form justification.
20+
21+<br>
22+
23+<img class="ba" src="https://media.urbit.org/site/posts/essays/pre-02.jpg">
24+
25+
26+### A: General Design
27+
28+1) Data is better than code.
29+
30+ Store data in your state, send data over the wire, dispatch based
31+ on data.
32+
33+2) Everything should be CQRS.
34+
35+3) (Almost) Everything should be pubsub.
36+
37+4) A subscriber shouldn't affect a publisher.
38+
39+5) Communication between nodes should be communication between
40+ independent actors.
41+
42+ Each message should do one complete thing, and there shouldn't
43+ need to be a sequence of coupled messages.
44+
45+6) Represent your data as closely as possible to the essential structure
46+ of the problem.
47+
48+7) A client's representation of data should be as close as possible to
49+ that of the server.
50+
51+ This blurs the distinction between client and server. It allows
52+ offline-mode, reduces communication to syncing, and decentralizes.
53+
54+8) When mating different paradigms, build one cleanly on top of the
55+ other.
56+
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.
62+
63+9) Never misuse an abstraction.
64+
65+ An abstraction provides a certain set of tools; use them and only
66+ them.
67+
68+10) Correctness is more important than performance.
69+
70+11) Be simple and uncompromising in defining what's correct; go crazy
71+ with optimizations.
72+
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
92+ all the code it depends on, your code is wrong.
93+
94+14) Deterministic beats heuristic.
95+
96+ Heuristics are evil and should only be used where determinism is
97+ infeasible, such as in cache reclamation.
98+
99+15) Stateless is better than stateful.
100+
101+16) Explicit state is better than implicit state.
102+
103+17) Referential transparency is honesty and stability.
104+
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.
108+
109+18) Responsibilities should be clearly separated.
110+
111+ This applies from kernel modules through network citizens.
112+
113+19) Dualities must be faced head-on and analyzed differently at
114+ different layers.
115+
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.
120+
121+20) One hundred lines of simplicity is better than twenty lines of
122+ complexity.
123+
124+ It's not enough for an abstraction to reduce code duplication; it
125+ must actually make the code simpler.
126+
127+21) Prefer mechanical simplicity to mathematical simplicity.
128+
129+ Often mechanical simplicity and mathematical simplicity go
130+ together.
131+
132+22) The Law of Leaky Abstractions is a lie; abstract airtightly.
133+
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.
137+
138+23) Some cliches are repeated because they are true; others must be
139+ repeated because they are not.
140+
141+<br>
142+
143+<img class="ba" src="https://media.urbit.org/site/posts/essays/pre-03.jpg">
144+
145+### B: Specific Design
146+
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.
150+
151+2) Never construct or deconstruct a duct.
152+
153+3) Route on wire before sign, never sign before wire.
154+
155+4) Only go from statically typed to dynamically typed if you must.
156+
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.
163+
164+5) Anything with business logic speaks one paradigm; anything that
165+ translates paradigms has no business logic.
166+
167+6) Functionally enforced semantic rules are better security primitives
168+ than memory access restrictions.
169+
170+ A compiler can use type safety as an effective tool to enforce
171+ some classes of security guarantees.
172+
173+<br>
174+
175+<img class="ba" src="https://media.urbit.org/site/posts/essays/pre-04.jpg">
176+
177+### C: Attitude
178+
179+1) Code courageously.
180+
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.
186+
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.
191+
192+2) No time for lazy people.
193+
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.
198+
199+ > "To him who knows to do good and does not do it, to him it is
200+ sin."
201+
202+3) When a smart person makes an obviously stupid suggestion, before
203+ responding take a full 60 seconds to envision how you would implement
204+ it and what the effects would be.
205+
206+<br>
207+
208+<img class="ba" src="https://media.urbit.org/site/posts/essays/pre-05.jpg">
209+
210+### D: Theory
211+
212+1) Academia is a succubus.
213+
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.
218+
219+2) Never fear math.
220+
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.
228+
229+3) Not being qualified to solve a problem is no reason not to solve it.
230+
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."
234+
235+4) The best way to get the right answer is to try it the wrong way.
236+
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.
240+
241+5) Practice tells you that things are good or bad; theory tells you why.
242+
243+ Never use theory to design a good system from scratch; only
244+ practice can tell whether the system is good.
245+
246+6) Everyone must regularly alternate between theory and practice.
247+
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.
252+
253+<br>
254+
255+<img class="ba" src="https://media.urbit.org/site/posts/essays/pre-06.jpg">
256+
257+### E: Text Style
258+
259+1) No code should extend beyond 80 characters, most within 55.
260+
261+2) Tabs aren't real.
262+
263+3) A text file is a series of lines, each ending with a newline
264+ character.
265+
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.
269+
270+4) One block comment is better than interleaved comments on every line.
271+
272+5) Don't name anything you don't have to.
273+
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`.
278+
279+ A more recent convention that follows the same principle is to
280+ give the variable the same name as its type.
281+
282+6) If it's the same thing, give it the same name.
283+
284+7) Humans are good at memorizing.
285+
286+8) Abbreviations aren't worth it.
287+
288+<br>
289+
290+<img class="ba" src="https://media.urbit.org/site/posts/essays/pre-07.jpg">
291+
292+### F: Real Software
293+
294+1) If it's not deterministic, it isn't real.
295+
296+2) If it's centralized, it isn't real.
297+
298+3) If it's owned by someone else, it isn't yours.
299+
300+4) If it's managed by someone else and you can't change who that is, it
301+ isn't yours.
302+
303+5) If it's not yours, it isn't permanent.
304+
305+6) If it's not permanent, it isn't real.
306+
307+7) The way it is isn't always the way it ought to be.
308+
309+ If you can make it the way it ought to be, do so.
310+
311+8) The way it ought to be isn't always the way it is.
312+
313+ Some things can't be made more elegant.
314+
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.
319+
320+9) Timeless software is good software.
321+
322+10) System modules should be designed to be frozen permanently;
323+ conversely, Urbit consists of that system software which admits of a
324+ Kelvin version.
325+
326+11) The two procedures for achieving timelessness are distillation and
327+ generalization.
328+
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.
334+
335+12) Standardization is better than perfection.
336+
337+ Kelvin versioning stops when we run out of versions, not when
338+ every defect has been rectified.
339+
340+13) That which cannot be Kelvin-versioned should update fluidly and
341+ automatically.
342+
343+ All incompatible upgrades should provide permanent and automatic
344+ upgrade paths. This is principled permanent backward
345+ compatibility.
346+
347+14) Humans are interactive and temporal; technology is permanent and
348+ exhaustive.
349+
350+15) Communities are autonomous.
351+
352+16) Sovereignty necessitates understanding.
353+
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.mdnew file+89
@@ -0,0 +1,89 @@
1++++
2+title = "Providers"
3+date = 2020-08-18
4+description = "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+[extra]
6+author = "Galen Wolfe-Pauly"
7+ship = "~ravmel-ropdyl"
8+image ="https://storage.googleapis.com/media.urbit.org/site/posts/essays/providers.png"
9++++
10+
11+<br>
12+
13+<img class="ba" src="https://storage.googleapis.com/media.urbit.org/site/posts/essays/providers.png">
14+
15+<br>
16+
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.
20+
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.
22+
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.
24+
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.
26+
27+
28+## What is a provider?
29+
30+A provider is anyone (company, DAO, a group of friends) that provides easy onboarding and hosting.
31+
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.
33+
34+From 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.
35+
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.
37+
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.
39+
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.
41+
42+Let’s move on and talk a bit about why starting a provider makes sense to begin with.
43+
44+
45+## Why would anyone start a provider?
46+
47+Our 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.
48+
49+Any 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.
50+
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.
52+
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.
54+
55+Providers 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.
56+
57+
58+## What are some examples of providers?
59+
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.
61+
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.
63+
64+Let’s walk through a few examples to get a feel for what’s possible:
65+
66+Communities -
67+
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.
69+
70+Custom software -
71+
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.
73+
74+Aside 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.
75+
76+Security -
77+
78+Let’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.
79+
80+
81+## What about Tlon?
82+
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.
84+
85+I’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.
86+
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.
88+
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.
content/blog/rollups.mdnew file+220
@@ -0,0 +1,220 @@
1++++
2+title = "The Gang Solves the Gas Crisis"
3+date = 2021-05-14
4+description = "How we're making Urbit ID affordable again"
5+[extra]
6+author = "Jonathan Paprocki"
7+ship = "~datnut-pollen"
8+image = "https://media.urbit.org/site/posts/essays/gas.jpeg"
9++++
10+
11+![gas station](https://media.urbit.org/site/posts/essays/gas.jpeg)
12+
13+Anybody who has used Ethereum smart contracts recently is aware that it has
14+gotten _expensive_. There are a large quantity of
15+complicated and clever techniques each with their own trade-offs
16+that are collectively referred to as "layer 2 solutions" (see [further
17+resources](#resources) for more information about these). This is in contrast to
18+the base computational layer of Ethereum called "layer 1", which is what constitutes most Ethereum usage and where [Urbit ID](/docs/glossary/azimuth)’s smart contracts currently exist.
19+
20+Tlon has always covered gas costs for Urbit ID up to a set limit, and this was easy a couple of years ago when the cost of transactions required to get a [planet](/docs/glossary/planet) up and running came out to less than a dollar. Unfortunately the ongoing Ethereum gas crisis, along with the rising price of Ethereum itself, has made this impossible. We’ve seen gas costs to set up a planet as high as several hundred US dollars at time of writing!
21+
22+In response to the gas crisis, Tlon has spent the last several months developing
23+a simple, in-house layer 2 solution which we anticipate will reduce typical gas costs by 65x or more.
24+
25+This post is primarily a short non-technical explainer of the end-user experience of our solution aimed at planet and [star](/docs/glossary/star) owners and those in the market for one, as well as a status update on where we're at in development. At [the end](#technical) we give some minimal technical details and resources to help you dig deeper should you wish.
26+This is also primarily aimed at those who currently self-host or plan to self-host their
27+urbit. For anybody utilizing a hosted service, this matter will all be handled
28+by your provider. There is a [separate section](#stars) addressed specifically at star owners, and another [section](#rollers) for those who wish to set up their urbit to accept and submit layer 2 transactions. We’d like to emphasize that this system is 100% opt-in—if you are satisfied with the current experience of Urbit ID, then nothing changes for you whatsoever.
29+
30+Perhaps the most pressing question held by anybody reading this is—when will
31+it be ready? It's not reasonable to give a timeline on difficult engineering
32+work, but rest assured that completing this upgrade is a top priority. Much
33+of the back-end is approaching completion, and we are confident in a release before the end of Q3 and hopefully much sooner.
34+
35+### Naive rollups
36+
37+Our layer 2 solution, designed primarily by Tlon lead engineer `~wicdev-wisryt`,
38+is known as "naive rollups" and we will be using this term interchangeably with
39+"layer 2"—though it is important to note that there are many layer 2 solutions
40+utilized by projects other than Urbit. As we're avoiding technicality here, we’re focusing primarily on the advantages and disadvantages of utilizing our layer 2 solution, and how that affects the management of your [ship](/docs/glossary/ship).
41+
42+Very briefly, a rollup is a way to combine many transactions into one, and we
43+are building infrastructure so that any Urbit ship may be utilized as a "roller". A
44+roller will collect layer 2 Urbit ID transactions, confirm their validity, and
45+post them to the Ethereum blockchain. More detail is given [at the end](#technical). Anybody may set up a
46+ship to [act as a roller](#rollers). Tlon will be launching our own publicly accessible roller, but as Urbit is a decentralized network, by no means will we have a monopoly.
47+
48+#### Pros and cons
49+
50+The primary advantage to using naive rollups is that the gas cost for Urbit
51+ID-related actions will be dramatically reduced. It will be reduced sufficiently that we expect that a few transactions per ship per week (plenty for ordinary usage) submitted to Tlon's roller will not cost the end user anything. There are no gas costs associated with submitting a layer 2 transaction to a roller, and Tlon will bear the gas cost of posting the results to the blockchain. That means that the cost you see for a planet on a market that utilizes Tlon's roller ought to be
52+the final cost.
53+
54+There are a few trade-offs for this, but none of them really sacrifice the core
55+value propositions of Urbit ID.
56+
57+The most substantial one is that ships on layer 2 are essentially completely isolated
58+from the rest of the Ethereum ecosystem. They can no longer interact with smart
59+contracts designed to work with Urbit ID or non-fungible tokens (which are how Urbit IDs are represented) in general. It is also not possible to write new Ethereum smart contracts that work with layer 2 ships.
60+
61+Compounding that factor, the journey to layer 2 is one-way only—at
62+least for now. There are theoretical ways a ship may be moved back to layer 1, but they do not yet exist, and we cannot promise that such a thing will be available in a timely manner. Anybody moving a ship to layer 2, or buying a ship on layer 2, should assume that they will
63+remain on layer 2 for the foreseeable future. We do not expect this to be
64+permanent, but it is perhaps the most significant drawback for the time being.
65+
66+Another one is that transactions may no longer be "instant". Effectively, this
67+was already the case on layer 1—unless you paid a lot of gas, you could wait
68+hours or even days for your transaction to clear. But the way we are saving on
69+gas is essentially by "bundling" or "rolling up" many transactions into one, and
70+submitting them as a single transaction. The more transactions in the rollup,
71+the better the savings. This bundling is not the only factor at play here
72+though—costs are reduced other ways, but this is a technical detail
73+[discussed later in this post](#technical). It is possible to use layer 2 to submit single
74+transactions (and this will still save on gas costs!), so utilization of layer 2
75+should not incur any delay over layer 1 when utilized in this fashion.
76+
77+Tlon has not finalized the details on how our roller will work, but it will
78+probably involve waiting until a sufficient backlog of transactions have been
79+submitted to make it economical to bundle them up, or just submitting every set
80+time period, whichever arrives first. We do not see this as a big issue—we
81+view Urbit ID as "digital land", and a few hours to acquire land, or waiting for
82+your new personal computer to be delivered, is still lightning fast in
83+comparison to the real world. We also have ideas on methods that will allow you to get on the network before the transfer has been confirmed, but that is outside of the scope of this article.
84+
85+Our layer 2 preserves the main value proposition of Urbit ID, which is that your ship
86+belongs to you forever, and that this is assured by very strong cryptographic methods and
87+game-theoretic arguments comparable to the ones that exist on layer 1. We
88+consider this principle to be uncompromisable, and maintaining ultimate
89+sovereignty over your ship was totally central in choosing our solution.
90+We summarize the new security model [below](#technical), and `~wicdev-wisryt`
91+goes into greater detail in the [resources](#resources).
92+
93+### Changes to User Experience
94+
95+The primary way one manages their Urbit ID, namely performing tasks such as
96+transferring ships, setting networking keys, or setting
97+[proxies](/docs/glossary/proxies), is with a web interface called
98+[Bridge](/docs/glossary/bridge) found at
99+[bridge.urbit.org](https://bridge.urbit.org). If you already own a planet,
100+you've probably used Bridge before - perhaps only a single time.
101+
102+Bridge will be getting a facelift to enable easy interfacing with layer 2,
103+including loud warnings about what is being gained and lost by doing so. From
104+here you will be able to transfer your ship to layer 2, and once there,
105+perform all the usual actions you can on layer 1.
106+
107+The main difference for layer 2 transactions on Bridge will be the additional
108+choice of a roller to submit transactions to. Tlon's will be free for ordinary, non-time-sensitive usage.
109+You could use your own ship for a fast single transaction for a little more gas. We expect that planet markets and stars may wish to set up their own rollers as well.
110+
111+Every planet has a sponsor star, which distributes [OTA
112+updates](/docs/glossary/ota-updates) to their sponsored planets and assists with peer discovery. Both layer 1 and layer 2 planets will be able to be
113+sponsored by either layer 1 or layer 2 stars, meaning that nothing will change
114+in terms of how sponsorship works.
115+
116+When you buy a ship, any reputable seller will inform you whether or not it is
117+on layer 1 or layer 2. Anyone running an urbit will be able to verify this information, and we expect for tools to exist to make this information publicly available (see [this grant](https://grants.urbit.org/bounties/1101665172-network-explorer-data-pipeline-http-api)).
118+
119+And that's it! If you'd like to know how things will be changing for
120+[stars](#stars), what goes into [setting up a roller](#rollers), and additional
121+[technical details](#technical), read on.
122+
123+### Changes to stars {#stars}
124+
125+Both planets and stars will be able to move to layer 2.
126+[Galaxies](/docs/glossary/galaxy) must remain on layer 1 for technical
127+reasons, and [moons](/docs/glossary/moon) and
128+[comets](/docs/glossary/comet) never interacted with Ethereum anyways, so
129+they are completely out of the picture.
130+
131+Stars will be able to remain on layer 1 with no action required. For star owners
132+that wish to take advantage of the cheaper gas costs, there are two possible
133+modes: ownership of the star on layer 2, or setting the spawn proxy to layer 2
134+with ownership remaining on layer 1.
135+
136+The first mode—a star which is owned on layer 2—has the same advantages and
137+disadvantages as a layer 2 planet. Planets spawned by a layer 2 star will also
138+necessarily be on layer 2 - there is no way to spawn a layer 1 planet from a
139+layer 2 star, though any planets which were spawned on layer 1 before the
140+star migrated to layer 2 will remain on layer 1.
141+
142+The second mode—ownership on layer 1, with spawn proxy on layer 2—is only slightly more complicated. Such a star will change its networking keys, transfer
143+between wallets, and set its management proxy all on layer 1, with the
144+corresponding higher gas cost. However, it will be able to spawn planets on
145+layer 2—and _only_ on layer 2—with the corresponding layer 2 tradeoffs. Like
146+moving ownership to layer 2, this will be a one-way journey for now. Planets
147+spawned before moving the spawn proxy to layer 2 will remain on layer 1, but
148+from then on, all planets spawned by that star will live on layer 2. Finally, stars in this second mode may transition to the first mode, but not vice versa.
149+
150+### Creating a roller {#rollers}
151+
152+![gasprices](https://media.urbit.org/site/posts/essays/gasprices.jpeg)
153+
154+Rollers are urbit nodes which users submit transactions to to be "rolled up"
155+into a bundle to be submitted to the Ethereum blockchain. The business logic for
156+a roller runs on the urbit node itself. Thus, anybody with an urbit ship may set
157+it up to act as a roller. While the details of how rollers work are still being
158+hammered out, one should expect that one can either set transactions to be
159+submitted at regular intervals, once a sufficient number of transactions have
160+been received (as more transactions means greater savings), manually, or some
161+combination of the above.
162+
163+Tlon plans to release documentation on how to set up your own roller concurrently with
164+the release of our layer 2 solution.
165+
166+Malicious rollers could potentially exist, but the worst they ought to be able
167+to do is simply not submit your transaction. The security factors for rollers
168+are briefly addressed [below](#technical), and elaborated upon in the
169+[resources](#resources), but you can expect full technical documentation on
170+these factors to be included in the roller documentation.
171+
172+### Changes to Azimuth
173+
174+[Azimuth](/docs/glossary/azimuth) is the set of Ethereum smart contracts
175+governing Urbit ID. They will require a few changes to accommodate the new
176+system. Some of this has been implicit above, but to be clear, we will only be
177+making 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.
182+
183+### Technical details {#technical}
184+
185+What's really going on behind the scenes here? Briefly, only the data of the Urbit ID transactions will be posted on-chain, while computation and state storage will now happen on your ship.
186+
187+In 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.
188+
189+Changes 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.
194+
195+In practice, the fourth step is never used in layer 1. The primary change to our
196+security model is that we are cutting out step 2 and beefing up step 4. Your
197+ship will now perform validation of the transactions posted to the Ethereum
198+blockchain, rather than the EVM.
199+
200+Since [Urbit OS](/docs/glossary/arvo) is deterministic, and Hoon has some nice formal
201+properties, it turns out to be a great language for writing smart contracts. Thus we are effectively swapping the Ethereum smart contract with a “Hoon smart contract” run locally on your ship.
202+
203+#### Further Resources {#resources}
204+
205+We want to keep this post brief and non-technical, so that's all we'll say about
206+it for now. To find out more, you have a few directions to go on. We held a
207+[Developer Call](/events/2021-03-04-developer-call-scaling-azimuth) where
208+`~wicdev-wisryt` outlines the design in much more technical detail, and also
209+explains why we decided to utilize our own design rather than other known layer
210+2 solutions such as [Optimistic
211+rollups](https://docs.ethhub.io/ethereum-roadmap/layer-2-scaling/optimistic_rollups/),
212+[ZK-rollups](https://docs.ethhub.io/ethereum-roadmap/layer-2-scaling/zk-rollups/),
213+etc, or other blockchains. He also plans to do a more technical walkthrough video sometime before release. For those who would rather read, see
214+`~wicdev-wisryt`'s [RFC: Naive rollup for cheaper Urbit ID
215+transactions](https://groups.google.com/a/urbit.org/g/dev/c/p6rP_WsxLS0/m/hQBX0modAwAJ)
216+post on the `urbit-dev` mailing list. Lastly, the primary working branch on
217+Github for the Urbit side of naive rollups is
218+[here](https://github.com/urbit/urbit/tree/philip/naive), though it is not the
219+only place code is accumulating.
220+
content/blog/security-and-continuity.mdnew file+62
@@ -0,0 +1,62 @@
1++++
2+title = "Security and Continuity"
3+description = "An update on our primary infrastructure milestones for 2020."
4+date = 2020-12-01
5+[extra]
6+author = "Galen Wolfe-Pauly"
7+ship = "~ravmel-ropdyl"
8+image = "https://media.urbit.org/site/posts/essays/land4.jpg"
9++++
10+
11+![Security and Continuity](https://media.urbit.org/site/posts/essays/land4.jpg)
12+
13+## Security and Continuity
14+
15+In 2018, when we launched the Urbit ID contracts (also called ‘Azimuth’), we committed to yearly infrastructure goals for 2019 and 2020. This wasn’t an informal commitment — it’s part of the contracts that were published to the blockchain, which you can read [here](https://raw.githubusercontent.com/urbit/azimuth/edf68b8da04806dd5b95994daf14cf1e7e226829/proposals/0xcb1f81e42b5e75f000f94fc71a3ea70cab4bfc6f236b91e717f1b9516e5596b5.txt). At the end of each year, we ratify our accomplishment of these goals with a galaxy vote.
16+
17+Since the year is coming close to an end, and this year’s vote is on the horizon, it’s time for an update on our progress.
18+
19+For this year, we committed to completing two things: passing a third-party security audit of our networking protocol (Ames) and getting Urbit OS (both Arvo and the interpreter) to the point where we can reasonably expect the Urbit network to continue without any hard forks (which we call ‘breaches’). A world with no network breaches is one where the network should be able to run indefinitely without any interruption. We also call this ‘continuity’.
20+
21+We’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.
22+
23+
24+## Ames Audit
25+
26+Urbit 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.
27+
28+There are two things worth worrying about when it comes to Urbit OS security: someone breaking into Urbit from the machine it’s running on, and someone compromising the network protocol itself. As to the first, there are probably ways that we can harden the OS sandbox, but if the machine it’s running on is secure we can feel reasonably safe. Since there’s lots of prior art on how to secure a Unix machine, we can leave hardening the runtime for later and simply encourage everyone to secure the boxes they run their Urbit nodes on.
29+
30+Assuming each node on the network can run on a locked-down machine, it’s really important that the protocol for communicating between these nodes is secure. Also, since Ames uses other Urbit nodes for peer discovery, we want to make sure no ‘relay node’ can inspect data not meant for them.
31+
32+The question “Is Ames secure?” is too vague for an auditor, of course. The audit was scoped to determine that the following three criteria are met:
33+
34+- No one can impersonate another ship on the network
35+- No one (including relays) can intercept and decrypt messages not meant for them
36+- Ames messages don’t leak keys that could endanger the sender’s data
37+
38+Our goal with this scope is to focus exclusively on the design and implementation of Ames itself. Basically, the crypto should be correct and there should be no flaws in either the protocol design or its implementation. Our interpreter can still be hardened against other potential attacks, which is work we’ll undertake in the future. We asked our auditors to flag all of these potential issues, so we know what needs to be addressed in the future.
39+
40+The good thing about an audit scoped in this way is that we can trust the protocol to authenticate people and shuttle packets back and forth safely. We’ve always been reasonably confident about Ames, but having an external stamp of approval will be great.
41+
42+As 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.
43+
44+
45+## Continuity
46+
47+Urbit 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.
48+
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.
50+
51+A 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.
52+
53+The 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.
54+
55+
56+## Status + conclusion
57+
58+We 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.
59+
60+Our goal is to have all of this work complete by `~2020.12.10`. This means we should be able to start a galaxy vote right around that time. Galaxy votes (as specified in the contracts) run for a month, which should have this whole process ending on `~2021.1.10`.
61+
62+It's going to be an exciting couple of weeks!
content/blog/security-audit.mdnew file+157
@@ -0,0 +1,157 @@
1++++
2+title = "Ames Security Audit and the Future of the Protocol"
3+description = "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
5+[extra]
6+author = "Ted Blackman + Anthony Arroyo"
7+ship = "~rovnys-ricfer + ~poldec-tonteg"
8+image = "https://storage.googleapis.com/media.urbit.org/site/posts/essays/20201218-audit.png"
9++++
10+
11+<br>
12+
13+![audit](https://storage.googleapis.com/media.urbit.org/site/posts/essays/20201218-audit.png)
14+
15+<br>
16+
17+The security firm Leviathan has now finished their initial audit of the security of Urbit's Ames network protocol. In addition to their review of Ames, we also asked them to identify any other issues in order to help guide further development.
18+
19+I'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."
20+
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+
23+Aside 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:
24+
25++ Forward secrecy
26++ Protection against denial of service attacks
27++ Enforcement of social boundaries
28+
29+Ames’ 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.
30+
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+
33+## Forward Secrecy
34+
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+
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+
39+Various 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.
40+
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.
43+
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+
46+While 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.
47+
48+## Denial of Service
49+
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+
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+
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+
56+An 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.
57+
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+
60+The 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.
61+
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+
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+
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
69+
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+
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+
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+
76+As-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.
77+
78+### DoS Mitigation Approach 1: Signature
79+
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+
82+#### Advantages of a signature over other approaches
83+
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 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.
86+
87+#### Disadvantages of a signature over other approaches
88+
89+- 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+- 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.
92+
93+### DoS Mitigation Approach 2: End-to-End HMAC
94+
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+
97+#### Advantages of end-to-end HMAC
98+
99+- It's simple in some sense; relays don't need to do anything cryptographic.
100+- 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+
103+#### Disadvantages of end-to-end HMAC
104+
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+
107+### DoS Mitigation Approach 3: Point-to-Point HMAC
108+
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+
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+
113+#### Advantages of point-to-point HMAC
114+
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 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.
117+
118+#### Disadvantages of point-to-point HMAC
119+
120+- 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.
123+
124+#### An Aside About Cryptographic Performance
125+
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+
128+### DoS Protection Strategy and Timeline
129+
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+
132+Since 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.
133+
134+## Enforcement of Social Boundaries
135+
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+
138+There 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.
139+
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.
143+
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.
145+
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.
147+
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.
149+
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.
151+
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.
153+
154+
155+## Conclusion
156+
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.mdnew file+50
@@ -0,0 +1,50 @@
1++++
2+title = "Simple, Durable, Yours"
3+date = 2019-10-17
4+description = "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]
6++++
7+
8+We 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.
9+
10+But computers are a mess.
11+
12+
13+<img class="ba mv5 w-100" src="https://media.urbit.org/site/understanding-urbit/simple-durable-yours/simple-durable-yours-notifications.svg">
14+
15+
16+We 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.
17+
18+If 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.
19+
20+<img class="ba mv5 w-100" src="https://media.urbit.org/site/understanding-urbit/simple-durable-yours/simple-durable-yours-rock%402x.png">
21+
22+We built Urbit from scratch to be a system that’s simple, durable, and yours. Everything that computing today is not — but should be.
23+
24+What do we mean by simple, durable, and yours? Let’s walk through it one by one.
25+
26+<br /><br />
27+
28+## Simple
29+
30+Urbit is designed to be incredibly simple for ordinary users. Your data, applications, and connections all live in a single, unified operating system that belongs to you. Your Urbit requires no system administration and gets all its updates over the air. For developers, Urbit is incredibly compact and efficient. It’s about 50K lines of code — smaller than your average webapp. The entire OS can be understood by a single person and is designed to make building decentralized apps straightforward.
31+
32+<br /><br />
33+
34+## Durable
35+
36+Your Urbit is designed to be durable: both to store your data across generations and to be resilient against crashes. You can't really trust a computer that could disappear or become obsolete. We’ve become accustomed to this distrust, but it’s not the way things should be. Your Urbit is meant to be a permanent digital home. At its foundation, Urbit is designed a bit like a blockchain — making reliability and permanence a priority for the individual.
37+
38+<br /><br />
39+
40+## Yours
41+
42+Finally, your Urbit belongs to you in every possible way. You own it with a private key, control it completely, and can inspect its source code. We want your Urbit to be your digital home. A home you don’t own is just a hotel room.
43+
44+<img class="ba mv5 w-100" src="https://media.urbit.org/site/understanding-urbit/simple-durable-yours/simple-durable-yours-evolution.svg">
45+
46+Urbit began as a sketch, driven from a basic intuition that a better platform could be built. Today, Urbit is two components: Urbit ID, an identity system that’s already live on Ethereum; and Urbit OS, a decentralized network and OS stack that’s young but working well.
47+
48+Over time we’ve quietly evolved Urbit into a carefully engineered, compact system. Urbit isn’t done — but it’s well on its way. The network has been live since 2013 and the interface is coming along nicely. You can own a piece of Urbit today if you can find an invite from a friend, or by buying an Urbit ID. We’re ready for people to begin homesteading this new territory we created with new communities and new software.
49+
50+We think it’s possible to leave today’s technology behind and build something better. Something more humane, calm, and collectively owned. Our vision of the future isn’t one where technology intrudes in every corner of our lives. It’s one where technology is mostly invisible.
content/blog/stable-arvo.mdnew file+95
@@ -0,0 +1,95 @@
1++++
2+title = "Stable Arvo"
3+date = 2019-11-20
4+description = "This year we set out to get Arvo to a point that we can credibly call ‘stable.' "
5+[extra]
6+author = "Anthony Arroyo"
7+ship = "~poldec-tonteg"
8+image = "https://media.urbit.org/site/posts/essays/stable-arvo.png"
9++++
10+
11+![](https://media.urbit.org/site/posts/essays/stable-arvo.png)
12+
13+### A contract by which Arvo evolves
14+
15+We 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.
16+
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+
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+
21+Getting 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.
22+
23+To achieve stability in practice Arvo needs three things:
24+
25+- The Arvo network (Ames) has to be stable
26+- Arvo can’t easily fall into an unrecoverable state
27+- Arvo has to have a clear and formalized upgrade mechanic
28+
29+All of these are actively being worked on, and are mostly near completion. Let’s walk through them one by one.
30+
31+
32+### A new Ames
33+
34+To 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.
35+
36+Ames is a big part of what makes Urbit Urbit. It guarantees exactly once message delivery, it’s encrypted and authenticated. The original Ames design is pretty good. But it’s also incredibly difficult to maintain and had a few really painful edge case bugs. When the network has fallen over in the past, it has been far too hard to debug the original Ames code.
37+
38+We managed to update this original Ames code to use Ethereum as the source of truth for keys and key updates. We also made significant changes by introducing a new version of Jael, our kernel module for managing keys and signing inside of Urbit. While this change was significant, Ames still had some pretty nasty occasional bugs related to subscriptions and subscription updates. In order to get Ames to be truly reliable, it needed a rewrite.
39+
40+We’ve been working on that rewrite, codenamed Alef, for a few months now. Alef doesn’t aim to add any new functionality — it’s simply a drop-in replacement that’s cleaner and more reliable. We currently have Alef running on a testnet and sending packets with an industry-standard congestion control algorithm. There’s still some work to do, but it’s coming along nicely. Some early tests even show it to be faster, which is great.
41+
42+We 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.
43+
44+
45+### Recoverability
46+
47+Another 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.
48+
49+In order to understand the difficulties with error handling and how we’re dealing with it, we have to understand the Arvo operating system. Arvo is responsible for coordinating messages being sent from the outside world (Unix in our case) and messages sent from one vane, or kernel module, to another. Both Arvo and the vanes are explicit state machines, meaning that they must specify every possible state and the transitions between them. These properties make it possible for the system to be fully updated (we’ll discuss such upgrades below).
50+
51+This architecture means that errors have to be considered not simply as an exception, but as a possible state in the explicit state machine. In practice, we have to account for both deterministic errors like semantically invalid formulas and non-deterministic errors like running out of memory or a plug getting pulled.
52+
53+Deterministic 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.
54+
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
56+occur.
57+
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.
59+
60+Our 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.
61+
62+In 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.
63+
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.
65+
66+By 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.
67+
68+
69+### Telescoping Kelvins
70+
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.
72+
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.
74+
75+Nock is already nearly frozen at 4K. A change to Nock is a major event.
76+
77+At the level of the kernel (including Arvo proper, Zuse, and the Vanes), we’ve never fully followed a kelvin versioning scheme. The bottom of the stack always had to freeze first. But now the system is starting to stabilize such that we need a path toward a ‘cool’ system all the way up in the vanes. Versioning the kernel is a different challenge than the VM or language since the vanes interoperate with one another.
78+
79+We have a formalized scheme for how we think kelvin versioning should work at the Arvo level in process now. This year we’ll start tagging each version of the kernel with an appropriate kelvin. This scheme means not only applying a version tag to each kernel, but also making sure there are transition functions written between versions. Additionally, it will include a versioning mechanism for the interface between the kernel and the runtime.
80+
81+Let’s dive into the details, but just a bit:
82+
83+The mechanism for the kernel is pretty simple. In short, we’ll enforce that everything above a particular layer must ‘cool’ (or upgrade, by shedding a version number) when something underneath drops a version number. This ensures that the system can’t fall into an incorrect state due to simple incompatibility. For example, if Hoon changes, all of the Arvo kernel must similarly drop a kelvin to ensure compatibility.
84+
85+The 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.
86+
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.
88+
89+With 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.
90+
91+But — in order for that scene in 2059 to actually work, these upgrade mechanisms have to be in place. As your ship upgrades itself, the system needs a way to ensure that each upgrade gets applied in a compatible way. Right now we’re careful about deploying over the air updates such that they don’t break, but that’s obviously not sustainable.
92+
93+Once this versioning scheme gets released later this year, there’s nothing technically preventing you from starting a late-2019 Urbit in 2039. We hope you’ll use it a lot in the interim — but this is an essential feature for a decentralized system that claims to upgrade itself. We’re really excited to get it implemented.
94+
95+These three areas of work are all due to complete later this quarter. This gets us something that’s much more resilient than what we’ve ever had before. Given a stable system, we can actually start to put some serious weight on it.
content/blog/the-100-year-computer.mdnew file+26
@@ -0,0 +1,26 @@
1++++
2+title = "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"]
6+[extra]
7+author = "Galen Wolfe-Pauly"
8+ship = "~ravmel-ropdyl"
9+image = "https://media.urbit.org/site/posts/essays/100-year-computer-1.png"
10++++
11+
12+![](https://media.urbit.org/site/posts/essays/100-year-computer-1.png)
13+
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.
15+
16+One way to think about Urbit is as a 100-year computer.
17+
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.
19+
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.
21+
22+In 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.
23+
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.
25+
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.
content/blog/the-dao-as-a-lesson-in-decentralized-governance.mdnew file+321
@@ -0,0 +1,321 @@
1++++
2+title = "The DAO as a Lesson in Decentralized Governance"
3+date = 2016-06-24
4+description = "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"]
6+[extra]
7+author = "Curtis Yarvin"
8+ship = "~sorreg-namtyv"
9++++
10+What's the right lesson for the decentralization community to
11+learn from the collapse of the DAO?
12+
13+Perhaps 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.
16+
17+## Decentralization theater considered harmful
18+
19+In Dijkstra's terms: decentralization theater [considered harmful](https://en.wikipedia.org/wiki/Considered_harmful).
20+
21+_Decentralization theater_ means any system that produces not
22+decentralization, but the appearance of decentralization.
23+[Security
24+theater](https://en.wikipedia.org/wiki/Security_theater) is the enemy of real security; decentralization
25+theater is the enemy of real decentralization.
26+
27+A network without decentralization theater is one that admits:
28+
29+- any network is a digital state with a central government.
30+- any new state is born at war with full emergency powers.
31+- limiting and/or eliminating governance is a slow, hard task.
32+
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
35+solved it, before actually solving it, is not a way to solve it.
36+
37+## Decentralization and legitimacy
38+
39+Steve Randy Waldman is not alone in pointing out that [a
40+blockchain is a
41+parliament](http://www.interfluidity.com/v2/6581.html). It's
42+just the technical reality that a majority of miners in a
43+proof-of-work blockchain, or stakeholders under proof of stake,
44+have the mathematical power to govern the network absolutely.
45+
46+But 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.
50+
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
53+clue 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
56+blatantly illegitimate.
57+
58+From 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
62+hanged for an ox, and go through with the full rollback.
63+
64+## Illegitimacy and belligerency
65+
66+Within 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.
70+
71+And judged as an act of war, a DAO rollback is _exactly right_.
72+Ethereum is not dealing with a "participant." It is dealing with
73+a pirate, a thief, _hostis humani generis_.
74+
75+As 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.
78+The right place for this fool is the supermax, not the Riviera.
79+
80+But does Ethereum really want to be at war? And if Ethereum is
81+at war -- and this certainly isn't the only pirate in the sea --
82+how does it become decentralized? If Ethereum is at war, where
83+there is no law, how can it achieve its goal of creating a world
84+where code is law?
85+
86+But we really shouldn't panic. It is actually possible to go
87+from wartime government to peacetime government, from absolute
88+martial law to absolute rule of law. It is just nontrivial.
89+It's a political engineering problem that can't be ignored.
90+If it has to be solved, it should be solved properly.
91+
92+What really doesn't work is to declare martial law, execute all
93+traitors, terrorists and enemies of the state, then declare that
94+elections will proceed as scheduled next week. If the goal is
95+the decentralized rule of code as law, a rollback takes an
96+enormous step backward. Reversing this setback isn't trivial.
97+
98+Should Ethereum actually go to war? Or should it just let the
99+hacker win? Clearly, from a pure blockchain perspective, the
100+only correct thing to do is let the DAO burn -- as a painful
101+warning to all future contract authors and participants.
102+
103+At 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
106+chooses war needs a plan to win that war, and return to peace.
107+
108+## Sovereignty is conserved
109+
110+For a government to even have the power to consider wartime
111+measures, a government has to exist in the first place.
112+
113+Again, we can't remind ourselves too often that a blockchain just
114+puts absolute authority in the hands of the miners. We just
115+think of this power in terms of the law it's supposed to enforce.
116+But the two are different -- at least in wartime.
117+
118+Why is it so hard to eliminate unaccountable power? Who watches
119+the watchmen? The German legal scholar [Carl
120+Schmitt](https://en.wikipedia.org/wiki/Carl_Schmitt) defined the
121+problem well when he wrote: "the sovereign is who decides the
122+exception."
123+
124+In the American regime, the Supreme Court is sovereign by
125+Schmitt's definition. We have a complex system of laws, which
126+are not formal code but in some ways aspire to be; above it, we
127+have 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
130+this limit, but it's an infinity that we can't actually reach.
131+
132+Schmitt's exception principle can be rephrased as "sovereignty is
133+conserved." There is always someone who answers to nobody. We
134+cannot eliminate government; the best we can do is tame it.
135+
136+One way to think of the problem of reducing exceptional force to
137+zero 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
140+from this orderly, self-sustaining equilibrium, the more energy
141+must be applied to return it to vertical.
142+
143+Vitalik seems to have grasped more or less Schmitt's point:
144+"_Intent is fundamentally complex_... we believe that we value
145+things like 'fairness', but it's hard to define what fairness
146+even means."
147+
148+If 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
151+define fairness -- yet need to enforce some clear vision of
152+fairness -- sovereignty remains conserved.
153+
154+## Bitcoin, a blockchain at peace
155+
156+Bitcoin has done an excellent job of freezing the war power of
157+its own "parliament." Ironically, mining power in Bitcoin is
158+quite centralized -- a small number of Chinese mining-pool
159+managers, who have every opportunity to collude, could roll back
160+anything. But they never have and they probably never will.
161+
162+Even if a single pool controlled 51% of Bitcoin mining power,
163+they'd have no incentive to break the rules -- quite the
164+converse. We equate physical decentralization with limited
165+governance, perhaps because we think of the physical difficulty
166+of coordination as the main protection against arbitrary power.
167+
168+Bitcoin shows that this isn't true. As far as we can tell,
169+Bitcoin would keep working fine if there was only one miner.
170+This uni-miner would have still have no incentive to corrupt the
171+network -- though another party, such as a real government, might
172+have an incentive to coerce the miner.
173+
174+The important success of Bitcoin is the collective acceptance --
175+mathematically false, but politically true -- that rollbacks in
176+Bitcoin are inconceivable. Bitcoin has governance problems, but
177+they'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.
181+
182+## Ethereum's dilemma
183+
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
188+first rollback.
189+
190+In retrospect, the great mistake here was that Ethereum didn't
191+know 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.
194+
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,
198+mechanically administered law, law without judges, is a very
199+different thing from ordinary human law.
200+
201+What 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
204+Ethereum's code per se -- although Solidity doesn't seem terribly
205+well designed for preventing these pitfalls -- but the human
206+understanding of its capabilities and limits.
207+
208+A rollback acknowledges this. It acknowledges that Ethereum
209+wasn't ready for complete self-government, and _someone_ needed
210+to have stopped the DAO from trading. It's not quite clear what
211+the principle behind the rollback was.
212+
213+Perhaps the best kind of DAO rollback would be a rollback which
214+understood this error fully, and acknowledged that -- for the
215+moment -- Ethereum needs a sovereign government, with the power
216+to restrict and/or steward contracts.
217+
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,
221+in the present state of the technology, might well choose to vet
222+all contracts centrally _before_ they started trading.
223+
224+Would this be a permanent feature? Certainly not -- it would be
225+a way for the community to collectively define a good contract.
226+Once we know what a responsible, well-tested, non-scammy Ethereum
227+contract looks like, it's much easier to return to the principle
228+of _caveat emptor_ and let good contracts outcompete bad ones.
229+
230+But after the DAO hack, how does anyone trust any contract?
231+Arguably, Ethereum is ready to be decentralized only when users
232+are able to make this decision rationally, and get it right.
233+This work simply hasn't been done.
234+
235+Perhaps 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
238+executing all traitors and enemies of the people, the generals
239+will immediately restore democracy and the rule of law."
240+
241+The "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
244+will certainly happen, will produce yet another coup -- or at
245+least a food fight over whether to have a coup. This is the path
246+to a "digital banana republic," where the tattered illusion of
247+law barely conceals the real law of nature.
248+
249+The 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
252+to be a process -- or the dream of code as law will drift further
253+away.
254+
255+Having 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
258+government is born in a state of chaos and war.
259+
260+The 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
263+anyone can think about letting go, someone needs to actually lift
264+it. To reach law, first enforce peace.
265+
266+## Constitutional structure
267+
268+One of the governance problems of blockchains, related to the
269+fundamental error of decentralization theater, is the failure to
270+build deliberative institutions on top of the "parliament of
271+miners." Voting by proof of work is great, especially if the
272+majority 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.
275+
276+But blockchain governance would be considerably improved if the
277+miners actually had a formal way to delegate their power to a
278+structured institution that represented them. Both Bitcoin and
279+Ethereum have foundations and/or core teams, but authority in
280+these institutions isn't tied in any way to actual mining power.
281+Informal politics fills this void with personality cults and
282+eloquent blogposts, all hoping to create collective agreement
283+among the actual voting miners.
284+
285+History shows this is not a great way to run a railroad.
286+Misalignment between a fundamental power, like the miners, and a
287+group purporting to represent them, like the foundations, is
288+inherently dangerous.
289+
290+What's the alternative? An actual constitution. Perhaps the
291+first smart contract that Ethereum needs is not the DAO, not even
292+well-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
295+technical tools it needs!
296+
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,
299+who needs it?
300+
301+## A quick Urbit plug
302+
303+Technically, Urbit needs governance much more than Ethereum.
304+Decentralization remains our goal -- but it's a long-term goal.
305+Decentralization theater has never even been a temptation. It's
306+just technically impossible.
307+
308+For example, until the Urbit OS and language (Arvo and Hoon) are
309+frozen and perfect -- which, unlike Nock, will take a while --
310+Urbit is still "evergreen" -- it still needs automatic hotpatches
311+from the network.
312+
313+Whatever institution signs these updates is, by any standard, an
314+absolute government. It's as if the Ethereum Foundation could
315+push 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.
318+
319+Read our [interim
320+constitution](http://urbit.org/essays/interim-constitution) and our
321+[beliefs and principles](http://urbit.org//essays/beliefs-and-principles).
content/blog/the-missing-middle.mdnew file+53
@@ -0,0 +1,53 @@
1++++
2+title = "The Missing Middle"
3+date = 2020-05-26
4+description = "Urbit stars can facilitate a flexible continuum of community norms."
5+[extra]
6+author = "Nicholas Simmons"
7+ship = "~simfur-ritwed"
8+image ="https://media.urbit.org/site/posts/essays/missing-middle.png"
9++++
10+
11+<br>
12+
13+<img class="ba" src="https://media.urbit.org/site/posts/essays/missing-middle.png">
14+
15+<br>
16+
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+
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+
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+
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+
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+
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+
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+
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+
33+Without 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.
34+
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+
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+
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+
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+
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+
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+
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+
49+We 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.
50+
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+
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.
content/blog/the-state-of-landscape.mdnew file+75
@@ -0,0 +1,75 @@
1++++
2+title = "The State of Landscape"
3+date = 2019-05-16
4+description = "An update on the state of Landscape and the Urbit network."
5+aliases = ["/posts/essays/the-state-of-landscape", "/posts/the-state-of-landscape"]
6+[extra]
7+author = "Galen Wolfe-Pauly"
8+ship = "~ravmel-ropdyl"
9+image = "https://media.urbit.org/site/posts/essays/the-state-of-landscape-1.png"
10++++
11+
12+![](https://media.urbit.org/site/posts/essays/the-state-of-landscape-1.png)
13+
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.
15+
16+Landscape 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/).
17+
18+## The Broad View
19+
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.
21+
22+In 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.
23+
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.
25+
26+Over 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.
27+
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.
29+
30+Anyway, let’s show off some of the specifics, and give an update on this experiment so far.
31+
32+## A Quick Tour
33+
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.
35+
36+For the most part, this happens through a web interface that you can access at `https://ship.arvo.network` or via `localhost:80`.
37+
38+There’s also an iOS app, [available in the app store](https://itunes.apple.com/us/app/landscape-urbit/id1393148862), that you link to your ship the same way you log in through a browser.
39+
40+## Landscape: The Bad Parts
41+
42+What’s keeping us from asking others to use this thing more aggressively? Let’s walk through the reasons (while keeping in mind, they’re all [things we’re working on](/posts/essays/2019-5-roadmap/)):
43+
44+### 1 - Arvo has rough spots
45+
46+They 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.
47+
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.
49+
50+The 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.
51+
52+Relatedly, we have occasionally been seeing errors caused by the Arvo network being slow to register keys from the blockchain. If you’re a newly registered Azimuth point, and your keys were just put on-chain, it can take some time for that change to propagate. This can result in a confusing situation for new ships.
53+
54+### 2 - There’s no ‘individual continuity breach’
55+
56+One 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.
57+
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.
59+
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.
61+
62+This is another unacceptable bug for anything we truly rely on.
63+
64+### 3 - There are no push notifications, yet
65+
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.
67+
68+We 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.
69+
70+## What We’ve Learned and What We’re Doing
71+
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.
73+
74+We 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.mdnew file+23
@@ -0,0 +1,23 @@
1++++
2+title = "The Understanding Urbit Podcast"
3+date = 2020-04-03
4+description = "An interview-based podcast series about the Urbit project, as told by those working on it."
5+[extra]
6+author = "Arthur Falls"
7+ship = "~satsyt-sogleb"
8+image ="https://media.urbit.org/site/posts/essays/uu-podcast.png"
9++++
10+
11+<br>
12+
13+<img class="ba" src="https://media.urbit.org/site/posts/essays/uu-podcast.png">
14+
15+At the end of January, the team at Tlon invited me to spend some time at their San Francisco office and to create a podcast series about Urbit. The idea was to produce an interview-based series about the project told in the words of those working on it. In this modest goal, I think we were very successful. Beyond a transactional description, however, we captured a range of perspectives of the flaws in our current computing landscape and visions for how Urbit will alter it.
16+
17+Over the course of seven episodes, the interviews explore subjects ranging from the philosophy of technology to the performance optimization of Nock execution. Most are non-technical, but even the technical ones will be understandable and entertaining to a non-technical audience. That latter fact is the result of just how much fun the Tlon team is to be around.
18+
19+The series can be found on iTunes, Spotify, and most other streaming platforms.
20+
21+<iframe style="border: none" src="//html5-player.libsyn.com/embed/episode/id/13669184/height/90/theme/custom/thumbnail/yes/direction/backward/render-playlist/no/custom-color/000000/" height="90" width="100%" scrolling="no" allowfullscreen webkitallowfullscreen mozallowfullscreen oallowfullscreen msallowfullscreen></iframe>
22+
23+We begin our journey with Urbit veteran Galen Wolfe-Pauly, who introduces the project and its design principles while reflecting on the collective Stockholm syndrome we suffer in the grasp of existing computing models. We learn a bit about Galen’s background in architecture, and the importance of invisible technology.
content/blog/the-urbit-address-space.mdnew file+294
@@ -0,0 +1,294 @@
1++++
2+title = "The Urbit Address Space"
3+date = 2016-05-16
4+description = "An overview of Urbit's cryptographic address space."
5+aliases = ["/posts/essays/the-urbit-address-space", "/posts/the-urbit-address-space"]
6+[extra]
7+author = "Galen Wolfe-Pauly + Curtis Yarvin"
8+ship = "~ravmel-ropdyl + ~sorreg-namtyv"
9+image = "https://storage.googleapis.com/media.urbit.org/site/posts/essays/the-urbit-address-space.jpg"
10++++
11+![](https://storage.googleapis.com/media.urbit.org/site/posts/essays/the-urbit-address-space.jpg)
12+
13+## Basics
14+
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,
17+just read these simplified basics.
18+
19+An Urbit identity, or "ship," is a string like `~firbyr-napbes`. It
20+means nothing, but it's easy to remember and say out loud.
21+`~firbyr-napbes` is actually just a 32-bit number, like an IP address,
22+that we turn into a human-memorable string.
23+
24+Technically, 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
27+the network friendly, by making spam and abuse expensive.
28+
29+A 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
32+name is just a scrambled base-256 representation of the number.)
33+
34+A 32-bit ship (like `~firbyr-napbes`) is called a "planet." A 16-bit
35+ship (like `~pollev)` is a "star." An 8-bit ship (like `~mun`) is a
36+"galaxy." A planet is an identity for an independent, adult human.
37+Stars and galaxies are network infrastructure.
38+
39+Each planet or star is launched by its "parent," the star or galaxy
40+whose number is its bottom half. So the planet `~firbyr-napbes`,
41+`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
43+`~mun` and all galaxies is `~zod`, `0`.
44+
45+If Bitcoin is money, Urbit is land. Much as all real-estate titles in
46+England trace back to William the Conqueror, all certificates in Urbit
47+trace back to `~zod`.
48+
49+But this universe is worthless unless dispersed. It's already quite
50+well fragmented. And as it grows distributed, it grows decentralized.
51+The endpoint is a virtual city of 4 billion (`2^32`) citizens, all
52+owners of their own independent digital identities. The stars and
53+galaxies continue as a federated governance and service network.
54+
55+This 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
59+intuitively, a ship is a sort of pronounceable phone number.
60+
61+And once Urbit is built, no one owns the city. No one can control it.
62+It does need governance; but it governs itself as a digital republic.
63+
64+## Details
65+
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
68+comprehensive treatment is in the [whitepaper](https://media.urbit.org/whitepaper.pdf)).
69+
70+### Design goals
71+
72+An identity system has three goals: a name wants to be secure,
73+human-meaningful, and decentralized. A principle called "Zooko's
74+triangle" says that a practical identity system can achieve any two of
75+these goals.
76+
77+The 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
80+meaning (Urbit is not competing with the DNS), and postpone
81+decentralization. These tradeoffs buy us a simple system that can
82+actually be built.
83+
84+### Comparison to existing identity layers
85+
86+The Internet doesn't have anything like Urbit ships, so you may need
87+to stretch your brain a little here.
88+
89+There are three levels of naming on the Internet: raw, numeric IP
90+addresses (like `126.78.92.112`), domain names (like
91+`foobar.com`), and user identities (like `galen@tlon.io` or
92+`@galenwp`).
93+
94+Urbit (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
98+name into the DNS, at `ship.urbit.org`.
99+
100+(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
102+single-signon API which lets any Web server accept Urbit logins, like
103+a normal social login -- but not captive to any central mainframe.)
104+
105+### Cryptographic ownership
106+
107+You own an Urbit ship cryptographically, like a Bitcoin wallet. But
108+Urbit doesn't use a blockchain or mining.
109+
110+You transfer a ship by signing a new public key with the old private
111+key, then broadcasting the signature. Any urbit that receives this
112+new certificate will no longer trust the old key.
113+
114+Urbit is digital land, not digital money. A currency needs to support
115+high-frequency, zero-friction transfers. Real estate transfers are
116+low frequency and high friction, so the "double spend" problem (which
117+mining solves) is much less pressing.
118+
119+Don't expect urbits to be tradeable on cryptocurrency exchanges. A
120+trade 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
122+bulky certificate isn't free, since it slows down new connections.
123+
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,
127+and every reason not to.
128+
129+## Moons and comets
130+
131+In the general case, a ship is actually a 128-bit number. A full
132+table of ship classes:
133+
134+```
135+8 bits galaxy router ~syd
136+16 bits star router ~delsym
137+32 bits planet human ~mighex-forfem
138+64 bits moon device ~dabnev-nisseb-nomlec-sormug
139+128 bits comet bot ~satnet-rinsyr-silsec-navhut--bacnec-todmeb-harwen-fabtev
140+```
141+
142+Moons 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
145+randomly around the universe.)
146+
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
149+identity, except that the name is a mouthful and everyone will assume
150+you're a bot.
151+
152+### Scarcity, reputation, friendliness and trust
153+
154+A 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
158+get planets trivially and for free.
159+
160+Urbit 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
163+changing human nature, just creating the right economic incentives.
164+
165+Most forms of network abuse are "Sybil attacks": they rely on an
166+infinite supply of fresh identities. Scarcity makes reputation work.
167+Spam is a business; if the cost of a new planet exceeds the amount of
168+money you can make by spamming from that planet until its reputation
169+is trashed, there will be no spam.
170+
171+Shady stars and galaxies that sell blocks of planets to spammers will
172+also develop reputations as "bad neighborhoods," damaging the value of
173+the whole block. Abuse at any level is designed to be
174+counterproductive and economically self-terminating.
175+
176+Urbit has no reputation system at all at the moment, simply because
177+we're so small that friendliness is automatic. The clear and rigorous
178+structure of the address space is not a reputation system; it is a
179+platform on which any number of such systems can and should be built.
180+But we can't build one until we need one.
181+
182+### Initial allocation and rationale
183+
184+In cryptocurrency terms, Urbit is "100% premined." Why? Three
185+reasons.
186+
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
189+development, the project needs to capture the potential value of its
190+own real estate.
191+
192+Three, 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
195+motivations to decentralize.
196+
197+One, the more decentralized Urbit is, the more Urbit is worth. Two,
198+the only way for Urbit to fund its own development is to homestead its
199+own real estate.
200+
201+Urbit was created by Curtis Yarvin, who has distributed the 256
202+galaxies as follows (allocation as of June 1, 2016):
203+
204+95, to the [Tlon Corporation](../company). 50, to urbit.org, the future
205+community foundation. 40, to Tlon employees and their family members
206+(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
208+individuals, who donated to the project, contributed code or services,
209+won a contest, or were just in the right place at the right time.
210+
211+What's critical is that the whole system is unlikely to collapse back
212+into a single landlord. This is why we've intentionally scattered
213+Urbit's ownership across a diverse set of entities.
214+
215+Furthermore, we've defined informal conventions designed to motivate a
216+healthy ownership structure by punishing violators with reputation
217+cost. Address blocks should only split, never merge; galaxies and
218+stars should be owned by different parties; galaxies should be owned
219+by true individuals, not corporations. Urbit does not live up to
220+these ideals at present, but must always progress toward them.
221+
222+### Federated services, adoption and escape
223+
224+Urbit is a peer-to-peer network. Urbits that live behind a firewall
225+or 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
227+launched all its children.
228+
229+There's no way to enforce this responsibility. So a star or planet
230+can 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
232+other parent is willing to adopt you, you're probably a bad actor.
233+
234+Supernode routing is just one example of why you need a parent. A
235+mature Urbit will naturally develop all kinds of other _federated
236+services_ -- 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
239+actors at this level should be rare.
240+
241+Especially 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,
245+like Nock, and turn off kernel updates; but this will take years at
246+least.)
247+
248+### Code is law: seeing like a pattern language of great cities
249+
250+Constitutional innovation is dangerous. Our vision of digital
251+governance isn't ours, but is synthesized as best we can from the work
252+of four great 20th-century thinkers: the legal scholar Lawrence
253+Lessig, the political scientist James C. Scott, the urbanist Jane
254+Jacobs and the architect Christopher Alexander.
255+
256+All 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,
259+that decides who owns a Bitcoin wallet.
260+
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
263+real world, _laissez-faire_ is always necessary, never sufficient.
264+Governance is a human universal.
265+
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
268+grow up into a true city-state: a self-governing digital republic.
269+This pattern is not just blind clinging to Anglo-American tradition;
270+like every prudent constitution, it fits the actual virtues and vices
271+of its target population.
272+
273+Urbit's galactic hierarchy resembles the natural patterns we find in
274+many existing human political systems. As Alexander wrote:
275+
276+> 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.
281+
282+We adapt Alexander's vision to a digital republic as the pattern that
283+_authority is proportional to property_. This pattern already has a
284+name in the cryptocurrency community, which calls it _proof of stake_.
285+Urbit's launch hierarchy is a sort of built-in proof of stake.
286+
287+Another governance pattern, a political cliche but no less valuable
288+for it, is the system of checks and balances. The address space of
289+Urbit is covered by three independent tiers, galaxies, stars and
290+planets; which should govern? The obvious design is a three-chambered
291+legislature balanced against itself.
292+
293+For more on Urbit's governance design, see our [beliefs and
294+principles](/posts/principles/) and our [interim constitution](/posts/constitution/).
content/blog/tools-of-our-own.mdnew file+73
@@ -0,0 +1,73 @@
1++++
2+title = "Tools of Our Own"
3+date = 2020-05-13
4+description = "What is a digital environment? What does it mean to shape your own digital environment?"
5+[extra]
6+author = "Matilde Park"
7+ship = "~haddef-sigwen"
8+image ="https://media.urbit.org/site/posts/essays/tools-of-our-own-1.png"
9++++
10+
11+<br>
12+
13+<img class="ba" src="https://media.urbit.org/site/posts/essays/tools-of-our-own-1.png">
14+
15+<br>
16+
17+> People need only not to obtain things, they need above all the freedom to make things among which they can live, or give shape to them according to their own tastes, and to put them to use in caring for and about others.
18+>
19+> <cite>Ivan Illich, <em>Tools for Conviviality</em></cite>
20+
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+
23+After 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.
24+
25+The [Rube Goldberg machine](https://en.wikipedia.org/wiki/Rube_Goldberg_machine) made out of aligning these tools in increasingly virtuosic, but also increasingly restrained and mechanical ways, felt like constructing an exoskeleton out of prefab parts. The person in my social group closest to constructing the full range of human movement became a legend. But let's be honest: none of us came even close.
26+
27+And it's nobody's distinct fault that the experience of aligning all these disparate services into a workflow is a skill in itself. It's a collective restriction that comes from the systems beneath.
28+
29+<br>
30+
31+<img class="ba" src="https://media.urbit.org/site/posts/essays/tools-of-our-own-2.png">
32+
33+### Systems as masters
34+
35+> If you don't understand a system you're using, you don't control it. If nobody understands the system, the system is in control.
36+>
37+> <cite>Philip Monk, <a href="https://urbit.org/blog/precepts/">Precepts</a></cite>
38+
39+If you asked any of the creators of the social tools we use today what their mission was, it would seem neutral, a public good. To "bring the world closer," to "make a more open and connected world," to "easily see what's happening in the world." Ignore the fact that the net effects of their products are far more mixed than their mission suggests: for many users, the tools themselves come second to the power the tools have in capturing their social graph.
40+
41+We just want to be where our friends are, to see who knows whom, to see a new friend vouched for by our common connections.
42+
43+Why is the social graph even a consideration when choosing a tool? Why do I have to know who has accounts where, how they choose to assemble their digital body, so that I can see that it exists?
44+
45+For a tool like a microblog—a bunch of entries in a database with metadata, usually threaded—the attachment of the social graph capture becomes not only an underlying appeal to us when choosing to use it, but also to the tool’s creators when trying to justify its existence.
46+
47+In this example, you could say that every social Internet product is trying to make up for its missing ability to connect coherent identities underneath. The battle becomes a matter between the stagnant empire of who owns the graph versus the various attempts to create a secure identity primitive as a layer of the Internet.
48+
49+But this is crazy: for decades, an aspect of the Internet stack that necessitated the creation of platforms—the ability to talk to other computers directly and to, privately, opt in, organize an array of devices as belonging to an identity—has driven not only the financial incentives of every product, but the use case for every person in the equation. A practically unrelated problem emerged that was too hard to wrangle and solve, and so it became the master.
50+
51+And 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.
52+
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+
55+<br>
56+
57+<img class="ba" src="https://media.urbit.org/site/posts/essays/tools-of-our-own-3.png">
58+
59+### The collective body
60+
61+> “Autonomy” means that we make the **worlds that we are** grow.
62+>
63+> <cite>Tiqqun, <em>The Cybernetic Hypothesis</em>
64+
65+So why does this matter for us? Me and you and everyone we know? We put up with the cost all the time. But the limitations of our tools—on the vulnerable side of a power dynamic that, unbeknownst to everyone involved, functions as a catalyzed and increasingly accelerated system bringing out the worst in all of us—range from the everyday annoyances to a pervasive alienation, an information malaise.
66+
67+You have to ask yourself, "Why are we doing this again?"
68+
69+These days I find myself away from broadcast tools and more in the insular channels of my friend groups. What I want from technology is to share life with my friends; to be given the opportunity, and the power, to share that life, and all it includes… showing them care, or sharing the bits of knowledge that seem important to us as a group.
70+
71+To reinforce the fulfilment of collective potential in whatever direction our groups take off in. Some of my friends watch stuff together; some of my friends remark on goings-on; some of my friends research together; all communicate entirely differently. Not all of them belong on "IRC, but for gamers," or "IRC, but for highly productive and extremely important teams." And yet, that's where we are.
72+
73+Forget the prefab parts: a proper exoskeleton for our collective body evaporates; and we face the sunlight in whatever direction we choose. The ability to extend our shared spaces collectively, with each of our groups of friends and collaborators, using our own computers: that's Urbit.
content/blog/toward-a-frozen-operating-system.mdnew file+254
@@ -0,0 +1,254 @@
1++++
2+title = "Toward a Frozen Operating System"
3+date = 2017-05-10
4+description = "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/"]
6+[extra]
7+author = "Curtis Yarvin + Galen Wolfe-Pauly"
8+ship = "~sorreg-namtyv + ~ravmel-ropdyl"
9++++
10+Is 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?
12+And if so, why would we want a frozen OS?
13+
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
16+[great essay](http://www.paulgraham.com/hundred.html) about the
17+"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.
19+
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?
23+
24+## Scope of the problem
25+
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
28+doesn't need to.
29+
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
32+boots into," hardware always changes and so will the OS.
33+
34+A 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
38+opaque: it exports Linux system calls.
39+
40+Within 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
42+[trusted codebase](https://en.wikipedia.org/wiki/Trusted_computing_base): code
43+is system software, if compromising it would compromise the whole system.
44+
45+## Infinite maturity
46+
47+It'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
50+goals are infinite.
51+
52+Systems designed to diverge infinitely (with normal X.X.X semantic versioning),
53+even those designed to converge infinitely (as with
54+[Knuth versioning](http://www.tex.ac.uk/FAQ-TeXfuture.html)), also achieve
55+maturity, often great maturity, without being quite frozen.
56+
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
59+correct C compilers will compile on any future correct C compiler.
60+
61+But, 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.
65+
66+The point of a frozen OS is to shoot for _infinite_ maturity. Obviously a
67+frozen platform is compatible forever in both directions.
68+
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.
72+
73+But 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
75+document made in the future.
76+
77+The dream of absolute zero is an OS whose core components are so simple, so
78+boring, 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
81+each quirk, complexity, and creeping feature, until the system is so boring and
82+obvious that no one even wants to change it.
83+
84+## Kelvin versioning
85+
86+"Kelvin versioning" is one way to track a project designed to be frozen.
87+
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
91+incentive for the project to track its own progress accurately.
92+
93+(Kelvin versioning isn't useful only at lifecycle scale. It can be used for any
94+development process with an irreversible end — as build numbers for a release,
95+for example.)
96+
97+## The palm-tree dependency model
98+
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
101+the parts of a frozen OS?
102+
103+One way to think about dependencies across a whole OS is the "palm-tree model."
104+Fundamentally, there are two kinds of components in a system: "exclusive"
105+components (where we have to choose one version of the code), and "inclusive"
106+ones (where different users can see different versions).
107+
108+The 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.
111+
112+The 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
114+many situations _one_ app needs to be able to use two different versions of the
115+same library.
116+
117+## The palm trunk: telescoping Kelvins
118+
119+Any subsystem that serves as any kind of platform is exclusive, since anything
120+that 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
122+tall — and include components which are technically in userspace.
123+
124+The right way for this trunk to approach absolute zero is to "telescope" its
125+Kelvin versions. The rules of telescoping are simple:
126+
127+1. 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.
129+
130+2. Whenever the temperature of A (the platform) declines, the temperature of B
131+(the tool) must also decline.
132+
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.
136+
137+Of course, if B itself is a platform on which some higher-level tool C depends,
138+it must follow the same constraints recursively.
139+
140+The 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
143+it's written against, because when A chills, B must also chill.
144+
145+If A could chill without B chilling, we could modify C to use new features of A.
146+Then our new C would silently fail to work on an A-B stack which had not
147+received the A update.
148+
149+## The palm fronds: total flexibility
150+
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
153+frozen.
154+
155+The 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
158+environments that create exclusion problems in userspace — for instance, that
159+compel a single process to choose one version of a library when a diamond
160+dependency exists.
161+
162+There 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
164+maintainer 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
166+security-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,
168+so it needs a maintainer and an update pathway anyway.
169+
170+## Urbit: status and prospects
171+
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
174+getting there.
175+
176+Urbit, a clean-slate functional OS, has been under development since 2002. It
177+took a decade (as a one-man project) just to build a prototype of a freezable OS.
178+The result in 2017 (now with a small company) is a telescoping Kelvin stack of
179+layers from VM to UI.
180+
181+At 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
184+change at this point would be both very unlikely and very difficult to
185+implement.
186+
187+Urbit'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
190+change; Hoon is perfectly serviceable but has some well-known rough spots.
191+
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
194+system library, then 12,000 lines of Arvo modules: a peer-to-peer network, a
195+PKI and private ledger, a revision-control system, an HTTP gateway, a functional
196+build system, and an application sandbox. A trivial working system needs
197+another 5,000 lines for basic chat and shell apps.
198+
199+We 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
201+last year; we'll assign Kelvins once this code (which now compiles) is tested
202+into 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.
204+
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
207+distributes its own updates through subscriptions in its own revision-control
208+system.)
209+
210+The actual status of Urbit is that in 2017, we hope to make our last
211+discontinuous 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
213+alive until today's Urbit data lives forever.
214+
215+Even committing to continuity is a significant step toward the frozen OS,
216+because 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
218+this is Nock.
219+
220+## The style of convergent system software
221+
222+We're obviously in no position to declare victory at any layer above Nock, but
223+aiming at absolute zero creates a system design style we think works very well —
224+even if we never get to zero.
225+
226+Deep, onion-like layering is essential. A thin layer has no room to grow. A
227+good 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
230+Urbit layers over a frozen axiom system.
231+
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
235+they do change — like crypto algorithms — are special cases, easily
236+encapsulated. And even these changes can be expected to slow down in the long
237+term.
238+
239+Perhaps 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
242+essentially invulnerable to any significant non-cosmetic improvement.
243+
244+The lesson: when we see a system that seems to want to expand indefinitely, we
245+can and should look for a layer division within this system, separating an inner
246+layer that tends to converge from an outer layer that naturally diverges.
247+Layering is what distinguishes true system software from the giant balls of mud
248+that all deep codebases want to become.
249+
250+Are 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.
252+
253+As usual, comments are on fora. Check out
254+[this thread](https://urbit.org/fora/posts/~2017.5.12..20.30.11..0050~/).
content/blog/toward-a-new-clay.mdnew file+1006
@@ -0,0 +1,1006 @@
1++++
2+title = "Toward a New %clay"
3+date = 2016-07-14
4+description = "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"]
6+[extra]
7+author = "Curtis Yarvin"
8+ship = "~sorreg-namtyv"
9++++
10+
11+TLDR: (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!
14+
15+This explanation does not (or at least should not) require you to
16+know anything about Urbit.
17+
18+### But %clay is already pretty cool
19+
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
22+talk about what it is and why it's cool.
23+
24+`%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
28+currently uses `%clay` to distribute live hotpatches; we
29+transparently upgrade the whole network with one checkin.
30+
31+### Compared to other revision-control systems
32+
33+`%clay` is clearly a vanilla DVCS in the modern `git` style. Of
34+deployed DVCS these days, `%clay` is probably closest in spirit
35+to `bzr` or maybe `fossil`.
36+
37+Obviously, as a part of a larger whole, you would expect any
38+Urbit RCS to be brutally spartan. `%clay` is. It's even more
39+spartan than `bzr`.
40+
41+(In fact, it's really too spartan to fully use at the moment. We
42+ourselves still use `%clay` mainly as a distribution system, and
43+do all internal development on GitHub. This is because the
44+present `%clay` lacks a few little conveniences, like commit
45+messages. See upgrades, below.)
46+
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
49+high-level system, then describe what we think should change
50+about it.
51+
52+### Anatomy of a DVCS
53+
54+A DVCS is a historical state graph. A point in this graph is a
55+snapshot of some tree-structured system, like a filesystem.
56+
57+These snapshots, including recursive internal nodes, are stored in
58+a content-addressable store. Pointers in this store are used to
59+construct a revision graph, whose edges are edit and/or merge
60+actions. Some sort of namespace attaches meaningful names to
61+current revisions in this graph.
62+
63+There are six big questions in the design of a DVCS:
64+
65+- how are snapshots named?
66+- what is the data structure within a snapshot?
67+- how does it map to the Unix filesystem?
68+- how is the system queried?
69+- how is the revision graph defined?
70+- how does the content-addressable store work?
71+
72+## Anatomy of %clay
73+
74+A good way to summarize `%clay` (at present) is that its answers
75+to the first four questions are interesting, and its answers to
76+the last two are boring. We'll talk about all six, though.
77+
78+### Global namespace: [ship desk case]
79+
80+The permanent global name of a `%clay` snapshot is a `++beak`. A beak
81+is a triple: `[ship desk case]`.
82+
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
86+users have 32-bit addresses, which we map to four-syllable
87+synthetic names like `~sorreg-namtyv`.
88+
89+The `++desk` is a 4-letter word meaning "branch."
90+
91+The `++case` is a version, one of three kinds: a version sequence
92+number, a named label, or a date.
93+
94+In the Urbit path syntax, the beak is the first three segments of
95+the path: `/ship/desk/case/my/cat/picture`.
96+
97+In 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`
99+is the data at `/my/cat/picture` on your own ship, in the `%home`
100+desk, right now. Immutability doesn't have to be inconvenient.
101+
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
104+worried 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
107+better than this anyway.
108+
109+(Immutability is central to `%clay`. `git` merely adopted the
110+reflog. `%clay` was born in it, molded by it...)
111+
112+`%clay` is objective; each Urbit node hosts only one ship, but
113+treats domestic and foreign data (almost) the same way. If you
114+ask your `%clay` repository for someone else's data, it will
115+block the request until it gets the data, which it then caches.
116+At present, we always fulfill requests from the origin ship,
117+though in future we could certainly use it as a tracker.
118+
119+If `%clay` discards cached data, it keeps a hash, so that your
120+urbit can't violate the local illusion of immutability. We
121+can't, of course, prevent anyone else's ship from sending
122+conflicting claims in different directions. But we can prevent
123+programs on our own ship from hearing about them, meaning that we
124+retain local referential transparency.
125+
126+### Local structure: dome, arch, leaf and mark
127+
128+A `%clay` snapshot is called a `++dome`. A dome is the `%clay`
129+equivalent of a tree-structured filesystem.
130+
131+Each node in this tree is one uniform structure, an `++arch`,
132+which is both file and directory. A `++leaf` or data value in
133+this arch is a typed document.
134+
135+A logical document type is called a `++mark`. A mark is a
136+symbolic pointer to a Hoon source file, in the same dome, for an
137+engine that can validate, compare, and/or convert
138+documents of that mark.
139+
140+Let's go over arches and marks a little more closely...
141+
142+#### An arch is a uniform filesystem node
143+
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
146+namespace in general) has one kind of node, an `arch`:
147+
148+```
149+ ++ arch (pair (unit leaf) (map knot arch))
150+ ++ leaf (pair mark noun)
151+```
152+
153+An arch has an optional typed-data leaf, and optional named
154+children. In Unix terms, it's a file, a directory, or both. It
155+can'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
158+data they point to.
159+
160+The `++knot` names in an arch path are also a little special.
161+They're typed, in a sense; any knot can be parsed invertibly into
162+a typed atom. The atom is an arbitrary unsigned integer. Its
163+type (an `++aura` if you know Hoon) defines the semantics and
164+presentation of the atom: for instance, a symbol, a decimal,
165+a date, etc.
166+
167+Ultimately 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
169+key, in a standard and unambiguous way.
170+
171+Why uniform nodes? One, they map nicely to information trees
172+where a subtree may need some custom collective presentation,
173+not an automatically generated Apache style directory listing.
174+Two, non-uniform nodes introduce a whole pointless category of
175+node type conflicts -- for which life is far too short.
176+
177+#### A mark is an executable document type
178+
179+A mark is "like an executable MIME type." It's best defined as a
180+symbolic mapping from a filesystem to a schema engine.
181+
182+If 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
184+Urbit mark `%html`, you can functionally construct (using our
185+insanely powerful functional build vane `%ford`) a core which
186+can validate or normalize HTML, apply patch and diff logic, and
187+translate to and from other marks. `%ford` can even reason about
188+translation paths and construct multistep conversions.
189+
190+(Urbit does not actually have this super-smart `%html` mark right
191+now. But it probably should, huh. And this page was composed in
192+Markdown and translated to HTML by `%ford`.)
193+
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
196+Hoon source at `/===/mar/html`, which perhaps gets mapped into
197+your Unix filesystem at `$ship/home/mar/html.hoon`.
198+
199+This Hoon file is not self-contained. It has dependencies. The
200+`%html` mark may depend on various structures and libraries
201+elsewhere in Urbit. But the source code for all them is within
202+this dome.
203+
204+One 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
207+empty dome -- you'd have no mark source, and be unable to install
208+any validated files.
209+
210+Enforcing the rule that all domes are congruent (if only in that
211+they all contain the base system files) costs us nothing in the
212+implementation, does not inconvenience the user, and ensures that
213+weird collisions between non-parallel things don't happen.
214+
215+### Unix mapping and mounting
216+
217+Every DVCS is its own filesystem in a sense. But every DVCS
218+works by mapping and mounting itself, in some sense, to Unix.
219+
220+#### Mapping arches to Unix
221+
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
224+dot extension from the file's mark.
225+
226+So, supposing we have a leaf `foo` which is an HTML document
227+(mark `%html`), with two children `bar` and `moo`, also HTML
228+documents, in Unix we'll see:
229+
230+```
231+foo.html
232+foo/bar.html
233+foo/moo.html
234+```
235+
236+This maps invertibly back into `%clay`, and it looks perfectly
237+unremarkable from the Unix side. File completion sometimes gets
238+a little annoying.
239+
240+It would be if nice every possible Unix tree, even every
241+plausible 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
244+`%clay` finds a file mysterious, it won't track it.
245+
246+One 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
250+the new system should subset, not superset, the ancient formats.
251+
252+### Mounting desks to Unix
253+
254+If a `%clay` desk is _mounted_, it has a two-way live sync to
255+the Unix directory of the same name within the pier.
256+
257+When files in a mount directory change, `%clay` notices it
258+through `libuv` filesystem watching (ultimately `inotify()` or
259+`FSEvents`), computes diffs, and automatically commits them to
260+the desk. And if `%clay` creates a new version for its own
261+urbity reasons, it will revise the Unix files.
262+
263+Keeping all mounted files in the same Unix subdirectory makes it
264+easy to move the whole pier in a tarfile. Edits applied while
265+the `urbit` process isn't running will be detected and applied
266+the next time it starts.
267+
268+In conventional DVCS terms, `%clay` has a 1:1 static mapping from
269+branches to working directories. Why?
270+
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
275+shortage of disk space for source files? Our planet is running
276+out of inodes? Wut?
277+
278+### Queries, subscriptions and synchronization
279+
280+There are two ways to get data out of `%clay`: dereference the Urbit
281+namespace, or send a request/subscription. Sync is in userspace.
282+
283+#### Dereferencing the namespace
284+
285+`%clay` is just part of the full Urbit namespace. The full namespace
286+has a two-character prefix which expresses what vane to query
287+(always `%c` for `%clay`). The suffix is a mode flag; `%x` for
288+data, `%y` for a list of children, `%z` for the whole arch
289+subtree, `%w` for the version number. (Each vane has its own
290+modes.)
291+
292+For example, the full path to my cat picture is
293+
294+```
295+/cx/~sorreg-namtyv/home/[now]/my/cat/picture
296+```
297+
298+(where `now` is the current date).
299+
300+If the data model is `++image` (hypothetical -- we don't really
301+do image processing in Urbit right now), the normal way to load
302+this data in a Hoon program is
303+```
304+.^(image /cx/~sorreg-namtyv/home/[now]/my/cat/picture)
305+```
306+
307+This produces a statically typed value (which works by
308+dynamically checking `image` against the actual type of the
309+value, but this comparison caches well).
310+
311+Internally, an Urbit namespace request produces a `++cage`, which
312+has a mark, a `++span` (language-level type), and an actual noun.
313+The product is doubly optional, `(unit (unit cage))`; this is `~`
314+if we don't know the value of this name at present but might
315+learn it in future, `[~ ~]` if we know we'll never know it, or
316+`[~ ~ value]` if we know it now.
317+
318+In high-level shell programming (`:dojo`), we can make apparently
319+"blocking" requests to `%clay`. What actually happens: when `%clay`
320+produces `~`, we stop trying to compute this expression and wait
321+on one or more blocking requests. When we are unblocked, we
322+recompute again from scratch; the intermediate computation is not
323+saved at all.
324+
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
328+can return the courtesy of not expecting miracles from it.
329+When in doubt, send an actual request.
330+
331+### Requests and subscriptions
332+
333+A true request (local or remote) has access to the same
334+namespace, but can (a) read across case (revision) ranges,
335+and (b) filter by subtree.
336+
337+If the revision range in a request stretches into the future, the
338+request becomes a subscription. Urbit messaging always regards a
339+single response as a special case of a subscription.
340+
341+Generally, the response stream created by a request starts with
342+all the data the server has available right now; updates will
343+follow when they become available; the subscription will be
344+closed when the request range is complete.
345+
346+#### Userspace synchronization
347+
348+Synchronization per se is done in userspace. In `%clay`, sync just
349+means an application (typically the `%kiln` module in the system
350+app `:hood`) subscribes to a remote desk, and saves its change
351+stream locally. So sync is really an emergent feature of `%clay`.
352+
353+### Revision graph
354+
355+`%clay`'s revision graph is completely uninteresting at present.
356+Some changes are proposed below, however.
357+
358+As 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
360+the previous version in the sequence, but it can be anything.
361+
362+### Storage model
363+
364+`%clay`'s storage model is completely uninteresting. It's also a
365+little funky and I want to change it, so I'll be super vague.
366+
367+A `++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
369+(`(map lobe blob)`), and reference each other through lobes.
370+
371+At present we don't GC this space at all, because we don't
372+actually delete any roots.
373+
374+A `blob` may be `%direct`, meaning it's defined as the data
375+itself, or `%delta`, defined as a change against another blob.
376+This is motivated by the desire not to store a full snapshot
377+on every file change. But it may be misguided (see changes #0
378+and #1 below).
379+
380+We 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
383+disparity between the speed of the current version and the
384+speed previous version is an undesirable glitch in the API.
385+
386+## Our motivation for change
387+
388+We actually have _three_ motivations for change...
389+
390+### We need to develop on %clay
391+
392+At present, we're still using `git` as a development platform.
393+`%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.
396+
397+### Change must come from the community
398+
399+"Why?" you ask? "Why must change come from the community?" Well,
400+one, duh. Change always comes from the community.
401+
402+But two, a great force for change has departed. Philip Monk,
403+late maintainer of `%clay` (`~wictuc-folrex` in the old era,
404+`~wicdev-wisryt` in the new), is tired of types and typing. He
405+spent September roaming with the bison in Montana, and is now
406+literally on his way to Patagonia. On the one hand, Phil still
407+exists and is not at all unwilling to answer questions, even dumb
408+questions. On the other hand, _Patagonia_.
409+
410+So %clay needs a new owner, or owners. At this point, we think
411+the community might be indoctrinated enough to take a stab.
412+
413+Alas, `%clay` already has a pretty checkered ownership history.
414+Long ago I built a `%clay` that was really the only serious
415+design failure in Arvo. Then Jared Hance, a brilliant summer
416+intern, 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
418+_typed_ revision-control system, which is a pretty cool thing.
419+
420+But... in none of these transitions did `%clay` actually get
421+_rewritten_ per se. While it's a reasonably good vane, it
422+does contain one or two historical decisions.
423+
424+We 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
426+start a `%clay` design discussion that will evolve into actual
427+collective action.
428+
429+### Pioneers may find it worth their time
430+
431+We're planning a rewards program for contributions to `%clay`.
432+It'll simply involve setting a time period and a pool of real
433+estate, and allocating the pool by judged contribution.
434+
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
437+doubt, don't talk about Fight Club.
438+
439+## Some openings for change
440+
441+Change, of course, must come from the community. No one can
442+dictate change from the top down. We _know_ this. But...
443+
444+This 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
447+here are just for convenience.
448+
449+*All changes in this program will happen on the next-generation
450+(`cc-release`) branch.*
451+
452+### Change #0: state reform
453+
454+As mentioned above, the storage model in `%clay`, as the code is
455+at present, feels a little funky to me. There's nothing terribly
456+awful about it, but it doesn't feel quite right and its scaling
457+properties are very questionable.
458+
459+Briefly, `%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
463+Jared, though it's actually my fault.)
464+
465+To store a dome snapshot (`++yaki`), the present code keeps a
466+`(map path blob)` at the root of the dome. This is enough to
467+reconstruct the `++arch` structures the namespace exports.
468+However, all kinds of basic arch operations, like basically `ls`,
469+become `O(n)` in the number of leaves in the dome. This is
470+obviously not quite right.
471+
472+I believe the storage structure should be (removing everything
473+that isn't needed to serve the namespace):
474+
475+```
476+ ++ clay (pair safe (map term desk))
477+ ++ desk (pair numb (map numb root))
478+ ++ dome (pair date root)
479+ ++ leaf (pair mark noun)
480+ ++ lobe @uvH :: 128-bit base32
481+ ++ numb @ud :: decimal version number
482+ ++ root (pair (unit leaf) (map knot lobe))
483+ ++ safe (map lobe root)
484+```
485+
486+Here a `++root` is the universal node, with children addressed by
487+hash, but logically representing the abstract `++arch`.
488+
489+Users 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
492+of course, `ls` can't be O(n) in the size of the filesystem.
493+
494+### Change #1: store edges, cache snapshots
495+
496+The current `%clay` is snapshot-oriented, like `git`. The actual
497+changes are discarded. I think this is a bad choice.
498+
499+`%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
501+present we actually throw away the patch (`++nori`).
502+
503+I 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
506+just deriving the diffs from the snapshots, we can also derive
507+the snapshots from the diffs. When in doubt, we save space by
508+dropping the snapshot, not the diff.
509+
510+For an RCS which is also a general-purpose typed filesystem, it's
511+clear that considering edges (deltas, diffs, changes, etc) as the
512+primary state is optimal. You can use diff functions to derive
513+deltas from snapshots, but in many data models this will always
514+risk losing information from the original action. When in
515+doubt, save what the user did.
516+
517+This is even more true for operations on the tree structure, not
518+on individual leaves. Consider the heuristic energy that `git` has
519+to 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
521+because the lowest common denominator remains Linus' style of
522+working with emailed patches.)
523+
524+Edges probably don't even need to be deduplicated. They also can
525+contain metadata such as commit messages (which `%clay` has no
526+place for at present).
527+
528+Once edges are recognized as unreclaimed primary state, snapshots
529+can always be derived from the edges. So we can reclaim memory
530+being used for snapshots.
531+
532+It's also straightforward to have a kind of edge which is a list
533+of edges, letting us collapse feature branches trivially.
534+
535+Finally, I think references in edges should wherever possible
536+indirect through the namespace, rather than directly to the
537+content address. The user has strictly more information if you
538+say you merged `/~sorreg-namtyv/base/987/`, than if all you have
539+is the hash that this reference refers to.
540+
541+### Change #2: unconfuse merge and rebase
542+
543+The 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.
545+
546+The user has one _intent_ whether merging or rebasing, which is
547+to combine changes on one desk into another. The _algorithm_
548+used to construct this change, whether operational transformation
549+(rebasing) or a 3-way diff (merging) has one goal: use all
550+available information to model the authors' editing intent as
551+realistically as possible. If we save edges, we should use
552+edges.
553+
554+Whether to define the resulting change graph with the typical
555+structure of a merge, or the typical structure of a rebase,
556+strikes me as quite arbitrary, and well into the land of "pick
557+one and force everyone to stick with it." But this call demands
558+a real expert on RCS workflow, which I'm not.
559+
560+Since `%clay` is a humble part of a larger system and needs to
561+keep its weight down, "do it both ways because people have
562+different preferences" is not usually the right answer.
563+
564+### Change #3: comment jihad
565+
566+`%clay` needs to be brought up to the documentation standards of
567+`%jael`. This means (a) the formatting matches; (b) the comments
568+are at the same level of quality and ubiquity.
569+
570+The basic commenting standards are: (a) every core (class) needs
571+a block comment explanation; (b) every gate (function) needs a
572+line comment; (c) every face (variable) needs a line comment.
573+
574+This is obviously not just a clerical task. To write these
575+comments, you need to actually understand the code. This is a
576+nontrivial but extremely rewarding task, even if the code you're
577+commenting will get replaced.
578+
579+Also, the _symbols_ in `%clay` must be brought up to `%jael`
580+quality. There is still far too much four-letterism here.
581+
582+NB: `%clay` is about 3000 lines of pretty clean Hoon, which is
583+certainly not at all undocumented. We're not exactly looking at
584+a Matterhorn of reverse engineering here.
585+
586+### Change #4: knot to coin internal paths
587+
588+One feature of Urbit paths, briefly mentioned above, is that a
589+path segment or `++knot` (which is just a `@tas` text string, an
590+ASCII symbol as an atom) must be within the range of the
591+invertible noun printer, `++co`.
592+
593+`++co` maps a described data value, a `++coin`, to an ASCII
594+string which is a valid URL segment and Unix filename. Its
595+friend `++so` inverts the function, perfectly.
596+
597+Almost every knot is the simplest kind of `coin`, a `dime.` A
598+dime 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
601+print arbitrary cells, though less prettily.
602+
603+This feature is cool because it lets us stuff data into names in
604+a precise and predictable way. Usually the names in a namespace
605+are human-meaningful and human-originated, and are therefore
606+symbolic, but there are exceptions. For example, blogposts may
607+want to be named by date.
608+
609+However, it is slightly retarded for the fundamental state of our
610+arches 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
614+easy to sneak in bad data and make it `%clay`'s problem.
615+
616+So, logically, we'd be shifting from
617+
618+```
619+ ++ arch (pair (unit (pair mark noun)) (map knot arch))
620+```
621+
622+```
623+ ++ arch (pair (unit (pair mark noun)) (map coin arch))
624+```
625+
626+Also, a vanilla `++map` might not be quite the right data
627+structure at this point -- we probably want a custom sorted tree,
628+which separates auras and imposes a custom order on each. This
629+would let us serve simple range queries quite efficiently, so
630+long as they match the standard aura order (eg, alphabetical
631+order for symbols).
632+
633+### Change #5: dome semantics by reference
634+
635+While the principle that a dome contains its own mark source is
636+elegant, it's a pain in the ass to implement properly. `%clay`
637+certainly does not do it justice at present.
638+
639+The complexity is in checking every change to see whether it
640+includes a change to the mark source (which is very unlikely),
641+or a dependency of the mark source (slightly less unlikely).
642+And if so, do we have to update all the leaves in the dome?
643+This is also very unlikely. And yet, it happens.
644+
645+Instead, we could simply designate, by beak (ship, desk, and
646+case) a dome which contains the canonical mark source. This
647+would rarely change -- you could upgrade a desk to a new mark
648+dome, but it would be a manual operation and probably a rare one.
649+
650+The common case would just be that everyone uses the current
651+version of the `%base` desk when a desk is created, and never
652+changes it. In practice, this means not every two-byte edit
653+needs to get involved in detecting and/or applying schema
654+evolution, a welcome simplification.
655+
656+### Change #6: mark containers
657+
658+Marks in present `%clay` are atomic and symbolic (like `%html`).
659+Since they're also used for network protocols, and the proper
660+design is one mark per message structure, the mark namespace gets
661+overloaded fast.
662+
663+So we added an app hierarchy within the mark namespace, using hep
664+`-` as a divider. The `:talk` app expects messages with the mark
665+`talk-message`, whose sources is in `/===/mar/talk/message`.
666+
667+This helps, but it doesn't solve another two problems: trivial
668+nouns and containers.
669+
670+It'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.
672+
673+Also, we need to be able to construct standard containers of
674+marks: lists, maps, sets, and tuples (or, as a database person
675+would say, "rows").
676+
677+### Change #7: meta-marks
678+
679+Another kind of complex mark that needs to exist: conflict,
680+difference, and invalid marks.
681+
682+Conflict data and difference data are two types of noun that are
683+generated in normal RCS operation. If we have the concept of an
684+`%html` noun, we also need the concept of an invertible change
685+from one `%html` file to another; a merge conflict between two
686+`%html` files; and even a conflict between two marks.
687+
688+There are two kinds of changes to a dome: manual and automatic.
689+Manual 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
692+shouldn't, these problems will need to be cleaned up manually.
693+
694+This is a complex space to navigate, but it requires a conflicted
695+merge to be able to resolve to a valid dome containing conflict
696+leaves, not crash. The present `%clay` goes halfway there and
697+resolves to a scratch desk, but we can go farther: the whole `git`
698+dumpster-fire of "merge state" deserves destruction. One change
699+is a merge that produces conflicts, the next is an edit that
700+resolves them.
701+
702+Similarly, all sorts of errors can produce invalid leaves. One
703+particularly rare case which is nonetheless important is schema
704+evolution: 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
707+of this now, BTW, although `%ford` has the dependency mechanism to
708+make it possible.) Again, in some cases this should crash the
709+update to the mark source; in other cases, there is no local way
710+to handle the crash.
711+
712+So there must be a way to preserve invalid nouns that can be
713+repaired by repair tools that expect invalid content, while not
714+actually marking them as valid so that innocent code is deluded
715+into using the bad content.
716+
717+The bottom line: a mark needs to be split into two models:
718+`++mark`, the original symbolic mark with its source engine, and
719+something like `++logo`, the meta-mark or mark container. The
720+mark is the building block; the logo is the building.
721+
722+### Change #8: filesystem hierarchy standard
723+
724+While all filesystems remain forks of one ur-filesystem, the
725+standard tends to enforce itself. But not define itself.
726+
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
729+necessity, our nascent "FHS" is heavily biased toward system
730+data, away from user data. This is retarded.
731+
732+Please focus all bikeshedding energy on this problem! Better to
733+bikeshed about what color to paint the bikeshed, then what shape
734+the bike gears should be.
735+
736+### Change #9: security and access control
737+
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
741+operation in `%clay`, so it's not as mad as you think -- anyone
742+can read anything, no one can write anything, which is fine in a
743+young network where there are no secrets.)
744+
745+Fortunately, we don't have anything super fancy planned in this
746+area, just basic access-control lists. These obviously need to
747+be designed along with the filesystem-hierarchy standard (see
748+elsewhere).
749+
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,
752+though it isn't really hooked up to anything at the moment.
753+There is also a privilege badge system in `%jael`. The
754+combination of these two features is quite sufficient for a
755+decent ACL model.
756+
757+The idea of event-based security is that every event passed to
758+`%clay` has a security `++mask`. The mask tells us:
759+
760+- the set of ships that has _contaminated_ this event
761+- the set of ships that has _endorsed_ this event
762+- the set of ships that this event may be _released_ to.
763+
764+To simplify this system a little and maybe explain it, the
765+security question in any event is: (a) who has _caused_ this
766+event? (b) who may receive its _effects_? (These sets never
767+include your urbit itself, of course, only neighbors.)
768+
769+For example, if we're doing something because ship X sent us a
770+packet, and we're going to leak the results of this something
771+back in a response to ship X, once `%clay` knows what our ship
772+thinks of its neighbor X, we should have a good picture of what
773+effects this event should be allowed to cause. If `%jael` knows
774+that X is our friend, `%clay` can know that X can see our cat
775+picture.
776+
777+Causality is separated out into contamination (data from ship X
778+got into the event) and endorsement (ship X signed the whole
779+event). (This may be overdesign.) All these sets can be defined
780+as the empty set (eg, releasing to the empty set means no output)
781+or the universal set (input from the universal set could be from
782+anyone, ie, is unauthenticated).
783+
784+### Change #10: stop using mark-extended paths
785+
786+When you read a leaf from a `%clay` dome, `%clay` is happy to
787+perform any necessary mark conversions (the actual work is done
788+by the `%ford` build vane). You can also just ask for the leaf
789+in whatever mark `%clay` has it.
790+
791+It'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
793+`+cat /===/app/talk`, or maybe `+cat %hoon /===/app/talk`.
794+
795+A mark-extended namespace may be added to `%ford`, to compensate.
796+But type-converting reads are the rare case, not the common case.
797+
798+### Change #11: real queries and indexes
799+
800+A filesystem should postpone being a database until it can no
801+longer do so. So, please don't think about this problem yet.
802+I'm joking, of course!
803+
804+### Change #12: meta-query
805+
806+Make it possible to query the list of desks in a ship :-)
807+
808+### Change #13: completely redesign Unix mounting
809+
810+This is actually a series of changes, described below. But
811+broadly...
812+
813+One of Urbit's experiments is live two-way synchronization
814+between 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
817+it's right for Urbit.
818+
819+The fundamental problem is that there are all sorts of weird,
820+flaky ways applications use a mutable filesystem. It's not at
821+all unusual for an editor to change a file by deleting the old
822+file, then writing the new one in its place.
823+
824+You really don't want this to produce a delete change. A simple
825+cooldown 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.
828+
829+The thing we fear is just too funky to work (there is some
830+strange "reflux bug" still affecting it) is any sort of _two-way_
831+synchronization between Unix and Urbit.
832+
833+And what I think puts this feature into the deadpool, or at least
834+cold storage, is that there's no useful workflow that actually
835+uses it -- at least, when editing Urbit code.
836+
837+It'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
840+original Urbit workflow was to work out of a mounted directory,
841+but the two-way updates were just too weird and scary, so now we
842+tend to edit elsewhere and copy in -- which is lame.
843+
844+### Change #14: figure out what to do with FUSE
845+
846+We actually have two forms of filesystem access to `%clay`: read-only
847+FUSE (in a somewhat experimental state), and filesystem watching
848+(using `inotify()` and `FSEvents` under a `libuv` wrapper).
849+
850+The FUSE interface is a good one, though it needs more work.
851+Moreover, it exports the whole Urbit namespace to Unix, not just
852+`%clay`. For reading Urbit data, FUSE is basically ideal.
853+
854+The obvious impulse is to make a read-write FUSE. But I don't
855+think FUSE should be used for recording changes to an RCS, even
856+though the FUSE API sends you changes as events.
857+
858+There are three reasons for this. One, the actual filesystem
859+writes that Unix apps make are typically of low quality and
860+confusing. Some crack-brained editor will find it completely
861+normal and unremarkable to modify a byte in a file, by deleting
862+the file and rewriting it from scratch. You can use a cooldown
863+timer to wait for this nonsense to converge, but leaving data in
864+heuristic limbo seems like a very bad idea in FUSE-land.
865+
866+The second is that people derive a lot of comfort from seeing
867+actual files on an actual disk. The idea that your datas are
868+stuck 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
871+you possibly believe us on this?
872+
873+So I think it's correct to lean all the weight of reading data
874+from Urbit on FUSE, and use filesystem watching for writing.
875+Heuristic timeouts are fine in filesystem watching, because at
876+least the data got written when the disk says it got written.
877+And at least it's on the disk.
878+
879+Also, FUSE is a daemon by definition, which forces us to think a
880+little harder about how to run the Urbit process as a daemon.
881+But this is a separate discussion.
882+
883+### Change #15: one-way, nonced working desk
884+
885+A one-way mount is a much less crazy thing. It works the same
886+way our two-way mount works today, but with only one writer: the
887+user, via Unix.
888+
889+Since 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
891+we are also editing with filesystem watching.
892+
893+Instead, 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
896+pick a random 32-bit name for each mount instance -- so the desk
897+name is not `%home`, but `%home-bosdut-sigder`. (Randomizing
898+instead of always using a fixed suffix, say, `%home-work`,
899+just makes all kinds of screwups less likely.)
900+
901+You create a mount simply by mkdiring the desk name in your pier.
902+Just 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
905+between unmounting a mount, and deleting all the data in it.
906+
907+(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
909+blocking, we can delete without losing referential transparency.
910+Yes, Virginia, Urbit can forget!)
911+
912+Note that the auto-reload behavior of applications is extremely
913+useful when testing. When testing, you can either switch the
914+active application desk from `%home` to `%home-bosdut-sigder`,
915+or activate autosync from the latter to the former.
916+
917+### Change #16: commands as metafiles
918+
919+A new idea I'd like to play with is that, since the basic model
920+of the mount process is to read Unix files and suck their
921+contents into Urbit, you should be able to control a mounted
922+`%clay` desk through Unix filesystem operations alone.
923+
924+No Urbit command-line access, not even any `urb/` HTTP control
925+channels, should be required for the user to generate `%clay` data
926+through filesystem mount, or to set up the mount.
927+
928+An RCS experience that works entirely through Unix tools, in
929+which the only connection between content creation tools and
930+revision-control tools is shared access to the filesystem itself,
931+is essential if your RCS has something so repulsive as a daemon.
932+Otherwise, you're basically, like, reinventing Perforce.
933+
934+More concretely, the Urbit experience today requires `:hood`
935+pokes (Urbit shell commands, basically) for all nontrivial RCS
936+operations, from mounting to merging. Again, there are lots of
937+situations in which you can write into a mounted filesystem (the
938+protocol for Unix communication could be easily adapted to
939+communicate with a browser-based editor, for instance), but you
940+don't want the user to have to bother with an Urbit shell.
941+
942+Even commands like mounting and merging are easily communicated,
943+through filesystem writes that any Unix tool (including many
944+macro editors).
945+
946+This is very easy for a filesystem watcher. One such protocol:
947+if you want to send the daemon a command relative to some
948+directory, write a `.ur-command` metafile in that directory. The
949+daemon accepts the command by deleting it.
950+
951+The user experience is that you configure your mounts by simply
952+making the directories and configuring dotfiles in them. Unlike
953+in the present system, Urbit will never modify your datas
954+silently in the background.
955+
956+Here's what this looks like:
957+
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
960+of `/=home=/arvo`.
961+
962+From Unix, you do something like this:
963+
964+```
965+ $ cd $pier
966+ $ mkdir -p home/mar/talk
967+ $ touch home/mar/talk/.edit
968+ $ mkdir home/arvo
969+ $ touch home/arvo/.read
970+```
971+
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
975+will appear as `.error`.
976+
977+The mount has a .version file which simply contains the change
978+number (of the working desk) which any edits are relative to. If
979+the urbit daemon is running and watching, edits will be absorbed
980+quickly (probably after a heuristic timeout), and the version
981+incremented. But we always are confident that the edits are
982+against 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
984+filesystem out of consistency.
985+
986+This design obviously needs a little fleshing out, but I'm quite
987+confident it's a convenient and reliable way to drive `%clay`
988+from Unix.
989+
990+## In conclusion
991+
992+There's obviously a lot of fun here! There are two things you
993+can do right now.
994+
995+One, talk about `%clay` on [this forum
996+thread](http://urbit.org/~~/fora/posts/~2016.10.25..17.37.47..6937~/) or
997+on [:talk](http://urbit.org/stream). Both hosted on Urbit
998+itself!
999+
1000+Two, poke around the
1001+[code](https://github.com/urbit/arvo/blob/cc-release/arvo/clay.hoon).
1002+Make sure you're on the development branch (`cc-release`).
1003+
1004+Phasing in this work will be a fun and interesting challenge.
1005+(My suspicion is that the right first task is the Unix mount.)
1006+Let's talk...
content/blog/urbit-and-bitcoin.mdnew file+21
@@ -0,0 +1,21 @@
1++++
2+title = "Urbit and Bitcoin"
3+description = "A sound money deserves a sound computer."
4+date = 2019-10-17
5+[extra]
6+author = "Christian Langalis"
7+ship = "~pindet-timmut"
8++++
9+
10+Sound money deserves a sound computer.
11+
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+
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+
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+
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+
20+To 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.mdnew file+267
@@ -0,0 +1,267 @@
1++++
2+title = "Urbit and the Blockchain Wars"
3+date = 2017-09-25
4+description = "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/"]
6+[extra]
7+author = "Curtis Yarvin"
8+ship = "~sorreg-namtyv"
9+image = "https://storage.googleapis.com/media.urbit.org/site/posts/essays/urbit-and-the-blockchain-1.jpg"
10++++
11+
12+![](https://storage.googleapis.com/media.urbit.org/site/posts/essays/urbit-and-the-blockchain-1.jpg)
13+
14+One core principle of the Urbit network is that *Urbit doesn't take sides*.
15+This is true in all kinds of conflicts -- and especially blockchain wars.
16+
17+We're [moving the Urbit PKI onto Ethereum](https://urbit.org/blog/2017.9.20-bootstrapping-urbit-from-ethereum/)
18+not 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.
20+
21+Some have objected to this decision. Some of these objections are excellent.
22+The rest are understandable.
23+
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
26+further comment.
27+
28+## Urbit is not endorsing or supporting Ethereum
29+
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
34+politics.)
35+
36+We chose ETH because it is the strongest *computational* chain. It is certainly
37+stronger than the way we're storing the Urbit land registry now: GitHub, plus
38+internal records.
39+
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
42+self-governing constitution, the Urbit galaxies can decide to migrate to another
43+consensus engine, or no consensus engine, or even our own consensus engine, any
44+time we like.
45+
46+And even if the whole Ethereum network unexpectedly implodes, and stops
47+generating meaningful new blocks, we (or more generally: the set of active
48+Urbit galaxies) cannot abandon the social power to manually hard-fork the
49+network. Ultimately, the Ethereum contract is just a hardcoded address in a
50+piece of Urbit source code.
51+
52+Let's address each of these points at a little more length.
53+
54+## On moving to a blockchain
55+
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
58+tools and 20th-century tools.
59+
60+The current Urbit land registry is divided into parts stored in various places:
61+GitHub 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
63+borderline unacceptable.
64+
65+## On choosing a chain
66+
67+Our first decision point: whether the public chain enforces the rules of Urbit,
68+or just logs raw data that anyone can interpret.
69+
70+The 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
72+use another simple layer on top of Bitcoin; classic "colored coins," for
73+instance.
74+
75+The 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,
77+because colored coins remained largely theoretical.
78+
79+The larger problem is just that a non-computational blockchain can't enforce the
80+specific rules of the Urbit land registry (like the right of a star to create
81+specific planets).
82+
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
87+special-purpose one-off not shared with anyone.
88+
89+There are other second-order "virtualchains" (Blockstack is one example), which
90+build 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
92+we can get.
93+
94+Also, 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
96+just seems to leave more room for bad weirdness.
97+
98+## As normal Urbit state?
99+
100+The original design was for Urbit to host its own primary copy of the PKI state,
101+not mirror some external master.
102+
103+As more people start believing in Urbit, this makes us extremely nervous. Being
104+the single source of truth implies a strong commitment to security and
105+continuity. Urbit needs to get there, but it isn't there yet.
106+
107+Trust 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
110+keys are in fact insecure, yet needed to operate on the network.
111+
112+In short: we can't follow this original plan. It has the same chicken-egg
113+problem we discussed [last time](https://urbit.org/blog/2017.9.20-bootstrapping-urbit-from-ethereum/).
114+
115+## An Urbit consensus engine?
116+
117+Urbit is itself a deterministic computer. Building a consensus computer within
118+Urbit, which is actually a general-purpose OS, is an attractive long-term
119+possibility.
120+
121+But Urbit lacks the principal feature of Ethereum: deterministic performance.
122+In both Ethereum and Urbit, the semantics of a computation are precisely
123+defined. In Ethereum, the computation's cost is also precisely defined.
124+
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
127+performance definition is a research problem.
128+
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,
131+we could leverage the semi-trusted hierarchy in some direction resembling proof
132+of stake.
133+
134+One thing is certain, though: research problems don't solve themselves
135+overnight. If you have any ideas on this one, give us a holler.
136+
137+In 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
139+could migrate to another computational blockchain which works better than
140+Ethereum.
141+
142+## An existing computational blockchain
143+
144+So we need an existing, mature, computational blockchain. There are only two
145+major candidates: ETH and ETC (Ethereum Classic).
146+
147+It's no secret that we prefer the governance model of ETC. It's also no secret
148+that the whole Ethereum system, especially Solidity, isn't exactly put together
149+in the way we would do it.
150+
151+But 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.
153+Its tooling support -- in software, hardware, vaulting, exchanging, etc -- is
154+considerably stronger.
155+
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
158+Ethereum.
159+
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
164+conflict tends to develop over longer periods of time, giving us room to migrate.
165+
166+Ultimately 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
168+better resolution than VHS.
169+
170+## One reminder
171+
172+For Bitcoin maximalists in particular (some of our best friends are Bitcoin
173+maximalists), 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*.
176+
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
181+friend help.
182+
183+Bitcoin maximalists understand that all monetary energy should concentrate in a
184+single currency. But land isn't money. And the technical details of the
185+implementation of the Urbit registry -- whether `OP_RETURN`, Ethereum, or GitHub
186+-- have no effect on Bitcoin supply and demand.
187+
188+## Another reminder
189+
190+Ethereum is not using Urbit. Urbit is using Ethereum. We know every cool
191+alternative band that gets signed to a major label says this, but we mean it.
192+
193+Urbit, 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.
195+Ethereum does not feel like a system whose technical envelope should be pushed.
196+We have no intention of pushing it.
197+
198+Moreover, 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.
201+
202+This "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?
204+The 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.
206+
207+When 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
209+in the Ethereum chain at which the Urbit constitution remains valid, copy that
210+data to the new primary record, and resume from there.
211+
212+But unlike other blockchains that have wrestled with human-centric governance,
213+Urbit still has a formal procedure for making this decision. With the Ethereum
214+chain compromised, we no longer have an automated system that implements the
215+rules. The rules remain, though. Humans have spent thousands of years
216+following non-automated rules.
217+
218+Basically, we're just using ETH as a self-validating ownership record. So long
219+as the chain isn't destroyed and owners retain their secrets, Urbit retains the
220+power to migrate to any record that works better.
221+
222+## And one literally constructive criticism
223+
224+One excellent criticism (credited to `@sorpaas`) is that just having the Urbit
225+galaxies mirror the state of Urbit's Ethereum constitution is insufficient.
226+This design gives Urbit nodes a choice: either mirror the whole Ethereum
227+blockchain (which is ginormous and certainly not shrinking), or don't validate
228+the Urbit PKI at all.
229+
230+In Urbit, if your parent galaxy is sending you fraudulent reports about the
231+blockchain (any blockchain), you have a very serious problem which goes way
232+past blockchains. It's time to switch galaxies.
233+
234+The 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?
237+
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
242+"parent attacks" in Urbit.
243+
244+But 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.
248+
249+Therefore, the Urbit Ethereum mirror needs to track all the Ethereum
250+transactions 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
253+validate the Urbit PKI without an Ethereum node.
254+
255+(We don't anticipate running a node *in* Urbit, eg an EVM in Hoon -- for now,
256+galaxies will just RPC to a local Unix node.)
257+
258+## And in closing
259+
260+We appreciate everyone's feedback and hope no one remains confused.
261+
262+We'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
264+than later!
265+
266+Fora thread for discussion is here:
267+[urbit.org/fora/posts/~2017.9.25..20.34.38..8e27~](https://urbit.org/fora/posts/~2017.9.25..20.34.38..8e27~).
content/blog/urbit-for-normies.mdnew file+177
@@ -0,0 +1,177 @@
1++++
2+title = "Urbit for Normies"
3+date = 2020-02-12
4+description = "A layperson’s guide to the coming new internet."
5+[extra]
6+author = "Erik Newton"
7+ship = "~patnes-rigtyn"
8+image ="https://media.urbit.org/site/posts/essays/normies-2.png"
9++++
10+
11+Urbit 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.
12+
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+
15+My 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.
16+
17+I 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.
18+
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+
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.
24+
25+So of course I asked for an intro.
26+
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+
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+
31+I 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.
32+
33+
34+## What is Urbit?
35+
36+Let’s take this one step at a time and start with the most basic definition:
37+
38+Urbit is a peer-to-peer internet being built from scratch to be more private, secure, and durable than the current internet.
39+
40+At its most basic level, an Urbit is:
41+
42+1) A super-private computer, combined with
43+2) an ID, which is
44+3) connected peer-to-peer with other Urbit computers.
45+
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.
47+
48+When 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.
49+
50+By “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.
51+
52+Urbit will fundamentally change that — more about the privacy implications later.
53+
54+<img class="ba" src="https://media.urbit.org/site/posts/essays/normies-1.png">
55+
56+## What it looks like
57+
58+Another 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/).)
59+
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.
61+
62+## What it’s for
63+
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.
65+
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.
67+
68+## Key elements
69+
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.
71+
72+I’ll try to explain the most important of these without straying too deep into the technical weeds.
73+
74+1. **A peer-to-peer network**
75+
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.
77+
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.
79+
80+2. **Your own server**
81+
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.
83+
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.
85+
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.
87+
88+3. **Permanent, personal ownership of your digital identity and all your data**
89+
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.
91+
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.
93+
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.
95+
96+4. **An incentive for good behavior**
97+
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.
99+
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.
101+
102+5. **Tools anyone can learn and use**
103+
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.
105+
106+6. **Lessons from the last half century**
107+
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.
109+
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.
111+
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.
115+
116+7. **Private, human-sized, and efficient**
117+
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.
119+
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.
121+
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.
123+
124+ <br></br>
125+
126+<img class="ba" src="https://media.urbit.org/site/posts/essays/normies-2.png">
127+
128+## How it compares
129+
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.
131+
132+Again, 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.
133+
134+Let’s get to some real-world examples.
135+
136+
137+## Urbit vs. Reddit
138+
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.
140+
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.
142+
143+## Urbit vs. Facebook, Twitter, etc.
144+
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.
146+
147+## Urbit vs. Nest
148+
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.
150+
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?
152+
153+## Urbit vs. Google Docs
154+
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.
156+
157+## Urbit for your protected health information
158+
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.
160+
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.
162+
163+For 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.
164+
165+## Why we need Urbit
166+
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.
168+
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.
170+
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.
172+
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.
174+
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.
176+
177+For 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.mdnew file+44
@@ -0,0 +1,44 @@
1++++
2+title = "Urbit Grants and mid-2019 Gifts"
3+date = 2019-06-10
4+description = "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"]
6+[taxonomies]
7+post_type = ["gifts"]
8+[extra]
9+author = "Galen Wolfe-Pauly + Alex Matzner"
10+ship = "~ravmel-ropdyl + ~mignyt-mogseb"
11+image = "https://media.urbit.org/site/posts/essays/urbit-grants-and-mid-2019-gifts-1.jpg"
12++++
13+
14+![](https://media.urbit.org/site/posts/essays/urbit-grants-and-mid-2019-gifts-1.jpg)
15+
16+We are excited to announce the first developer star gifts of 2019. It’s been far too long since we last awarded our contributors. We got so busy working on things ourselves that we let this program languish — but we’ve got plans to make it much more organized going forward. More on that after the important part.
17+
18+That is, our winners from the past nine months:
19+
20+**Gold: 8 stars**
21+
22+- Ben `~mirfet-hocbyt` [@bencalder](https://github.com/bencalder)
23+- Max `~ladres-forfex` [@max19](https://github.com/max19)
24+
25+**Ben** discovered the bug in our @p rendering algorithm, nicknamed “the @pocalypse” around the office, and led to a few nights of lost sleep. It was a fantastic find, which was then resolved by **Max** with one of the greatest GitHub comments of all time: “[curious if this works](https://github.com/urbit/arvo/issues/1105#issuecomment-472585937).”
26+
27+**Bronze: 1 star**
28+
29+- Pyry `~dinleb-rambep` [@pkova](https://github.com/pkova)
30+- John `~dirwex-dosrev` [@jfranklin9000](https://github.com/jfranklin9000)
31+- Assaf `~rophex-hashes` [@asssaf](https://github.com/asssaf)
32+
33+**Pyry** has been a [regular contributor](https://github.com/urbit/bridge/pulls?utf8=%E2%9C%93&q=author%3Apkova) to Bridge over the past few months, **John** has been consistently picking up changes [all](https://github.com/urbit/urbit/pulls?utf8=%E2%9C%93&q=author%3Ajfranklin9000) [over](https://github.com/urbit/arvo/pulls?utf8=%E2%9C%93&q=author%3Ajfranklin9000) [the place](https://github.com/urbit/docs/pulls?utf8=%E2%9C%93&q=author%3Ajfranklin9000), and **Assaf** found a [security issue](https://github.com/urbit/urbit-key-generation/issues/55) with our hierarchical wallet.
34+
35+Thanks to all of you for helping bring Urbit to life. We don’t make it nearly easy enough to contribute, but all of you clawed your way in and made the system better. Thank you!
36+
37+## Coming soon: Our new grant program
38+
39+As always, we much prefer to talk about working code as opposed to unfinished work – however:
40+
41+Making the process of rewarding contributors is something we’ve thought a lot about over the past few months. We’ve come up with a system that we like, and are hoping to put it up later this summer. It’s probably not perfect, but it’s a step in the right direction. We’ll be able to properly engage in a grant proposal process, post bounties as well as reward people directly with prizes.
42+
43+Please [subscribe to our newsletter](http://eepurl.com/b7x7hj) to make sure you receive future announcements.
44+
content/blog/urbit-is-for-communities.mdnew file+97
@@ -0,0 +1,97 @@
1++++
2+title = "Urbit is for Communities"
3+date = 2020-03-23
4+description = "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+[extra]
6+author = "Galen Wolfe-Pauly"
7+ship = "~ravmel-ropdyl"
8+image ="https://media.urbit.org/site/posts/essays/urbit-is-for-communities.jpg"
9++++
10+
11+<br>
12+
13+<img class="ba" src="https://media.urbit.org/site/posts/essays/urbit-is-for-communities.jpg">
14+
15+## Generated, not fabricated
16+
17+What is it that makes high trust communities take shape?
18+
19+When I think of the places in the physical world where people seem to feel the most at home, they’re places that have evolved over long periods of time and are owned by the communities that inhabit them. Communes in rural California, Rome, rural Japan, and villages in Indonesia all come to mind.
20+
21+These are places that aren’t designed in one go. They’re the product of lots of different contributors working in loose collaboration, often over long periods of time.
22+
23+Places that grow under the care of the people who live in them seem, somehow, to become much more alive and engaged. The strength of connection in these communities is palpable. You can feel the difference.
24+
25+There’s nothing even remotely like this in the digital world. The digital world is totally fabricated, stamped out, and controlled.
26+
27+It’s not just the surveillance, lack of privacy, or interfaces optimized for addiction — those are all downstream from the root problem: our software can’t evolve with us. It’s designed and controlled by the people that make it. We don’t participate in shaping it directly at all.
28+
29+And since our software can’t evolve with us, our connection to it remains thin. The digital world of today is low-trust by design. We live in a digital world controlled by other people. Nothing about it belongs to us.
30+
31+It’d be great if we felt a deep appreciation for and connection to our digital communities the same way we do in the physical world. Digital communities should feel alive and engaged with their surroundings. They should feel as vibrant as a city on a summer night, cozy like a family dinner in an old ranch house.
32+
33+We don’t often talk about it explicitly, but this is what Urbit is for. Urbit is for giving communities the tools to evolve their own environments; for us all to feel a sense of life and self-directedness in the digital world.
34+
35+It’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.
36+
37+
38+## Technically capable
39+
40+I 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.
41+
42+I find myself vetting every new app or service to figure out whether they have the potential to survive far into the future. The giant services I’ve become dependent on all seem somewhat worrisome. How long can these free services possibly stick around? Certainly not forever.
43+
44+The incentives in the current structure are totally misaligned. Let’s walk through them:
45+
46+I want to keep my data forever, but most companies are beholden to growth. If they can’t produce that growth and die, my data either disappears or becomes unusable without their software.
47+I don’t want my data to be sold or for anyone to spy on me, but ad-funded companies have to engage in these practices to stay alive.
48+I don’t want a piece of software to go away if a company dies, but apps and services require maintenance that’s complicated and expensive to do. Without the company around, their software is useless.
49+
50+The simple fact is, I let companies run my software because it’s too much work for me to run it myself. Most people can’t be their own sysadmin — and those that can have other things to do.
51+
52+This is more or less the entire technical value proposition of Urbit: to build a system that’s simple enough that it requires almost no maintenance. Our approach to building software makes all of the above problems easily solvable.
53+
54+Perhaps more importantly, we have a direct incentive to solve these problems. Tlon funds Urbit’s development by selling addresses and providing hosting. And the only reason anyone pays us for these things is because we make Urbit as directly useful for you as possible.
55+
56+That means we have to solve the problems inherent to the legacy internet. There can’t be any sense of suspicion or uncertainty in our new system. Your Urbit has to be something you can really trust and attach to. This is why your Urbit lets you run or write whatever code you like, and why we’re focused on making sure the data you put into your Urbit lasts forever: it won’t disappear when some company dies.
57+
58+But 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.
59+
60+
61+## Communities are built by people
62+
63+In 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.
64+
65+The digital world is, of course, nothing like this. Even software developers are stuck with the current system. None of our existing apps or services can connect to one another, so whether you’re a user or a developer, you’re faced with the daunting task of replacing everything all at once if you want a better system. But nobody can do that.
66+
67+Urbit provides an experience with less distance between ordinary use and total customization. To start, we’ve created Ikea-like, Lego-like and woodshop-like levels of usability. What we’ve built isn’t nearly as complex as the physical world, of course, but it’s a start.
68+
69+For most people, customizing your Urbit should be a matter of picking from an available suite of modules. Not unlike going to Ikea. For some people, recombining interfaces and data sources within Ubit should feel like playing with Legos. And for others, who want to dive in and write code, it’s the same as going into a shop full of high-quality tools.
70+
71+We’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.
72+
73+
74+## OS 1
75+
76+Our rough attempt to satisfy this goal is hovering on the horizon. We call it OS 1.
77+
78+In OS 1, you bring a group of people together to share a set of channels. A channel can be a chat, a notebook, or a collection of links. We built an interface for doing this, but you could just as well build your own. Inside OS1, data and interface aren’t stuck together like they are with apps in the default web. Nor are the people you’re connected with locked into any given Urbit app. App, data, and social graph are always separate in Urbit; they’re modular and always under your control.
79+
80+OS 1 is designed to make it easy to start a group. Everyone in the group runs their own instance — so everything is only shared with the people you’re connecting with. Light customization of this experience is easy for an ordinary user.
81+
82+If you want to go deeper, anyone can build a new protocol for storing data and transferring it around Urbit without too much difficulty, but you do have to write some code. If you really want to dive all the way in, you can modify the system all the way through to the kernel.
83+
84+Currently, our Ikea experience is pretty limited, there are only a few Legos to play with, and the shop is still quite rudimentary — but it’s a good start and, for the first time, it exists as one complete system.
85+
86+The system is ripe for experimentation, customization, and exploration. It’s ready for earnest homesteading. Come build.
87+
88+
89+## → N
90+
91+OS 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.
92+
93+But OS 1 actually passes the bar of being both usable and futureproof. Urbit is something you can put energy into, in earnest, even as a digital prepper. It’s both safe enough and customizable enough that high trust communities can begin to take root. Urbit isn’t ready for you to build Rome — but it is ready for you to start a commune, salon, or reading group.
94+
95+The point, in the long term, is to let the technology fade into the background. We want people not to be ruled by their software, but the opposite: for our software to grow to suit us. Our hope is for Urbit to be as invisible, calm, and reliable as possible — and for people to be at the center, in control.
96+
97+If you want to explore this new world with us, let us know. We’re going to give away a limited number of hosted OS 1 communities.
content/blog/value-of-address-space-pt1.mdnew file+147
@@ -0,0 +1,147 @@
1++++
2+title = "The Value of Urbit Address Space (1 of 3)"
3+date = 2020-04-07
4+description = "An expansion of our position on Urbit's address space value."
5+[extra]
6+author = "Erik Newton + Galen Wolfe-Pauly"
7+ship = "~patnes-rigtyn + ~ravmel-ropdyl"
8+image ="https://media.urbit.org/site/posts/essays/value-of-address-space-pt1.jpg"
9++++
10+
11+<br>
12+
13+<img class="ba" src="https://media.urbit.org/site/posts/essays/value-of-address-space-pt1.jpg">
14+
15+<br>
16+
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/).*
18+
19+## Part One – What/why, a history, and some analogies
20+
21+Does Urbit address space have value?
22+
23+The short — but perhaps not very useful — answer to this question is that yes, the market appears to believe that it does have value. This series of posts digs a bit deeper into why.
24+
25+As developers, we at Tlon tend to focus on building functionality rather than valuation models – possibly to our detriment. When we discuss Urbit address space, it’s typically about the technical elements, or the use cases.
26+
27+Now that people are using Urbit on a daily basis, we want to make sure that Urbit IDs (collectively “Urbit address space”) are well-understood. We thought it would be useful to explain our thinking about value, and to provide some of the building blocks that others can use to create their own valuation models.
28+
29+There’s a lot to discuss, so we’re breaking this discussion into three posts. The first explores what Urbit ID is, shares some history, and provides a few analogies that can help in understanding value on the network. The second looks at scarcity, utility, liquidity, and network effect. The third post explains lockups and availability.
30+
31+For a refresher about what we’re doing, check out our [introductory materials](https://urbit.org/understanding-urbit/) or [Urbit for Normies](https://urbit.org/blog/urbit-for-normies/).
32+
33+## Urbit ID basics
34+
35+In order to explore why Urbit IDs have value, we’ll start by explaining the basics of how they function.
36+
37+From one perspective, Urbit ID is simply a means of logging into Urbit OS. From another, Urbit IDs represent a new class of digital asset.
38+
39+From the standpoint of an ordinary Urbit user, Urbit ID is designed to be simple: it’s a login system for a new OS, but with one or two unusual qualities. Under the hood, your Urbit ID is your network address, your username, and a digital asset wallet. Anyone can use your Urbit ID to locate you on the network, and then send you messages (i.e. packets), or digital assets.
40+
41+We say that Urbit IDs represent a new form of digital asset for three reasons.
42+
43+1. Urbit ID is designed such that the user actually _owns_ their name. This means that Urbit IDs are transferable and tradeable. Conventional username and password schemes are merely claims to a bit of data on another party’s server. An Urbit ID, on the other hand, is a piece of cryptographic property on a public key infrastructure.
44+2. Urbit IDs have utility: they’re currently useful in the Urbit ecosystem, but beyond that they’re vastly extensible and they can be used for many more purposes. Owning an Urbit ID is a bit like holding a self-authenticating property title. If Bitcoin is money and smart contracts are law, Urbit ID is land.
45+3. Urbit IDs are scarce in order to discourage spam and abuse.
46+
47+We’ve often said that Urbit IDs have value because they’re useful and scarce. The fact that they’re being traded on platforms independent of Tlon seems to bear this out.
48+
49+## Urbit network structure
50+
51+The network of IDs is structured as a sponsorship tree consisting of 256 galaxies, ~65,000 stars, ~4B planets.
52+
53+Galaxies are the root nodes on the network. They each have a vote on upgrades to the rules that govern the network, they provide packet-routing and peer-discovery services, and they spawn stars. Each galaxy has 256 (2<sup>8</sup>) stars to spawn.
54+
55+Stars similarly provide packet-routing and peer-discovery services, and spawn planets. Each unbooted star contains ~65,000 planets (2<sup>16</sup>).
56+
57+Planets are the individual IDs that most people use on the network. There are a total of ~4B (2<sup>32</sup>) planets all combined. Planets can also each spawn ~4B ‘moons,’ which are Urbit IDs intended to be used for IoT and other devices. Moons are permanently locked to their planets for security and to protect the network from sybil attacks.
58+
59+Stars and planets can leave their sponsors (i.e. the star or galaxy currently providing peer discovery and packet routing) if they wish, and sponsors can choose to stop servicing any given star or planet. This is intended to prevent lock-in and to encourage good behavior from both parties. This mutual accountability is important in a network of finite identities that accrue reputation.
60+
61+Essentially Urbit ID is 2<sup>32</sup> individual names that are bundled into blocks that are larger and larger in size. You might think of a planet like an individual house, a star like a town or a city, and a galaxy like a county or a state.
62+
63+The Urbit ID registry and its rules are built on a set of smart contracts called [Azimuth](https://github.com/urbit/azimuth). These contracts are registered on the Ethereum blockchain. Galaxies can upgrade the mechanics of Azimuth by majority vote.
64+
65+Today, Urbit ID is live and deployed. Each Urbit ID is represented by an ERC-721 non-fungible token. People buy and sell Urbit IDs every day and the number of transactions has been steadily increasing.
66+
67+So, fundamentally, Urbit ID is just a finite set of names and a system for assigning them. We’ve left out a few technical details here, but if you’re curious you can read our [introductory](https://urbit.org/understanding-urbit/urbit-id/) materials or, to go deeper, read the [docs](https://urbit.org/docs/) or the [source](https://github.com/urbit/azimuth).
68+
69+## Why we need a new address space
70+
71+In our view, the short history of the Internet has been a lesson in centralization and consolidation. DNS is a cabal of root servers. IP is essentially controlled by a single entity. All of our naming schemes have been more or less centralized. Certificate-signing is a mess of competing authorities. Search is Google. Hosting is AWS. And don’t even get us started on social networks.
72+
73+Centralization on its own isn’t bad, but it certainly has some negative implications, privacy being the most obvious. Beyond that, the naming schemes we have on the Internet today aren’t _personal;_ they’re not controlled by their users.
74+
75+Simultaneously working against this trend are a variety of decentralized web projects, various digital currencies, and dozens of protocols that are all focused on individual use and distributed ownership. But how do any of those actually surface to the mainstream? How do people identify themselves in this new digital world? Where do they call home? Where’s the Schelling point when they want to connect and work together?
76+
77+Urbit ID is the missing piece. It’s the minimally viable substrate for the digital world that’s been sketched out by Bitcoin, Ethereum, and all of their decentralized kin. From our perspective, the kit of decentralized technologies that exist today is designed for a world that’s only just coming into existence. That new world shouldn’t be owned by any one entity; it should be distributed. We believe that Urbit OS and Urbit ID are the right foundation for interacting in that world.
78+
79+The ownership structure of a new territory has a huge impact on its future shape. While most of Urbit ID remains an uninhabited grid, we see it as most likely to become a varied array of neighborhoods and cities. Not because this is a nice outcome, but because it’s the most economically likely one. More on the concept of neighborhoods below.
80+
81+## History and distribution
82+
83+So how did these ~4B names get initialized and distributed? Urbit address space was created _ex nihilo_ — from nothing but an idea — and then distributed directly to project contributors who helped develop the system.
84+
85+Now 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.
86+
87+Let’s take a look at how this came to be.
88+
89+Urbit 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.
90+
91+Once Urbit became a working prototype, in mid 2013, a company (Tlon) got off the ground to help develop Urbit and a number of other developers joined. At this point, Tlon bought half the address space from Curtis for what now looks like an exceptionally good deal. Then Curtis and Tlon each earmarked a significant chunk of address space for infrastructure and community development — we refer to this as the urbit.org address space, and it’s held by Tlon.
92+
93+From 2014-2018 Tlon and Curtis both gave away address space to individual contributors who were helping with the project. In 2016 and 2017, Tlon sold some of its address space in two crowdsales to fund the development of Urbit (which formatted the Urbit address space as a user-facing system). These sales were focused on getting address space into the custody of users with an interest in the technology and developing the network.
94+
95+It was then decided that a public key infrastructure was the most logical way to instantiate ownership of Urbit address space. Thus, after much [consideration](https://urbit.org/blog/urbit-and-the-blockchain/), Urbit ID was deployed to Ethereum in January 2019 under a set of contracts called Azimuth. At this point, there were about 2000 star holders and around 80 galaxy holders. We can’t be sure how many independent holders there are now — the address space is entirely out of our hands — but the distribution has been steadily increasing. Addresses trade regularly on urbit.live and Opensea, and are sold by a few other smaller outlets like planet.market and Urbit Marketplace, all of which are independent of Tlon.
96+
97+## Analogues and the intrinsic value of address space
98+
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.
100+
101+This 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.
102+
103+### DNS
104+
105+We’ve often compared Urbit ID to the IPv4 and IPv6 systems. In this scheme, galaxies are much like [/8 blocks](https://en.wikipedia.org/wiki/List_of_assigned_/8_IPv4_address_blocks) of IPv4 addresses, while planets are much like individual IP addresses. The difference is that IP addresses are rarely owned by end users, and they’re typically assigned dynamically, so they tend to change. This is why IP addresses can’t be used to accrue reputation for end users or to prevent spam. It’s worth noting that while most of us don’t own our IP addresses; they are currently [traded](https://auctions.ipv4.global/) on the open market. As of the time of this writing, individual addresses are selling for ~$20. /8 blocks are extremely valuable, and none are currently on the market.
106+
107+### ISPs
108+
109+Another analogy that we often use is that of ISPs (Internet service providers). Stars in the Urbit network are the closest approximation here in that they help planets connect to the network. Ultimately, connections on Urbit are peer-to-peer, but stars provide initial connections, distribute software updates, and route packets when peer-to-peer connections don’t yet exist. These services all represent a cost, and we believe they’ll eventually be metered and priced.
110+
111+### CDNs
112+
113+CDNs (content delivery networks) are another useful comparison. Stars are perfectly positioned to play this role in the Urbit ecosystem. Because stars are designed as packet-routing infrastructure, they’re able to easily spin up greater bandwidth to service high-demand content, or to aggregate content. Stars can also act as content curators and providers, or as content filters for those who want a more narrow range of access. On the other end of that spectrum, stars could easily function as something similar to VPNs (virtual private networks) for any type of content.
114+
115+### Software distribution
116+
117+An infrastructure innovation that’s relevant here is that Urbit OS is specifically designed to make over-the-air (OTA) updates to the system — meaning software and updates are distributed automatically with no effort on the part of the end user. By default, planets and stars get their system updates from their sponsors. As the system evolves, we expect stars and galaxies to not only provide core system (kernel) updates, but also to act as software distribution hubs. Stars will distinguish themselves from one another by the quality of their service. Some might focus on speed of distrubtion; others on assesing the quality of the code they distribute. All of this represents effort on behalf of the star, and could act as a profit center for the star operator.
118+
119+### Payments and transactions
120+
121+On top of routing and software distribution, there are likely other worthwhile services for stars and galaxies to provide. A payments-focused star could run Bitcoin, Lightning or Ethereum nodes exclusively for sponsored planets. A trading-focused star could run a 0x relayer and provide an order book for sponsored planets. It’s easy to imagine machine learning or compute services being offered as a service; for example, a star could bolt on a TensorFlow chip and allow its sponsored planets to run computer functions for a fee.
122+
123+### Land
124+
125+We often use land as an analogy to describe Urbit address space. This is not simply because Urbit address space is finite or because IDs act as addresses on the network. It’s because Urbit is designed to be extremely extensible. Once you take possession of your Urbit — whether it’s a galaxy, star, or planet — you have immense flexibility: you can use it as-is out of the box, you can rearrange your environment, or you can go as far as writing code to create new functionality. Urbit address space is meant to be used productively. Urbit is very much territory for homesteaders.
126+
127+We expect that certain groups of Urbit IDs will be more valuable than other groups. There is no unit price for physical land — rather, price depends on location and a host of other factors. Similarly, we expect a range of prices to develop for Urbit IDs. We’ve already seen price variation around specific names and [sigil](https://urbit.org/blog/creating-sigils/) shapes.
128+
129+In the long term, the real value of an infrastructure node (a star or galaxy) is not simply in trading on the unit price of planets, but in developing and improving the real estate.
130+
131+### Dealer-operators
132+
133+Another approach to developing the value of address space that is already emerging is that of the dealer-operator. The most convenient way for an ordinary person to use Urbit is to have a planet hosted in the cloud so they can log in from any device. Because the long-term value of a star or galaxy is in providing services, and because most planets and stars need to be hosted, providers of these services have begun to emerge.
134+
135+These providers sell users a planet, host it for them, and deliver related services through their stars and galaxies. This means that with a couple of clicks an ordinary user could buy a planet, sign up for a hosting/routing bundle, get access to a set of services, and be immediately ready to interact with the community of their choice.
136+
137+There are plenty of other examples that we haven’t even imagined yet. The important thing is that stars will likely distinguish themselves through the services they provide. Since planets and stars can always change sponsors, a large part of the long-term monetization of a star or galaxy lies in the quality of service that a given star operator provides.
138+
139+This independent ecosystem has a secondary benefit of creating a varied tapestry of digital environments on Urbit, since every community and every dealer-operator can customize as they see fit. That variety will make the landscape much more interesting and ripe for exploration than anything we might create with the top-down approach found on centralized services. That variety will also likely cause a range of values for planets depending on their sponsor or “location”.
140+
141+This ecosystem has already begun to emerge. Both Tlon and urbit.live are working on developing services along these lines, and we’ve heard from several other entrepreneurs considering similar offerings. This is emerging not simply because it serves a user need, but because it’s the directional flow of the system. In other words, it’s the simplest way to monetize address space while avoiding the oligarchic, surveillance-based, advertising-oriented systems we’re stuck with today.
142+
143+To summarize, our view is that Urbit address space is valuable because it’s useful and it’s scarce (and it has network effect, but more on that later). What’s more, while the use case has already begun to take shape, it will grow in directions we can’t yet imagine because the system is designed to be extensible — Urbit is a homestead, not a hotel.
144+
145+We’re looking forward to seeing what the world builds with Urbit.
146+
147+In the next post in this series, we’ll explore the issues of scarcity, utility, liquidity, and network effect.
content/blog/value-of-address-space-pt2.mdnew file+155
@@ -0,0 +1,155 @@
1++++
2+title = "The Value of Urbit Address Space (2 of 3)"
3+date = 2020-04-13
4+description = "Scarcity, utility, liquidity, and network effect."
5+[extra]
6+author = "Erik Newton + Galen Wolfe-Pauly"
7+ship = "~patnes-rigtyn + ~ravmel-ropdyl"
8+image ="https://media.urbit.org/site/posts/essays/value-of-address-space-pt2.jpg"
9++++
10+
11+<br>
12+
13+<img class="ba" src="https://media.urbit.org/site/posts/essays/value-of-address-space-pt2.jpg">
14+
15+<br>
16+
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/).*
18+
19+## Measuring value
20+
21+Value 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.
22+
23+
24+
25+## Scarcity
26+256 galaxies, ~65,000 stars, ~4B planets.
27+
28+<br>
29+
30+<img class="ba w-100" src="https://media.urbit.org/site/posts/essays/value-of-address-space-pt2a.svg">
31+
32+<br>
33+
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.
35+
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.
37+
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.
39+
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.
41+
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.
43+
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.
47+
48+Scarcity 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.
49+
50+## Utility
51+Utility (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.
52+
53+As a refresher, this use value falls in five broad categories.
54+1. 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.
55+2. 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.
57+4. 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.
59+
60+Utility is only one component of a value calculation. To further develop the inquiry into value, let’s move on to trading factors.
61+
62+## 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.
64+
65+<br>
66+<img class="" src="https://media.urbit.org/site/posts/essays/value-of-address-space-pt2-tps.svg">
67+<br>
68+
69+<br>
70+<img class="" src="https://media.urbit.org/site/posts/essays/value-of-address-space-pt2-tss.svg">
71+<br>
72+
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.
74+
75+## Planet Sales
76+
77+<br>
78+<img class="" src="https://media.urbit.org/site/posts/essays/value-of-address-space-pt2e-price-eth.svg">
79+<br>
80+
81+<br>
82+<img class="" src="https://media.urbit.org/site/posts/essays/value-of-address-space-pt2e-price-btc.svg">
83+<br>
84+
85+## Star Sales
86+
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>
90+
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.
92+
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.
94+
95+Strictly 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.
96+
97+<br>
98+
99+<img class="ba w-100" src="https://media.urbit.org/site/posts/essays/value-of-address-space-pt2b.svg">
100+
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.
106+
107+In 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.
108+
109+## 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.
111+
112+Urbit 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.
113+
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.
121+
122+The 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.
123+
124+## 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.
126+
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.
131+
132+Reed’s law captures the notion that groups vastly increase the density of connections on a network and so scale value more quickly.
133+
134+Urbit is a network of networks, and so is best described by Reed’s law.
135+
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.
137+
138+
139+
140+## 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).
142+
143+This combination of effects makes Urbit significantly more robust than non-platform networks which can’t rely on this intrinsic utility.
144+
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.
146+
147+## 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.
149+
150+## Extensibility
151+Because 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.
152+
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.
154+
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.
content/blog/value-of-address-space-pt3.mdnew file+130
@@ -0,0 +1,130 @@
1++++
2+title = "The Value of Urbit Address Space (3 of 3)"
3+date = 2020-07-10
4+description = ""
5+[extra]
6+author = "Erik Newton + Galen Wolfe-Pauly"
7+ship = "~patnes-rigtyn + ~ravmel-ropdyl"
8+image ="https://media.urbit.org/site/posts/essays/value-of-address-space-pt3.jpg"
9++++
10+
11+<br>
12+
13+<img class="ba" src="https://media.urbit.org/site/posts/essays/value-of-address-space-pt3.jpg">
14+
15+<br>
16+
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/).*
18+
19+It has been some time since we revisited this series of posts, so let’s start with a summary.
20+
21+Our 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.
22+
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.
24+
25+Second, 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.
26+
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.
28+
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.
30+
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.
32+
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.
34+
35+## Lockups and spawning limits
36+
37+One 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.
38+
39+Booted and Unbooted Addresses –
40+
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.
42+
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.
44+
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.
46+
47+Locked vs. Unlocked Addresses –
48+
49+At present, the majority of Urbit address space is locked by smart contracts. When Urbit address space was first registered on the Ethereum blockchain, this unlocking mechanism was put in place to prevent the network from being flooded with users. A young Urbit network in which all of the address space had been unlocked would be exposed to attacks by bots and spammers. Scarcity, on the other hand, encourages good behavior as it increases the cost to spam.
50+
51+A 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).
52+
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.
54+
55+<br>
56+<img class="ba" src="https://media.urbit.org/site/posts/essays/value-of-address-space-pt3-graph1.png">
57+<br>
58+
59+<br>
60+<img class="ba" src="https://media.urbit.org/site/posts/essays/value-of-address-space-pt3-graph2.png">
61+<br>
62+
63+These lockups all began to release at varying linear rates in January 2019 (specifically on Tue Jan 08 23:34:41 2019 UTC).
64+
65+The various linear unlocking schedules are grouped as follows:
66+
67+- 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.
70+- Earlier private buyer addresses—including those in our first two crowdsales—were unlocked right away.
71+
72+
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+
77+
78+Spawning Limits –
79+
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.
81+
82+<br>
83+<img class="ba" src="https://media.urbit.org/site/posts/essays/value-of-address-space-pt3-graph3.png">
84+<br>
85+
86+When 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.
87+
88+## Address space distribution
89+
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.
91+
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.
93+
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.
95+
96+<br>
97+<img class="ba" src="https://media.urbit.org/site/posts/essays/value-of-address-space-pt3-graph4.png">
98+<br>
99+
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.
101+
102+We 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.
103+
104+We intend to further distribute Tlon’s address space over the coming years through private sales, employee compensation, grants, bounties, and gifts. It’s worth noting that the grants and bounties program specifically is set to increase in coming years. We’re very much interested in putting address space in the hands of people interested in helping develop the network; we see grants as the perfect mechanism for doing so.
105+
106+## Usage data and composition
107+
108+Usage data is an obvious missing piece of the puzzle in this discussion. We understand this, and yet we don’t actively capture usage data, for two important reasons: it’s premature, and Urbit is privacy-focused by design.
109+
110+First, it’s too early. Urbit’s current users are a fanbase of pioneers who are willing to put up with the challenges of a young network. This fanbase grows on its own, but Tlon doesn’t actively encourage that growth yet. For the vast majority of potential users, the barriers to entry are still high enough that an invitation would risk losing them permanently. You can think of Urbit today as being a developer alpha.
111+
112+We’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.
113+
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.
115+
116+The Network Explorer –
117+
118+In 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.
120+Urbit’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.
121+
122+Closing –
123+
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.
125+
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.
127+
128+User 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.
129+
130+This concludes the final installment of our series on the value of Urbit address space. Though the explanation was long, the framework is quite simple: value in Urbit is derived from its use, scarcity, some liquidity, and network effect. Let us know if you’d like us to dig deeper into any of these elements—we’re always happy to opine about Urbit.
content/blog/what-is-urbit-for.mdnew file+191
@@ -0,0 +1,191 @@
1++++
2+title = "What is Urbit For?"
3+date = 2016-05-11
4+description = "A vision of the Urbit-powered future."
5+aliases = ["/posts/essays/what-is-urbit-for", "/posts/what-is-urbit-for"]
6+[extra]
7+author = "Galen Wolfe-Pauly"
8+ship = "~ravmel-ropdyl"
9+image = "https://storage.googleapis.com/media.urbit.org/site/posts/essays/what-is-urbit-for.jpg"
10++++
11+![](https://storage.googleapis.com/media.urbit.org/site/posts/essays/what-is-urbit-for.jpg)
12+
13+Open platforms don't beat closed systems just because they're open.
14+They win because you can do more exciting things with them. We
15+believe we're overdue for new infrastructure not purely on principle:
16+but because we think you can build better products on top.
17+
18+We look forward to a future where your fleet of Urbits run the devices
19+throughout your house, keep your biometric data in sync with the data
20+center and hold your secure medical and financial data. Today Urbit
21+is just a proof of concept — but we see a road from here to there.
22+
23+## Today
24+
25+These are things that work but are under development today. We expect
26+them to improve and stabilize in the coming months.
27+
28+### Making the web programmable
29+
30+The 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
34+a global revision controlled filesystem it's easy to share API
35+connectors and keep them up to date.
36+
37+With 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
41+Urbit is designed to make data trapped in your existing services feel
42+like an extension of your local programming environment.
43+
44+### Self-hosted publishing and communication
45+
46+Additionally 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
50+those tools together; giving the individual control over their
51+creative output.
52+
53+Simply 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%
57+open.
58+
59+### Cryptographic identity
60+
61+Your 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
64+exchange digital currency, but how do I know who anyone is?
65+
66+Your Urbit can post public proof to your third party services and its
67+validity is easily auditable. Using Urbit as an identity scheme for
68+new services would be a great decentralized alternative to 'Sign in
69+with [company x]'.
70+
71+## Tomorrow
72+
73+Urbit'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
75+that it's as reliable as its SaaS counterparts.
76+
77+### Lifestreams, finally
78+
79+The combination of great API tools and great publishing tools means we
80+can 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
83+to have general-purpose tools for consuming and publishing data.
84+Imagine a Medium-quality interface that makes no distinction between
85+Facebook and Twitter; SMS and Skype.
86+
87+### Secret storage, web3
88+
89+Bitcoin and Ethereum are both part of a new era of decentralized
90+infrastructure that's just beginning. For the blockchain to realize
91+its 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
95+practical computing.
96+
97+Urbit is a great complement to the blockchain. Your Urbit can safely
98+store 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
101+provide any kind of distributed consensus, but our computation model
102+is very simple and lends itself well to auditing. This makes it a
103+very blockchain-friendly platform.
104+
105+## Over the horizon
106+
107+If there's one thing we know from the history of personal computers
108+it'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
111+what this will look like, but we can certainly speculate on the areas
112+that deserve the most attention.
113+
114+### Data permanence and software competition
115+
116+Right 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+Losing the history of the world to bitrot is a preventable problem.
123+
124+Since 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
126+_actually run it_ and your programs manipulate data that _you own_.
127+The individual has permanent access to their data by design. Ensuring
128+its durability is a technical problem, not a license agreement
129+problem.
130+
131+When 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
134+the interface for Evernote with one from another developer for $10
135+wouldn't it be worth it? Even more so with Urbit, since after
136+installing software you're not dependent on the developer staying
137+alive. You're running a local copy. This model puts pressure on
138+applications to interoperate better and become more modular.
139+
140+### Reputation
141+
142+With a working identity system it's possible to build up contextual
143+reputation systems that aren't held hostage by their applications.
144+Just like the marriage of applications and data, reputation is
145+permanently tethered to and jealously guarded by the services we use.
146+
147+For 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
152+system 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
154+reputation of a restaurant, but just a way to pseudonymously aggregate
155+individual opinions. There's a broad swath of territory ripe for
156+exploration here.
157+
158+### Privacy
159+
160+With a reliably secure place to store your data on the network,
161+wouldn't you want to store even more personal information yourself?
162+Why 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
164+we wouldn't require anyone else to keep them for us.
165+
166+Furthermore, we'd be able to share them pseudonymously. One could
167+imagine 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
170+can run my own personal health and finance software that can reliably
171+access my own transactions and medical records, what would developers
172+come up with?
173+
174+### IoT
175+
176+What needs a network _and_ computation? Devices. Turning a unix box
177+into a usable platform for hardware isn't something that any
178+individual manufacturer is incentivized to do. For the internet of
179+things 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
181+a single instance, it can sign the keys for a whole network of Urbits
182+intended to be used for your devices, sensors, appliances, machines,
183+robots, VR helmet, etc.
184+
185+The 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
188+industrial enterprise there's a whole other set of parallel problems:
189+tracking 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.
content/blog/why-hoon.mdnew file+272
@@ -0,0 +1,272 @@
1++++
2+title = "Why Hoon?"
3+date = 2019-11-14
4+description = "The promise of Urbit lies in its reimagination of the digital world using components that are as constrained and limited as possible."
5+[extra]
6+author = "Ted Blackman"
7+ship = "~rovnys-ricfer"
8+image = "https://media.urbit.org/site/posts/essays/hoon.png"
9++++
10+
11+![](https://media.urbit.org/site/posts/essays/hoon.png)
12+
13+### What can Hoon do that other languages can't?
14+
15+The short answer is: implement a purely functional operating system.
16+Try to do this in a principled way in Haskell, and the problems you'll
17+run into will make design decisions in Hoon and Nock make a lot more
18+sense.
19+
20+In particular, the problems Hoon solves that aren't solved by other
21+functional languages are:
22+- Compile and run other code in a typesafe manner at full speed,
23+- Typesafe metaprogramming, and
24+- Hot code reload and online data migration.
25+
26+### What is Hoon good at?
27+
28+Hoon is mostly good at compiling and running other Hoon code. Urbit
29+consists of many layers of bootstrapping. Several of these layers lean
30+heavily on this feature, including the Gall application runner, the Ford
31+build system, the Dojo shell, and the Arvo kernel itself. Even Urbit's
32+chat application lets you run Hoon expressions and share the results
33+with your friends.
34+
35+### Why did we write the OS in Hoon?
36+
37+The chain of reasoning goes something like this:
38+
39+Software complexity leads to monopolies and lack of individual digital
40+sovereignty, in addition to bugs and security vulnerabilities. One of
41+the best ways to reduce software complexity is to restrict oneself to
42+pure mathematical functions — no side effects, no implicit arguments.
43+This makes the system deterministic. So we want a deterministic,
44+functional operating system for individuals to run.
45+
46+This operating system should also be axiomatic; we don't want it to
47+depend on various idiosyncrasies of whatever the current hardware is
48+like. Hardware changes over time, and we want people to be able to pass
49+their computers on to their grandchildren, so we should have a virtual
50+machine that runs this functional operating system.
51+
52+As hardware changes, people need to move their virtual machines to new
53+hosts. This means there needs to be a standard way to serialize and
54+deserialize the VM state at any time. The easiest way to do this is by
55+storing an event log, just like a database, and writing each event to
56+that before emitting effects caused by it. Since we also need state
57+snapshots, every piece of data in the system, including runtime state,
58+needs to be serializable to a standardized format.
59+
60+Because the VM will likely move from host to host many times, it needs
61+to be tractable to actually implement a VM correctly. This means the
62+system specification needs to be simple enough that it's clear whether a
63+VM is in fact correct. The x86_64 instruction set that runs most
64+servers has somewhere between 1300 and 4000 opcodes, depending on how
65+you count. Nock has 12.
66+
67+Since Urbit is an operating system, its main purpose is to load and run
68+programs on behalf of the user. This means the system needs to be
69+really good at hot code reloading, self-hosting, metacircularity, and
70+virtualization.
71+
72+There aren't any other languages out there that are purely functional,
73+purely axiomatic, performant enough for practical personal use,
74+universally serializable, and good at runtime metaprogramming. Nock is
75+Urbit's solution to these design constraints. Some Lisps come close to
76+meeting these criteria — and Nock is very Lisp-like — but no practical
77+Lisp dialects are nearly as pure or axiomatic as Nock.
78+
79+### What is special about Hoon?
80+
81+It's a purely functional systems language. Calling it a functional
82+analog of C is not too far off in several ways. Almost all code
83+throughout Urbit's kernelspace and userspace is written in Hoon.
84+
85+### What properties does Hoon have? What type of language is it?
86+
87+Hoon is a statically typed, purely functional, strictly evaluated
88+programming language.
89+
90+Hoon and Nock have several unusual properties:
91+
92+- **Axiomatic**. Nock is a fully axiomatic computing system — no
93+ dependencies, no builtins, no hardware dependence — just pure math.
94+ The jet system gives this a practical level of performance.
95+
96+- **Layered**. Nock is machine code designed for machines to run; Hoon is a
97+ programming language designed for people to use. Hoon layers over
98+ Nock in a very similar way to how C layers over machine code. Nock
99+ has no symbols; all programmer-facing variable names live in Hoon
100+ types. You can use raw Nock from Hoon, much like dropping down to
101+ assembly from within C. Hoon compiles to Nock with no "runtime
102+ system" — aside from subtree lookups, you could pretty easily compile
103+ most Hoon expressions by hand.
104+
105+- **Minimal**. Urbit is ruthlessly minimalistic throughout the stack. Nock
106+ has only twelve opcodes, and Hoon's semantics are a very thin layer
107+ over Nock's. The only fundamental datatype in Urbit is the noun:
108+ either an arbitrarily large natural number, called an atom, or a pair
109+ of nouns, called a cell. This forms a binary tree with atoms at the
110+ leaves. Lists, sets, maps, queues, executable code, closures, ASTs,
111+ buffers, strings, floating-point numbers, and everything else in the
112+ whole programming environment are represented using just this data
113+ structure.
114+
115+- **Acyclic**. There are no cycles in nouns, since they're always trees, so
116+ there are no cycles in Nock's memory model. Pointer equality is not
117+ exposed to the programmer. In practical Nock implementations, all
118+ data structures are what are elsewhere called "functional" or
119+ "persistent" data structures, meaning they're immutable and share
120+ structure wherever possible.
121+
122+- **Homoiconic**. Code and data are represented the same way and can be
123+ converted to each other. Lisp dialects are also homoiconic, but Hoon
124+ and Nock are arguably even more so, since things like closures and the
125+ environment are just Nock trees. We even have a statically typed
126+ metacircular interpreter called <code>+mule</code>. We run userspace code
127+ metacircularly with negligible performance overhead because of Urbit's
128+ jet system. In Lisp "eval is evil" is a common saying but, in Urbit,
129+ eval is a first-class feature.
130+
131+- **Universally serializable**. There's one serialization format, called
132+ "jam", for any piece of code or data in the system. This makes it so
133+ that deserialization has just one function, a few hundred lines of C,
134+ as its security attack surface. It also facilitates portability of
135+ the virtual machine state, and it turns out to be useful in a bunch of
136+ places in the system.
137+
138+- **Jetted**. A jet is a piece of code that the Nock interpreter has that
139+ reimplements a Nock function in some other, faster language. The `+dec`
140+ decrement function in Hoon's standard library is defined axiomatically
141+ using recursion, but is run as a jet written in C that makes use of
142+ the processor's ALU for performance. When calling a Nock function, if
143+ the runtime has a matching jet, it will use that instead of the Nock
144+ implementation. Nock isn't as slow as you might think, especially
145+ considering it's a minimal, dynamic, axiomatic language.
146+<br/><br/>
147+ This arrangement has the deeper implication that all code written in
148+ Nock is best considered as a specification for a program, which can be
149+ executed directly but might never run at all due to being jetted.
150+ Cryptographic functions, for example, should all have jets with
151+ constant-time implementations to prevent timing attacks. Most jets,
152+ though, just take advantage of hardware acceleration for things like
153+ floating point arithmetic.
154+
155+- The amount of Hoon syntax is unusually large, but also **unusually
156+ regular**. Hoon is a "runic" language, meaning expressions generally
157+ begin with a digraph "rune" corresponding to the type of expression.
158+ Runes are used in place of keywords and Lisp's "special forms".
159+ Hoon's syntax makes better use of screen real estate than Haskell or
160+ Lisp by having a mostly vertical "backbone" of runes that prevents
161+ long functions from indenting repeatedly and helps quickly identify
162+ control flow. Hoon does not allow syntactic abstraction, so you
163+ always know exactly what you're looking at when reading Hoon. The
164+ similarity of Hoon's syntax to its abstract syntax tree makes
165+ metaprogramming easier and can be thought of as another layer of
166+ homoiconicity on top of Nock's.
167+
168+- **Subject-oriented**. There is no implicit environment; a Hoon expression
169+ compiles down to a Nock formula, which is interpreted as a function
170+ that runs with the "subject" as the argument. The subject can be any
171+ Nock tree, but it contains everything that's in scope. It usually
172+ consists of the Hoon compiler and standard library as a stack of
173+ cores, along with whatever functions and variables have been defined
174+ in the lexical scope.
175+
176+- **Cores**. A core is a pair of code and data. The core is the underlying
177+ representation of a function (a lambda with implicit fixed point), a
178+ library or module, an OOP-style object, and an OOP-style "interface"
179+ or "protocol". The code consists of a set of Nock formulas that can
180+ each be run against the whole core as a subject. This means there's
181+ always an implicit fixed point when running a function, and mutual
182+ recursion can occur among a core's formulas. A core's data usually
183+ consists of the standard library (itself a stack of cores), and
184+ possibly a "sample" (function argument).
185+
186+- **The type system has several unusual features**. It's intentional, in
187+ the sense that all constructs are first-class and can be down-cast to
188+ `noun`, Hoon's "any" or "top" type that matches all Nock nouns. Types
189+ are also used as scopes, so they store all of Hoon's variable names
190+ and docstrings. The type system uses an unusual macro-like feature
191+ called "wetness" to implement parametric polymorphism. The type
192+ system can also auto-generate coercion functions that validate and
193+ lift raw nouns into structural types, such as lists or cells. This is
194+ used to validate untrusted data, such as from the network.
195+
196+- **Reflective**. The type of type is just a normal datatype in Hoon, and a
197+ lot of the system manipulates types. In particular, the `!>` rune, when
198+ applied to a piece of data, uses compile-time type reflection to
199+ produce something called a "vase": a pair of type and data, similar to
200+ a <code>Data.Dynamic</code> in Haskell, or a limited form of a dependent pair.
201+ Since the Arvo kernel does a lot of dynamic compilation, it uses vases
202+ to implement something akin to a dynamically typed language using
203+ Hoon. This allows for type-safe dynamic program loading, program
204+ execution, and data migration.
205+
206+- **Inert**. Because Nock is purely functional, Hoon compiles to it so
207+ directly, everything is homoiconic, and Hoon is intensional, there's a
208+ very nice feeling that everything is just a stationary tree. There
209+ are no special objects that can't be manipulated; everything in your
210+ environment is just a subtree, and you could grab it and print it out
211+ if you wanted to. There's nothing like a "database handle",
212+ "websocket connection object", or other mystical constructs. The
213+ calmness of working with such inert building blocks is addictive, as
214+ many Hoon programmers will attest.
215+
216+### Why is Hoon the way it is?
217+
218+Minimalism, mostly.
219+
220+Urbit's principled minimalism simplifies all kinds of things at many
221+layers of the stack; for example, Urbit's linker, which is part of the
222+Ford build system, just conses together multiple libraries into a tuple
223+to form the compile-time environment for a source file. Universal
224+serialization means we can safely send arbitrary pieces of data to apps
225+on other ships without any more work than sending them to a local app.
226+Using an app called Aquarium that's about three hundred lines of code,
227+Arvo can run a whole fleet of other Arvos inside itself at full speed,
228+just like Docker, and perform a suite of deterministic end-to-end tests
229+on the OS as a whole.
230+
231+Even Hoon's seemingly baroque syntax is extremely regular and an
232+unusually thin layer over the abstract syntax tree. It's designed to be
233+a power tool; learning the syntax takes some time, but you only have to
234+learn it once, and then it's not hard to read. It's like an English
235+speaker learning Hiragana or Cyrillic. This heaping spoonful of syntactic sugar
236+(along with jets for performance) is enough to take Nock from a Turing
237+tarpit to a practical, ergonomic programming tool.
238+
239+Subject orientation in Nock and Hoon stems partly from minimalism
240+(there's just one subject, which serves as state, lexical scope,
241+environment, and function argument), partly from a desire to simplify
242+compilation (the type of the subject is a full specification of the
243+compile-time environment for a source file), and partly in order to give
244+the language a more imperative feel.
245+
246+You program Hoon as if you have a mutable environment, but you're
247+embedded in a purely functional, immutable context. While Hoon is a
248+purely functional language, many of its runes create a mutant copy of
249+the subject for manipulation by future runes (similar to Forth's stack
250+operations), which makes it feel more like an expression is "doing
251+something" rather than just calculating something.
252+
253+Everything about a scope, including name bindings, aliases, and
254+docstrings, is stored in the subject's type. This allows Hoon's
255+compilation discipline to be similarly minimal: the compiler is a
256+function from subject type and Hoon source to product type and compiled
257+Nock. Running this Nock against a value of the subject type produces a
258+vase of the result. It's hard to imagine a more streamlined formalism for compilation.
259+
260+The compilation discipline gets applied recursively to build the layers
261+of the Arvo stack. The Arvo kernel is compiled using the Hoon compiler
262+as subject, the Zuse standard library is compiled using the Arvo kernel
263+as the subject, and apps and vanes (kernel modules) are compiled using
264+Zuse as the subject.
265+
266+The promise of Urbit lies in its reimagination of the digital world
267+using components that are as constrained and limited as possible. By
268+adhering firmly to principle and doubling down on minimalism at every
269+turn, we get an OS that provides far stronger guarantees than Unix with
270+a thousand times less code. Given the complexity of modern software,
271+this is what's required to put personal computing back into the hands of
272+people.
content/blog/why-urbit-probably-does-not-need-a-blockchain.mdnew file+617
@@ -0,0 +1,617 @@
1++++
2+title = "Why Urbit Probably Doesn't Need a Blockchain"
3+date = 2016-07-14
4+description = "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/"]
6+[extra]
7+author = "Curtis Yarvin"
8+ship = "~sorreg-namtyv"
9+image = "https://storage.googleapis.com/media.urbit.org/site/posts/essays/why-urbit-probably-does-not-need-a-blockchain.jpg"
10++++
11+![](https://storage.googleapis.com/media.urbit.org/site/posts/essays/why-urbit-probably-does-not-need-a-blockchain.jpg)
12+
13+TLDR: Urbit (probably) doesn't need a blockchain, because the Urbit
14+address-space PKI is a special case of a consensus ledger (itself a
15+special case of Byzantine agreement).
16+
17+Special cases are often easier to solve than general problems. The
18+"New Jersey" or "worse-is-better" school of systems design emphasizes
19+solving any problem with the weakest possible tools.
20+
21+## The worse-is-better school
22+
23+Culturally, Urbit is best described as a functional stack built in the
24+"New Jersey" school of system software design, as described in Richard
25+Gabriel's famous
26+["worse is better"](https://en.wikipedia.org/wiki/Worse_is_better) essay.
27+
28+There are two kinds of mindsets when approaching hard technical
29+problems. The "MIT" mindset, more typical among mathematicians and
30+scientists, wants to attack the problem as its simplest and broadest
31+case, producing the most general and powerful solution available. In
32+short: better-is-better.
33+
34+The "New Jersey" worse-is-better mentality, more typical among
35+programmers 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
39+so it doesn't have this problem?
40+
41+Ideally, anyone building anything has both these mindsets in their
42+toolbox. But it's worth noting that (a) Jersey designs (meaning the
43+Bell Labs school that produced Unix, C, and Go) tend to beat MIT
44+designs in the marketplace, and (b) there are very few pure-functional
45+systems built with the true Jersey spirit.
46+
47+## Why Urbit (probably) doesn't need a blockchain
48+
49+Nakamoto consensus is an example of better-is-better. The blockchain
50+design is actually more powerful than it needs to be. It's not just a
51+trustless decentralized ledger; it's a trustless decentralized
52+database and (as Ethereum has realized; but this idea is clearly
53+present in Bitcoin's scripting language) a general-purpose, zero-trust
54+decentralized computer.
55+
56+Again, 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
60+much easier than the general case, which is why Urbit (probably)
61+doesn't need a blockchain.
62+
63+The 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
65+kind of general-purpose Byzantine agreement.
66+
67+## The double-sell problem
68+
69+Urbit has the same basic "double-spend" issue as Bitcoin. As Satoshi
70+puts it: "The problem of course is the payee can't verify that one of
71+the owners did not double-spend the coin." But Urbit is not a
72+currency, so we say "double-selling."
73+
74+"Double-selling" means signing over an Urbit address (_ship_) to two
75+different parties at the same time, presumably with the intent to sell
76+it to both and skip town with the loot.
77+
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
80+narrow special case: worse-is-better.
81+
82+Intuitively, Urbit's answer is that a real-estate transaction is
83+substantively a very different thing from a credit-card payment. No
84+real-estate agent ever has ever leaned over the desk, quickly grabbed
85+_both_ the check and the keys, and run laughing out the door.
86+
87+To understand more rigorously how Urbit is a special case, let's take
88+a quick look at the Urbit address space and PKI.
89+
90+## The Urbit address space and PKI
91+
92+(NB: this description differs in minor ways from the running code.
93+Where they differ, the description is right. Urbit is not at present
94+secure: use for entertainment purpose only.)
95+
96+An Urbit ship is an unsigned integer that serves four purposes: a
97+cryptographic identity, a packet routing address, a stateful virtual
98+computer, and a unique, human-memorable name.
99+
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
104+digital title system a smart 12-year-old would design.
105+
106+### Ships and wills
107+
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
111+128-bit ship is a _comet_.
112+
113+The chain of signatures for each ship is called a _will_. Unlike most
114+certificate 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_.
118+
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
121+ship whose bits are the bottom half of their formal width. For
122+instance, the star `0xbeef` is the prefix of the planet `0xdeadbeef`.
123+Galaxies have their fingerprints hardcoded in the official kernel.
124+
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
127+tiers, to superficially conceal prefix structure; for instance,
128+`0xdead.beef` is `~firbyr-napbes`, while `0xcafe.beef` is
129+`~nissep-sopnub`.
130+
131+### Parent hierarchy
132+
133+The prefix of a moon, planet, or star also becomes its _parent_. The
134+parent of a ship is its natural locus of federated services. The most
135+basic such service is to mediate P2P routing, as a so-called
136+"supernode." But the set of potential federated services is
137+unbounded.
138+
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
141+denial-of-service attacks by parents against children, stars and
142+planets can _exit_, choosing a new parent. An exit deed is a key
143+update also signed by the new parent.
144+
145+The full public cryptographic record of a ship is its _dossier_. The
146+dossier is the set of ship-will pairs, including all parents and
147+prefixes recursively, needed to validate the ship's current key. A
148+ship can process a dossier from an untrusted source.
149+
150+The full set of ship-will pairs a ship knows is its _cabinet_. So the
151+crucial question for PKI propagation is whether a submitted dossier is
152+accepted into a ship's cabinet.
153+
154+### Propagation race
155+
156+The rule is simple: any deeds in the dossier which are new (not
157+already in the cabinet) must not use keys superseded in the cabinet.
158+Otherwise revocation doesn't work. But revocation affects only
159+dossiers received in the future; nothing already in the cabinet can be
160+revoked.
161+
162+Intuitively, this algorithm creates a propagation race. Life `2` of
163+`~firbyr-napbes` revokes life `1` of `~firbyr-napbes`, so propagating
164+life `2` to the whole network ensures that anyone who steals the
165+private key for life `1` can't use it in any way -- whether to launch
166+children, or to sign a new, bogus life `2`.
167+
168+## Solving the special case
169+
170+So how can we solve the double-sell problem, for the special case of
171+the system designed above?
172+
173+### Double-spend relaying in Bitcoin
174+
175+The first thing we need to notice about our special case is that _even
176+Bitcoin_, not considered as a general consensus problem but just as a
177+decentralized payment rail, isn't that far from _not_ needing a
178+blockchain.
179+
180+As the Karame ["Two Bitcoins at the Price of
181+One"](http://eprint.iacr.org/2012/248.pdf) paper points out:
182+
183+> 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.
187+
188+"Fast Bitcoin payments" means zero-confirmation, ie, Bitcoin without
189+the blockchain. These double-spend alerts have never been integrated
190+into Bitcoin Core, despite frequent proposals. Given that Bitcoin
191+_does_ have a blockchain, it seems quite sensible for purists to shun
192+hacks that make zero-conf transactions somewhat more secure. Also,
193+double-spend alerts in Bitcoin are a DoS vulnerability; Bitcoin has
194+fees to control the cost of propagating transactions, but who pays for
195+an alert?
196+
197+In principle, however, we could imagine a version of Bitcoin without a
198+blockchain, in which the mempool was the ledger, and there was an
199+alerting and/or conflict model to detect and resolve double spends.
200+An accepted transaction is simply one that propagates to one or more
201+randomly chosen observer nodes.
202+
203+This 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
206+time, low-value zero-confirmation payments are commonly used.
207+
208+One 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?
212+
213+In the context of a gossip network that shares all the things, a
214+procedure that involves telling one person one thing, and another
215+person another conflicting thing, and not getting "hacked" by the
216+unfair world which believes there should be only one truth, is
217+inherently quite fragile. And where the attack is fragile, the
218+defense is robust.
219+
220+Most 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
223+perhaps we can solve it as a corner case.
224+
225+Again: _even Bitcoin_ isn't that far from being able to build a
226+practical decentralized ledger without a blockchain. The same gossip
227+model that broadcasts nonconflicting transactions is not at all
228+incapable of reacting to conflicting transactions. We're not really
229+recommending that Bitcoin ditch the blockchain, but this gives us hope
230+with our fundamentally easier problem.
231+
232+## Various specific specialnesses
233+
234+What are the differences between the Urbit double-sell problem and the
235+Bitcoin double-spend problem? Is our special case really, truly,
236+special?
237+
238+In 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.
240+
241+### Minimal transaction interdependency
242+
243+The first major technical difference between the Urbit title history
244+and the Bitcoin blockchain is that Bitcoin and its relatives are
245+designed to secure a complete, interdependent, collective transaction
246+history. Except for the parent-child relationship, Urbit wills are
247+independent of each other.
248+
249+Bitcoin'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
252+UTXO model, whose value in reducing dependencies may not match its
253+cost in complexity.)
254+
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
257+parent chain is self-validating and has no dependencies. There is no
258+collective history. There is no Merkle tree. There is no chain, with
259+or without blocks.
260+
261+This simplification doesn't eliminate the double-sell problem in
262+theory, but makes it much more tractable in practice. The set of past
263+transactions (key transfers) that a new transaction could conflict
264+with is much smaller.
265+
266+### Trust hierarchy and governance structure
267+
268+The second major technical difference is that Bitcoin is a flat,
269+trustless, fully decentralized system. Urbit has a hierarchical,
270+polycentric governance system which is a trust hierarchy.
271+
272+Now and for quite some time, urbits default to automatically accepting
273+OS updates from their parent, making this trust effectively absolute.
274+This is not a novelty -- all "evergreen" browsers now work this way.
275+You trust your browser quite a bit, which means you trust your browser
276+vendor.
277+
278+And since few Bitcoin node operators code their own daemons, the same
279+dependency on a source distribution exists in Bitcoin. It's informal
280+and off-chain, though, which is not really a good thing. (Urbit is
281+like if Bitcoin Core hotpatched itself automatically by publishing
282+source-code diffs on the blockchain.)
283+
284+To be on the safe side, we should think of Urbit as a centralized
285+system until the OS update that turns off automatic updates is
286+shipped. This of course requires a certain measure of perfection,
287+which cannot in any way be predicted.
288+
289+After Arvo proper becomes "deciduous" (apps will of course always be
290+remotely hotpatched), child-to-parent trust should diminish to the
291+power of the parent to deny service to the child. This will always be
292+present without some major redesign.
293+
294+But it's opposed by the equal and opposite power of the child to
295+switch 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
298+restaurant owner to deny you service does not give the food industry
299+the power to starve you to death.
300+
301+And if no parent wants your business, with 2^16 stars who could accept
302+it, you probably shouldn't be on the network at all. Urbit, like a
303+real society, is designed to be a network of incentives that holds
304+everyone in productive tension. We want everyone to be free, and no
305+one to be unaccountable.
306+
307+For example: a parent which extends its will also needs to send
308+updated signatures to its children and former children. Either will
309+otherwise be unable to propagate their dossiers to ships whose
310+cabinets have the updated parent will, _even if some other parent
311+adopts them_.
312+
313+But Urbit is a collectively governed and updatable system. A star or
314+galaxy which denies service to its own children will (a) get a bad
315+reputation, (b) drive its children to other parents, and (c) force the
316+network to hardcode a ship-specific exception into the propagation
317+algorithm, overriding stale-key revocation.
318+
319+In theory, a parent can extort its children by denying service. In
320+practice, since Urbit is self-governing, not ungoverned, and its
321+government 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
323+won't be necessary, and won't happen either.
324+
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,
327+imperfect decentralization, we'd like to get all the mileage out of it
328+that we can.
329+
330+Again, Urbit, not being a trustless system, does not have to solve the
331+trustless consensus problem -- although we still very much want to
332+minimize and bound the delegation of trust. This is an obvious
333+relaxation of Bitcoin's hard theoretical problem.
334+
335+### Routing: security through topology
336+
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
339+to be a joke.
340+
341+In 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
345+by the current owner?
346+
347+When the parent also forwards all packets until a P2P link is
348+established (Urbit forwarding resolves to STUN if either party has
349+full cone NAT, TURN if not), we can design in all kinds of
350+interactions between routing and certificate management.
351+
352+In 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.
355+
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
358+secure 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.
361+
362+### Latency and friction tolerance
363+
364+Confirmed Bitcoin payments aren't especially low-latency by payment
365+standards. They're reasonably low-friction by payment standards. But
366+fees are certainly a thing.
367+
368+Urbit is digital real estate, not digital money. When we look at the
369+standards of latency and friction in actual real estate -- where a
370+transaction that takes a week is super-fast, a 5% payment overhead is
371+normal, and a third-party intermediary is standard -- we see a much,
372+much weaker set of requirements.
373+
374+Obviously 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
376+level of performance Urbit can achieve, that's not necessarily the end
377+of the world for Urbit.
378+
379+For instance: if we wait a week for a double-sell alert, and we don't
380+see one, either the gossip network is totally hosed (to a point we'd
381+surely find out about), or there wasn't a double-sell. This stuff is
382+just not that hard.
383+
384+(One little-made point about Bitcoin, by the way, is that Bitcoin
385+enables trust-free _payments_, but not trust-free _exchanges_. The
386+seller still needs to deliver the goods either before or after the
387+payment; in either case, there is trust. Only Ethereum can solve this
388+problem -- and only for digital exchanges.)
389+
390+## We can afford to be patient
391+
392+With 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,
394+the details of that case are critical.
395+
396+But we actually don't know these details. One rule of the
397+worse-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,
399+with the better-is-better approach, the details don't matter at all.)
400+
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
404+is some threat model.
405+
406+Urbit 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
409+while.
410+
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
413+out the ballpark of solutions.
414+
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
417+clear that now, a decentralized DNS with cryptographic domain-name
418+titles would be extremely desirable. It was never designed to happen.
419+It will probably never happen.
420+
421+But if we look at when cryptographic DNS with allodial title _should_
422+have 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
424+no need to hurry here.
425+
426+## A map of the solution space
427+
428+But we still need a map of the worse-is-better ballpark. Let's look
429+at some options, from least secure to most.
430+
431+The essential question we can't answer, without a better sense of the
432+threat model, is how aggressively we need to propagate wills. We
433+especially are not sure about the threat model of malicious stars
434+(16-bit ships) and/or galaxies (8-bit ships).
435+
436+We 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
438+range of designs -- stretching all the way up to a full blockchain.
439+
440+### Acceptance model
441+
442+What doesn't change is the will _acceptance_ model. A ship will
443+always accept a new will if (a) the new will extends the old will, (b)
444+the parent signature on the initial public key is at least as recent
445+as the ship's current version of that parent.
446+
447+The parent clause implies that when a parent extends its will, it
448+needs to send updated initial signatures to all the children it's
449+launched. Otherwise, their own future updates will not be accepted by
450+ships that have seen the parent's update.
451+
452+This is not a big deal in the world of parent responsibilities. But
453+like many such responsibilities, it lets a badly operated parent deny
454+service to its children.
455+
456+A ship accepts all wills, new or updated, and stores them permanently.
457+If this is abused trivially as a DoS vector, Urbit will mitigate it by
458+the usual technique of degrading service to non-scarce ship tiers.
459+Scarcity rules.
460+
461+### Level 0: passive propagation only
462+
463+The Ames protocol can piggyback a will on any packet. Each ship also
464+permanently records which other ships hold which version of its own
465+will. An update is automatically sent when needed.
466+
467+With level 0 propagation, all key exchanges in Ames are passive and
468+invisible to the programmer. When the sender has no will or symmetric
469+key for the receiver, the packet is signed, bundled with the will, and
470+sent as cleartext.
471+
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
476+rare corner case up to the programmer is a classic worse-is-better
477+move.
478+
479+With level 0 propagation only (the current implementation, because we
480+don't even care about key updates yet), an updated does not
481+effectively revoke the old key. If Alice updates to a new key,
482+Mallory steals the old key, then Mallory talks to Bob before Alice
483+does, Mallory can impersonate Alice.
484+
485+So 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
487+decentralized yet).
488+
489+### Level 1: neighbor-only propagation with parent filtering
490+
491+The list of other ships which hold your will, essentially the list of
492+all ships you've talked to, is your list of _neighbors_. You
493+essentially have permanent, if perhaps very sporadic, conversations
494+with all your cryptographic neighbors. Symmetric keys time out fast,
495+but wills are held forever.
496+
497+By proactively pinging all your neighbors when you extend your will,
498+you prevent anyone who finds the old private key (ideally you update
499+when your old key is stale, not when it's actually been _stolen_) from
500+jumping into these conversations.
501+
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
504+your parent (who is always your neighbor) transforms it
505+
506+There 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
508+expected 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
510+sends it to Bob.
511+
512+In 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
515+Mallory has no way to reach Bob.
516+
517+Non-neighborly packets not matching this flow can't be accepted.
518+Suppose Mallory gets Bob's public IP address directly? If Bob gets a
519+non-forwarded packet marked "Alice," but Alice is not his neighbor,
520+that's super weird. He must reject the packet.
521+
522+Level 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
524+blockchain, it doesn't even need a gossip flood!
525+
526+And 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
529+Alice's latest will from the buyer's perspective. If Alice's seller
530+propagates a different fork to other ships, this damages Alice's
531+ability to communicate, but produces no obvious gain for the seller.
532+
533+Level 1 puts a lot of security weight on the parent. If Trent
534+misbehaves, 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
537+for a young Urbit, but will probably give way to level 2.
538+
539+### Level 2: broadcast all wills
540+
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
543+protocol.
544+
545+The only ships that can be transferred are galaxies, stars and
546+planets; 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
548+changing the lock on your front door counted as a real-estate
549+transaction, there are a lot fewer real-estate transactions than
550+credit-card payments.
551+
552+Moreover, conflict detection (double-sell alerts) is a natural part of
553+any gossip protocol. Gossip should be between stars, not directly
554+between planets; horizontal gossip, vertical distribution.
555+Star-to-planet distribution may still be limited.
556+
557+Especially since stars are somewhat trusted, ganking a gossip protocol
558+with 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
561+double-sell attack against its own planets, but code is always more
562+powerful than mere incentives.
563+
564+Finally, 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
566+statement is another type of will entry, involving a signature both
567+from the previous key and the new parent. You can only escape to
568+another ship of your parent's class that agrees to adopt you.
569+
570+In general, because escaping need to work for routing (without the
571+cooperation of the former parent), wills containing an exit statement
572+(a planet moving to a new star, or a star moving to a new galaxy)
573+exit) 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
575+much of a scaling problem.
576+
577+### Level 3: full blockchain
578+
579+Obviously a blockchain can solve Urbit's problem. Probably the right
580+thing 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
582+should not be confused with the orthogonal idea of representing Urbit
583+_invitations_ as colored coins.)
584+
585+This involves making all Urbit ships into Bitcoin SPV nodes at the
586+least. Not the worst fate in the world, but also a cost.
587+Alternatively, Urbit could have its own "altcoin" blockchain, with
588+actual Urbit-specific mining.
589+
590+Again, 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.
595+
596+## Retrospective note
597+
598+This essay has presented the Urbit cryptographic title as a low-power,
599+stripped-down, worse-is-better variation of Nakamoto consensus.
600+That's clearly the right way to introduce it in 2016.
601+
602+Actually, though, this part of Urbit was designed before the Bitcoin
603+paper was published. There were other academic approaches to
604+Byzantine consensus, but certainly none validated on a large scale as
605+Nakamoto consensus has been. It never seemed appropriate to treat
606+cryptographic titles to network addresses as a case of generalized
607+Byzantine consensus, and without the existence of Bitcoin there was no
608+temptation in this direction.
609+
610+In a sense the secret of PKIs is that PKIs are easy. What's hard is
611+adapting an existing identity and authorization structure into a PKI.
612+If you build the simplest possible PKI, then force the human processes
613+to 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
615+network, but building the network and the PKI as one system, many
616+simplifications are possible. This is once again the classic
617+worse-is-better method.
content/blog/your-last-computer.mdnew file+36
@@ -0,0 +1,36 @@
1++++
2+title = "Your Last Computer"
3+date = 2019-10-17
4+description = "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+[extra]
6+image = "https://media.urbit.org/site/understanding-urbit/your-last-computer/your-last-computer-waves%402x.png"
7++++
8+
9+This whole ‘simple, durable, yours’ thing may sound good, but what does it add up to? What does it feel like?
10+
11+First, let’s talk about what it should feel like in the future.
12+
13+
14+<img class="mv5 w-100" src="https://media.urbit.org/site/understanding-urbit/your-last-computer/your-last-computer-waves%402x.png">
15+
16+Imagine 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.
17+
18+You own and control this OS completely. Your system doesn’t live on someone else’s server, so there’s no risk of leaking it in a mass data breach or losing it when a service shuts down. Your Urbit is a sealed, secure, and durable system.
19+
20+<img class="ba mv5 w-100" src="https://media.urbit.org/site/understanding-urbit/your-last-computer/your-last-computer-is-rock%402x.png">
21+
22+We’re on our way to this future, building it step by step, but we’re not there yet. The Urbit of today is much more stripped down.
23+
24+The stripped-down Urbit – Urbit OS 1 – starts out as a new kind of social network.
25+
26+Today, each of our social tools does one thing. And so each of our communities ends up spanning multiple services. Urbit OS 1 gives you the tools to bring these together into one place.
27+
28+In Urbit OS 1, a community shares a set of modules. (Think of a module like an app without the data lock-in.) One community may choose to chat and share a forum. Another may choose to chat and watch the crypto markets. And yet another may chat, share links, ebooks, and a to-do list. Anyone can develop a module, and anyone can create a community.
29+
30+It’s a simple system for intentional digital communities. A first step away from the ill-formed digital world of today. We like to call it ‘social computing’ — on the surface it feels like a new kind of app, but under the hood it’s an OS. It’s customizable all the way down.
31+
32+We think that a new system like this, even in a simple form, will be a relief from the chaos of the current web. Think of it as a “back to the land” computing movement. If we’re ever going to build new digital cities, they’ll have to start as a few colonies on the frontier.
33+
34+<img class="mv5 w-100" src="https://media.urbit.org/site/understanding-urbit/your-last-computer/your-last-computer-ocean%402x.png">
35+
36+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.
content/bounties.mdnew file+9
@@ -0,0 +1,9 @@
1++++
2+title = "Bounties"
3++++
4+
5+We run a security bug bounty program with [HackerOne](https://hackerone.com). See the [Tlon Corp](https://hackerone.com/tlon/) page at HackerOne for more information.
6+
7+If you've found a vulnerablity, and you'd like to claim a bounty, please submit a report there. Note that our bounty program is currently focused on [Azimuth](https://github.com/urbit/azimuth) vulnerabilities.
8+
9+For general inquiries and disclosures, please contact our security team at [security@tlon.io](mailto:security@tlon.io).
content/community/_index.mdnew file+5
@@ -0,0 +1,5 @@
1++++
2+title = "Community"
3+sort_by = "weight"
4+template = "list.html"
5++++
content/community/community-grants.mdnew file+14
@@ -0,0 +1,14 @@
1++++
2+title = "Community Grants"
3+description = "Select Urbit address space grants for your group or community."
4+weight = 3
5+[extra]
6+hideprevious = "true"
7+hidenext = "true"
8++++
9+
10+Interested in getting your community on Urbit? We are currently accepting applications for select groups to get started on Urbit together using an [invite pool](/using/id/creating-an-invite-pool).
11+
12+To get started, fill out the application below. Any information you share will be held privately, and only for the purpose of consideration for the grant.
13+
14+<iframe src="https://docs.google.com/forms/d/e/1FAIpQLSf_uD5fUw6xqoxtzUhSwURFYO57XQl067N3vEdy7_rTD8T2VQ/viewform?embedded=true" width="640" height="1394" frameborder="0" marginheight="0" marginwidth="0">Loading…</iframe>
content/community/governance.mdnew file+25
@@ -0,0 +1,25 @@
1++++
2+title = "Governance"
3+description = "On the governance of the project, including both the senate of galaxies and the core developers."
4+aliases = ["/governance"]
5+weight = 4
6+[extra]
7+hideprevious = "true"
8+hidenext = "true"
9++++
10+
11+Our goal is to design Urbit simply, such that as many decisions as possible are made by the architecture of the system itself – that is, code should be law whenever possible. Code can’t anticipate every eventuality, however, and so the system design must include mechanisms that allow decisions to be made outside of the code.
12+
13+Within Urbit, this form of governance is conducted by two groups: the senate of galaxies, and the body of core developers. The senate of galaxies is empowered to make changes to the solidity contracts which define Azimuth, Urbit’s PKI, by majority vote. This process is defined by the contracts themselves.
14+
15+An owner of a galaxy (or a delegate) can propose a new iteration of the contract logic. The proposal can then be voted on for a period of thirty days. Once that period is over, if at least a quarter of the galaxies has voted, and the majority is in favor, the old logic contract will hand over the reigns to the new one.
16+
17+In a similar process, document hashes can be proposed. While their off-chain documents can't be "technically enforced", this mechanism is useful for the Senate to record more abstract decisions.
18+
19+For off-chain process around proposals, as suggested by core developers, please see [senate.md](https://github.com/urbit/azimuth/blob/master/senate.md).
20+
21+The group of core developers manages Urbit’s [GitHub repository](https://github.com/urbit/), which controls Arvo, Urbit’s operating system. Changes and upgrades are decided upon by consensus.
22+
23+You can participate in the governance of the senate by acquiring a galaxy. If you would like to be involved with the governance of Arvo, check out our [developer guide](/docs/development/develop) to learn how you can contribute to core development.
24+
25+
content/community/hoonschool.mdnew file+15
@@ -0,0 +1,15 @@
1++++
2+title = "Hoon School"
3+description = "A free, instructed, asynchronous program to learn Hoon with peers."
4+weight = 0
5+aliases = ["/hoonschool"]
6+[extra]
7+hideprevious = "true"
8+hidenext = "true"
9++++
10+
11+Hoon School and Hooniversity (the community run Hoon School project) are currently on hiatus pending a rework of the course.
12+
13+You can still apply below and we'll let you know when the new course is ready!
14+
15+<iframe id="apply" src="https://docs.google.com/forms/d/e/1FAIpQLSdcEoEqpFvB1WCTKPaYUSbJcjQ2nHk_z4XcZPIQc0SFD1rgmA/viewform?embedded=true" width="640" height="1350" frameborder="0" marginheight="0" marginwidth="0">Loading…</iframe>
content/community/hosting-a-meetup.mdnew file+82
@@ -0,0 +1,82 @@
1++++
2+title = "Hosting a Meetup"
3+description = "Best practices for hosting your Urbit meetups."
4+weight = 2
5+[extra]
6+flatten_pagination = "true"
7+hidenext = "true"
8+hide_previous_title = "true"
9++++
10+
11+There are already [a few](../meetups) Urbit meetups that take place in cities around the United States. Want to start a meetup in your home town? Consider these best practices.
12+
13+### Create the Meetup Group Online
14+
15+The most straightforward way to start a meetup group online, like on [meetup.com](www.meetup.com). Services like this offer messaging, calendaring, payments, discussion boards, and basic group profiles.
16+
17+There are other options available but, regardless of what you choose, there should be a public place on the Web for people to access the group.
18+
19+Group suggestions:
20+
21+- Meetup.com
22+- Google groups
23+- Dedicated Website
24+
25+### Spread the word
26+
27+It’s not much fun if people don’t actually show up, so it’s important to get the word out. Use your existing network to tell people about your event. Remember it takes time to build a community, so don’t be discouraged if only a few people show up at first. Post to social media and email your friends. Also, be sure to email [support@urbit.org](mailto:support@urbit.org), and we'll promote your meetup.
28+
29+Outreach methods:
30+
31+- Post to social media
32+- Email your friends
33+- Put up signs
34+
35+### Format
36+
37+Meetups are about sharing ideas and meeting like-minded people. There are a few formats that can help achieve this goal. As the organizer, take the lead and prepare ahead of time. Think of some topics for the group to discuss, and try to ensure that the conversation isn’t dominated by one or two people.
38+
39+Presentations and guided group discussions are great ways to share ideas. If you have a speaker for your event, coordinate ahead of time and make sure they have everything they will need to make a great presentation and ask them to arrive early to the event. If you have a speaker, be sure to record the talk so that it can be posted online.
40+
41+Format considerations:
42+
43+- Guided group discussion
44+- Presentation
45+
46+### Venue
47+
48+Your meeting location can determine the success of your event. Ideally, you’d want to be away from congested areas and find locations with good parking and transit options nearby. However, this isn’t always possible, so just do your best to accommodate. It’s also a good idea to locate the event near bars or restaurants so people can continue the conversation after the event officially ends.
49+
50+Location considerations:
51+
52+- Easily reachable
53+- Consider parking and distance to transit
54+- Check out public libraries
55+- Coworking spaces
56+- [peerspace.com](https://www.peerspace.com/)
57+
58+### Date and time
59+
60+Most people are able to attend meetups after work on non-holiday weekdays, between about 6-8pm. This isn’t true for everyone but it’s a good rule of thumb. It’s also a good idea to avoid holidays and days when there are large sporting events happening.
61+
62+Date considerations:
63+
64+- Weekdays
65+- Between 6pm and 8pm
66+- Avoid holidays and weekends
67+
68+### Stay consistent
69+
70+Like basically anything worth doing, meetups take time, patience, and consistency. Come prepared to engage with people and have a good time. The more often you can meet the stronger the community can become, so schedule meetups regularly.
71+
72+### Bonus
73+
74+Here are a few tips and tricks to consider with hosting a meetup. You don’t have to have all these things at your first meeting, but try adding them in as you go.
75+
76+- Names tags
77+- Door signs
78+- Projector
79+- Extension cords and power strips
80+- Video camera
81+- Lapel microphone
82+- Bring your own internet
content/community/meetups.mdnew file+51
@@ -0,0 +1,51 @@
1++++
2+title = "Meetups"
3+aliases = ["/meetups"]
4+description = "Information on Urbit meetups and other community-led, Urbit IRL groups."
5+weight = 1
6+[extra]
7+flatten_pagination = "true"
8+hideprevious = "true"
9+hide_next_title = "true"
10++++
11+
12+<picture>
13+<source src="https://media.urbit.org/site/meetup1.jpg">
14+<img class="mt4" src="https://media.urbit.org/site/meetup1.jpg"/>
15+</picture>
16+
17+Turns out that getting Urbit fans together in one room is pretty fun. Here's an incomplete list of community-led Urbit IRL groups. These events are generally informal and very approachable – feel free to dive in.
18+
19+Interested in hosting an Urbit event of your own? Follow our [guide to meetup best-practices](../hosting-a-meetup). Send an email to [support@urbit.org](mailto:support@urbit.org) and we'll list your meetup on this page.
20+
21+### Asia
22+
23+Location | Contact information
24+:------------ | :-------------
25+Moscow, RU | [Timepad](https://urbitmoscow.timepad.ru/events/)
26+
27+### Europe
28+
29+Location | Contact information
30+:------------ | :-------------
31+Copenhagen, DK | [Twitter](https://twitter.com/UrbitCPH), [Meetup.com](https://www.meetup.com/Urbit-Copenhagen/)
32+
33+### North America
34+
35+Location | Contact information
36+:------------ | :-------------
37+Phoenix, AZ | [Twitter](https://twitter.com/UrbitPHX), [Meetup.com](https://www.meetup.com/urbit-phx/)
38+San Francisco, CA | [Meetup.com](https://www.meetup.com/urbit-sf/)
39+New York, NY | [Meetup.com](https://www.meetup.com/Urbit-New-York/)
40+Toronto, ON | [Twitter](https://twitter.com/UrbitToronto), [Meetup.com](https://www.meetup.com/Urbit-Toronto/)
41+Eugene, OR | [Twitter](https://twitter.com/EugeneUrbit)
42+Austin, TX | [Meetup.com](https://www.meetup.com/Urbit-Austin/)
43+Denton, TX | [Twitter](https://twitter.com/UrbitDFW)
44+Seattle, WA | [Meetup.com](https://www.meetup.com/urbit-seattle/)
45+
46+
47+### Oceania
48+
49+Location | Contact information
50+:------------ | :-------------
51+Sydney, AU | [Meetup.com](https://www.meetup.com/Urbit-Sydney)
content/docs/.gitignorenew file+4
@@ -0,0 +1,4 @@
1+# OS
2+.DS_Store
3+# etc
4+*.swn
content/docs/.gitmodulesnew file+3
@@ -0,0 +1,3 @@
1+[submodule "docs/hoon/workbook"]
2+ path = docs/hoon/workbook
3+ url = git@github.com:urbit/hoon-workbook.git
content/docs/LICENSEnew file+21
@@ -0,0 +1,21 @@
1+MIT License
2+
3+Copyright (c) 2019 Tlon Corporation
4+
5+Permission is hereby granted, free of charge, to any person obtaining a copy
6+of this software and associated documentation files (the "Software"), to deal
7+in the Software without restriction, including without limitation the rights
8+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
9+copies of the Software, and to permit persons to whom the Software is
10+furnished to do so, subject to the following conditions:
11+
12+The above copyright notice and this permission notice shall be included in all
13+copies or substantial portions of the Software.
14+
15+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
18+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
20+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
21+SOFTWARE.
content/docs/README.markdownnew file+3
@@ -0,0 +1,3 @@
1+# Urbit Docs
2+
3+Urbit documentation as it appears on [urbit.org](https://urbit.org/docs/).
content/docs/_index.mdnew file+56
@@ -0,0 +1,56 @@
1++++
2+title = "Development Docs"
3+weight = 1
4+template = "sections/docs.html"
5++++
6+
7+Welcome to the developer documentation for the Urbit project. This documentation
8+is 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
10+welcome.
11+
12+This documentation provides a series of explainers, guides, tutorials and
13+reference material for assisting you in developing on the Urbit platform, or
14+contributing to the Urbit project. If you're looking for documentation on how to
15+*use* your Urbit ship, see our [usage docs](/using/).
16+
17+### [Development](/docs/development/)
18+
19+The Development section is recommended reading for developers interested in
20+contributing to Urbit itself, or building apps on top of Urbit. It serves as a
21+high-level orientation to how to set up a development environment, the various
22+codebases that comprise the project, our grants program, and the precepts that
23+drive the development of Urbit.
24+
25+### [System Overview](/docs/system-overview/)
26+
27+This section gives a high-level overview to all the major components of the
28+Urbit tech stack - namely, the operating system Arvo, the programming languages
29+Nock and Hoon, the runtime Vere, and the decentralized ID system Azimuth.
30+
31+### [Arvo (Urbit OS)](/docs/arvo/)
32+
33+This section covers the kernel of Urbit OS, called Arvo, as well as its kernel modules.
34+
35+### [Hoon (High-level Language)](/docs/hoon/)
36+
37+Here is contained all official documentation on Hoon, the high-level purely
38+functional programming language in which Arvo and much of userspace is written.
39+
40+### [Nock (Low-level Language)](/docs/nock/)
41+
42+Official guidance on Nock, the functional assembly-level language which serves
43+as the basis for Hoon.
44+
45+### [Vere (Interpreter)](/docs/vere/)
46+
47+Documentation on Vere, the Nock virtual machine which serves as the interface
48+between Urbit and Unix.
49+
50+### [Azimuth (Urbit ID)](/docs/azimuth/)
51+
52+The workings of Azimuth, the decentralized ID system utilized by Urbit.
53+
54+### [Userspace](/docs/userspace/)
55+
56+Developer guides for Gall (the vane for controlling userspace apps), Landscape (the web client by which most users interact with their ship), and Threads (transient apps for IO).
content/docs/anchors.pynew file+135
@@ -0,0 +1,135 @@
1+#!/usr/bin/env python3
2+
3+import os
4+import sys
5+from pathlib import Path
6+from typing import List, Tuple
7+
8+
9+# inspired by weights.sh
10+
11+# NOTE: This script does not prevent you from shooting yourself in the foot.
12+# If you manually set a bogus value for insert_anchor_links it will not fix it for you
13+"""
14+1. get a list of all .md files
15+2. for each md file
16+ a. get front matter
17+ b. get value of key `insert_anchor_links`, default to none if not present
18+ c. output a tuple of (setting, file)
19+3. accumulate all anchor setting values for all md files
20+4. write tuple to 'anchors' file, prompt to edit, open in preferred editor
21+5. once prompt is answered, read back file
22+6. read edited 'anchors' file, overwrite new setting for each file
23+"""
24+
25+ANCHOR_KEY = "insert_anchor_links = "
26+ANCHOR_FILE = "anchors"
27+
28+def nth_occurrence(arr, target_value, wanted_idx):
29+ return [idx for idx, val in enumerate(arr) if val == target_value][wanted_idx - 1]
30+
31+def validate_entry(setting: str, file: str):
32+ if not setting in ["left", "right", "none"]:
33+ sys.exit(f"Invalid setting '{setting}' provided for file '{file}'")
34+
35+
36+def find_all_mds() -> List[str]:
37+ # the `insert_anchor_links` is only applicable on `_index.md` files (i.e. sections)
38+ return [str(p) for p in Path('./').rglob('**/.md')]
39+
40+def setting_from_frontmatter(lines: List[str]) -> str:
41+ # 'insert_anchor_links = "none"' -> 'none'
42+ for line in lines:
43+ if line.startswith(ANCHOR_KEY):
44+ # 1. 'insert_anchor_links = "none"\n'
45+ # 2. ['insert_anchor_links = ' '"none"\n'][1] => '"none"\n'
46+ # 3. "none\n"
47+ # 4. "none"
48+ return line \
49+ .split(ANCHOR_KEY)[1] \
50+ .replace('\"', '') \
51+ .replace('\n', '')
52+
53+ return "none" # default setting if key not present
54+
55+def anchors_from_frontmatter(md_files: List[str]) -> List[Tuple[str, str]]:
56+ # returns tuple(setting, file)
57+ anchor_settings = []
58+
59+ for md_file in md_files:
60+ with open(md_file, "r") as f:
61+ lines = f.readlines()
62+ setting = setting_from_frontmatter(lines)
63+ anchor_settings.append((setting, md_file))
64+
65+ return anchor_settings
66+
67+def write_anchor_file(anchor_settings: List[Tuple[str, str]]):
68+ with open(ANCHOR_FILE, "w+") as f:
69+ for setting, file in anchor_settings:
70+ f.write(f"{setting} {file}\n")
71+
72+
73+def prompt_editor():
74+ editor = os.getenv('EDITOR', 'nano')
75+ os.system(f"{editor} {ANCHOR_FILE}")
76+ input("Edit the anchor settings and press enter...")
77+
78+def read_anchor_file() -> List[Tuple[str, str]]:
79+ anchor_settings = []
80+
81+ with open(ANCHOR_FILE, "r") as f:
82+ for line in f:
83+ line = line.replace('\n', '')
84+ setting, file = line.split(' ')
85+ anchor_settings.append((setting, file))
86+
87+ return anchor_settings
88+
89+
90+def write_entry(setting: str, file: str):
91+ validate_entry(setting, file)
92+
93+
94+ # not optimized
95+ with open(file, "r+") as f:
96+ lines = f.readlines()
97+ # lines = list(filter(bool, text.split('\n'))) # split text by lines,
98+ fm_end = nth_occurrence(lines, "+++\n", 2) # get index of end of front matter (signaled by second '+++')
99+
100+ # remove existing setting if it exists
101+ for line in lines[:fm_end]:
102+ if line.startswith(ANCHOR_KEY):
103+ lines.remove(line)
104+ fm_end -= 1 # correct the index for the removal
105+
106+ if setting != "none":
107+ # by default, there is no need to specify "none"
108+ lines.insert(fm_end, ANCHOR_KEY + f'"{setting}"' + '\n') # insert the setting right before the end of front matter
109+ f.seek(0) # go to beginning of file
110+ f.writelines(lines) # overwrite with new contents
111+ f.truncate() # idk why but necessary for bug-free behviour (otherwise it adds excess newlines and stuff)
112+
113+
114+
115+def anchors_to_frontmatter(anchor_settings: List[Tuple[str, str]]):
116+ for setting, file in anchor_settings:
117+ write_entry(setting, file)
118+
119+def cleanup():
120+ os.remove("anchors")
121+
122+
123+def main():
124+ files = find_all_mds()
125+ print(f'found {len(files)} .md files')
126+ write_anchor_file(anchors_from_frontmatter(files))
127+ prompt_editor()
128+ anchors_to_frontmatter(read_anchor_file())
129+ cleanup()
130+ print('done')
131+
132+
133+if __name__ == '__main__':
134+ main()
135+
content/docs/arvo/_index.mdnew file+55
@@ -0,0 +1,55 @@
1++++
2+title = "Arvo"
3+weight = 300
4+sort_by = "weight"
5+template = "sections/docs/chapters.html"
6+aliases = ["/docs/learn/arvo/"]
7++++
8+
9+Resources about the Urbit OS.
10+
11+## [Overview](/docs/arvo/overview)
12+
13+Arvo is Urbit's functional operating system, written in [Hoon](/docs/hoon/hoon-school/). It's composed of modules called _vanes_, each of which has its own folder:
14+
15+## [Ames](/docs/arvo/ames/ames)
16+
17+Ames is the name of our network and the vane that communicates over it. It's an encrypted P2P network composed of instances of the Arvo operating system.
18+
19+## [Behn](/docs/arvo/behn/behn)
20+
21+Behn is our timer. It allows vanes and applications to set and timer events, which are managed in a simple priority queue.
22+
23+## [Clay](/docs/arvo/clay/clay)
24+
25+Clay is our filesystem and revision-control system.
26+
27+## [Dill](/docs/arvo/dill/dill)
28+
29+Dill is our terminal driver. Unix sends keyboard events to dill from the terminal, and dill produces terminal output.
30+
31+## [Eyre](/docs/arvo/eyre/eyre)
32+
33+Eyre is our HTTP server. Unix sends HTTP messages to `%eyre`, and `%eyre` produces HTTP messages in response.
34+
35+## [Ford](/docs/arvo/ford/ford)
36+
37+Ford is our build system. It handles resources and publishing.
38+
39+## [Gall](/docs/arvo/gall/overview)
40+
41+Gall is the vane for controlling userspace apps.
42+
43+## [Iris](/docs/arvo/iris/iris-api)
44+
45+Iris is our HTTP client.
46+
47+## [Concepts](/docs/arvo/concepts/)
48+
49+Explanations of design decisions that are pervasive throughout Arvo.
50+
51+## [Tutorials](/docs/arvo/tutorials/)
52+
53+Walkthroughs that teach you more about how Arvo works.
54+
55+
content/docs/arvo/ames/_index.mdnew file+7
@@ -0,0 +1,7 @@
1++++
2+title = "Ames"
3+weight = 10
4+sort_by = "weight"
5+template = "sections/docs/chapters.html"
6+insert_anchor_links = "right"
7++++
content/docs/arvo/ames/ames-api.mdnew file+292
@@ -0,0 +1,292 @@
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/ames.mdnew file+423
@@ -0,0 +1,423 @@
1++++
2+title = "Overview"
3+weight = 1
4+template = "doc.html"
5+aliases = ["/docs/learn/arvo/ames/"]
6++++
7+Our networking protocol.
8+
9+Ames is the name of both our network and the vane that communicates
10+over it. When Unix receives a packet over the correct UDP port, it pipes
11+it straight into Ames for handling. Also, all packets sent over the
12+Ames network are sent by the Ames vane. Apps and vanes may use
13+Ames to directly send messages to other ships. In general, apps use
14+[Gall](/docs/userspace/gall/gall) and [Clay](/docs/arvo/clay/clay)
15+to communicate with other ships rather than using Ames
16+directly, but this isn't a requirement. Of course, Gall and Clay use
17+Ames behind the scenes to communicate across the network. Jael is the only other
18+vane to utilize Ames.
19+
20+Ames includes several significant components. Although the actual
21+crypto algorithms are defined in `zuse`, they're used extensively in
22+Ames for encrypting and decrypting packets. Congestion control and
23+routing is handled entirely in Ames. Finally, the actual Ames
24+protocol itself, including how to route incoming packets to the correct
25+vane or app, is defined in Ames.
26+
27+## Technical Overview
28+This section summarizes the design of Ames. Beyond this section are deeper
29+elaborations on the concepts presented here.
30+
31+Ames extends [Arvo's](/docs/arvo/overview) `%pass`/`%give` `move` semantics across the network.
32+
33+Ames receives packets as Arvo events and emits packets as Arvo
34+effects. The runtime is responsible for transferring the bytes in
35+an Ames packet across a physical network to another ship.
36+
37+The runtime tells Ames which physical address a packet came from,
38+represented as an opaque atom. Ames can emit a packet effect to
39+one of those opaque atoms or to the Urbit address of a galaxy
40+(root node), which the runtime is responsible for translating to a
41+physical address. One runtime implementation sends UDP packets
42+using IPv4 addresses for ships and DNS lookups for galaxies, but
43+other implementations may overlay over other kinds of networks.
44+
45+A local vane can pass Ames a `%plea` request message. Ames
46+transmits the message over the wire to the peer ship's Ames, which
47+passes the message to the destination vane.
48+
49+Once the peer has processed the `%plea` message, it sends a
50+message-acknowledgment packet over the wire back to the local
51+Ames. This "ack" can either be positive to indicate the request was
52+processed, or negative to indicate the request failed, in which
53+case it's called a "nack". (Don't confuse Ames nacks with TCP
54+nacks, which are a different concept).
55+
56+When the local Ames receives either a positive message-ack or a
57+combination of a nack and "naxplanation" (explained in more detail
58+below), it gives an `%done` `move` to the local vane that had
59+requested the original `%plea` message be sent.
60+
61+A local vane can give Ames zero or more `%boon` response messages in
62+response to a `%plea`, on the same duct that Ames used to pass the
63+`%plea` to the vane. Ames transmits a `%boon` over the wire to the
64+peer's Ames, which gives it to the destination vane on the same
65+duct the vane had used to pass the original `%plea` to Ames.
66+
67+`%boon` messages are acked automatically by the receiver Ames. They
68+cannot be nacked, and Ames only uses the ack internally, without
69+notifying the client vane that gave Ames the `%boon`.
70+
71+If the Arvo event that completed receipt of a `%boon` message
72+crashes, Ames instead sends the client vane a `%lost` message
73+indicating the `%boon` was missed.
74+
75+`%plea` messages can be nacked, in which case the peer will send
76+both a message-nack packet and a naxplanation message, which is
77+sent in a way that does not interfere with normal operation. The
78+naxplanation is sent as a full Ames message, instead of just a
79+packet, because the contained error information can be arbitrarily
80+large. A naxplanation can only give rise to a positive ack --
81+never ack an ack, and never nack a naxplanation.
82+
83+Ames guarantees a total ordering of messages within a "flow",
84+identified in other vanes by a duct and over the wire by a `bone`:
85+an opaque number. Each flow has a FIFO (first-in-first-out) queue of `%plea` requests
86+from the requesting ship to the responding ship and a FIFO queue
87+of `%boon`'s in the other direction.
88+
89+Message order across flows is not specified and may vary based on
90+network conditions.
91+
92+Ames guarantees that a message will only be delivered once to the
93+destination vane.
94+
95+Ames encrypts every message using symmetric-key encryption by
96+performing an elliptic curve Diffie-Hellman using our private key
97+and the public key of the peer. For ships in the Jael PKI
98+(public-key infrastructure), Ames looks up the peer's public key
99+from Jael. Comets (128-bit ephemeral addresses) are not
100+cryptographic assets and must self-attest over Ames by sending a
101+single self-signed packet containing their public key.
102+
103+When a peer suffers a continuity breach, Ames removes all
104+messaging state related to it. Ames does not guarantee that all
105+messages will be fully delivered to the now-stale peer. From
106+Ames's perspective, the newly restarted peer is a new ship.
107+Ames's guarantees are not maintained across a breach.
108+
109+A vane can pass Ames a `%heed` `$task` to request Ames track a peer's
110+responsiveness. If our `%boon`'s to it start backing up locally,
111+Ames will give a `%clog` back to the requesting vane containing the
112+unresponsive peer's urbit address. This interaction does not use
113+ducts as unique keys. Stop tracking a peer by sending Ames a
114+`%jilt` `$task`.
115+
116+Debug output can be adjusted using `%sift` and `%spew` `$task`'s.
117+
118+## Packets
119+
120+Ames datagram packets are handled as nouns internally by Arvo but as serial data
121+by Unix. In this section we describe how packets are formed, serialized, and relayed.
122+
123+### Packet format
124+
125+There is a 32-bit header followed by a variable width body.
126+
127+#### Header
128+
129+The 32-bit header is given by the following data, presented in order:
130+
131+ - 3 bits: Ames `protocol-version`,
132+ - 20 bits: a checksum as a truncated insecure hash of the body, done with
133+ [`+mug`](/docs/hoon/reference/stdlib/2e#mug),
134+ - 2 bits: the bit width of the sender address encoded as a 2-bit enum,
135+ - 2 bits: the bit width of the receiver address encoded as a 2-bit enum,
136+ - 1 bit: whether the packet is encrypted or not,
137+ - 4 bits: unused.
138+
139+ Every packet sent between ships is encrypted except for self-signed attestation packets from 128-bit comets.
140+
141+#### Body
142+
143+The body is of variable length and consists of three parts in this order:
144+
145+ - The `@p` of the sending ship,
146+ - The `@p` of the receiving ship,
147+ - The payload, which is the [`+jam`](/docs/hoon/reference/stdlib/2p#jam) (i.e. serialization) of the noun `[origin content]`.
148+
149+ `origin` is the IP and port of the original sender if the packet was proxied
150+ through a relay and null otherwise. `content` is a noun that is either an encrypted ack or an
151+ encrypted message fragment, unless it is a comet attestation packet in which
152+ case it is unencrypted. `content` is always 1kB in size or less.
153+
154+ The sender and receiver live outside of the jammed data section to simplify
155+ packet filtering for the interpreter.
156+
157+### Packeting
158+
159+When Ames has a message to be sent it must first determine how many packets are
160+required to send the message. To do this, it first `+jam`s the
161+message, producing an atom. Ames checks how large the atom is, and if it is
162+bigger than a kilobyte it will split it into packets whose payloads are 1 kB or
163+less. It then numbers each one - this is message 17, packet 12, this is message
164+17, packet 13, etc., so that when the receiver receives these packets it knows
165+which number they are. Finally it encrypts each individual packet and enqueues
166+them to be sent along their stated flow.
167+
168+Network packets aren't always received in order, so this numbering is important
169+for reconstruction, and also packets may get lost. So Ames does transmission
170+control (the TC in TCP) to solve this problem. It makes sure that all packets
171+eventually get through, and when the other side gets them it can put them in the
172+correct order. If Ames doesn't get an ack on a packet then it will resend it
173+until it does. The logic for determining how many packets to send or re-send at what time is performed by an Ames-specific variant of TCP's "NewReno" congestion control algorithm.
174+
175+As each packet in a message is received, Ames decrypts it and stores the message fragment. Once it's received every packet for a message, Ames concatenates the fragments back into a single large atom and uses `+cue` to deserialize that back into the original message noun.
176+
177+
178+
179+### Acks and Nacks
180+
181+In this section we discuss acks and nacks. In Ames, an "ack", short for "acknowledgment", is a small packet attesting that a piece of information (either a packet or a whole message) was received. Ames makes use of
182+acks to maintain synchronization between two communicating parties. Nacks are 'negative
183+acknowledgments' and are used when something goes wrong.
184+
185+#### Acks
186+
187+Every message (i.e. a `%plea` or `%boon`) is split up by Ames into some number
188+of _fragments_ that are 1kB in size or less. The fragments are then encrypted
189+and encapsulated into
190+packets and sent along a flow. The message will be considered successfully
191+received once the sender has received the appropriate set of acks in response,
192+defined as follows.
193+
194+There are two types of acks: fragment acks and message acks. Acks are
195+not considered messages, and thus are not `%plea`s or `%boon`s. Given a message split into N
196+fragments, the sender of the message will expect N-1 fragment acks followed
197+by exactly one message ack (ignoring any duplicate packets, which are idempotent
198+from the perspective of the application). This is because the receiver
199+will send a fragment ack for the first N-1 packets it received, and what
200+would have been the final fragment ack will instead be a message ack.
201+
202+Acks are considered to be part of the flow in which that `%plea` or
203+`%boon` lives, as the packets containing their fragments and packets acking the
204+receipt of those packets are considered to be what makes up a given message.
205+Thus a message-level ack must be received before the next message on the flow
206+can begin. The full story is more complicated than this; see the section on
207+[flows](#flows).
208+
209+
210+#### Nacks
211+
212+A nack indicates a negative acknowledgement to a `%plea`, meaning that the
213+requested action was not performed.
214+
215+`%boon`s and naxplanations are never nacked.
216+Individual packets are also never nacked, only complete `%plea` messages are.
217+Whether a malformed packet causes a `%plea` to be nacked depends on its content.
218+In the case of an incorrect checksum or a failure to decrypt then Ames drops the
219+packet and it is as though it never happened. However, if the packet does
220+decrypt and has invalid ciphertext (i.e. something other than a jammed
221+`$shutpacket` data structure), then Ames will nack the whole `%plea` since that
222+indicates that the peer is misbehaving. Eventually Ames should also present a
223+warning to the user that the peer is untrustworthy.
224+
225+A nack will be accompanied by a naxplanation, which is a special type of`%boon`
226+that uses its own `bone` (see [flows](#flows)). Ames won't give the vane that requested the
227+initial `%plea` a nack until it also receives the naxplanation, which it will send to
228+the vane as a `%done` gift. Naxplanations may only be acked, never nacked.
229+Furthermore, naxplanations can only ever be sent as a rejection of a `%plea` -
230+the receiver will never both perform a `%plea` and return a naxplanation.
231+
232+#### (N)ack packets
233+
234+A fragment ack's contents (before encryption) are a pure function of the
235+following noun:
236+```hoon
237+[our-life her-life bone message-num fragment-num]
238+```
239+This means all re-sends of an ack packet will be bitwise identical to each other, unless one of the peers changes its encryption keys.
240+
241+Each datum in this noun is an atom with the aura `@ud` or an aura that nests
242+under `@ud`.
243+
244+Here, `our-life` refers to the [`life`](/docs/glossary/breach), or revision
245+number, of the acking ship's networking keys, and `her-life` is the `life` of
246+the ack-receiving ship's networking keys. `bone` is an opaque number identifying
247+the flow. `message-num` denotes the number of the
248+message in the flow identified by `bone`. `fragment-num` denotes the number of
249+the fragment of the message identified by `message-num` that is being acked.
250+
251+A message (n)ack is a different kind of ack that is obtained by encrypting the
252+`+jam` of the following noun:
253+
254+```hoon
255+[our-life her-life bone message-num ok=? lag=@dr]
256+```
257+`ok` is a flag that is set to `%.y` for a message ack and `%.n` for a message
258+nack. In the future, `lag` will be used to
259+describe the time it took to process a message, but for now it is always zero.
260+
261+
262+### Flows
263+
264+Flows are asymmetric communication channels along which two ships send and
265+receive packets, and all Ames packets are part of some flow.
266+
267+To create a new flow, a ship sends a
268+`%plea` to another ship. Only the creator of the flow may send `%plea`s, and the
269+other party may only send `%boon`s. In this sense flows are asymmetric.
270+
271+The sequence of `%plea`s in a flow is totally ordered, though
272+the packets which make them up need not be. `%boon`s are totally ordered in the
273+same fashion, but there is not a coordinated ordering between `%plea`s and
274+`%boon`s in a given flow beyond the implicit one arising from the fact that a
275+`%boon` is always a response to a `%plea`. A `%plea` can give rise to zero, one,
276+or many `%boon`s.
277+
278+Inside of Ames, each flow has four sequential opaque `@ud`s
279+called bones that are unique to that flow. Thus the flow itself is often
280+referred to by its first bone. Each bone is a one-way street
281+for packets to travel along, so e.g. acks to packets making up a `%plea` are
282+sent along a different bone than the `%plea`.
283+
284+We give an example of such a partition. Let flow 12 be a flow between `~bacbel-tagfeg` and `~worwel-sipnum` with
285+`~bacbel-tagfeg` as the `%plea` sender. Then bones 12-15 are associated with the
286+flow, and the types of packets for each bone are:
287+
288+ - bone 12, `%plea`s and acks to `~worwel-sipnum`,
289+ - bone 13, `%boon`s and (n)acks to `~bacbel-tagfeg`,
290+ - bone 14, acks of naxplanations to `~worwel-sipnum`,
291+ - bone 15, naxplanations to `~bacbel-tagfeg`.
292+
293+Each bone is handled separately by congestion control, and this is one reason
294+for their segregation. For example, say a two-packet `%plea` is sent on bone 12,
295+with `~bacbel-tagfeg` requesting to join a group on `~worwel-sipnum`.
296+Then `~worwel-sipnum` can ack the first packet on bone 13, and then send a nack
297+on bone 13 as well. A nack by itself contains no information as to why the nack
298+happened. Then `~worwel-sipnum` can also send a naxplanation on bone 15 saying
299+to `~bacbel-tagfeg` that they cannot join the group, to which an ack is received
300+on bone 14.
301+
302+Another reason to separate bones is to avoid race conditions. If
303+`~worwel-sipnum` and `~bacbel-tagfeg` attempt to start a flow with each other at
304+the same time we do not wish there to be a conflict when they receive each
305+others' packets. Flipping the last bit of the bone based on whether a packet is
306+an ack or a message fragment allows for `~worwel-sipnum` to create flow 8 with
307+`~bacbel-tagfeg` without coming into conflict with the flow 8 `~bacbel-tagfeg`
308+created for `~worwel-sipnum`.
309+
310+`%plea`s and `%boon`s are handled on separate bones so that e.g. sending a large
311+`%boon` doesn't stop an additional `%plea` from being received. It is also
312+simply cleaner to make each bone one-way. Acks and nacks are very small packets
313+as well as integral to controlling the total orderings on `%plea`s and `%boon`s
314+and so they are included on these bones as well.
315+
316+Naxplanations can potentially be very large, as they often contain things like stack
317+traces or other crash reports. Thus it is undesirable to have them share a bone
318+with `%boon`s and create congestion there. So naxplanations have their own bone,
319+and so do acks to packets that make up a naxplanation, as well as the
320+message-level naxplanation ack.
321+
322+### Packet relaying
323+
324+Here we describes how the Ames network relays packets. We ignore all details
325+about UDP, which occurs at a lower layer than Ames.
326+
327+When a ship first contacts another ship, it may only know its `@p`, but an IP
328+address and port are necessary for peer-to-peer communication to occur.
329+Thus the initial correspondence between two ships, or additional correspondence
330+following a change in IP or port of one of the parties, will need to be relayed
331+by an intermediary that knows the IP and port of the receiving ship.
332+
333+For now packet relaying is handled entirely by galaxies. Every galaxy is
334+responsible for knowing the IP and port of every planet underneath it. In the
335+future, galaxies will only need to know the star sponsoring a planet, and stars
336+will be responsible for the final step of the relay.
337+
338+The following diagram summarizes the packet creation and forwarding process.
339+
340+<div style="text-align:center">
341+<img src="https://media.urbit.org/docs/arvo/datagram-long.png">
342+</div>
343+
344+We elaborate on the above diagram.
345+
346+A typical relay will look something like this: `~bacbel-tagfeb` wishes to
347+contact `~worwel-sipnum` but does not know the IP address and port at which
348+`~worwel-sipnum` resides. Both planets live under `~zod`, which knows both of
349+their IP and port numbers by virtue of being the galaxy that both live under.
350+
351+To prepare, `~bacbel-tagfeb` forms a Diffie-Hellman symmetric key with their own
352+private key and the public key of `~worwel-sipnum`, obtained via Jael. Then
353+`~bacbel-tagfeb` sends a packet addressed to `~worwel-sipnum` to `~zod`.
354+
355+The packet has the following format:
356+ - The standard Ames header described in [header](#header), where the checksum
357+ is the `+mug` of the body, and the sender and receiver ship types are `01`,
358+ denoting that the sender and receiver are planets. The remainder of the
359+ packet is the body.
360+ - The body of this packet will be the `@p` of the
361+sender `~bacbel-tagfeb`, followed by the `@p` of the receiver `~worwel-sipnum`,
362+followed by the payload.
363+ - The payload of this packet will be the `+jam` of `[origin content]`. `origin`
364+for this initial packet will be `~`, which implies that the packet is
365+originating from the sender. `content` is the `+jam` of the message, encrypted
366+using the Diffie-Hellman symmetric key that was previously computed.
367+
368+`~zod` receives the packet and reads the body. It sees that it is not the
369+intended recipient of the packet, and so gets ready to forward it to
370+`~worwel-sipnum`. First, it [`+cue`s](/docs/hoon/reference/stdlib/2p#cue)
371+(deserializes) the payload and changes the `origin` to the IP and port of
372+`~bacbel-tagfeb`. Then it `+jam`s `[origin content]` to form a new payload, and
373+`+mug`s that payload to get a new checksum. It replaces the old payload and
374+checksum with the new, and then sends the packet along to `~worwel-sipnum`.
375+
376+Once `~worwel-sipnum` processes the packet, it will know the IP and port of
377+`~bacbel-tagfeb` since `~zod` included it when it forwarded the packet. Thus
378+`~worwel-sipnum` will send an ack packet directly to `~bacbel-tagfeb`, unless a
379+NAT and/or firewall prevents a direct peer-to-peer connection, in which case
380+`~zod` will continue to relay packets. Absent these factors preventing a
381+peer-to-peer connection, communication between the two ships will now be direct
382+until one of them changes their IP address, port, or networking keys.
383+
384+
385+## The Serf and the King
386+
387+Urbit's functionality is split between the two binaries `urbit-worker` (sometimes
388+called the Serf) and `urbit-king` (sometimes called the King). This division of
389+labor is currently not well-documented outside of the [Vere documents](/docs/vere/), but we summarize it here.
390+
391+In short, the Serf is the Nock runtime and so keeps track of the current state
392+of Arvo as a Nock noun and updates the state by `%poke`ing it with nouns, and
393+then informs the King of the new state. The King manages snapshots of the Arvo
394+state and handles I/O with Unix, among other things. The Serf only ever talks to
395+the King, while the King talks with both the Serf and Unix.
396+
397+### Ames I/O submodule
398+
399+The King has several submodules, one of them being an Ames I/O submodule. This
400+submodule is responsible for wrapping outgoing Ames packets as UDP packets, and
401+unwrapping incoming UDP packets into Ames packets and forwarding them to the
402+worker. It also maintains an incoming packet queue.
403+
404+This division is summarized in the following diagram, describing how
405+`~bacbel-tagfeb` requests a subscription to the `recipes` notebook of
406+`~worwel-sipnum` in the Publish app.
407+
408+<div style="text-align:center">
409+<img src="https://media.urbit.org/docs/arvo/packet.png">
410+</div>
411+
412+Ames, as a part of Arvo, handles `+jam`ming, packetizing, encryption, and
413+forming Ames packets. Once it is ready to send an Ames packet, it `%give`s to
414+Unix a `%send` `gift` containing that packet. This will be a Nock noun
415+containing the `@tas` `%send` as well as the serialized packet.
416+
417+"Unix", in this case, is actually the King. The King receives the `%send`
418+instruction, wraps the packet contained within as a UDP packet, and immediately
419+hands it off the the Unix network interface to be sent.
420+
421+Now the receiving King is handed a UDP packet by Unix. The King removes the UDP
422+wrapper, `+jam`s the `lane` on which it heard the packet, and delivers the packet
423+to the Ames vane as an atom by copying the bytes it heard on the UDP port.
content/docs/arvo/behn/_index.mdnew file+7
@@ -0,0 +1,7 @@
1++++
2+title = "Behn"
3+weight = 20
4+sort_by = "weight"
5+template = "sections/docs/chapters.html"
6+insert_anchor_links = "right"
7++++
content/docs/arvo/behn/behn-api.mdnew file+246
@@ -0,0 +1,246 @@
1++++
2+title = "API Reference"
3+weight = 10
4+template = "doc.html"
5++++
6+
7+In this document we describe the public interface for Behn. Namely, we describe
8+each `task` that Behn can be `pass`ed, and which `gift`(s) Behn can `give` in return.
9+
10+
11+## Tasks
12+
13+### `%born`
14+
15+Each time you start your Urbit, the Arvo kernel calls the `%born` task for Behn. When
16+called, Behn gets the current time from Unix and updates its list of timers
17+accordingly.
18+
19+#### Accepts
20+
21+```hoon
22+[~]
23+```
24+
25+#### Returns
26+
27+`%born` does not return a `gift`.
28+
29+
30+### `%crud`
31+
32+`%crud` is called whenever an error involving Behn occurs, such as trying to
33+`%wake` a program that has crashed.
34+
35+When called, it checks to see if the set of timers is empty. If so, it prints
36+an error report containing `error`, otherwise it passes the error to `+wake`.
37+
38+#### Accepts
39+
40+```hoon
41+[tag=@tas error=tang]
42+```
43+Here, `tag` is a `@tas` denoting the type of error, and `error` is an error message.
44+
45+#### Returns
46+
47+```hoon
48+[%wake %behn-crud-no-timer tag error]
49+```
50+
51+If the set of timers is nonempty when Behn is `%pass`ed a `%crud` `task`, Behn
52+`%give`s a `%wake` `card` containing the error to the next client in the set of timers.
53+
54+
55+#### Example
56+
57+The most common error that occurs is when Behn tries to `%wake` up a program that has crashed. When this happens
58+the entire event (i.e. sequence of `move`s) that led up to the `%wake` is thrown
59+away, and Vere then causes the kernel to `pass` Behn a `%crud` `task` containing
60+the stack trace.
61+
62+
63+### `%drip`
64+
65+`%drip` allows one to delay a `gift` until a timer set for `now` fires.
66+
67+A Client `%slip`s Behn a `%drip` task wrapping a `gift` to be `give`n to a Target.
68+This launches a sequence of `move`s as written here:
69+
70+```
71+Client -- %slip %drip --> Behn -- %pass %wait --> Behn -- %give %wake --> Behn -- %give %meta --> Target
72+```
73+Here the `%meta` `move` is a wrapper for the `%gift` inside of the initial `%drip` wrapper.
74+
75+`%drip` only handles `gift`s, and can only schedule `gift`s for as soon as
76+possible after the prescribed timer fires.
77+
78+
79+#### Accepts
80+
81+```hoon
82+mov=vase
83+```
84+
85+`%drip` takes in a `%give` `move` in a `vase`.
86+
87+#### Returns
88+
89+In response to a `%drip` `task`, Behn will `%pass` a `%wait` to itself, which
90+then triggers a `%wake` `gift` to itself, which then causes Behn to `%give` a `%meta` `gift` containing
91+the `gift` originally `%give`n to Behn when `%drip` was first called. That makes
92+Behn its own client for `%drip`.
93+
94+#### Example
95+
96+
97+Say an app (the Target) is subscribed to updates from Clay (the Client). If Clay `%give`s
98+updates to the app directly and the app crashes, this may cause Clay to crash as
99+well. If instead Clay `%pass`es Behn a `%drip` `task` wrapping the update
100+`gift`, Behn will set a timer for `now` that, when fired, will cause the update
101+`gift` to be given. If it causes a crash then it will have been in response to
102+the `%drip` move, thereby isolating Clay from the crash. Thus `%drip` acts as a sort of buffer against cascading
103+sequences of crashes.
104+
105+
106+
107+### `%huck`
108+
109+Immediately gives back an input move.
110+
111+#### Accepts
112+
113+```hoon
114+mov=vase
115+```
116+
117+Behn takes in a `move` contained in a `vase`.
118+
119+#### Returns
120+
121+```hoon
122+[%give %meta mov]
123+```
124+
125+Behn returns the input `move` as a `%meta` `gift`.
126+
127+
128+
129+### `%rest`
130+
131+Cancels a timer that was previously set.
132+
133+Behn takes in a `@da` and cancels the timer at that time if it exists, then
134+adjusts the next wakeup call from Unix if necessary.
135+
136+#### Task
137+
138+```hoon
139+@da
140+```
141+
142+
143+#### Gift
144+
145+This `task` returns no `gift`s.
146+
147+
148+
149+### `%trim`
150+
151+This `task` is sent by the interpreter in order to free up memory.
152+ This `task` is empty for Behn, since it is not a good idea to forget your timers.
153+
154+#### Accepts
155+
156+This `task` has no arguments.
157+
158+#### Returns
159+
160+This task returns nothing.
161+
162+### `%vega`
163+
164+This `task` informs the vane that the kernel has been upgraded. Behn does not do
165+anything in response to this.
166+
167+#### Accepts
168+
169+This `task` has no arguments.
170+
171+#### Returns
172+
173+This `task` returns nothing.
174+
175+
176+
177+### `%wait`
178+
179+This `task` takes in a `@da` which Behn then adds to `timers.state`, the list of timers.
180+
181+#### Accepts
182+
183+```hoon
184+@da
185+```
186+
187+#### Returns
188+
189+This `task` returns a `%wake` `gift` once the timer has fired.
190+
191+
192+### `%wake`
193+
194+This `task` is sent by the kernel when the Unix timer tells the kernel that it
195+is time for Behn to wake up. This is often caused by a `%doze` `gift` that
196+Behn originally sent to the kernel that is then forwarded to Unix, which is
197+where the real timekeeping occurs.
198+
199+Upon receiving this `task`, Behn processes the elapsed timer and then sets
200+`:next-wake`.
201+
202+`%wake` is also a `gift` that Behn can `%give`. This is done to inform other
203+vanes or apps that a timer has expired, and may include an error message.
204+
205+#### Accepts
206+
207+As a `task`, `%wake` takes in `~`.
208+
209+As a `gift`, `%wake` may include an error message.
210+
211+```hoon
212+error=(unit tang)
213+```
214+
215+
216+#### Returns
217+
218+In response to receiving this `task`, Behn may `%give` a `%doze` `gift`
219+containing the `@da` of the next timer to elapse. Behn may also `%give` a
220+`%wake` `gift` to itself.
221+
222+
223+
224+### `%wegh`
225+
226+This `task` asks Behn to product a memory usage report.
227+
228+#### Accepts
229+
230+This `task` has no arguments.
231+
232+#### Returns
233+
234+```hoon
235+:_ state :_ ~
236+ :^ duct %give %mass
237+ :+ %behn %|
238+ :~ timers+&+timers.state
239+ dot+&+state
240+```
241+
242+When Behn is `%pass`ed this `task`, it will `%give` a `%mass` `gift` in response
243+containing Behn's current memory usage.
244+
245+
246+
content/docs/arvo/behn/behn.mdnew file+21
@@ -0,0 +1,21 @@
1++++
2+title = "Overview"
3+weight = 1
4+template = "doc.html"
5++++
6+Our simple timer.
7+
8+It allows vanes and applications to set and timer events, which are
9+managed in a simple priority queue. `%behn` produces effects to start
10+the unix timer, and when the requested `%behn` passes, unix sends wake
11+events to `%behn`, which time routes back to original sender. We don't
12+guarantee that a timer event will happen at exactly the `%behn` it was
13+set for, or even that it'll be particularly close. A timer event is a
14+request to not be woken until after the given time.
15+
16+`%eyre` uses `%behn` for timing out sessions, and `%clay` uses `%behn`
17+for keeping track of time-specified file requests. `%ames` should
18+probably use `%behn` to keep track of things like network timeouts and
19+retry timing, but it currently uses its own alarm system.
20+
21+This article is a stub. For more information, see either `behn.hoon` or [Lesson 2.6 - Behn](/docs/hoon/hoon-school/behn) of the Hoon tutorial.
content/docs/arvo/clay/_index.mdnew file+36
@@ -0,0 +1,36 @@
1++++
2+title = "Clay"
3+weight = 30
4+sort_by = "weight"
5+template = "sections/docs/chapters.html"
6+insert_anchor_links = "right"
7++++
8+
9+[Overview](/docs/arvo/clay/clay)
10+
11+High-level overview of Clay.
12+
13+[Architecture](/docs/arvo/clay/architecture)
14+
15+A conceptual overview of how Clay was designed.
16+
17+[Using Clay](/docs/arvo/clay/using)
18+
19+A quick overview of how the most common tasks involving Clay are performed:
20+reading and subscribing, syncing to Unix, and merging.
21+
22+[Data Types](/docs/arvo/clay/data-types)
23+
24+Explanations of the many data types found throughout Clay.
25+
26+[Scry Reference](/docs/arvo/clay/scry)
27+
28+Reference for Clay's various scry endpoints.
29+
30+[API Reference](/docs/arvo/clay/tasks)
31+
32+Details of the various `task`s you can use to interact with Clay.
33+
34+[Examples](/docs/arvo/clay/examples)
35+
36+Example usage of the various Clay `task`s.
content/docs/arvo/clay/architecture.mdnew file+254
@@ -0,0 +1,254 @@
1++++
2+title = "Architecture"
3+weight = 2
4+template = "doc.html"
5++++
6+
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.
13+
14+The 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.
22+
23+In a more traditional OS, everything in RAM can be erased at any
24+time by power failure, and is always erased on reboot. Thus, a
25+primary purpose of a filesystem is to ensure files persist across
26+power failures and reboots. In Arvo, both power failures and
27+reboots are special cases of suspending computation, which is
28+done safely since our event log is already persistent. Therefore,
29+Clay is not needed in Arvo for persistence. Why, then, do we have a
30+filesystem? There are two answers to this question.
31+
32+First, Clay provides a filesystem tree, which is a convenient
33+user interface for some applications. Unix has the useful concept
34+of virtual filesystems, which are used for everything from direct
35+access to devices, to random number generators, to the /proc
36+tree. It is easy and intuitive to read from and write to a
37+filesystem tree.
38+
39+Second, Clay has a distributed revision-control system baked into
40+it. Traditional filesystems are not revision controlled, so
41+userspace software -- such as git -- is written on top of them to
42+do so. Clay natively provides the same functionality as modern
43+DVCSes, and more.
44+
45+Clay has two other unique properties that we'll cover later on:
46+it supports typed data and is referentially transparent.
47+
48+### Revision Control
49+
50+Every urbit has one or more `desk`s, which are independently
51+revision-controlled branches. Each `desk` contains its own `mark`
52+definitions, apps, and so forth.
53+
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.
61+
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
64+(1) an absolute time when it was created, (2) a list of zero or
65+more parents, and (3) a map from paths to data.
66+
67+Most commits have exactly one parent, but the initial commit on a
68+`desk` may have zero parents, and merge commits have more than one
69+parent.
70+
71+The non-metadata is stored as a `map` of `path`s to data. It's
72+worth noting that no constraints are put on this `map`, so, for
73+example, both `/a/b` and `/a/b/c` could have data. This is impossible
74+in a traditional Unix filesystem since it means that `/a/b` is both
75+a file and a directory. Conventionally, the final element in the
76+path is its `mark` -- much like a filename extension in Unix. Thus,
77+`/doc/readme.md` in Unix is stored as `/doc/readme/md` in urbit.
78+
79+The data is not stored directly in the `map`; rather, a hash of the
80+data is stored, and we maintain a master blob store. Thus, if the
81+same data is referred to in multiple commits (as, for example,
82+when a file doesn't change between commits), only the hash is
83+duplicated.
84+
85+In the master blob store, we either store the data directly, or
86+else we store a diff against another blob. The hash is dependent
87+only on the data within and not on whether or not it's stored
88+directly, so we may on occasion rearrange the contents of the
89+blob store for performance reasons.
90+
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,
95+although the full commit history will be accessible by traversing
96+the parentage of the individual commits.
97+
98+We do guarantee that the first commit is numbered 1, commits are
99+numbered consecutively after that (i.e. there are no "holes"),
100+the topmost commit is always numbered, and every numbered commit
101+is an ancestor of every later numbered commit.
102+
103+There are three ways to refer to particular commits in the
104+revision history. Firstly, one can use the revision number.
105+Secondly, one can use any absolute time between the one numbered
106+commit and the next (inclusive of the first, exclusive of the
107+second). Thirdly, every `desk` has a `map` of labels to revision
108+numbers. These labels may be used to refer to specific commits.
109+
110+Additionally, 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
116+global and referentially transparent.
117+
118+### A Typed Filesystem
119+
120+Since Clay is a general filesystem for storing data of arbitrary
121+types, in order to revision control correctly it needs to be
122+aware of types all the way through. Traditional revision control
123+does an excellent job of handling source code, so for source code
124+we act very similar to traditional revision control. The
125+challenge is to handle other data similarly well.
126+
127+For example, modern VCSs generally support "binary files", which
128+are files for which the standard textual diffing, patching, and
129+merging algorithms are not helpful. A "diff" of two binary files
130+is just a pair of the files, "patching" this diff is just
131+replacing the old file with the new one, and "merging"
132+non-identical diffs is always a conflict, which can't even be
133+helpfully annotated. Without knowing anything about the structure
134+of a blob of data, this is the best we can do.
135+
136+Often, though, "binary" files have some internal structure, and
137+it is possible to create diff, patch, and merge algorithms that
138+take advantage of this structure. An image may be the result of a
139+base image with some set of operations applied. With algorithms
140+aware of this set of operations, not only can revision control
141+software save space by not having to save every revision of the
142+image individually, these transformations can be made on parallel
143+branches and merged at will.
144+
145+Suppose Alice is tasked with touching up a picture, improving the
146+color balance, adjusting the contrast, and so forth, while Bob
147+has the job of cropping the picture to fit where it's needed and
148+adding textual overlay. Without type-aware revision control,
149+these changes must be made serially, requiring Alice and Bob to
150+explicitly coordinate their efforts. With type-aware revision
151+control, these operations may be performed in parallel, and then
152+the two changesets can be merged programmatically.
153+
154+Of course, even some kinds of text files may be better served by
155+diff, patch, and merge algorithms aware of the structure of the
156+files. Consider a file containing a pretty-printed JSON object.
157+Small changes in the JSON object may result in rather significant
158+changes in how the object is pretty-printed (for example, by
159+addding an indentation level, splitting a single line into
160+multiple lines).
161+
162+A text file wrapped at 80 columns also reacts suboptimally with
163+unadorned Hunt-McIlroy diffs. A single word inserted in a
164+paragraph may push the final word or two of the line onto the
165+next line, and the entire rest of the paragraph may be flagged as
166+a change. Two diffs consisting of a single added word to
167+different sentences may be flagged as a conflict. In general,
168+prose should be diffed by sentence, not by line.
169+
170+As far as we are aware, Clay is the first generalized,
171+type-aware revision control system. We'll go into the workings
172+of this system in some detail.
173+
174+### Marks
175+
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+
content/docs/arvo/clay/clay.mdnew file+58
@@ -0,0 +1,58 @@
1++++
2+title = "Overview"
3+weight = 1
4+template = "doc.html"
5+aliases = ["/docs/learn/arvo/clay/"]
6++++
7+
8+
9+Our filesystem.
10+
11+`%clay` is version-controlled, referentially-transparent, and global.
12+While this filesystem is stored in `%clay`, it is mirrored to Unix for
13+convenience. Unix tells `%clay`s whenever a file changes in the Unix
14+copy of the filesystem so that the change may be applied. `%clay` tells
15+unix whenever an app or vane changes the filesystem so that the change
16+can be effected in Unix. Apps and vanes may use `%clay` to write to the
17+filesystem, query it, and subscribe to changes in it. Ford and gall use
18+`%clay` to serve up apps and web pages.
19+
20+`%clay` includes three components. First is the filesystem/version
21+control algorithms, which are mostly defined in `++ze` and `++zu` in
22+zuse. Second is the write, query, and subscription logic. Finally, there
23+is the logic for communicating requests to, and receiving requests from,
24+foreign ships.
25+
26+### User documentation
27+
28+[Filesystem](/using/os/filesystem)
29+
30+How to interact with the Clay filesystem via Dojo. This includes basics such as
31+mounting to Unix, changing directory, merging, and listing files.
32+
33+### Developer Documentation
34+
35+[Architecture](/docs/arvo/clay/architecture)
36+
37+A conceptual overview of how Clay was designed.
38+
39+[Using Clay](/docs/arvo/clay/using)
40+
41+A quick overview of how the most common tasks involving Clay are performed:
42+reading and subscribing, syncing to Unix, and merging.
43+
44+[Data Types](/docs/arvo/clay/data-types)
45+
46+Explanations of the many data types found throughout Clay.
47+
48+[Scry Reference](/docs/arvo/clay/scry)
49+
50+Reference for Clay's various scry endpoints.
51+
52+[API Reference](/docs/arvo/clay/tasks)
53+
54+Details of the various `task`s you can use to interact with Clay.
55+
56+[Examples](/docs/arvo/clay/examples)
57+
58+Example usage of the various Clay `task`s.
content/docs/arvo/clay/data-types.mdnew file+688
@@ -0,0 +1,688 @@
1++++
2+title = "Data Types"
3+weight = 4
4+template = "doc.html"
5++++
6+
7+This section will be reference documentation for the data types used by our
8+filesystem.
9+
10+As a general guide, we recommend reading and attempting to understand the data
11+structures used in any Hoon code before you try to read the code itself.
12+Although complete understanding of the data structures is impossible without
13+seeing them used in the code, an 80% understanding greatly clarifies the code.
14+As another general guide, when reading Hoon, it rarely pays off to understand
15+every line of code when it appears. Try to get the gist of it, and then move on.
16+The next time you come back to it, it'll likely make a lot more sense.
17+
18+### Data Models
19+
20+As you're reading through this section, remember you can always come
21+back to this when you run into these types later on. You're not going to
22+remember everything the first time through, but it is worth reading, or
23+at least skimming, this so that you get a rough idea of how our state is
24+organized.
25+
26+The types that are certainly worth reading are `++raft`, `++room`,
27+`++dome:clay`, `++ankh:clay`, `++rung:clay`, `++rang:clay`, `++blob:clay`,
28+`++yaki:clay`, and `++nori:clay` (possibly in that order). All in all, though,
29+this section isn't too long, so many readers may wish to quickly read through
30+all of it. If you get bored, though, just skip to the next section. You can
31+always come back when you need to.
32+
33+### `$raft`, formal state
34+
35+```hoon
36++$ raft :: filesystem
37+ $: rom=room :: domestic
38+ hoy=(map ship rung) :: foreign
39+ ran=rang :: hashes
40+ mon=(map term beam) :: mount points
41+ hez=(unit duct) :: sync duct
42+ cez=(map @ta crew) :: permission groups
43+ pud=(unit [=desk =yoki]) :: pending update
44+ == ::
45+```
46+
47+This is the state of the vane. Anything that must be remembered between
48+calls to Clay is stored in this state.
49+
50+`ran` is the store of all commits and deltas, keyed by hash. The is
51+where all the "real" data we know is stored; the rest is "just
52+bookkeeping".
53+
54+`rom` is the state for all local desks. It consists of a `duct` to
55+[Dill](/docs/arvo/dill/dill) and a collection of `desk`s.
56+
57+`hoy` is the state for all foreign desks.
58+
59+`ran` is the global, hash-addressed object store. It has maps of commit hashes
60+to commits and content hashes to content.
61+
62+`mon` is a collection of Unix mount points. `term` is the mount point (relative
63+to th pier) and `beam` is a domestic Clay directory.
64+
65+`hez` is the duct used to sync with Unix.
66+
67+`cez` is a collection of named permission groups.
68+
69+`pud` is an update that's waiting on a kernel upgrade.
70+
71+
72+#### `$room`, filesystem per domestic ship
73+
74+```hoon
75++$ room :: fs per ship
76+ $: hun=duct :: terminal duct
77+ dos=(map desk dojo) :: native desk
78+ == ::
79+```
80+
81+This is the representation of the filesystem of a ship on our pier.
82+
83+`hun` is the duct we use to send messages to [Dill](/docs/arvo/dill/dill) to
84+display notifications of filesystem changes. Only `%note` `%gift`s should be
85+produced along this `duct`. This is set by the `%init` `move`.
86+
87+`dos` is a well-known operating system released in 1981. It is also the
88+set of `desk`s on this ship, mapped to their `desk` state.
89+
90+#### `$desk`, filesystem branch
91+
92+```hoon
93++$ desk @tas
94+```
95+
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
98+independent histories and states, and they may be
99+[merged](/docs/arvo/clay/using#merging) into each other.
100+
101+### `$dojo`, domestic desk state
102+
103+```hoon
104++$ dojo
105+ $: qyx=cult :: subscribers
106+ dom=dome :: desk state
107+ per=regs :: read perms per path
108+ pew=regs :: write perms per path
109+ ==
110+```
111+
112+This is the all the data that is specific to a particular `desk` on a domestic
113+ship. `qyx` is the set of subscribers to this `desk`, and `dom` is the data in
114+the `desk`. `regs` are `(map path rule)`, and so `per` is a `map` of read
115+permissions by `path` and `pew` is a `map` of write permissions by `path`.
116+
117+#### `$cult`, subscriptions
118+
119+```hoon
120++$ cult (jug wove duct)
121+```
122+
123+`cult`s keep track of subscribers. `wove`s are associated to requests, and each
124+`wove` is mapped to a set of `duct`s associated to subscribers who should be
125+notified when the request is filled/updated.
126+
127+#### `$rave:clay`, general subscription request
128+
129+```hoon
130+ +$ rave :: general request
131+ $% [%sing =mood] :: single request
132+ [%next =mood] :: await next version
133+ [%mult =mool] :: next version of any
134+ [%many track=? =moat] :: track range
135+ == ::
136+```
137+
138+This represents a subscription request for a `desk`.
139+
140+A `%sing` request asks for data at single revision.
141+
142+A `%next` request asks to be notified the next time there’s a change to the
143+specified file.
144+
145+A `%mult` request asks to be notified the next time there's a change to a
146+specified set of files.
147+
148+A `%many` request asks to be notified on every change in a `desk` for a range of changes (including into the future).
149+
150+### `$rove`, stored general subscription request
151+
152+```hoon
153+ +$ rove :: stored request
154+ $% [%sing =mood] :: single request
155+ [%next =mood aeon=(unit aeon) =cach] :: next version of one
156+ $: %mult :: next version of any
157+ =mool :: original request
158+ aeon=(unit aeon) :: checking for change
159+ old-cach=(map [=care =path] cach) :: old version
160+ new-cach=(map [=care =path] cach) :: new version
161+ == ::
162+ [%many track=? =moat lobes=(map path lobe)] :: change range
163+ == ::
164+```
165+
166+Like a `rave` but with provisions to store current versions for `%next` and `%many`.
167+Generally used when we store a request in our state somewhere. This is so that
168+we can determine whether new versions actually affect the path we're subscribed to.
169+
170+
171+#### `$mood:clay`, single subscription request
172+
173+```hoon
174+ +$ mood [=care =case =path] :: request in desk
175+```
176+
177+This represents a request for data related to the state of the `desk` at a
178+particular commit, specfied by `case`. `care` specifies what kind of information
179+is desired, and `path` specifies the path we are requesting.
180+
181+#### `$moat:clay`, range subscription request
182+
183+```hoon
184+ +$ moat [from=case to=case =path] :: change range
185+```
186+
187+This represents a request for all changes between `from` and `to` on `path`. You
188+will be notified when a change is made to the node referenced by the `path` or to
189+any of its children.
190+
191+### `$care:clay`, Clay submode
192+
193+```hoon
194+ +$ care ?(%a %b %c %d %e %f %p %r %s %t %u %v %w %x %y %z) :: clay submode
195+```
196+
197+
198+This specifies what type of information is requested in a subscription
199+or a scry.
200+
201+`%a` build a Hoon file at a `path`.
202+
203+`%b` build a dynamically typed `mark` by name (a `$dais` mark-interface core).
204+
205+`%c` build a dynamically typed `mark` conversion gate (a `$tube`) by "from" and
206+"to" `mark` names.
207+
208+`%d` returns a `(set desk)` of the `desk`s that exist on your ship.
209+
210+`%e` builds a statically typed `mark` by name (a `$nave` mark-interface core).
211+
212+`%f` builds a statically typed mark converstion gate.
213+
214+`%p` produces the permissions for a directory, returned as a `[dict:clay dict:clay]`.
215+
216+`%r` requests the file in the same fashion as `%x`, but wraps the result in a `vase`.
217+
218+`%s` has miscellaneous debug endpoints.
219+
220+`%t` produces a `(list path)` of descendent `path`s for a directory within a `yaki`.
221+
222+`%u` produces a `?` depending on whether or not the specified file exists. It
223+does not check any of its children.
224+
225+`%v` requests the entire `dome` for a specified `desk` at a particular `aeon`.
226+When used on a foreign `desk`, this get us up-to-date to the requested version.
227+
228+`%w` requests the revision number and date of the specified path, returned as a `cass:clay`.
229+
230+`%x` requests the file at a specified path at the specified commit, returned as
231+an `@`. If there is no node at that path or if the node has no contents (that
232+is, if `fil:ankh` is null), then this crashes.
233+
234+`%y` requests an `arch` of the specfied commit at the specified path. It will
235+return the bunt of an `arch` if the file or directory is not found.
236+
237+`%z` requests a recursive hash of a node and all its children, returned as a `@uxI`.
238+
239+#### `$ankh`, filesystem node
240+
241+```hoon
242++$ ankh :: expanded node
243+ $~ [~ ~]
244+ $: fil=(unit [p=lobe q=cage]) :: file
245+ dir=(map @ta ankh) :: folders
246+ == ::
247+```
248+
249+This is a recursive filesystem node type that can describe a whole tree of
250+folders and files, with subtrees organized by path prefix. In Earth filesystems,
251+a node is a file xor a directory. On Mars, we're inclusive, so a node is a file
252+ior a directory.
253+
254+`fil` is the contents of this file, if any. `p.fil` is a hash of the
255+contents while `q.fil` is the data itself.
256+
257+`dir` is the set of children of this node. In the case of a pure file,
258+this is empty. The keys are the names of the children and the values
259+are, recursively, the nodes themselves.
260+
261+
262+### `$arch`, shallow filesystem node
263+
264+```hoon
265++$ arch (axil @uvI)
266+++ axil
267+ |$ [item]
268+ [fil=(unit item) dir=(map @ta ~)]
269+```
270+
271+An `arch` is a lightweight version of an `ankh` that only contains the hash
272+of the associated file and a `map` of child directories, but not the children of
273+those directories.
274+
275+The child directories are given by a `map` to null rather than a `set` so that the
276+ordering of the `map` will be the same as it is for an `axal`, allowing
277+efficient conversion for when the heavier node is needed.
278+```hoon
279+++ axal
280+ |$ [item]
281+ [fil=(unit item) dir=(map @ta $)]
282+```
283+
284+#### `$case`, specifying a commit
285+
286+```hoon
287++$ case
288+ $% :: %da: date
289+ :: %tas: label
290+ :: %ud: sequence
291+ ::
292+ [%da p=@da]
293+ [%tas p=@tas]
294+ [%ud p=@ud]
295+ ==
296+```
297+
298+A commit can be referred to in three ways: `%da` refers to the commit
299+that was at the head on date `p`, `%tas` refers to the commit labeled
300+`p`, and `%ud` refers to the commit numbered `p`. Note that since these
301+all can be reduced down to a `%ud`, only numbered commits may be
302+referenced with a `++case:clay`.
303+
304+#### `$dome`, desk data
305+
306+```hoon
307++$ dome
308+ $: ank=ankh :: state
309+ let=aeon :: top id
310+ hit=(map aeon tako) :: versions by id
311+ lab=(map @tas aeon) :: labels
312+ mim=(map path mime) :: mime cache
313+ fod=ford-cache :: ford cache
314+ fer=(unit reef-cache) :: reef cache
315+ == ::
316+```
317+
318+A `dome` is the state of a `desk` and associated data.
319+
320+`ank` is the current state of the desk. Thus, it is the state of the
321+filesystem at revison `let`. The head of a `desk` is always a numbered
322+commit.
323+
324+`let` is the number of the most recently numbered commit. This is also
325+the total number of numbered commits.
326+
327+`hit` is a map of numerical ids to commit hashes. These hashes are mapped into
328+their associated commits in `hut.rang` in the `raft` of Clay. In general, the
329+keys of this map are exactly the numbers from 1 to `let`, with no gaps. Of
330+course, when there are no numbered commits, `let` is 0, so `hit` is null.
331+Additionally, each of the commits is an ancestor of every commit numbered
332+greater than this one. Thus, each is a descendant of every commit numbered less
333+than this one. Since it is true that the date in each commit (`t:yaki`) is no
334+earlier than that of each of its parents, the numbered commits are totally
335+ordered in the same way by both pedigree and date. Of course, not every commit
336+is numbered. If that sounds too complicated to you, don't worry about it. It
337+basically behaves exactly as you would expect.
338+
339+`lab` is a map of textual labels to numbered commits. Note that labels
340+can only be applied to numbered commits. Labels must be unique across a
341+desk.
342+
343+`mim` is a cache of the content in the directories that are mounted to Unix.
344+
345+`fod` is the Ford cache, which keeps a cache of the results of builds performed
346+at this `desk`'s current revision, including a full transitive closure of
347+dependencies for each completed build.
348+
349+`fer` is the system file cache, which consists of `vase`s for `hoon.hoon`,
350+`arvo.hoon`, `lull.hoon`, and `zuse.hoon`.
351+
352+#### `++rung`, filesystem per neighbor ship
353+
354+```hoon
355++$ rung
356+ $: rus=(map desk rede) :: neighbor desks
357+ ==
358+```
359+
360+This is the filesystem of a neighbor ship. The keys to this `map` are all
361+the `desk`s we know about on their ship.
362+
363+#### `++rede`, generic desk state
364+
365+```hoon
366+ ++ rede :: universal project
367+ $: lim=@da :: complete to
368+ qyx=cult :: subscribers
369+ ref=(unit rind) :: outgoing requests
370+ dom=dome :: revision state
371+ == ::
372++$ rede :: universal project
373+ $: lim=@da :: complete to
374+ ref=(unit rind) :: outgoing requests
375+ qyx=cult :: subscribers
376+ dom=dome :: revision state
377+ per=regs :: read perms per path
378+ pew=regs :: write perms per path
379+ == ::
380+```
381+
382+This is our knowledge of the state of a desk, either foreign or
383+domestic.
384+
385+`lim` is the most recent `@da` for which we're confident we have all the
386+information for. For local `desk`s, this is always `now`. For foriegn `desk`s,
387+this is the last time we got a full update from the foreign ship.
388+
389+`ref` is the request manager for the desk. For domestic `desk`s, this is
390+null since we handle requests ourselves. For foreign `desk`s, this keeps track
391+of all pending foriegn requests plus a cache of the responses to previous requests.
392+
393+`qyx` is the `set` of subscriptions to this desk, with listening `duct`s. These
394+subscriptions exist only until they've been filled. For domestic `desk`s, this
395+is simply `qyx:dojo` - all subscribers to the `desk`. For foreign `desk`s this
396+is all the subscribers from our ship to the foreign `desk`.
397+
398+`dom` is the data in the `desk`.
399+
400+`regs` are `(map path rule)`, and so `per` is a `map` of read permissions by
401+`path` and `pew` is a `map` of write permissions by `path`.
402+
403+
404+#### `$rind`, foreign request manager
405+
406+```hoon
407++$ rind :: request manager
408+ $: nix=@ud :: request index
409+ bom=(map @ud update-state) :: outstanding
410+ fod=(map duct @ud) :: current requests
411+ haw=(map mood (unit cage)) :: simple cache
412+ == ::
413+```
414+
415+This is the request manager for a foreign `desk`. When we send a request to a
416+foreign ship, we keep track of it in here.
417+
418+`nix` is one more than the index of the most recent request. Thus, it is the
419+next available request number.
420+
421+`bom` is the set of outstanding requests. The keys of this `map` are some subset
422+of the numbers between 0 and one less than `nix`. The members of the `map` are
423+exactly those requests that have not yet been fully satisfied.
424+
425+`fod` is the same set as `bom`, but from a different perspective. In particular,
426+the values of `fod` are the same as the keys of `bom`, and the `duct` of the
427+values of `bom` are the same as the keys of `fod`. Thus, we can map `duct`s to
428+their associated request number and `update-state`, and we can map request
429+numbers to their associated `duct`.
430+
431+`haw` is a map from `%sing` requests to their values. This acts as a cache for
432+requests that have already been filled.
433+
434+#### `$update-state`, status of outstanding foreign request
435+
436+```hoon
437++$ update-state
438+ $: =duct
439+ =rave
440+ have=(map lobe blob)
441+ need=(list lobe)
442+ nako=(qeu (unit nako))
443+ busy=_|
444+ ==
445+```
446+
447+An `update-state` is used to represent the status of an outstanding request to a
448+foreign `desk`.
449+
450+`duct` and `rave` are the `duct` along which the request was made and the
451+request itself.
452+
453+`have` is a map of hashes thus far acquired in the request to the data
454+associated with those hashes.
455+
456+`need` is a list of hashes yet to be acquired.
457+
458+`nako` is a queue of data yet to be validated.
459+
460+`busy` tracks whether or not the request is currently being fulfilled.
461+
462+#### `$rang:clay`, data repository
463+
464+```hoon
465+ +$ rang :: repository
466+ $: hut=(map tako yaki) :: changes
467+ lat=(map lobe blob) :: data
468+ == ::
469+```
470+
471+This is a data repository keyed by hash. Thus, this is where the "real" data
472+is stored, but it is only meaningful if we know the hash of what we're
473+looking for.
474+
475+`hut` is a `map` from commit hashes (`tako`s) to commits (`yaki`s). We often get
476+the hashes from `hit:dome`, which keys them by numerical id. Not every commit
477+has an numerical id.
478+
479+`lat` is a `map` from content hashes (`lobe`s) to the actual content (`blob`s).
480+We often get the hashes from a `yaki`, which references this `map` to get the
481+data. There is no `blob` in `yaki:clay`. They are only accessible through
482+`lat`.
483+
484+#### `$tako:clay`, commit reference
485+
486+```hoon
487+ +$ tako @ :: yaki ref
488+```
489+
490+This is a hash of a `yaki:clay`, a commit. These are most notably used as the
491+keys in `hut:rang:clay`, where they are associated with the actual `yaki:clay`,
492+and as the values in `hit:dome:clay`, where sequential numerical ids are
493+associated with these.
494+
495+#### `$yaki:clay`, commit
496+
497+```hoon
498+ +$ yaki :: commit
499+ $: p=(list tako) :: parents
500+ q=(map path lobe) :: namespace
501+ r=tako :: self-reference
502+ t=@da :: date
503+ == ::
504+```
505+
506+This is a single commit.
507+
508+`p` is a `list` of the hashes of the parents of this commit. In most
509+cases, this will be a single commit, but in a merge there may be more
510+parents. In theory, there may be an arbitrary number of parents, but in
511+practice merges have exactly two parents. This may change in the future.
512+For commit 1, there is no parent.
513+
514+`q` is a `map` of the `path`s on a desk to the content hashes at that location.
515+If you understand what a `lobe:clay` and a `blob:clay` is, then the type
516+signature here tells the whole story.
517+
518+`r` is the hash associated with this commit.
519+
520+`t` is the date at which this commit was made.
521+
522+#### `$lobe:clay`, data reference
523+
524+```hoon
525+ +$ lobe @uvI :: blob ref
526+```
527+
528+This is a hash of a `blob:clay`. These are most notably used in `lat:rang:clay`,
529+where they are associated with the actual `blob:clay`, and as the values in
530+`q:yaki:clay`, where `path`s are associated with their content hashes in a commit.
531+
532+#### `$blob:clay`, data
533+
534+```hoon
535+ +$ blob :: fs blob
536+ $% [%delta p=lobe q=[p=mark q=lobe] r=page] :: delta on q
537+ [%direct p=lobe q=page] :: immediate
538+```
539+
540+This is a node of data. In both cases, `p` is the hash of the blob.
541+
542+`%delta` is the case where we define the data by a delta on other data. In
543+practice, the other data is always the previous commit, but nothing depends on
544+this. `p.q` is the `mark` of the parent blob, `q.q` is the hash of the parent
545+blob, and `r` is the delta.
546+
547+`%direct` is the case where we simply have the data directly. `q` is the data.
548+These almost always come from the creation of a file.
549+
550+
551+#### `+urge`, list change
552+
553+```hoon
554+ ++ urge |*(a=mold (list (unce a))) :: list change
555+```
556+
557+This is a parametrized type for list changes. For example, `(urge @t)`
558+is a list change for lines of text.
559+
560+#### `+unce`, change part of a list.
561+
562+```hoon
563+ ++ unce :: change part
564+ |* a=mold ::
565+ $% [%& p=@ud] :: skip[copy]
566+ [%| p=(list a) q=(list a)] :: p -> q[chunk]
567+ == ::
568+```
569+
570+This is a single change in a list of elements of type `a`. For example,
571+`(unce @t)` is a single change in lines of text.
572+
573+`%&` means the next `p` lines are unchanged.
574+
575+`%|` means the lines `p` have changed to `q`.
576+
577+#### `$nori:clay`, repository action
578+
579+```hoon
580+ +$ nori :: repository action
581+ $% [%& p=soba] :: delta
582+ [%| p=@tas] :: label
583+ == ::
584+```
585+
586+This describes a change that we are asking Clay to make to the `desk`.
587+There are two kinds of changes that may be made: we can modify files or
588+we can apply a label to a commit.
589+
590+In the `|` case, we will simply label the current commit with the given
591+label. In the `&` case, we will apply the given changes.
592+
593+#### `$soba:clay`, delta
594+
595+```hoon
596+ +$ soba (list [p=path q=miso]) :: delta
597+```
598+
599+This describes a `list` of changes to make to a `desk`. The `path`s are `path`s
600+to files to be changed, and the corresponding `miso` value is a description of
601+the change itself.
602+
603+#### `$miso:clay`, ankh delta
604+
605+```hoon
606+ +$ miso :: ankh delta
607+ $% [%del ~] :: delete
608+ [%ins p=cage] :: insert
609+ [%dif p=cage] :: mutate from diff
610+ [%mut p=cage] :: mutate from raw
611+ == ::
612+```
613+
614+There are four kinds of changes that may be made to a node in a `desk`.
615+
616+`%del` deletes the node.
617+
618+`%ins` inserts a file given by `p`.
619+
620+`%dif` is currently unimplemented. This may seem strange, so we remark that
621+diffs for individual files are implemented using `+diff` and `+pact` in `mark`s.
622+So for an `ankh`, which may include both files and directories, `%dif` being
623+unimplemented really just means that we do not yet have a formal concept of
624+changes in directory structure.
625+
626+`%mut` mutates the file using raw data given by `p`.
627+
628+#### `$riff:clay`, request/desist
629+
630+```hoon
631+ +$ riff [p=desk q=(unit rave)] :: request+desist
632+```
633+
634+This represents a request for data about a particular `desk`. If `q`
635+contains a `rave`, then this opens a subscription to the `desk` for that
636+data. If `q` is null, then this tells Clay to cancel the subscription
637+along this duct.
638+
639+#### `$riot:clay`, response
640+
641+```hoon
642+ +$ riot (unit rant) :: response+complete
643+```
644+
645+A `riot` is a response to a subscription. If null, the subscription has
646+been completed, and no more responses will be sent. Otherwise, the
647+`rant` is the produced data.
648+
649+#### `$rant:clay`, response data
650+
651+```hoon
652+ +$ rant :: response to request
653+ $: p=[p=care q=case r=desk] :: clade release book
654+ q=path :: spur
655+ r=cage :: data
656+ == ::
657+```
658+
659+This is the data associated to the response to a request. `p.p` specifies
660+the type of data that was requested (and is produced). `q.p` gives the
661+specific version reported (since a range of versions may be requested in
662+a subscription). `r.p` is the `desk`. `q` is the path to the filesystem
663+node. `r` is the data itself (in the format specified by `p.p`).
664+
665+### `$nako`, subscription response data
666+
667+```hoon
668++$ nako :: subscription state
669+ $: gar=(map aeon tako) :: new ids
670+ let=aeon :: next id
671+ lar=(set yaki) :: new commits
672+ bar=(set plop) :: new content
673+ == ::
674+```
675+
676+This is the data that is produced by a request for a range of revisions
677+of a `desk`. This allows us to easily keep track of a remote repository --
678+all the new information we need is contained in the `nako`.
679+
680+`gar` is a map of the revisions in the range to the hash of the commit
681+at that revision. These hashes can be used with `hut:rang:clay` to find the
682+commit itself.
683+
684+`let` is either the last revision number in the range or the most recent
685+revision number, whichever is smaller.
686+
687+`lar` is the set of new commits, and `bar` is the set of new content.
688+
content/docs/arvo/clay/examples.mdnew file+824
@@ -0,0 +1,824 @@
1++++
2+title = "Examples"
3+weight = 7
4+template = "doc.html"
5++++
6+
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+
39+This 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.
40+
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`:
42+
43+`send-task-take-gift.hoon`
44+
45+```hoon
46+/- spider
47+/+ strandio
48+=, strand=strand:spider
49+^- thread:spider
50+|= arg=vase
51+=/ m (strand ,vase)
52+^- form:m
53+=/ uarg !< (unit task:clay) arg
54+?~ uarg
55+ (strand-fail:strand %no-arg ~)
56+=/ =task:clay u.uarg
57+=/ =card:agent:gall [%pass /foo %arvo %c task]
58+;< ~ bind:m (send-raw-card:strandio card)
59+;< res=[wire sign-arvo] bind:m take-sign-arvo:strandio
60+~& +>:res
61+(pure:m !>(~))
62+```
63+
64+# `%warp`
65+
66+See the [Read and Subscribe](/docs/arvo/clay/tasks#warp) section of the [API Reference](/docs/arvo/clay/tasks) document for general details.
67+
68+## `%sing`
69+
70+Here 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.
71+
72+
73+Using the `send-task-take-gift.hoon` thread, let's try reading `gen/hood/hi.hoon`:
74+
75+```
76+> -send-task-take-gift [%warp our %home ~ %sing %x da+now /gen/hood/hi/hoon]
77+```
78+
79+You should see something like this as the output:
80+
81+```
82+[ %writ
83+ p
84+ [ ~
85+ [ p=[p=%x q=[%da p=~2021.5.20..23.37.50..e79b] r=%home]
86+ q=/gen/hood/hi/hoon
87+ r
88+ [ p=%hoon
89+ q
90+ [ #t/@
91+ q
92+ 3.548.750.706.400.251.607.252.023.288.575.526.190.856.734.474.077.821.289.791.377.301.707.878.697.553.411.219.689.905.949.957.893.633.811.025.757.107.990.477.902.858.170.125.439.223.250.551.937.540.468.638.902.955.378.837.954.792.031.592.462.617.422.136.386.332.469.076.584.061.249.923.938.374.214.925.312.954.606.277.212.923.859.309.330.556.730.410.200.952.056.760.727.611.447.500.996.168.035.027.753.417.869.213.425.113.257.514.474.700.810.203.348.784.547.006.707.150.406.298.809.062.567.217.447.347.357.039.994.339.342.906
93+ ]
94+ ]
95+ ]
96+ ]
97+]
98+```
99+
100+The `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:
101+
102+```
103+> -send-task-take-gift [%warp our %home ~ %sing %x da+now /gen/hood/hi/hoon]
104+[ %writ
105+ p
106+ [ ~
107+ [ p=[p=%u q=[%da p=~2021.5.20..23.42.21..bb33] r=%home]
108+ q=/gen/hood/hi/hoon
109+ r=[p=%flag q=[#t/?(%.y %.n) q=0]]
110+ ]
111+ ]
112+]
113+```
114+
115+Here's a breakdown of the `task` we sent:
116+
117+![%sing diagram](https://media.urbit.org/docs/arvo/clay/sing.png "%sing diagram")
118+
119+## `%next`
120+
121+Here 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.
122+
123+Using the `send-task-take-gift.hoon` thread, let's subscribe to the next version of `foo.txt`:
124+
125+```
126+> -send-task-take-gift [%warp our %home ~ %next %x da+now /foo/txt]
127+```
128+
129+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:
130+
131+```
132+> |commit %home
133+>=
134+[%writ p=[~ [p=[p=%x q=[%ud p=3] r=%home] q=/foo/txt r=[p=%txt q=[#t/*'' q=0]]]]]
135++ /~zod/home/3/foo/txt
136+```
137+
138+As 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`.
139+
140+Now run the thread again, and this time delete the file in unix and again `|commit %home` in the dojo. You should see:
141+
142+```
143+> |commit %home
144+>=
145+[%writ p=~]
146+- /~zod/home/4/foo/txt
147+```
148+
149+You can see the `riot` is just `~` due to the file being deleted.
150+
151+Here's a breakdown of the task we sent:
152+
153+![%next diagram](https://media.urbit.org/docs/arvo/clay/next.png "%next diagram")
154+
155+## `%mult`
156+
157+Here 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.
158+
159+This thread will subscribe to `/foo/txt` with an `%x` `care` and `/bar/txt` with a `%u` `care`. It will print out the `%wris` it gets back from Clay.
160+
161+`sub-mult.hoon`
162+
163+```hoon
164+/- spider
165+/+ strandio
166+=, strand=strand:spider
167+^- thread:spider
168+|= arg=vase
169+=/ m (strand ,vase)
170+^- form:m
171+=/ files=(set (pair care:clay path))
172+ %- sy :~
173+ [%x /foo/txt]
174+ [%u /bar/txt]
175+ ==
176+;< =bowl:strand bind:m get-bowl:strandio
177+=/ =task:clay [%warp our.bowl %home ~ %mult da+now.bowl files]
178+=/ =card:agent:gall [%pass /mult %arvo %c task]
179+;< ~ bind:m (send-raw-card:strandio card)
180+;< response=(pair wire sign-arvo) bind:m take-sign-arvo:strandio
181+~& +.q.response
182+(pure:m !>(~))
183+```
184+
185+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:
186+
187+```
188+> |commit %home
189+>=
190+[%wris p=[%da p=~2021.4.27..06.07.08..5ec4] q={[p=%u q=/bar/txt] [p=%x q=/foo/txt]}]
191++ /~zod/home/151/foo/txt
192++ /~zod/home/151/bar/txt
193+```
194+
195+You'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.
196+
197+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.
198+
199+Lastly, delete `foo.txt` and `|commit %home`. You should see something like:
200+
201+```
202+> |commit %home
203+>=
204+[%wris p=[%da p=~2021.4.27..06.15.03..0da4] q={[p=%x q=/foo/txt]}]
205+- /~zod/home/153/foo/txt
206+```
207+
208+As you can see, a relevant change to any of the subscribed files will trigger a response, not just when all of them change.
209+
210+Here's a breakdown of the `task` we sent:
211+
212+![subscribe mult diagram](https://media.urbit.org/docs/arvo/clay/sub-mult.png "subscribe mult diagram")
213+
214+## `%many`
215+
216+Here 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.
217+
218+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.
219+
220+`sub-many.hoon`
221+
222+```hoon
223+/- spider
224+/+ strandio
225+=, strand=strand:spider
226+|%
227+++ take-sign-loop
228+ =/ m (strand ,~)
229+ ^- form:m
230+ %- (main-loop:strandio ,~)
231+ :~ |= ~
232+ ^- form:m
233+ ;< res=(pair wire sign-arvo)
234+ bind:m
235+ ((handle:strandio ,(pair wire sign-arvo)) take-sign-arvo:strandio)
236+ ~& res
237+ (pure:m ~)
238+ ==
239+--
240+^- thread:spider
241+|= arg=vase
242+=/ m (strand ,vase)
243+^- form:m
244+=/ uarg !< (unit path) arg
245+?~ uarg
246+ (strand-fail:strand %no-arg ~)
247+=/ =path u.uarg
248+;< =bowl:strand bind:m get-bowl:strandio
249+=/ =task:clay [%warp our.bowl %home ~ %many %.y da+now.bowl da+(add ~m3 now.bowl) path]
250+=/ =card:agent:gall [%pass /many %arvo %c task]
251+;< ~ bind:m (send-raw-card:strandio card)
252+;< ~ bind:m take-sign-loop
253+(pure:m !>(~))
254+```
255+
256+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:
257+
258+```
259+> |commit %home
260+>=
261++ /~zod/home/260/bar/txt
262+```
263+
264+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:
265+
266+```
267+> |commit %home
268+>=
269+[ p=/many
270+ q=[%clay [%writ p=[~ [p=[p=%w q=[%ud p=261] r=%home] q=/ r=[p=%null q=[#t/@n q=0]]]]]]
271+]
272++ /~zod/home/261/foo/txt
273+```
274+
275+Now 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+
277+Now try adding `baz.txt`:
278+
279+```
280+> |commit %home
281+>=
282+[ p=/many
283+ q=[%clay [%writ p=[~ [p=[p=%w q=[%ud p=262] r=%home] q=/ r=[p=%null q=[#t/@n q=0]]]]]]
284+]
285++ /~zod/home/262/baz/txt
286+```
287+
288+Now wait until the three minutes is up and try making a change, for example deleting `baz.txt`:
289+
290+```
291+> |commit %home
292+>=
293+[ p=/many
294+ q=[%clay [%writ p=[~ [p=[p=%w q=[%ud p=264] r=%home] q=/ r=[p=%null q=[#t/@n q=0]]]]]]
295+]
296+[p=/many q=[%clay [%writ p=~]]]
297+- /~zod/home/263/baz/txt
298+```
299+
300+You 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.
301+
302+Run `:spider|kill` to stop the thread.
303+
304+Here's a breakdown of the `task` we sent:
305+
306+![subscribe many diagram](https://media.urbit.org/docs/arvo/clay/sub-many.png "subscribe many diagram")
307+
308+## Cancel Subscription
309+
310+Here we'll look at cancelling a subscription by sending Clay a `%warp` `task` with a null `(unit rave)` in the `riff`.
311+
312+This thread will subscribe to the `%next` version of `/foo/txt`, then immediately cancel the subscription and wait for a response to print (which it will never receive).
313+
314+`stop-sub.hoon`
315+
316+```hoon
317+/- spider
318+/+ strandio
319+=, strand=strand:spider
320+^- thread:spider
321+|= arg=vase
322+=/ m (strand ,vase)
323+^- form:m
324+;< =bowl:strand bind:m get-bowl:strandio
325+=/ =task:clay [%warp our.bowl %home ~ %next %x da+now.bowl /foo/txt]
326+=/ =card:agent:gall [%pass /next %arvo %c task]
327+;< ~ bind:m (send-raw-card:strandio card)
328+=. task [%warp our.bowl %home ~]
329+=. card [%pass /next %arvo %c task]
330+;< ~ bind:m (send-raw-card:strandio card)
331+;< =riot:clay bind:m (take-writ:strandio /next)
332+~& riot
333+(pure:m !>(~))
334+```
335+
336+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:
337+
338+```
339+> |commit %home
340+>=
341++ /~zod/home/266/foo/txt
342+```
343+
344+As you can see we've received no `%writ`. We can thus conclude the subscription has successfully been cancelled.
345+
346+Run `:spider|kill` to stop the thread.
347+
348+Here's a breakdown of the `task` we sent:
349+
350+![cancel subscription diagram](https://media.urbit.org/docs/arvo/clay/stop-sub.png "cancel subscription diagram")
351+
352+# `%info`
353+
354+See the [Write and Modify](/docs/arvo/clay/tasks#write-and-modify) section of the [API Reference](/docs/arvo/clay/tasks) document for general details.
355+
356+## `%ins`
357+
358+Here we'll look at adding a file by sending Clay a `%info` `task` containing a `%ins` `miso`.
359+
360+Let's try adding a `foo.txt` file with 'foo' as its contents:
361+
362+```
363+> |pass [%c [%info %home %& [/foo/txt %ins %txt !>(~['foo'])]~]]
364++ /~zod/home/5/foo/txt
365+```
366+
367+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.
368+
369+We'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`.
370+
371+Here's a breakdown of the `task` we sent:
372+
373+![%ins diagram](https://media.urbit.org/docs/arvo/clay/ins.png)
374+
375+## `%del`
376+
377+Here we'll look at deleting a file by sending Clay a `%info` `task` containing a `%del` `miso`.
378+
379+Let's try deleting the `foo.txt` file created in the [previous example](#ins):
380+
381+```
382+> |pass [%c [%info %home %& [/foo/txt %del ~]~]]
383+- /~zod/home/6/foo/txt
384+```
385+
386+If you have a look in the home of your pier you'll see the `foo.txt` file is now gone.
387+
388+Here's a breakdown of the `task` we sent:
389+
390+![%del diagram](https://media.urbit.org/docs/arvo/clay/del.png)
391+
392+## `%mut`
393+
394+Identical to the [%ins](#ins) example, just replace `%ins` with `%mut`.
395+
396+## Multiple Changes
397+
398+Here we'll look at changing multiple files in one request by sending Clay a `%info` `task` containing multiple `miso` in the `soba`.
399+
400+Since `soba` is just a `list` of `miso`, you can add a bunch of `miso` and they'll all be applied. This thread adds three files and then deletes them. Here there's only one type of `miso` in each request but you could mix different types together too.
401+
402+`multi-change.hoon`
403+
404+```hoon
405+/- spider
406+/+ strandio
407+=, strand=strand:spider
408+^- thread:spider
409+|= arg=vase
410+=/ m (strand ,vase)
411+^- form:m
412+=/ soba-a :~ [/foo/txt %ins %txt !>(['foo' ~])]
413+ [/bar/txt %ins %txt !>(['bar' ~])]
414+ [/baz/txt %ins %txt !>(['baz' ~])]
415+ ==
416+=/ soba-b :~ [/foo/txt %del ~]
417+ [/bar/txt %del ~]
418+ [/baz/txt %del ~]
419+ ==
420+;< ~ bind:m (send-raw-card:strandio [%pass /info %arvo %c %info %home %& soba-a])
421+;< ~ bind:m (send-raw-card:strandio [%pass /info %arvo %c %info %home %& soba-b])
422+(pure:m !>(~))
423+```
424+
425+Save to `ted/multi-change.hoon`, `|commit %home`, and run:
426+
427+```
428+> -multi-change
429++ /~zod/home/37/foo/txt
430++ /~zod/home/37/bar/txt
431++ /~zod/home/37/baz/txt
432+- /~zod/home/38/foo/txt
433+- /~zod/home/38/bar/txt
434+- /~zod/home/38/baz/txt
435+```
436+
437+# Manage Mounts
438+
439+See the [Manage Mounts](/docs/arvo/clay/tasks#manage-mounts) section of the [API Reference](/docs/arvo/clay/tasks) document for general details.
440+
441+## `%boat`
442+
443+Here 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`.
444+
445+Using the `send-task-take-gift.hoon` thread, let's make such a request:
446+
447+```
448+> -send-task-take-gift [%boat ~]
449+[%hill p=~[%home]]
450+```
451+
452+## `%mont`
453+
454+Here we'll look at mounting `desk`s, directories and files to unix by sending Clay a `%mont` `task`.
455+
456+Let's first try mounting our `%kids` desk:
457+
458+```
459+> |pass [%c [%mont %kids [our %kids da+now] /]]
460+```
461+
462+If you look in your pier, you should now see a `kids` folder which contains the contents of that `desk`.
463+
464+If we make a `%boat` request as detailed in the [%boat](#boat) section, we'll now see the mount point listed:
465+
466+```
467+> -send-task-take-gift [%boat ~]
468+[%hill p=~[%kids %home]]cruz gift. It looks like:
469+
470+[%cruz cez=(map @ta crew)] :: permission groups
471+The cez is just a map from group name to crew
472+```
473+
474+Note the mount point doesn't need to match a `desk`, file or directory. We can also do:
475+
476+```
477+> |pass [%c [%mont %wibbly-wobbly [our %home da+now] /]]
478+```
479+
480+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.
481+
482+Let's try mounting a subdirectory and a single folder:
483+
484+```
485+> |pass [%c [%mont %gen [our %home da+now] /gen]]
486+> |pass [%c [%mont %hi [our %home da+now] /gen/hood/hi]]
487+```
488+
489+If 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.
490+
491+## `%ogre`
492+
493+Here we'll look at unmounting `desk`s, directories and files by sending Clay a `%ogre` `task`.
494+
495+Let's unmount what we mounted in the [%mont](#mont) section. First we'll unmount the `%kids` desk:
496+
497+```
498+|pass [%c [%ogre %kids]]
499+```
500+
501+Our custom mount point `%wibbly-wobbly`:
502+
503+```
504+|pass [%c [%ogre %wibbly-wobbly]]
505+```
506+
507+And the single `hi.hoon` we previously mounted by specifying its mount point `%hi`:
508+
509+```
510+|pass [%c [%ogre %hi]]
511+```
512+
513+If we specify a non-existent mount point it will fail with an error printed to the dojo like:
514+
515+```
516+> |pass [%c [%ogre %kids]]
517+[%not-mounted %kids]
518+```
519+
520+If we give it an unmounted `beam` it will not print an error but still won't work.
521+
522+## `%dirk`
523+
524+Here we'll look at committing changed files by sending Clay a `%dirk` `task`.
525+
526+This `task` performs the same function as the `|commit` dojo command.
527+
528+With your `%home` `desk` mounted, try adding a file and send a `%dirk` to commit the change:
529+
530+```
531+> |pass [%c [%dirk %home]]
532++ /~zod/home/12/foo/txt
533+```
534+
535+Clay will print the changed files to the dojo with a leading `+`, `-` or `:` to indicate a new file, deleted file and changed file respectively.
536+
537+If you have the same `desk` mounted to multiple points, a committed change in one mount will also update the others.
538+
539+# Merge Desks
540+
541+See the [Merge Desks](/docs/arvo/clay/tasks#merge-desks) section of the [API Reference](/docs/arvo/clay/tasks) document for general details.
542+
543+## `%merg`
544+
545+Here we'll look at merging `desk`s by sending Clay a `%merg` `task` and receiving a `%mere` `gift` in response.
546+
547+First, using the `send-task-take-gift.hoon` thread, let's try creating a new `desk`:
548+
549+```
550+> -send-task-take-gift [%merg %foo our %home da+now %init]
551+[%mere p=[%.y p={}]]
552+```
553+
554+Now if we scry for our `desk`s we'll see `%foo` is there:
555+
556+```
557+> .^((set desk) %cd /===)
558+{%home %foo %kids}
559+```
560+
561+Next, 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.
562+
563+Now we'll try merging `%home` into `%foo` with a `%mate` strategy:
564+
565+```
566+> -send-task-take-gift [%merg %foo our %home da+now %mate]
567+[ /foo
568+ [ %clay
569+ [ %mere
570+ p
571+ [ %.n
572+ p
573+ [ p=%mate-conflict
574+ q=~[[%rose p=[p="/" q="/" r=""] q=[i=[%leaf p="foo"] t=[i=[%leaf p="txt"] t=~]]]]
575+ ]
576+ ]
577+ ]
578+ ]
579+]
580+```
581+
582+As you can see, the merge has failed. Let's try again with a `%meld` strategy:
583+
584+```
585+> -send-task-take-gift [%merg %foo our %home da+now %meld]
586+[/foo [%clay [%mere p=[%.y p={/foo/txt}]]]]
587+```
588+
589+Now the merge has succeeded and the `%mere` notes the file with a merge conflict. If we try with a `%only-that` strategy:
590+
591+```
592+> -send-task-take-gift [%merg %foo our %home da+now %only-that]
593+[/foo [%clay [%mere p=[%.y p={}]]]]
594+: /~zod/foo/6/foo/txt
595+```
596+
597+...you can see it's overwritten the `foo/txt` in the `%foo` `desk` and the `%mere` now has an empty `set`, indicating no merge conflicts.
598+
599+Next, 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:
600+
601+```
602+> -send-task-take-gift [%merg %foo our %home da+(add ~m2 now) %only-that]
603+```
604+
605+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:
606+
607+```
608+[/foo [%clay [%mere p=[%.y p={}]]]]
609+: /~zod/foo/7/foo/txt
610+```
611+
612+You can also specify it by revision number or label.
613+
614+# Permissions
615+
616+See the [Permissions](/docs/arvo/clay/tasks#permissions) section of the [API Reference](/docs/arvo/clay/tasks) document for general details.
617+
618+## `%perm`
619+
620+Here we'll look at setting permissions by sending Clay a `%perm` `task`.
621+
622+First, let's allow `~nes` to read `/gen/hood/hi/hoon`:
623+
624+```
625+> |pass [%c [%perm %home /gen/hood/hi/hoon %r ~ %white (sy [%.y ~nes]~)]]
626+```
627+
628+...and we'll do a `%p` scry to see that the permission was set:
629+
630+```
631+> .^([r=dict:clay w=dict:clay] %cp /===/gen/hood/hi/hoon)
632+[r=[src=/gen/hood/hi/hoon rul=[mod=%white who=[p={~nes} q={}]]] w=[src=/ rul=[mod=%white who=[p={} q={}]]]]
633+```
634+
635+You can see that `~nes` is now in the read whitelist. Next, let's try a write permission:
636+
637+```
638+> |pass [%c [%perm %home /ted %w ~ %white (sy [%.y ~nes]~)]]
639+```
640+
641+You can see `~nes` can now write to `/ted`:
642+
643+```
644+> .^([r=dict:clay w=dict:clay] %cp /===/ted)
645+[r=[src=/ rul=[mod=%white who=[p={} q={}]]] w=[src=/ted rul=[mod=%white who=[p={~nes} q={}]]]]
646+```
647+
648+Since we've set it for the whole `/ted` directory, if we check a file inside it we'll see it also has this permission:
649+
650+```
651+> .^([r=dict:clay w=dict:clay] %cp /===/ted/aqua/ames/hoon)
652+[r=[src=/ rul=[mod=%white who=[p={} q={}]]] w=[src=/ted rul=[mod=%white who=[p={~nes} q={}]]]]
653+```
654+
655+...and you'll notice that `src` tells us it's inherited the rule from `/ted`.
656+
657+Now let's try setting both read and write permissions:
658+
659+```
660+> |pass [%c [%perm %home /gen/help/hoon %rw `[%black (sy [%.y ~nes]~)] `[%white (sy [%.y ~nes]~)]]]
661+```
662+
663+```
664+ .^([r=dict:clay w=dict:clay] %cp /===/gen/help/hoon)
665+[r=[src=/gen/help/hoon rul=[mod=%black who=[p={~nes} q={}]]] w=[src=/gen/help/hoon rul=[mod=%white who=[p={~nes} q={}]]]]
666+```
667+
668+Lastly, let's look at deleting a permission rule we've previously set. To do that, we just send a null `(unit rule)` in the `rite`.
669+
670+For example, to remove a read permission (or write if you specify `%w`):
671+
672+```
673+> |pass [%c [%perm %home /gen/help/hoon %r ~]]
674+```
675+
676+```
677+> .^([r=dict:clay w=dict:clay] %cp /===/gen/help/hoon)
678+[r=[src=/ rul=[mod=%white who=[p={} q={}]]] w=[src=/gen/help/hoon rul=[mod=%white who=[p={~nes} q={}]]]]
679+```
680+
681+...and to remove both read and write at the same time:
682+
683+```
684+> |pass [%c [%perm %home /gen/help/hoon %rw ~ ~]]
685+```
686+
687+```
688+> .^([r=dict:clay w=dict:clay] %cp /===/gen/help/hoon)
689+[r=[src=/ rul=[mod=%white who=[p={} q={}]]] w=[src=/ rul=[mod=%white who=[p={} q={}]]]]
690+```
691+
692+As you can see it's back to the default inherited from `/`.
693+
694+Here's a breakdown of a `%perm` task:
695+
696+![perm diagram](https://media.urbit.org/docs/arvo/clay/perm-diagram.png)
697+
698+## `%cred`
699+
700+Here we'll look at creating a permission group by sending Clay a `%cred` `task`.
701+
702+Let's create a group called `'foo'` with a few ships:
703+
704+```
705+|pass [%c [%crew 'foo' (sy ~[~zod ~nec ~bud ~wes ~sev])]]
706+```
707+
708+We'll check it with the next kind of `task`: [%crew](#crew).
709+
710+## `%crew`
711+
712+Here we'll look at retrieving permission groups by sending Clay a `%crew` `task` and receiving a `%cruz` `gift` in response.
713+
714+Let's check, using the `send-task-take-gift.hoon` thread, for the permission group created in the [%cred](#cred) example:
715+
716+```
717+> -send-task-take-gift [%crew ~]
718+[%cruz cez={[p=~.foo q={~nec ~bud ~wes ~zod ~sev}]}]
719+```
720+
721+## `%crow`
722+
723+Here 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.
724+
725+First we'll set a couple of permissions for the `foo` group we created in the [%cred](#cred) section:
726+
727+```
728+> |pass [%c [%perm %home /gen/hood/hi/hoon %w ~ %white (sy [%.n 'foo']~)]]
729+> |pass [%c [%perm %home /ted %w ~ %white (sy [%.n 'foo']~)]]
730+```
731+
732+Notice we use a `%.n` in the `whom` to indicate a group rather than the `%.y` of a ship.
733+
734+Now we'll use the `send-task-take-gift.hoon` thread to try `%crow`:
735+
736+```
737+> -send-task-take-gift [%crow 'foo']
738+[ %croz
739+ rus
740+ { [ p=%home
741+ q
742+ [ r={}
743+ w
744+ { [p=/gen/hood/hi/hoon q=[mod=%white who={[%.n p=~.foo]}]]
745+ [p=/ted q=[mod=%white who={[%.n p=~.foo]}]]
746+ }
747+ ]
748+ ]
749+ }
750+]
751+```
752+
753+# Foreign Ships
754+
755+See the [Foreign Ships](/docs/arvo/clay/tasks#foreign-ships) section of the [API Reference](/docs/arvo/clay/tasks) document for general details.
756+
757+## `%warp` - Remote
758+
759+Here 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.
760+
761+We'll use a fake ~nes as the the foreign ship and a fake ~zod as the local ship.
762+
763+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:
764+
765+```
766+> |pass [%c [%perm %home /foo/txt %rw `[%white (sy [%.y ~zod]~)] `[%white (sy [%.y ~zod]~)]]]
767+```
768+
769+If we scry the file for its permissions with a `%p` `care`, we'll see ~zod is now whitelisted:
770+
771+```
772+> .^([r=dict:clay w=dict:clay] %cp /===/foo/txt)
773+[r=[src=/foo/txt rul=[mod=%white who=[p={~zod} q={}]]] w=[src=/foo/txt rul=[mod=%white who=[p={~zod} q={}]]]]
774+```
775+
776+Back on ~zod: Using the `send-task-take-gift.hoon` thread, send a `%x` read request for `/foo/txt` on ~nes like:
777+
778+```
779+> -send-task-take-gift [%warp ~nes %home ~ %sing %x da+now /foo/txt]
780+[ %writ
781+ p
782+ [ ~
783+ [ p=[p=%x q=[%da p=~2021.5.3..08.24.22..9ce7] r=%home]
784+ q=/foo/txt
785+ r=[p=%txt q=[#t/txt=*'' q=[7.303.014 0]]]
786+ ]
787+ ]
788+]
789+```
790+
791+As 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`:
792+
793+```
794+> -send-task-take-gift [%warp ~nes %home ~ %sing %u da+now /foo/txt]
795+[ %writ
796+ p
797+ [ ~
798+ [ p=[p=%u q=[%da p=~2021.5.3..08.26.32..88cf] r=%home]
799+ q=/foo/txt
800+ r=[p=%flag q=[#t/?(%.y %.n) q=0]]
801+ ]
802+ ]
803+]
804+```
805+
806+If we send a `%d` request however, it will crash:
807+
808+```
809+> -send-task-take-gift [%warp ~nes %home ~ %sing %d da+now /foo/txt]
810+call: failed
811+/sys/vane/clay/hoon:<[4.085 3].[4.314 5]>
812+...
813+/sys/vane/clay/hoon:<[1.365 7].[1.365 51]>
814+[ %clay-bad-foreign-request-care
815+ [%sing mood=[care=%d case=[%da p=~2021.5.3..20.04.57..1092] path=/foo/txt]]
816+]
817+/sys/vane/clay/hoon:<[1.365 48].[1.365 50]>
818+```
819+
820+## `%merg` - Remote
821+
822+To 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.
823+
824+The foreign ship will respond only if correct permissions have been set. See the [%perm](#perm) section for an example.
content/docs/arvo/clay/scry.mdnew file+425
@@ -0,0 +1,425 @@
1++++
2+title = "Scry Reference"
3+weight = 5
4+template = "doc.html"
5++++
6+
7+The various Clay scries are specified by a `care`, which is a single character corresponding with a Clay submodule. Apart from `%s` they just take a `path` to a `desk`, file or directory. All examples are dojo commands, the ='s in the path are automatically populated by the dojo like:
8+
9+```
10+> /===
11+[~.~zod ~.home ~.~2021.4.26..02.29.03..d31b ~]
12+```
13+
14+## Contents
15+
16+- [%a](#a) - Build a `hoon` file.
17+- [%b](#b) - Dynamic `mark`.
18+- [%c](#c) - Dynamic `mark` conversion.
19+- [%d](#d) - List `desk`s.
20+- [%e](#e) - Static `mark`.
21+- [%f](#f) - Static `mark` conversion.
22+- [%p](#p) - File permissions.
23+- [%r](#r) - Vase-wrapped file data.
24+- [%s](#s) - Miscellaneous scries:
25+ - [%yaki](#yaki) - `yaki:clay` of the specified commit.
26+ - [%blob](#blob) - `blob:clay` of file.
27+ - [%hash](#hash) - Content hash of the specified commit.
28+ - [%cage](#cage) - `cage` of the data of a file.
29+ - [%open](#open) - Compile prelude of file.
30+ - [%late](#late) - Most recent `case` of `desk`.
31+ - [%base](#base) - Mergebase of two `desk`s.
32+- [%t](#t) - List files in directory.
33+- [%u](#u) - Check for existence of file.
34+- [%v](#v) - Desk state.
35+- [%w](#w) - Revision number of the given `desk` `case`.
36+- [%x](#x) - Raw data of file.
37+- [%y](#y) - `arch` of a file or directory.
38+- [%z](#z) - Content hash of a file or directory.
39+
40+## %a
41+
42+A scry with a `care` of `%a` will build a `hoon` file and return it as a `vase`.
43+
44+Example:
45+
46+```
47+.^(vase %ca /===/lib/strandio/hoon)
48+```
49+
50+## %b
51+
52+A scry with a `care` of `%b` will produce a `dais:clay` processed `mark` core for the specified `mark`. The `path` in the scry is a `mark`.
53+
54+Example:
55+
56+```
57+.^(dais:clay %cb /===/txt)
58+```
59+
60+## %c
61+
62+A scry with a `care` of `%c` will produce a `tube:clay` dynamically typed `mark` conversion gate. The `path` specifies two `mark`s - *from* and *to*, like `/txt/noun`.
63+
64+Example:
65+
66+```
67+> =a .^(tube:clay %cc /===/txt/mime)
68+> !< mime (a !>(~['foo']))
69+[p=/text/plain q=[p=3 q=7.303.014]]
70+```
71+
72+## %d
73+
74+A scry with a `care` of `%d` will return a `(set desk)` of the `desk`s that exist on your ship.
75+
76+Example:
77+
78+```
79+> .^((set desk) %cd /===)
80+{%home %kids}
81+```
82+
83+## %e
84+
85+A scry with a `care` of `%e` will return a statically typed `nave:clay` `mark` core in a `vase`. The `path` in the scry specifies the `mark`.
86+
87+Example:
88+
89+```
90+.^(vase %ce /===/noun)
91+```
92+
93+## %f
94+
95+A scry with a `care` of `%f` will return a static `mark` conversion gate. The `path` specifies two `mark`s - *from* and *to*, like `/txt/mime`.
96+
97+```
98+> =a .^($-(text mime) %cf /===/txt/mime)
99+> (a ~['foo'])
100+[p=/text/plain q=[p=3 q=7.303.014]]
101+```
102+
103+## %p
104+
105+A scry with a `care` of `%p` will return the permissions of the file or directory in question. The type returned is a `[dict:clay dict:clay]` where the head is read permissions and the tail is write permissions.
106+
107+If the specified file or directory has no permissions set, it will default to the permissions of its parent. If nothing above it has permissions set, it will default to empty whitelists. If the specified file or directory doesn't exist, it will also return the default empty whitelist.
108+
109+Example:
110+
111+```
112+> .^([dict:clay dict:clay] %cp /===/gen)
113+[[src=/ rul=[mod=%white who=[p={} q={}]]] src=/ rul=[mod=%white who=[p={} q={}]]]
114+```
115+
116+## %r
117+
118+A scry with a `care` of `%r` will return the data of the given file wrapped in a `vase` or crash if it's a directory. It's basically just a vase-wrapped `%x` scry.
119+
120+Examples:
121+
122+```
123+> .^(vase %cr /===/gen/hood/hi/hoon)
124+[ #t/@
125+ q
126+ 3.548.750.706.400.251.607.252.023.288.575.526.190.856.734.474.077.821.289.791.377.301.707.878.697.553.411.219.689.905.949.957.893.633.811.025.757.107.990.477.902.858.170.125.439.223.250.551.937.540.468.638.902.955.378.837.954.792.031.592.462.617.422.136.386.332.469.076.584.061.249.923.938.374.214.925.312.954.606.277.212.923.859.309.330.556.730.410.200.952.056.760.727.611.447.500.996.168.035.027.753.417.869.213.425.113.257.514.474.700.810.203.348.784.547.006.707.150.406.298.809.062.567.217.447.347.357.039.994.339.342.906
127+]
128+```
129+
130+```
131+> !< @t .^(vase %cr /===/gen/hood/hi/hoon)
132+':: Helm: send message to an urbit\0a::\0a:::: /hoon/hi/hood/gen\0a ::\0a/? 310\0a:- %say\0a|=([^ [who=ship mez=$@(~ [a=tape ~])] ~] helm-send-hi+[who ?~(mez ~ `a.mez)])\0a'
133+```
134+
135+```
136+> .^(vase %cr /===/gen)
137+Crash!
138+```
139+
140+## %s
141+
142+A scry with a `care` of `%s` is for miscellaneous internal and debug functions and is liable to change in the future.
143+
144+Rather than just a `path` to a file, the head of the `path` is tagged with one of `%yaki %blob %hash %cage %open %late %base` and the tail depends on which tag you use. We'll look at each in turn.
145+
146+### %yaki
147+
148+This will return the [yaki:clay](/docs/arvo/clay/data-types#yaki-clay-commit) of the specified commit. It takes a [tako:clay](/docs/arvo/clay/data-types#tako-clay-commit-reference).
149+
150+Example:
151+
152+Here we scry the [dome:clay](/docs/arvo/clay/data-types#dome-desk-data) for `/===`, get the latest `tako:clay` and the do a `%s` scry for the `yaki:clay` in question.
153+
154+```
155+> =/ =dome:clay .^(dome:clay %cv /===)
156+ =/ =tako:clay (~(got by hit.dome) let.dome)
157+ .^(yaki:clay %cs /===/yaki/(scot %uv tako))
158+[ p=~[80.174.473.756.485.530.520.259.753.935.584.637.641.665.425.899.348.092.348.244.635.557.986.495.151.006]
159+ q
160+ { [p=/mar/hark/graph-hook-update/hoon q=0v5.ea0bj.21s5c.mjrop.ishic.fpkvl.e5bbs.91kc9.tdo41.ifi06.60v41]
161+ [p=/gen/hood/autocommit/hoon q=0v19.rh7jv.sa67o.t3jrb.4sdvs.7c45f.pv2u0.ragik.psp20.agqd8.8srkj]
162+ ...
163+ [p=/tests/lib/primitive-rsa/hoon q=0v1g.3qmq3.6i15q.arh6h.lfsqu.gvc9m.ql6m5.e2rdr.vnnt9.tptc6.mv9u7]
164+ [p=/tests/sys/vane/gall/hoon q=0va.alspc.qptqn.7tuj0.bgecg.1093t.gtsjs.up03k.d1fmk.4jrh8.2tdfa]
165+ }
166+ r=88.666.797.531.755.181.802.690.473.856.185.443.710.929.766.582.249.039.904.824.278.074.149.777.897.099
167+ t=~2021.4.16..10.41.57..3565
168+]
169+```
170+
171+### %blob
172+
173+This will return the [blob:clay](/docs/arvo/clay/data-types#blob-clay-data) of some file. It takes a [lobe:clay](/docs/arvo/clay/data-types#lobe-clay-data-reference).
174+
175+Example:
176+
177+Here we grab the `lobe:clay` of `/gen/hood/hi/hoon` with a `%y` scry, then use it to do a `%s` scry for the `blob:clay` of the file.
178+
179+```
180+> =/ =arch .^(arch %cy /===/gen/hood/hi/hoon)
181+ ?~ fil.arch
182+ ~
183+ .^(blob:clay %cs /===/blob/(scot %uv u.fil.arch))
184+[ %direct
185+ p=0vp.k7nsm.qkdr3.t17rp.33bae.8gajg.v27gi.40itr.2u9qa.nppbt.7k255
186+ q
187+ [ p=%hoon
188+ q
189+3.548.750.706.400.251.607.252.023.288.575.526.190.856.734.474.077.821.289.791.377.301.707.878.697.553.411.219.689.905.949.957.893.633.811.025.757.107.990.477.902.858.170.125.439.223.250.551.937.540.468.638.902.955.378.837.954.792.031.592.462.617.422.136.386.332.469.076.584.061.249.923.938.374.214.925.312.954.606.277.212.923.859.309.330.556.730.410.200.952.056.760.727.611.447.500.996.168.035.027.753.417.869.213.425.113.257.514.474.700.810.203.348.784.547.006.707.150.406.298.809.062.567.217.447.347.357.039.994.339.342.906
190+ ]
191+]
192+```
193+
194+### %hash
195+
196+This will return the `@uvI` content hash of the specified commit. It takes a `tako:clay`.
197+
198+Example:
199+
200+Here we grab the `dome:clay` for `/===` with a `%v` scry, get the latest `tako:clay` and then do a `%s` `%hash` scry for it.
201+
202+```
203+> =/ =dome:clay .^(dome:clay %cv /===)
204+ =/ =tako:clay (~(got by hit.dome) let.dome)
205+ .^(tako:clay %cs /===/hash/(scot %uv tako))
206+0v16.er7uq.oke4u.cru7u.nglu9.q3su7.6ub1o.bh4qk.r5uav.ut12d.5rdl5
207+```
208+
209+### %cage
210+
211+This will return a `cage` of the data of some file. It takes a `lobe:clay`.
212+
213+Example:
214+
215+Here we grab the `lobe:clay` of `/gen/hood/hi/hoon` with a `%y` scry, then use it to do a `%s` scry for the `cage` of the data.
216+
217+```
218+> =/ =arch .^(arch %cy /===/gen/hood/hi/hoon)
219+ ?~ fil.arch
220+ ~
221+ .^(cage %cs /===/cage/(scot %uv u.fil.arch))
222+[ p=%hoon
223+ q
224+ [ #t/@t
225+ q
226+3.548.750.706.400.251.607.252.023.288.575.526.190.856.734.474.077.821.289.791.377.301.707.878.697.553.411.219.689.905.949.957.893.633.811.025.757.107.990.477.902.858.170.125.439.223.250.551.937.540.468.638.902.955.378.837.954.792.031.592.462.617.422.136.386.332.469.076.584.061.249.923.938.374.214.925.312.954.606.277.212.923.859.309.330.556.730.410.200.952.056.760.727.611.447.500.996.168.035.027.753.417.869.213.425.113.257.514.474.700.810.203.348.784.547.006.707.150.406.298.809.062.567.217.447.347.357.039.994.339.342.906
227+ ]
228+]
229+```
230+
231+### %open
232+
233+This is like a `%a` scry but it only compiles the prelude to the file, e.g. the Ford rune imports. Proper documentation for this will be done as part of Ford documentaton at a later date.
234+
235+### %late
236+
237+This will return the most recent revision number of a `desk` that has been fully downloaded. The type it returns is a `cass:clay`. The `case` in the `beak` must be a revision number rather than a date. You can just provide a case of `1` since it returns the latest regardless. If we have nothing for the specified `desk`, this will just return the bunt of a `cass:clay` like `cass=[ud=0 da=~2000.1.1]`.
238+
239+Example:
240+
241+```
242+> .^(=cass:clay %cs /(scot %p (sein:title our now our))/kids/1/late)
243+cass=[ud=50 da=~2021.4.22..10.38.50..57a8]
244+```
245+
246+```
247+> .^(=cass:clay %cs /~sampel/kids/1/late)
248+cass=[ud=0 da=~2000.1.1]
249+```
250+
251+### %base
252+
253+This will return the mergebase (i.e. most recent common ancestor) between two `desk`s. The type it returns is a `(list tako:clay)`. The first `desk` will just be the one in the `beak` `path` prefix and the second will be specified like `/ship/desk` at the end of the scry `path`. If there is no common ancestor between the two `desk`s, this will just produce an empty `list`.
254+
255+Examples:
256+
257+```
258+> .^((list tako:clay) %cs /===/base/(scot %p (sein:title our now our))/kids)
259+~[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]
260+```
261+
262+```
263+> .^((list tako:clay) %cs /===/base/~sampel/kids)
264+~
265+```
266+
267+## %t
268+
269+A scry with a `care` of `%t` will return a `(list path)` of all files in the given directory, or just a `(list path)` of the single file if it's a file. This is done recursively so will provide files in subdirectories as well. The paths will be fully qualified except for the `ship`, `desk` and `case`. If the directory or file specified does not exist, it will return an empty `list`.
270+
271+Examples:
272+
273+```
274+> .^((list path) %ct /===/app/landscape)
275+~[
276+ /app/landscape/css/index/css
277+ /app/landscape/img/favicon/png
278+ /app/landscape/img/imageupload/png
279+ /app/landscape/img/touch_icon/png
280+ /app/landscape/index/html
281+ /app/landscape/js/channel/js
282+]
283+```
284+
285+```
286+> .^((list path) %ct /===/gen/group-store/add/hoon)
287+~[/gen/group-store/add/hoon]
288+```
289+
290+```
291+> .^((list path) %ct /===/foobar)
292+~
293+```
294+
295+## %u
296+
297+A scry with a `care` of `%u` will return a `?` depending on whether the file exists. It will produce `%.n` if it's a directory or doesn't exist and will produce `%.y` if it's a file and exists.
298+
299+Examples:
300+
301+```
302+> .^(? %cu /===/app)
303+%.n
304+```
305+
306+```
307+> .^(? %cu /===/gen/code/hoon)
308+%.y
309+```
310+
311+```
312+> .^(? %cu /===/foobar)
313+%.n
314+```
315+
316+## %v
317+
318+A scry with a care of `%v` will return the entire state of a `desk` as a `dome:clay`.
319+
320+Example:
321+
322+```
323+> =a .^(dome:clay %cv /===)
324+> let.a
325+1
326+```
327+
328+Note: If you try printing this it will take forever and probably OOM your ship.
329+
330+## %w
331+
332+A scry with a `care` of `%w` will return the revision number and date of a given `case`. The type returned is a `cass:clay` like `[ud=@ud da=@da]` where `ud` is the revision number and `da` is the date.
333+
334+Example:
335+
336+```
337+> .^(cass:clay %cw /===)
338+[ud=2 da=~2021.4.13..19.12.49..3389]
339+```
340+
341+## %x
342+
343+A scry with a `care` of `%x` will return the raw data of a file as an `@` or crash if it's a directory.
344+
345+
346+Examples:
347+
348+```
349+> .^(@ %cx /===/gen/hood/hi/hoon)
350+3.548.750.706.400.251.607.252.023.288.575.526.190.856.734.474.077.821.289.791.377.301.707.878.697.553.411.219.689.905.949.957.893.633.811.025.757.107.990.477.902.858.170.125.439.223.250.551.937.540.468.638.902.955.378.837.954.792.031.592.462.617.422.136.386.332.469.076.584.061.249.923.938.374.214.925.312.954.606.277.212.923.859.309.330.556.730.410.200.952.056.760.727.611.447.500.996.168.035.027.753.417.869.213.425.113.257.514.474.700.810.203.348.784.547.006.707.150.406.298.809.062.567.217.447.347.357.039.994.339.342.906
351+```
352+
353+```
354+> .^(@t %cx /===/gen/hood/hi/hoon)
355+':: Helm: send message to an urbit\0a::\0a:::: /hoon/hi/hood/gen\0a ::\0a/? 310\0a:- %say\0a|=([^ [who=ship mez=$@(~ [a=tape ~])] ~] helm-send-hi+[who ?~(mez ~ `a.mez)])\0a'
356+```
357+
358+```
359+> .^(@ %cx /===/gen/hood)
360+Crash!
361+```
362+
363+## %y
364+
365+A scry with a `care` of `%y` will return the `arch` of a file or directory.
366+
367+An `arch` is a `[fil=(unit lobe:clay) dir=(map @ta ~)]`. The `fil` will contain the `lobe:clay` hash if it's a file, otherwise it will be null. The `dir` will contain a map of the files and directories it contains, otherwise it will be null.
368+
369+It will return the bunt of an `arch` if the file or directory is not found.
370+
371+Examples:
372+
373+```
374+> .^(arch %cy /===/gen/group-store)
375+[ fil=~
376+ dir
377+ { [p=~.allow-ships q=~]
378+ [p=~.add q=~]
379+ [p=~.ban-ranks q=~]
380+ [p=~.remove q=~]
381+ [p=~.create q=~]
382+ [p=~.join q=~]
383+ [p=~.allow-ranks q=~]
384+ [p=~.ban-ships q=~]
385+ }
386+]
387+```
388+
389+```
390+> .^(arch %cy /===/gen/group-store/allow-ships)
391+[fil=~ dir={[p=~.hoon q=~]}]
392+```
393+
394+```
395+> .^(arch %cy /===/gen/group-store/allow-ships/hoon)
396+[fil=[~ 0vb.g8sqs.7gjm9.bl3vu.nk677.h5be1.g9eg3.4v1jo.00ivf.g8ndu.48a53] dir={}]
397+```
398+
399+```
400+> .^(arch %cy /===/foobar)
401+[fil=~ dir={}]
402+```
403+
404+## %z
405+
406+A scry with a `care` of `%z` will return the hash of a file or the recursive hash of a directory. If the file or directory doesn't exist it will return a null value.
407+
408+The type returned is a `@uxI`.
409+
410+Examples:
411+
412+```
413+> .^(@uvI %cz /===/gen)
414+0v5.itmhj.lt7ak.lgr1k.dr7vu.u7u9s.ko5rf.idfcr.ukrd2.t088n.3ml1k
415+```
416+
417+```
418+> .^(@uvI %cz /===/gen/code/hoon)
419+0v1t.vi1pf.3ba4n.87g6h.dcc1p.4t4l8.rm6a9.b4de4.v77qc.p9dc0.p8289
420+```
421+
422+```
423+> .^(@uvI %cz /===/foobar)
424+0v0
425+```
content/docs/arvo/clay/tasks.mdnew file+555
@@ -0,0 +1,555 @@
1++++
2+title = "API Reference"
3+weight = 6
4+template = "doc.html"
5++++
6+
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+- [Write and Modify](#write-and-modify)
17+ - [%info](#info)
18+- [Manage Mounts](#manage-mounts)
19+ - [%boat](#boat) - List mounts.
20+ - [%mont](#mont) - Mount something.
21+ - [%ogre](#ogre) - Unmount something.
22+ - [%dirk](#dirk) - Commit changes.
23+- [Merge Desks](#merge-desks)
24+ - [%merg](#merg)
25+- [Permissions](#permissions)
26+ - [%perm](#perm) - Set file permissions.
27+ - [%cred](#cred) - Add permission group.
28+ - [%crew](#crew) - Get permission groups.
29+ - [%crow](#crow) - Get group usage.
30+- [Foreign Ships](#foreign-ships)
31+ - [%warp](#warp-remote) - Read a file on a foreign ship.
32+ - [%merg](#merg-remote) - Merge from a foreign `desk`.
33+
34+# Introduction
35+
36+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.
37+
38+The 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.
39+
40+# `%warp`
41+
42+A `%warp` `task` is for reading a subscribing to files and directories.
43+
44+### Accepts
45+
46+```hoon
47+[wer=ship rif=riff]
48+```
49+
50+The `wer` field is the target ship. The `(unit rave)` of the [riff](/docs/arvo/clay/data-types#riff-clay-request-desist) is null to cancel an existing subscription, otherwise the [rave](/docs/arvo/clay/data-types#rave-clay-general-subscription-request) is tagged with one of:
51+
52+- `%sing` - Read a single file or directory.
53+- `%next` - Subscribe for the next change to a file or directory.
54+- `%mult` - Subscribe for the next change to a set of files and/or directories.
55+- `%many` - Track changes to a desk for the specified range of revisions.
56+
57+We'll look at each of these in more detail below.
58+
59+### Returns
60+
61+Clay responds to a `%mult` request with a `%wris` `gift`, and the rest with a `%writ` `gift`.
62+
63+A `%wris` `gift` looks like:
64+
65+```hoon
66+[%wris p=[%da p=@da] q=(set (pair care path))] :: many changes
67+```
68+
69+...and a `%writ` `gift` looks like:
70+
71+```hoon
72+[%writ p=riot] :: response
73+```
74+
75+The `unit` of the [riot](/docs/arvo/clay/data-types#riot-clay-response) will be null if the target file cannot be found or if a subscription has ended (depending on context). Otherwise it will have a [rant](/docs/arvo/clay/data-types#rant-clay-response-data) with a `cage` containing the data you requested. Its contents will vary depending on the kind of request and `care`.
76+
77+Now we'll look at each of the `rave` request types in turn.
78+
79+## `%sing`
80+
81+```hoon
82+[%sing =mood]
83+```
84+
85+This `rave` is for reading a single file or directory immediately.
86+
87+The `care` of the [mood](/docs/arvo/clay/data-types#mood-clay-single-subscription-request) will determine what you can read and what type of data will be returned. See the [care](/docs/arvo/clay/data-types#care-clay-clay-submode) documentation and [scry](/docs/arvo/clay/scry) documentation for details on the various `care`s.
88+
89+The [case](/docs/arvo/clay/data-types#case-specifying-a-commit) specifies the `desk` revision and you can use whichever kind you prefer. The `path` will usually be a path to a file or directory like `/gen/hood/hi/hoon` but may be something else depending on the `care`.
90+
91+### Example
92+
93+[See here for an example of using %sing.](/docs/arvo/clay/examples#sing)
94+
95+## `%next`
96+
97+```hoon
98+[%next =mood] :: await next version
99+```
100+
101+This subscribes to the next version of the specified file. See [here](/docs/arvo/clay/data-types#mood-clay-single-subscription-request) for details of the `mood` structure.
102+
103+If you subscribe to the current `case` of the `desk`, Clay will not respond until the file changes. If you subscribe to a previous `case` of the `desk` and the file has changed in between then and now, it will immediately return the first change it comes across in that range. For example, if you're currently at `case` `100`, subscribe to case `50` and the file in question has been modified at both `60` and `80`, clay will immediately return the version of the file at `case` `60`.
104+
105+### Example
106+
107+[See here for an example of using %next.](/docs/arvo/clay/examples#next)
108+
109+## `%mult`
110+
111+```hoon
112+[%mult =mool] :: next version of any
113+```
114+
115+This subscribes to the next version of a `set` of files or directories. Clay will only send a single response, and it will send it when *any* of the specified files change. For example, if you subscribe to both `/foo/txt` and `/bar/txt`, and only `/foo/txt` changes, Clay will send a response indicating a change to `/foo/txt`. If `/bar/txt` changes subsequently, it will not tell you. If more than one file changes at once, it will tell you about each of the changes in the one response.
116+
117+The behaviour with respect to requesting old `case`s is the same as explained in the [`%next`](#next) section above.
118+
119+The `mool` specified in the request is this structure:
120+
121+```hoon
122++$ mool [=case paths=(set (pair care path))] :: requests in desk
123+```
124+
125+You can use a different `care` for each of the files specified by the `path` if you like. Significantly, the `care` will determine whether Clay sends a response for a given change. For example, if you subscribe to an existing `/foo/txt` with a `%u` `care` and `/foo/txt` is modified but isn't deleted, Clay will *not* tell you. However, if you subscribe with an `%x` `care`, it *will* tell you.
126+
127+### Example
128+
129+[See here for an example of using %mult.](/docs/arvo/clay/examples#mult)
130+
131+## `%many`
132+
133+```hoon
134+[%many track=? =moat] :: track range
135+```
136+
137+This subscribes to all changes to a `desk` for the specified range of `case`s. Note that you're unlikely to use this directly, it's mostly used implicitly if you make a `%sing` or `%next` request with a `%v` `care` to a foreign `desk`. Regardless, we'll have a look at it for completeness.
138+
139+If the `track` is `%.y` it will just return a `%writ` like:
140+
141+```hoon
142+[%writ p=[~ [p=[p=%w q=[%ud p=256] r=%home] q=/ r=[p=%null q=[#t/@n q=0]]]]]
143+```
144+
145+...that merely informs you of a change. If you want the actual data you'll have to request it separately.
146+
147+If the `track` is `%.n`, the `cage` of the `%writ` will contain a [nako](/docs/arvo/clay/data-types#nako-subscription-response-data) with the relevant data for all changes to a desk between what you have and the `case` requested. It is very large and fairly complicated. The `nako` structure is defined in the `clay.hoon` source file itself rather than in `lull.hoon` or elsewhere since you're unlikely to work with it yourself.
148+
149+The `from` and `to` fields of the [moat](/docs/arvo/clay/data-types#moat-clay-range-subscription-request) specify the range of `case`s for which to subscribe. The range is *inclusive*. It can be specified by date or by revision number, whichever you prefer.
150+
151+The `path` in the `moat` is a path to a file or directory. If it's `~` it refers to the root of the `desk` in question. This lets you say "only inform me of changes to the `desk` if the specified file or directory exists". If it doesn't exist, Clay will not send you anything.
152+
153+When you reach the end of the subscribed range of `case`s, Clay will send you a `%writ` with a null `riot` to inform you the subscription has ended like:
154+
155+```hoon
156+[%writ p=~]
157+```
158+
159+### Example
160+
161+[See here for an example of using %many.](/docs/arvo/clay/examples#many)
162+
163+## Cancel Subscription
164+
165+To cancel a subscription, you just send a `%warp` with a null `(unit rave)` in the `riff`. Clay will cancel the subscription based on the `wire`. The request is exactly the same regardless of which type of `rave` you subscribed with originally.
166+
167+### Example
168+
169+[See here for an example of cancelling a subscription.](/docs/arvo/clay/examples#cancel-subscription)
170+
171+# Write and Modify
172+
173+## `%info`
174+
175+To write or modify a file, we send Clay a `%info` `task`.
176+
177+### Accepts
178+
179+```hoon
180+[des=desk dit=nori]
181+```
182+
183+The `%|` tag in the [nori](/docs/arvo/clay/data-types#nori-clay-repository-action) is not currently supported and will crash with a `%labelling-not-implemented` if used, so you can focus on the `%&` part. The [soba](/docs/arvo/clay/data-types#soba-clay-delta) in the `nori` is just a list of changes so you can make more than one change in one request. Its `path` is just the path to a file like `/gen/hood/hi/hoon` and the [miso](/docs/arvo/clay/data-types#miso-clay-ankh-delta) is one of these types of requests:
184+
185+- `%del` - Delete a file.
186+- `%ins` - Insert file. This will also replace an existing file.
187+- `%dif` - This has not yet been implemented so will crash with a `%dif-not-implemented` error.
188+- `%mut` - Change a file. At the time of writing this behaves identically to `%ins` so its use merely informs the reader.
189+
190+### Returns
191+
192+Clay does not give any response to an `%info` `task` so don't expect a `sign` back.
193+
194+### Example
195+
196+Here are examples of using each of these as well as making multiple changes in one request:
197+
198+- [%del](/docs/arvo/clay/examples#del)
199+- [%ins](/docs/arvo/clay/examples#ins)
200+- [%mut](/docs/arvo/clay/examples#mut)
201+- [Multiple Changes](/docs/arvo/clay/examples#multiple-changes)
202+
203+
204+# Manage Mounts
205+
206+Here we'll look at managing Clay unix mounts programmatically.
207+
208+There are four Clay `task`s relevant to mounts:
209+
210+- [%boat](#boat) - List mounts.
211+- [%mont](#mont) - Mount something.
212+- [%ogre](#ogre) - Unmount something.
213+- [%dirk](#dirk) - Commit changes.
214+
215+## `%boat`
216+
217+A `%boat` `task` requests the list of existing mounts.
218+
219+### Accepts
220+
221+```hoon
222+~
223+```
224+
225+A `%boat` `task` does not take any arguments.
226+
227+### Returns
228+
229+The type it returns is a `%hill` `gift`, which looks like:
230+
231+```hoon
232+[%hill p=(list @tas)]
233+```
234+
235+...where the `@tas` is the name of the mount point.
236+
237+### Example
238+
239+[See here for an example of using %boat.](/docs/arvo/clay/examples#boat)
240+
241+## `%mont`
242+
243+
244+A `%mont` `task` mounts the specified `beam` to the specified `term` mount point.
245+
246+### Accepts
247+
248+```hoon
249+[pot=term bem=beam]
250+```
251+
252+A `beam:clay` is the following structure:
253+
254+```hoon
255++$ beam [[p=ship q=desk r=case] s=path] :: global name
256+```
257+
258+You can mount the whole desk with a `path` of `/`, and you can also mount subdirectories or even individual files. If you want to mount an individual file, you must exclude its `mark` from the path. For example, if you want to mount `/gen/hood/hi/hoon`, you'd specify `/gen/hood/hi`. It will automatically be given the correct file extension when mounted. If you include the `hoon` mark it will crash (and currently crash your ship).
259+
260+### Returns
261+
262+Clay does not return a `gift` in response to a `%mont` `%task`.
263+
264+### Example
265+
266+[See here for an example of using %mont.](/docs/arvo/clay/examples#mont)
267+
268+## `%ogre`
269+
270+A `%ogre` `task` unmounts the specified mount.
271+
272+### Accepts
273+
274+```hoon
275+[pot=$@(desk beam)]
276+```
277+
278+It's defined in `lull.hoon` as taking `$@(desk beam)` but in fact it will only unmount the target when specified as a `term` mount name. Passing it a `desk` will incidentally work if the mount is named the same as the `desk` but otherwise it won't work. Passing it a `beam:clay` will simply not work.
279+
280+### Returns
281+
282+Clay does not return a `gift` in response to a `%ogre` `task`.
283+
284+### Example
285+
286+[See here for an example of using %ogre.](/docs/arvo/clay/examples#ogre)
287+
288+## `%dirk`
289+
290+A `%dirk` `task` commits changes in the target mount.
291+
292+### Accepts
293+
294+```hoon
295+des=desk
296+```
297+
298+It's defined in `lull.hoon` as taking a `desk` but like [%ogre](#ogre), it actually takes the name of a mount point rather than a `desk` as is specified.
299+
300+### Returns
301+
302+Clay does not return a `gift` in response to a `%dirk` `task`.
303+
304+### Example
305+
306+[See here for an example of using %dirk.](/docs/arvo/clay/examples#dirk)
307+
308+# Merge Desks
309+
310+## `%merg`
311+
312+A `%merg` `task` will merge the specified source `desk` into the target local `desk`.
313+
314+### Accepts
315+
316+```hoon
317+$: des=desk :: target
318+ her=@p dem=desk cas=case :: source
319+ how=germ :: method
320+==
321+```
322+The `germ` specifies the merge strategy. You can refer to the [Strategies](/docs/arvo/clay/using#strategies) section of the [Using Clay](/docs/arvo/clay/using) document for details of each `germ`.
323+
324+If you're merging into a new `desk` you must use `%init`, all other strategies will fail. If the desk already exists, you cannot use `%init`. Otherwise, you're free to use whichever you'd like.
325+
326+### Returns
327+
328+Clay will respond to the request with a `%mere` `gift` which looks like:
329+
330+```hoon
331+[%mere p=(each (set path) (pair term tang))] :: merge result
332+```
333+
334+If the merge succeeded, `p` will look like `[%mere p=[%.y p={}]]` where `p.p` is the set of files which had a merge conflict. For example, `[%mere p=[%.y p={/foo/txt}]]` means there was a conflict with `/foo/txt`. An empty set means there were no conflicts.
335+
336+If the merge failed, `p` will have a head of `%.n` and then a `[term tang]` where the `term` is an error message and the `tang` contains additional details, for example:
337+
338+```hoon
339+[ %mere
340+ p
341+ [ %.n
342+ p=[p=%mate-conflict q=~[[%rose p=[p="/" q="/" r=""] q=~[[%leaf p="foo"] [%leaf p="txt"]]]]]
343+ ]
344+]
345+```
346+
347+### Example
348+
349+[See here for an example of using %merg.](/docs/arvo/clay/examples#merg)
350+
351+# Permissions
352+
353+For each file or directory, there is both a read permission and a write permission. Each may be set separately and is either a whitelist or a blacklist (but not both). The whitelist/blacklist contains a `set` of ships and/or groups which are allowed or banned respectively. If it's an empty whitelist it means all foreign ships are denied. If it's an empty blacklist it means all foreign ships are allowed.
354+
355+If permissions are not set for a particular file, they will be inherited from the directory in which it resides. If *that* directory has no permissions set, they will be inherited from another level up, and so on to the `desk`'s root directory. If the root directory has no permissions set, it will have the default permissions of an empty whitelist, meaning "deny all".
356+
357+A group is called a `crew` and is just a `set` of ships with a `@ta` name.
358+
359+The permissions for each file or directory are a pair of `dict:clay` where the head is read permissions and the tail is write permissions.
360+
361+A `dict:clay` is this structure:
362+
363+```hoon
364++$ dict [src=path rul=real] :: effective permission
365+```
366+
367+The `src` path is where the permissions were inherited from and the `real` is this structure:
368+
369+```hoon
370+ +$ real :: resolved permissions
371+ $: mod=?(%black %white) ::
372+ who=(pair (set ship) (map @ta crew)) ::
373+ == ::
374+```
375+
376+So if we scry for permissions with a `%p` `care`, it'll look like:
377+
378+```hoon
379+> .^([r=dict:clay w=dict:clay] %cp /===/lib/strandio/hoon)
380+[r=[src=/ rul=[mod=%white who=[p={} q={}]]] w=[src=/ rul=[mod=%white who=[p={} q={}]]]]
381+```
382+
383+There are four permission-related `task`s which you can pass to Clay.
384+
385+A `%perm` `task` is for setting permissions, and the other three are for managing groups:
386+
387+- `%cred` - Add permission group.
388+- `%crew` - Get permission groups.
389+- `%crow` - Get group usage.
390+
391+We'll look at each of these in turn.
392+
393+## `%perm`
394+
395+A `%perm` `task` sets permissions for the target file or directory.
396+
397+Note this will replace existing permissions rather than add to them, so if you want to add a ship to an existing whitelist or whatever you'll have to first read the existing permissions, add the ship, then send the whole lot back.
398+
399+### Accepts
400+
401+```hoon
402+[des=desk pax=path rit=rite]
403+```
404+
405+The `pax` path is the file or directory whose permissions you want to change, and the `rite` is this structure:
406+
407+```hoon
408++$ rite :: new permissions
409+ $% [%r red=(unit rule)] :: for read
410+ [%w wit=(unit rule)] :: for write
411+ [%rw red=(unit rule) wit=(unit rule)] :: for read and write
412+```
413+
414+Where a `rule` is this structure:
415+
416+```hoon
417++$ rule [mod=?(%black %white) who=(set whom)] :: node permission
418+```
419+
420+...and finally `whom` is this:
421+
422+```hoon
423++$ whom (each ship @ta) :: ship or named crew
424+```
425+
426+As the comment suggests, the `@ta` is the name of a `crew` (group).
427+
428+### Returns
429+
430+Clay does not return a `gift` in response to a `%perm` `task`.
431+
432+### Example
433+
434+[See here for an example of using %perm.](/docs/arvo/clay/examples#perm)
435+
436+## `%cred`
437+
438+This simply creates a permission group.
439+
440+### Accepts
441+
442+```hoon
443+[nom=@ta cew=crew]
444+```
445+
446+The `nom` is a name for the group and the `crew` is just a `(set ship)`:
447+
448+```hoon
449++$ crew (set ship) :: permissions group
450+```
451+
452+### Returns
453+
454+Clay does not return a `gift` in response to a `%cred` `task`.
455+
456+### Example
457+
458+[See here for an example of using %cred.](/docs/arvo/clay/examples#cred)
459+
460+## `%crew`
461+
462+This retrieves all permission groups.
463+
464+### Accepts
465+
466+```hoon
467+~
468+```
469+
470+A `%crew` `task` takes no arguments.
471+
472+### Returns
473+
474+Clay wil return a `%cruz` `gift`. It looks like:
475+
476+```hoon
477+[%cruz cez=(map @ta crew)] :: permission groups
478+```
479+
480+The `cez` is just a map from group name to `crew` which is just a `(set ship)`.
481+
482+### Example
483+
484+[See here for an example of using %crew.](/docs/arvo/clay/examples#crew)
485+
486+## `%crow`
487+
488+A `%crow` `task` retrieves all files and directories in all `desk`s which have permissions set for the group in question. It will not return inherited permissions, only those explicitly set.
489+
490+### Accepts
491+
492+```hoon
493+nom=@ta
494+```
495+
496+The `nom` is the name of a `crew`.
497+
498+### Returns
499+
500+The `gift` you get back is a `%croz` which looks like:
501+
502+```hoon
503+[%croz rus=(map desk [r=regs w=regs])] :: rules for group
504+```
505+
506+...where `regs` is this structure:
507+
508+```hoon
509++$ regs (map path rule) :: rules for paths
510+```
511+
512+### Example
513+
514+[See here for an example of using %crow.](/docs/arvo/clay/examples#crow)
515+
516+# Foreign Ships
517+
518+Here we'll looking at making Clay requests to a foreign ship.
519+
520+As it currently stands, it's not possible to write to a foreign `desk`. Additionally, remote scries are not implemented. That leaves requests to read files (`%warp`) and merge desks (`%merg`), which we'll look at next.
521+
522+## `%warp` - Remote
523+
524+To read files on a foreign `desk`, you just send Clay a `%warp` `task` (as you would for a local read) and specify the target ship in the `wer` field. For details on making such requests, see the [Read and Subscribe](#warp) section.
525+
526+Clay only allows a subset of `care`s to be used remotely. They are:
527+
528+- `%u` - Check for existence of file.
529+- `%v` - Get entire `dome:clay` state of a desk.
530+- `%w` - Get revision number.
531+- `%x` - Get data of file.
532+- `%y` - Get `arch` of file or directory.
533+- `%z` - Get content hash of file or directory.
534+
535+Any other `care` will crash with a `%clay-bad-foreign-request-care` error.
536+
537+The foreign ship will respond only if correct permissions have been set. See the [Permissions](#permissions) section for details.
538+
539+Note that if you're reading a whole `desk` or directory, all subfolders and files must also permit reading. If even a single file does not permit you reading it, the foreign ship will not respond to the request.
540+
541+### Example
542+
543+[See here for examples of requests to foreign ships.](/docs/arvo/clay/examples#foreign-ships)
544+
545+## `%merg` - Remote
546+
547+To 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.
548+
549+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`.
550+
551+Note 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.
552+
553+### Example
554+
555+[See here for examples of requests to foreign ships.](/docs/arvo/clay/examples#foreign-ships)
content/docs/arvo/clay/using.mdnew file+217
@@ -0,0 +1,217 @@
1++++
2+title = "Using Clay"
3+weight = 3
4+template = "doc.html"
5++++
6+
7+### Reading and Subscribing
8+
9+When reading from Clay, there are three types of requests. A
10+`%sing` request asks for data at single revsion. A `%next`
11+request asks to be notified the next time there's a change to
12+given file. A `%many` request asks to be notified on every
13+change in a `desk` for a range of changes.
14+
15+For `%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`
20+of a node changes if it or any of its children change.
21+
22+A `%sing` request is fulfilled immediately if possible. If the
23+requested revision is in the future, or is on another ship for
24+which 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
27+the request is for data on another ship, we pass on the request
28+to the other ship. In general, Clay subscriptions, like most
29+things in Urbit, aren't guaranteed to return immediately.
30+They'll return when they can, and they'll do so in a
31+referentially transparent manner.
32+
33+A `%next` request checks the query at the given revision, and it
34+produces the result of the query the next time it changes, along
35+with the revision number when it changes. Thus, a `%next` of a
36+`%u` is triggered when a file is added or deleted, a `%next` of a
37+`%x` is triggered when a file is added, deleted, or changed, and
38+a `%next` of a `%y` is triggered when a file or any of its
39+children is added, deleted, or changed.
40+
41+A `%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
44+single 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`
47+request doesn't ask for any particular data, there aren't `%u`,
48+`%x`, and `%y` versions for it.
49+
50+### Unix sync
51+
52+Usage:
53+```
54+|mount %/path/to/directory %mount-point
55+|commit %mount-point
56+|autocommit %mount-point
57+```
58+
59+One of the primary functions of Clay is as a convenient user
60+interface. While tools exist to use Clay from within Urbit, it's
61+often useful to be able to treat Clay like any other filesystem
62+from the Unix perspective -- to "mount" it, as it were.
63+
64+From the dojo, you can run `|mount %/path/to/directory %mount-point`, and this
65+will mount the given Clay directory to the mount-point directory in Unix, with
66+your pier as the root directory. For example `|mount %/gen %generators` will
67+create a `/generators` directory in your pier, and mount the `/gen` folder at
68+that point. If you'd like to use the directory name as the mount point, you can
69+elide the last argument, e.g. `|mount %/gen` mounts `/gen` to `/gen`.
70+
71+Every file is converted to `%mime` before it's written to Unix, and converted
72+back when read from Unix. The entire directory is watched (a la Dropbox), and
73+every change is committed once you run `|commit %mount-point`. Every change can
74+be automatically committed with `|autocommit %mount-point`.
75+
76+### Merging
77+
78+Usage:
79+```
80+|merge %target-desk ~source-ship %source-desk
81+|merge %target-desk ~source-ship %source-desk, =gem %strategy
82+|merge %target-desk ~source-ship %source-desk, =cas ud+5
83+```
84+
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
89+with several parents ("octopus merges") are possible but we don't
90+generate them right now.
91+
92+Unless otherwise specified, all of the following create a new commit
93+with 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
97+with `%merge-no-merge-base`; if there are two or more, pick one.
98+
99+#### Strategies
100+
101+**`%init`**: the only way to create a `desk`. Not a true merge, since it
102+simply assigns the source commit to the destination.
103+
104+**`%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+destination, assign the next revision number to the source commit.
108+Some call this "fast-forward".
109+
110+**`%meet`**: combine changes, failing if both sides changed the same file.
111+Specifically, take diff(merge-base,source) and
112+diff(merge-base,destination) and combine them as long as those diffs
113+touch different files.
114+
115+**`%mate`**: combine changes, failing if both sides changed the same part
116+of a file. Identical to `%meet`, except that some marks, like `%hoon`,
117+allow intelligent merge of changes to different parts of a file.
118+
119+**`%meld`**: combine changes; if both sides changed the same part of a
120+file, use the version of the file in the merge-base.
121+
122+**`%only-this`**: create a merge commit with exactly the contents of the
123+destination `desk`.
124+
125+**`%only-that`**: create a merge commit with exactly the contents of the
126+source commit.
127+
128+**`%take-this`**: create a merge commit with exactly the contents of the
129+destination `desk` except take any files from the source commit which
130+are not in the destination `desk`.
131+
132+**`%take-that`**: create a merge commit with exactly the contents of the
133+source commit except preserve any files from the destination `desk`
134+which are not in the source commit.
135+
136+**`%meet-this`**: merge as in `%meet`, except if both sides changed the same
137+file, use the version in the destination `desk`.
138+
139+**`%meet-that`**: merge as in `%meet`, except if both sides changed the same
140+file, use the version in the source commit.
141+
142+#### Examples and notes:
143+
144+The most common merge strategy is `%mate`, which is a normal 3-way
145+merge which aborts on conflict.
146+
147+`%take-that` is useful to "force" an OTA. After running `%take-that`,
148+you're guaranteed to have exactly the files in the source commit plus
149+any files you separately added.
150+
151+We speak of merging into a destination *`desk`* from a source *commit*
152+because 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
156+```
157+will create a new `desk` called `%old` with the 5th commit in `%home`.
158+You can revert the contents of a `desk` to what they were yesterday
159+with
160+```
161+|merge %home our %home, =cas da+(sub now ~d1), =gem %only-that
162+```
163+
164+Note this is a normal `%only-that merge`, which means you're creating a
165+*new* commit with the old *contents*.
166+
167+`%meld` is rarely used on its own, however if you specify `%auto` or
168+omit the merge strategy, `%kiln` will run a `%meld` merge into a scratch
169+`desk` and then annotate the conflicts there.
170+
171+If you resolve merge conflicts manually, for example by mounting the
172+`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
174+newly-fixed contents of your `desk`, but it will record that the merge
175+happened so that those conflicts don't reappear in later merges.
176+
177+If 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
179+them a common ancestor by choosing a merge strategy which doesn't
180+need a merge-base, like `%only-this`, `%only-that`, `%take-this`, or
181+`%take-that`.
182+
183+`%take-this` could be useful to install 3rd party software, but you
184+couldn't get subsequent updates this way, since the files would
185+already exist in the destination `desk`. Something like "take only
186+the 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
188+the `desk`s to not conflict with.
189+
190+`%meet-this` and `%meet-that` imply the existence of `%mate-this` and
191+`%mate-that`, but those don't exist yet.
192+
193+### Autosync
194+
195+Usage:
196+```
197+|sync %target-desk ~source-ship %source-desk
198+```
199+
200+Tracking and staying in sync with another `desk` is another
201+fundamental operation. We call this "autosync". This doesn't mean
202+simply mirroring a `desk`, since that wouldn't allow local changes.
203+We simply want to apply changes as they are made upstream, as
204+long as there are no conflicts with local changes.
205+
206+This is implemented by subscribing to changes to the other `desk`, with a
207+`%many` request and, when it has changes, merging these changes into our `desk`
208+with the usual merge strategies.
209+
210+Note that it's quite reasonable for two `desk`s to be autosynced to
211+each other. This results in any change on one `desk` being mirrored
212+to the other and vice versa.
213+
214+Additionally, it's fine to set up an autosync even if one `desk`,
215+the other `desk`, or both `desk`s do not exist. The sync will be
216+activated when the upstream `desk` comes into existence and will
217+create the downstream `desk` if needed.
content/docs/arvo/concepts/_index.mdnew file+13
@@ -0,0 +1,13 @@
1++++
2+title = "Concepts"
3+weight = 100
4+sort_by = "weight"
5+template = "sections/docs/chapters.html"
6+insert_anchor_links = "right"
7++++
8+
9+Other concepts related to the way Arvo works.
10+
11+## [Subscriptions](/docs/arvo/concepts/subscriptions)
12+
13+Urbit 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/subscriptions.mdnew file+162
@@ -0,0 +1,162 @@
1++++
2+title = "Subscriptions"
3+weight = 50
4+template = "doc.html"
5++++
6+
7+Urbit relies heavily on subscriptions throughout the stack. We strongly
8+prefer reactive data flow compared to querying or polling, which is why
9+for example our equivalent to git natively supports subscriptions to its
10+data.
11+
12+We have many application-level styles of subscription, but we only have
13+three true subscription types in Arvo, named for the vane they're
14+implemented in: Clay subscriptions (filesystem), Gall subscriptions
15+(applications), and Jael subscriptions (Urbit ID info). They're at
16+three different points in the idea maze of subscriptions, and we'll
17+encounter each of them here.
18+
19+For our purposes, a subscription is a stream of events from a publisher
20+to a subscriber, where (1) the publisher has indicated interest in that
21+stream, (2) any update sent to one subscriber is sent to all subscribers
22+on the same stream, and (3) when the publisher has a new update ready,
23+they send it immediately to their subscribers instead of waiting for a
24+later request.
25+
26+## Basic properties
27+
28+### Exactly-once updates
29+
30+Some subscriptions need the subscriber to receive each update separately
31+instead of collapsing them into a single diff. Sometimes a subscription
32+is 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
34+applied in order.
35+
36+### Syncing data
37+
38+Other times, it's more natural to think of a subscription as
39+communicating a data structure, where the only goal is to keep the data
40+structure 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
42+updates into one large update, or even to resend the entire data
43+structure. Partial updates exist only as an optimization.
44+
45+For this sort of subscription, we commonly use terms like "diff" instead
46+of "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
48+data structure itself.
49+
50+## Memory pressure
51+
52+Naively implemented, subscriptions pose a memory leak risk if the
53+subscriber 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
56+sufficient to bound the amount of memory dedicated to any particular
57+subscriber.
58+
59+In 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,
61+though, can happen between ships.
62+
63+### Small data
64+
65+For particularly low-volume subscriptions, it may be acceptable to
66+ignore the problem. Jael uses this approach, since the only time it's
67+used 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,
69+this strategy will have to be revisited.
70+
71+### Buffers
72+
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
75+options for what to do when the buffer is full and the publisher wishes
76+to send another message:
77+
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.
82+
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.
87+
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.
93+
94+Gall subscriptions use the last of these. The buffer is bounded by a
95+simple heuristic, and when a subscription exceeds that buffer, it is
96+closed and the app is expected to resubscribe when they come back
97+online. Note that even though the subscription is closed, messages in
98+flight cannot be removed until they've been acknowledged since Ames
99+guarantees exactly-once messaging, so those last few messages will be
100+stuck in memory until the subscriber comes back online.
101+
102+Buffers 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
104+subscriber stops taking messages for at least X time, the buffer is
105+full. Gall taks a hybrid approach; currently the heuristic is that the
106+buffer counts as full if it has at least five messages and it has been
107+30 seconds since a message was acknowledged.
108+
109+### One at a time
110+
111+Another scheme is to avoid multi-message subscriptions. Instead of
112+allowing 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
114+update, they subscribe to the new next update, so that they ultimately
115+get every message.
116+
117+Commonly this is implemented where each update is given a version
118+number, and every time you hear update N you request update N+1 (even
119+though you won't get an answer for an indeterminate period of time).
120+
121+This is near the theoretical ideal for memory usage, since you'll never
122+queue up several messages to send to the subscriber.
123+
124+It also encourages processing each update in order rather than zooming
125+forward from time to time. It's possible (if a little awkward) to
126+simulate this with buffers though, and it's possible to allow zooming
127+forward in the one-at-a-time scheme by having the requests be "most
128+recent after update N" instead of "next after update N".
129+
130+This scheme is at its strongest, then, when you're already storing
131+intermediate states or updates, or when you don't care about
132+intermediate states and always send the most recent one. Otherwise,
133+buffers are a convenient place to temporarily store updates that you
134+don't want to store internally. Of course, if it's semantically
135+important that you give each update separately, buffers won't save you
136+from having to store the intermediate updates, since they may fill up.
137+
138+Another conceptual advantage is that it has no notion of "connectivity".
139+It operates forever in a single mode. By contrast, buffer-based
140+solutions must keep track of whether the buffer is full and react to
141+that. This increases complexity in the system, and complexity is the
142+great evil.
143+
144+The biggest disadvantage of this system is that it takes much longer to
145+process many small updates. With buffers, the publisher could have a
146+dozen small updates in flight at the same time, while in this scheme
147+they would only send one at a time, waiting for a response between each
148+one. Losing this pipelining can be quite significant for some
149+applications, but for low-volume subscriptions (certainly anything that
150+updates less than once per minute) this will have no noticeable effect.
151+
152+Clay uses this scheme. It's low-volume, it stores all previous states
153+anyway (since it's a revision-control system), and it's sometimes
154+important to get updates one at a time (for example when downloading OTA
155+software updates). Ships that send OTA updates often have many ships
156+subscribed to them, and the updates themselves may be large, so it's
157+important they don't queue up when ships inevitably disappear.
158+
159+I tend to think most Gall subscriptions should follow this pattern as
160+well. Our most latency-sensitive subscriptions are chat messages, and
161+while I haven't tested it, I would guess that even those wouldn't be
162+affected by this scheme.
content/docs/arvo/dill/_index.mdnew file+7
@@ -0,0 +1,7 @@
1++++
2+title = "Dill"
3+weight = 40
4+sort_by = "weight"
5+template = "sections/docs/chapters.html"
6+insert_anchor_links = "right"
7++++
content/docs/arvo/dill/dill-api.mdnew file+366
@@ -0,0 +1,366 @@
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.mdnew file+24
@@ -0,0 +1,24 @@
1++++
2+title = "Overview"
3+weight = 1
4+template = "doc.html"
5+aliases = ["/docs/learn/arvo/dill/"]
6++++
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`.
content/docs/arvo/eyre/_index.mdnew file+16
@@ -0,0 +1,16 @@
1++++
2+title = "Eyre"
3+weight = 50
4+sort_by = "weight"
5+template = "sections/docs/chapters.html"
6+insert_anchor_links = "right"
7++++
8+
9+## [Overview](/docs/arvo/eyre/eyre)
10+
11+A high-level overview of `eyre`, Urbit's HTTP server vane.
12+
13+## [Using Eyre](/docs/arvo/eyre/using-eyre)
14+
15+How to use Urbit's HTTP API.
16+
content/docs/arvo/eyre/eyre.mdnew file+721
@@ -0,0 +1,721 @@
1++++
2+title = "Overview"
3+weight = 1
4+template = "doc.html"
5+aliases = ["/docs/learn/arvo/eyre/"]
6++++
7+
8+*Current docs on Eyre are out of date. Until they are updated this doc remains for historical purposes*
9+
10+
11+Our HTTP server.
12+
13+Unix sends http messages to `%eyre`, and `%eyre` produces http messages
14+in response. In general, apps and vanes do not call `%eyre`; rather,
15+`%eyre` calls apps and vanes. `%eyre` uses `%ford` and `%gall` to
16+functionally publish pages and facilitate communication with apps.
17+
18+`%eyre` primarily parses web requests and handles them in a variety of
19+ways, depending on the control string. Nearly all of these are
20+essentially stateless, like functional publishing with `%ford`.
21+Additionally, there's a fairly significant component that handles
22+`%gall` messaging and subscriptions, which must be stateful.
23+
24+## Reference
25+
26+### State
27+
28+Stored
29+
30+- `++bolo`
31+- `++cyst`
32+- `++stem`
33+
34+Runtime
35+
36+- `perk`
37+ + `perk-auth`
38+- `pest`
39+- `even`
40+
41+### Cores
42+
43+- `++handle`
44+ + `++parse`
45+ - `++as...`
46+- `++ya`
47+- `++ix`
48+
49+## Commentary
50+
51+
52+Let us follow the loading of a simple cli app, as it bounces from
53+browser to server to browser and back.
54+
55+### Initial request
56+
57+An http request for `http://sampel-sipnym.urbit.org/cli` will be [redirected](dns)
58+to the `%eyre` on ~sampel-sipnym, and come in as a `%this` task.
59+
60+From arvo, requests enter `++call`, which after some type reification are passed
61+along to `++apex:ye`. In the case of a `%this` task, its components are
62+parsed(see `++zest:epur`, `++eat-headers`) and handed off to `++handle`, wrapped
63+in `++emule` to produce a `++fail` page in case of error. `++apex:handle` will
64+`++process` the request to a `pest` or a `++done` [core](/docs/glossary/core/), and in the former case
65+`++resolve` the pest into an outgoing card.
66+
67+XX it also seems to affect the current ship, test that serving ship name is consistently correct
68+
69+The pest is produced by `++process`, which will first further `++parse` the
70+request, and if this does not make the response immediately obvious,
71+`++process-parsed` the resulting `perk`.
72+
73+`++parse` produces the `perk`, by attempting to interpret the `pork`(url path)
74+[`++as-magic-filename`](#mage), `++as-beam`, and `++as-aux-request`. In this
75+case, `/cli` is parsed by the second case as a `%beam` query to `/=cli=`: a path
76+which starts with a valid ship name is expected to be a full clay(well, ford)
77+path, and one starting with a term implies the current serving ship and a case
78+of `0`, the current revision.
79+
80+XX spur: when the desks are merged, `/cli` shall point to `/=main=/pub/cli`
81+
82+The parsed `perk` generates a `%f %boil` note, `mark`ed as its extension(here
83+defaulting to `%urb`) and `wire`d with `~` to return unaltered to the client. It
84+goes on to `++resolve` by being passed to `++ford-get-beam`, which translates
85+the perk it into a `%boil` `++ford-req`, adding an `++fcgi` path-segment
86+containing query string and `++fcgi-cred:for-client` auth information.
87+
88+`%ford`s translation of `/=cli=/hymn/hook` to a self-refreshing `%urb` html page
89+[deserves its own commentary](/docs/arvo/ford#commentary), but
90+we resume in `%eyre` when the `%made` sign arrives in `++take`, and soon after
91+`++axon:ye`. There the `wire`, or rather the `whir` it has been verified to be,
92+determines that the response should be served immediately. However, as the mark
93+is not `%mime`, another trip to `%ford` is required to encode it, on the same
94+wire; afterwards, the value of the `%mime` cage is verified to be of the correct type, and finally
95+delivered back up the requesting duct as a successful `%thou` HTTP response.
96+
97+XX `%cast %mime` used to be in ford-get-beam, is there a reason it was removed?
98+
99+## Back into the breach, or: auxilary requests
100+
101+Now, it was mentioned that this result is self-refreshing: the `%urb`
102+translation [door](/docs/glossary/door/) injects a `;script@"/~/on/{deps}.js"` into every page, `deps`
103+is a ford-readable hash of the set of resources that page construction depended
104+on.
105+
106+This triggers another `%this` request. Its handling is identical to that of
107+`/cli` up until `++parse`, where it is seen not `++as-beam` but
108+`++as-aux-request`(auxillary requests starting with `/~/` or `/~~/`).
109+`/on/[hash]` is a long-`%poll`, which `++process-parsed`, for a `.js` mark,
110+answers with a direct `%js`. Its contents are the static `++poll:js`, which
111+initiates the long-polling loop, run against an injected `urb.js` of
112+`{poll:[hash]}`.
113+
114+A `%js` `pest` is `resolve`d as a `text/javascript` success `%this`.
115+
116+When `poll.js` is received by the client, it opens an `XMLHttpRequest` for
117+`/~/on/{window.urb.poll}.json`, bringing us back to `%poll:process`.
118+
119+In the case of a non-`%js` `/~/on/`, `%poll:process-parsed` turns into a
120+`++new-dependency`, which stores the listening duct, and `pass-note`s a `%wasp`
121+with the deps-hash back to `%ford` whence it came. While this occured, the page
122+has loaded.
123+
124+Some indeterminate amount of time afterwards, with dropped `/~/on/{...}.json`s
125+being retried upon expiring and also being stored, a `%news` sign arrives in
126+`++axon`, and the hash in question is retrieved from the wire, and the listening
127+long-polls retrieved by the hash. Each receives a 205 "Reload parent view" HTTP
128+response, which `poll.js` dutifully executes, and a fixed typo of markdown is
129+rendered.
130+
131+## Authentication
132+
133+Now, while this accurately reflects the presentation of e.g. a markdown file,
134+`/cli` is an application front-end, and one that permits only owner access. Its
135+second script is `@"/~~/~/at/main/lib/urb.js"`, semantically equivalent to
136+`/~/as/own/~/at/main/lib/urb.js`, and handled as follows.
137+
138+In `++as-aux-request`, `%as %own` becomes `%auth %get our` perk, which
139+`++process` passes to `++process-parsed` passes to `++process-auth`. There, a
140+`yac` "ya" core is built `++for-client`: a `++cookie-prefix`, which is just the
141+serving ship name, is used to get a `++session-from-cookies`, here nil as the
142+client has no cookie set. In lieu of a cookie, a `++new-ya` is constructed, with
143+a random token `hole` and a `++new-cyst` which fills out `cyst` session state
144+from request data.
145+
146+Returning to `++process-auth`, `%get` checks if the yac is authenticated with
147+the requested credentials(`anon` requests are always granted), which for the
148+fresh new `cyst` is not the case (more on success [later](#auth-ok)). Unless
149+authenticating as a [foreign ship](#xeno), the only thing left is to
150+`++show-login-page`, which detects that the requested resource is not `%html`,
151+and produces a `%red` pest. For `%js`, `%red`irections `++resolve` to
152+`++auth-redir:js`, a line of javascript which prepends `/~~` to the url path.
153+
154+The owner-authenticated main page request similarly ends in `++show-login-page`,
155+which for the empty session is an `[%htme ++login-page:xml]`, `resolve`d to
156+`++give-html` with a 401 "unathorized".
157+
158+The login page shows a simple prompt, and requests `/~/at/auth.js` to handle the
159+submission. And so we are, once again, attempting to divine if what we're doing
160+makes sense `++as-aux-request`.
161+
162+To understand `/~/at`, there will first be a brief diversion to `~/auth.json`.
163+`auth.json`, perk `[%auth %json]`, in `++process-auth` serves `++stat-json:ya`,
164+containing such information as the serving ship, which identities are associated
165+with this session, and `oryx`, a CSRF token. An oryx must be present on all
166+stateful requests, in this case executing a log in. It also saves the new/old
167+session using `abet`.
168+
169+XX explain `ixor` here and not [later](#ixor)?
170+
171+`/~/at` is an alternate interface, which injects `auth.json` data into the
172+requested file. `/~/at/auth.js`, then, is a request for the built-in `auth:js`
173+(parsed to and processed from an `[%auth %js ~]` perk), with session data added
174+as `window.urb`. And indeed, ``[`%js /~/at/auth]`` is parsed to
175+``[%auth at [`%js /auth]``, which in `++process-auth` is re-`process`ed to
176+`[%js ++auth:js]`, which is `++resolve`d after an `++add-json` of
177+the relevant data. The yac cookies are also passed to `resolve`, which
178+`++add-cookies` injects into the `httr`.
179+
180+It is at this point that there is first occasion for user input, namely the password.
181+
182+The `auth:js` script sends a `PUT` request, also to `/~/auth.json`. In `parse`,
183+the first nontrivial `++check-oryx` occurs, `++grab-body` the request oryx and
184+ensuring it is recorded for the session. The request parsed with `++need-body`
185+to a `[%auth %try {password}]` perk. `%get:process-auth` checks it against
186+`++load-secret`, upon success updates the session with `++logon:ya`, and
187+serves a fresh `auth.json` which reflects the changed `user`. Upon receiving
188+this, the page is refreshed to retry the original request.
189+
190+### Post-authentication: app communication.
191+
192+Upon refresh, `/~~/cli` brings us for the third time to `%get:process-auth`, but
193+this time the cookie is set, and the `yac` fetched contains the serving ship as
194+authenticated. The `++handle` sample is updated to reflect the requesting ship,
195+and the `process` continues for the rest of the pork, once again serving the
196+ford page.
197+
198+The `/~/on/[deps].json` poll starts anew, and `/~~/~/at/main/lib/urb.js` we now
199+know to serve the window.urb necessary to make requests, and the `urb.js`
200+standard library which extends it with a number of wrappers to them and other
201+useful functions.
202+
203+One of those functions is `urb.bind`, which is used to subscribe to application
204+data. Userspace javascript sets `urb.appl` to `/tic`, and binds `lines` to a
205+`;pre;` text display, using a callback.
206+
207+This triggers a `PUT` to `/~/is/{ixor}/cli/lines.json`, where `ixor` is a hash
208+of `oryx` that identifies the connection. `++as-aux-request`, an `%is` is a
209+`%subs` subscription update update, which for `%put` forwards to
210+`++add-subs:ix`, the ix core fetched `++for-view` by hashing the request
211+`++oryx-to-ixor`.
212+
213+A view has all the state associated with a client that must be
214+remembered between events. In this case, this is what app/path the request duct
215+is associated with; but mainly, `++add-subs:ix` will `pass-note` to `%gall` so
216+it `%show`s the data on the path, current and future.
217+
218+This will immediately(assuming the ship is local) result in a `%nice` by the
219+`/cli` app, returning `{ok:true}` `++nice-json` to `urb.bind`'s second callback
220+as `{ok:true}`. The initial `%rush` results also arrive, and in `++axon` are
221+converted to json using `++back`(ford `%cast` wrapper), and when `%made` get
222+passed to `++get-rush:ix`. There the source application/path are decoded by
223+duct, and then the full event goes to `++get-even`; `++add-even` inserts it to
224+the queue, and as there is no long poll it simply stays there.
225+
226+Upon receipt, the client realizes the long-poll isn't actually running, so that
227+is started using `urb.poll`. At `/~/of/{ixor}`, perk
228+`[%view ixor ~ {sequence-number}]`, it is `process`ed by `++poll:ix` (the cyst
229+is retrieved by `++ire-ix` form global state, using the perk `ixor`): the
230+sequence number is in the past, so the previously received `%rush` is
231+`++give-even`. After deleting the previous message in the queue and invoking
232+`++pass-took` to signal `%gall` of this occurrence, the data is annotated with
233+the source app+path `++subs-to-json`, and returned to the polling duct.
234+
235+On the client, the user callback receives the `/cli` history, and displays it on
236+the page. The `/~/of` long poll is continued, this time reaching `++poll:ix`
237+with the "pending" sequence number, and being stored in the `cyst` for its troubles.
238+
239+Its next update proceeds idenitcally, but first it must be triggered, which
240+happens when the user enters "(add 2 2)\n", firing an `urb.send` from the event
241+handler. This sends a `POST` request to `/~/to/cli/json.json`, perk `%mess`,
242+`++process`ed to a `%g %mess`. Were the mark not `%json`, a `%ford` conversion
243+would occur first, and `%made:axon` would send the gall message proper. In
244+either case, eventually a `%mean` or `%nice` arrives, is encoded as json, and
245+sent to the client callback.
246+
247+## A path not taken: magic filenames
248+
249+The `/robots.txt` and `/favicon.(ico|png)` files are static, and served
250+immediately when caught by a `++parse`.
251+
252+XX index.html?
253+
254+## A path not taken: foreign auth
255+
256+While this example details a login `/~/as/own`, it is possible to be
257+authenticated as any ship on the network. A request for such seen in
258+`%get:process-auth` is passed to `++foreign-auth:ya`, which sends an
259+`%ames /lon` message to the ship in question. The foreign ship stores the
260+inquiry, calculates(the local) `++our-host` and responds with a `/hat`,
261+containing the redirection host, which is stored by `++foreign-hat`; it is later
262+used to send the client to a `/~/am` url on the foreign client, which acts as a
263+normal login page but later sends the client back. XX expand, basically the
264+status quo is you're logged in and `/~/as/foo` is ignored, just setting your
265+`urb.user` XX
266+
267+
268+### A path not taken: deauthentication
269+
270+`/~/away`, perk `[%away ~]`, produces a static `++logout-page:xml`, which also
271+uses `/~/at/auth.js`, to send a `DELETE /~/auth.json`, perk `[%auth %del]`. This
272+executes `++logoff:ya` for the cookie session, resolving to `++abut` to wipe it
273+from memory.
274+
275+### A path not taken: unsubscription
276+
277+`DELETE /~/is/app/path/within` works much like `PUT /~/is/app/path/within`,
278+`++del-subs:ix` acting as reverse of `++add-subs` by deleting the duct binding
279+and sending `%g %nuke`.
280+
281+
282+XX unmentioned arms: abet, add-poll, adit, ames-gram, anon, ares-to-json, bolo, cyst, doze, even, ford-kill, get-mean, gift, give-json, give-thou, gram, hapt, hasp, host-to-ship, ix, ixor, js, kiss, load, mean-json, move, note, pass-note, perk, perk-auth, pest, poke-test, print-subs, render-tang, resp, root-beak, scry, ses-authed, ses-ya, sign, silk, sine, stay, stem, teba, titl, to-oryx, urb, wait-era, wake, whir, wush, xml, ya, ye
283+
284+### Appendix A: DNS
285+
286+The `*.urbit.org` domain can be used to access destroyers and cruisers. In the
287+common case oh hosted ships, this is done by dynamic DNS directly to the hosting
288+instance. We do not speak of the uncommon case. When ports are blocked and
289+infrastructure crumbles around you, only imported martian networking can be
290+trusted: the `%get` and `%got` grams are used to proxy `%this` requests and
291+`%thou` responses respectively.
292+
293+## Specification
294+
295+The `%eyre` vane serves one purpose: receiving inbound HTTP requests from browsers and clients pretending to be browsers. To facilitate this communication, `%eyre` does two things: 1. provide an API for traditional clients to talk to; and 2. provide a mechanism for saving state that allows the server to keep track of identities/sessions, subscription data, and active connections.
296+
297+This document outlines the following:
298+
299+1. [`perk`](#perk), a `pork` subset that defines what URLs the client can send to `%eyre`.
300+
301+2. [the values stored on the client](#client), both statically in cookies and dynamically as the `window.urb` object, which facilitate this transaction.
302+
303+3. [`task`](#task), the requests `%eyre` will accept.
304+
305+4. [`gift`](#gift), the responses it will give to those requests.
306+
307+5. [`note`](#note), the set of arvo requests that %eyre makes to the other vanes.
308+
309+6. [`whir`](#whir), a `wire` subset, the associated dynamic state
310+
311+7. [`sign`](#sign), the responses `%eyre` accepts
312+
313+8. [`bolo`](#bolo), the state stored between separate events.
314+
315+## 1. URL structure
316+
317+There exist several URL forms accepted by `%eyre`.
318+
319+### 1.1 Functional request
320+
321+The simplest of them is a static `%f` functional publish request:
322+
323+```
324+ GET /[ship]/[desk]/[case]/path/to/file.[mark]
325+```
326+e.g.
327+
328+```
329+ /~pittyp-pittyp/main/5/lib/urb.js
330+```
331+A `case` of 0 signifies the most recent version.
332+
333+If no file extension is provided, the default `mark` is `%urb`, which consists of `%html` injected with an auto-refresh script.
334+
335+A shorter form:
336+
337+```
338+ /path/to.[mark]
339+```
340+is prepended with the [default request path](#prefix). For example, if `%eyre`
341+is configured with a root of `/<our>/main/0/pub`, then `/doc/arvo` is
342+interpreted as a request for `/=main=/pub/doc/arvo.urb`.
343+
344+Auxiliary paths start with `/~/`, and provide other functionality, such as:
345+
346+### 1.2 Auto-reload
347+
348+When a new version of a page becomes available, it is useful to propagate it to the client. The `%f` vane manages the particulars, and provides an update token along with all published pages. The `/~/on` long-polling endpoint makes use of that token, which is a hash of the server-stored dependency set.
349+- `/~/on/[hash].json` retuns `true` when a page may require updating.
350+- `/~/on/[hash].js` is a lightweight script that polls for the above. It is primarily used in error messages.
351+
352+### 1.3 Authentication
353+
354+Authenticated requests are accomplished through sessions, tracked with cookies which are set on the first such request.
355+- `/~/as/[user]/...` is an authenticated request to `...`, where `user` can be a `@p` ship, `'own'`, `'any'`, or `'anon'`.
356+ + `'anon'` is a randomly-generated per-session submarine, and requires no further authentication.
357+ + `'own'` represents the serving ship. The short form of `/~/as/own/` is `/~~/`
358+ + `'any'` requires a network ship, chosen with a prompt if unknown. The short form of `/~/as/any/` is `/_/`
359+ + Auth requests are handled in three ways:
360+ + I. If the session is associated with the `ship`, serve `...`, storing the ship as the session's default ship. For example, `/~/as/sivtyv-barnel/main/pub/test.html` is an authenticated request of `/main/pub/test.html` with the identity of `~sivtyv-barnel`.
361+ + II. If the session is not associated with the `ship` in the path, the client is redirected to a login page, where a password can be entered. Successful authentication results in a page refresh to the requested path.
362+ + III. otherwise, [send a message](#foreign) to the claimed ship, and redirect the user to `https://[foreign-host]/~/am/[ses]/...#[current-host]&?code=[code]`
363+- `/~/am/[ses]/...#original-host` similarly serves a login page. Upon success, inform the `ship` of the success and redirect it back to `http://[original-host]/~/as/<this-ship>/...`
364+- `/~/away.html` is a log-out page.
365+- `/~/auth.json` returns `{ship,oryx,user,auth}`: the serving ship, a CSRF token, active user, and all allowed users respectively.
366+- `/~/at/{...}.js` is an alternate form of `/~/auth.json`, which injects a line into the served js file that sets `{ship, oryx, user, auth}` on the `window.urb` object.
367+
368+So far, all the paths specified have been GET requests. Authentication, however, requires sending data. This is also done at the `/~/auth.json` endpoint.
369+- `POST {oryx,ship,code} /~/auth.json?PUT` is used by the login script to authorize a user, and returns the same result as `GET`, additionally containing either`{ok:true}` or `{fail:'type',mess:"Error message"}`
370+- `POST {oryx,ship?} /~/auth.json?DELETE` revokes authorization. Response as above.
371+
372+### 1.4 Messaging
373+
374+- `POST {oryx, wire, xyro} /~/to/[app]/[mark].json`, where `xyro` is data that will be converted to the `mark`. In the simplest case, `/~/to/hello/json.json` will pass `xyro` through verbatim, sending `[%json xyro]` to the `++poke` arm of app `%hello`.
375+- `POST {oryx, wire, xyro} /~/to/<ship>/[app]/[mark].json` is a foreign message send, as above.
376+
377+### 1.5 Subscriptions
378+
379+- `/~/of/[ixor]` is an `EventSource`: a conceptually infinite file containing a stream of events. By default, it sends a newline every 30 seconds serving to signal that the connection is alive to both the server and IP middleware.
380+ + `/~/of/[ixor]?poll={n}` is a long-polling fallback interface. Produces event number `{n}`, blocking until it occurs. Its contexts can be affected by `POST` requests with a body of `{oryx, wire}`, and a query string of `PUT` or `DELETE`. They return either `{mark}`(which may be `null`), or [`{fail, mess}`](#mean-json)
381+- `/~/in/[hash].json` is a dual to [`/~/on`](#on-change). It binds `mod` events, which echo the requesting token.
382+- `/~/is/[app]/path/to.[mark]` binds `rush` events, formatted with a first line of `[app] /path/to`, and the rest containing subscription data. Additionally, `mean` events formatted similarly may arrive, also converted to the relevant mark.
383+
384+
385+
386+### 1.6 Ablative
387+
388+These interfaces will temporarily exist to aid development, and are to be considered unstable.
389+- `/~/debug/...` access normally inaccessible pages. For example, `/~/debug/as.html` will present the login page, regardless of current session status.
390+
391+
392+## 2. Client state
393+
394+Some information is stored on, and provided to, browser clients
395+
396+### 2.1 Cookies
397+
398+Authenticated users receive a cookie on the domain of `*.urbit.org`. The cookie contains a client session token, keyed by the serving ship.
399+
400+### 2.2 Authentication
401+
402+It is common(e.g. by the `%urb` mark) to set window.urb to the contents of `/~/auth.json`:
403+- `ship` is the serving ship
404+- `oryx` is a unique CSRF token that identifies this view, bound to the session cookie
405+- `ixor` is a hash of `oryx`, used as an insecure view identifier
406+- `user` is the authenticated/generated ship name
407+- `auth` is a list of identities usable by this session
408+
409+### 2.3 Client library
410+
411+To this object, `/main/lib/urb.js` adds helpers:
412+- `app` is an optional app name to send messages to by default
413+- `send({data,mark?='json',app?=urb.app,ship?}, cb?)` delivers messages
414+- `bind({path,app?=urb.app}, cb)` subscribes by path
415+- `drop({path,app?=urb.app}, cb?)` pulls the subscription
416+- `util` is an object containing methods for converting between JavaScript types and Hoon [atom](/docs/glossary/atom/) auras.
417+
418+## 3. Requests
419+
420+## `[%born port=@ud]`, unix init
421+
422+When the `vere` process is re/started, a TCP port is bound, HTTP requests on which are the scope of this document. The `%born` gift informs eyre of this occurrence, which in turn updates [its state.](#bolo)
423+
424+**Gifts given in response:** none.
425+
426+## `[%hiss p=mark q=cage]`, outbound http
427+
428+Userspace http request, converted by `%ford` into an actual `hiss`.
429+
430+**Gifts given in response:** a `%sigh`
431+
432+### 3.1 `[%this httq]`, inbound http
433+
434+The primary `%eyre` request type comes from the host system, and constitutes an inbound http request. It consists of five parts:
435+
436+I. `p=[? @if]`: a loobean determining whether the request is being made over https, and the client source, an IPv6 address possibly encoding an IPv4 one as `.0.0.0.0.0.ffff.wwxx.yyzz`
437+
438+II. `q=meth`, an http method
439+
440+III. `r=@t`, the unparsed URL
441+
442+IV. `s=mess`, an associative list of header keys/values
443+
444+V. `t=(unit octs)`, the request body, if any.
445+
446+After `r` is parsed to a `purl`, the `pork`(relative path) determines the resource being served. The first step in handling an http request is [classifying its intent](#perk).
447+
448+- A ford request results in a [`%boil` note](#boil).
449+- `/~/[name].js` is generated from [session](#sink) or [view](#stem) state, and [served](#mime) as `%js`.
450+- `/~/am` generates a login page.
451+- `/~/as` is resolved further if authenticated, generates a similar login page if the claimed ship is local, and otherwise is saved to [session state](#sink) and sends a ["login" `%a` message](#lon) to the foreign ship.
452+- `/~/at` and `/~/auth.json` generate a new `oryx` and store it in the [session state](#sink).
453+- `/~/in` and `/~/is` affect [view state](#stem), possibly sending subscriptions or unsubscriptions to `%f` and `%g` respectively, and are generated from view state.
454+- `/~/on` is saved to the `bolo` by `hash`, and translated to a [`%wasp` note](#wasp).
455+- `/~/of` fails if the `ixor` is unknown, and otherwise is stored in the `ixor`, receiving a partial response and all events after its [last-seen header](#). If it has a `poll` parameter, the response is full, and only occurs if the body is non-empty. Otherwise the oryx is saved as a [live](#live) request in case of cancellation.
456+- `/~/to` transforms into a [`%g` message](#mess).
457+
458+**Gifts given in response:** a `%thou`, or a [`%that`](#that) followed by multiple `%thar`s.
459+
460+### 3.2 `[%thud ~]`, inbound close
461+
462+Sent when an unresponded-to request is cancelled. The [live](#live) effect of the request is looked up, and
463+- `%exec` ford boil requests are cancelled with `[%exec ~]`
464+- `%wasp` ford deps requests are cancelled with `[%wasp |]`
465+- `%poll` session polls `%rest` the session heartbeat timeout
466+
467+### 3.3 `[%thin p=@ud]`, delivery failure
468+
469+Sent when a partial [response](#that) or [body](#thar) fails to arrive. Its `duct` is the same as that of the original request. This is handled by [waiting](#wait) for the client to reconnect, and if this not occur, unwinding all subscription state.
470+
471+
472+**Gifts given in response:** None.
473+
474+### 3.4 ``[%wart sock [path *]]``, inbound message
475+
476+Sometimes, messages are received from other ships. They are expected to take the from of a `gram`.
477+
478+**Gifts given in response:** [`%nice` or `%mean`](#ack).
479+
480+#### 3.4.1 `gram`
481+
482+There are three messages of note, all concerning authentication
483+- `[/lon ses]` is a login request, which contains the session wishing to authenticate.
484+- if the session is already authorized, a reply of `[/aut ses]` from (%eyre on) a foreign ship prescribes that the session is henceforth allowed to act on its behalf. All waiting `/~/as` are resolved as successful.
485+- otherwise, `[/hat ses hart]` contains the ship's preferred hostname. This can then be used to redirect the client. All waiting `/~/as` are given `307 Redirect`s to `/~/am` on the provided host.
486+
487+**Gifts given in response:** nice?
488+
489+## 4. Responses
490+
491+### 4.1 `[%nice ~]`, `[%mean ares]`, network acknowledgement
492+
493+A `%nice` is given upon receiving an [ames message](#gram), indicating succesful receipt. `%mean` is currently unused directly, but reserved for error conditions.
494+
495+## `[%sigh p=cage]`, inbound http response
496+
497+An HTTP response gets converted to the requested mark, or `%tang` in case of error.
498+
499+### 4.2 `[%thou httr]`, full HTTP response
500+
501+Most requests are served with one coherent response, consisting of
502+- `p=@ud`, an HTTP status code
503+- `q=mess`, response headers
504+- `r=(unit octs)`, an optional body
505+
506+### 4.3 `[%that httr]`, partial HTTP response
507+
508+[EventStream responses](#of-ixor) consist of multiple sequential chunks. Treated as `%thou`, except the request is kept open.
509+
510+### 4.4 `[%thar (unit octs)]`, partial HTTP body
511+
512+Complementing `%that`, `%thar` is a body chunk, containing an event. An empty `%thar` signals for the connection to be closed.
513+
514+Body chunks, besides `[1 '\0a']`(a heartbeat newline), are encoded from `even` events. The stem becomes the [`event` field](#eventsource), and the content, `data` lines.
515+
516+#### 4.4.1 `even`, event types
517+
518+There are three events that a [client subscription](#subs) will be given.
519+
520+- `[%news hash]` is a `%f` update, and contains the relevant dependency token.
521+- `[%mean [term path] ares]` is a sourced subscription error.
522+
523+## 5. Vane requests
524+
525+### 5.1 ``[%a %wont sock `[path *]`gram]``, outbound message
526+
527+The `%a` interface provides conveyance of [messages](#gram) over UDP.
528+
529+Signs a `%woot` upon message arrival.
530+
531+
532+All open [subscriptions](#of-ixor) require a "heartbeat" newline every `~s30`. When this fails to arrive, a complementary timer is set for `~m1`, after which the client is considered to have departed.
533+The `%b` timer interface is used to schedule the next such event, or cancel past scheduled ones when a connection closes.
534+
535+Signs a `%wake` upon timer activation.
536+
537+### 5.3 `[%f %wasp @uvI]`, dependency listen
538+
539+Knowledge of filesystem changes, requested by `/~/on` and `/~/in`, is requested the `%wasp` note. It contains the hash token which identifies a set of dependencies to query. Saved as a (live[live](#live)] request in case of cancellation when caused by `/~/on`.
540+
541+Signs a `%writ` upon change.
542+
543+### 5.4 `[%f %exec (unit silk)]`, functional transformations
544+
545+The `%f` interface converts [nouns](/docs/glossary/noun/) from one form to another. An empty unit represents cancellation.
546+
547+Signs a `%made` containing the computation result.
548+
549+The `silk`s used are as follows:
550+
551+### `[%cast %mime %boil mark beam [%web span ~]]`, file load
552+
553+The simplest functional request is the construction of a page. Saved as a [live](#live) request in case of cancellation.
554+- The `mark` is the request extension, defaulting to `%html`.
555+- A `beam`(path in `%clay`) is decoded from the request path.
556+- A `/web/<nyp ced quy>` virtual path is appended, span-encoding method, auth, and query string.
557+
558+### `[%cast mark %done ~ cage]`, convert
559+
560+This is used when communicating with apps, in both directions.
561+- Client messages are encoded as JSON objects, but can contain many different marks. Ones sent to non-`json.json` endpoints are `%cast` to he relevant mark, with a `cage` of `[%json p:!>(*json) jon]`, prior to being sent onwards to applications with `[%g %mess]`.
562+- Subscription responses also come in arbitrary marks, but are required to be sent as whichever mark an endpoint is subscribed to. They get `%cast` prior to being sent back as a `%that` EventSource segment.
563+
564+### 5.5 `%g`, app actions
565+
566+The end goal of many a userspace `hymn.hook` is to provide UI for a `%gall` app. To accommodate this, various functionality needs to be interfaced with.
567+
568+### `[%mess hapt ship cage]`, app message
569+
570+After a `/~/to` POST has been received, and possibly converted to the correct mark, it is sent to `%g` for processing. The `hapt` is the destination, the `ship` is the source, the `cage` is the marked message data.
571+
572+Signs a `%nice` or `%mean`, in userspace or upon crashing.
573+
574+### `[%show hapt ship path]`, app subscription
575+
576+An `/~/is` PUT, if not already registered, results in a new subscription. A request for such contains the destination `hapt`, requesting `ship`, and app-internal `path`.
577+
578+Signs a `%nice` on init, `%rush` on data, and a `%mean` in subscription termination.
579+
580+### `[%took hapt ship]`, %rush confirmation
581+
582+A `%took` must be sent to acknowledge the receipt of subscription data, which in this case occurs automatically.
583+
584+Causes no signs.
585+
586+### `[%nuke hapt $|(ship [ship path])]`, subscription cancel
587+
588+An `/~/is` DELETE is used to remove a subscription, and is converted straightforwardly to a `%nuke`. Additionally, when a client disconnects, all of its subscriptions are `%nuke`d to reflect their expiration.
589+
590+Signs an empty `%mean` for each open subscription that is closed.
591+
592+## 6. In-flight metadata
593+
594+Various state can be associated with requests, but not necessarily be returned in responses to them.
595+
596+### 6.1 `~`, dropthrough
597+
598+If the response should be sent statelessly further up the duct, the `wire` is empty. This is used in `%f` pure functional page generation.
599+
600+### 6.2 `[?(%y %n) ...]`, stability
601+
602+The first element of a [`%b` timer](#wait) path distinguishes between live(%y) and dying(%n) channels.
603+
604+### 6.3 `/of/[ixor]`, view
605+
606+Designates which stream to act upon. Present on `%b` timer cards.
607+
608+### 6.4 `/on/<deps>`
609+
610+Present on `%f` dependency news. Looked up in [the state](#bolo) to see if any response is necessary.
611+
612+### 6.5 `/to/<hasp>/<ship>`, app
613+
614+Present on `%f` translations of message marks
615+
616+### 6.6 `/is/[ixor]/{hasp path}`, subscription
617+
618+Subscription requests. Present on `%g` subscription requests, and `%f` translations of [`%rush` subscription data](#show).
619+
620+## 7. Vane responses
621+
622+The goal of requests is to cause some manner of result. Specifically,
623+
624+### 7.1 `[%a %woot ship coop]`, acknowledgement
625+
626+A [message](#mess) which has been acknowledged remotely.
627+
628+### 7.2 `[%b %wake ~]`, timer
629+
630+Timer activate. If this is a `%y` [timer](#wire-live), send a newline to each `/~/of/[oryx]`; if `%n` and the `oryx` still has no listeners, wipe its state/subscriptions.
631+
632+### 7.3 `[%f %news ~]`, dependency update
633+
634+This message signifies a `hash` has changed, and listeners to it should be updated. Results in [`%news` events](#even-news) to concerned streams, and [full responses](#thou) to relevant long-polls.
635+
636+### 7.4 `[%f %made (each bead (list tank))]`, compute result
637+
638+Further action depends on the [`wire`](#whir). It can:
639+- Be empty, designating direct request data, which is [served](#mime) back up the `duct`.
640+- Contain [app and requester identities](#wire-to), which designates an app message has been converted to the correct `mark`, and can now be [sent to the app](#mess) with an empty `wire`.
641+- Contain an `oryx`, app, and `path`, designating subscription data. If the subscription is active in the relevant `stem`, it is acknowledged with a `%took` and given as a [`%rush` event](#even-rush) to all listeners. Otherwise, the subscription is `%nuke`d.
642+
643+### 7.5 `%g`, applications
644+
645+The `%g` interface sends several responses.
646+
647+### `[%nice ~]` and `[%mean ares]`, acknowledgment
648+
649+These are given as a response to `%mess`, with an empty wire, and `%show`s, with a [subscription wire](#wire-is).
650+The former is [served](#mime) back to the requester(i.e. the remaining duct), and the latter returned to the client.
651+
652+#### 7.5 `[%rush cage]`, subscription data
653+
654+A `%rush` arrives on a [subscription wire](#wire-is), and is then sent [for conversion](#done) to the correct mark. An unexpected `%rush` is `%nuke`d.
655+
656+## 8. Server state
657+
658+There is a quantity of data that persists between events.
659+
660+### 8.1 Global
661+
662+- `path` the default path which is prepended to relative plain requests. Initialized to `/<our>`, the serving ship; this interprets the first element of requests as a desk, and injects a `case` of `0`.
663+- `(jar ship hart)` remembered hostnames in order of preference, made accessible through `.^`
664+ + The default values(for self) are `http://<ship>.urbit.org:80` if not on a fake network, followed by `https://0.0.0.0:[port]`.
665+- `(jug deps (each duct oryx))`, `/~/on` and `/~/in` endpoints listening to `%c` updates.
666+- `(map duct live)`, inbound request state
667+- `(map ixor oryx)`, open `/~/of` streams.
668+- `(map oryx stem)`, open view state.
669+- `(map hole sink)`, session state.
670+- `(map hole ,[ship ?])`, foreign session names, along with their origin ships and whether they are authorized to act on our behalf.
671+
672+### 8.2 `live`, per-request state
673+
674+To honor request cancellations, each unserved request must track which effect it is causing.
675++ `[%exec whir]` if it is a ford data request
676++ `[%wasp (list @uvH)]` if it is a ford dependency poll
677++ `[%xeno ship]` if this is a proxied request
678++ `[%poll ixor]` if this is a session long-poll
679+
680+### 8.3 `sink`, per-session state
681+
682+Each `hole` has associated authentication state.
683+- `priv`, a random secret that verifies the session, stored in cookie.
684+- `[ship (set ship)]`, the `ship` a session is acting as and any others it has been authorized with.
685+- `(jug ship ,[path duct])`, authentication `/~/as` requests waiting on foreign ships.
686+- `(set oryx)`, views associated with this session. Dual of `hole` in `stem`.
687+
688+### 8.4 `stem`, per-view state
689+
690+Each `oryx` has active subscription state.
691+- `hole`, session in which this view resides. Dual of `(set oryx)` in `sink`.
692+- `ixor`, a cached hash of the `oryx` that is used as a subscription id, by the `/~/of` EventStream.
693+- `[,@u (map ,@u even)]`, queued [events](#even). Has a maximum size.
694+- `(unit ,[duct @u ?])`, http connection, its last received event, and whether it is a long-poll request.
695+- `(set deps)`, subscribed `/~/in` points. Mirrored in `bolo`.
696+- `(map ,[hasp path] mark)`, subscribed `/~/is` points
697+- `(que duct)`, where any `%nice`/`%mean
698+
699+## Appendix A: Glossary
700+
701+- An `oryx` is a CSRF token used for [authenticated requests](#auth)
702+- `mean.json` is a rendering of hoon `ares`: an error message formatted as `{fail:'type',mess:"Error message"}`
703+- `urb.js` is the standard client-side implementation of the `%eyre` protocols, normally found in `/=main=/lib`
704+- The act of "serving", refers to the wrapping of a `%mime` cage in an HTTP `200 Success` response, and errors or other marks being [sent to ford](#done) for conversion. Inside a `sign`, this conversion occurs along the same [`wire`](#wire); otherwise, the `wire` is [empty](#wire-drop).
705+
706+## Appendix B: EventSource
707+
708+UNIMPLEMENTED
709+
710+For more information, see <http://dev.w3.org/html5/eventsource/>
711+
712+An EventSource is a stream of events, encoded in a conceptually infinite `GET` request. Each event is formatted as
713+```
714+ http
715+ id: {number}
716+ event: {type}
717+ data: {contents}
718+ data: {more-contents}
719+```
720+
721+Data lines are joined by ASCII `10` newline characters; multiple newlines signify separate events. The `id` is used in a `Last-Event-ID` HTTP request header upon reconnection.
content/docs/arvo/eyre/using-eyre.mdnew file+230
@@ -0,0 +1,230 @@
1++++
2+title = "Using Eyre"
3+description = "How to work with eyre from outside Urbit."
4+weight = 20
5+template = "doc.html"
6++++
7+
8+This guide is aimed at developers who have a working knowledge of HTTP grammar (`PUT`, `GET`), and should not require any special knowledge of Urbit's internals. To learn more about a specific application within Urbit, please search for that with the docs once you have finished this guide.
9+
10+## Prerequisites
11+
12+You'll need a working development ship to follow along with this guide. It's
13+recommended that you set up a new "fakezod" on port 8080: Run this code,
14+substituting the appropriate path to your Urbit binary:
15+
16+```bash
17+/path/to/urbit -p 8080 -F zod
18+```
19+
20+For the unfamiliar, this will create a folder named "zod" in your working directory, from which the ship will run. Use `/path/to/urbit -p 8080 zod` in the future. For more information on this process, see our guide on [Environment Setup](/docs/development/environment).
21+
22+## Authentication
23+
24+We'll authenticate with a code that can be retrieved from the dojo. You can run
25+`+code` in the dojo to obtain it, but a fakezod's code is always
26+`lidlut-tabwed-pillex-ridrup`.
27+
28+Run this code in your bash terminal (requires cURL):
29+
30+```bash
31+curl -i localhost:8080/~/login -X POST -d "password=lidlut-tabwed-pillex-ridrup"
32+```
33+Let's explain what this does:
34+
35+ - `-i` displays the headers, so that you can see the cookie that gets sent
36+ - `localhost:8080/~/login` is the URL to which you are POSTing. You will note this is also the URL you visit when you log into Landscape.
37+ - `-X POST` specifies that you are POSTing data, not GETting.
38+ - `-d "password=lidlut-tabwed-pillex-ridrup"` specifies the code for your Urbit that we retrieved above. It is sent as form data, as if it were sent from an HTML form input field (which it is in Landscape)
39+
40+You should see the following:
41+
42+```bash
43+HTTP/1.1 200 ok
44+Date: Sun, 01 Jan 2020 00:00:00 GMT
45+Connection: keep-alive
46+Server: urbit/vere-0.10.8
47+set-cookie: urbauth-~zod=0v3.fvaqc.nnjda.vude1.vb5l6.kmjmg; Path=/; Max-Age=604800
48+transfer-encoding: chunked
49+```
50+
51+The `Date` and `set-cookie` will be slightly different of course.
52+
53+Take a look at the `set-cookie` line. This is now your session authentication, and will need to be sent with any future requests. It consists of three parts:
54+
55+ - `urbauth` is a prefix that Eyre uses to check for presence of authentication
56+ - `~zod` is the name of the ship you are logging in as
57+ - `0v3.fvaqc.nnjda.vude1.vb5l6.kmjmg` is the actual authentication token.
58+
59+At present there is no way to separate these parts — you must pass a cookie *as* a cookie. This string must be in the `Cookie` header. The `set-cookie` header is only used for this request upon response. It is what browsers expect when receiving a cookie.
60+
61+## Interacting with Eyre
62+
63+Once authenticated, you will perform all your operations on a channel. You may open as many channels as needed using the same authentication token, but this will increase complexity and memory usage on your Urbit ship.
64+
65+Interacting with Urbit comprises two parts:
66+
67+1. Sending information via PUT requests, which receive HTTP status code `204` (no content) upon success. We will not receive updated information (as in a POST request).
68+2. Receiving data on channels, which must first be subscribed to via an initial request. These come in the form of SSEs ([Server-Sent Events](https://www.w3.org/TR/eventsource/))
69+
70+These can be used independently, i.e. you may choose to only send information or only receive information from your Urbit, based on your application. Both can take place on the same channel.
71+
72+### Creating a Channel
73+
74+For this example, we will use the following channel:
75+
76+```
77+http://localhost:8080/~/channel/1601844290-ae45b
78+```
79+
80+Let's examine the parts. A channel is simply a URL in this pattern: `{url}/~/channel/{uid}` where `{uid}` is a string of your choosing. Most libraries default to the current unix time plus six hexadecimal characters. Your program should determine a channel for its current session and store that in its state.
81+
82+The channel does not yet exist in Urbit, however. To subscribe to events on this URL, you must first make a request (PUT) to Urbit on this URL. The simplest way to do this is to `hi` ourselves, as if we had entered `|hi our` in the dojo. A `hi` is analogous to a ping, and does not manipulate state. Let's learn how to make requests using this as an example.
83+
84+### Making Requests
85+
86+All requests will take the form of sending a message. Messages can take different forms, such as `subscribe`s, `ack`s, and `poke`s. These are called actions and there are more than these, but these will cover most basic use cases. You can think of them as a somewhat more sophisticated HTTP grammar. A message always requires an `id` and an `action`. Other fields depend on the specific action.
87+
88+Let's look at the structure of a message by examining the most basic `hi` we will send.
89+
90+```js
91+{
92+ 'id': 1, // Required. A sequential ID. Keep track of which messages you have sent.
93+ 'action': 'poke', // Required. The action to take. poke is the most basic way of sending data, like HTTP POST
94+ 'ship': 'zod', // Required by poke. The ship on which to perform the poke. You can only poke foreign ships with JSON, but this is the authenticated ship.
95+ 'app': 'hood', // Required by poke. The Urbit app to which to send the data.
96+ 'mark': 'helm-hi', // Required by poke. The "mark," or type, of data being sent.
97+ 'json': 'Opening airlock' // Required by poke. The actual data being sent.
98+}
99+```
100+
101+Let's open our channel by sending the following request using cURL (**remember to change the cookie**):
102+
103+```bash
104+curl --header "Content-Type: application/json" \
105+ --cookie "urbauth-~zod=0v3.fvaqc.nnjda.vude1.vb5l6.kmjmg" \
106+ --request PUT \
107+ --data '[{"id":1,"action":"poke","ship":"zod","app":"hood","mark":"helm-hi","json":"Opening airlock"}]' \
108+ http://localhost:8080/~/channel/1601844290-ae45b
109+```
110+
111+If you switch to your fakezod's dojo, you should see `< ~zod: Opening airlock`.
112+
113+Note that in the JSON that we sent via `--data`, the payload is wrapped in `[]`. This is because we can send multiple messages in a single payload, and Eyre expects a list of items, even if we are only sending one.
114+
115+You will always receive a `204` status code if the `PUT` request successfully reached Urbit, authentication succeeded, and the payload was valid. This is merely an HTTP status code, however. If the request failed within Urbit itself, however, you will receive a "nack" event that you will have to process separately.
116+
117+Let's look at how to receive events from Urbit.
118+
119+### Subscribing to Events
120+
121+Now that Urbit has opened an Eyre channel at our URL, we can watch for events on that URL by sending a `subscribe` message. Let's look at the anatomy of a `susbcribe`:
122+
123+```js
124+{
125+ 'id': 2, // Required. This is the next message we are sending, so we give it the next ID.
126+ 'action': 'subscribe', // Required.
127+ 'ship': 'zod', // Required by subscribe.
128+ 'app': 'chat-view', // Required by subscribe. In this case, we want to watch events that occur in the chat-view app, which is responsible for handling incoming chats.
129+ 'path': '/primary' // Required by subscribe. All apps have different path structures. In the case of chat-view, this is where we see all incoming chats.
130+}
131+```
132+
133+This is all we need to send Urbit to say "On this URL through which I am sending information, send me SSEs whenever something occurs on this app at this path."
134+
135+You should be able to send this information if you were able to send the above cURL example. However, we now need to be able to listen to the SSEs. The `EventSource` object is available for JavaScript in the browser context, as this is why SSEs were invented, but there should be a library for it in your chosen language. Take a look at a Browser JavaScript example:
136+
137+```js
138+const eventSource = new EventSource('http://localhost:8080/~/channel/1601844290-ae45b', {
139+ withCredentials: true // Required, sends your cookie
140+});
141+
142+eventSource.addEventListener('message', function (event) {
143+ ack(Number(event.lastEventId)); // See section below
144+ const payload = JSON.parse(event.data); // Data is sent in JSON format
145+ payload.id === event.lastEventId; // The SSE spec includes event IDs. This information is duplicated in the payload.
146+ const data = payload.json; // Beyond this, the actual data will vary between apps
147+});
148+
149+eventSource.addEventListener('error', function (event) {
150+ handleError(event);
151+});
152+
153+```
154+
155+### Handling Received Events
156+
157+Once you have received an event, it is expected that you will "ack" or "acknowledge" that you have received them. To do so, simply send a message in the following format:
158+
159+```js
160+{
161+ 'id': 3, // Required. Picking up where we left off
162+ 'action': 'ack', // Required.
163+ 'event-id': 15, // Required by ack. Whichever SSE of which you are acknowledging receipt
164+}
165+```
166+
167+### Unsubscribing from Events
168+
169+You may want to stop receiving events from a particular app path, but you don't want to close the channel altogether yet. Let's look at how to do that. Take a look at the example for subscribing. We sent that message with `id: 2`. We will use that ID to cancel the relevant subscription:
170+
171+```javascript
172+{
173+ 'id': 4, // Required. We always increment the ID as we send messages.
174+ 'action': 'unsubscribe', // Required.
175+ 'subscription': 2 // Required by unsubscribe. This corresponds to the id of a subscribe message sent earlier.
176+}
177+```
178+
179+### Deleting a Channel
180+
181+You should clean up your channel when able. To do so, simply send a `delete` message and Eyre will handle the rest so your program can safely exit.
182+
183+```javascript
184+{
185+ 'id': 5, // Required.
186+ 'action': 'delete' // Required.
187+}
188+```
189+
190+## Other Operations
191+
192+There are other operations which require authentication but do not require the use of a channel. Some operations are app-specific and will not be enumerated here, but there are two operations that exist across Urbit: `scry` and `spider`.
193+
194+### Scrying
195+
196+Scrying lets you see what an app has exposed at a particular path. It does not manipulate state.
197+
198+It takes the form `{url}/~/scry/{app}{path}.{mark}`
199+
200+ Let's get the base hash of our fakezod in the same way that Landscape does it.
201+
202+```bash
203+curl --header "Content-Type: application/json" \
204+ --cookie "urbauth-~zod=0v3.fvaqc.nnjda.vude1.vb5l6.kmjmg" \
205+ --request GET \
206+ http://localhost:8080/~/scry/file-server/clay/base/hash.json
207+```
208+
209+Note the use of a `GET` request.
210+
211+In this example we're scrying the `file-server` app at the path `/clay/base/hash` and using the `json` mark, which is most common. We receive `"0"` which is correct because we are at the top level of the hierarchy using a fake ship.
212+
213+Scry will fail with a 500 or return a 404 if no data is found.
214+
215+### Running Threads with Spider
216+
217+Running threads is an exception to the rule that we outlined in the section on channels. It uses a `POST` request and both manipulates state and receives information back. It also exposes the ability to send a sequence of commands, i.e. a "thread," hence the name.
218+
219+It takes the form `{url}/spider/{inputMark}/{threadname}/{outputmark}.json`
220+
221+This should be considered an advanced technique, but the basic structure of a request can be seen here:
222+
223+```bash
224+curl --header "Content-Type: application/json" \
225+ --cookie "urbauth-~zod=0v3.fvaqc.nnjda.vude1.vb5l6.kmjmg" \
226+ --request POST \
227+ --data '[{"foo": "bar"}]' \
228+ http://localhost:8080/spider/graph-view-action/graph-create/json.json
229+
230+```
content/docs/arvo/ford/_index.mdnew file+7
@@ -0,0 +1,7 @@
1++++
2+title = "Ford"
3+weight = 60
4+sort_by = "weight"
5+template = "sections/docs/chapters.html"
6+insert_anchor_links = "right"
7++++
content/docs/arvo/ford/ford.mdnew file+223
@@ -0,0 +1,223 @@
1++++
2+title = "Overview"
3+weight = 1
4+template = "doc.html"
5+aliases = ["/docs/learn/arvo/ford/"]
6++++
7+
8+*The Ford vane was refactored so drastically in 2020 that it was completely
9+ removed as a standalone vane, with its functionality merged into
10+ [clay](/docs/arvo/clay/clay). The following is a reproduced [blog
11+ post](https://urbit.org/blog/ford-fusion/) that documents this transformation,
12+ which we called "Ford Fusion".*
13+
14+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.
15+
16+Since deployment of Ford Fusion to the livenet in late June, over-the-air updates (OTAs) have been much smoother. Before Ford Fusion, it was common for an OTA to take several hours, use too much memory, and leave ships in inconsistent states. After Ford Fusion, multiple OTAs have been pushed out, including kernelspace changes, and most users didn't even notice.
17+
18+Urbit has always been able to update itself OTA, but this process has often been rocky. Updating an operating system kernel on-the-fly is a difficult problem in general, like performing heart replacement surgery on yourself while running a marathon. Code that allows Linux to update its kernel in this way became a startup called Ksplice, won multiple awards, and sold to Oracle. Even that, as impressive as it is, and as brilliant as its [programmers](https://nelhage.com) are, can only perform certain limited kinds of patches to the kernel.
19+
20+Urbit isn't exactly a traditional operating system, so the comparison is somewhat unfair, but the purpose of better architecture is to create unfair comparisons. In this case, because the Nock layer is frozen, upgrading everything above that layer is easier. Upgrades are also facilitated by pure-functional semantics, transactional event processing, a type system oriented toward concrete data, and orthogonal persistence. These features make it feasible for Urbit to upgrade
21+itself in the general case, not just some special cases.
22+
23+Ford 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:
24+- Atomic: the update should complete or fail in one transaction. If it
25+ fails, the system shouldn't get stuck.
26+- Self-contained: there must be no implicit dependencies or hysteresis
27+ (dependence on previous system states) when building the new software
28+ from source.
29+- Ordered: updates must be monotonically sequenced from the system's
30+ lowest layer to highest.
31+
32+Let’s walk through them one by one.
33+
34+### Atomic
35+
36+In previous versions of Urbit, updates failed atomicity by deferring parts of the update to later events, which are separate transactions that can fail independently. Generally, each deferral causes an exponential increase in the number of failure states that needed to be handled.
37+
38+We'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.
39+
40+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.
41+
42+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.
43+
44+This 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.
45+
46+[Steve Yegge's "platform
47+rant"](https://gist.github.com/chitchcock/1281611) describes a Bezosian
48+edict prohibiting synchronous communication among modules through direct
49+linking. This can be seen as an acknowledgment of the difficulty Amazon
50+was going to have when it needed to turn internal services external. If
51+your software needs to run in hell, build it that way from the start.
52+
53+An Urbit ship is not an enterprise SaaS product and does not need to run in this hell; it exists for just one person, with natural pressure pushing it in the opposite direction from Amazon’s web services. Instead of needing a ship’s state and functionality sharded into microservices strewn across multiple clusters, an Urbit instance is easiest to manage as a single server with all its state unified into one data structure and its event log stored as one totally ordered sequence of state updates -- the antithesis of a distributed system.
54+
55+### Self-Contained
56+
57+Before Ford Fusion, each commit to the Clay filesystem validated its files using filetypes (called “marks”) defined by files in the previous commit. This could cause bugs if the filetype definitions had changed in a backward-incompatible manner. It also meant a commit could not add both a new filetype and new files of that type; instead, you needed two commits: one to define the filetypes, and a second to add files of that new type. More theoretically, it caused history-dependence. The validated contents of files in a commit could vary based on the history of commits that led to this one.
58+
59+Another way source code failed to be self-contained was that it had access to symmetry-breaking information at build-time, namely ship, desk (Urbit's answer to a git branch), and (faked) date. A build recipe should be able to shared, cached, and rerun without dependence on local conditions, so user code now no longer learns its ship, desk, or date until runtime.
60+
61+Source code also had build-time access to Urbit's immutable global namespace, called the “scry namespace”, which the kernel makes available as an implicit argument to userspace Hoon code. The scry namespace is immutable and referentially transparent, i.e. a request must always yield the same result for all time, but if an agent asks the kernel for a resource that’s from the future, hosted on another ship, or to which that agent doesn’t have permission, the kernel will deny the request.
62+
63+If the kernel denies a scry request that user code made during the build process, the build system has no choice but to treat it as a nondeterministic error. Nondeterministic errors can never be fully eradicated, if for no other reason than that the user always has the option to defenestrate the machine—there's nothing deterministic about that. But we try to minimize them, and especially to minimize uncertainty as to under what conditions they might occur.
64+
65+No build should be killed by the absence of files outside the desk, so as of this update, user code can no longer scry at build time. Once built, userspace programs can scry if run in a context with a scry handler; a Gall agent's runtime scry requests still work just fine.
66+
67+### Ordered
68+
69+The final kind of failure fixed by Ford Fusion was the lack of ordered layering during a software update. The most common form of this failure was that old Ford had a tendency to try to build userspace code using the previous version's standard library. This didn't work too well, unsurprisingly.
70+
71+Emerging from this underworld required making a number of changes to the Arvo kernel, Clay, Gall, and the procedure for kernel updates. To avoid turning into a pillar of salt, I'll skip the details of how the old system worked and instead describe the new update procedure.
72+
73+## How Updates Work Now
74+
75+These are the layers of the stack that update themselves on the fly, from lowest to highest:
76+
77++ hoon: the hoon language definition and compiler, defined in `/sys/hoon/hoon`
78++ arvo: the arvo kernel proper and related type definitions, in `/sys/arvo/hoon`
79++ zuse: the standard library, in `/sys/zuse/hoon`
80++ vanes: arvo kernel modules, including clay itself, in folder `/sys/vane`
81++ userspace: apps, marks, ancillary source code like libraries, and user data
82+
83+An 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.
84+
85+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.
86+
87+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.
88+
89+The 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.
90+
91+To work around this limitation, Gall has a two-phase update process. First it enters a dormant “pupal” phase that stores not running agent cores, but only the agent states that the old Gall had extracted from its agents. When Clay notifies Gall that its agents have been rebuilt, Gall “molts” back into normal functionality by loading the agent cores from Clay and then running their `+on-load` routines to inject the old state.
92+
93+If there's a change to files in `/sys` on the `%home` desk, Clay asks Arvo to update kernelspace. Clay sends a sequence of moves (effects) to Arvo to ask Arvo to perform any necessary updates to hoon, the kernel, Zuse, and vanes. This sequence is terminated by an extra move back to Clay itself, which will be received by the updated version of Clay after migrating its state. The rebuilt Clay can then use the newly rebuilt version of Zuse to rebuild userspace and notify clients of the update. One client is Gall, which molts when Clay notifies it.
94+
95+Clay triggers updates, but the Arvo kernel is responsible for performing updates to all kernelspace layers, and Gall is responsible for updating userspace agents. Agents are stored in Gall's state, but all other layers are stored directly in the Arvo core's state, so the Arvo kernel contains the routines that reload Hoon, the kernel itself, Zuse, and the vanes.
96+
97+The Arvo kernel reloads itself by receiving its new source code as a `%lyra` move from Clay, compiling this source into a core with empty state, then calling the new core's `+load` routine with the relevant parts of the old state. The state passed to the new Arvo now includes not just the vane cores and their states, but also the Arvo "duct" call `stack`, which maintains a stack of queues of moves to be passed from one vane to another, and a list of effects to emit to Unix at the end of the current Arvo event. If needed, Arvo could migrate the outstanding moves themselves -- if, say, the duct datatype changes.
98+
99+Passing the Arvo call stack state to new Arvo allows a kernel update to happen in the middle of a more complex event without disturbing other sequences of processing steps happening concurrently in the vanes.
100+
101+This entire update process happens in one Arvo event and doesn’t break event-dispatching semantics. This not only provides atomic rollback, but allows the update to be combined with other actions into a larger transaction -- for example, to stage complex changes, user code could trigger two kernel updates in a row, both in the same event.
102+
103+Note that this is the opposite situation from the entropically leaking asynchronicity described earlier. Now the guarantees don’t deteriorate; they can be composed into stronger guarantees.
104+
105+## How Clay Validates a Desk
106+
107+A desk is Urbit's answer to a git branch. It's almost identical, except all files are typed and validated, and whenever a commit becomes the equivalent of git’s ‘HEAD’, it’s assigned a semantically meaningful revision number, and all files are typed and validated.
108+
109+If Clay has been asked to perform a commit, it needs to validate all the files in this desk and notify all subscribers to live queries of this desk's data. Gall, for example, maintains live queries on builds of its live agents. Validation uses the Ford build system, which as of this update is no longer a standalone vane but a core within Clay.
110+
111+A Clay commit, like a git commit, is specified as the current value of all its changed files (and, separately, references its parent commits by hash), not as the diff from a parent commit. Unlike git, Clay is typed, and every file must be validated according to its "mark". A mark is named like a file extension, e.g. `%txt`, `%png`, or `%noun`, and Clay maintains a mapping from that name to behaviors of values of that type under various operations. The last segment of any Clay path specifies the mark to use for operations on that file, including validation.
112+
113+Mark operations include conversion to and from other marks (such as converting `%json` to `%txt`), revision control operations (diff, patch, and merge), and validating an untyped noun. Operations for mark `%foo-bar` are defined by a core built using the source code at `/mar/foo-bar/hoon`, or if that doesn't exist, at `/mar/foo/bar/hoon`.
114+
115+Consider a file at `/web/foo/json`. In order to validate this file, Clay must load the mark definition core and use its validation routine to ensure the untyped value of `/web/foo/json` is in fact valid JSON. To obtain this core, Clay must build the file at `/mar/json/hoon` from source and then process the resulting raw mark core using some mild metaprogramming to get a standard interface core for dealing with marks, called a `$dais`, whose type is defined in Zuse.
116+
117+Since building a source file only makes sense if the file has been validated as a `%hoon` file, but mark definitions themselves must be built from source, there's a logical dependency cycle -- who validates the validators? To break this cycle, Clay hard-codes the validation of `%hoon` files. This allows mark definitions to be built from source, and in fact any file can depend on any other file of any mark as long as there are no cycles. As of Ford Fusion, Ford performs a cycle check to ensure acyclicity.
118+
119+Since building a file is a pure function, Clay memoizes the results of all builds, including builds of marks, mark conversions, and hoon source files. These memoization results are stored along with the desk and are used by later revisions of that desk. Future work should allow merge commits to pull memoized builds from all parents, but for now only the previous revision of the current desk is used. This is a major simplification of previous Ford architectures, which maintained much more complex caches with less clear eviction semantics. Now on every commit, we just throw away any unused memoized builds from the previous revision's Ford cache.
120+
121+Once Clay has validated every file in this new revision of a desk, it constructs and sends updates to any subscriptions that other vanes or agents have requested. More Ford builds may be run to fulfill these requests, including builds for any running agents whose dependencies changed in this commit.
122+
123+When Gall receives a newly rebuilt agent from Clay, it calls the gate produced by the `+on-load` arm of the new agent with the state extracted from the old agent. If there is a crash in any `+on-load` calls or in the handling of any effects they emit (which can include more agent activations), then the whole event crashes, canceling the commit. This effectively gives any agent the ability to abort a commit by crashing.
124+
125+It 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,
126+so 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.
127+
128+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.
129+
130+## Ford Build Semantics
131+
132+### The Three Types of Ford Builds: Files, Marks, and Casts
133+
134+The Ford build semantics have been simplified. There are now three kinds of builds that Ford can perform: files, marks, and casts, all of which happen synchronously as function calls inside Clay and are available (without memoization) as scry interfaces.
135+
136+#### File Builds
137+
138+A file build takes in a filepath containing Ford runes and Hoon source, runs the Ford runes to perform imports, and then compiles the source, producing a `$vase`, a noun tagged with its Hoon type.
139+
140+Clay exposes file builds into the scry namespace with `%ca`: as an example, `.^(vase %ca /~zod/home/3/lib/sole/hoon)` will build the `sole` library.
141+
142+#### Mark Builds
143+
144+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`.
145+
146+Clay 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.
147+
148+#### Cast Builds
149+
150+A 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:
151+
152++ direct grow from `%foo`
153++ direct grab from `%bar`
154++ indirect jump from `%foo` through `%qux`
155++ indirect grab from `%bar` through `%qux`
156+
157+The `%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.
158+
159+Clay exposes cast builds into the scry namespace with `%cc`: as an example, `.^(tube:clay %cc
160+/~zod/home/3/foo/bar)` builds a `$tube` conversion gate from `%foo` to `%bar`.
161+
162+### Ford Runes
163+
164+There are now only four Ford runes. A file can contain zero, one, or many of each, but each Ford expression can only be one line, and they must be in the standard order of `/-`s, `/+`s, `/=`s, and then `/*`s.
165+
166+```
167+/- foo, *bar, baz=qux
168+```
169+
170+The `/-` rune imports a structures file from `/sur`. You can import it as just `foo`, in which case the build result of that file (usually a core with mold definitions) will be pinned into the compilation subject with the face `foo`. If you prefix it with a `*` as in `*bar`, the result will be pinned into the subject with no face; if the structures file compiled to a core, this exposes all the arms into the namespace of the compilation subject. Finally, if you import it as `baz=qux`, the `baz` face will be applied instead of `qux`. This is similar to "import as" in other languages.
171+
172+```
173+/+ foo, *bar, baz=qux
174+```
175+
176+The `/+` rune imports a library file from `/lib`. Aside from the different source folder, the syntax and semantics are the same as for `/-`.
177+
178+```
179+/= clay-raw /sys/vane/clay
180+```
181+
182+The `/=` rune imports the result of building a hoon file from a user-specified path (the second argument), wrapping it in a face specified by the first argument. The final `/hoon` at the end of the path must be omitted. This is mostly useful for importing a file for testing. The file at the specified path will be built as a normal userspace hoon file; i.e. its compilation subject will be Zuse augmented with the results of any Ford runes it has at the top of the file.
183+
184+```
185+/* hello-gen %hoon /gen/hello/hoon
186+```
187+
188+The `/*` rune imports the contents of a file in the desk, specified as the third argument with the full path including the trailing mark, converted to the mark specified by the second argument, and pinned into the compilation subject wrapped in the face specified by the first argument. This can be used to import static data at build-time, such as a data file, a media file, or, in the case of this example, a hoon file as source text rather than already built.
189+
190+A valid userspace hoon file must contain a nonempty list of hoons (hoon source expressions) below the Ford runes, separated by gap (more than one space, or at least one newline). The system wraps this list of hoons in a `=~` expression so that the result of the previous hoon is used as the subject of the next hoon. The result of the Ford runes is used as the compilation subject for this `=~` hoon; informally, the shape of the compilation subject can be thought of as:
191+
192+```
193+:* fastar-2 fastar-1
194+ fastis-2 fastis-1
195+ faslus-2 faslus-1
196+ fashep-2 fashep-1
197+ <zuse>
198+==
199+```
200+
201+## Future Work
202+
203+Urbit 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.
204+
205+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
206+~norsyr-torryn/canvas` to load and build remote source. No one should experience dependency hell on Urbit, but we're not there yet.
207+
208+At 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
209+Ford 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.
210+
211+## Conclusion
212+
213+`~littel-ponnys` and I spent most of 2018 rewriting Ford with the intent of improving its performance. Compared to its predecessor, its result was better in some ways but worse in others. The caching system was labyrinthine and poorly factored, making the system difficult to debug or prove correct, even informally. Some things were faster, but the caching and dependency tracking were actually complex enough that a number of common operations, like mark conversion, were too slow.
214+
215+In early 2020, `~master-morzod` suggested moving Ford into Clay to reduce asynchronicity. It seemed absurd at first, but at some point I realized I could combine that idea with a simpler build-caching scheme and self-contained desk builds, and `~wicdev-wisryt` realized he could use that to further simplify Clay’s commit and merge code, which he did as part of this project.
216+
217+The 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.
218+
219+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.
220+
221+As 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.
222+
223+
content/docs/arvo/gall/_index.mdnew file+7
@@ -0,0 +1,7 @@
1++++
2+title = "Gall"
3+weight = 70
4+sort_by = "weight"
5+template = "sections/docs/chapters.html"
6+insert_anchor_links = "right"
7++++
content/docs/arvo/gall/overview.mdnew file+11
@@ -0,0 +1,11 @@
1++++
2+title = "Overview"
3+weight = 1
4+template = "doc.html"
5++++
6+
7+**Gall** is the application-management [vane](../vane). Userspace apps –⁠ daemons, really –⁠ are started, stopped, and sandboxed by Gall. Gall provides developers with a consistent interface for connecting their app to [Arvo](../arvo). It allows applications and other vanes to send messages to applications and subscribe to data streams. Messages coming into Gall are routed to the intended application, and the response comes back along the same route. If the intended target is on another [ship](../ship), Gall will route it behind the scenes through [Ames](../ames) to the other ship.
8+
9+Gall is located at `/home/sys/vane/gall.hoon` within Arvo.
10+
11+For more details, see the [userspace](/docs/userspace/gall/gall) section.
content/docs/arvo/iris/_index.mdnew file+7
@@ -0,0 +1,7 @@
1++++
2+title = "Iris"
3+weight = 80
4+sort_by = "weight"
5+template = "sections/docs/chapters.html"
6+insert_anchor_links = "right"
7++++
content/docs/arvo/iris/iris-api.mdnew file+191
@@ -0,0 +1,191 @@
1++++
2+title = "API Reference"
3+weight = 10
4+template = "doc.html"
5++++
6+
7+In this document we describe the public interface for Iris. Namely, we describe
8+each `task` that Iris can be `%pass`ed, and which `gift`(s) Iris can `%give` in
9+return.
10+
11+## Returns to Unix
12+
13+Much of what Iris does is translating `task`s from other vanes into `card`s
14+meant for Unix via the `%request` and `%cancel-request` `task`s. What this means in practice is that Iris may be `%pass`ed a
15+`task` via some `duct`, which in response Iris then `%give`s a `gift` to Unix
16+via another `duct`. This `gift` will actually be a response to the `%born`
17+`task` that Iris was `%pass`ed when the Urbit was resumed, which came along the
18+duct to Unix.
19+
20+
21+## Tasks
22+
23+### `%born`
24+
25+Each time you start your Urbit the Arvo kernel calls the `%born` `task` for
26+Iris. This causes Iris to cancel any outstanding http requests and resets all
27+connection states.
28+
29+#### Accepts
30+
31+```hoon
32+[ ~ ]
33+```
34+
35+#### Returns
36+
37+In response to a `%born` `task` Iris `give`s a `%http-response %cancel` `gift`
38+to each outstanding connection.
39+
40+
41+### `%cancel-request`
42+
43+This `task` cancels a previous fetch. Iris knows which request is meant based on the
44+`duct` that the `task` comes on.
45+
46+ We note that `%cancel-request` is also a `gift` that Iris can `%give`.
47+
48+#### Accepts
49+
50+```hoon
51+[ ~ ]
52+```
53+
54+#### Returns
55+
56+```hoon
57+[%cancel-request id=@ud]
58+```
59+Receiving this `task` causes Iris to `%give`s a `%cancel-request` `gift` to Unix,
60+which then cancels the request in the runtime. See [Returns to Unix](#returns-to-unix).
61+
62+`id` is obtained via a `(map duct @ud)`, with the `duct` corresponding to one along
63+which the `%cancel-request` `task` came with.
64+
65+
66+### `%crud`
67+
68+`%crud` is called whenever an error involving Iris occurs. It produces a crash
69+report in response.
70+
71+#### Accepts
72+
73+```hoon
74+[p=@tas q=(list tank)]
75+```
76+
77+`p` is the type of error, `q` is the error message.
78+
79+#### Returns
80+
81+Iris does not `%give` a `gift` in response to a `%crud` `task`, but it does
82+`%slip` Dill a `%flog` `task` instructing it to print the error.
83+
84+
85+### `%receive`
86+
87+The `%receive` `task` is used to receive a response from Unix to an `http-request` that
88+was made.
89+
90+#### Accepts
91+
92+```hoon
93+[id=@ud =http-event:http]
94+```
95+
96+`id` is the identification number assigned by Iris to the http connection under
97+consideration. `http-event` is a packet that contains a header and data.
98+
99+#### Returns
100+
101+The response depends on what kind of packet `http-event` is: `%start`,
102+`%continue`, or `%cancel` and whether the `complete` flag is `%.y` or `%.n`.
103+
104+If the packet says to `%start` or `%continue` and `complete=%.n`, Iris will `%give` a
105+`%http-response %progress` `gift`.
106+
107+If the packet says to `%start` or `%continue` and `complete=%.y`, Iris will
108+`%give` a `%http-response %finished` `gift`.
109+
110+If the packet says to `%cancel`, Iris will `%give` a `%http-response %cancel`
111+`gift` in return. The `complete` flag is unused here.
112+
113+
114+### `%request`
115+
116+`%request` is used to fetch a remote resource. `%request` is also a `gift` Iris
117+can `%give`.
118+
119+#### Accepts
120+
121+```hoon
122+[=request:http =outbound-config]
123+```
124+
125+A `$request` consists of the following:
126+ - `=method`, the http method, which is one of `CONNECT`, `DELETE`, `GET`,
127+ `HEAD`, `OPTIONS`, `POST`, `PUT`, and `TRACE`.
128+ - `url=@t`, the URL being requested
129+ - `=header-list`, a list of headers to pass with the request,
130+ - `body=(unit octs)`, optional data to include in the request.
131+
132+ A `$outbound-config` contains the number of redirects and retries that Iris
133+ will attempt. By default this is 5 redirects (the recommended limit for the
134+ http standard) and 3 retries.
135+
136+#### Returns
137+
138+```hoon
139+[id=@ud request=request:http]
140+```
141+Iris will `%give` a `%request` `gift` to Unix in response to a `%request`
142+`task`. See [Returns to Unix](#returns-to-unix). This `gift`
143+contains the `request` in the original `task` as well as the ID number assigned
144+by Iris for that particular http connection, which is extracted from the input `task`.
145+
146+
147+### `%trim`
148+
149+This `task` is sent by the interpreter to free up memory. It has no effect on Iris.
150+
151+#### Accepts
152+
153+```hoon
154+[ ~ ]
155+```
156+
157+#### Returns
158+
159+This `task` returns no `gift`s.
160+
161+
162+### `%vega`
163+
164+This `task` informs the vane that the kernel has been upgraded. Iris does not do
165+anything in response to this.
166+
167+#### Accepts
168+
169+```hoon
170+[ ~ ]
171+```
172+
173+#### Returns
174+
175+This `task` returns no `gift`s.
176+
177+
178+### `%wegh`
179+
180+This `task` asks Iris to product a memory usage report.
181+
182+#### Accepts
183+
184+This `task` has no arguments.
185+
186+#### Returns
187+
188+When Iris is `%pass`ed this `task`, it will `%give` a `%mass` `gift` in response
189+containing Iris' current memory usage.
190+
191+
content/docs/arvo/jael/_index.mdnew file+7
@@ -0,0 +1,7 @@
1++++
2+title = "Jael"
3+weight = 90
4+sort_by = "weight"
5+template = "sections/docs/chapters.html"
6+insert_anchor_links = "right"
7++++
content/docs/arvo/jael/jael-api.mdnew file+393
@@ -0,0 +1,393 @@
1++++
2+title = "API Reference"
3+weight = 10
4+template = "doc.html"
5++++
6+
7+In this document we describe the public interface for Jael. Namely, we describe
8+each `task` that Jael can be `%pass`ed, and which `gift`(s) Jael can `%give` in return.
9+
10+
11+## Tasks
12+
13+### `%dawn`
14+
15+This `task` is called once per ship during the vane initialization
16+phase immediately following the beginning of the [adult
17+stage](/docs/arvo/overview#structural-interface-core). This `task` is `%pass`ed to Jael by Dill, as Dill is the first vane to be loaded for
18+technical reasons, though we consider Jael to be the true "first" vane. This
19+`task` is only used for ships that will join the Ames network - fake ships (i.e.
20+made with `./urbit -F zod`) use the `%fake` `task` instead.
21+
22+`%dawn` is used to perform a sequence of initialization tasks related to saving
23+information about Azimuth and the Ames network and booting other vanes for the first time. Upon
24+receipt of a `%dawn` `task`, Jael will:
25+ - record the Ethereum block the public key is registered to,
26+ - record the URL of the Ethereum node used,
27+ - save the signature of the parent planet (if the ship is a moon),
28+ - load the initial public and private keys for the ship,
29+ - set the DNS suffix(es) used by the network (currently just `arvo.network`),
30+ - save the public keys of all galaxies,
31+ - set Jael to subscribe to `%azimuth-tracker`,
32+ - `%slip` a `%init` `task` to Ames, Clay, Gall, Dill, and Eyre, and `%give` an `%init`
33+`gift` to Arvo, which then informs Unix that the initialization process has concluded.
34+
35+#### Accepts
36+
37+`%dawn` accepts a `dawn-event`:
38+
39+```hoon
40+ +$ dawn-event
41+ $: =seed
42+ spon=(list [=ship point:azimuth-types])
43+ czar=(map ship [=rift =life =pass])
44+ turf=(list turf)
45+ bloq=@ud
46+ node=(unit purl:eyre)
47+ ==
48+```
49+
50+The `seed` is `[who=ship lyf=life key=ring sig=(unit oath:pki)]`. `who` is the
51+`@p` of the ship running the `task`, `lyf` is the current ship key revision,
52+`key` is the ship's private key, and `sig` is the signature of the ship's parent
53+planet if the ship is moon and `[~]` otherwise.
54+
55+`spon` is a `list` of ships and their `point`s in the ship's sponsorship chain,
56+all the way to the galaxy level. `point:azimuth-types` contains all Azimuth
57+related data and can be found in `zuse.hoon`.
58+
59+`czar` is a map from each galaxy's `@p` to its `rift`, `life`, and public key (`pass`).
60+
61+`turf` is a `list` of DNS suffixes used by the Ames network, which for now is
62+just `arvo.network`.
63+
64+`bloq` is the number of the Ethereum block in which the ship registered its keys
65+with the Azimuth smart contract.
66+
67+`node` is the URL of the Ethereum node used to register the ship's keys with Azimuth.
68+
69+#### Returns
70+
71+Jael `%give`s an `%init` `gift` to Unix. This occurs after the Dill `%slip`
72+init.
73+
74+#### Slips
75+
76+Jael `%slip`s `%init` `task`s to each of Eyre, Dill, Gall, Clay, and Ames, in
77+that order.
78+
79+
80+### `%fake`
81+
82+This `task` is used instead of `%dawn` when creating a fake ship via the `-F`
83+flag when calling the Urbit binary. It performs a subset of the actions that
84+`%dawn` performs, modified to accommodate the fake ship.
85+
86+`%fake` endows the ship with a private key and a public key deterministically derived from the
87+ship's `@p`. It sets `fak.own.pki` to `%.y`, which is the bit that determines
88+whether or not a ship is fake. Other parts of the Jael state, such as the
89+sponsorship chain and galaxy public keys are left at their bunted values.
90+
91+#### Accepts
92+
93+```hoon
94+[=ship]
95+```
96+`ship` is the `@p` of the fake ship being created.
97+
98+#### Returns
99+
100+Jael `%give`s a `%init` `gift` to Unix.
101+
102+#### Slips
103+
104+In response to a `%fake` `task`, Jael `%slip`s a `%init` `task` to each of Eyre, Dill, Gall,
105+Clay, and Ames, in that order.
106+
107+
108+### `%listen`
109+
110+Sets the source that the public keys for a set of `ship`s should be obtained
111+from. This can either be a Gall app that communicates with an Ethereum node such
112+as `%azimuth-tracker`, as in the case for galaxies, stars,
113+and planets, or a ship, as in the case of a moon or comet.
114+
115+After setting the source, Jael will then subscribe to the source for updates on
116+public keys for the given ships.
117+
118+
119+#### Accepts
120+
121+```hoon
122+[whos=(set ship) =source]
123+```
124+
125+`whos` is the set of ships whose key data source is to be altered. `source` is
126+`(each ship term)`, where `term` will ultimately be treated as a handle for a
127+Gall app.
128+
129+A `%listen` `task` with empty `whos` will set the default source to `source`.
130+This is the source used for all ships unless otherwise specified.
131+
132+When the `source` is a `term`, Jael looks into its state to find what source has
133+been previously assigned to that `term` and will henceforth obtain public keys for
134+ships in `(set ship)` from there. In practice, this is always
135+`%azimuth-tracker`, but the ability to use other sources is present.
136+
137+When the `source` is a ship, Jael will obtain public keys for ships in `(set ship)` from
138+the given ship. By default, the `source` for a moon will be the planet that
139+spawned that moon, and the `source` for a comet will be the comet itself.
140+
141+#### Returns
142+
143+This `task` returns no `gift`s.
144+
145+#### Passes
146+
147+If the `source` is a `term`, Jael will `%pass` a `%deal` `task` to Gall asking to
148+`%watch` the app given by `source` at path `/`.
149+
150+If the `source` is a `ship`, Jael will `%pass` a `%plea` `task` to Ames wrapping
151+a `%public-keys` `task` intended for Jael on the `ship` specified by `source`.
152+
153+
154+### `%meet`
155+
156+This `task` is deprecated and does not perform any actions.
157+
158+#### Accepts
159+
160+```hoon
161+[=ship =life =pass]
162+```
163+
164+#### Returns
165+
166+This `task` returns no `gift`s.
167+
168+
169+### `%moon`
170+
171+This `task` sets the public keys of a moon.
172+
173+#### Accepts
174+
175+```hoon
176+[=ship =udiff:point]
177+```
178+
179+The `ship` is the `@p` of the moon. The `task` will be a no-op if the `@p` is not that
180+of a moon, or if the moon does not belong to the ship.
181+
182+`udiff:point` contains the new public keys to be stored for the moon.
183+
184+#### Returns
185+
186+This `task` returns no `gift`s.
187+
188+
189+### `%nuke`
190+
191+This `task` cancels subscriptions to Jael's state from a given set of `ship`s.
192+This `task` works differently depending on whether the `task` originated locally
193+or remotely.
194+
195+#### Accepts
196+
197+```hoon
198+[whos=(set ship)]
199+```
200+`whos` is the `set` of `ship`s from which subscriptions are to be canceled.
201+
202+#### Returns
203+
204+This `task` returns no `gift`s.
205+
206+
207+### `%plea`
208+
209+This `task` is `%pass`ed to Jael from Ames. `%plea`s are wrappers for `task`s
210+that originate from a remote source, as the `%plea` pattern
211+is used to extend the `%pass`/`%give` semantics over the Ames network. Jael
212+attempts to perform the `task` wrapped in the `%plea`.
213+
214+Jael accepts two kinds of `%plea`s: [`%nuke`](#nuke) and
215+[`%public-keys`](#public-keys) and will crash if passed anything else. See the
216+relevant entries to learn how Jael responds to these.
217+
218+#### Accepts
219+
220+```hoon
221+[=ship =plea:ames]
222+```
223+`ship` is the origin of the plea, and `plea:ames` is `[vane=@tas =path
224+payload=*]`. Here, `vane=%j`, `path` is the internal route on the receiving ship, and `payload` is either a `%nuke` or
225+a `%public-keys` `task`.
226+
227+#### Returns
228+
229+Jael `%give`s a `%done` `gift` in response to a `%plea` `task`.
230+
231+#### Passes
232+
233+Jael `%pass`es itself the wrapped `task`.
234+
235+
236+### `%private-keys`
237+
238+This `task` creates a subscription to the private keys kept by Jael.
239+
240+We note that there are two `+private-keys` arms in Jael - one located in the
241+`+feed` core and the other located in the `+feel` core. This `task` calls the
242+arm in the `+feed` core.
243+
244+#### Accepts
245+
246+```hoon
247+[~]
248+```
249+
250+#### Returns
251+
252+```hoon
253+[%private-keys =life vein=(map life ring)]
254+```
255+
256+In response to a `%private-keys` `task`, Jael `%give`s a `%private-keys` `gift`.
257+`life=@ud` is the current `life` of the ship, and `vein` is a `map` from
258+`life`s to `ring`s that keeps track of all `life`-`ring` pairs throughout the
259+history of the ship.
260+
261+
262+### `%public-keys`
263+
264+This `task` creates a subscription for the callee to a selection of the public
265+keys kept by Jael. This `task` can originate locally or remotely.
266+
267+#### Accepts
268+
269+```hoon
270+[ships=(set ship)]
271+```
272+`ships` is the `set` of `ship`s whos' public keys are being subscribed to.
273+
274+#### Returns
275+
276+```hoon
277+[%public-keys =public-keys-result]
278+```
279+If the `task` originated locally, Jael `%give`s a `%public-keys` `gift` in
280+response. If it originated remotely, Jael `%give`s a `%boon` `gift` to back
281+to Ames wrapping a `%public-keys` `gift`.
282+
283+A `$public-keys-result` is the following.
284+```hoon
285+ +$ public-keys-result
286+ $% [%full points=(map ship point)]
287+ [%diff who=ship =diff:point]
288+ [%breach who=ship]
289+```
290+The first time Jael receives a `%public-keys` `task` from a ship it will return
291+a `[%public-keys-result %full]` `gift`, which contains all information about ships and
292+their associated points that Jael knows. Subsequent updates will typically be
293+`[%public-keys-result %diff]`, which tells the caller what has changed
294+since last time they sent a `%public-keys` `task`, and `[%public-keys-result
295+%breach]`, which informs the caller of ship breaches.
296+
297+
298+### `%rekey`
299+
300+This `task` updates the ship's private keys.
301+
302+#### Accepts
303+
304+```hoon
305+[=life =ring]
306+```
307+
308+`life` is a `@ud` that is the new ship key revision number. `ring` is a `@` that is the new private key.
309+
310+#### Returns
311+
312+```hoon
313+[%private-keys =life vein=(map life ring)]
314+```
315+
316+In response to a `%rekey` `task`, Jael `%give`s a `%private-keys` `gift`. `life`
317+is the new `life` given in the original `task`, and `vein` is a `map` from
318+`life`s to `ring`s that keeps track of all `life`-`ring` pairs throughout the
319+history of the ship.
320+
321+
322+### `%trim`
323+
324+This `task` is sent by the interpreter in order to free up memory.
325+ This `task` is empty for Jael, since it is not a good idea to forget your
326+ private keys and other cryptographic data.
327+
328+#### Accepts
329+
330+```hoon
331+[p=@ud]
332+```
333+This argument is unused by Jael.
334+
335+#### Returns
336+
337+This task returns nothing.
338+
339+
340+
341+### `%turf`
342+
343+This `task` is a request for Jael to provide its list of `turf`s, e.g. DNS
344+suffixes for the Ames network. Currently `arvo.network` is the only `turf` in use.
345+
346+#### Accepts
347+
348+```hoon
349+[~]
350+```
351+
352+#### Returns
353+
354+```hoon
355+[%turn tuf.own.pki]
356+```
357+
358+Jael `%give`s a `%turf` `gift` in response to a `%turf` `task`. `tuf.own.pki` is
359+a `(list turf)`, which is Jael's list of `turf`s.
360+
361+
362+### `%vega`
363+
364+`%vega` is called whenever the kernel is updated. Jael currently does not do
365+anything in response to this.
366+
367+#### Accepts
368+
369+`%vega` takes no arguments.
370+
371+#### Returns
372+
373+This `task` returns no `gift`s.
374+
375+
376+
377+### `%wegh`
378+
379+This `task` is a request to Jael to produce a memory usage report.
380+
381+#### Accepts
382+
383+This `task` has no arguments.
384+
385+#### Returns
386+
387+In response to this `task,` Jael `%give`s a `%mass` `gift` containing Ames'
388+current memory usage.
389+
390+
391+
392+
393+
content/docs/arvo/overview.mdnew file+577
@@ -0,0 +1,577 @@
1++++
2+title = "Overview"
3+weight = 1
4+aliases = ["/docs/learn/arvo/arvo/"]
5+template = "doc.html"
6++++
7+
8+Arvo, also called Urbit OS, is our operating system.
9+
10+# Introduction
11+
12+This article is intended to provide a thorough summary of all of the most
13+important aspects of the Arvo kernel and how this functionality gives life to
14+the ambitions of the Urbit platform. We work on two levels: a conceptual level
15+that should be useful to anybody interested in how Arvo works, and a more
16+technical level intended for those that intend to write software for Urbit.
17+
18+The [Urbit white paper](https://media.urbit.org/whitepaper.pdf) is a good
19+companion to this document, and some segments are direct quotes or paraphrases, but it should be noted that some parts of it are now either out of date or not yet implemented.
20+
21+## Prerequisites
22+
23+The conceptual section titled [What is Arvo?](#what-is-arvo-) can be understood
24+without knowing Hoon, the Urbit programming language. The technical section
25+titled [The kernel](#the-kernel) will require Chapter One of the [Hoon
26+tutorial](/docs/hoon/hoon-school/) for full understanding, and some
27+material from Chapter Two will be helpful as well. At the bare minimum, we
28+presume that the reader has read through the [Technical
29+Overview](/docs/system-overview/).
30+
31+We also suggest to the reader to peruse the [glossary](/docs/glossary/) before diving into this article. It will provide the initial scaffolding that you will be able to gradually fill in as you read this article and go deeper into the alternate universe of computing that is Urbit.
32+
33+
34+# Table of Contents
35+
36+- [What is Arvo?](#what-is-arvo)
37+ * [An operating function](#an-operating-function)
38+ + [Determinism](#determinism)
39+ + [Event log](#event-log)
40+ * [Solid state interpreter](#solid-state-interpreter)
41+ + [Over-the-air updates](#over-the-air-updates)
42+ + [ACID Database](#acid-database)
43+ + [Single-level store](#single-level-store)
44+ + [Non-preemptive](#non-preemptive)
45+- [The kernel](#the-kernel)
46+ * [Overall structure](#overall-structure)
47+ + [Formal interface](#formal-interface)
48+ + [Types](#types)
49+ + [Arvo cores](#arvo-cores)
50+ * [The state](#the-state)
51+ * [Vanes](#vanes)
52+
53+# What is Arvo?
54+
55+Arvo is a [non-preemptive](#non-preemptive)
56+operating system purposefully built to create a new, peer-to-peer internet
57+whereby users own and manage their own data. Despite being an operating system,
58+Arvo does not replace Windows, Mac OS, or Linux. It is better to think of the
59+user experience of Arvo as being closer to that of a web browser despite being a
60+fully fledged OS. As such, Arvo is generally run inside a virtual machine, though in theory it could be run on bare metal.
61+
62+Urbit is a “browser for the server side”; it replaces multiple developer-hosted web services on multiple foreign servers, with multiple self-hosted applications on one personal server. Every architectural decision for Arvo (and indeed, the entire Urbit stack) was made with this singular goal in mind. Throughout this document, we connect the various concepts underlying Arvo with this overarching goal.
63+
64+Arvo is designed to avoid the usual state of complex event networks: event spaghetti. We keep track of every event's cause so that we have a clear causal chain for every computation. At the bottom of every chain is a Unix I/O event, such as a network request, terminal input, file sync, or timer event. We push every step in the path the request takes onto the chain until we get to the terminal cause of the computation. Then we use this causal stack to route results back to the caller.
65+
66+Unlike any other popular operating system, it is possible for a single human to understand every aspect of Arvo due to its compact size. The entire Urbit stack is around 30,000 lines of code, while the Arvo kernel is only about 1,000 lines of code. We strive for a small codebase because the difficulty in administering a system is roughly proportional to the size of its code base.
67+
68+## An operating function
69+
70+Arvo is the world's first _purely functional_ operating system, and as such it may reasonably be called an _operating function_. The importance of understanding this design choice and its relevance to the overarching goal cannot be understated. If you knew only a single thing about Arvo, let it be this.
71+
72+This means two things: one is that the there is a notion of _state_ for the operating system, and that the current state is a pure function of the [event log](#event-log), which is a chronological record of every action the operating system has ever performed. A _pure function_ is a function that always produces the same output given the same input. Another way to put this is to say that Arvo is _deterministic_. Other operating systems are not deterministic for a number of reasons, but one simple reasons is because they allow programs to alter global variables that then affect the operation of other programs.
73+
74+In mathematical terms, one may think of Arvo as being given by a transition function _T_:
75+
76+```
77+T: (State, Input) -> (State, Output).
78+```
79+
80+In practice, _T_ is implemented by the `+poke` [arm](/docs/glossary/arm/) of the Arvo kernel, which is described in more detail in the [kernel section](#the-kernel). In theoretical terms, it may be more practical to think of Arvo as being defined by a _lifecycle function_ we denote here by _L_:
81+
82+```
83+L: History -> State.
84+```
85+
86+Which perspective is more fruitful depends on the problem being considered.
87+
88+### Determinism
89+
90+We consider Arvo to be deterministic at a high level. By that we mean that it is
91+stacked on top of a frozen instruction set known as Nock. Frozen instruction
92+sets are a new idea for an operating system, but not for computing in general.
93+For instance, the CPU instruction sets such as
94+[x86-64](https://en.wikipedia.org/wiki/X86-64v) are frozen at the level of the
95+chip. A given operating system may be adapted to run on more than one CPU
96+instruction set, we merely freeze the instruction set at a higher level in order
97+to enable deterministic computation.
98+
99+Arvo handles nondeterminism in an interesting way. Deciding whether or not to
100+halt a computation that could potentially last forever becomes a heuristic
101+decision that is akin to dropping a packet. Thus it behooves one to think of
102+Arvo as being a stateful packet transceiver rather than an ordinary computer - events
103+are never guaranteed to complete, even if one can prove that the computation
104+would eventually terminate. We elaborate on this in the [solid state
105+interpreter](#solid-state-intrepeter) section.
106+
107+Because Arvo is run on a VM, nondeterministic information such as the stack
108+trace of an infinite loop that was entered into may be obtained. This is
109+possible because while Arvo may be unable to obtain that information, the
110+interpreter beneath does and can inject that information back into the event log.
111+
112+Being deterministic at a high level enables many
113+things that are out of reach of any other operating system. For
114+instance, we are able to do [over-the-air](#over-the-air-updates) (OTA) updates,
115+which allows software updates to be implemented across the network without
116+needing to worry whether it won't work on someone's ship, since Arvo is an
117+[interpreter](#solid-state-intrepeter) that can accept source code to
118+update itself instead of requiring a pre-compiled binary. This essential
119+property is why Urbit is able to act as a personal server while having
120+a user experience as accessible as a browser.
121+
122+### Event log
123+
124+The formal state of an Arvo instance is an event history, as a linked list of [nouns](/docs/glossary/noun/) from first to last. The history starts with a bootstrap sequence that delivers Arvo itself, first as an inscrutable kernel, then as the self-compiling source for that kernel. After booting, we break symmetry by delivering identity and entropy. The rest of the log is actual input.
125+
126+The Arvo event log is a list of every action ever performed on your ship that
127+lead up to the current state. In principle, this event log is maintained by the
128+[Nock runtime environment](/docs/vere/), but in practice
129+event logs become too long over time to keep, as the event log has a size of
130+O(n) where n is the number of events. Thus it is our intention to
131+implement a feature whereby periodic snapshots of the state of Arvo are taken
132+and the log up to that state is pruned. This is currently unnecessary and thus
133+this feature has not been prioritized.
134+
135+The beginning of the event log starting from the very first time a ship is
136+booted up until the kernel is compiled and identity and entropy are created is a
137+special portion of the Arvo lifecycle known as the _larval stage_. We describe
138+the larval stage in more detail in the [larval stage](#larval-stage-core) section.
139+
140+More information on the structure of the Arvo event log and the Arvo state is given in the section on [the kernel](#the-kernel).
141+
142+
143+
144+## Solid state interpreter
145+
146+Arvo is a _solid state interpreter_. In this section we describe what is meant
147+by 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).
148+
149+In computer science, an _interpreter_ is a program that directly executes
150+instructions written in some human-understandable programming or scripting
151+language, rather than requiring the code to first be compiled into a machine
152+language. Arvo is an interpreter, which is important for us since it allows us
153+to perform deterministic [over-the-air updates](#over-the-air-updates) by the
154+direct transfer of raw source code.
155+
156+To understand what we mean by _solid state_ interpreter, consider the operation of a solid state hard drive when a computer shuts down or loses power. Data written to an SSD is permanent unless otherwise deleted - loss of power may leave some partially written data, but nothing is ever lost. Thus, the state of an SDD can be considered to be equivalent to the data that it contains. That is to say, you do not need to know anything about the system which is utilizing the SSD to know everything there is to know about the SSD. There is no notion of "rebooting" a SSD - it simply stores data, and when power is restored to it, it is in exactly the same state as it was when power was lost.
157+
158+Contrast this with other popular operating systems, such as Windows, Mac, or Linux. The state of the operating system is something that crucially depends on having a constant power supply because much of the state of the operating system is stored in RAM, which is volatile. When you reboot your computer or suddenly lose power, any information stored in RAM is lost. Modern operating systems do mitigate this loss of information to some extent. For instance, it may remember what applications you were running at the time power was lost and try to restore them. Particularly durable programs may go as far as writing their state to disk every few seconds so that only very minimal information can be lost in a power outage. However, this is not the default behavior, and indeed if it were then they would be so slow as to be unusable, as you would effectively be using your hard disk as the RAM.
159+
160+How Arvo handles loss of power is closer to that of an SSD. Since it is an [ACID database](#acid-database) and a [single-level store](#single-level-store), a sudden loss of power have no effect on the state of the operating system. When you boot your ship back up it will be exactly as it was before the failure. Your information can never be lost, and because it was designed from the ground up to behave in this fashion, it does not suffer significant slowdown by persisting all data in this manner as would be the case if your typical operating system utilized its hard disk as RAM.
161+
162+Another way to describe a solid state interpreter is to think of it as a
163+stateful packet transceiver. Imagine
164+it as a chip. Plug this chip into power and network; packets go in and
165+out, sometimes changing its state. The chip never loses data and has
166+no concept of a reboot; every packet is an [ACID transaction](#acid-database).
167+
168+
169+### Over-the-air updates
170+
171+Arvo can hotpatch any other semantics at any layer in the system (apps, vanes, Arvo or Hoon itself) with automatic over-the-air updates.
172+
173+Typically, updates to an operating system are given via a pre-compiled binary,
174+which is why some updates will work on some systems but not on others where the
175+hardware and environment may differ. This is not so on Arvo - because it is an
176+[interpreter](#solid-state-interpreter), Arvo may update itself by receiving
177+source code from your sponsor over [Ames](/docs/arvo/ames/ames), our
178+network. As Hoon compiles down to Nock, which is an axiomatic representation of
179+a deterministic computer, this code is guaranteed to run identically on your machine as it
180+would on anybody else's.
181+
182+Some subtleties regarding types arise when handling OTA updates, since they can
183+potentially alter the type system. Put more concretely, the type of `type` may
184+be updated. In that case, the update is an untyped Nock formula from the
185+perspective of the old kernel, but ordinary typed Hoon code from the perspective of
186+the new kernel. Besides this one detail, the only functionality of the Arvo
187+kernel proper that is untyped are its interactions with the Unix runtime.
188+
189+### ACID Database
190+
191+In the client-server model, data is stored on the server and thus reliable and efficient databases are an integral part of server architecture. This is not quite so true for the client - a user may be expected to reboot their machine in the middle of a computation, alter or destroy their data, never make backups or perform version control, etc. In other words, client systems like your personal computer or smart phone are not well suited to act as databases.
192+
193+In order to dismantle the client-server model and build a peer-to-peer internet, we need the robustness of modern database servers in the hands of the users. Thus the Arvo operating system itself must have all of the properties of a reliable database.
194+
195+Database 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.
196+
197+ - 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.
198+
199+ - 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.
200+
201+ - Isolation: Transactions in databases often happen concurrently, and isolation
202+ ensures that the transactions occur as if they were performed sequentially,
203+ making it so that their effects are isolated from one another. Arvo ensures
204+ this simply by the fact that it only ever performs events sequentially. While
205+ Arvo
206+ transactions are sequential and performed by the daemon, persistence and effect application are performed
207+ in parallel by the worker; see [worker and
208+ daemon](/docs/vere/) for more detail.
209+
210+ - Durability: Completed transactions will survive permanently. In other words,
211+ since the event log is stored on disk, if power is lost you are guaranteed
212+ that no transactions will be reversed.
213+
214+It is easy to think that "completed transaction will survive permanently"
215+along with "the state of Arvo is pure function of its event log" implies that
216+nothing can ever be deleted. This is not quite true.
217+[Clay](/docs/arvo/clay/clay) is our [referentially
218+transparency](https://en.wikipedia.org/wiki/Referential_transparency)
219+file system, which could naively be thought to mean that since data must be
220+immutable, files cannot be deleted. However, Clay can replace a file with a
221+"tombstone" that causes Clay to crash whenever it is accessed. Referential
222+transparency only guarantees that there won't be new data at a previously
223+accessed location - not that it will still be available.
224+
225+### Single-level store
226+
227+A kernel which presents the abstraction of a single layer of permanent state is also called a _single-level store_. One way to describe a single-level store is that it never reboots; a formal model of the system does not contain an operation which unpredictably erases half its brain.
228+
229+Today's operating systems utilize at least two types of memory: the hard disk and the RAM, and this split is responsible for the fact that data is lost whenever power is lost. Not every operating system in history was designed this way - in particular, [Multics](https://en.wikipedia.org/wiki/Multics) utilized only one store of memory. Arvo takes after Multics - all data is stored in one permanent location, and as a result no data is ever lost when power is lost.
230+
231+### Non-preemptive
232+
233+Most operating systems are preemptive, meaning that they regularly interrupt
234+tasks being performed with the intention of resuming that task at a later time,
235+without the task explicitly yielding control.
236+Arvo does not do this - tasks run until they are complete or are cancelled due
237+to some heuristic, such as taking too long or because the user pressed Ctrl-C.
238+This is known as
239+[non-preemptive](https://en.wikipedia.org/wiki/Cooperative_multitasking) or
240+cooperative multitasking.
241+
242+
243+> Parts of the remainder of this document are out of date as of 2020.07.20, please use information here with
244+> caution. This message will be removed once it is up to date.
245+
246+
247+# The kernel
248+
249+The 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.
250+
251+This section requires an understanding of Hoon of at least the level of Chapter One of the [Hoon tutorial](/docs/hoon/hoon-school/).
252+
253+After concluding this section, the reader is encouraged to follow along with the
254+[move trace tutorial](/docs/arvo/tutorials/move-trace),
255+which applies many of the concepts covered below.
256+
257+## Overall structure
258+
259+`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:
260+ + Types
261+ + Section 3bE Arvo Core
262+ + Implementation core
263+ + Structural interface core, or adult core
264+ + Larval stage core
265+ + Formal interface
266+
267+See [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.
268+
269+### Formal interface
270+
271+The formal interface is a single gate that takes in the current time and a noun that encodes the input. This input, referred to as an _event_, is then put into action by the `+poke` arm, and a new noun denoting the current [state of Arvo](#the-state) is returned. In reality, you cannot feed the gate just any noun - it will end up being an `ovum` described below - but as this is the outermost interface of the kernel the types defined in the type core are not visible to the formal interface.
272+
273+```hoon
274+ :: Arvo formal interface
275+ ::
276+ :: this lifecycle wrapper makes the arvo door (multi-armed core)
277+ :: look like a gate (function or single-armed core), to fit
278+ :: urbit's formal lifecycle function. a practical interpreter
279+ :: can ignore it.
280+ ::
281+ |= [now=@da ovo=*]
282+ ^- *
283+ ~> %slog.[0 leaf+"arvo-event"]
284+ .(+> +:(poke now ovo))
285+```
286+
287+### Types
288+
289+This core contains the most basic types utilized in Arvo. We discuss a number of them here.
290+
291+#### `+duct`
292+
293+```hoon
294+++ duct (list wire) :: causal history
295+```
296+
297+Arvo is designed to avoid the usual state of complex event networks: event
298+spaghetti. We keep track of every event's cause so that we have a clear causal
299+chain for every computation. At the bottom of every chain is a Unix I/O event,
300+such as a network request, terminal input, file sync, or timer event. We push
301+every step in the path the request takes onto the chain until we get to the
302+terminal cause of the computation. Then we use this causal stack to route
303+results back to the caller.
304+
305+The Arvo causal stack is called a `duct`. This is represented simply as a list of paths, where each path represents a step in the causal chain. The first element in the path is the first letter of whichever vane handled that step in the computation, or the empty span for Unix.
306+
307+Here's a `duct` that was recently observed in the wild upon entering `-time ~s1`
308+into the dojo and pressing Enter, which sets a timer for one second that will
309+then produce a `@d` with the current time after the timer has elapsed:
310+
311+```
312+~[
313+ /g/a/~zod/4_shell_terminal/u/time
314+ /g/a/~zod/shell_terminal/u/child/4/main
315+ /g/a/~zod/terminal/u/txt
316+ /d/term-mess
317+ //term/1
318+]
319+```
320+
321+This is the `duct` that the timer vane, Behn, receives when the `time` sample app asks the Behn to set a timer. This is also the `duct` over which the response is produced at the specified time. Unix sent a terminal keystroke event (enter), and Arvo routed it to Dill (our terminal), which passed it on to the Gall app terminal, which sent it to shell, its child, which created a new child (with process id 4), which on startup asked Behn to set a timer.
322+
323+Behn saves this `duct`, so that when the specified time arrives and Unix sends a
324+wakeup event to the timer vane, it can produce the response on the same `duct`.
325+This response is routed to the place we popped off the top of the `duct`, i.e. the
326+time app. This app returns a `@d` which denotes the current time, which falls down to the shell,
327+which drops it through to the terminal. Terminal drops this down to Dill, which
328+converts it into an effect that Unix will recognize as a request to print the
329+current time to the screen. When Dill produces this, the last path in the `duct` has an
330+initial element of the empty span, so this is routed to Unix, which applies the effects.
331+
332+This 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.
333+
334+
335+#### `wire`
336+
337+```hoon
338+++ wire path :: event pretext
339+```
340+
341+Synonym for `path`, used in `duct`s. These should be thought of as a list of symbols
342+representing a cause.
343+
344+#### `move`
345+
346+```hoon
347+++ move [p=duct q=arvo] :: arvo move
348+```
349+
350+If `duct`s are a call stack, then how do we make calls and produce results? Arvo
351+processes `move`s which are a combination of message data and metadata. There
352+are four types of `move`s: `%pass`, `%give`, `%slip`, and `%unix`.
353+
354+A `%pass` `move` is analogous to a call:
355+
356+```
357+[duct %pass return-path=path vane-name=@tD data=card]
358+```
359+
360+Arvo pushes the return path (preceded by the first letter of the vane name) onto
361+the `duct` and sends the given data, a `card`, to the vane we specified. Any response will come along the same `duct` with the `wire` `return-path`.
362+
363+A `%give` `move` is analogous to a return:
364+
365+```
366+[duct %give data=card]
367+```
368+
369+Arvo pops the top `wire` off the `duct` and sends the given `card` back to the caller.
370+
371+A `%slip` `move` is a cousin of `%pass`. Any `card` that can be `%pass`ed can also be
372+`%slip`ed, but while a `%pass` says to "push this `wire` onto the `duct` and
373+transfer control to the receiving vane", a `%slip` transfers control to the
374+receiving vane without altering the `duct`. Therefore, a `%give` in response to
375+a `%slip` will go to the caller of the vane that sent the `%slip` rather than
376+the vane that actually sent the `%slip`. `%slip`s are much more rare than
377+`%pass`es and `%give`s. In general, `%slip` and `%pass` `move`s are
378+both referred to as "passes" and it should be clear from the context if one
379+means to refer only to `%pass`es and not `%slip`s or vice versa. Lastly, we note
380+that `%slip` is a code smell and should nearly always be avoided. It can result
381+in unexpected behavior like receiving a gift from a vane you never passed a note to.
382+
383+Lastly, a `%unix` `move` is how Arvo represents communication from Unix, such as a
384+network request or terminal input.
385+
386+#### `card`s and `curd`s
387+
388+`card`s are the vane-specific portion of a `move`, while `curd`s are typeless
389+`card`s utilized at the level of the kernel. `card`s are not actually defined in
390+`arvo.hoon`, rather they are given by `+note-arvo` and `+sign-arvo` in the
391+standard library `zuse`
392+(which then refer to `+task` and `+gift` in each of the vane cores), but they are closely
393+connected to `curd`s so we speak of them in the same breath.
394+
395+Each vane defines a protocol for interacting with other vanes (via Arvo) by defining four types of `card`s: `task`s, `gift`s, `note`s, and `sign`s.
396+
397+When one vane is `%pass`ed a `card` in its `task` (defined in `zuse`), Arvo activates the `+call` gate with the `card` as its argument. To produce a result, the vane `%give`s one of the `card`s defined in its `gift`. If the vane needs to request something of another vane, it `%pass`es it a `note` `card`. When that other vane returns a result, Arvo activates the `+take` gate of the initial vane with one of the `card`s defined in its `sign`.
398+
399+In other words, there are only four ways of seeing a `move`: (1) as a request seen by the caller, which is a `note`. (2) that same request as seen by the callee, a `task`. (3) the response to that first request as seen by the callee, a `gift`. (4) the response to the first request as seen by the caller, a `sign`.
400+
401+When a `task` `card` is `%pass`ed to a vane, Arvo calls its `+call` gate,
402+passing it both the `card` and its `duct`. This gate must be defined in every vane.
403+It produces two things in the following order: a list of `move`s and a possibly
404+modified copy of its context. The `move`s are used to interact with other vanes,
405+while the new context allows the vane to save its state. The next time Arvo
406+activates the vane it will have this context as its subject.
407+
408+This cycle of `%pass`ing a `note` to `%pass`ing a `task` to `%give`ing a `gift`
409+to `%give`ing a `%sign` is summarized in the following diagram:
410+
411+<div style="text-align:center">
412+<img class="mv5 w-150" src="https://media.urbit.org/docs/arvo/cycle.png">
413+</div>
414+
415+Note that `%pass`ing a `note` doesn't _always_ result in a return - this diagram
416+just
417+shows the complete cycle. However, `%give`ing a `gift` is always in response to being
418+`%pass`ed some `task`. Since the Arvo kernel acts as a middleman between all `move`s in Arvo, in diagrams we will
419+generally represent the intermediate steps of a vane `%pass`ing a `note` to the kernel addressed to
420+another vane followed by the kernel `%pass`ing a `task` to the
421+addressed vane as a single arrow from one vane to the other to make the diagrams
422+less cluttered.
423+
424+This overview has detailed how to pass a `card` to a particular vane. To see the `card`s each vane can be `%pass`ed as a `task` or return as a `gift` (as well as the semantics tied to them), each vane's public interface is explained in detail in its respective overview.
425+
426+#### `ovum`
427+
428+This mold is used to represent both steps and actions.
429+
430+A pair of a `wire` and a `curd`, with a `curd` being like a typeless `card`. The
431+reason for a typeless `card` is that this is the data structure which Arvo uses
432+to communicate with the runtime, and Unix events have no type. Additionally,
433+upgrading the kernel may alter the type system and thus may not be able to be
434+described within the current type system. Then the `wire` here is the default Unix `wire`, namely `//`. In particular, it is not a `duct` because `ovum`s come from the runtime rather than from within Arvo.
435+
436+### Arvo cores
437+
438+`arvo.hoon` has four additional cores that encode the functionality of Arvo. The [larval core](#larval-stage-core), [structural interface core](#structural-interface-core), and [implementation core](#implementation-core) each have five arms, called `+come`, `+load`, `+peek`, `+poke`, and `+wish`. Of these five arms, only `+poke` affects the [Arvo state](#the-state), while the rest leave the state invariant. Thus `+poke` is the aforementioned transition function that sends Arvo from one state to the next.
439+
440+A short summary of the purpose of each these arms are as follows:
441+
442+ - `+poke` is the transition function that `move`s Arvo from one state to the
443+ next. It is the most fundamental arm in the entire system. It is a typed
444+ transactional message that is processed at most once. If the `+poke` causes
445+ Arvo to send an message over [Ames](/docs/arvo/ames/ames) Ames
446+ guarantees that the message will be delivered exactly once. This is sometimes said
447+ to be impossible, and it is for standard operating systems, but that is not the case for single-level stores engaged in
448+ a permanent session, as is the case among Arvo ships.
449+ - `+peek` is an arm used for inspecting things outside of the kernel. It grants
450+ read-only access to `scry` Arvo's global referentially transparent namespace.
451+ It takes in a `path` and returns a `unit (unit)`. If the product is `~`, the
452+ path is unknown and its value cannot be produced synchronously. If its
453+ product is `[~ ~]` the `path` is known to be unbound and can never become
454+ bound. Otherwise the product is a `mark` and a noun.
455+ - `+wish` is a function that takes in a core and then parses and compiles it
456+ with the standard library, `zuse`. It is useful from the outside if you ever
457+ want to run code within. One particular way in which it is used is by the
458+ runtime to read out the version of `zuse` so that it knows if it is
459+ compatible with this particular version of the kernel.
460+ - `+load` is used when upgrading the kernel. It is only ever called by Arvo
461+ itself, never by the runtime. If upgrading to a kernel where types are
462+ compatible, `+load` is used, otherwise `+come` is used.
463+ - `+come` is used when the new kernel has incompatible types, but ultimately
464+ reduces to a series of `+load` calls.
465+
466+ The [Section 3bE core](#section-3be-core) does not follow this pattern.
467+
468+#### Section 3bE core
469+
470+This core defines helper functions that are called in the larval and adult cores. These helper functions are placed here for safety so that they do not have access to the entire [state of Arvo](#the-state), which is contained in the structural interface core. One reason this core is required is that the Arvo interface has only five arms and additional arms are required to perform everything the kernel needs to do in a clean manner, so they must be segregated from the other three cores that stick to the five-arm paradigm.
471+
472+#### Implementation core
473+
474+This core is where the real legwork of the Arvo kernel is performed during the adult stage. It does not communicate with Unix directly, rather it is called by the structural interface core.
475+
476+#### Structural interface core
477+
478+This core could be thought of as the primary "adult core" - the one that is in operation for the majority of its lifecycle and the one that contains the [Arvo state](#the-state). This core should be thought of as an interface - that is, the amount of work the code does here is minimal as its main purpose is to be the core that communicates with Unix, and Unix should not be able to access deeper functions stored in the implementation core and 3bE core on its own. Thus, arms in this core are there primarily to call arms in the implementation core and 3bE core.
479+
480+#### Larval stage core
481+
482+This 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:
483+
484+ + The standard library, `zuse`, is installed.
485+ + Entropy is added
486+ + Identity is added
487+ + Metamorph into the next stage of Arvo
488+
489+Once the larval stage has passed its functionality will never be used again.
490+
491+## The state
492+
493+As we follow functional programming paradigms, the state of Arvo is considered
494+to be the entire Arvo kernel core currently in operation (whether it be the larval
495+stage or adult stage). Thus when `+poke` is performed, a new core with the
496+updated state is produced, rather than modifying the existing core as would be
497+expected to happen in an imperative setting.
498+
499+Thus besides the battery of the Arvo core, we have the [payload](/docs/glossary/payload/) which is as
500+follows.
501+
502+```hoon
503+:: persistent arvo state
504+::
505+=/ pit=vase !>(..is) ::
506+=/ vil=vile (viol p.pit) :: cached reflexives
507+=| $: lac=_& :: laconic bit
508+ eny=@ :: entropy
509+ our=ship :: identity
510+ bud=vase :: %zuse
511+ vanes=(list [label=@tas =vane]) :: modules
512+ == ::
513+```
514+
515+Let's investigate the state piece by piece.
516+
517+```hoon
518+=/ pit=vase !>(..is) ::
519+```
520+This `vase` is part of the state but does not get directly migrated when `+poke`
521+is called. `!>(..is)` consists of the code in `arvo.hoon` written above this core contained in
522+a `vase`. Thus this part of the state changes only when that code changes in an
523+update.
524+
525+```hoon
526+=/ vil=vile (viol p.pit) :: cached reflexives
527+
528+```
529+This is a cache of specific types that are of fundamental importance to Arvo -
530+namely `type`s, `duct`s, `path`s, and `vase`s. This is kept because it is
531+unnecessarily wasteful to recompile these fundamental types on a regular basis.
532+Again, this part of the state is never updated directly by `+poke`.
533+
534+```hoon
535+=| $: lac=_& :: laconic bit
536+ eny=@ :: entropy
537+ our=ship :: identity
538+ bud=vase :: %zuse
539+ vanes=(list [label=@tas =vane]) :: modules
540+ ==
541+```
542+This is where the real state of the Arvo kernel is kept. `lac` detemines whether
543+Arvo's output is verbose, which can be set using the `|verb` command in the
544+dojo. `eny` is the current entropy. `our` is the ship, which is permanently
545+frozen during the larval stage. `bud` is the standard library. Lastly, `vanes`
546+is of course the list of vanes, which have their own internal states.
547+
548+As you can see, the state of Arvo itself is quite simple. Its primary role is that of
549+a traffic cop, and most of the interesting part of the state lies in `vanes`.
550+
551+
552+## Vanes
553+
554+The 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.
555+
556+As described above, we use Arvo proper to route and control the flow of `move`s.
557+However, Arvo proper is rarely directly responsible for processing the event
558+data that directly causes the desired outcome of a `move`. This event data is contained within a `card`. Instead, Arvo proper passes the `card` off to one of its vanes, which each present an interface to clients for a particular well-defined, stable, and general-purpose piece of functionality.
559+
560+As of this writing, we have nine vanes, which each provide the following services:
561+
562+- [Ames](/docs/arvo/ames/ames): the name of both our network and the vane that communicates over it.
563+- [Behn](/docs/arvo/behn/behn): a simple timer.
564+- [Clay](/docs/arvo/clay/clay): our version-controlled, referentially- transparent, and global filesystem.
565+- [Dill](/docs/arvo/dill/dill): a terminal driver. Unix sends keyboard events to `%dill` from the console, and `%dill` produces terminal output.
566+- [Eyre](/docs/arvo/eyre/eyre): an http server. Unix sends http messages to `%eyre`, and `%eyre` produces http messages in response.
567+- [Ford](/docs/arvo/ford/ford): a build system also utilized for marks
568+ (file types) and debugging.
569+- [Gall](/docs/userspace/gall/gall): manages our userspace applications. `%gall` keeps state and manages subscribers.
570+- `Iris`: an http client.
571+- `Jael`: storage for Azimuth information.
572+
573+#### Applying your knowledge
574+
575+Now that you've learned about the nuts and bolts of the Arvo kernel, why not
576+check it out in action? An in-depth "move trace" tutorial for running a timer app
577+is available [here](/docs/arvo/tutorials/move-trace).
content/docs/arvo/tutorials/_index.mdnew file+9
@@ -0,0 +1,9 @@
1++++
2+title = "Tutorials"
3+weight = 200
4+sort_by = "weight"
5+template = "sections/docs/chapters.html"
6+insert_anchor_links = "right"
7++++
8+
9+Tutorials aimed at broadening understanding of Arvo.
content/docs/arvo/tutorials/move-trace.mdnew file+378
@@ -0,0 +1,378 @@
1++++
2+title = "Move Trace"
3+weight = 12
4+template = "doc.html"
5++++
6+
7+In this tutorial we will run a simple "move trace" and use the output to get a
8+picture of what the Arvo kernel proper does during the routine task of setting a
9+timer. Some level of familiarity with the kernel is required for this section,
10+which can be obtained in our [Arvo kernel tutorial](/docs/arvo/overview#the-kernel).
11+
12+## Running a move trace
13+
14+Ultimately, everything that happens in Arvo is reduced to Unix events, and the
15+Arvo kernel acts as a sort of traffic cop for vanes and apps to talk to one
16+another. Here we look at how a simple command, `-time ~s1`, goes from pressing
17+Enter on your keyboard in Dojo towards returning a notification that one second
18+has elapsed.
19+
20+To follow along yourself, boot up a fake `~zod` and enter `|verb` into the dojo
21+and press Enter to enable verbose mode (this is tracked by the laconic bit
22+introduced in the section on [the
23+state](/docs/arvo/overview#the-state)) in the kernel documentation, followed by `-time ~s1`
24+followed by Enter. Your terminal should pretty print a series of `move`s that looks something like this:
25+
26+```
27+["" %unix p=%belt //term/1 ~2020.1.14..19.01.25..7556]
28+["|" %pass [%d %g] [[%deal [~zod ~zod] %hood %poke] /] [i=//term/1 t=~]]
29+["||" %pass [%g %g] [[%deal [~zod ~zod] %dojo %poke] /use/hood/~zod/out/~zod/dojo/drum/phat/~zod/dojo] [i=/d t=~[//term/1]]]
30+["|||" %give %g [%unto %fact] [i=/g/use/hood/~zod/out/~zod/dojo/drum/phat/~zod/dojo t=~[/d //term/1]]]
31+["||||" %give %g [%unto %fact] [i=/d t=~[//term/1]]]
32+["|||||" %give %d %blit [i=//term/1 t=~]]
33+["|||" %pass [%g %f] [%build /use/dojo/~zod/drum/hand] [i=/d t=~[//term/1]]]
34+["||||" %give %f %made [i=/g/use/dojo/~zod/drum/hand t=~[/d //term/1]]]
35+["|||||" %pass [%g %g] [[%deal [~zod ~zod] %spider %watch] /use/dojo/~zod/out/~zod/spider/drum/wool] [i=/d t=~[//term/1]]]
36+["||||||" %give %g [%unto %watch-ack] [i=/g/use/dojo/~zod/out/~zod/spider/drum/wool t=~[/d //term/1]]]
37+["|||||" %pass [%g %g] [[%deal [~zod ~zod] %spider %poke] /use/dojo/~zod/out/~zod/spider/drum/wool] [i=/d t=~[//term/1]]]
38+//term/1]]]
39+["||||||" %pass [%g %f] [%build /use/spider/~zod/find/~.dojo_0v6.210tt.1sme1.ev3qm.qgv2e.a754u] [i=/d t=~[//term/1]]]
40+["|||||||" %give %f %made [i=/g/use/spider/~zod/find/~.dojo_0v6.210tt.1sme1.ev3qm.qgv2e.a754u t=~[/d //term/1]]]
41+["||||||||" %pass [%g %f] [%build /use/spider/~zod/build/~.dojo_0v6.210tt.1sme1.ev3qm.qgv2e.a754u] [i=/d t=~[//term/1]]]
42+["|||||||||" %give %f %made [i=/g/use/spider/~zod/build/~.dojo_0v6.210tt.1sme1.ev3qm.qgv2e.a754u t=~[/d //term/1]]]
43+["||||||||||" %pass [%g %b] [%wait /use/spider/~zod/thread/~.dojo_0v6.210tt.1sme1.ev3qm.qgv2e.a754u/wait/~2020.1.14..19.01.26..7556] [i=/d t=~[//term/1]]]
44+["|||||||||||" %give %b %doze [i=//behn/0v1p.sn2s7 t=~]]
45+> -time ~s1
46+```
47+followed by a pause of one second, then
48+```
49+["" %unix p=%wake //behn ~2020.1.14..19.01.26..755d]
50+["|" %give %b %doze [i=//behn/0v1p.sn2s7 t=~]]
51+["|" %give %b %wake [i=/g/use/spider/~zod/thread/~.dojo_0v6.210tt.1sme1.ev3qm.qgv2e.a754u/wait/~2020.1.14..19.01.26..7556 t=~[/d //term/1]]]
52+["||" %give %g [%unto %fact] [i=/g/use/dojo/~zod/out/~zod/spider/drum/wool t=~[/d //term/1]]]
53+["|||" %give %g [%unto %fact] [i=/g/use/hood/~zod/out/~zod/dojo/drum/phat/~zod/dojo t=~[/d //term/1]]]
54+["||||" %give %g [%unto %fact] [i=/d t=~[//term/1]]]
55+["|||||" %give %d %blit [i=//term/1 t=~]]
56+["||" %give %g [%unto %kick] [i=/g/use/dojo/~zod/out/~zod/spider/drum/wool t=~[/d //term/1]]]
57+~s1..0007
58+```
59+This gives us a move trace that is a list of `move`s and some
60+associated metadata. Some of the `move`s are a bit of a distraction from what's
61+going on overall such as acknowledgements that a `poke` was received
62+(`%poke-ack`s), so we've omitted them for clarity. Furthermore, two `move`s (the
63+`%blit` `card`s) is not printed even in verbose mode because it occurs so
64+frequently, but there are only two of them here and so we have added it in.
65+
66+The main process that is occurring here is a sequence of `%pass` `move`s initiated
67+by pressing Enter in the terminal that goes on to be handled by Dill, then Gall,
68+and finally Behn. After the timer has elapsed, a sequence of `%give` `move`s is
69+begun by Behn, which then passes through Gall and ultimately ends up back at the
70+terminal. Any `move`s besides `%pass` in the first segment of the move trace is a
71+secondary process utilized for book-keeping, spawning processes, interpreting
72+commands, etc. All of this will be explained in detail below.
73+
74+
75+It is important to note that this move trace should be thought of
76+as being from the "point of view" of the kernel - each line represents the
77+kernel taking in a message from one source and passing it along to its
78+destination. It is then processed at that destination (which could be a vane or
79+an app), and the return of that process is sent back to Arvo in the form of
80+another `move` to perform and the loop begins again. Thus this move trace does
81+not display information about what is going on inside of the vane or app such as
82+private function calls, only what the kernel itself sees.
83+
84+## Interpreting the move trace
85+
86+In this section we will go over the move trace line-by-line, explaining how the
87+move trace is printed, what each line means (including some things not found in
88+the move trace), and a particular focus on what code is being activated in the
89+first few lines that should equip you well enough to unravel the rest of the
90+move trace in as much detail as you desire.
91+
92+
93+### The call
94+
95+Let's put the first part of the move trace into a diagram to make following
96+along a little easier.
97+
98+<div style="text-align:center">
99+<img src="https://media.urbit.org/docs/arvo/move-trace-with-key.png">
100+</div>
101+
102+Here, each arrow represents the passing of some information, with most of it
103+being from vane to vane. Here, when Vane A has an arrow to a card and then an
104+arrow to Vane B, this represents either a `%pass` `note/task` sequence or a
105+`%give` `gift/sign` sequence that actually has the Arvo kernel in the middle.
106+That is to say, Vane A `%pass`es a `note` to the Arvo kernel addressed to Vane
107+B, and the Arvo kernel then `%pass`es a `task` to Vane B. For more information,
108+see the [Arvo kernel tutorial](/docs/arvo/overview#the-kernel).
109+
110+This simple action ends up involving four vanes - Dill, Gall, Behn, and Ford -
111+as well as four applications - hood, spider, dojo, and time.
112+
113+Now let's go through each line one by one.
114+```
115+["" %unix p=%belt //term/1 ~2020.1.14..19.01.25..7556]
116+```
117+This tells us that Unix has sent a `%belt` `card`, which corresponds to
118+terminal input (the Enter keystroke) at time `~2020.1.14..19.01.25..7556`
119+
120+Here is the line of code in `arvo.hoon`, found in the [section
121+3bE core](/docs/arvo/overview#section-3be-core), that generated the output:
122+
123+```hoon
124+ ~? !lac ["" %unix -.q.ovo p.ovo now]
125+```
126+First we note that this line is executed only if the laconic bit is set to true,
127+as we did when we input `|verb`. Here, `ovo` is the input `ovum`. Knowing that an `ovum` is a `[p=wire q=curd]`,
128+we can then say that this is a `%unix` `move` tagged with `%belt` whose cause is a `wire` given by `//term/1`,
129+where the empty span `//` represents Unix and `term/1` represents the terminal
130+in Unix. Here we have a `wire` instead of a `duct` (i.e. a list of `wire`s)
131+since Unix I/O events are always the beginning and end of the Arvo event loop,
132+thus only a single `wire` is ever required at this initial stage.
133+
134+The `""` here is a metadatum that keeps track of how many steps deep in the
135+causal chain the event is. An event
136+with `n` `|`'s was caused by the most recent previous event with `n-1` `|`'s. In
137+this case, Unix events are an "original cause" and thus represented by an empty
138+string.
139+
140+At this point in time, Dill has received the `move` and then processes it. The
141+`%belt` `task` in `dill.hoon` is `+call`ed, which is processed using the `+send`
142+arm:
143+
144+```hoon
145+ ++ send :: send action
146+ |= bet/dill-belt
147+ ^+ +>
148+ ?^ tem
149+ +>(tem `[bet u.tem])
150+ (deal / [%poke [%dill-belt -:!>(bet) bet]])
151+```
152+
153+Dill has taken in the command and in response it `%pass`es a `task` `card` with
154+instructions to `%poke` hood, which is a Gall app
155+primarily used for interfacing with Dill. Here, `+deal` is an arm for
156+`%pass`ing a `card` to Gall to ask it to create a `%deal` `task`:
157+
158+
159+```hoon
160+ ++ deal :: pass to %gall
161+ |= [=wire =deal:gall]
162+ (pass wire [%g %deal [our our] ram deal])
163+```
164+
165+Next in our move trace we have this:
166+```
167+["|" %pass [%d %g] [[%deal [~zod ~zod] %hood %poke] /] [i=//term/1 t=~]]
168+```
169+Here, Dill `%pass`es a `task` `card` saying to `%poke` Gall's hood app (with the
170+Enter keystroke).
171+
172+Let's glance at part of the `+jack` arm in `arvo.hoon`, located in the [section 3bE
173+core](/docs/arvo/overview#section-3be-core). This arm is what the Arvo kernel uses to send `card`s,
174+and here we look at the segment that includes `%pass` `move`s.
175+
176+```hoon
177+ ++ jack :: dispatch card
178+ |= [lac=? gum=muse]
179+ ^- [[p=(list ovum) q=(list muse)] _vanes]
180+ ~| %failed-jack
181+ :: =. lac |(lac ?=(?(%g %f) p.gum))
182+ :: =. lac &(lac !?=($b p.gum))
183+ %^ fire
184+ p.gum
185+ s.gum
186+ ?- -.r.gum
187+ $pass
188+ ~? &(!lac !=(%$ p.gum))
189+ :- (runt [s.gum '|'] "")
190+ :^ %pass [p.gum p.q.r.gum]
191+ ?: ?=(?(%deal %deal-gall) +>-.q.q.r.gum)
192+ :- :- +>-.q.q.r.gum
193+ (,[[ship ship] term term] [+>+< +>+>- +>+>+<]:q.q.r.gum)
194+ p.r.gum
195+ [(symp +>-.q.q.r.gum) p.r.gum]
196+ q.gum
197+ [p.q.r.gum ~ [[p.gum p.r.gum] q.gum] q.q.r.gum]
198+```
199+
200+Code for writing traces can be a bit tricky, but let's try not to get too
201+distracted by the lark expressions and such. By paying attention to the lines
202+concerning the laconic bit (following `!lac`) we can mostly determine what is being told to us.
203+
204+From the initial input event, Arvo has generated a `card` that it is now
205+`%pass`ing from Dill (represented by `%d`) to Gall (represented by `%g`). The
206+`card` is a `%deal` `task`, asking Gall to `%poke` hood using data that has
207+originated from the terminal `//term/1`, namely that the Enter key was pressed. The line `:- (runt [s.gum '|'] "")`
208+displays the causal chain length metadatum mentioned above. Lastly, `[~zod ~zod]` tells us that
209+`~zod` is both the sending and receiving ship.
210+
211+From here on our explanations will be more brief. We include some information
212+that cannot be directly read from the move trace in [brackets]. Onto the next line:
213+
214+```
215+["||" %pass [%g %g] [[%deal [~zod ~zod] %dojo %poke] /use/hood/~zod/out/~zod/dojo/drum/phat/~zod/dojo] [i=/d t=~[//term/1]]]
216+```
217+
218+Here is another `%pass` `move`, this time from Gall to iself as denoted by `[%g
219+%g]`. Gall's hood has received the `%deal` `card` from Dill, and in response it is
220+`%poke`ing dojo with the information [that Enter was pressed].
221+
222+```
223+["|||" %give %g [%unto %fact] [i=/g/use/hood/~zod/out/~zod/dojo/drum/phat/~zod/dojo t=~[/d //term/1]]]
224+```
225+
226+Gall's dojo `%give`s a `gift` with a `%fact` (subscription update) to Gall's hood, [saying to clear
227+the terminal prompt].
228+
229+```
230+["||||" %give %g [%unto %fact] [i=/d t=~[//term/1]]]
231+```
232+Gall's hood `%give`s a `gift` with a `%fact` to Dill [saying to replace the current terminal line with `~zod:dojo>`]
233+
234+Next is the `move` that is not actually printed in the move trace mentioned
235+above:
236+
237+```
238+["|||||" %give %d %blit [i=//term/1 t=~]]
239+```
240+
241+Dill `%give`s a `%blit` (terminal output) event to Unix [saying to replace the current terminal line with `~zod:dojo>`].
242+
243+```
244+["|||" %pass [%g %f] [%build /use/dojo/~zod/drum/hand] [i=/d t=~[//term/1]]]
245+```
246+
247+Gall's dojo also `%pass`es a `%build` request to Ford [asking to run "~s1" against the subject we use in the dojo].
248+
249+```
250+["||||" %give %f %made [i=/g/use/dojo/~zod/drum/hand t=~[/d //term/1]]]
251+```
252+
253+Ford `%give`s a result back to dojo [with the value `~s1`]
254+
255+```
256+["|||||" %pass [%g %g] [[%deal [~zod ~zod] %spider %watch] /use/dojo/~zod/out/~zod/spider/drum/wool] [i=/d t=~[//term/1]]]
257+```
258+
259+Gall's dojo `%pass`es a `%watch` to Gall's spider app [to start listening for the result of the thread it's about to start].
260+
261+```
262+["||||||" %give %g [%unto %watch-ack] [i=/g/use/dojo/~zod/out/~zod/spider/drum/wool t=~[/d //term/1]]]
263+```
264+
265+Gall's spider acknowledges the subscription from dojo.
266+
267+```
268+["|||||" %pass [%g %g] [[%deal [~zod ~zod] %spider %poke] /use/dojo/~zod/out/~zod/spider/drum/wool] [i=/d t=~[//term/1]]]
269+```
270+
271+Gall's dojo also `%pass`es a `%poke` to Gall's spider [asking it start the thread "-time" with argument `~s1`].
272+
273+```
274+["||||||" %pass [%g %f] [%build /use/spider/~zod/find/~.dojo_0v6.210tt.1sme1.ev3qm.qgv2e.a754u] [i=/d t=~[//term/1]]]
275+```
276+
277+Gall's spider `%pass`es a `%build` request to Ford [asking it to find the path in `/ted` where the "time" thread is].
278+
279+```
280+["|||||||" %give %f %made [i=/g/use/spider/~zod/find/~.dojo_0v6.210tt.1sme1.ev3qm.qgv2e.a754u t=~[/d //term/1]]]
281+```
282+
283+Ford `%give`s a result back to Gall's spider [saying it's in `/ted/time.hoon`].
284+
285+```
286+["||||||||" %pass [%g %f] [%build /use/spider/~zod/build/~.dojo_0v6.210tt.1sme1.ev3qm.qgv2e.a754u] [i=/d t=~[//term/1]]]
287+```
288+
289+Gall's spider `%pass`es a `%build` request to Ford [asking it to compile the file `/ted/time.hoon`].
290+
291+```
292+["|||||||||" %give %f %made [i=/g/use/spider/~zod/build/~.dojo_0v6.210tt.1sme1.ev3qm.qgv2e.a754u t=~[/d //term/1]]]
293+```
294+
295+Ford `%give`s a result back to Gall's spider [with the compiled thread].
296+
297+```
298+["||||||||||" %pass [%g %b] [%wait /use/spider/~zod/thread/~.dojo_0v6.210tt.1sme1.ev3qm.qgv2e.a754u/wait/~2020.1.14..19.01.26..7556] [i=/d t=~[//term/1]]]
299+```
300+
301+Gall's spider's thread with id `~.dojo_0v6.210tt.1sme1.ev3qm.qgv2e.a754u` asks Behn to set a timer [for one second].
302+
303+```
304+["|||||||||||" %give %b %doze [i=//behn/0v1p.sn2s7 t=~]]
305+```
306+
307+Behn `%give`s a `%doze` `card` to Unix, asking it to set a timer [for one second from
308+now]. At this point Arvo may rest.
309+
310+### The return
311+
312+Now Unix sets a timer for one second, waits one second, and then informs Behn that a second has
313+passed, leading to a chain of `%give` `move`s that ultimately prints
314+`~s1..0007`.
315+
316+Let's throw the move trace into a table:
317+
318+| length | move | vane(s) | card | duct |
319+|--------|---------|---------|-----------------|------------------------------------------------------------------------------------------------------------------|
320+| 0 | `%unix` | | `%wake` | `//behn` |
321+| 1 | `%give` | `%b` | `%doze` | `//behn/0v1p.sn2s7` |
322+| 1 | `%give` | `%b` | `%wake` | `/g/use/spider/~zod/thread/~.dojo_0v6.210tt.1sme1.ev3qm.qgv2e.a754u/wait/~2020.1.14..19.01.26..7556 /d //term/1` |
323+| 2 | `%give` | `%g` | `[%unto %fact]` | `/g/use/dojo/~zod/out/~zod/spider/drum/wool /d //term/1` |
324+| 3 | `%give` | `%g` | `[%unto %fact]` | `/g/use/hood/~zod/out/~zod/dojo/drum/phat/~zod/dojo /d //term/1` |
325+| 4 | `%give` | `%g` | `[%unto %fact]` | `/d //term/1` |
326+| 5 | `%give` | `%d` | `%blit` | `//term/1` |
327+| 2 | `%give` | `%g` | `[%unto %kick]` | `/g/use/dojo/~zod/out/~zod/spider/drum/wool /d //term/1` |
328+
329+Now we follow it line-by-line:
330+
331+```
332+["" %unix p=%wake //behn ~2020.1.14..19.01.26..755d]
333+```
334+
335+Unix sends a `%wake` (timer fire) `card` at time `~2020.1.14..19.01.26..755d`.
336+
337+```
338+["|" %give %b %doze [i=//behn/0v1p.sn2s7 t=~]]
339+```
340+
341+Behn `%give`s a `%doze` `card` to Unix, asking it to set a timer [for whatever next timer it has in its queue].
342+
343+```
344+["|" %give %b %wake [i=/g/use/spider/~zod/thread/~.dojo_0v6.210tt.1sme1.ev3qm.qgv2e.a754u/wait/~2020.1.14..19.01.26..7556 t=~[/d //term/1]]]
345+```
346+
347+Behn `%give`s a `%wake` to Gall's spider's thread with id `~.dojo_0v6.210tt.1sme1.ev3qm.qgv2e.a754u`.
348+
349+```
350+["||" %give %g [%unto %fact] [i=/g/use/dojo/~zod/out/~zod/spider/drum/wool t=~[/d //term/1]]]
351+```
352+
353+Gall's spider `%give`s a `%fact` (subscription update) to dojo [saying that the thread completed successfully and produced value `~s1.0007`].
354+
355+```
356+["|||" %give %g [%unto %fact] [i=/g/use/hood/~zod/out/~zod/dojo/drum/phat/~zod/dojo t=~[/d //term/1]]]
357+```
358+
359+Gall's dojo `%give`s a `%fact` to hood [saying to output `~s1..0007`].
360+
361+```
362+["||||" %give %g [%unto %fact] [i=/d t=~[//term/1]]]
363+```
364+
365+Gall's hood `%give`s a `%fact` to Dill [saying to output `~s1..0007`].
366+
367+```
368+["|||||" %give %d %blit [i=//term/1 t=~]]
369+```
370+
371+Dill `%give`s a `%blit` (terminal output) event to Unix [saying to print a new line with output `~s1..0007`].
372+
373+```
374+["||" %give %g [%unto %kick] [i=/g/use/dojo/~zod/out/~zod/spider/drum/wool t=~[/d //term/1]]]
375+```
376+
377+Gall's spider also closes the subscription from dojo [since the thread has completed].
378+
content/docs/azimuth/_index.mdnew file+22
@@ -0,0 +1,22 @@
1++++
2+title = "Azimuth"
3+weight = 700
4+sort_by = "weight"
5+template = "sections/docs/chapters.html"
6+insert_anchor_links = "right"
7++++
8+
9+
10+## [Azimuth](/docs/azimuth/azimuth)
11+
12+An overview of the Ethereum-based public key infrastructure utilized by Urbit.
13+
14+## [Life and Rift](/docs/azimuth/azimuth)
15+
16+An explanation of how Azimuth keeps track of the most recent set of networking
17+keys necessary to communicate with a ship.
18+
19+## [Advanced Azimuth Tools](/docs/azimuth/advanced-azimuth-tools)
20+
21+Expert-level tooling for generating, signing, and sending Azimuth-related
22+transactions from within Urbit itself.
content/docs/azimuth/advanced-azimuth-tools.mdnew file+68

This diff is too big to show here.

content/docs/azimuth/azimuth.mdnew file+150

This diff is too big to show here.

content/docs/azimuth/life-and-rift.mdnew file+58

This diff is too big to show here.

content/docs/development/_index.mdnew file+33

This diff is too big to show here.

content/docs/development/develop.mdnew file+115

This diff is too big to show here.

content/docs/development/environment.mdnew file+62

This diff is too big to show here.

content/docs/development/grants.mdnew file+84

This diff is too big to show here.

content/docs/development/precepts.mdnew file+336

This diff is too big to show here.

content/docs/development/project-repositories.mdnew file+49

This diff is too big to show here.

content/docs/glossary/_index.mdnew file+10

This diff is too big to show here.

content/docs/glossary/ames.mdnew file+19

This diff is too big to show here.

content/docs/glossary/aqua.mdnew file+16

This diff is too big to show here.

content/docs/glossary/arm.mdnew file+14

This diff is too big to show here.

content/docs/glossary/arvo.mdnew file+40

This diff is too big to show here.

content/docs/glossary/atom.mdnew file+20

This diff is too big to show here.

content/docs/glossary/azimuth.mdnew file+18

This diff is too big to show here.

content/docs/glossary/battery.mdnew file+14

This diff is too big to show here.

content/docs/glossary/behn.mdnew file+14

This diff is too big to show here.

content/docs/glossary/breach.mdnew file+28

This diff is too big to show here.

content/docs/glossary/bridge.mdnew file+32

This diff is too big to show here.

content/docs/glossary/censure.mdnew file+14

This diff is too big to show here.

content/docs/glossary/ceremony.mdnew file+8

This diff is too big to show here.

content/docs/glossary/chat.mdnew file+32

This diff is too big to show here.

content/docs/glossary/claims.mdnew file+21

This diff is too big to show here.

content/docs/glossary/clay.mdnew file+18

This diff is too big to show here.

content/docs/glossary/comet.mdnew file+32

This diff is too big to show here.

content/docs/glossary/core.mdnew file+14

This diff is too big to show here.

content/docs/glossary/delegated-sending.mdnew file+9

This diff is too big to show here.

content/docs/glossary/desk.mdnew file+15

This diff is too big to show here.

content/docs/glossary/dill.mdnew file+22

This diff is too big to show here.

content/docs/glossary/docvote.mdnew file+9

This diff is too big to show here.

content/docs/glossary/dojo.mdnew file+14

This diff is too big to show here.

content/docs/glossary/door.mdnew file+14

This diff is too big to show here.

content/docs/glossary/ecliptic.mdnew file+12

This diff is too big to show here.

content/docs/glossary/eventlog.mdnew file+23

This diff is too big to show here.

content/docs/glossary/eyre.mdnew file+17

This diff is too big to show here.

content/docs/glossary/ford.mdnew file+17

This diff is too big to show here.

content/docs/glossary/galaxy.mdnew file+15

This diff is too big to show here.

content/docs/glossary/gall.mdnew file+17

This diff is too big to show here.

content/docs/glossary/gate.mdnew file+14

This diff is too big to show here.

content/docs/glossary/hdwallet.mdnew file+17

This diff is too big to show here.

content/docs/glossary/hoon.mdnew file+15

This diff is too big to show here.

content/docs/glossary/invite-tree.mdnew file+9

This diff is too big to show here.

content/docs/glossary/iris.mdnew file+11

This diff is too big to show here.

content/docs/glossary/jael.mdnew file+8

This diff is too big to show here.

content/docs/glossary/jaque.mdnew file+15

This diff is too big to show here.

content/docs/glossary/keyfile.mdnew file+15

This diff is too big to show here.

content/docs/glossary/landscape.mdnew file+11

This diff is too big to show here.

content/docs/glossary/mark.mdnew file+17

This diff is too big to show here.

content/docs/glossary/moon.mdnew file+34

This diff is too big to show here.

content/docs/glossary/nock.mdnew file+17

This diff is too big to show here.

content/docs/glossary/noun.mdnew file+15

This diff is too big to show here.

content/docs/glossary/ota-updates.mdnew file+9

This diff is too big to show here.

content/docs/glossary/payload.mdnew file+14

This diff is too big to show here.

content/docs/glossary/ph.mdnew file+9

This diff is too big to show here.

content/docs/glossary/pier.mdnew file+18

This diff is too big to show here.

content/docs/glossary/pill.mdnew file+14

This diff is too big to show here.

content/docs/glossary/planet.mdnew file+15

This diff is too big to show here.

content/docs/glossary/proxies.mdnew file+29

This diff is too big to show here.

content/docs/glossary/replay.mdnew file+13

This diff is too big to show here.

content/docs/glossary/sailudon.mdnew file+13

This diff is too big to show here.

content/docs/glossary/senate.mdnew file+14

This diff is too big to show here.

content/docs/glossary/ship.mdnew file+26

This diff is too big to show here.

content/docs/glossary/shiparvonetwork.mdnew file+9

This diff is too big to show here.

content/docs/glossary/star.mdnew file+17

This diff is too big to show here.

content/docs/glossary/sync.mdnew file+16

This diff is too big to show here.

content/docs/glossary/trap.mdnew file+14

This diff is too big to show here.

content/docs/glossary/upgrade.mdnew file+13

This diff is too big to show here.

content/docs/glossary/vane.mdnew file+24

This diff is too big to show here.

content/docs/glossary/vere.mdnew file+18

This diff is too big to show here.

content/docs/glossary/voting.mdnew file+27

This diff is too big to show here.

content/docs/glossary/wallet-generator.mdnew file+11

This diff is too big to show here.

content/docs/hoon/_index.mdnew file+27

This diff is too big to show here.

content/docs/hoon/guides/_index.mdnew file+13

This diff is too big to show here.

content/docs/hoon/guides/aqua.mdnew file+80

This diff is too big to show here.

content/docs/hoon/guides/cli-tutorial.mdnew file+417

This diff is too big to show here.

content/docs/hoon/guides/parsing.mdnew file+650

This diff is too big to show here.

content/docs/hoon/hoon-school/_index.mdnew file+42

This diff is too big to show here.

content/docs/hoon/hoon-school/ackermann.mdnew file+29

This diff is too big to show here.

content/docs/hoon/hoon-school/arms-and-cores.mdnew file+652

This diff is too big to show here.

content/docs/hoon/hoon-school/atoms-auras-and-simple-cell-types.mdnew file+779

This diff is too big to show here.

content/docs/hoon/hoon-school/bank-account.mdnew file+80

This diff is too big to show here.

content/docs/hoon/hoon-school/behn.mdnew file+110

This diff is too big to show here.

content/docs/hoon/hoon-school/caesar.mdnew file+394

This diff is too big to show here.

content/docs/hoon/hoon-school/conditionals.mdnew file+105

This diff is too big to show here.

content/docs/hoon/hoon-school/doors.mdnew file+516

This diff is too big to show here.

content/docs/hoon/hoon-school/egg-timer.mdnew file+159

This diff is too big to show here.

content/docs/hoon/hoon-school/fibonacci.mdnew file+61

This diff is too big to show here.

content/docs/hoon/hoon-school/gall.mdnew file+129

This diff is too big to show here.

content/docs/hoon/hoon-school/gates.mdnew file+272

This diff is too big to show here.

content/docs/hoon/hoon-school/generators.mdnew file+461

This diff is too big to show here.

content/docs/hoon/hoon-school/hoon-syntax.mdnew file+356

This diff is too big to show here.

content/docs/hoon/hoon-school/iron-polymorphism.mdnew file+88

This diff is too big to show here.

content/docs/hoon/hoon-school/lead-polymorphism.mdnew file+155

This diff is too big to show here.

content/docs/hoon/hoon-school/libraries.mdnew file+191

This diff is too big to show here.

content/docs/hoon/hoon-school/list-of-numbers.mdnew file+132

This diff is too big to show here.

content/docs/hoon/hoon-school/lists.mdnew file+497

This diff is too big to show here.

content/docs/hoon/hoon-school/molds.mdnew file+98

This diff is too big to show here.

content/docs/hoon/hoon-school/nouns.mdnew file+563

This diff is too big to show here.

content/docs/hoon/hoon-school/recursion.mdnew file+195

This diff is too big to show here.

content/docs/hoon/hoon-school/setup.mdnew file+105

This diff is too big to show here.

content/docs/hoon/hoon-school/structures-and-complex-types.mdnew file+356

This diff is too big to show here.

content/docs/hoon/hoon-school/the-subject-and-its-legs.mdnew file+726

This diff is too big to show here.

content/docs/hoon/hoon-school/trees-sets-and-maps.mdnew file+321

This diff is too big to show here.

content/docs/hoon/hoon-school/type-checking-and-type-inference.mdnew file+643

This diff is too big to show here.

content/docs/hoon/hoon-school/type-polymorphism.mdnew file+584

This diff is too big to show here.

content/docs/hoon/overview.mdnew file+276

This diff is too big to show here.

content/docs/hoon/reference/_index.mdnew file+50

This diff is too big to show here.

content/docs/hoon/reference/advanced.mdnew file+206

This diff is too big to show here.

content/docs/hoon/reference/auras.mdnew file+98

This diff is too big to show here.

content/docs/hoon/reference/basic.mdnew file+177

This diff is too big to show here.

content/docs/hoon/reference/cheat-sheet.mdnew file+28

This diff is too big to show here.

content/docs/hoon/reference/hoon-errors.mdnew file+189

This diff is too big to show here.

content/docs/hoon/reference/irregular.mdnew file+257

This diff is too big to show here.

content/docs/hoon/reference/limbs/_index.mdnew file+18

This diff is too big to show here.

content/docs/hoon/reference/limbs/limb.mdnew file+71

This diff is too big to show here.

content/docs/hoon/reference/limbs/wing.mdnew file+44

This diff is too big to show here.

content/docs/hoon/reference/rune/_index.mdnew file+73

This diff is too big to show here.

content/docs/hoon/reference/rune/bar.mdnew file+708

This diff is too big to show here.

content/docs/hoon/reference/rune/buc.mdnew file+606

This diff is too big to show here.

content/docs/hoon/reference/rune/cen.mdnew file+466

This diff is too big to show here.

content/docs/hoon/reference/rune/col.mdnew file+245

This diff is too big to show here.

content/docs/hoon/reference/rune/constants.mdnew file+193

This diff is too big to show here.

content/docs/hoon/reference/rune/dot.mdnew file+223

This diff is too big to show here.

content/docs/hoon/reference/rune/ket.mdnew file+387

This diff is too big to show here.

content/docs/hoon/reference/rune/lus.mdnew file+225

This diff is too big to show here.

content/docs/hoon/reference/rune/mic.mdnew file+462

This diff is too big to show here.

content/docs/hoon/reference/rune/sig.mdnew file+452

This diff is too big to show here.

content/docs/hoon/reference/rune/terminators.mdnew file+78

This diff is too big to show here.

content/docs/hoon/reference/rune/tis.mdnew file+490

This diff is too big to show here.

content/docs/hoon/reference/rune/wut.mdnew file+551

This diff is too big to show here.

content/docs/hoon/reference/rune/zap.mdnew file+239

This diff is too big to show here.

content/docs/hoon/reference/stdlib/1a.mdnew file+680

This diff is too big to show here.

content/docs/hoon/reference/stdlib/1b.mdnew file+273

This diff is too big to show here.

content/docs/hoon/reference/stdlib/1c.mdnew file+459

This diff is too big to show here.

content/docs/hoon/reference/stdlib/2a.mdnew file+449

This diff is too big to show here.

content/docs/hoon/reference/stdlib/2b.mdnew file+1412

This diff is too big to show here.

content/docs/hoon/reference/stdlib/2c.mdnew file+1364

This diff is too big to show here.

content/docs/hoon/reference/stdlib/2d.mdnew file+373

This diff is too big to show here.

content/docs/hoon/reference/stdlib/2e.mdnew file+268

This diff is too big to show here.

content/docs/hoon/reference/stdlib/2f.mdnew file+437

This diff is too big to show here.

content/docs/hoon/reference/stdlib/2g.mdnew file+105

This diff is too big to show here.

content/docs/hoon/reference/stdlib/2h.mdnew file+826

This diff is too big to show here.

content/docs/hoon/reference/stdlib/2i.mdnew file+1133

This diff is too big to show here.

content/docs/hoon/reference/stdlib/2j.mdnew file+269

This diff is too big to show here.

content/docs/hoon/reference/stdlib/2k.mdnew file+400

This diff is too big to show here.

content/docs/hoon/reference/stdlib/2l.mdnew file+108

This diff is too big to show here.

content/docs/hoon/reference/stdlib/2m.mdnew file+308

This diff is too big to show here.

content/docs/hoon/reference/stdlib/2n.mdnew file+427

This diff is too big to show here.

content/docs/hoon/reference/stdlib/2o.mdnew file+187

This diff is too big to show here.

content/docs/hoon/reference/stdlib/2p.mdnew file+242

This diff is too big to show here.

content/docs/hoon/reference/stdlib/2q.mdnew file+375

This diff is too big to show here.

content/docs/hoon/reference/stdlib/3a.mdnew file+859

This diff is too big to show here.

content/docs/hoon/reference/stdlib/3b.mdnew file+5889

This diff is too big to show here.

content/docs/hoon/reference/stdlib/3c.mdnew file+649

This diff is too big to show here.

content/docs/hoon/reference/stdlib/3d.mdnew file+821

This diff is too big to show here.

content/docs/hoon/reference/stdlib/3e.mdnew file+8

This diff is too big to show here.

content/docs/hoon/reference/stdlib/3f.mdnew file+722

This diff is too big to show here.

content/docs/hoon/reference/stdlib/3g.mdnew file+384

This diff is too big to show here.

content/docs/hoon/reference/stdlib/4a.mdnew file+217

This diff is too big to show here.

content/docs/hoon/reference/stdlib/4b.mdnew file+994

This diff is too big to show here.

content/docs/hoon/reference/stdlib/4c.mdnew file+364

This diff is too big to show here.

content/docs/hoon/reference/stdlib/4d.mdnew file+100

This diff is too big to show here.

content/docs/hoon/reference/stdlib/4e.mdnew file+471

This diff is too big to show here.

content/docs/hoon/reference/stdlib/4f.mdnew file+1195

This diff is too big to show here.

content/docs/hoon/reference/stdlib/4g.mdnew file+179

This diff is too big to show here.

content/docs/hoon/reference/stdlib/4h.mdnew file+962

This diff is too big to show here.

content/docs/hoon/reference/stdlib/4i.mdnew file+1054

This diff is too big to show here.

content/docs/hoon/reference/stdlib/4j.mdnew file+1656

This diff is too big to show here.

content/docs/hoon/reference/stdlib/4k.mdnew file+276

This diff is too big to show here.

content/docs/hoon/reference/stdlib/4l.mdnew file+608

This diff is too big to show here.

content/docs/hoon/reference/stdlib/4m.mdnew file+434

This diff is too big to show here.

content/docs/hoon/reference/stdlib/4n.mdnew file+447

This diff is too big to show here.

content/docs/hoon/reference/stdlib/4o.mdnew file+782

This diff is too big to show here.

content/docs/hoon/reference/stdlib/5a.mdnew file+7

This diff is too big to show here.

content/docs/hoon/reference/stdlib/5b.mdnew file+7

This diff is too big to show here.

content/docs/hoon/reference/stdlib/5c.mdnew file+7

This diff is too big to show here.

content/docs/hoon/reference/stdlib/5d.mdnew file+7

This diff is too big to show here.

content/docs/hoon/reference/stdlib/5e.mdnew file+7

This diff is too big to show here.

content/docs/hoon/reference/stdlib/5f.mdnew file+176

This diff is too big to show here.

content/docs/hoon/reference/stdlib/5g.mdnew file+7

This diff is too big to show here.

content/docs/hoon/reference/stdlib/_index.mdnew file+1733

This diff is too big to show here.

content/docs/hoon/reference/stdlib/table-of-contents.mdnew file+1731

This diff is too big to show here.

content/docs/hoon/reference/style.mdnew file+476

This diff is too big to show here.

content/docs/nock/_index.mdnew file+27

This diff is too big to show here.

content/docs/nock/definition.mdnew file+186

This diff is too big to show here.

content/docs/nock/example.mdnew file+362

This diff is too big to show here.

content/docs/nock/explanation.mdnew file+605

This diff is too big to show here.

content/docs/nock/implementations.mdnew file+2322

This diff is too big to show here.

content/docs/system-overview/_index.mdnew file+77

This diff is too big to show here.

content/docs/system-overview/arvo.mdnew file+33

This diff is too big to show here.

content/docs/system-overview/azimuth.mdnew file+34

This diff is too big to show here.

content/docs/system-overview/cryptography.mdnew file+116

This diff is too big to show here.

content/docs/system-overview/hoon.mdnew file+28

This diff is too big to show here.

content/docs/system-overview/nock.mdnew file+34

This diff is too big to show here.

content/docs/system-overview/vere.mdnew file+45

This diff is too big to show here.

content/docs/userspace/_index.mdnew file+30

This diff is too big to show here.

content/docs/userspace/gall/_index.mdnew file+21

This diff is too big to show here.

content/docs/userspace/gall/gall-api.mdnew file+958

This diff is too big to show here.

content/docs/userspace/gall/gall.mdnew file+559

This diff is too big to show here.

content/docs/userspace/gall/tutorial.mdnew file+14

This diff is too big to show here.

content/docs/userspace/graph-store/_index.mdnew file+23

This diff is too big to show here.

content/docs/userspace/graph-store/advanced-info.mdnew file+64

This diff is too big to show here.

content/docs/userspace/graph-store/data-structure-overview.mdnew file+338

This diff is too big to show here.

content/docs/userspace/graph-store/overview.mdnew file+109

This diff is too big to show here.

content/docs/userspace/graph-store/validator-walkthrough.mdnew file+487

This diff is too big to show here.

content/docs/userspace/landscape/_index.mdnew file+18

This diff is too big to show here.

content/docs/userspace/landscape/overview.mdnew file+195

This diff is too big to show here.

content/docs/userspace/landscape/reference/_index.mdnew file+11

This diff is too big to show here.

content/docs/userspace/landscape/reference/graph-store.mdnew file+160

This diff is too big to show here.

content/docs/userspace/overview.mdnew file+19

This diff is too big to show here.

content/docs/userspace/threads/_index.mdnew file+27

This diff is too big to show here.

content/docs/userspace/threads/basics/_index.mdnew file+29

This diff is too big to show here.

content/docs/userspace/threads/basics/bind.mdnew file+97

This diff is too big to show here.

content/docs/userspace/threads/basics/fundamentals.mdnew file+169

This diff is too big to show here.

content/docs/userspace/threads/basics/input.mdnew file+145

This diff is too big to show here.

content/docs/userspace/threads/basics/output.mdnew file+119

This diff is too big to show here.

content/docs/userspace/threads/basics/summary.mdnew file+75

This diff is too big to show here.

content/docs/userspace/threads/examples/_index.mdnew file+33

This diff is too big to show here.

content/docs/userspace/threads/examples/child-thread.mdnew file+237

This diff is too big to show here.

content/docs/userspace/threads/examples/get-json.mdnew file+126

This diff is too big to show here.

content/docs/userspace/threads/examples/main-loop.mdnew file+178

This diff is too big to show here.

content/docs/userspace/threads/examples/poke-agent.mdnew file+60

This diff is too big to show here.

content/docs/userspace/threads/examples/scry.mdnew file+70

This diff is too big to show here.

content/docs/userspace/threads/examples/take-fact.mdnew file+65

This diff is too big to show here.

content/docs/userspace/threads/gall/_index.mdnew file+29

This diff is too big to show here.

content/docs/userspace/threads/gall/poke-thread.mdnew file+116

This diff is too big to show here.

content/docs/userspace/threads/gall/start-thread.mdnew file+145

This diff is too big to show here.

content/docs/userspace/threads/gall/stop-thread.mdnew file+152

This diff is too big to show here.

content/docs/userspace/threads/gall/take-facts.mdnew file+184

This diff is too big to show here.

content/docs/userspace/threads/gall/take-result.mdnew file+132

This diff is too big to show here.

content/docs/userspace/threads/overview.mdnew file+81

This diff is too big to show here.

content/docs/userspace/threads/reference.mdnew file+86

This diff is too big to show here.

content/docs/vere/_index.mdnew file+37

This diff is too big to show here.

content/docs/vere/api.mdnew file+1040

This diff is too big to show here.

content/docs/vere/c.mdnew file+114

This diff is too big to show here.

content/docs/vere/jetting.mdnew file+779

This diff is too big to show here.

content/docs/vere/nouns.mdnew file+477

This diff is too big to show here.

content/docs/vere/runtime.mdnew file+44

This diff is too big to show here.

content/docs/weights.shnew file+23

This diff is too big to show here.

content/events/2017-08-11-after-hours-bootstrapping-urbit-from-the-ethereum-blockchain.mdnew file+19

This diff is too big to show here.

content/events/2017-09-22-after-hours-fun-with-arvo-the-urbit-os.mdnew file+19

This diff is too big to show here.

content/events/2017-10-26-after-hours-designing-robust-human-systems.mdnew file+19

This diff is too big to show here.

content/events/2017-11-16-after-hours-visiting-contributors.mdnew file+17

This diff is too big to show here.

content/events/2018-01-26-urbit-irl-20181.mdnew file+17

This diff is too big to show here.

content/events/2018-02-23-urbit-irl-20182.mdnew file+17

This diff is too big to show here.

content/events/2018-03-11-20183-hoon-school.mdnew file+15

This diff is too big to show here.

content/events/2018-03-23-urbit-irl-20183.mdnew file+17

This diff is too big to show here.

content/events/2018-04-08-20184-hoon-school.mdnew file+15

This diff is too big to show here.

content/events/2018-05-25-urbit-irl-20185.mdnew file+17

This diff is too big to show here.

content/events/2018-08-03-after-hours-decentralized-web-summit.mdnew file+13

This diff is too big to show here.

content/events/2018-08-17-urbit-irl-20188.mdnew file+19

This diff is too big to show here.

content/events/2018-09-21-urbit-irl-20189.mdnew file+17

This diff is too big to show here.

content/events/2018-10-10-urbit-zcash-blockchain-week.mdnew file+23

This diff is too big to show here.

content/events/2018-12-20-after-hours-its-just-a-party-man.mdnew file+17

This diff is too big to show here.

content/events/2019-03-01-after-hours-ask-galen-anything.mdnew file+19

This diff is too big to show here.

content/events/2019-03-08-urbit-irl-austin-tx.mdnew file+15

This diff is too big to show here.

content/events/2019-04-19-urbit-irl-20194.mdnew file+19

This diff is too big to show here.

content/events/2019-05-17-urbit-irl-20195.mdnew file+17

This diff is too big to show here.

content/events/2019-06-21-urbit-irl-20196.mdnew file+17

This diff is too big to show here.

content/events/2019-07-19-urbit-irl-20197.mdnew file+17

This diff is too big to show here.

content/events/2019-08-29-urbit-austin-20198.mdnew file+15

This diff is too big to show here.

content/events/2019-10-04-urbit-irl-201910.mdnew file+17

This diff is too big to show here.

content/events/2019-11-15-urbit-irl-201911.mdnew file+17

This diff is too big to show here.

content/events/2019-12-13-urbit-irl-201912.mdnew file+25

This diff is too big to show here.

content/events/2020-01-24-urbit-irl-20201.mdnew file+19

This diff is too big to show here.

content/events/2020-02-28-urbit-irl-20202.mdnew file+19

This diff is too big to show here.

content/events/2020-04-03-urbit-os1-launch-party.mdnew file+46

This diff is too big to show here.

content/events/2020-10-09-urbit-hosting-launch-event.mdnew file+32

This diff is too big to show here.

content/events/2020-11-05-developer-call-graph-store.mdnew file+18

This diff is too big to show here.

content/events/2020-11-19-developer-call-bittorrent-tracking-on-urbit.mdnew file+18

This diff is too big to show here.

content/events/2020-12-10-developer-call-injecting-external-services-into-urbit.mdnew file+18

This diff is too big to show here.

content/events/2021-02-04-developer-call-architectural-idea-maze.mdnew file+17

This diff is too big to show here.

content/events/2021-03-04-developer-call-scaling-azimuth.mdnew file+22

This diff is too big to show here.

content/events/2021-03-18-developer-call-pressure-and-protolith.mdnew file+19

This diff is too big to show here.

content/events/2021-04-01-developer-call-javascript-apps-on-urbit.mdnew file+20

This diff is too big to show here.

content/events/2021-04-15-developer-call-software-distribution.mdnew file+25

This diff is too big to show here.

content/events/2021-04-27-bitcoin-launch.mdnew file+22

This diff is too big to show here.

content/events/2021-04-29-developer-call-real-time-communications-on-urbit.mdnew file+27

This diff is too big to show here.

content/events/2021-05-13-developer-call-versioned-networking.mdnew file+21

This diff is too big to show here.

content/events/2021-05-27-town-hall.mdnew file+40

This diff is too big to show here.

content/faq.mdnew file+401

This diff is too big to show here.

content/fora.mdnew file+11

This diff is too big to show here.

content/getting-started/_index.mdnew file+84

This diff is too big to show here.

content/getting-started/cli.mdnew file+208

This diff is too big to show here.

content/getting-started/planet.mdnew file+132

This diff is too big to show here.

content/grants/-smol-future-sustained-knowledge-sharing-and-marketing.mdnew file+92

This diff is too big to show here.

content/grants/_index.mdnew file+7

This diff is too big to show here.

content/grants/a-book-about-urbit.mdnew file+85

This diff is too big to show here.

content/grants/a-collaborative-web-mapping-system-for-urbit.mdnew file+99

This diff is too big to show here.

content/grants/analytics-script.mdnew file+53

This diff is too big to show here.

content/grants/antechamber.mdnew file+104

This diff is too big to show here.

content/grants/apprenticeships/_index.mdnew file+4

This diff is too big to show here.

content/grants/art-by-urbit.mdnew file+32

This diff is too big to show here.

content/grants/bart-train-tracker-landscape-tile.mdnew file+50

This diff is too big to show here.

content/grants/bitcoin-full-node-provider-and-wallet.mdnew file+92

This diff is too big to show here.

content/grants/bitcoin-key-derivation.mdnew file+61

This diff is too big to show here.

content/grants/bitcoin-node-json-rpc-api-part-1.mdnew file+48

This diff is too big to show here.

content/grants/bitcoin-node-json-rpc-api-part-2.mdnew file+48

This diff is too big to show here.

content/grants/bitcoin-node-json-rpc-api-part-3.mdnew file+49

This diff is too big to show here.

content/grants/bitcoin-node-json-rpc-api-part-4.mdnew file+48

This diff is too big to show here.

content/grants/bitcoin-wallet-on-bridge.mdnew file+59

This diff is too big to show here.

content/grants/boston-t-train-tracker-landscape-tile.mdnew file+55

This diff is too big to show here.

content/grants/bounties/_index.mdnew file+4

This diff is too big to show here.

content/grants/calendar-ui.mdnew file+53

This diff is too big to show here.

content/grants/calendar.mdnew file+115

This diff is too big to show here.

content/grants/comprehensive-local-server-and-mum-explanation-video.mdnew file+41

This diff is too big to show here.

content/grants/content-saver.mdnew file+45

This diff is too big to show here.

content/grants/cross-platform-desktop-urbit-app.mdnew file+85

This diff is too big to show here.

content/grants/cta-train-tracker-landscape-tile.mdnew file+50

This diff is too big to show here.

content/grants/display-eth-data.mdnew file+56

This diff is too big to show here.

content/grants/docker-image-for-cloud-container-orchestration.mdnew file+46

This diff is too big to show here.

content/grants/educational-guide-todomvc-urbit-edition.mdnew file+331

This diff is too big to show here.

content/grants/escape.mdnew file+46

This diff is too big to show here.

content/grants/ethereum-abi-parser.mdnew file+55

This diff is too big to show here.

content/grants/gall-api-documentation.mdnew file+54

This diff is too big to show here.

content/grants/gifts/_index.mdnew file+4

This diff is too big to show here.

content/grants/go-airlock-library.mdnew file+45

This diff is too big to show here.

content/grants/graph-store-documentation-guide.mdnew file+100

This diff is too big to show here.

content/grants/haskell-airlock-library.mdnew file+45

This diff is too big to show here.

content/grants/hoon-001-learner-efficiency-and-early-learner-resources.mdnew file+81

This diff is too big to show here.

content/grants/host-three-college-university-urbit-meetups-1.mdnew file+60

This diff is too big to show here.

content/grants/host-three-college-university-urbit-meetups-2.mdnew file+60

This diff is too big to show here.

content/grants/host-three-college-university-urbit-meetups-3.mdnew file+59

This diff is too big to show here.

content/grants/host-three-virtual-urbit-meetups.mdnew file+51

This diff is too big to show here.

content/grants/host-two-urbit-meetups-1.mdnew file+55

This diff is too big to show here.

content/grants/host-two-urbit-meetups-10.mdnew file+55

This diff is too big to show here.

content/grants/host-two-urbit-meetups-11.mdnew file+55

This diff is too big to show here.

content/grants/host-two-urbit-meetups-2.mdnew file+55

This diff is too big to show here.

content/grants/host-two-urbit-meetups-3.mdnew file+55

This diff is too big to show here.

content/grants/host-two-urbit-meetups-4.mdnew file+55

This diff is too big to show here.

content/grants/host-two-urbit-meetups-5.mdnew file+55

This diff is too big to show here.

content/grants/host-two-urbit-meetups-6.mdnew file+55

This diff is too big to show here.

content/grants/host-two-urbit-meetups-7.mdnew file+55

This diff is too big to show here.

content/grants/host-two-urbit-meetups-8.mdnew file+55

This diff is too big to show here.

content/grants/host-two-urbit-meetups-9.mdnew file+55

This diff is too big to show here.

content/grants/links-in-urbit-reference-docs.mdnew file+30

This diff is too big to show here.

content/grants/llelogram.mdnew file+56

This diff is too big to show here.

content/grants/matrices-in-hoon.mdnew file+57

This diff is too big to show here.

content/grants/matrixriotim-bridge-bot.mdnew file+39

This diff is too big to show here.

content/grants/minimal-urbit-os.mdnew file+56

This diff is too big to show here.

content/grants/network-explorer-data-pipeline-http-api.mdnew file+229

This diff is too big to show here.

content/grants/open-street-maps-data-importation.mdnew file+53

This diff is too big to show here.

content/grants/overhaul-the-urbitorg-website.mdnew file+73

This diff is too big to show here.

content/grants/proposals/_index.mdnew file+4

This diff is too big to show here.

content/grants/ragnarok-online-on-urbit.mdnew file+54

This diff is too big to show here.

content/grants/search-in-groups.mdnew file+41

This diff is too big to show here.

content/grants/staff-the-urbit-help-desk-1.mdnew file+61

This diff is too big to show here.

content/grants/staff-the-urbit-help-desk-2.mdnew file+61

This diff is too big to show here.

content/grants/staff-the-urbit-helpdesk-east.mdnew file+60

This diff is too big to show here.

content/grants/staff-the-urbit-helpdesk-west.mdnew file+57

This diff is too big to show here.

content/grants/the-complete-guide-to-gall-and-landscape.mdnew file+77

This diff is too big to show here.

content/grants/thread-documentation.mdnew file+75

This diff is too big to show here.

content/grants/tor-nodes-relay-search-tile.mdnew file+47

This diff is too big to show here.

content/grants/translate-key-parts-of-urbitorg-into-german.mdnew file+30

This diff is too big to show here.

content/grants/translate-key-parts-of-urbitorg-into-korean.mdnew file+31

This diff is too big to show here.

content/grants/translate-key-parts-of-urbitorg-into-norwegian.mdnew file+32

This diff is too big to show here.

content/grants/translate-key-parts-of-urbitorg-into-spanish.mdnew file+30

This diff is too big to show here.

content/grants/try-urbit-website.mdnew file+32

This diff is too big to show here.

content/grants/typescript-airlock-library.mdnew file+44

This diff is too big to show here.

content/grants/ua-collaborative-text-editor.mdnew file+27

This diff is too big to show here.

content/grants/ua-filesharer.mdnew file+26

This diff is too big to show here.

content/grants/ua-heads-up-poker.mdnew file+30

This diff is too big to show here.

content/grants/ua-invoice-system.mdnew file+30

This diff is too big to show here.

content/grants/ua-marketplace.mdnew file+34

This diff is too big to show here.

content/grants/ucal-google-and-outlook-integration.mdnew file+84

This diff is too big to show here.

content/grants/udon-syntax-highlighter.mdnew file+43

This diff is too big to show here.

content/grants/unit-tests-for-json-parsing.mdnew file+49

This diff is too big to show here.

content/grants/unit-tests-for-pure-algorithms.mdnew file+61

This diff is too big to show here.

content/grants/unit-tests-for-sha-functions.mdnew file+50

This diff is too big to show here.

content/grants/unit-tests-for-zuse-cryptographic-functions.mdnew file+52

This diff is too big to show here.

content/grants/up-to-date-hoon-reference-card.mdnew file+30

This diff is too big to show here.

content/grants/urbian-a-customized-linux-distribution-for-urbit-appliances.mdnew file+86

This diff is too big to show here.

content/grants/urbit-api-for-elixir.mdnew file+38

This diff is too big to show here.

content/grants/urbit-community-concierge-east-coast-2q2021.mdnew file+35

This diff is too big to show here.

content/grants/urbit-community-concierge-east-coast.mdnew file+34

This diff is too big to show here.

content/grants/urbit-community-concierge-west-coast-2q2021.mdnew file+35

This diff is too big to show here.

content/grants/urbit-community-concierge-west-coast.mdnew file+34

This diff is too big to show here.

content/grants/urbit-event-series.mdnew file+90

This diff is too big to show here.

content/grants/urbit-explainer-video.mdnew file+34

This diff is too big to show here.

content/grants/urbit-http-api-for-emacs-elisp.mdnew file+38

This diff is too big to show here.

content/grants/urbit-http-api-for-kotlin.mdnew file+37

This diff is too big to show here.

content/grants/urbit-http-api-for-rust.mdnew file+56

This diff is too big to show here.

content/grants/urbit-http-interface-java-edition.mdnew file+69

This diff is too big to show here.

content/grants/urbit-http-library-for-ruby.mdnew file+39

This diff is too big to show here.

content/grants/urbit-lfs-filehosting.mdnew file+68

This diff is too big to show here.

content/grants/urbit-online-meetup.mdnew file+30

This diff is too big to show here.

content/grants/urbit-react-cookbook.mdnew file+46

This diff is too big to show here.

content/grants/urbit-ship-and-star-hosting-and-troubleshooting-docs.mdnew file+38

This diff is too big to show here.

content/grants/verifying-urbit-id-on-keybase.mdnew file+75

This diff is too big to show here.

content/grants/video-content-manager.mdnew file+59

This diff is too big to show here.

content/grants/volt-lightning-on-urbit.mdnew file+232

This diff is too big to show here.

content/grants/web-scraper.mdnew file+45

This diff is too big to show here.

content/grants/webrtc-gall-agent-and-external-app.mdnew file+77

This diff is too big to show here.

content/media/_index.mdnew file+7

This diff is too big to show here.

content/media/blockchannel-episode-19-virtual-land-in-the-clouds-with-urbit.mdnew file+12

This diff is too big to show here.

content/media/blueprint-2017-galen-wolfe-pauly-on-the-distributed-web.mdnew file+13

This diff is too big to show here.

content/media/epicenter-episode-205-urbit-a-digital-republic-reinventing-the-internet.mdnew file+13

This diff is too big to show here.

content/media/governing-the-future-e09-urbit-a-user-owned-internet-on-top-of-the-internet.mdnew file+12

This diff is too big to show here.

content/media/lambdaconf-2016-curtis-yarvin-urbit-a-clean-slate-functional-operating-stack.mdnew file+13

This diff is too big to show here.

content/media/lambdaconf-2018-ted-blackman-ford-urbits-build-system.mdnew file+13

This diff is too big to show here.

content/media/on-the-brink-castle-island.mdnew file+14

This diff is too big to show here.

content/media/the-ether-review-46-curtis-yarvin-and-galen-wolfe-pauly-on-urbit.mdnew file+13

This diff is too big to show here.

content/media/urbit-and-the-not-so-dark-future-of-the-internet.mdnew file+10

This diff is too big to show here.

content/media/what-is-urbit.mdnew file+10

This diff is too big to show here.

content/privacy.mdnew file+88

This diff is too big to show here.

content/reset.mdnew file+109

This diff is too big to show here.

content/terms-of-use.mdnew file+70

This diff is too big to show here.

content/understanding-urbit/_index.mdnew file+9

This diff is too big to show here.

content/understanding-urbit/interface.mdnew file+71

This diff is too big to show here.

content/understanding-urbit/people-history.mdnew file+104

This diff is too big to show here.

content/understanding-urbit/roadmap.mdnew file+98

This diff is too big to show here.

content/understanding-urbit/urbit-id.mdnew file+68

This diff is too big to show here.

content/understanding-urbit/urbit-os.mdnew file+58

This diff is too big to show here.

content/updates/2016-10-6-update.mdnew file+263

This diff is too big to show here.

content/updates/2016-5-16-roadmap.mdnew file+244

This diff is too big to show here.

content/updates/2016-7-20-update.mdnew file+159

This diff is too big to show here.

content/updates/2016-8-30-update.mdnew file+267

This diff is too big to show here.

content/updates/2017-1-30-update.mdnew file+344

This diff is too big to show here.

content/updates/2017-10-7-update.mdnew file+16

This diff is too big to show here.

content/updates/2017-11-14-update.mdnew file+218

This diff is too big to show here.

content/updates/2017-12-16-update.mdnew file+29

This diff is too big to show here.

content/updates/2017-12-2-update.mdnew file+75

This diff is too big to show here.

content/updates/2017-12-22-update.mdnew file+32

This diff is too big to show here.

content/updates/2017-3-1-update.mdnew file+107

This diff is too big to show here.

content/updates/2017-4-17-update.mdnew file+157

This diff is too big to show here.

content/updates/2017-5-11-roadmap.mdnew file+233

This diff is too big to show here.

content/updates/2017-8-11-update.mdnew file+110

This diff is too big to show here.

content/updates/2017-9-23-update.mdnew file+24

This diff is too big to show here.

content/updates/2017-9-29-update.mdnew file+16

This diff is too big to show here.

content/updates/2018-1-13-update.mdnew file+27

This diff is too big to show here.

content/updates/2018-1-6-update.mdnew file+37

This diff is too big to show here.

content/updates/2018-10-12-update.mdnew file+61

This diff is too big to show here.

content/updates/2018-10-24-update.mdnew file+39

This diff is too big to show here.

content/updates/2018-11-20-update.mdnew file+54

This diff is too big to show here.

content/updates/2018-11-6-update.mdnew file+46

This diff is too big to show here.

content/updates/2018-12-18-update.mdnew file+58

This diff is too big to show here.

content/updates/2018-2-17-update.mdnew file+36

This diff is too big to show here.

content/updates/2018-2-24-update.mdnew file+31

This diff is too big to show here.

content/updates/2018-2-5-update.mdnew file+26

This diff is too big to show here.

content/updates/2018-2-9-update.mdnew file+40

This diff is too big to show here.

content/updates/2018-3-24-update.mdnew file+56

This diff is too big to show here.

content/updates/2018-3-5-update.mdnew file+31

This diff is too big to show here.

content/updates/2018-4-14-update.mdnew file+56

This diff is too big to show here.

content/updates/2018-4-7-update.mdnew file+40

This diff is too big to show here.

content/updates/2018-5-16-update.mdnew file+50

This diff is too big to show here.

content/updates/2018-5-23-update.mdnew file+64

This diff is too big to show here.

content/updates/2018-5-29-update.mdnew file+16

This diff is too big to show here.

content/updates/2018-5-30-update.mdnew file+77

This diff is too big to show here.

content/updates/2018-6-14-update.mdnew file+70

This diff is too big to show here.

content/updates/2018-6-21-update.mdnew file+60

This diff is too big to show here.

content/updates/2018-6-6-update.mdnew file+80

This diff is too big to show here.

content/updates/2018-7-13-update.mdnew file+66

This diff is too big to show here.

content/updates/2018-7-20-update.mdnew file+58

This diff is too big to show here.

content/updates/2018-7-3-update.mdnew file+66

This diff is too big to show here.

content/updates/2018-7-30-update.mdnew file+64

This diff is too big to show here.

content/updates/2018-8-23-update.mdnew file+84

This diff is too big to show here.

content/updates/2018-8-30-update.mdnew file+56

This diff is too big to show here.

content/updates/2018-8-8-update.mdnew file+58

This diff is too big to show here.

content/updates/2018-9-11-update.mdnew file+60

This diff is too big to show here.

content/updates/2019-11-06-update.mdnew file+40

This diff is too big to show here.

content/updates/2019-12-06-update.mdnew file+43

This diff is too big to show here.

content/updates/2019-2-11-update.mdnew file+37

This diff is too big to show here.

content/updates/2019-2-25-update.mdnew file+33

This diff is too big to show here.

content/updates/2019-2-26-network-update.mdnew file+37

This diff is too big to show here.

content/updates/2019-2-4-update.mdnew file+27

This diff is too big to show here.

content/updates/2019-3-11-update.mdnew file+27

This diff is too big to show here.

content/updates/2019-3-27-update.mdnew file+19

This diff is too big to show here.

content/updates/2019-3-4-update.mdnew file+46

This diff is too big to show here.

content/updates/2019-4-11-update.mdnew file+27

This diff is too big to show here.

content/updates/2019-5-10-update.mdnew file+16

This diff is too big to show here.

content/updates/2019-5-17-update.mdnew file+20

This diff is too big to show here.

content/updates/2019-5-31-update.mdnew file+30

This diff is too big to show here.

content/updates/2019-6-14-update.mdnew file+27

This diff is too big to show here.

content/updates/2019-7-25-update.mdnew file+36

This diff is too big to show here.

content/updates/2020-02-06-update.mdnew file+41

This diff is too big to show here.

content/updates/2020-04-04-update.mdnew file+26

This diff is too big to show here.

content/updates/2020-06-15-update.mdnew file+57

This diff is too big to show here.

content/updates/2020-07-27-update.mdnew file+39

This diff is too big to show here.

content/updates/_index.mdnew file+6

This diff is too big to show here.

content/using/_index.mdnew file+33

This diff is too big to show here.

content/using/id/_index.mdnew file+33

This diff is too big to show here.

content/using/id/bridge-troubleshooting.mdnew file+37

This diff is too big to show here.

content/using/id/creating-an-invite-pool.mdnew file+106

This diff is too big to show here.

content/using/id/guide-to-breaches.mdnew file+84

This diff is too big to show here.

content/using/id/overview.mdnew file+71

This diff is too big to show here.

content/using/id/using-bridge.mdnew file+113

This diff is too big to show here.

content/using/os/_index.mdnew file+36

This diff is too big to show here.

content/using/os/filesystem.mdnew file+397

This diff is too big to show here.

content/using/os/getting-started.mdnew file+337

This diff is too big to show here.

content/using/os/messaging.mdnew file+254

This diff is too big to show here.

content/using/os/s3.mdnew file+34

This diff is too big to show here.

content/using/os/shell.mdnew file+413

This diff is too big to show here.

content/using/os/ship-troubleshooting.mdnew file+213

This diff is too big to show here.

content/using/os/stars-and-galaxies.mdnew file+46

This diff is too big to show here.

content/using/running/_index.mdnew file+16

This diff is too big to show here.

content/using/running/hosting.mdnew file+187

This diff is too big to show here.

content/voting-instructions.mdnew file+36

This diff is too big to show here.

lib/constants.jsnew file+8

This diff is too big to show here.

lib/lib.jsnew file+116

This diff is too big to show here.

next.config.jsnew file+21

This diff is too big to show here.

package-lock.jsonnew file+3591

This diff is too big to show here.

package.jsonnew file+33

This diff is too big to show here.

pages/404.jsnew file+3

This diff is too big to show here.

pages/_app.jsnew file+8

This diff is too big to show here.

pages/api/hello.jsnew file+5

This diff is too big to show here.

pages/blog.jsnew file+78

This diff is too big to show here.

pages/blog/[slug].jsnew file+146

This diff is too big to show here.

pages/docs.jsnew file+69

This diff is too big to show here.

pages/index.jsnew file+229

This diff is too big to show here.

postcss.config.jsnew file+6

This diff is too big to show here.

public/favicon.iconew file

Binary file not shown.

public/vercel.svgnew file+4

This diff is too big to show here.

styles/globals.cssnew file+148

This diff is too big to show here.

styles/markdown.module.cssnew file+77

This diff is too big to show here.

tailwind.config.jsnew file+29

This diff is too big to show here.

yarn.locknew file+1865

This diff is too big to show here.