Yep. Seems to be real:
Donβt Panic, βWordleβ Hasnβt Run Out Of Five-Letter Words Just Yet share.google/5ApzE0CLR2Nh...
@clairexen.bsky.social
Neurodiverse Trans Geek Girl π§ββοΈ Queer Kinky Poly Mess π³οΈβπ π³οΈββ§οΈ CTO @YosysHQ πΊ RISC-V, SMT π©βπ» Opinions are my Ceti eel's π ACAB BLM β I am Antifa π΄π© Vienna, Austria π she/her π§ββοΈ
Yep. Seems to be real:
Donβt Panic, βWordleβ Hasnβt Run Out Of Five-Letter Words Just Yet share.google/5ApzE0CLR2Nh...
That was a repeat of the very first word
02.02.2026 16:57 β π 0 π 0 π¬ 1 π 0
Wordle 1,689 3/6*
π¨π¨π¨π¨β¬
π©π¨π¨π¨β¬
π©π©π©π©π©
... Oh wow. Did we just reach "the end of wordle"? π€
Wordle 1,651 2/6*
β¬β¬π©β¬π©
π©π©π©π©π©
πππππ
Wordle 1,642 X/6*
π¨β¬π©β¬π¨
π©π©π©β¬π©
π©π©π©β¬π©
π©π©π©β¬π©
π©π©π©β¬π©
π©π©π©β¬π©
Hahaha πππ
Wordle 1,641 4/6*
β¬β¬β¬π¨π¨
β¬π©β¬π¨β¬
π©π©β¬π©β¬
π©π©π©π©π©
That. Was. So. F*ing. Hard.
Wordle 1,576 5/6*
β¬π©π©π©π©
β¬π©π©π©π©
β¬π©π©π©π©
β¬π©π©π©π©
π©π©π©π©π©
Hahaha. Crazy...
Slide from Hot Chips 2025: "2025 TCMM Open Source Hardware Contribution Award: Claire Wolf: In recognition of outstanding contributions to RISC-V β including BitManip, RVFI, and PicoRV32βand to open-source tools like Yosys and IceStorm. [IEEE Computer Society TCMM / Technical Community on Microprocessors and Microcomputers]"
Congratulations @clairexen.bsky.social: #HotChips / IEEE TCMM 2025 Open Source Hardware Contribution Award
27.08.2025 01:33 β π 31 π 11 π¬ 2 π 1
Wordle 1,529 4/6*
π©β¬β¬π©β¬
π©β¬β¬π©β¬
π©β¬β¬π©β¬
π©π©π©π©π©
Wordle 1,518 3/6*
β¬β¬β¬β¬π¨
β¬π©β¬β¬β¬
π©π©π©π©π©
Wordle 1,517 6/6*
β¬π¨β¬π¨β¬
π¨β¬β¬β¬π¨
β¬π¨π¨π©β¬
β¬β¬π©π©π©
β¬β¬π©π©π©
π©π©π©π©π©
Ok. Wow. Uff. That was pretty exciting. I'm starting to think they are running out of good words..
Wordle 1,515 4/6*
β¬β¬β¬π©π©
β¬β¬β¬π©π©
π¨π©π¨π©π©
π©π©π©π©π©
Posting this for my 3rd guess π
So if you are currently involved with ISA-level decisions about inclusion of any pext/pdep-like instructions:
Please consider including SAG/inverse-SAG with bit-reversal of the goats.
No matter which of the two implementation methods you are using: All you need to do is not mask the goat bits.
So if you are currently involved with ISA-level decisions about inclusion of any pext/pdep-like instructions:
Please consider including SAG/inverse-SAG with bit-reversal of the goats.
No matter which of the two implementation methods you are using: All you need to do is not mask the goat bits.
At some point that patent will expire, and until then there's my implementation.
(And I think my approach will still stay relevant after, because it makes it very simple to build multi-cycle SAG cores.)
I think the really important takeaway is that they, my method and theirs, are both functionally the same, i.e. they both implement an SAG with bit-reversal of the goats.
This means, as far as the ISA is concerned, it's a safe decision to include an SAG instruction.
Wordle 1,498 4/6*
π¨β¬β¬β¬β¬
β¬π©π¨β¬π¨
π©π©β¬β¬π©
π©π©π©π©π©
... back to normal ^__^
Nah! No luck. π I was unsure which of the 4 options I could come up with to pick, and as it turned out, it was none of them... π
But I'm still at 99% and that's all that really matters to me. (But tbh, it does matter to me way more than it probably should..)
Wordle 1,497 X/6*
β¬β¬π¨π©β¬
β¬π©β¬π©π©
β¬π©β¬π©π©
β¬π©β¬π©π©
β¬π©β¬π©π©
... Wahhh! I have ~23 hours to decide on a last guess... /o\
Here is the code:
github.com/clairexen/ed...
I can't see any obvious reason why that identity should not extend beyond 8-bit units. But I have not actually tested that hypothesis yet.
I have to make a correction regarding βοΈ. I've now implemented the Hilewitz-Lee method as well in my edu-sag repository. And it implements the bit-reflecting-SAG as-is. All you have to do is to remove the '&ci' from the data input, thus it's always more area to implement PEXT than bit-reflecting-SAG.
24.07.2025 12:38 β π 1 π 1 π¬ 1 π 0
Here is the code:
github.com/clairexen/ed...
I can't see any obvious reason why that identity should not extend beyond 8-bit units. But I have not actually tested that hypothesis yet.
I have to make a correction regarding βοΈ. I've now implemented the Hilewitz-Lee method as well in my edu-sag repository. And it implements the bit-reflecting-SAG as-is. All you have to do is to remove the '&ci' from the data input, thus it's always more area to implement PEXT than bit-reflecting-SAG.
24.07.2025 12:38 β π 1 π 1 π¬ 1 π 0
Wordle 1,483 4/6*
π©β¬π©β¬β¬
π©β¬π©π¨π©
π©π©π©β¬π©
π©π©π©π©π©
Wordle 1,482 6/6*
β¬β¬β¬β¬β¬
β¬β¬β¬β¬β¬
β¬β¬π©π©π©
β¬π©π©π©π©
β¬π©π©π©π©
π©π©π©π©π©
.. that was a bit unusual.
but I still got it in the end ^__^
Wordle 1,474 4/6*
β¬π¨β¬π¨β¬
π¨π¨π¨β¬β¬
π©π©β¬π¨β¬
π©π©π©π©π©
Wordle 1,473 3/6*
β¬β¬β¬π¨β¬
π©π©β¬π¨π¨
π©π©π©π©π©
Wordle 1,462 5/6*
β¬β¬π©β¬β¬
β¬β¬π©β¬π©
β¬β¬π©π¨π©
β¬π¨π©π©π©
π©π©π©π©π©
I wrote a reference implementation for a SAG without bit reflection: github.com/clairexen/ed..., and I wrote a parametric SAG core for any bit width: github.com/clairexen/ed...
20.06.2025 16:04 β π 1 π 2 π¬ 0 π 0I wrote a reference implementation for a SAG without bit reflection: github.com/clairexen/ed..., and I wrote a parametric SAG core for any bit width: github.com/clairexen/ed...
20.06.2025 16:04 β π 1 π 2 π¬ 0 π 0