sam-bee

You can install and run Omarchy Quattro on a Pi 5, should the mood take you.

Automatic plant watering system using an Arduino Nano, an aquarium pump, and a capacitive soil moisture sensor.

The n=17 square packing problem is the challenge of fitting 17 unit squares into the smallest possible square container.

This post proposes a new lower bound of 4.4811 on the size of the container.

The proof was written by GPT 5.6 Sol.

It's soldered to the rebar, which is grounded through the actual power cable

Thank you!

Thank you!

I had to wheel the stand into the office on a trolley, I'm not making a laptop case lol

It's an English (UK) keyboard layout

It's very liberating, crafting something for yourself with no intention of selling.

It's an honour just to be nominated <3

If it works, it works

I'm glad to hear you liked the post!

Sure is! It was a lot of fun to make, and I think it ended up with a nice urban decay feel to it

Yeah, getting it into the office was non-trivial!

My laptop has little rubber feet, so it dosn't scratch on its underside. But yes, the piece is solid concrete, so you wouldn't want to bash anything fragile against it.

Yes, I did feel a bit silly buying and using it, but to be fair it did get the bubbles out.

The keyboard in the photo was bought from Amazon in the UK, as "Black Left-Handed Mechanical Keyboard".

I am indeed a right-handed user, which is why I want my mouse within reach on the right.

Thank you!

Felt a little silly doing the work, but to be fair it did get the bubbles out.

That got cropped out of all photos in the interest of taste and decency.

I took it to the office on a little trolley thing

The conduit is a good idea. I'm working on a Raspberry Pi stand in leather and walnut right now. Think I'm going to incorporate that somehow

Nobody who actually codes in that language ever calls it 'Golang'

To be fair, they didn't 'break RSA'. What they did, or claim to have done, is factorised a 22 bit number on a quantum computer. If it had two prime factors, one would have to be below about 2,000. It would have been quicker to do it on a raspberry pi.

The main benefit of the ongoing rollout of post-quantum cryptography in browsers and webservers we're seeing at the moment is not that quantum computers are cryptographically relevant now - they're not. It is to safeguard against the 'store now, decrypt later' threat model, in which an attacker records your internet traffic now, then revisits it later when better codebreaking technology is available. This is why the NIST standards for PQC are being rolled out in TLS 1.3 by various cloud providers, reverse proxies etc. We are at a minimum a decade away from anyone breaking RSA on a quantum computer.