Today I Learned

Small things I picked up along the way. Too short for a post, too good to forget.

November 2026

  1. Bosons and Fermions

    So I read a little about quantum computing and somehow ended up learning that every particle in the universe is either a boson or a fermion 😄

    Fermions (electrons, protons, neutrons) have half integer spin and an antisymmetric wave function. Bosons (like photons) have integer spin and a symmetric wave function.

    One thing I found interesting: Helium 4 behaves as a boson because its total spin is 0.

    And then I suddenly remembered an episode from The Big Bang Theory 😄. Turns out those boson vs fermion jokes hit differently when you actually know what they are.

  2. RSA is hard because factoring is hard, Quantum computing changes that!

    Was reading about some quantum computing concepts today and stumbled upon Shor’s Algorithm and Grover’s Algorithm.

    I’ve always been curious about how quantum computing could threaten modern cryptography. Got to know that RSA’s security basically relies on the fact that multiplying two large primes is easy, but finding the original primes from the result is extremely hard. Shor’s Algorithm changes that by making factorization efficient on a quantum computer.

    Grover’s Algorithm was interesting too. It’s like making the “needle in a haystack” search faster, which means brute-forcing things like AES keys becomes more practical.

    Put together, it’s easy to see why Post-Quantum Cryptography (PQC) has become such a big topic.

    Didn’t get time to go deep into either algorithm today, just enough to understand the gist. But it’s fascinating how quantum computing changes what we consider “hard” problems compared to classical computing.

    Worth spending more time on this in the future.

  3. Go maps iterate in random order

    Ranging over a map gives a different order each run. The runtime randomises it on purpose.

    for k, v := range m { fmt.Println(k, v) }