Stack layer
Description
Abstraction levels built on each other, where each layer depends on the correctness of the layer below. The fundamental concept for hierarchical decomposition. The diagnostic question — which layer is this problem really at? — is one of the most common moves in good engineering reasoning. Marr’s three levels (computational, algorithmic, implementational) is the canonical cog-sci instance; the OSI model is the canonical networking instance.Triggers
User-initiated: User describes a system as if it were monolithic (“this isn’t being captured”, “we have whack-a-mole bugs”) and the agent re-frames it as layered; OR the user surfaces a bug that’s bouncing between layers and the agent attributes it to a specific layer; OR the user explicitly proposes a stack (“identity → grouping → planner → social alignment”) and the agent extends or validates it. The strongest signal is implicit (user describes a feature, the agent decomposes it). Four recurring sub-shapes:- Decomposition — one-layer-as-experienced becomes two-or-more (example: “set the hook to global to save insights” → agent recognizes the insight-saving feature as a two-layer system: plumbing layer + content layer, each with different failure modes).
- Layer-attribution / elimination — bug must be at layer X because layers Y, Z are known-clean (example: “the verbatim-title rule is enforced at three layers (prompt, codebook, honesty invariant #5)… the drift must be at a fourth layer”).
- Layer-multiplicity-as-strategic-framing — name the layers, the workstream becomes coherent (example: “drift can enter at six independent layers” reframes whack-a-mole into a coherent six-layer doctrine).
- Named-role stack — substrate-surface-amplifier instances: each layer has a specific job; the concept specializes.
Exclusions
- Genuinely flat systems — peer-to-peer architectures, distributed graph problems; forcing a stack frame loses information.
- Mutual recursion / circular dependencies — when layers depend on each other rather than strictly one-way, the stack metaphor misleads.
Structure
Relationships
- load-bearing — load-bearing is the auditing question for stacks. Which layers are doing actual work for the layer above?
- container — each stack layer is a container; the stack is a nested-containers structure.
- substrate-surface-amplifier — the named-role specialization of the generic stack.
Examples
Marr (1982) cognitive-science levels of analysis. · psychology
Marr (1982) cognitive-science levels of analysis. · psychology
David Marr’s posthumous 1982 Vision introduced an influential three-level decomposition of any information-processing system: the computational level (what problem is being solved, and why), the algorithmic level (what representations and procedures accomplish the computation), and the implementational level (how the algorithm is realized in physical substrate — neurons, silicon, software). Marr’s argument was that confusing the levels — for instance, trying to derive a theory of vision from neural-firing patterns without first specifying what computational problem vision solves — leaves the analyst with details disconnected from any unifying account.The structural insight is that the three levels are partially independent: the same computational specification can be realized by many algorithms, the same algorithm by many implementations, but each level constrains what the layers below it can do and the layers above it can demand. Distinguishing the levels gives the analyst a tractable decomposition of a problem that would otherwise be impossibly tangled.Inference: When investigating any complex system that involves multiple abstraction levels (cognitive architectures, distributed systems, organizations), the diagnostic question “which Marr level is this problem at?” routinely surfaces confusion. A bug at the implementation level needs implementation-level reasoning; a problem at the computational level cannot be solved by reaching into implementation details. The clarity of level-attribution is itself a precondition for productive work — debate that conflates levels often consists of correct claims at one level being deployed against irrelevant questions at another.
"The bottom of the stack is loose" · computer-science
"The bottom of the stack is loose" · computer-science
load-bearing × stack: when a lower layer has hidden failure modes, everything above carries unsupported weight.