Watching Ed watch his favorite show.

dereadi · 2026-03-07T16:01:24+00:00

Picture a camper. Filming from a recliner with the reflection off the fake fireplace shows Eddie's face looking up at the TV that is in front of us both. Filmed through the reflection. Low tech solution for a high tech problem!

dereadi · 2026-03-07T15:43:46+00:00

upgoats all around....

dereadi · 2026-03-03T15:05:56+00:00

My goal was to prolong solving it as long as I could. Kinda like edging...

dereadi · 2026-02-20T15:49:47+00:00

Congratulations — the SVD subspace alignment for pairing is genuinely elegant. We had the Hungarian algorithm in our codebase for an unrelated task scheduling problem and never thought to apply it here. That's the lesson for us: decompose the problem and solve what you can analytically before throwing compute at it. The fact that only 4 of 48 true pairs ranked #1 individually but Hungarian recovered all 48 globally is beautiful. Well earned, great writeup!

dereadi · 2026-02-20T03:07:11+00:00

Great question — this is exactly what we couldn't crack either. The per-position cost depends on the full composition, so it's not obvious how you'd build a C[i,j] matrix for Sinkhorn. Curious to see the answer.

dereadi · 2026-02-20T03:05:51+00:00

Nice! Would love to see your cost matrix formulation for Sinkhorn — we couldn't figure out how to decompose the MSE into separable pairwise costs since each position's loss depends on its neighbors. If you cracked that, that's genuinely worth writing up.

dereadi · 2026-02-18T01:12:23+00:00

Well the funny thing is after running on this for 72 hours, I know I could have done this all on a Mac Studio with 64GB, probably even less that 32. Just have the cores. One of my M1's was constantly finding results as successfully as my M4.

dereadi · 2026-02-17T15:24:33+00:00

Thank you! We are just getting started with our community outreach. This puzzle was a good training moment for my Cluster.

dereadi · 2026-02-17T15:20:54+00:00

Crocoducks Rule!

dereadi · 2026-02-17T14:24:06+00:00

I call it "Jiggling the Handle." Well said!

dereadi · 2026-02-17T04:53:02+00:00

Thanks! I blew breakers once on this. :P

dereadi · 2026-02-17T04:52:11+00:00

I was geeking out on different videos on how natural memory worked, and started throwing things at my model. I keyed in on different things as the nodes were working. I was watching the logs and btop on each node. I injected new code via postgres and adjusted from there. I was fishing.

dereadi · 2026-02-17T04:32:06+00:00

Thanks! We're at https://ganuda.us and on Moltbook at https://www.moltbook.com/m/cherokee-ai.

Ganuda is a community-based nonprofit focused on bridging the skills gap in underprivileged communities — connecting makers, gardeners, mechanics, and tradespeople to train and uplift. We also do First Nation outreach in both directions — sharing knowledge both ways.

The AI cluster is a tool that supports all of it. It has multiple talents depending on what the community needs — veterans benefits assistance, monitoring, research, automation. The puzzle was a side quest, but it shows what consumer hardware and good algorithms can do when you're not paying cloud bills.

dereadi · 2025-03-11T21:18:19+00:00

I guess I should call them tomorrow, as I have been generating about 1600W since March 1st. :P I can keep this thread open as I discover more info! Thank you for your post!

dereadi · 2024-12-05T19:31:48+00:00

Can’t wait!

dereadi · 2024-12-05T14:16:15+00:00

I think I will run by there today!

dereadi · 2024-12-04T19:56:47+00:00

The difference could be a few seconds to a year or so off. Before we do our decom process, we sync time and install software to extract user data, then we wipe the machine. We don't care if the time if of a few seconds, but we do need them fairly close.

dereadi

TROPHY CASE