Unseen137 (@XfReePdom) header
Unseen137 (@XfReePdom) profile picture

XRP.RH

Australia
Joined March 2015
Photo by Unseen137 (@XfReePdom)Photo by Unseen137 (@XfReePdom)Photo by Unseen137 (@XfReePdom)Photo by Unseen137 (@XfReePdom)Photo by Unseen137 (@XfReePdom)Photo by Unseen137 (@XfReePdom)Photo by Unseen137 (@XfReePdom)Photo by Unseen137 (@XfReePdom)Photo by Unseen137 (@XfReePdom)Photo by Unseen137 (@XfReePdom)
$POPO will make eth great again.
18
19
56
3,327
Unseen137 retweeted
pew pew pew $popo
7
13
45
942
Unseen137 retweeted
So far $POPO looks great. OG eth v2 launch, just like the old days with $PEPE. Clean bubblemaps, no bundle, community only. Won't be surprised if this will be eth it's first runner in ages.
Not aping memes that often, but aped a bag $POPO . $PEPE was also born during the big btc dumps. Narra is clear. Send it. 0x7b43495c05581bD2D9326Fe9c1c18c62c63Dd2fc
11
14
55
1,597
GM🐢
8
13
53
855
Unseen137 retweeted
My situation right now😂: @Popo_oneth $POPO #POPO
7
6
37
423
The POPOverse is looking promising. 🐢
6
13
1
72
1,039
Please follow the turtle's instructions🐢
13
14
62
850
The AK-47 is in POPO’s DNA
2
9
1
52
915
Unseen137 retweeted
gm hoodrats
17
15
71
1,182
$POPO is trending on X Crypto News today 🐢
22
25
4
85
3,375
Charged for being too hot onchain🐢
9
9
1
63
1,075
Replying to @Aurelius0121
@Aurelius0121 just joined the POPO family 🐢 Welcome aboard! 💚
14
18
4
73
10,571
Unseen137 retweeted
Replying to @JamesWynnReal
We got $POPO too wynn The OG turtle born on 4chan in 2014 as an alternative to Pepe. Over a decade later, POPO is still here, making his mark on Ethereum.
3
7
19
88
The missing piece of the culture is here. $POPO
6
8
48
1,086
Gm🐢
8
14
47
844
unleash the turtles.
8
11
48
743
THE 2018 NOSTALGIA THREAD (WHO REMEMBERS?) By 2018, the world on the outside had forgotten about 4chan's backup mascot. Pepe was everywhere, but Popo was back in the vault, living in the old threads. That was when the "/r9k/ nostalgia" era started, anons posting "who remembers Popo?" threads. Popo didn't care about the fast pace. He sat by his old monitor, next to stacks of old 4chan archives, faded drawing paper, and a camera, looking back on the rough MS Paint sketches that made him. The turtle has armor. He knows the timeline is too fast.
12
15
55
958
Ethereum keeps pushing the boundaries of what's possible. But beyond the technology, its culture, creativity and communities are what make the ecosystem special. POPO is a small piece of that internet culture, finding a home on Ethereum. The future is being built. The culture lives on. 🐢
Over the past few weeks I've gone from thinking leanPCS is total bull to being a total bull. So let me explain some of these buzzwords in more detail. At the core, 8288 is about hyper-scaling data and execution for any computation that needs to get performed on a piece of data once, the chain learns the answer, and then we never need to see that data again. This sounds very specific, but it includes most "heavy" things happening on Ethereum: * Signatures * STARKs * Merkle branches * FHE computation * ... Really the first two are the most important. Once we go quantum-safe, signatures get bigger (65 bytes ECDSA -> 1-6 kB WOTS/SPHINCS depending on params) and ZKPs get much bigger (200-1000 bytes with groth16, PLONK, etc -> 128 kB with STARKs). This is unsustainable to put on chain, and 8288 fixes this. 8288 works by aggregating STARKs in the mempool. First, you as a user generate the STARK or SPHINCS signature or PCS opening (more on that last one later), and publish it. Then, each node listens. Each tick, each node takes all of the new objects that it has seen, and generates a STARK containing a list of "claims": "pubkey P has signed message M" "program X run on data D has output Y" "p(X) = Y for some polynomial P whose hash is H" and a proof that it has seen a signature, STARK or PCS opening verifying those claims. So the only information getting re-broadcasted is: (i) hashes of inputs and outputs (~64-96 bytes per claim) (ii) a single STARK proof per tick These aggregate proofs themselves get re-aggregated, and eventually you get to a single "master proof" in the block, that verifies that all of those statements are true. And so the only other data that has to actually go on chain is the statements (the (P, M), (X, D, Y), (X, Y, H) tuples I described above), not the actual signatures or proofs. This gets put into a specialized frame type. Now, let's get into the leanSPHINCS vs leanSTARK vs leanPCS part. The core distinction is: *what is the underlying object that the user is creating?* In leanSPHINCS, it's a signature, and specifically this particular type of purely-hash-based signature: ethresear.ch/t/sphincs-minus… If we add leanSPHINCS, then users will be able to make quantum-safe accounts, and pay only a little bit of gas (4096 for the 64 bytes) for each signature. So we get scalable quantum-safety for regular accounts, multisigs, etc. But it's only one specific signature scheme, you can't do anything else. In leanSTARK, it's a STARK. This means it's fully general: the user runs whatever computation they want, and publish a STARK of it. So you can use it for: * Any signature scheme (including eg. lattice-based ones if you like those) * A multisig that hides its internal logic * Privacy protocols * Private account abstraction: authorization logic that depends on some value hidden elsewhere in the state, so you can have one key that controls all your accounts without publicly linking them to each other Basically, it's a free for all, in the same way the EVM is a free for all. But leanSTARK has a practical downside. The protocol would have to specify the language in which users write their programs (we call this the "ISA"). So we would have to agree on that language. This is a really big deal - it's the first big case of "Ethereum moving beyond the EVM" - and so it's likely to take time to agree on the details of it, especially since the ISA would be hard to upgrade. There are benefits to taking longer on this, figuring out the ideal ISA, and then even giving access to it inside regular contracts. LeanPCS is the third option. PCS stands for "polynomial commitment scheme": a proof that P(x) = y. The most important thing to know about PCSes is that they are by far the most important "hard" component of a STARK (see here: vitalik.eth.limo/general/202… ). If you have a "magic PCS oracle" (which from the EVM's point of view, 8288 is), you can verify a STARK in ~20-40k gas. The most important gain with PCS is that there is far less that we need to choose. Specifying a PCS only requires specifying a field, and there is a natural option: the 128 bit binary field (technically, we can go more general than that, and say the 2^k-bit binary recursive tower field, going up to 256) LeanPCS is less efficient than leanSTARK onchain, because you would have to put multiple claims to prove one thing. But it's arguably more efficient offchain, because you have much more flexibility to choose proof systems. But most importantly, leanPCS gives you the same generality as leanSTARK, in a way that could potentially be implemented very quickly. And once we figure out the ISA, we can add leanSTARK later. So there is a route to getting "the cryptographic proof singularity" much faster than any of us expected, and that route runs through 8288 with leanPCS. firefly.social/post/x/212092…
7
13
58
963
GM to everyone except the people who still haven't bought $POPO 🐢☕️
10
14
61
987
NOVEMBER 2014. /r9k/ AND 2CHANNEL JOIN THE SUMMONING. When Pepe went mainstream, the basement lost its voice. So, anons went into the server room trenches. The 2014 archives were cracked open. They needed an underdog. A gatekeeper. A turtle with its own armor. A frantic 4chan summoning ritual made of pure rage, bad wifi, and MS Paint. Popo stepped out of the server vault and into the light, holding a rifle and ready for a twelve-year wait. We don't need the normies. The ritual is old.
6
12
49
919