{"query": "Computer science — bits, logic, and what can be computed", "count": 20, "results": [{"id": "card_floor_computer_science", "title": "Computer science — bits, logic, and what can be computed", "shelf": "codex", "surface": "secular", "snippet": "Information is bits (a byte is 2^8 = 256 values); logic gates build from the 16 Boolean functions of two inputs; good algorithms beat bad ones (merge sort's n log n against n^2); and computability and", "authority_tier": "engine_derived", "source": "Narrow Highway — computer science", "readable": false, "generated": false}, {"id": "card_theory_digital_analog", "title": "Digital versus analog (why discreteness survives copying)", "shelf": "theories", "surface": "secular", "snippet": "Digital versus analog (why discreteness survives copying) — an engine domain that can touch it: computer_science. Calibration: map-only — sampling rates and bit depth are ordinary arithmetic, and THIS", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "readable": false, "generated": false}, {"id": "card_theory_network_theory", "title": "Network theory (routing, addressing / CIDR)", "shelf": "theories", "surface": "secular", "snippet": "Network theory (routing, addressing / CIDR) — an engine domain that can touch it: networking. Calibration: seals — subnet masks, address ranges and prefix matches compute exactly. An IP address is spl", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "readable": false, "generated": false}, {"id": "card_theory_quantum_information___entanglement__von_neumann_entr", "title": "Quantum information & entanglement (von Neumann entropy)", "shelf": "theories", "surface": "secular", "snippet": "Quantum information & entanglement (von Neumann entropy) — an engine domain that can touch it: information_theory. Calibration: seals. S = -Tr(ρ log ρ), the entropy of a density matrix, which reduces ", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "readable": false, "generated": false}, {"id": "card_theory_discrete_vs_continuous", "title": "Discrete versus continuous (the oldest dividing line)", "shelf": "theories", "surface": "secular", "snippet": "Discrete versus continuous (the oldest dividing line) — an engine domain that can touch it: number_theory. Calibration: map-only — a foundational distinction; specific cardinality results compute. Som", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "readable": false, "generated": false}, {"id": "card_theory_shannon_information_theory", "title": "Shannon information theory (entropy, channel capacity)", "shelf": "theories", "surface": "secular", "snippet": "Shannon information theory (entropy, channel capacity) — an engine domain that can touch it: information_theory. Calibration: seals. H = -Σ p log p. Information is measured by how much UNCERTAINTY a m", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "readable": false, "generated": false}, {"id": "card_theory_double_entry_accounting_identity", "title": "Double-entry accounting identity (A = L + E)", "shelf": "theories", "surface": "secular", "snippet": "Double-entry accounting identity (A = L + E) — an engine domain that can touch it: finance. Calibration: seals — the identity is checkable to the penny. Assets equal Liabilities plus Equity. Every tra", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "readable": false, "generated": false}, {"id": "card_theory_landauer", "title": "Landauer's principle (erasing information costs heat)", "shelf": "theories", "surface": "secular", "snippet": "Landauer's principle (erasing information costs heat) — an engine domain that can touch it: information_theory. Calibration: seals — the energy bound computes exactly. ERASING one bit must dissipate a", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "readable": false, "generated": false}, {"id": "card_domchk_cybersecurity_claimed_entropy_bits", "title": "Cybersecurity: entropy bits", "shelf": "cybersecurity", "surface": "secular", "snippet": "A worked check in cybersecurity: entropy bits.\n\nGIVEN\n  charset_size = 94\n  cidr_prefix = 24\n  cvss_base_score = 9.1\n  password_length = 16\n  port_number = 443\n  tls_version = 1.2\n\nCLAIMED\n  claimed_e", "authority_tier": "reference", "source": "The verifier's own documented relation, and a run this engine performed against it (deterministic; re-runnable with tools/domain_goldens.py)", "readable": false, "generated": false}, {"id": "card_alm_connection_entropy_is_thermodynamic", "title": "Almanac: Shannon entropy and thermodynamic entropy are the same quantity", "shelf": "almanac", "surface": "secular", "snippet": "SITUATION\n  The entropy of a message and the entropy of a gas are not analogies -- they are one formula. information_theory confirmed Shannon entropy numerically: a fair coin carries 1 bit, four equal", "authority_tier": "reference", "source": "The Almanac — verified-only practical wisdom (sealed)", "readable": false, "generated": false}, {"id": "card_works_information", "title": "Measuring information: one bit, and a distance", "shelf": "the-works", "surface": "secular", "snippet": "A single fair coin carries exactly one bit of Shannon entropy; the Hamming distance counts how many positions two codewords differ in — the ground of error correction.  Worked & sealed by the engine —", "authority_tier": "verified", "source": "The Works — worked & sealed", "readable": false, "generated": false}, {"id": "card_works_hash", "title": "Cryptographic strength: a fingerprint and a cipher", "shelf": "the-works", "surface": "secular", "snippet": "SHA-256 of the three letters 'abc' is a fixed 256-bit fingerprint — change one bit and it changes utterly (the property this engine's seals rest on) — and a 256-bit AES key is, by the standard, strong", "authority_tier": "verified", "source": "The Works — worked & sealed", "readable": false, "generated": false}, {"id": "card_n_49d1ebe5ba6a", "title": "The genome as information — and the algebra of a population", "shelf": "science", "surface": "secular", "snippet": "Two bits per base, sealed: log(4)/log(2) = 2 — so the ~3.2 billion base pairs of the human\ngenome hold ~6.4 billion bits, about 800 MB, a large app's worth of code in every cell (https://narrowhighway", "authority_tier": "engine_derived", "source": "Concordance assay — 2026-07-09", "readable": false, "generated": false}, {"id": "card_alm_located_modular_exponentiation_trapdoor", "title": "Almanac: The modular-exponentiation trapdoor: fast one way, hard the other", "shelf": "almanac", "surface": "secular", "snippet": "SITUATION\n  Public-key cryptography needs an operation that is easy to do and ruinous to undo -- and modular exponentiation is it. mathematics confirmed the FAST direction by square-and-multiply: beca", "authority_tier": "reference", "source": "The Almanac — verified-only practical wisdom (sealed)", "readable": false, "generated": false}, {"id": "card_v_a2c57d5d0b2a", "title": "H(½,½) = 1 bit · Hamming(1011, 1001) = 1", "shelf": "information_theory", "surface": "secular", "snippet": "Verdict: HOLDS.\n• info_theory.shannon_entropy: H = 1.000000 bits (matches claim 1.0)\n• info_theory.hamming_distance: Hamming('1011', '1001') = 1 (matches claim)\nSealed and independently re-checkable: ", "authority_tier": "engine", "source": "Verified by the engine — information_theory", "readable": false, "generated": false}, {"id": "card_alm_connection_reality_is_mappable", "title": "Almanac: Reality is mappable: the same verified structure recurs across every domain", "shelf": "almanac", "surface": "secular", "snippet": "SITUATION\n  Across this whole moat -- physics, computer science, music, genetics -- the engine kept finding the SAME structures wearing different clothes, and this grand capstone confirms it by drawin", "authority_tier": "reference", "source": "The Almanac — verified-only practical wisdom (sealed)", "readable": false, "generated": false}, {"id": "card_thermo_entropy_information", "title": "Entropy is information — Boltzmann, Shannon, Landauer", "shelf": "codex", "surface": "secular", "snippet": "Entropy in joules-per-kelvin and entropy in bits are the same quantity. Landauer's limit - erasing one bit costs at least k_B T ln2 - is the bridge, and where Maxwell's demon is exorcised (sealed on s", "authority_tier": "engine_derived", "source": "Narrow Highway — thermodynamics", "readable": false, "generated": false}, {"id": "card_n_bf1b1d4a5b77", "title": "Phonics — the code beneath reading", "shelf": "science", "surface": "secular", "snippet": "English is a cipher with a catch: 26 letters carry ~44 phonemes (24 consonant + 20 vowel\nsounds, sealed 24+20=44) spelled ~250 ways, ~4.7 bits per letter (log2 26). The whole difficulty\nis the vowels ", "authority_tier": "engine_derived", "source": "Concordance assay — 2026-07-09", "readable": false, "generated": false}, {"id": "card_bridge_theory_shannon_information_theory__second_law_of_thermodynamics", "title": "Bridge: Shannon information theory (entropy, channel capacity)  ↔  Second law of thermodynamics (entropy)", "shelf": "bridges", "surface": "secular", "snippet": "Shannon information theory (entropy, channel capacity) and Second law of thermodynamics (entropy) are the same form in different domains. Shannon's H = -sum p log p and Boltzmann's S = k log W are the", "authority_tier": "reference", "source": "The Bridges — cross-domain isomorphisms", "readable": false, "generated": false}, {"id": "card_bridge_theory_double_entry_accounting_identity__cryptographic_security", "title": "Bridge: Double-entry accounting identity (A = L + E)  ↔  Cryptographic security (hashing, checksums, PKI)", "shelf": "bridges", "surface": "secular", "snippet": "Double-entry accounting identity (A = L + E) and Cryptographic security (hashing, checksums, PKI) are the same form in different domains. the identity is a CHECKSUM: single-entry has no internal test ", "authority_tier": "reference", "source": "The Bridges — cross-domain isomorphisms", "readable": false, "generated": false}], "house": {"door": "FIND", "kind": "cards", "trail": "results", "seal": null, "next_step": {"do": "open the top card", "door": "FIND", "tool": "card_get", "params": {"id": "card_floor_computer_science"}}, "ends": "a verdict or a card · the trail · a seal · one next step"}}