19 published entries.

When a substantive error is found, this page records the affected page, the original claim, the correction, and the date. Clarifications that change interpretation without changing a result, and removals of unpublished working material, are labelled separately from factual or mathematical corrections.

  1. Added permission and owner-review guidance before the copy-ready migration prompt.

    OriginalUse this prompt when starting from a legacy folder of documents and asking a coding agent to build the second brain.

    NowRun the prompt on a copy and review the agent's migration diff before deleting anything.

  2. The Kiro section reproduced the tool's own tips in its first-person voice ('so I can search them', 'while I'm still working'), recommended --trust-all-tools to skip approval prompts and in unattended headless runs, and misspelled two flags. It is now attributed and dated, written in the author's voice, and limits pre-approval to named tools.

    Original-trust-all-tools or --trust-tools=fs_read,fs_write,execute_bash to skip approval prompts / Headless mode: kiro-cli chat --no-interactive --trust-all-tools "run tests and fix failures"

    NowPre-approve only the tools a task needs; keep --trust-all-tools to disposable sandboxes; unattended runs that write or execute belong in a throwaway checkout or CI container.

  3. Removed a private to-do list of future additions to the guide (tools to try, 'figure out how to code faster') that read as instructions rather than published guidance.

    OriginalHere are other things to add on into this guide to take this to the next level: …

    NowRemoved from the public page.

  4. Attributed the /grill-me skill to its published source and separated the general principle from this tool-specific recipe.

    OriginalThe idea of using this skill is that it forces a shared design concept to exist before implementation.

    Nowgrill-me is a published agent skill; the principle is a shared design concept before implementation, and other harnesses need an equivalent planning step.

  5. The runtime rule said loops 'in parallel' multiply. Nesting, not parallel execution, is what multiplies, and only when the inner cost does not depend on the outer index.

    OriginalWhen loops (functions) are in series: do addition; when loops are in parallel: do multiplication

    NowSequential loops add; a nested loop multiplies the outer iteration count by the inner cost, or sums the inner cost when it varies with the outer index.

  6. For the move 'add 1 to two chosen elements', the note claimed every fixed pairwise difference is unchanged. Only the chosen pair's difference is preserved; the invariant is the parity of the sum, and matching parity is necessary but not sufficient.

    OriginalInvariant: The difference a_i - a_j for any fixed pair is unchanged, or the array sum parity stays the same. / Conclusion: If target has different parity or inconsistent differences, it is unreachable.

    NowInvariant: the parity of the array sum. Differences between a chosen and an unchosen element change by 1. Reachability also needs every target entry to be at least its start value and no entry to need more increments than all others combined.

  7. The first Scheduling note shared its title with another note and called its problem "Interval Scheduling with Profits", which is a different problem (weighted interval scheduling needs dynamic programming). It is now titled for the problem it solves and states the unit-length-job assumption the greedy proof relies on.

    OriginalScheduling — This is often called “Greedy Scheduling with Deadlines” or “Interval Scheduling with Profits.”

    NowJob Sequencing with Deadlines — unit-length jobs, one slot each; weighted interval scheduling is a different problem.

  8. The second Scheduling note listed two problems as ones greedy cannot solve, but both examples as stated are classic cases where greedy is optimal: unit-length job sequencing with deadlines, and shortest-processing-time for total completion time on one machine. It also said greedy works whenever optimal substructure holds (it also needs the greedy-choice property) and ended with a broken sentence. The note is renamed and the failing cases now name variants where greedy really fails.

    OriginalGeneral Job Sequencing with Deadlines: picking the highest profit job first might block…; SPT … isn't always optimal; Greedy algorithms work when there are optimal substructure properties.

    NowGreedy fails for jobs of different lengths with deadlines (weighted on-time jobs) and for weighted completion time without Smith's ratio rule; greedy needs both the greedy-choice property and optimal substructure.

  9. The note said -Wall turns on all warnings. The GCC manual documents many warnings outside -Wall, some enabled by -Wextra and others only individually.

    OriginalNote: Use the -Wall option to turn on all warnings.

    Now-Wall enables a large set of commonly useful warnings, not all of them; add -Wextra and specific flags such as -Wconversion as needed.

  10. The description of gcc's output conflated the executable with 'assembler output'. gcc is a driver that preprocesses, compiles, assembles, and links; a.out is only the historical default name.

    OriginalThe output file is the executable file called assembler output.

    NowThe driver runs the preprocessor, compiler, assembler, and linker; -o names the linked executable.

  11. The syntax summary said every line ends with a semicolon. Statements and declarations do; preprocessor directives, function headers, and block braces do not.

    OriginalEvery line ends with a semicolon

    NowStatements and declarations end with a semicolon; directives, function headers, and block braces do not, while struct/union/enum definitions do after the closing brace.

  12. The build explanation equated C++ compilation with Java's and blurred the compiler and linker steps; it also cited implicit function declarations, which modern C no longer allows either, as C-but-not-C++ code.

    OriginalCode is compiled before it in run, the same as Java and C. / We use the gcc compiler to deal with C++ compilation / ... automatically links the C++ Standard Library (libstdc++). / e.g., implicit function declarations

    NowC++ is compiled ahead of time to native object files that the linker combines; Java compiles to JVM bytecode. g++ (not gcc) links libstdc++ by default. Example of valid C that is not C++: implicit conversion from void *.

  13. Address Space (study plan): removed a private workflow instruction ("make a page for each topic… then delete this page") and reframed the checklist as a public study plan.

    OriginalAs you go along, you need to finish the following topics: / Make a page for each topic as you go along and then delete this page once you are done.

    NowPlanned topics for this phase; the page is labelled as a study plan.

  14. Two OS pages were both titled Address Space. The study-plan page is now titled Address Space Study Plan so it is not mistaken for the concept note; its old URL redirects.

    OriginalAddress Space (second page, /topics/os/address-space-2/)

    NowAddress Space Study Plan (/topics/os/address-space-study-plan/)

  15. Concurrency: removed a private workflow instruction ("make a page for each topic… then delete this page") and reframed the checklist as a public study plan.

    OriginalAs you go along, you need to finish the following topics: / Make a page for each topic as you go along and then delete this page once you are done.

    NowPlanned topics for this phase; the page is labelled as a study plan.

  16. Distributed Systems: removed a private workflow instruction ("make a page for each topic… then delete this page") and reframed the checklist as a public study plan.

    OriginalAs you go along, you need to finish the following topics: / Make a page for each topic as you go along and then delete this page once you are done.

    NowPlanned topics for this phase; the page is labelled as a study plan.

  17. File Systems: removed a private workflow instruction ("make a page for each topic… then delete this page") and reframed the checklist as a public study plan.

    OriginalAs you go along, you need to finish the following topics: / Make a page for each topic as you go along and then delete this page once you are done.

    NowPlanned topics for this phase; the page is labelled as a study plan.

  18. OS Basics: removed a private workflow instruction ("make a page for each topic… then delete this page") and reframed the checklist as a public study plan.

    OriginalAs you go along, you need to finish the following topics: / Make a page for each topic as you go along and then delete this page once you are done.

    NowPlanned topics for this phase; the page is labelled as a study plan.

  19. Reliability and Security: removed a private workflow instruction ("make a page for each topic… then delete this page") and reframed the checklist as a public study plan.

    OriginalAs you go along, you need to finish the following topics: / Make a page for each topic as you go along and then delete this page once you are done.

    NowPlanned topics for this phase; the page is labelled as a study plan.

Correction policy

  • Mathematical, algorithmic, and factual errors get an entry here and a link from the affected note.
  • Minor grammar or wording edits that do not change a claim are fixed without an entry.
  • Source updates keep the original citation visible when the correction depends on it.

Found an error? Tell me which page and claim. Essays are covered too; start with The mental models of deep learning.

Type to search every note and essay.