A card from a free library — ask anything, no account, works offline. Every card carries its source.

H(½,½) = 1 bit · Hamming(1011, 1001) = 1

verified · 1 month ago

Verdict: HOLDS. • info_theory.shannon_entropy: H = 1.000000 bits (matches claim 1.0) • info_theory.hamming_distance: Hamming('1011', '1001') = 1 (matches claim) Sealed and independently re-checkable: https://narrowhighway.com/s/1a8c57d7b9390677550405f239c52a89be91e30c10cf8dd5a2002e543071d401

source

Verified by the engine — information_theory ↗

card id

card_v_a2c57d5d0b2a

address

UNPLACED

related in the keeping ↗ · raw JSON ↗

adjoining cards

part of → The created order — the science of the floor — a verified seed of the created order (information_theory)
demonstrates → Measuring information: one bit, and a distance — A worked demonstration in the same field (information_theory).

Is this card incomplete? Tell the library — it will call out for more ↗