1,532 Photos and videos
proper retweeted
I wrote an essay on what the CENTS Mint Years actually tell you – but most people won’t read an essay. ;-)
So I turned the core of it into something you grasp in one second.
Every CENT detail page now has a mint-year timeline. The trick: each era is sized by how many CENTS actually exist from it – not by calendar spacing. So 1910–1969 (60 years) is a thin sliver, because only 21.25% of the collection is that old.
A marker drops the coin you’re looking at onto the bar. A 1938 lands hard left in the rare zone; a 1981 sits in the wide 1980s block. Rarity you can see, not just read.
7
14
57
1,622
O(1) felt like a full circle moment in getting to work with hashrunner again three years after we debuted his inaugural series ORBinals. i'm honored he'd entrust me to speak about such a monumental work, and the past couple months of constant conversation and iteration on the writing and mechanics were some of the most enjoyable work i've done. we even found time to rip some packs open while letting O(1) breathe this week!
the response and participation were wonderful to see, and so well-deserved. in the end, 186 collectors joined a proof that is now closed permanently, yet will continue to live on within the evm. to everyone who participated, whether that be from afar or as a part of the proof, thank you. and to everyone who read my essay on O(1), thank you. my sincerest congratulations, my friend @hashrunner_
stepping away from my own bitcoin work (which is how hash and i first met!) for this has been refreshing, and these last few weeks have left me in a great frame of mind to get back to it.
more to come there, and more writing soon. 🫡
1
1
23
529
proper retweeted
[ O(1)'s participation window has been closed, and contract ownership renounced ]
one recursive ZK proof, now and forever 186 collectors deep. 14,752 bytes as it always was.
while the proof never grew, its history did. a heartfelt thank you to everyone who reached out, became part of the proof, tweeted... moments like these are a huge part of why i do this <3
O(1).
18
12
74
2,754
the proof is now 170 collectors deep
there is just over an hour left to become a part of it
o1.hashrunner.net/
with less than a day to go, 99 collectors have joined the O(1) proof @hashrunner_
1
11
627
and for those who have joined or are thinking about it, yigit is having a little fun
x.com/YigitDuman/status/2065…
Jun 12
O(1) is one of the most groundbreaking works created recently.
Its creator, @hashrunner_, wanted to keep it conceptually pure and chose not to introduce a token. But EVM is an open canvas, and I couldn’t resist seeing what happens when O(1) gets wrapped.
Introducing Wrapped O(1), an ERC-721 wrapper that lets you exhibit, trade, gift, speculate on, and collect more O(1)s.
🧵
1
11
364
proper retweeted
Jun 13
Hobbyists are like hobbits: they mind their own business and so they're "unimportant" and don't get reckoned in the annals of the great; rare is the wisdom to see that people of private and intense passion have the integrity to produce works of true beauty in the face of despair
3
4
29
942
with less than a day to go, 99 collectors have joined the O(1) proof @hashrunner_
4
3
28
1,605
composability baby!
Jun 12
O(1) is one of the most groundbreaking works created recently.
Its creator, @hashrunner_, wanted to keep it conceptually pure and chose not to introduce a token. But EVM is an open canvas, and I couldn’t resist seeing what happens when O(1) gets wrapped.
Introducing Wrapped O(1), an ERC-721 wrapper that lets you exhibit, trade, gift, speculate on, and collect more O(1)s.
🧵
1
13
701
proper retweeted
Jun 11
[ O(1) is 24h in, with 48h left for anyone to join ]
One recursive ZK proof, now 50 collectors deep. Still 14,752 bytes.
Can you feel succinctness yet, anon?
3
5
27
2,372
proper retweeted
Jun 10
Joined the proof 🔢
To quote @__proper on O(1) by @hashrunner_:
"Zero-knowledge is most often introduced to a general audience as a privacy technology. The properties it actually has reach further than that. Succinctness, the fact that a proof can certify an arbitrarily deep computation at a fixed size and a fixed verification cost, is one of the more strange and consequential properties any cryptographic primitive has produced, and most people will rarely encounter it in a way that lets them feel it."
2
3
14
910
join the proof, anon
1
19
893
many more words on succinctness and the intersection of technical <> philosophical elements of ZK proofs, as found in O(1). worth a read!
Jun 9
O(1): The Proof That Never Grows
ZK proofs carry two major properties. Privacy is one most people are familiar with but the second, succinctness, is far less talked about. A succinct proof can certify an arbitrarily deep computation at a constant size and a constant verification cost, no matter how much history it covers.
O(1) takes that property and treats it as an artistic medium.
1/
2
13
1,089