Arbcap tokens are digital collectibles tied to the oldest trees on Earth. Each tree can only be claimed once. When a tree dies, its token dies with it.
Every asset is a consensus. Gold. Currency. Land. This one is simple: old-growth trees are worth protecting, and scarcity is real.
The entire Mediterranean basin was forested. Gilgamesh walked through cedar forests in what is now arid Turkey. The cedars of Lebanon built Solomon’s Temple. All gone. Not because ancient peoples were evil, but because when someone needed wood more than the tree, self-interest won. We have tried governments, regulations, NGOs, corporations, and culture. They all fail on long enough timescales. We have never tried making trees too expensive to cut down.
Every arbcap token is tied to a real tree. Free to claim. Free to hold. If the tree dies — fire, disease, logging — the token freezes. Permanently. Non-transferable. Gone. That risk is the entire point.
what if it does? ↗There is no payout when a tree dies. No insurance. No recovery. The only way to protect your position is to protect the tree. Your incentive and the tree’s survival are the same thing.
Only old-growth trees qualify — 250 years or older. They aren’t being made anymore. Every death reduces the supply permanently. The math only goes one direction.
why is that valuable? ↗The token references a GPS coordinate — like a trading card with a number on it. No landowner approval. No government partnership. No NGO. Observable reality, on-chain.
really? ↗Claiming a token costs nothing. Holding it costs nothing. It sits in your wallet like Bitcoin — forever. The only protocol cost is a small ETH fee when a token changes hands, and that fee funds tree verification. You don’t pay to keep your tree. You only pay to sell it. And even then, it’s the buyer who pays.
how does that fund verification? ↗Click any tree to generate its ARES fingerprint ↓
Explore all 11 trees on the globe → /globeThe Arboreal Root Encoding System generates a unique visual fingerprint for every tree on Earth. Enter any coordinate and the algorithm deterministically produces a root network. Same coordinates, same art, every time.
This is a proof of concept, not a finished product. Here’s what we’ve designed, what we’ve proposed, and where we want collaborators.
Three-layer architecture: satellite monitoring, holder self-verification, and emergent app ecosystem. Alive-until-proven-dead default. Technology exists commercially today.
Research Note 005: The Verification Problem →Implemented in contract: ERC-721 _update reverts transfers of dead trees. One-way, irreversible. Token exists as memorial but never trades again.
Read Research Note 002: The Death Profit Paradox →“Tagging equals mining.” Submit coordinates of unregistered old-growth. If verified, tagger gets first token. Gold rush dynamics bootstrap the registry.
Read Research Note 003: The Gold Rush →Transfer fees fund the verification pool. Same model as Bitcoin: transaction fees fund the work that secures the network. No annual fees. No mandatory payments. The system breathes with demand.
Research Note 006: The Funding Problem →how does that work? ↗Kleros-style decentralized arbitration for edge cases. Key constraint: no party profits from a death ruling. Dispute stakers forfeit if they report falsely. The incentive architecture mirrors the core mechanism.
Read Research Note 004: The Arbitration Problem →A collectible. A trading card with coordinates. You can’t cut the tree down with it, can’t fence it off. It references observable reality — no different from writing a latitude on a napkin and selling the napkin. It’s a Pokémon card with a number on it.
Read Research Note 001: The Permissionless Instrument →Gomboc engineering framework applied: self-righting through incentive geometry, not governance. Immutable invariant layer, thin adaptive layer, phase-dependent weeble characteristics with one-way exit conditions.
Research Note 007: The Hundred-Year Problem →Know an old-growth tree that deserves protection? Submit its coordinates. When minting opens, claimed trees go first.