LSB using python, naive implementation vs bitwise black magic.

lsb.py

flags_bytes = ["00000000", "00000001", "00000110", "00000011", "01001100", "10001000"]
flags = [0, 1, 6, 3, 76, 136]
lsb_expected = [0, 1, 2, 1, 4, 8]


def naive_lsb(num):
    for i, bit in enumerate(bin(num)[2:][::-1]):
        if int(bit) == 1:
            return 2**i

    return 0


def proper_lsb(num):
    return num & -num


naive_result = [naive_lsb(lb) for lb in flags]
assert lsb_expected == naive_result, f"{lsb_expected} !== {naive_result}"


proper_result = [proper_lsb(lb) for lb in flags]
assert lsb_expected == proper_result, f"{lsb_expected} !== {proper_result}"