21
PRACTICE LAB · FOUNDATION
Read the Master — understand the large graph before the first Queue Prompt
This lab closes the Foundation section with practice: learn to read Hansen as a map of systems, inputs, controls, resources and return points without running generation. It is the required transition from “I see hundreds of nodes” to “I see a small number of modules and contracts.”
CONFIRMEDThis is an ARCHVIZ FOUNDATION / EXTENSION exercise. It uses the confirmed Hansen architecture; the goal is graph-reading skill rather than reproducing a specific model.
What the learner should be able to do after LAB 04
- Find BASE CONFIG, INPUTS, MODEL LOADERS, CONTROL, PROCESS modules and OUTPUT without reading every node.
- Show the active route and distinguish it from connected-but-not-selected and bypassed branches.
- Name at least five authoritative controls and their consumers.
- Find model/resource boundaries: where the workflow loads heavy assets and where those assets are reused.
- Describe one module as INPUT → PROCESS → CHECKPOINT → RETURN.
Canvas map: districts first, streets second
- Open a copy of the Hansen workflow and do not run anything.
- List the major groups from left to right in a note.
- Describe the responsibility of each group in one sentence.
- Do not trace internal links until the map of major modules is complete.
Control hunt: find what actually drives the graph
- Find generation mode 541, PEOPLE mode 543, ControlNet source 456, working resolution 702 and shared steps 771.
- For each control, find at least one downstream consumer.
- If a downstream widget shows another value, determine the effective linked value.
Resource boundary: where the models live
- Find the SDXL checkpoint / VAE / ControlNet loaders.
- Find the FLUX UNet / CLIP / VAE loaders.
- Mark which loaders serve several downstream modules.
- Explain why a loader is a resource boundary, not “just another node.”
LAB 04 is complete when you can explain the graph without running it
- You can describe INPUT → BASE GENERATION → LOCAL MODULES → FINAL → OUTPUT in 2–3 minutes.
- You do not confuse the control plane with the data plane.
- You can point to one bypassed branch and one selector-controlled branch.
- You can explain why 252 nodes are not 252 independent tasks.