GROUND
Problem
What becomes confusing, fragile, or impossible without understanding child processes? This lesson answers that through explanation, a worked example, two runnable exercises, and a reference solution. No teacher-supplied worksheet is required.
Node applied JavaScript’s event-driven model to servers and command-line programs, pairing a single process with nonblocking I/O.
LEARN
Concept explanation
Child processes belongs to “One process under load”. Capacity ends where CPU, memory, descriptors, event-loop delay, or dependencies saturate. This lesson turns child processes into a working part of weekly fixture.
For child processes, trace concrete input, state transition, output, and failure through a server-side runtime boundary involving process lifecycle, filesystem or network I/O, streams, and capacity.
One process owns an event loop, module graph, heap, handles, streams, signals, and explicit boundaries to the OS and network. Apply that model to supplied normal, boundary, and failure cases; each case below names its input and expected evidence.
Evidence produced by the child processes experiment: output, state, trace, bytes, timing, or diagnostics.
Condition that must remain true while inputs or implementation of child processes change.
Point where child processes crosses ownership, representation, time, process, network, or trust.
Example bank
Compare normal, boundary, failure, and cross-layer cases. Predict each observation before revealing the explanation.
SETUPBuild child processes around this exact fixture: Load-test one-process server and record latency percentiles, throughput, handles, CPU, memory.
OBSERVEchild processes handles baseline and boundary while preserving this observable result: Report names first bottleneck from evidence and distinguishes worker/child-process trade-offs.
WHY IT MATTERSThis isolates the normal contract of child processes; preserve its raw evidence as the control for every later comparison.
SETUPAdd child processes support for weekly boundary case: Increase concurrency until first measured knee.
OBSERVERecord what remains invariant and the first representation, owner, size, or timing value that changes in Node inspector · curl · SQLite CLI · process tools.
WHY IT MATTERSA boundary example is useful only when one named dimension changes and everything else stays comparable.
SETUPMake child processes surface—not hide—this failure: Send termination under load and verify graceful drain timeout.
OBSERVECapture the first divergence from the baseline, including exact input, diagnostic, state, and recovery result. Expected recovery: child processes handles baseline and boundary while preserving this observable result: Report names first bottleneck from evidence and distinguishes worker/child-process trade-offs.
WHY IT MATTERSThe diagnostic is part of the interface. Repair the proven cause, not the most visible symptom.
SETUPTrace child processes one layer below its usual abstraction through a server-side runtime boundary involving process lifecycle, filesystem or network I/O, streams, and capacity.
OBSERVEUse Node inspector, active handles, process signals, curl, CPU profiles, heap snapshots, and OS process tools.
WHY IT MATTERSThe lower layer is earned when it explains evidence the current layer cannot. Otherwise keep child processes at the simpler boundary.
SEE
Worked example
Start from supplied server.mjs. Focus: Build child processes around this exact fixture: Load-test one-process server and record latency percentiles, throughput, handles, CPU, memory.
- Run: node server.mjs > server.log 2>&1 & server_pid=$!; trap 'kill $server_pid' EXIT; sleep 1; curl -i http://127.0.0.1:3000/
- Save baseline evidence. Use Node inspector, active handles, process signals, curl, CPU profiles, heap snapshots, and OS process tools.
- Boundary case: Add child processes support for weekly boundary case: Increase concurrency until first measured knee.
- Failure case: Make child processes surface—not hide—this failure: Send termination under load and verify graceful drain timeout.
RESULT
child processes handles baseline and boundary while preserving this observable result: Report names first bottleneck from evidence and distinguishes worker/child-process trade-offs. Starter-level baseline: Server prints its URL; curl receives 200, JSON content type, correct byte length, and a body containing topic and GET method.
START HERE
Starter material
PREREQUISITESNode.js 22+ and curl. Verify with node --version and curl --version.
ONE-TIME SETUPmkdir reforging-node && cd reforging-node
Create server.mjs, paste this exact content, then run the command below.
import { createServer } from "node:http";
const server = createServer((request, response) => {
const body = JSON.stringify({ topic: "child processes", method: request.method });
response.writeHead(200, { "content-type": "application/json", "content-length": Buffer.byteLength(body) });
response.end(body);
});
server.listen(3000, "127.0.0.1", () => console.log("http://127.0.0.1:3000"));node server.mjs > server.log 2>&1 & server_pid=$!; trap 'kill $server_pid' EXIT; sleep 1; curl -i http://127.0.0.1:3000/STOP / CLEANUPSupplied command traps shell exit and stops server. If running server alone, press Ctrl+C.
DO WITH GUIDANCE
Guided exercise
Complete one useful slice: child processes
- Normal case: Build child processes around this exact fixture: Load-test one-process server and record latency percentiles, throughput, handles, CPU, memory.
- Write predicted evidence from this named case before running starter.
- Implement smallest behavior that satisfies the checks.
- Run exact normal case. Save commands, inputs, outputs, and diagnostics in notebook.
- Explain changed evidence using lesson mental model in no more than five sentences.
Concrete guided solution
- Copy the supplied server.mjs unchanged and run: node server.mjs > server.log 2>&1 & server_pid=$!; trap 'kill $server_pid' EXIT; sleep 1; curl -i http://127.0.0.1:3000/
- Write this prediction before inspecting output: child processes handles baseline and boundary while preserving this observable result: Report names first bottleneck from evidence and distinguishes worker/child-process trade-offs.
- Perform only the named normal case: Build child processes around this exact fixture: Load-test one-process server and record latency percentiles, throughput, handles, CPU, memory.
- Save the raw output, then annotate input → transition → evidence. Use Node inspector · curl · SQLite CLI · process tools to confirm the transition rather than inferring it.
- Compare prediction with evidence; if they differ, keep both and write the rule that explains the difference. Reference baseline: Server prints its URL; curl receives 200, JSON content type, correct byte length, and a body containing topic and GET method.
DO ALONE
Independent exercise
Add one real case: child processes
- Create second case from blank file: Add child processes support for weekly boundary case: Increase concurrency until first measured knee.
- Then create controlled failure: Make child processes surface—not hide—this failure: Send termination under load and verify graceful drain timeout.
- Use Node inspector · curl · SQLite CLI · process tools to prove behavior, then repair controlled failure.
- Compare result against supplied acceptance checks and reference approach before marking complete.
Concrete independent solution
- Duplicate the starter into a clean comparison case; change only this boundary: Add child processes support for weekly boundary case: Increase concurrency until first measured knee.
- Save its evidence beside the baseline and identify the first changed value. Use Node inspector, active handles, process signals, curl, CPU profiles, heap snapshots, and OS process tools.
- Create the exact controlled failure: Make child processes surface—not hide—this failure: Send termination under load and verify graceful drain timeout.
- Create smallest file or component named for child processes; accept weekly fixture as input rather than embedding hidden state.
- Implement baseline path first: Load-test one-process server and record latency percentiles, throughput, handles, CPU, memory.
- Add one explicit branch or state for: Increase concurrency until first measured knee.
- Return, throw, display, or log actionable failure for: Send termination under load and verify graceful drain timeout.
- Run both successful cases after failure repair; verify: Report names first bottleneck from evidence and distinguishes worker/child-process trade-offs.
- Rerun baseline, boundary, and repaired failure together. Accept only if all reproduce: child processes handles baseline and boundary while preserving this observable result: Report names first bottleneck from evidence and distinguishes worker/child-process trade-offs.
COMPARE
Expected result
- child processes handles baseline and boundary while preserving this observable result: Report names first bottleneck from evidence and distinguishes worker/child-process trade-offs.
- Server prints its URL; curl receives 200, JSON content type, correct byte length, and a body containing topic and GET method.
- Controlled child processes failure produces captured evidence; repair restores stated invariant without hiding error.
PROVE
Acceptance checks
Lesson is complete only when every check is true. Each check is stored locally and travels with your JSON backup.
0/5 complete · saved on this device
UNSTICK
Hints
Reveal hints
- Start with supplied normal case exactly as written: Build child processes around this exact fixture: Load-test one-process server and record latency percentiles, throughput, handles, CPU, memory.
- For boundary case, change only named dimension: Add child processes support for weekly boundary case: Increase concurrency until first measured knee.
- If result is confusing, diff raw inputs and evidence before editing implementation.
- If tool shows nothing useful, move observation one boundary lower: representation, runtime, OS, or network.
VERIFY
Solution
Attempt both exercises before opening reference approach.
Reveal reference solution
- Run unmodified starter and preserve baseline evidence: Server prints its URL; curl receives 200, JSON content type, correct byte length, and a body containing topic and GET method.
- Create smallest file or component named for child processes; accept weekly fixture as input rather than embedding hidden state.
- Implement baseline path first: Load-test one-process server and record latency percentiles, throughput, handles, CPU, memory.
- Add one explicit branch or state for: Increase concurrency until first measured knee.
- Return, throw, display, or log actionable failure for: Send termination under load and verify graceful drain timeout.
- Run both successful cases after failure repair; verify: Report names first bottleneck from evidence and distinguishes worker/child-process trade-offs.
PREDICT · INSPECT · BREAK · DEBUG · MEASURE
Interrogate reality
Prediction: write expected output, state transition, ordering, and failure evidence before running either exercise.
Inspection: Use Node inspector, process reports, CPU profiles, heap snapshots, active handles, logs, curl, and OS process tools.
Measurement: Measure event-loop delay, latency percentiles, throughput, memory, file descriptors, query time, and saturation.
Capture raw evidence before explaining.
Change one assumption and force controlled failure.
Find cause with Node inspector · curl · SQLite CLI · process tools before editing fix.
MASTERY + FRONTIER + BOUNDARY
Own the knowledge
Explain child processes at beginner, intermediate, and senior depth.
Recreate smallest useful example from blank file without notes or AI.
Schedule recall for day 1, 7, 30, and 90.
Creative frontier lab
Try first without opening the solutions. The constraints invite invention; the reference gives one concrete direction, never the only valid answer.
Re-solve child processes by removing the most convenient abstraction. build the useful vertical slice in one process before adding infrastructure.
CONSTRAINTKeep the same inputs, observable result, and failure evidence; change the means, not the contract.
ORIGINAL IDEATurn subtraction into a design tool: the missing abstraction should reveal which responsibility it used to hide.
Reveal frontier solution
- Freeze the contract as three fixtures: Build child processes around this exact fixture: Load-test one-process server and record latency percentiles, throughput, handles, CPU, memory. / Add child processes support for weekly boundary case: Increase concurrency until first measured knee. / Make child processes surface—not hide—this failure: Send termination under load and verify graceful drain timeout.
- List every convenience used by the starter; remove the highest-level one while preserving node server.mjs > server.log 2>&1 & server_pid=$!; trap 'kill $server_pid' EXIT; sleep 1; curl -i http://127.0.0.1:3000/.
- Implement the smallest replacement using build the useful vertical slice in one process before adding infrastructure.
- Run all fixtures and compare raw evidence. Keep the simpler version unless the removed abstraction has a demonstrated benefit.
Build an explanation artifact for child processes: expose active handles, stream pressure, signals, status, logs, and resource cleanup.
CONSTRAINTA peer must be able to locate the first divergence without reading implementation code.
ORIGINAL IDEATreat the explanation itself as a product: make invisible transitions visible, replayable, and diffable.
Reveal frontier solution
- Create one row or timestamped event for each transition in: Build child processes around this exact fixture: Load-test one-process server and record latency percentiles, throughput, handles, CPU, memory.
- For every row record input, representation, owner, operation, output, and tool evidence from Node inspector · curl · SQLite CLI · process tools.
- Replay Add child processes support for weekly boundary case: Increase concurrency until first measured knee.; highlight only changed rows.
- Replay Make child processes surface—not hide—this failure: Send termination under load and verify graceful drain timeout.; stop at the first divergent row and attach its recovery action.
Combine the boundary and failure into a new user-visible scenario for child processes. make shutdown, malformed input, and partial I/O first-class demo modes.
CONSTRAINTDo not merely add more input. Invent a recovery interaction, alternate representation, or self-checking behavior.
ORIGINAL IDEAMake the system teach its own limits: the artifact should expose the invariant and offer a safe next action when it breaks.
Reveal frontier solution
- Combine these two pressures without changing them: Add child processes support for weekly boundary case: Increase concurrency until first measured knee. AND Make child processes surface—not hide—this failure: Send termination under load and verify graceful drain timeout.
- Name the invariant that must survive and the user-visible evidence when it cannot: child processes handles baseline and boundary while preserving this observable result: Report names first bottleneck from evidence and distinguishes worker/child-process trade-offs.
- Implement this original direction: make shutdown, malformed input, and partial I/O first-class demo modes.
- Demonstrate baseline, combined failure, recovery, then baseline again; save the sequence as a regression fixture.
Capability frontier
Push child processes until another layer becomes justified. Record one robust technique, one contextual trade-off, and one labeled hack or historical curiosity.
CORE · PRACTICAL · CONTEXTUAL · HACK · FRAGILE · HISTORICAL · GOLF
Boundary
One process eventually hits CPU, memory, availability, deployment, or organizational limits—but those limits must be measured.
If this vanished tomorrow…
Use CGI-style programs, another runtime, static files, shell tools, or serverless request handlers.
Why next layer is earned
WASM and embedded data are earned when measured work needs a low-level boundary or a relational local model.