Mike Samuel 🟣

@mvsamuel.bsky.social

Programming languages person focused on software systems problems. Previously, first frontend engineer on Google Calendar, and was a security engineer who worked on the industrial-strength Mad Libs undergirding Gmail. Pro-trans-rights is pro-family.

so instead of bashing fil-C because it could take away attention from rust, what i would want to see would be people starting to think about how to combine the best of both worlds.

Project 2025 is one more step in a RW project that's been baking since the Civil War, not a recent reaction to black people and women pushing for basic rights. There's no perfect time to push for needed change, nor an obligation to wait, and suggesting otherwise is coded language for "uppity."

Elad Nehorai@eladn.bsky.social · 4w ago

Many people, subconsciously or just as often consciously, blame BLM for how we got here. They see the reaction that happened to the movement, as well as to MeToo, and blamed the people calling for justice over the white backlash that always follows those calls. This is a pattern in US history.

As a mathematician, let me just say the term should be "Christian-Judeo." The part you're subtracting out goes *after* the minus sign. ---- (Both christianity and judaism are fine topics in comparative religion but neither should be elevated above other viewpoints in state-approved curricula.)

Texas Tribune@texastribune.org · last mo.

Rabbis and Jewish leaders criticized the biblical passages chosen by the State Board of Education as heavy on Christianity and dismissive of Judaism, reducing the term Judeo-Christian to “a fig leaf at inclusion.”

Cute. Not sure what to make of this. Mistral seems to think I do formal verification; important but not my lane. Deepseek seems to think I worked on V8, but I think all I contributed was answering Robert Griesemer's monotonically exasperated "do JS programmers actually do this?" questions.

[All caps old timey pixelated font showing text (below) above a series of bars for various code models]

Mike Samuel
Google software security engineer

>
590 strength · Top 7%
<
Claude Opus 4.8 says
<
3/10
>
Software engineer known for work on web security, code sanitization, and contributions to projects like Caja, Closure Templates, and JavaScript tooling at Google.

[bars]
GPT-5.5 about 80% full
GPT-5.5 mini about 95% full
Claude opus 4.8 about 80% full
Claude Haiku 4.5 about 75% full
Grok 4.20 about 75% full
Gemini 3.1 Lite about 95% full
Kiwi K2 0905 about 25% full
Deepseek v4 about 95% full
Llama 3.3 70B and 3.2 1B empty
GLM 4.7 flash about 95% full
Mistral 3.2 24B about 80% full
Owen3 8B empty
Bethany Brookshire@beebrookshire.bsky.social · 2mo ago

I saw this site which measures if you are "in the weights" (via @shiplives.bsky.social). At first I thought it measured how much of your work was used to train something, but that's not the case. In this case, it's how much an AI "knows" about you. I scored very high intheweights.com

To better understand our problems, what if we built a giant problem accelerator? Then we could smash our problems together at near light speed and analyze the resulting spray of micro-problems.

A toy example to probe AI code review. Left: a Python to enumerate all rational numbers, and asked Claude to improve it. Right: Its code changes are fine: add types, prefer tuples, use doctest, better string formatting. It just drops all commentary; verbose but important for maintainability.

# output truncated due to character limits
# complete code: gist.github.com/mikesamuel/cb3de64fbcd5e699dfc85020de62b126

from math import gcd

def rationals():
    """
    Enumerates rational numbers as [numerator, denominator] pairs
    in simplest form but not in order.
    """

    yield [0, 1]
    # Now we have enumerated all values that have neither
    # a reciprocal nor a distinct negative.

    # From now on, we will only enumerate adjacent positive
    # negative pairs, so we will not miss a rational but
    # yield its negation.

    yield [-1, 1]
    yield [1, 1]
    # Now we have enumerated all values that lack a distinct
    # reciprocal so from now on, when we enumerate a value
    # we will also enumerate its reciprocal.
    # This means we will neither miss a value in (-1, 1)
    # but emit one in (-inf, -1) or in (1, inf); nor vice versa.
    # The convention here where numerator is signed or zero
    # and denominator is in [1, inf] is followed below, so
    # there will be no redundant outputs due to signs on the denominator.

    denominator = 1
    # We have yielded all rationals with denominator up to and including 1
    while True:
        denominator += 1
        # Python has bigint semantics so no risk of overflow
        # First time here, denominator is 2, so we're not repeating
        # anything above, and we step by one, so we will eventually
        # reach here for every denominator in a rational in (0, 1)
        for numerator in range(1, denominator):
            if gcd(numerator, denominator) == 1:
                # (numerator / denominator) is in simplest form
                # 4 yields for all combinations of negation/reciprocal
                yield [-numerator, denominator]
                yield [numerator, denominator]
                yield [-denominator, numerator]
                yield [denominator, numerator]
    # Because of the gcd check above, we will not output redundant ...
[screenshot of code with python in grey top left and a copy icon top right]

from math import gcd
from collections.abc import Generator

def rationals() -> Generator[tuple[int, int], None, None]:
    """
    Enumerates all rational numbers as (numerator, denominator) tuples
    in simplest form. Numerator is signed; denominator is always positive.
    Every rational is yielded exactly once, though not in numeric order.
    """
    yield (0, 1)
    yield (-1, 1)
    yield (1, 1)

    denominator = 1
    while True:
        denominator += 1
        for numerator in range(1, denominator):
            if gcd(numerator, denominator) == 1:
                yield (-numerator, denominator)
                yield (numerator, denominator)
                yield (-denominator, numerator)
                yield (denominator, numerator)


if __name__ == "__main__":
    from itertools import islice
    for n, d in islice(rationals(), 200):
        print(f"{n:+d}/{d}")

This is important because if we approach the problem as one of misinformation rather than racism, we’re going to spend a lot of time debunking things they’re not actually concerned about, rather than addressing the racism and protecting the targets of it.