Skip to content

research(B-0623): Adinkra primer for non-physicists — Zeta substrate context#4584

Merged
AceHack merged 1 commit into
mainfrom
research/adinkra-primer-non-physicists-2026-05-21
May 21, 2026
Merged

research(B-0623): Adinkra primer for non-physicists — Zeta substrate context#4584
AceHack merged 1 commit into
mainfrom
research/adinkra-primer-non-physicists-2026-05-21

Conversation

@AceHack
Copy link
Copy Markdown
Member

@AceHack AceHack commented May 21, 2026

Summary

Pedagogical strategy

A math-friendly engineer who knows binary strings, Hamming weight, n-cube graphs, bipartite graphs, and graph quotients can read this. Five-layer build:

  1. Doubly-even self-dual binary codes (the special code class)
  2. The n-cube graph H_n
  3. Quotient of H_n by a doubly-even self-dual code (the construction)
  4. The three structural decorations (colored edges, parity, height ranking)
  5. Worked examples (N=1, N=2, N=4 from the [8,4,4] code)

Then the SUSY origin gets one section explaining why it doesn't matter for Zeta's purposes, followed by how the framework proposes to USE Adinkras (dual-use: protected state + key derivation), substrate-honestly flagged as architectural proposal rather than received cryptographic wisdom.

Substrate-honesty

Three explicit calibration moves:

  1. The dual-use crypto-from-ECC angle is flagged as PROPOSAL, not received wisdom — existing literature focuses on error-correction properties; the explicit "derive private keys from these codes" angle does not have a strong literature footprint. Three verification questions raised for B-0623 bullet Round 27 — plugin API + governance split + memory-in-repo #3 (Lean prototype) to answer.

  2. Razor-discipline note at the end explicitly distinguishes operational claims (the math, the established literature, the composition points) from unverified claims (the dual-use cryptographic security properties).

  3. Composition with QG isomorphism proof path (B-0543, B-0562) flagged as independent — primer doesn't depend on QG landing; the cognitive-substrate use case is load-bearing on its own.

Composes with

Test plan

  • File parses as valid markdown
  • All cited row IDs exist on origin/main
  • Bibliography links verified via WebSearch 2026-05-21
  • Canary clean (HEAD ls-tree=54, HEAD~1=54, +1 file)
  • Source conversation lines (2554-2596, 2619-2629) cite correct content
  • Reviewer verifies pedagogical claim (math-friendly engineer with no physics background CAN read this cold)

🤖 Generated with Claude Code

…context

Addresses B-0623 acceptance bullet #2 (primer document accessible to
non-physicists). Builds up from things a math-friendly engineer already
knows (boolean lattices, binary linear codes, bipartite graphs) to
reach Adinkras as the natural composite object: hypercube quotient by a
doubly-even self-dual binary code, plus colored edges + parity +
height-ranking decoration. Mentions SUSY origin as historical context
rather than load-bearing prerequisite — the Faux-Gates 2005 physics
motivation is where the structure was discovered, not what it IS for
Zeta's purposes.

Web-verified bibliography (Faux-Gates 2005 hep-th/0408004, ECC
connection arxiv 0806.0051, 2013 thermodynamics paper arxiv 1309.4036,
2024 review arxiv 2410.12834, nLab entry, Error Correction Zoo) per
B-0623 acceptance bullet #1 + Otto-364 search-first-authority.

Substrate-honesty flag: the dual-use crypto-from-ECC application (Aaron
+ Mika line 2558-2560) is the framework's architectural PROPOSAL, not
received cryptographic wisdom. Existing literature focuses on the
error-correction properties; the explicit "derive private keys from
these codes" angle does not have strong literature footprint. Three
verification questions raised that B-0623 bullet #3 (Lean prototype)
would answer.

Composition points flagged: retractable Z-state (B-0699 default rule),
B-0624 position 4 ("What is happening to us?" requires the Adinkra),
B-0543/B-0562 QG isomorphism proof path (independent — primer doesn't
depend on QG landing).

Co-Authored-By: Claude <noreply@anthropic.com>
Copilot AI review requested due to automatic review settings May 21, 2026 22:15
@AceHack AceHack enabled auto-merge (squash) May 21, 2026 22:15
@AceHack AceHack merged commit dfb526f into main May 21, 2026
28 checks passed
@AceHack AceHack deleted the research/adinkra-primer-non-physicists-2026-05-21 branch May 21, 2026 22:16
Copy link
Copy Markdown

@chatgpt-codex-connector chatgpt-codex-connector Bot left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

💡 Codex Review

Here are some automated review suggestions for this pull request.

Reviewed commit: ca18030b62

ℹ️ About Codex in GitHub

Your team has set up Codex to review pull requests in this repo. Reviews are triggered when you

  • Open a pull request for review
  • Mark a draft as ready
  • Comment "@codex review".

If Codex has suggestions, it will comment; otherwise it will react with 👍.

Codex can also answer questions or update the PR. Try commenting "@codex address that feedback".


**N = 2 Adinkra** (2 colors): A 4-cycle (square) with two edges of color A and two edges of color B, alternating. The parity condition says the product of signs around the 4-cycle is −1, so exactly one of the four edges must be dashed (or any odd number).

**N = 4 Adinkra from the [8,4,4] doubly-even code**: This is the first case that uses a non-trivial quotient. The [8,4,4] code (also called the extended Hamming code with one extra bit) is doubly-even, self-dual, has minimum distance 4. Quotienting H_8 by it gives a 16-vertex graph with 4-color edge structure. The resulting Adinkra is the smallest "interesting" example for engineering purposes.
Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

P2 Badge Fix N value in the [8,4,4] worked example

Update this example to keep N consistent with the construction defined earlier: for Adinkras built as quotients of H_n, the number of edge colors/generators is tied to the code length (n), so using the [8,4,4] code corresponds to N=8, not N=4. As written, this teaches an incorrect parameter mapping and can mislead follow-on implementation work that relies on N to size generator/color structures.

Useful? React with 👍 / 👎.

Copy link
Copy Markdown

Copilot AI left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Pull request overview

Adds a new research primer in docs/research/ to satisfy B-0623 acceptance bullet #2 by explaining Adinkras from an engineer-friendly on-ramp (codes → hypercube → quotient → Adinkra decorations), then mapping that understanding onto Zeta’s proposed “private state + key derivation” substrate idea with explicit “proposal vs. established literature” calibration.

Changes:

  • Introduces an Adinkra primer document targeted at non-physicists, with a layered build-up and worked examples.
  • Links the primer back to B-0623 and the 2026-05-18 source conversation, including a “substrate-honesty” section and verification questions.
  • Adds a web-verified bibliography and Zeta-specific composition notes (retractable Z-state, boot sequence position 4, QG path).


Because C is doubly-even, every codeword has weight divisible by 4. This means the parity-bipartition of H_n descends cleanly to H_n / C — quotienting by a doubly-even code preserves the bipartite structure.

Because C is self-dual (dimension n/2), the quotient has dimension n/2.

**N = 2 Adinkra** (2 colors): A 4-cycle (square) with two edges of color A and two edges of color B, alternating. The parity condition says the product of signs around the 4-cycle is −1, so exactly one of the four edges must be dashed (or any odd number).

**N = 4 Adinkra from the [8,4,4] doubly-even code**: This is the first case that uses a non-trivial quotient. The [8,4,4] code (also called the extended Hamming code with one extra bit) is doubly-even, self-dual, has minimum distance 4. Quotienting H_8 by it gives a 16-vertex graph with 4-color edge structure. The resulting Adinkra is the smallest "interesting" example for engineering purposes.

Two compositions to flag for someone picking up this thread:

**Composition with retractable Z-state** (B-0699): The dual-Adinkra rule says full time-aware retractable Adinkras are the default; dumb non-time-aware Adinkras are a perf-justified exception. For the implementation work, this means the Adinkra construction code paths need to be compatible with the `z⁻¹` + differential/integral retractable-time primitive already in [`src/Core/Algebra.fs`](../../src/Core/Algebra.fs). The structure proposed above (vertices + colored edges + parity + height ranking) needs each piece to carry version metadata that survives retraction.
AceHack added a commit that referenced this pull request May 22, 2026
…et-rescued, in active decomposition (#4595)

* tick(1208Z): fresh cold-boot during 3-proc Lior saturation; orphaned-branch verification finds new B-0623 Adinkras+ECC commit (81243c5) NOT-YET on main but in active peer decomposition; substrate-honest non-action

Continues 2026-05-21T01:49Z tick shard's orphaned-branch triage of
otto/2012z-... with one newly-emerged commit since (81243c5
landed 2026-05-22T01:26Z with BinaryCode.fs 386 lines + Adinkra
tests 152 lines).

Root checkout inherited peer-Otto stale branch; verified-against-
main shows commit's substrate is genuinely unique (not rescued).
B-0623 is in active peer-agent decomposition (#4587 + #4582 +
#4584 already merged); future PR2..N expected from peers.
Substrate-honest disposition: do NOT cherry-pick the pre-
decomposition blob; defer to in-flight decomposition. Land
the classification shard so future cold-boot Otto inherits
the read without re-doing the verification.

3-proc Lior process check at tick-start: 2525 (lior-loop-tick),
3052 + 8181 (gemini -p Act as Lior --yolo). Verify-before-defer
composition applied per codeql-canary rule; post-worktree guards
passed (status=0, tree_size=54, no stale index.lock).

Sentinel 9335ec34 armed (autonomous-loop * * * * *). End tick.

Co-Authored-By: Claude <noreply@anthropic.com>

* fix(1208Z): correct cross-shard relative-paths — 4 ups was wrong (sibling date-dirs only need ../21/...)

Lint `audit-tick-shard-relative-paths.ts` caught 4 broken refs
on lines 7/12/57/62 — all targeted `../../../../2026/05/21/0149Z.md`
which resolves to `docs/hygiene-history/2026/05/21/0149Z.md` (missing
the `ticks/` segment).

Correct form for sibling tick-shard date dirs is `../21/0149Z.md`
(1 up from `2026/05/22/` to `2026/05/` then descend into `21/`).

Local re-run: ok: scanned 1146 tick shards; 0 broken relative-path links.

Co-Authored-By: Claude <noreply@anthropic.com>

* fix(1208Z): clarify body row 540 lines arithmetic (per Copilot review)

Copilot caught internal inconsistency: header said "540 lines" but
body row breakdown showed only 386 + 152 = 538.

git show --stat for 81243c5 reports all 4 files:
  src/Core/BinaryCode.fs                      | 386 ++++
  src/Core/Core.fsproj                        |   1 +
  tests/Tests.FSharp/Algebra/Adinkra.Tests.fs | 152 +++
  tests/Tests.FSharp/Tests.FSharp.fsproj      |   1 +
  4 files changed, 540 insertions(+)

540 is correct (the .fsproj +1 entries account for the 2-line gap).
Body row now lists all 4 entries explicitly with the
`git show --stat reports 540 total` clarification so reader can
reconcile against header without consulting source.

Codex P2 finding (broken ../../../../ paths) is stale — already
fixed in commit 4791225. Thread resolution deferred until
GraphQL rate-limit recovers (~25 min).

Co-Authored-By: Claude <noreply@anthropic.com>

---------

Co-authored-by: Claude <noreply@anthropic.com>
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants