The PARA Method
The PARA Method is a universal system for digital organization developed by Tiago Forte, designed to align information with current goals rather than rigid categories. Unlike traditional library-style indexing, which sorts by subject, PARA sorts by actionability—organizing files based on when they will be needed next.
The Four Categories
The system divides all digital assets into four distinct tiers of actionability:
- Projects: Short-term efforts working toward a specific goal with a clear deadline (e.g., “Finalize Q4 Report” or “Plan Japan Trip”). These require the highest level of active attention.
- Areas: Long-term responsibilities with no final deadline, where a standard of performance must be maintained (e.g., “Health,” “Finances,” “Professional Development”).
- Resources: Topics or themes of ongoing interest that may become useful in the future but have no immediate application (e.g., “Graphic Design,” “Coffee Brewing,” “Cybersecurity Trends”).
- Archives: Inactive items from the other three categories that are no longer relevant but retained for historical reference.
Core Philosophy: Action over Topic
The primary friction in most organization systems is the cognitive load required to decide where to file an item. PARA removes this ambiguity by asking a single question: “In which project will this be most useful?” This dynamic approach ensures that the most relevant information surfaces when it is needed for execution, preventing ideas from stagnating in static folders.
Application in Networked Tools
While PARA was originally designed for hierarchical file systems (like Google Drive or Dropbox), its application varies in networked note-taking tools like Obsidian.
- Strict Implementation: Users may use folders to strictly enforce the separation between Projects and Resources.
- Hybrid Approaches: Many users find that rigid folder structures conflict with the fluid nature of bi-directional linking. In these environments, PARA often acts as a high-level filter, while Maps of Content (MOCs) handle the actual retrieval and connection of ideas. This allows for the structure of PARA without losing the serendipity of a graph database.