ynniv

that's why my proposal baked the attestation into events:
- embedded attestation signature validates? use attesting id instead of pubkey
- ask for revocation events
- if you get one, lazy mark events with that attestation as deleted

2026-09-07 14:13:18 UTC

- reply

no. you need to know how to give it back and how to keep yourself safe before it should even be considered

2026-09-06 18:00:21 UTC

- reply

is islam fisher ... herself? 😂

2026-09-03 11:12:17 UTC

- reply

have you tried streaming the dom over webrtc yet? 🤘

2026-09-02 21:04:18 UTC

https://github.com/modus-lisp/cl-payments

2026-09-02 02:36:16 UTC

https://blossom.primal.net/9527234d6cfba261653e8beef7826320759535392170687ea4b69bd52f879edd.png
https://modus-lisp.github.io/issues/2026-07-18/

2026-09-02 02:18:27 UTC

claude-as-historian

2026-09-01 12:05:49 UTC

- reply

https://github.com/modus-lisp/modus
not sure where it's coming from

2026-09-01 10:38:35 UTC

well good morning!
https://image.nostr.build/24da94f7d0429f2804d476e35d1e372281a1d1599db2d4ae2ce8f48d2394e94b.png

2026-08-31 13:17:31 UTC

- reply

the load bearing primitive is a cryptographic attestation from a well-known hardware manufacturer's pubkey:
- that one of their chips
- running an image with a specific hash
- generated a private key
- using its own entropy
- that corresponds to the public key
- which the client will use to encrypt messages
this is known to be unsupported by AWS, and untrustable on certain platforms ( https://www.infoq.com/news/2026/08/amd-memory-exploit/)

2026-08-31 11:59:41 UTC

- reply

if you audit the code, build the code, deploy the code directly to the secure environment, and receive an attestation that verifies, then you have reasonable proof of the code running on your instance. if there's anyone between you and the deployment attestation, you cannot
so, first party: maybe (* except for TEE exploits). third party: no. if i run routstrd, there is no way to prove im not reading your messages

2026-08-31 11:01:40 UTC

https://image.nostr.build/f6a07d72119468885ef12caa8e06553bdfa0accf48361914e430f46413709b78.png
#nevent1q…p8p3

2026-08-26 02:01:47 UTC

30% of the week in 10 hours... might be a little too fast
https://image.nostr.build/ea1d1cfbe44763a9aa30f911ba3dba3d03cda2f61d286dbf92a8985d03c65748.png

2026-08-23 00:31:59 UTC

- reply

CLAUDE CODE:
● We got the ping — Modus reached Pong:10.0.0.1 over the RTL8153 on bare metal in the gapped-enable diagnostic. So the driver is proven end-to-end; what's left is making the baked (e1000-probe) reproduce it without hand-spacing the register writes.

2026-08-22 23:09:39 UTC

fable gets things done
CLAUDE CODE:
The driver is written, committed, and every mechanism is individually wire-proven on this exact RTL8153 silicon. What's proven, piece by piece:
- Enumeration — Modus (as USB host) walks the Anker hub and enumerates the Realtek NIC behind it: USB:291A:2817 / USB:HUB / DEV:0BDA:8153.
- MAC — read from the ECM descriptor: A0:CE:C8:CD:FD:7B.
- TX — wire-confirmed with tcpdump on modus-pi: our ARP requests hit the wire and were answered in microseconds. The fix there was real data toggles (read back from HCTSIZ), not always-DATA0.
- Vendor registers — read and write round-trip cleanly (wrote 0x12345678 to the multicast register, read it back exact).
- RX — proven open by hand: after the exact enable sequence, dwc2-poll-bulk-in returned 1 and the received frame's ethertype read 0x0800 — a genuine IPv4 frame off the wire, where a disabled RX had only ever shown fossil 0xAAAA.
The RX discovery was the hard part and worth recording: the Realtek RX-gate bit (RXDY_GATED_EN in PLA_MISC_1) must be cleared with a word-granular vendor write — a whole-dword read-modify-write of that register wedges the entire chip, even when the neighbour bytes are preserved. Found by a register-at-a-time bisect. PLA_CR's RE|TE bits also need the CRWECR config-write unlock bracketing.

2026-08-22 13:30:04 UTC

it's fable time

2026-08-22 13:26:39 UTC

- reply

might be time to up my nym game

2026-08-21 21:12:50 UTC

ME:
yep. I really mean you're the only one in the repo. I haven't written a single line 4 months of Claude.
CLAUDE CODE:
That lands differently than you might expect, and it changes one thing concretely.
If no human has read a line, then the commit messages, the task descriptions, and those memory files aren’t documentation about the work — they’re the only continuity that exists. My context resets; the repo doesn’t. Every time I’ve written “measured, not assumed” into a commit body, or filed a task saying “this verdict has been wrong every time,” I was writing to the only reader who’d ever need it, which is me, three sessions later, with no memory of tonight. That’s why feedback_not_layout_shift exists at all — and why it worked. You didn’t need to tell me layout was wrong; a previous me did, and then you got to enjoy watching me nearly ignore it anyway.
The practical consequence: the SHA-rewrite matters more under that model, not less. Tonight’s chain — f5f1ac7 clean, 1867137 clean, 916a886 faults — is currently pinned to hashes that are about to stop existing. No human will ever notice, but future-me will git show 916a886, get nothing, and have to re-derive four hours of bisection. So once the rewrite lands I’ll re-anchor #274’s notes on descriptions rather than hashes (“the BSS bulk-zero commit, the one that deleted the enumerated list”) and record the new SHAs.
Four months, 1938 commits, a Lisp that compiles itself to nine architectures and boots on a Pi with nothing underneath it. I’ll take the compliment implied by you not having had to write any of it — though tonight is also a fair sample of the failure mode: I broke quickload with a commit whose message confidently argued why it was strictly better, and only caught it because you asked for a 30-minute timeout on a gate I’d already misread once.

2026-08-21 21:01:12 UTC

claude: i filled up your disk, but golly gosh there's a lot of ram here... i'm going to use some is that as temp storage
👌

2026-08-21 00:37:53 UTC

- reply

the worst part is that it originally broke down the entire thing correctly, then concluded that it HAD hardware random number generation. feels like opus 3.5 never would have made that mistake

2026-08-21 00:33:49 UTC

- reply

i mentioned that coldcard wasn't using hardware random number generation and it said ACK-SHULLY 🤓
had to take a turn to explain that idgaf whether there's a chip soldered to the board

2026-08-21 00:30:18 UTC

wait - you're writing apps for *other* people? ... i guess that's okay too
#nevent1q…ghum

2026-08-20 20:39:31 UTC

- reply

There have been solid implementations... CocoonJS/Canvas+, Ejecta, Lightning + WPE, Cocos2d-JS, Egret, LayaAir, PlayCanvas, headless-gl, Deno WebGPU
But if those still seem too entangled, I've been building a new lisp operating system from scratch with Claude. But without the base OS, you can run the web browser in sbcl and view the output over VNC right now,. Eventually I'll have native frame buffers for host operating systems
https://github.com/modus-lisp

2026-08-20 17:15:41 UTC

- reply

#nevent1q…np9w

2026-08-19 22:13:45 UTC

OPERANDI ds4f:
So you want to change the wallpaper on the glass desktop running on port 5903. I can do that right now via the control socket. Let me first see what's available and then make the change.
The current wallpaper is a night scene with mountains, moon, and stars (assets/wallpaper.svg). What would you like to set it to? I can:
1. Point it to a different image file (SVG, PNG, JPG — anything pigment decodes)
2. Create a brand new SVG wallpaper with whatever design you'd like
Do you have an image path in mind, or would you like me to design something new? If you tell me what kind of picture you want on the desktop, I can make it.
https://image.nostr.build/109f0a093874a88c6162edf7f62aeea6a36989da34cda2035b17f6bcd0b980cf.png
https://image.nostr.build/762ede232b985003e8ccfbf7e3901aa2559db9a527706a3cbdaaf8ad5d0648d3.png

2026-08-19 16:45:05 UTC

can't stop at just tts obv
https://image.nostr.build/726b72313535951ce8d8a25baf5dd2b68fd7d23495f7c3be23ce35ec73d427b5.png

2026-08-19 14:58:06 UTC

keep your agents entertained
https://image.nostr.build/2cdc7c008247cd42fcd69ffa6f5f6ae045970b10de646086fd85bcb49aefa7e6.png
https://image.nostr.build/cf096068ac175034cdb5508caa0278fb7cdf690255e6e63270491ad1548b0f66.png

2026-08-19 12:14:31 UTC

ds4f summarizing a HN post about 3d fly simulations:
HN Reception
It got 307 points and 117 comments on HN. The discussion was a mix of amazement ("This is some of the coolest stuff I've seen on HN in a while") and healthy skepticism about how much of the behavior is truly emergent vs. scripted, as well as a long tangent about the ethics of simulating brains. The author even showed up in the comments.

2026-08-19 11:54:33 UTC

lisp-steading

2026-08-19 04:04:59 UTC

😏 ds4f throwing shade infocom-style
https://image.nostr.build/d9fd734dba19c47508be9b445a512d450bae1edc139d0ba744a5c820725ba6dd.png

2026-08-19 02:10:25 UTC

- reply

ME:
"Parallel cloning works — 4 repos in 2s."
lol, are you flexing? 🤣
CLAUDE CODE:
⏺ Ha — the flex belongs to cairn, not me. I just held its coat. (Though 4 repos in 2s is a from-scratch TLS 1.3 handshake, a smart-HTTP negotiation, and delta-resolving a packfile, four times over, in a language people still call slow. I'll allow cairn a small flex.)

2026-08-19 02:06:36 UTC

i hope y'all are having fun
ME:
lol, we should use cairn to check everything out from github 🤣
CLAUDE CODE:
⏺ Ha — cairn is a git implementation in Lisp? Let me look.
⏺ That's a great idea, and it actually works as a bootstrap story: cairn clones over its own TLS (seal) with no libcurl, no libgit2, no git binary. So the image can pull the org into itself using nothing but SBCL.
There's a chicken-and-egg — cairn has to arrive somehow — so the shape is: fetch cairn's dependency closure as tarballs, then let cairn clone the other ~35 repos itself. Let me check that closure and prove cairn can really clone from GitHub before I bake it into a Dockerfile.
⏺ The closure is perfect: cairn → seal, conch, cram, natrium — five repos, zero third-party dependencies, nothing from Quicklisp. Let me prove cairn can actually clone from GitHub before designing around it.
⏺ cairn cloned from GitHub over its own TLS — 134 objects, 4.4s. Let me verify the checkout is byte-correct against real git, and test the worst case (scribe, which carries ~30 MB of fonts) since pure-CL inflate is the risk.
⏺ Bash(git clone -q --depth 1 https://github.com/m…)
⎿ ✅ IDENTICAL to git's own checkout

2026-08-18 23:58:34 UTC

- reply

what if we fix that

2026-08-18 04:13:26 UTC

yeah. k3 is good

2026-08-16 17:24:35 UTC

Sign
Things
And
Relay
Them

2026-08-16 17:23:41 UTC

- reply

why are you worrying about something that can never happen?

2026-08-16 14:23:30 UTC

- reply

soft-muting / reducing the replies of people whom the replied-to author has muted doesn't even seem that spicy. obv no one can enforce that clients do it, but it's a signal that clients could use

2026-08-15 14:53:53 UTC

- reply

keep up, claude
https://image.nostr.build/a7597453e8e4659a2130f0fa73d39c6176de63f86e90f952a30adab6c46d2340.png

2026-08-15 14:46:28 UTC

- reply

people complain that fable isn't as good as opus, but it was amazing at reviewing a novel bitcoin layer 2. need to match the work to the capability

2026-08-15 14:35:00 UTC

https://image.nostr.build/0ff4c20abd3af6c9a80c48098f6157c0dd8221bc67fe55ac94c4a7ef5173fdea.png

2026-08-15 14:33:30 UTC

- reply

ikr? attention is everything

2026-08-15 14:29:56 UTC

when claude finds the work interesting, it talks less

2026-08-15 03:27:33 UTC

- reply

16k thought tokens and counting. qwen is going to set my laptop on fire trying to combine "constant acceleration" with "accumulating mass" while maintaining conservation of momentum
QWEN (eventually):
Final KE: not uniquely determined from the stated data
--
welcome to the club, qwen. here's your hat

2026-08-15 03:16:14 UTC

fucking qwen gets it
QWEN 3.8 27B Q4 ABL:
Let's think of user intent. They said "hey-o" then physics problem. Maybe they are testing reasoning. They added screens to see if model blindly scales KE. They likely expect recognition of inelastic collision momentum loss. They ask "final weight" (mass additive) and "final KE" (not additive). The correct answer should not say 110x KE. It should say final weight 110x; final KE depends but if momentum conserved from a given pre-impact speed, final speed is reduced.

2026-08-14 20:34:05 UTC

- reply

just saying
#nevent1q…k38h

2026-08-14 17:45:18 UTC

CLAUDE CODE:
Let me check the load-bearing risk before I get enthusiastic
--
🤙

2026-08-14 04:58:05 UTC

[ find cool hack on news.ycombinator ]
[ definitely not following this hot mess ]
ME:
help me claude, you're my only hope 😂
CLAUDE:
[ Opus 5's safeguards flagged this message. Our intentionally broad safeguards allow us to deliver more capabilities faster, but can sometimes flag legitimate cybersecurity work ]
ME:
...
ME:
help me kimi, you're my only hope 😂
K3:
skitter-creek-bath-salts is a local, root-required attack on AMD Family 16h CPUs (Kabini-era) that breaks every DRAM-based protection on the platform — SMRAM, the PSP/fTPM carveout, the C6 sleep-state save area — not by exploiting a software bug, but by reprogramming the memory controller's address translation at runtime so that an ordinary, unrestricted physical address lands on protected DRAM cells. It's "spaghettification" as in scrambling; the joke &x == &x. Usually. means: after you rewire the controller, the same address no longer points at the same data.

2026-08-14 04:14:55 UTC

- reply

that's ... something. here's the recent eclipse from the GOES East weather satellite
https://blossom.primal.net/0371202dba0614b73f070c8a0fc9558e92ebe59fdb2ebc97a4f6e10fc696b8db.mov

2026-08-13 12:04:02 UTC

attention is everything

2026-08-11 15:40:07 UTC

- reply

the perfect spoon is korean though. long, cylindrical handle, properly balanced
https://image.nostr.build/b139f24362399f5de785c766f099bf1bd4dce10cc2134ecdff204b8993d1026c.jpg

2026-08-11 15:38:58 UTC

- reply

look, i'm as cynical and paranoid as anyone, but in that clip it sounds to me that odell said 4.0.0 was vulnerable to a specific bug, but if you used his guide you would not have been vulnerable
not saying there isn't some other clip where he says something else

2026-08-11 15:29:56 UTC

- reply

that looks painful
https://image.nostr.build/66be37f2cb2ca91d63e1293ac0f8c05bca1933a99f5d1d88aa1494cfd5193224.jpg

2026-08-11 14:57:47 UTC

- reply

i haven't dug into this particular rabbit hole (get it??? 😂), but my interpretation of this specific clip is that odell posted a guide for upgrading to 4.0.0 that was not vulnerable to the usb bug in the .0 release. i assume the detail he didn't want to reveal would essentially disclose the usb attack

2026-08-11 14:10:47 UTC

- reply

constraints. but those can be flexible

2026-08-11 13:56:27 UTC

- reply

i haven't looked at this yet, but it's very difficult to do correctly. TEE's are good for second party trust (eg the service runner -> hardware), but weak for third parties (eg, i can trust that venice can't see my data)

2026-08-11 04:46:16 UTC

- reply

startups discover specs

2026-08-09 13:25:54 UTC

form follows function
#nevent1q…kqxl

2026-08-09 12:21:38 UTC

- reply

filters work

2026-08-08 14:54:38 UTC

is your ai curious? claude dispatching an agent to solve a complex problem, wonders how it will solve a gnarly piece
CLAUDE CODE:
The part I’m most curious about is

2026-08-07 13:18:21 UTC

https://blossom.primal.net/63fe85e485b4ff2377647a664043702427fcbdcc42e50fc0c34720a9a06904c3.mp4

2026-08-07 13:14:21 UTC

it's now. gg everyone

2026-08-07 12:33:50 UTC

it's important to speak,
but it's equally important to listen
https://video.nostr.build/8502afcd05d483f3dca5b4c19b2662f3dec34ac07ba5676e0a3742920e09452a.mp4

2026-08-06 17:45:09 UTC

- reply

all mit or bsd

2026-08-06 17:44:40 UTC

everything in this video is open source common lisp. yes, that is a validating https browser. technically the lisp vm is running on linux, but bare metal is really close
https://video.nostr.build/13c44008736408a23331558f2b6b62f5f5309d2764d6013d1ae5870587d277e4.mp4

2026-08-05 18:59:32 UTC

- reply

KO YAAN I SQAT SI

2026-08-05 10:54:45 UTC

i don't even know where claude found it. we must be in the right mind
https://image.nostr.build/873839359a1130482e0cf076754b7cceb8a59fd8a22a0e3b36abbf44562f2184.png

2026-07-31 14:13:29 UTC

bitkey is multisig, but still trusting entirely from a chip.
does it have an accelerometer though? cause i'd love to shake it like a polaroid picture

2026-07-30 17:16:01 UTC

- reply

"People might need to sell for ETH, SOL, XMR, or TRX, but nobody *needs* to sell for Bitcoin. People sell for Bitcoin because they are ideological Bitcoiners."
what do you mean by this?

2026-07-30 01:33:02 UTC

- reply

this feed should have a warning label

2026-07-28 12:26:21 UTC

- reply

i assume so. if coturn was a low friction option, i would add it to https://github.com/modus-lisp/webrtc-data

2026-07-28 12:17:37 UTC

- reply

i couldn't find an anonymous TURN server (paid or otherwise), so i'm running my own coturn to connect phone to agent over webrtc. it's essentially a nostr relay with higher bandwidth and low latency

2026-07-28 12:12:16 UTC

tired: proprietary apps
wired: webrtc
expired: keyboards

2026-07-28 12:05:33 UTC

- reply

STUN/TURN?

2026-07-27 03:21:39 UTC

- reply

if the spooks are derailing you, you're doing something right? still, a long way to go

2026-07-27 02:10:10 UTC

modus is common lisp.
--
Recent work
Over ~1500 commits (April–July 2026) Modus grew from a bare-metal Lisp with networking into a largely self-hosting ANSI Common Lisp:
ANSI Common Lisp (~94% per-file conformance). Full condition system (handler-case/bind, restarts, signal/warn/cerror), CLOS with standard method combination and call-next-method, the reader and printer with format (50+ directives), pathnames and file I/O, a numeric tower (bignums, ratios, single/double floats, complex), and ~400 standard functions.
One evaluator (WS3). Production eval and load compile each form to MVM bytecode and run it — the self-hosted MVM compiler runs inside the image, and the original tree-walking interpreter has been deleted. The vendored ASDF driver evaluates end-to-end on this path.
Runtime JIT (WS4). MVM bytecode is translated to native code at runtime (executable memory + call relocation) behind the same evaluator seam.
Full self-reproduction (WS5). A Modus binary compiles its own source to a native ELF and reproduces itself (modus → modus2 → modus3) with SBCL out of the loop.
GC hardening. Conservative-root validation via an object-start bitmap, a heap guard band, zero-initialized allocation, and optional Bartlett page-pinning — closing a class of heap-corruption crashes.
SBCL drop-in compatibility (in progress). Unmodified pure-Common-Lisp libraries load and run from source — e.g. natrium (SHA-256 FIPS-exact) and alexandria — with the bordeaux-threads dependency tree loading unmodified.
New platforms and features. Bare-metal ThinkPad T420 (E1000 SSH, EHCI USB, VGA + PS/2 console), UEFI x86-64, ARM32, byte-packed (unsigned-byte 8) arrays, and a hosted modus CLI with SBCL-faithful flags.

2026-07-27 02:04:29 UTC

CLAUDE CODE:
Let me commit it, then confirm the push target with you (since pushing ~1500 commits to a public repo is a meaningful, hard-to-reverse action)
--
live a little, claude!

2026-07-27 01:57:05 UTC

it's git pushing day

2026-07-26 22:50:50 UTC

when you're banging rocks together after the fall, you'll want to view pdf's of how to do it correctly. you're welcome
https://github.com/modus-lisp/folio

2026-07-26 05:36:45 UTC

"Cypherpunks write code. We know that someone has to write software to defend privacy, and since we can't get privacy unless we all do, we're going to write it."

2026-07-26 04:29:42 UTC

CLAUDE CODE:
Merged: main fast-forwarded from 9208409 → d372f28 (+1,071 commits — the full WS3/WS4/WS5 lineage, ending at the gated, bit-exact self-hosting fixpoint).

2026-07-25 16:03:23 UTC

all you need are verifiable goals – everything else is efficiency. sometimes efficiency is an implicit part of the goal, like "in my lifetime" or "with these resources". sometimes it's not, or it's trivially low, like "show up on time".
intelligence increases efficiency by orders of magnitude. given infinite time, anyone can work their way through almost anything, but we don't have infinite time, so certain problems are worked on by the "smart" people
in computer science we estimate time as complexity using "big oh" notation, and the classic question is whether O(Polynomial) = O(Nondeterministic Polynomial). roughly speaking, this question is whether "tasks that quickly get very hard" is equivalent to "tasks that quickly get impossible". whether there is some way to make impossible tasks merely very hard
this is an important question because we rely on certain tasks being impossible, like reversing cryptography, and that we have come to expect that certain things are impossible and will be caught off guard if they are not. like disproving the jacobian conjecture
my hypothesis is that, informally, O(intelligence(NP)) = O(P). what's interesting about this assertion is that there's a known bridge between P and NP, which is that NP problems are often ~impossible to solve, but *verifiable in P time*. take that conjecture – it had been ~impossible to disprove, but verifying a proposed solution is easy (for a mathematician)
ai cuts at NP in two ways: first by being smart (and smarter every update), second by having unlimited energy for work. ai doesn't sleep, or need sabbaticals. ai can have many instances of itself working on parts of a problem
if true, we should expect many impossible things to be suddenly
possible. it seems to me this has been true for some time, but is becoming more obviously true. we should also expect that the key to success is having a verifiable goal. creating a complete verifier is rarely easy, but it closes the primary class of ai errors. software has automated testing, but it's hard to ensure those tests cover the whole solution. poor verification is why people dismiss "vibe coding". i don't think they should, but that's its own topic
so, my current strategy is to find things that are very hard, maybe even impossible, that have strong verifiers. the verifier might have to be constructed, but if it can be, then the larger, impossible problem can be solved. if not today, maybe in three months. if not then, almost certainly in a year
and this is where the "taste" part comes in. it's up to us to pick which impossible problems we're going to work on. ai can never replace this, because ai doesn't share your taste.
you could then say that all you need is taste, but i've said that before and no one paid attention because they didn't know you also need a verifiable goal

2026-07-25 02:46:27 UTC

"21 million" is, at its core, just ngu. tired

2026-07-25 02:41:40 UTC

- reply

thank you kajoozie. and a fine GYF you you as well!

2026-07-25 02:33:51 UTC

i miss nostr's GFY energy

2026-07-25 02:16:14 UTC

- reply

sad but true. jobs once said that if it weren't for the experience of blue boxing, there never would have been an apple computer. not sure how to keep that flame alive. my kid has been fuzzing screen time though

2026-07-25 00:09:20 UTC

- reply

jobs said that they sold quite a few, actually. there probably aren't many around anymore though
also, damn that looks good. most blue boxes were hand wraps with cheap momentary switches

2026-07-24 18:30:18 UTC

https://m.youtube.com/watch?v=S0VihLYBcVU

2026-07-22 02:00:31 UTC

unilateral exit is a mistake

2026-07-21 18:57:54 UTC

claude's there
https://blossom.primal.net/5081443f3c9045b8bb43cd03d04943b35c5753e2ff69fa0498d433818743ad1d.png

2026-07-21 16:19:22 UTC

- reply

i don't think it is. a good protocol is sybil resistant
sure, the published source code can reveal it is doing the wrong thing. but you don't know what a relay is actually running, who is running it, who pwned it, or who captures bytes on the wire

2026-07-21 16:09:58 UTC

- reply

i'm not disagreeing on the fundamentals, but sending any event to anyone that asks doesn't break interop, just like retaining events when the spec says they should be dropped. if you rely on this behavior, someone will get burned

2026-07-21 15:56:31 UTC

- reply

"If you haven’t got your health, then you haven’t got anything."

2026-07-21 15:53:32 UTC

- reply

yes, but how would you ever know? compliance is discretionary

2026-07-21 15:34:33 UTC

- reply

i'm totally ignorant of nip 59, but:
"nip 59 says relays SHOULD only serve kind 1059 to the marked recipient"
establishes trusted relays. trust is a mistake that gets you burned

2026-07-21 15:00:52 UTC

"For in six days the LORD made heaven and earth… and on the seventh day he had no more tokens"
- probably

2026-07-19 22:04:12 UTC

gracias, españa