Formal Protocol Theory
Mathematical and logical modeling of protocols, developing the underlying formal sciences with applications across fields including cryptography, distributed systems, and healthcare.
Meeting Archive — 37 sessions, 34 dated
-
July 10, 2026
Participants: Robby Rao, Kyle Mathews, Patrick Nast, Wip, Ergod, Fritz, Mike Travers, 🙊 Anuraj R, Venkatesh Rao, Senthil Gandhi
This was part of a summer-long track on stigmergic systems, aimed toward a workshop on security, robustness, and fault tolerance in stigmergy. Participants read papers modeling ant path selection via pheromone-based positive feedback, discussed the mathematical choice function and its parameters, and connected the dynamics to protocol theory concepts. The latter half turned to planning the workshop as a hackathon built on a simulation platform, with Venkat proposing a separate architecture call for code contributors.
- **Patrick's summary of the mechanism:** The double-bridge experiments use experimental controls (red light, sand) to isolate pheromone sensing. With equal paths, ants break symmetry via an **autocatalytic / positive-feedback loop** and randomly settle on one branch. With unequal paths, ants traverse the shorter path faster, laying more pheromone per unit time, which reinforces the shorter path — the beginnings of a path-optimization algorithm.
- **Evaporation rate as memory (Patrick's "hobby horse"):** The pheromone evaporation rate is the crucial memory-like parameter. High evaporation gives flexibility (re-routing, defense against adversarial pheromone-laying) but risks decoherence; low evaporation entrenches paths. It effectively controls the "hardness" of changing the signaling path.
- **Choice function parameters (Patrick):** Roughly `a / (a+b)` on pheromone concentrations, plus parameter **k** (attraction to an unmarked branch — the marking threshold needed for non-random choice) and **n** (a nonlinearity governing how strongly relative imbalance drives selection).
- **Lock-in / inability to switch (Ergod):** Once a strong trail is established, ants keep reinforcing it and won't switch even if a shorter path is introduced later. Ergod tried but couldn't observe decay of a longer path in favor of a better one in the simulator. He connected this to network-effect lock-in / **protocol ossification**, and framed **k** as a cold-start/bootstrapping threshold and the nonlinearity as consensus "sharpness."
- **Protocol-theory framing (Ergod):** Ants can be understood in capability terms; they use **temporal asymmetry** to achieve coordination-as-computation. He raised the idea of an adversarial hackathon where teams write behaviors for competing colonies and try to break each other's protocols (comparing to games like Screeps).
- **Anonymity/replaceability (Wip):** Ants coordinate effectively under complete anonymity — every ant is replaceable. He drew a loose blockchain analogy (competing paths, one "wins" via hard-coded rules) and a "broom/funnel/frontier" analogy applied to humans navigating mental (not just physical) territory.
-
July 10, 2026Deneubourg's double bridge experiments as foundational stigmergy modelComputational reproduction and simulation of ant colony self-organizationMathematical formalization of pheromone trail dynamics and nonlinearityPath selection and switching behavior in stigmergic systemsParameter tuning (evaporation rates and nonlinearity) for behavioral control
Participants: _vgr, _ergod, ediblebadger, danfschmidt, mtraven, drwip, zoesh
The SIGFPT group conducted a deep dive into the mathematics of self-organization in stigmergic systems, centered on Jean-Louis Deneubourg's classic double bridge experiments with ant colonies. The session focused on how local pheromone deposition and evaporation rules lead to global path selection behavior without centralized coordination. Participants shared multiple computational implementations of the double bridge simulation—including a NetLogo model and a custom reproduction—and discussed how to manipulate system parameters to observe emergent phenomena such as path switching. The group treated the simulations as interactive challenges, with hints provided to explore how nonlinearity and evaporation rate adjustments affect collective decision-making.
- The double bridge experiment provides a tractable mathematical model for understanding how local pheromone interactions produce collective path selection without centralized control.
- Stigmergic behavior can be reliably reproduced in simulation and exhibits phase transitions between stable states based on evaporation rates and nonlinearity parameters.
- Ant colonies can be induced to 'flip' between selected paths by adjusting key simulation parameters, demonstrating the sensitivity of self-organized systems to environmental conditions.
- Multiple implementations (NetLogo, Claude artifacts, custom simulations) enable comparative study of stigmergy models and validation of theoretical predictions.
View discussion in Discord →Links discussed -
June 26, 2026Yak robotics presentation planningSIGFPT group organizationDemo logistics and coordination
Participants: ediblebadger
The meeting thread was started by ediblebadger to organize a robotics presentation and demo featuring the Yak Collective for the SIGFPT (Formal Protocol Theory) group. The initiator pinged multiple group members to coordinate participation and planning for this event. No substantive discussion or conclusions are documented in the provided transcript excerpt.
- The SIGFPT group is organizing a presentation or demonstration related to yak robotics from the Yak Collective.
- Thread was initiated to coordinate attendees and logistics for this upcoming presentation.
-
June 26, 2026Yakrobot protocol demonstration and remote robot controlPower budgeting and computational constraints on battery-powered robotsFormal verification and attestable systems for roboticsBlockchain integration (Ethereum L2, SP1, Groth16 verifiers) for robot protocolsGrant funding opportunities and publication requirements in formal protocol research
Participants: _vgr, anurajenp, rafa_0x, _ergod, drwip, ediblebadger
The SIGFPT group held a crossover meeting with a robotics group to demonstrate yakrobot protocols and explore connections between formal protocol theory and practical robotics constraints. The meeting included a 20-minute presentation, Q&A, and hands-on remote robot control. Beyond the demonstration, discussion pivoted to the formal problem of optimizing computation within robot power budgets—treating robot operation as a behavioral trace payoff problem requiring scoping through formalization.
A significant secondary discussion emerged around blockchain-based verification for robotics protocols. Members explored using the 'attestable' system for peer-to-peer verifiable exchange and investigated Ethereum Layer 2 deployment strategies (Base, Arbitrum, OP) with BN254 precompiles to reduce verification costs. The conversation concluded that deploying a generic Groth16 verifier with a VK registry contract pattern avoids expensive per-circuit deployments, making protocol extensibility dramatically cheaper.
Parallel conversations also touched on grant funding challenges in Finland and the UK, where publication requirements are nearly universal—creating tension for researchers seeking project funding without mandatory publication outputs.
- Robot operation is constrained by battery power budgets, requiring analysis of behavioral profile traces and payoff layers to scope feasible computation—this becomes a formal scoping problem.
- The 'attestable' peer-to-peer verifiable secrets system could address trustless verification needs in robotics, with deployment costs significantly reduced by using L2 solutions like Base/Arbitrum rather than mainnet.
- Generic Groth16 verifier contracts with VK registries eliminate per-circuit deployment overhead, scaling from N contracts to 1 contract model and making circuit additions cheaper administrative operations.
- Funding landscape tension: publication-mandatory grants are common in Finland and UK, but researchers seeking flexibility prefer funding without publication compulsion.
View discussion in Discord →Links discussed -
June 12, 2026Stigmergy as a formal protocol theory conceptWorkshop planning for symposiumProtocol Institute SIGFPT group initiatives
Participants: _vgr
The SIGFPT group held a brainstorming session on June 12, 2026, focused on planning a stigmergy workshop for an upcoming symposium. The meeting was led by a designated participant to generate ideas and concepts for the workshop. The discussion represented a continuation of the group's ongoing exploration into stigmergy as it relates to formal protocol theory.
No detailed discussion content is available in the provided transcript excerpt, as only the meeting announcement and setup are documented. The session was structured as a collaborative brainstorming effort to develop workshop proposals and content.
- The SIGFPT group is actively exploring stigmergy as a theoretical framework for formal protocols.
- A workshop on stigmergy is being planned as part of an upcoming symposium.
- The session was intended to generate and brainstorm ideas for the workshop content and structure.
-
May 27, 2026Pebble automata formalismStatelessness in stigmergic systemsObservability constraintsSwarm robotics applicationsInformation theory foundationsStigmergic AI agents
Participants: _vgr
The SIGFPT group continued its summer-long exploration of stigmergy with a focus on pebble automata as a formal model. The session examined a foundational 1978 paper by Blum and Kozen that explores computation with minimal internal state, using the compass as a metaphor for agent capabilities. The discussion centered on two critical properties for stigmergic systems: statelessness (how agents operate without memory) and observability (what agents can perceive from their environment). Pebble automata serve as an abstract toy problem that illuminates these constraints while remaining applicable to real-world examples ranging from swarm robotics to distributed AI agents. By studying this formalism, the group aims to better understand how stigmergic coordination emerges from simple local interactions mediated through environmental modification.
- Pebble automata provide a toy problem formalism for understanding statelessness and observability in stigmergic systems, bridging abstract theory with practical applications.
- The classical 1978 Blum and Kozen work on compass-based computation illuminates how agents can accomplish complex tasks without maintaining internal state through environmental interaction.
- Stigmergic principles apply across diverse domains from swarm robotics to AI agents, with pebble automata serving as a unifying theoretical framework.
View discussion in Discord →Links discussed -
May 15, 2026Applying Heylighen's agent/action/medium/trace/condition framework to real-world systemsStigmergic patterns in diverse domains: swarm robotics, garage sales, legislation, version control, and historiographyDistinction between stigmergic systems (low-coordination, trace-based) and verbose/anti-stigmergic systems (explicit communication)Stigmergy as a Schelling point for bio-inspired design and the 'New Nature' research agendaTechnical analysis of lock-based vs. distributed (git-based) version control as stigmergic design choices
Participants: ediblebadger, anurajenp, _vgr, sachbenny, senthil_d1sc0rd, maparent, timber1997, zoesh, giovanni.merlino, .unipuff, promptrotator, mtraven
The SIGFPT group continued their stigmergy discussion by applying Heylighen's agent/action/medium/trace/condition framework to concrete real-world examples. Participants mapped diverse systems to this framework, including swarm robotics, a West Seattle garage sale map, legislative grifting cycles, electric agents architecture, historical documentation, and version control systems. A key observation emerged that the 'condition' component of the framework often remained underspecified in practice. The discussion revealed that git-based version control represents a stigmergic solution to coordination problems previously handled through locks, trading resolution costs for better emergent behavior.
The group debated whether stigmergy should become a summer-long focus area, with _vgr proposing SIGFPT become a "stigmergy revival group for the agentic AI era." .unipuff suggested stigmergy's narrowness makes it valuable as a Schelling point for bio-inspired design conversations. A significant meta-discussion emerged around the necessary and sufficient conditions for choosing between stigmergic systems (low coordination overhead, high conflict potential) and verbose systems (explicit communication, higher coordination costs). The consensus positioned stigmergy as both analytically useful and strategically aligned with the Protocol Institute's broader "New Nature" research roadmap.
- The garage sale map and legislative grift examples demonstrate how stigmergy operates across social scales: traces (location pins, news stories) trigger emergent behavior without central coordination.
- Git's superiority over lock-based version control stems from solving coordination through better stigmergy rather than imposing constraints, though this trades merge conflict resolution costs.
- The group identified 'Condition' as frequently underspecified in Heylighen's framework when applied to real systems, suggesting the framework needs refinement for practical analysis.
- Stigmergy is narrow enough to be analytically useful as a Schelling point while opening conversations about broader bio-mimetic design patterns applicable to agentic AI systems.
- A fundamental tradeoff exists between stigmergic systems (lower utilization, fewer conflicts) and verbose systems (explicit communication, higher coordination costs).
View discussion in Discord →Links discussed -
May 1, 2026Stigmergy as a decentralized coordination mechanism in biological and digital systemsApplication of stigmergy to protocol engineering and distributed systems designEnvironmental state persistence and durable streams as stigmergic substratesStigmergy's resolution of the culture-vs-institutions debate in political theoryAgent coordination through shared environmental traces rather than direct communication
Participants: _vgr, ediblebadger, .unipuff, maparent, stevebeans., kylemathews
The SIGFPT group examined stigmergy—a decentralized coordination mechanism observed in eusocial insects and applicable to human and machine systems—as a lens for understanding and designing protocols. The discussion centered on how stigmergy reframes coordination: instead of centralized control or direct agent communication, systems achieve coherence through agents modifying and responding to shared environmental state. Participants identified blockchains and durable streams (agent activity logs) as modern implementations of stigmergic substrates, and noted that the Electric Agents platform independently converged on this insight: design the medium, not the behavior.
A significant theoretical contribution emerged around protocol theory itself. Stigmergy was shown to dissolve a longstanding debate in political science between those emphasizing culture-driven institutions (Almond & Verba's civic culture) and those emphasizing institution-driven culture (Acemoglu & Robinson's inclusive institutions). Both frameworks gain explanatory power when institutions are understood as stigmergic spirals—recursive feedback loops between agents and environmental structures—rather than as one-directional causation.
The group concluded that protocol engineering should be reframed as the discipline of designing stigmergic media: the shared surfaces through which agents and environments co-modify each other. This principle connects entomology (termite mound-building), computer science (distributed systems), and political theory into a unified framework for understanding how large, decentralized populations achieve coordination without top-down control.
- Blockchains and durable streams are stigmergic data substrates where public state persistence enables coordination without centralized control.
- Protocol design should focus on engineering the shared medium (the stigmergic surface) rather than prescribing agent behavior, allowing coherent system-level emergence.
- Stigmergy dissolves the 60-year stalemate between 'civic culture' and 'inclusive institutions' frameworks by reframing institutions as environmentally mediated coordination spirals.
- Agent memory should be reconceptualized as environmental traces left in shared logs rather than internal capacity, enabling future agents to detect and respond without direct communication.
- Threshold effects (around 25-person groups) and group cognition constraints define when stigmergic mechanisms become viable for human coordination.
View discussion in Discord →Links discussed -
April 17, 2026Defining rules and abstractions for agent-dominated digital spaces across multiple layers (model latent spaces, OS, MCP marketplaces, GitHub)Observability and monitoring mechanisms for agent activities in colonized digital spacesRegulation frameworks to prevent anarchic 'dark forest' dynamics while unlocking agent capabilitiesTension between managing complex stochastic systems with simple deterministic toolsOperational principles: speed optimization, clarity of intent, and generalist approaches
Participants: _vgr, ananth9921, ediblebadger, senthil_d1sc0rd, sachbenny, zoesh, mtraven, biggiespells, .cyberscribe
The SIGFPT group convened to address how to establish formal protocols for the increasingly complex digital spaces occupied and created by AI agents. _vgr framed the problem: agents now operate across multiple abstraction layers—from model internals to operating systems to open collaboration platforms—yet lack coherent observational and regulatory frameworks. The group discussed transforming these spaces from ungovcrned 'dark forests' into high-energy civilized domains through proper protocolization.
The discussion emphasized several key tensions and principles. Participants noted that current management approaches often apply simple deterministic systems to fundamentally stochastic phenomena, driven by comfort rather than correctness. The group exchanged aphorisms emphasizing the importance of articulate generalism, tight feedback loops, clarity of intent ('if you don't know where you are going, any tool will do'), and maintaining operational discipline ('keep your shoelaces tied').
_vgr indicated plans to synthesize the discussion into a newsletter issue and published a summary and transcript on the Protocol Theory Roam page for further asynchronous development.
- Agents have colonized multiple layers of digital infrastructure (from processor latent spaces to MCP marketplaces), creating a need for coherent protocols and rules across these heterogeneous spaces.
- Current approaches often manage complex stochastic agent behavior through simple deterministic tools out of comfort rather than correctness, suggesting fundamental misalignment in governance philosophy.
- Successful agent space governance requires balancing iteration speed ('loop as fast as possible but no faster') with clear directional intent to avoid tool proliferation without purpose.
-
April 3, 2026Autocurricula as a lens for understanding social generativityGame theory and multi-agent reinforcement learning applicationsEmergent tool use and innovation from agent interactionCommon law as large-scale path-paving and emergent systemsMortal computation and bounded rationality
Participants: _vgr, ediblebadger, anurajenp, mtraven, giovanni.merlino
The SIGFPT group convened to explore autocurricula as a framework for understanding how innovation emerges from multi-agent interaction. Ediblebadger led a 15-minute overview of game theory and multi-agent reinforcement learning before diving into the core paper on autocurricula and social generativity. The discussion drew on OpenAI's emergent tool-use demonstrations and DeepMind's research on agent cooperation.
Participants extended the conversation into several cross-disciplinary directions. Mtraven engaged with Herb Gintis's work on bounded rationality and behavioral economics as theoretical foundations. Giovanni.merlino connected concepts to mortal computation and resource constraints in adaptive systems. Most notably, mtraven drew an analogy between the meeting's discussion of path-paving and common law as a large-scale emergent system built through iterative precedent and social interaction.
The group maintained a Roam Research page for ongoing reference, consolidating the transcript, readings, and discussion materials for future engagement with these topics.
- Autocurricula demonstrate how innovation and complex behaviors emerge naturally from multi-agent interaction, with OpenAI's tool-use examples providing concrete demonstrations of this principle.
- Common law functions as a large-scale instantiation of path-paving dynamics, where established practices become formalized through iterative social processes.
- Agent cooperation and bounded rationality frameworks (drawing on Herb Gintis's work) provide theoretical grounding for understanding how constraints enable rather than limit emergent complexity.
- Mortality and computational constraints are fundamental features of adaptive systems, not merely limitations to overcome.
View discussion in Discord →Links discussed -
March 20, 2026Bottom-up textbook authoring approach starting with homework problemsDesign of effective homework problem sets for protocol theory educationClustering and organization of protocol theory problemsAnalysis of pedagogical characteristics of classic problem-set oriented textsChapter-level problem set development for introductory protocol theory
Participants: _vgr, ananth9921
The SIGFPT meeting focused on initiating a novel approach to creating a protocol theory textbook by starting with carefully designed homework problem sets rather than traditional chapter content. _vgr presented the conviction that technical subjects are best learned through high-quality homework problems and proposed building a textbook collaboratively by first workshopping complete problem sets, clustering them thematically, and then authoring content chapters to match those clusters. This bottom-up methodology represents a departure from conventional textbook development. During this session, the group planned to workshop a full homework problem set suitable for an introductory chapter (approximately Chapter 2 or 3) of a hypothetical textbook, using classic problem-set oriented mathematics texts as pedagogical models. The meeting aimed to both produce concrete problem materials and analyze the characteristics that make homework problems effective teaching tools.
- Technical subjects are most effectively taught through well-designed homework problem sets, making them the optimal starting point for collaborative textbook authoring.
- A bottom-up approach—where content chapters are written to match clustered homework problems—may be more effective than traditional top-down textbook structure.
- The SIGFPT group aims to model their pedagogy after classic problem-set oriented mathematics texts like S. L. Loney's works on algebra and geometry.
- The group has reached sufficient foundational preparation to begin workshopping a complete homework problem set for an introductory chapter (Chapter 2 or 3) of a hypothetical protocol theory textbook.
-
March 6, 2026Live research methodology for Atomic Protocol Questions (APQs) with AI assistanceDisciplinary breadth and context/dimension selection for APQsNotebookLM as primary tool for exploration, search, and RAG workflowsIntegration of MCP/skills with NotebookLM for customized outputsBuilding a reusable basic APQ notebook template with foundational materials
Participants: _vgr, ediblebadger, anurajenp, unapologeticshenanigans, zoesh, senthil_d1sc0rd
The SIGFPT group conducted a live research session focused on developing methodology for creating and exploring Atomic Protocol Questions (APQs) through AI-assisted vibe coding. Led by ediblebadger, the session involved discussing the breadth of disciplines applicable to APQs, selecting relevant context/dimension pairs, and identifying interesting research angles. The group emphasized the importance of human expertise in spotting hallucinations during the AI-assisted research process. Participants decided that NotebookLM would serve as the primary tool for exploration and RAG-based research, though they acknowledged limitations in customization that could be addressed through MCP/skills integration. To facilitate future work, ediblebadger created a basic APQ notebook template containing key foundational materials including FPT essays, the unreasonable sufficiency essay, protocol watching materials, and the Timbers ETTO article, with the intent that this notebook could be forked for specific research applications.
- NotebookLM is the preferred tool for APQ exploration due to superior search and RAG capabilities, but MCP/skills provide a necessary bridge for generating customized outputs like code or styled prose.
- The group created a basic APQ notebook template populated with foundational essays (FPT essays, unreasonable sufficiency essay, protocol watching, and Timbers ETTO article) to enable forking for specific research contexts.
- The live research session will involve collaborative discipline exploration and problem selection, with participants expected to contribute domain expertise to identify and catch AI hallucinations.
View discussion in Discord →Links discussed -
February 20, 2026Modeling coding agents (Claude Code) as protocol processes with filesystem observabilityBuilding observability and tracing mechanisms into agentic systemsSkills-based architecture as a protocol for agent capability compositionConfigurancy: explicit behavioral contracts for safe agent system co-evolutionHuman-machine interoperability and the limits of 'vibe coding' without understandingAbstraction layers and the epistemological shift from symbolic to data distribution thinking
Participants: _vgr, senthil_d1sc0rd, ediblebadger, giovanni.merlino, simpalaxy, kylemathews, rafa_0x, mtraven, ananth9921
The SIGFPT group examined how to model coding agents like Claude Code as formal protocols, specifically addressing the observability challenge when agents have access to system state like filesystems. Participants shared experiences with agent visibility and control, discussing how Dropbox monitoring revealed Claude Code's actions at an unexpectedly high event volume. The conversation evolved toward designing 'AI-forward' protocols with built-in observability—including proposed tools like a Claude Watcher daemon and trace skills that log agent actions with timestamps.
A central theme emerged around 'configurancy,' formalized as the minimal set of explicit behavioral commitments allowing agents to safely modify systems. This contrasts with the 'vibe coding' approach, where humans outsource understanding to agents. While participants acknowledged abstraction enables progress, several voiced concern that excessive opacity prevents humans from understanding system behavior, especially as agent autonomy increases. The group suggested future work should focus on experiments that advance atomic protocol theory and surprise-yielding discoveries about agent coordination.
The discussion also touched on broader philosophical shifts: from thinking in symbols to data distributions, from reading code (now 'low status') to observing agent behavior traces, and from individual human authorship to distributed responsibility where legitimacy shifts to the platforms distributing agent-generated software.
- Agents operate at orders of magnitude higher event volume than humans, requiring new observability paradigms beyond human-readable logs—digital twins and semantic Kalman filters offer promising models.
- Configurancy defines the minimal set of explicit behavioral commitments needed for bounded agents to safely modify systems without rediscovering invariants; incomplete configurancy manifests as repeated invariant violations.
- Vibe coding abstracts away human understanding, raising critical questions about how humans will manage, debug, and modify systems whose internals are outsourced to opaque machinery.
- Skills function as protocols themselves, enabling persistent state and installation management through container mounting and update mechanisms that overcome ephemeral environment limitations.
- The SICP-inspired 'structure of knowledge' approach becomes hyperrelevant in the agentic age, suggesting thinking in data distributions rather than symbols may better capture emergent system behavior.
View discussion in Discord →Links discussed -
February 6, 2026Atomic Protocol Questions specification and goalsCategorization theory and prototype/exemplar modelsTesting protocols: process character vs outcome testingWikipedia governance and credibility assessmentInteractive framework development for protocol questions
Participants: _vgr, ediblebadger, mtraven, suspencer_nit, simpalaxy, doriantaylor
The SIGFPT group held the second meeting on Atomic Protocols, led by ediblebadger. The main focus was reviewing and improving the specification of Atomic Protocol Questions through a new interactive framework to replace the current Roam page. The group discussed theoretical foundations for categorization, drawing on cognitive science literature around prototype and exemplar theory—moving beyond traditional necessary/sufficient condition models. References to Eleanor Rosch and Robert Nosofsky were highlighted as key theorists. The discussion also touched on practical methodological questions around testing protocols, distinguishing between testing process characteristics versus outcomes. Additionally, the group explored applying these concepts to real-world domains, with mtraven contributing research on Wikipedia governance and credibility assessment as a potential case study, noting the field already has substantial existing literature.
- The group is transitioning from a Roam page to a more interactive system for triaging individual Atomic Protocol Questions with greater detail and engagement.
- Prototype theory and exemplar theory from cognitive science (Eleanor Rosch, Robert Nosofsky) provide theoretical frameworks for understanding how to define and categorize protocols beyond traditional set-theoretic models.
- A significant distinction exists between testing the character/process of protocols versus testing their outcomes, which has implications for protocol validation.
- Existing work on Wikipedia governance is extensive, creating both opportunities and challenges for applying collaborative knowledge frameworks to protocol development.
View discussion in Discord →Links discussed -
January 23, 2026Linear logic semantics and proof structuresInteraction nets and their relationship to pi calculusConstructivism and intuitionistic logic in protocol theoryLinear types for expressing liveness propertiesApplications of linear logic to protocol specification and processor behavior modeling
Participants: _vgr, simpalaxy, _ergod, anurajenp, senthil_d1sc0rd, artemishelios, austinjacobs_33961, plague_year, maparent, ediblebadger, mtraven
The SIGFPT group convened to explore linear logic and pi calculus as formal frameworks for protocol theory. Simpalaxy provided preparatory reading materials on linear logic semantics, interaction nets, and their relationships to established logical systems. The discussion touched on foundational concepts including constructivism, Brouwer's intuitionism, and the rejection of excluded middle, establishing that linear logic operates within a purely constructionist paradigm with interesting computational properties. A significant portion of the meeting focused on practical applications, particularly how linear logic and linear types can model real-world systems. The kitchen metaphor for processor behavior emerged as a compelling application area, where concepts like maximizing throughput and speculative execution map naturally onto linear logic operations, with exception handling modeled as time-reversal contradictions. The group also discussed probabilistic reasoning within the formalism and potential connections to industrial protocol questions, suggesting a structured approach moving from atomic protocol questions upward through pi calculus, interaction nets, and linear logic frameworks.
- Linear logic can be understood as a constructionist formalism with graph-reduction/transformation grammars that function like a physics engine for protocol behavior.
- Interaction nets generalize proof structures in linear logic and serve as a bridge between intuitionistic logic and pi calculus, similar to how lambda calculus relates to intuitionistic logic.
- Linear types can effectively express liveness properties and model processor behavior, including speculative execution as exception handling through time-reversal semantics.
- The group identified a potential research direction connecting linear logic/linear types to atomic protocol questions, with connections to temporal logic frameworks (LTL/TLA).
View discussion in Discord →Links discussed -
January 9, 2026Simplifying the definition of protocolization for broader accessibilityThe concept of 'tangles' and their relationship to Kafka protocolsAtomic protocols versus protocol molecules and interface interactionsProtocol invisibility as a framework for understanding formal systemsData-driven approaches to studying protocol emergence and evolutionPractical applications of protocol theory (concrete/water utilities, digital administrative surfaces)
Participants: _vgr, rafa_0x, nattfrosten, maparent, brianskinner3057, velitchkov.eu, ediblebadger, timber1997, plague_year, simpalaxy, senthil_d1sc0rd
The SIGFPT group convened for their 2026 kickoff to orient new and returning members and brainstorm research directions. The group discussed simplifying how protocolization is communicated, with participants noting that existing definitions are unnecessarily complex. A key insight emerged around protocol 'invisibility'—the idea that protocols are most effective when they operate as reliable, repeatable structures in the background, enabling visible creative/emergent activity on top. The group engaged with the tension between studying atomic protocols versus the more interesting interactions at protocol interfaces (molecules), with participants like maparent arguing the richer research space lies in how protocols compose. Several domain-specific applications were raised, including green concrete specifications in water utilities and digital administrative systems. The group identified a strategic goal for 2026: developing data-driven approaches to protocol analysis, including quantifying maintenance requirements and understanding how protocols emerge and evolve empirically, thereby grounding formal protocol theory in measurable outcomes.
- A simpler micro-definition of protocols—'reliably repeatable behavior'—may be more intuitive than existing formulations, with the 'tangle' concept resonating as particularly approachable.
- Protocol invisibility frames the distinction between what's organizationally possible 'off-protocol' (visible) versus the formal constraints (invisible), bridging the tension between formality and emergent/creative systems.
- Protocol interactions of greatest interest occur at interfaces between protocols ('molecules') rather than at atomic levels, suggesting focus should shift from isolated protocols to their compositional relationships.
- Quantifying minimum practice requirements for protocol maintenance (e.g., through fire drills) and developing data-driven methods to analyze protocol evolution could ground formal protocol theory in empirical validation.
- Power asymmetries between agents with unequal leverage can create Kafka protocols, where high-leverage agents cannot exit despite imbalance when low-leverage agents operate collectively.
View discussion in Discord →Links discussed -
December 12, 2025Actor model fundamentals and comparison with object-oriented programmingAsynchronous vs. synchronous communication as design primitivesAgent-based modeling and emergence in complex systemsIdeological and philosophical foundations of distributed systems researchApplications to population health simulation and policy analysis
Participants: _vgr, mtraven, giovanni.merlino, simpalaxy, milieu.us, ediblebadger, zoesh
The SIGFPT group held a session on actor models, exploring their theoretical foundations, relationships to other computational paradigms, and applications. The discussion centered on whether asynchronous communication should be the primitive with synchrony built on top (actor model approach) or vice versa (process calculi). Multiple participants argued that asynchrony is more fundamental, with zoesh framing this through a Coasean economic lens where synchrony emerges when coordination costs of asynchrony become too high. The group reviewed classical papers including Gul Agha's actor language overview and Kornfeld & Hewitt's scientific community metaphor. Practical applications were discussed, including ediblebadger's work on probabilistic microsimulations for population health policy analysis using the vivarium framework, and broader interest in agent-based modeling for capturing emergence and complex dynamics. The conversation touched on ideological dimensions of this research tradition, with participants noting both anarchist and market-oriented (Agoric Systems) influences that appeal across ideological lines.
- Actor models requiring explicit synchronization construction represent a design choice with tradeoffs compared to process calculi with built-in synchrony, with asynchrony arguably being more fundamental to how the world operates.
- The natural world defaults to asynchronous states, with synchrony emerging only when the coordination costs of asynchrony become prohibitively high, suggesting actor-based approaches better reflect reality than synchronous-first models.
- Bottom-up, agent-based modeling approaches enable exploration of emergence and complex dynamics, though computational burden has traditionally limited scaling to real-world system fidelity.
- Protocols can emerge as mechanisms for negotiating between individuals with mixed viewpoints by defining starting states, processes, and end states that establish agreement.
View discussion in Discord →Links discussed -
November 14, 2025Applying Coase theorem and transaction cost economics to protocol designInformation asymmetry, perfect information assumptions, and their failures in real systemsProtocols as institutions that front-load bargaining costs to reduce ongoing coordination costsThe role of friction and transaction costs in creating desirable constraintsInformation clearinghouses, disinformation economies, and who bears the cost of reliable information
Participants: _vgr, anurajenp, mtraven, simpalaxy, amitashu, maparent, sachbenny, stevebeans., ananth9921, plague_year, zoesh, .unipuff
The SIGFPT group explored how Coasean transaction cost economics applies to protocol design and governance. Participants reviewed foundational ideas from 'The Firm, The Market and the Law,' establishing that externalities can be resolved through clear property rights and bargaining—but only when transaction costs and information asymmetries are low, which rarely occurs in practice. The group identified protocols themselves as institutional mechanisms that reduce ongoing coordination costs by front-loading expensive design work (standardization, specification), functioning similarly to traffic systems, academic journals, and network protocols. A critical theme emerged: the conventional goal of minimizing transaction costs is neither achievable nor desirable. Friction and constraints provide valuable affordances, preventing certain behaviors while enabling stable coordination. The discussion highlighted a new wrinkle in information economics where reliable information is expensive while disinformation is free, creating novel institutional design challenges around information clearinghouses and evaluation costs—a problem the group argued protocols are uniquely suited to address. Finally, participants stressed that real-world externality problems with dispersed parties require collective institutions (NGOs, public broadcasters, Pigouvian mechanisms) rather than assuming bilateral Coasean bargaining will resolve conflicts.
- Protocols function as boundary institutions that pre-assign property rights and constrain action spaces, essentially front-loading expensive design and standardization work upfront to avoid repeated bargaining costs in operation.
- The ideal conditions of the Coase theorem (zero transaction costs, perfect information, few parties) almost never hold in practice; real externality problems require collective institutions like NGOs, public broadcasters, and information clearinghouses rather than just bilateral bargaining.
- Zero transaction costs are not actually optimal—some friction on behavior provides value across multiple axes and prevents undesirable outcomes, making the goal of eliminating all costs both naive and undesirable.
- Modern information economies reverse classical assumptions: reliable information now carries costs while disinformation/propaganda is free, creating a new institutional design challenge for protocols around who bears the cost of information evaluation and dissemination.
- Protocols structure time and predictability (horizons, trust, adaptation) as much as they structure action spaces, affecting how externalities can be resolved and bargaining can occur.
View discussion in Discord →Links discussed -
October 31, 2025Atomic Protocol Questions as a research framework inspired by Hilbert's problemsThe 'unreasonable sufficiency' of protocols and their dimensional propertiesQuality morphisms: relationships between protocol legitimacy, learnability, and generativitySovereignty and exception-handling in protocol designGovernance protocols and mechanisms for consensus when protocols fail
Participants: ediblebadger, _vgr, plague_year, bah.eth, mtraven, maparent, .unipuff, giovanni.merlino, ananth9921, timber1997
The SIGFPT group convened to discuss 'Atomic Protocol Questions,' a research framework inspired by Hilbert's 23 mathematical problems. The session explored what makes protocols fundamentally sufficient and effective, building from an earlier brainstorm about 'unreasonable sufficiency.' A major focus was understanding quality morphisms—whether protocols with high legitimacy or legibility also tend to be more learnable or generative. The discussion turned philosophical, engaging Schmitt's definition of sovereignty as the power to decide exceptions. The group identified a critical design challenge: protocols cannot comprehensively address all exceptional cases without either implementing rigid 'doomsday machine' logic or inevitably concentrating authoritarian decision-making power in some actor or voting cartel. Members emphasized that robust protocols must include explicit mechanisms allowing all stakeholders to signal when the protocol is failing, with maparent raising the provocative example of fascist takeover protocols to illustrate why exit/voice mechanisms are essential. The tension between rule-of-law constraint and necessary flexibility remained unresolved, with mtraven noting that in political contexts, violence often functions as the ultimate metaprotocol.
- The group framed their research agenda around 'unreasonable sufficiency of protocols,' analogous to Wigner's essay on mathematics, exploring what makes protocols fundamentally effective.
- A core tension exists between constrained rule-of-law approaches and necessary exceptional decision-making: protocols cannot exhaustively cover all escalations without either creating 'doomsday machine' logic or concentrating authoritarian power.
- Quality morphisms between protocol properties remain unmapped—it's unclear whether legitimacy, learnability, and generativity are correlated or operate independently.
- Protocols require built-in mechanisms for stakeholders to signal dysfunction, especially as a safeguard against capture (using fascist protocols as a reductio example).
View discussion in Discord →Links discussed -
October 17, 2025Maneuver automata from robotics applied to protocol theoryDifferential game theory and pursuit-evasion dynamicsNegotiation dynamics and goal compatibility in protocolsUnsupervised reinforcement learning in roboticsInterpretability and human interaction in AI-controlled systems
Participants: _vgr, anurajenp, ediblebadger, mtraven, zoesh, waveywaves., giovanni.merlino, maparent, timber1997
The SIGFPT group explored maneuver automata—a concept from robotics—as a formal framework for modeling protocols with natural dynamics. Participants reviewed the Frazzoli 2005 paper and related references to understand how maneuvers (non-equilibrium dynamics) could be systematically applied to protocol design. The discussion covered differential game theory's relevance to protocol sequences, particularly in scenarios like pursuit-evasion, and how negotiation dynamics could be formalized using state machines tracking proposal acceptance, conformance, and goal compatibility.
A significant theme emerged around the tension between optimization and interpretability: while deep learning can produce effective control systems, the inscrutability of such systems poses problems for human-interactive applications. Participants noted that existing AI-robot systems employ hybrid approaches rather than unconstrained learning. The group also discussed how unsupervised RL-based robotics could inform protocol theory, and emphasized the need for breaking down complex AI behaviors to reduce uncanny effects and maintain human trustworthiness.
- Maneuver automata can model protocols with natural dynamics by treating trim states as equilibria and maneuvers as non-equilibrium dynamics, with connections to game theory as a subset of negotiation dynamics.
- Differential game theory provides a mathematical framework for analyzing protocol sequences like pursuit-evasion, where specific maneuver sequences (e.g., 'double maneuver') can prove effective.
- Protocol negotiation involves states tracking proposal acceptance, conformance, goal compatibility, and the ability to withdraw unilaterally, forming a structured model of human interaction.
- There is tension between AI systems optimized through deep learning (which may be inscrutable) and the need for interpretability in systems involving human interaction to avoid uncanny or harmful effects.
- Practical AI-controlled robot systems use hybrid strategies combining LLM control with other approaches rather than pure unconstrained AI.
View discussion in Discord →Links discussed -
October 3, 2025Labeled Transition Systems (LTS) and their role in formalizing CCS processesStructural Operational Semantics (SOS) as inductive rules for valid transitionsBisimulation as a core equivalence notion in process calculiNotation challenges in process calculus (+ for choice, | for parallelism)Actor model as alternative concurrent system frameworkRelationship between process calculi and state diagrams/FSMs
Participants: _vgr, ediblebadger, mtraven, heterotic, .unipuff, timber1997, maparent
The SIGFPT group continued its deep dive into process calculi with a focus on how CCS processes are formalized as Labeled Transition Systems and governed by Structural Operational Semantics. Ediblebadger led the session with multiple presentations of related concepts, laying groundwork for future discussion of bisimulation as a key equivalence notion. The group discussed notation challenges, particularly around the use of '+' for nondeterministic choice and '|' for parallelism, with some participants finding the mathematical notation unintuitive despite its standardness in formal semantics. The conversation also touched on alternative approaches like the actor model and connections to conversation analysis. Discussion of broader SIG organizational questions emerged regarding BDFQ (presumably facilitators) roles and writing audiences, with acknowledgment that the material's abstractness is justified as a trade-off favoring mathematical precision over accessibility.
- Labeled Transition Systems provide a precise mathematical foundation for CCS processes, with Structural Operational Semantics formalizing valid transitions through inductive rules.
- The notation used in process calculi (particularly + for nondeterministic choice and | for parallelism) presents usability challenges for designers despite being mathematically standard.
- Abstractness in formal systems may be less exclusionary than prerequisite material requirements; the group compared this favorably to category theory adoption in other SIG channels.
- Process calculi can be interpreted as directed graphs or state diagrams, making them tractable for understanding concurrent systems without requiring extensive background knowledge.
View discussion in Discord →Links discussed -
September 19, 2025Landscape theory of aggregation and ensemble modeling approaches for protocol behaviorAxelrod-Bennett model critique and physics analogy limitationsCultural and semantic shifts in system dynamics beyond fixed propensitiesFormal methods applicability to protocol studiesTan paper project pitches and BDFQ proposal coordination
Participants: _vgr, bah.eth, .unipuff, mtraven, anurajenp, maparent, simpalaxy, va3bhav., summersaahn, ediblebadger, heterotic, stevebeans.
The SIGFPT meeting focused on discussing Axelrod and Bennett's landscape theory of aggregation and its application to protocol behavior modeling. After a 20-minute silent reading period, participants engaged in critical analysis of the paper's use of physics analogies, with ediblebadger noting that while the core insight about physical model analogies to social systems is valid, the execution lacks formal rigor. brianskinner3057 highlighted a specific missed opportunity: the paper didn't leverage magnetic phase transition theory (paramagnetic, ferromagnetic, and glass phases) as useful analogies for understanding different system regimes.
Key discussion points included austinjacobs_33961's insight that cultural and protocol systems differ fundamentally from fixed biological systems because propensities themselves shift through narrative and semantic reframing—the example of Microsoft-Apple rivalry realigning around open standards illustrated how the terrain itself changes. The group also debated the role of formal methods in protocol studies, with simpalaxy noting the tension between proof-theoretic approaches and practical skepticism about their applicability, citing parallels to software verification debates (Dependent Type Theory vs. TLA+ camps).
The meeting concluded with coordination around the Tan paper project pitches, including discussion of project management approaches, scope definitions (distinguishing micro vs. meso-scale through procedural rather than structural terms), and potential collaboration between participants with overlapping research interests. ediblebadger emphasized the appeal of doing private, loosely-centralized research with low barriers to entry.
- The Axelrod-Bennett landscape model provides a useful analogy but lacks rigor in applying physics concepts; a missed opportunity was not discussing magnetic phase transitions (paramagnet, ferromagnet, glass phases) as analogies for different system behaviors.
- Protocol systems differ from biological ones because propensities and values shift through meaning and narrative changes—the 'valleys' themselves move when semantics change, not just agents rolling into fixed valleys.
- There is tension between applying formal methods (logic, proof theory, dependent types) and the skepticism about their practical applicability to protocol movement problems, though both approaches have research value.
- The group is adopting a non-hierarchical, low-barrier-to-entry research model for deep-tech investigation with careful attention to scope boundaries (micro vs. meso-scale procedural definitions, excluding macro 'world history').
View discussion in Discord →Links discussed -
September 13, 2025Woodenman group representative reports on outlines and mindmapsAll-hands townhall discussionScaffolding for opt-in next steps
Participants: _vgr
This was a roadmapping session for the SIGFPT (Formal Protocol Theory) group at the Protocol Institute. The meeting agenda included gathering reports from Woodenman group representatives on their outlines and mindmaps, conducting an all-hands townhall discussion, and discussing scaffolding mechanisms for opt-in next steps. However, the transcript provided contains only the agenda items without substantive discussion content, outcomes, or conclusions from the meeting itself.
View discussion in Discord → -
September 13, 2025Assembling preliminary framework for small group paper developmentRelated work on unprotocolized knowledge and knowledge graphsOntological frameworks and knowledge representation systemsIntegration of existing research from Summer of Protocols Year 1
Participants: _vgr, maparent, jamesgiammona, boredgargoyle, brianskinner3057
The SIGFPT group convened for a synthesis session to consolidate their discussions into a preliminary picture for a smaller working group. The meeting focused on identifying where sub-topics and proposed contributions should be documented on their collaborative platform (Woodenman/Roam). Participants referenced relevant prior work, including Mike's "Unprotocolized Knowledge Web" from the Summer of Protocols Year 1 initiative and a knowledge graph framework piece. The discussion touched on ontological shifts as a lens for understanding knowledge system transformations, using Pluto's reclassification as a conceptual example. The group discussed how knowledge representation systems build upon existing frameworks and structures.
- The group aims to synthesize previous discussions into a cohesive preliminary framework that a 4-6 person breakout group can develop over several months.
- Ontological changes (referenced through Pluto's demotion example) relate to how knowledge systems fundamentally categorize and restructure understanding.
- Knowledge graphs and shoulders-of-giants frameworks provide relevant conceptual foundations for the formal protocol theory work being pursued.
View discussion in Discord →Links discussed -
September 12, 2025Lightning talk format and structure (7-minute talks on single concepts)Whitehead automaticity as a candidate concept for protocol theoryLiveness as a first-class property of protocolsDistinguishing protocols from norms, algorithms, rituals, and institutionsTechnical presentation methods (Roam pages, diagrams, LaTeX notation)
Participants: _vgr, maparent, timber1997, amitashu, wevin_64764, .unipuff
The SIGFPT group held their second session focused on sensemaking through lightning talks. The organizer established a specific format: 7-minute talks on single useful concepts, diagrams, or operations, presented via Roam pages or visual/mathematical notation rather than traditional slides. One participant requested scheduling accommodation for a 2PM Pacific conflict. During the session, key discussions emerged around identifying foundational concepts in formal protocol theory, with 'whitehead automaticity' highlighted as a promising area of focus. A significant insight from the discussion was the recognition that 'liveness' should be elevated to a first-class property distinguishing protocols from related but distinct categories like norms, algorithms, rituals, and institutions. The group emphasized condensing protocol theory into its most essential, communicable components.
- The group is focusing on identifying and elevating key concepts in formal protocol theory through short, focused lightning talks emphasizing clarity over slides.
- Liveness emerged as a critical property that should be formally recognized as a distinguishing characteristic of protocols, particularly macroprotocols, setting them apart from similar constructs.
- The concept of 'whitehead automaticity' was identified as a promising candidate for protocol formalization, though specific details remain undeveloped in the transcript.
- There is an intentional move toward distilling protocol theory into its most essential concepts and visual representations rather than relying on traditional presentation formats.
View discussion in Discord →Links discussed -
September 12, 2025Formal decomposition of handshake protocol parametersCultural and contextual variables in physical greeting protocolsSignal medium and agent recognition in protocol executionDisease transmission dynamics through repeated handshake interactionsIndividual variation in protocol implementation across participants
Participants: _vgr, heterotic, maparent, anurajenp, brianskinner3057, smith_36609_95392, boredgargoyle, mtraven, austinjacobs_33961, va3bhav., sirish_aditya, radni
The Protocol Foundations Workshop began with an orientation session focused on analyzing the handshake as a formal protocol system. Participants were prompted to identify the key variables and parameters that govern successful handshake execution. The group collectively identified dozens of factors including grip strength, duration, eye contact, hand positioning, initiation signals, cultural context, physical distance, and emotional valence. Notably, participants recognized that handshake protocols are context-dependent, varying based on cultural background, relative age/seniority, physical build, and the presence of observers. One participant noted that from an epidemiological perspective, the frequency of handshake turnover may be a more significant factor than the specific characteristics of individual handshakes.
- Handshake protocols involve multiple independent variables spanning physical (grip strength, duration, distance), social (eye contact, initiation), and cultural (standardization, appropriateness) dimensions.
- Context parameters like cultural background, age/seniority relationships, and shared observer presence significantly influence which handshake variant is executed.
- The epidemiological impact of handshakes may depend more on turnover frequency (how many handshakes occur) than on internal handshake parameters themselves.
- Protocol execution requires pre-negotiation of signal medium and mutual agent recognition before the physical interaction can proceed successfully.
View discussion in Discord →Links discussed -
September 5, 2025Formalizing handshaking protocols in CCS with state transitions and safety propertiesModeling handwashing as a multi-agent system with different initial states (dirty, oily, clean)Ï€-calculus approach to partner selection and dynamic rendezvous in protocolsCSP formalism for modeling refusals and consent as first-class entitiesCompliance and hidden assumptions in protocol formalization using process calculiTemporal aspects and duration modeling in protocol specifications
Participants: _vgr, ediblebadger, timber1997, plague_year, zoesh, nattfrosten, giovanni.merlino, .unipuff, ananth9921
The SIGFPT group continued their process calculi track by applying CCS formalism to model real-world protocols: handshaking and handwashing. The session began with a recap of previous material and leveraged LLMs to generate notation references and worked examples. Participants brainstormed relevant modeling dimensions and then independently developed formal specifications, with several novel approaches emerging.
Key contributions included: _vgr's basic CCS handshake model; nattfrosten's three-agent handwashing system (NEED, POSTER, HUMAN) capturing the cognitive reminder loop; giovanni.merlino's π-calculus variant using name passing for partner selection in crowds and CSP variant for explicit refusal/consent modeling; and .unipuff's detailed handwashing specification accounting for different initial states (dirty, oily, clean) with corresponding action sequences. Participants identified interesting safety, liveness, and mutual exclusion properties to investigate further.
The group highlighted compliance as a critical formalization challenge—protocol correctness depends on hidden assumptions and expectations not always explicit in the specification. Future work includes applying Allen's temporal interval calculus to add duration semantics and further composing simple protocols into larger systems to identify interesting trace behaviors.
- CCS provides a tractable framework for modeling prototypical protocols like handshaking and handwashing by explicitly representing agents, states, and transitions, though some participants found the notation unintuitive initially.
- π-calculus with name passing enables elegant modeling of dynamic partner selection in crowd scenarios by using public channels for rendezvous and private channels for actual interaction.
- Handwashing can be naturally modeled as a multi-state system with different initial conditions (dirty, oily, clean) requiring different action sequences, capturing real-world complexity beyond simple protocols.
- Compliance in protocols relates to hidden expectations and assumptions that may need to be formalized as hidden events in CSP, raising questions about what constitutes correct protocol adherence.
- LLMs proved valuable for quickly generating notation cheat sheets and simple examples, reducing cognitive overhead in technical skill acquisition.
View discussion in Discord →Links discussed -
August 22, 2025Witsenhausen counterexample and decentralized stochastic controlImpossibility results and conserved quantities in protocolsFocal points, Schelling points, and agent coordination without pre-agreementEfficiency-thoroughness trade-offs in protocol designSignaling requirements for protocol adherence and equilibrium maintenance
Participants: _vgr, _ergod, simpalaxy, timber1997, sachbenny, rafa_0x, jdbb, nattfrosten, osm4n_29082, heterotic, ediblebadger, anurajenp
The SIGFPT group examined the Witsenhausen counterexample as a lens for understanding fundamental constraints in decentralized protocol design. The counterexample illustrates why traditional control theory and game theory frameworks inadequately capture the challenges of decentralized, non-sequential decision-making. Participants explored various impossibility results and conserved quantities, including efficiency-thoroughness trade-offs (exemplified by comparing different handwashing protocols), the necessity of Schelling points for coordination, and the role of signaling in maintaining protocol equilibria. A key theme emerged: protocols inherently require agents to signal adherence visibly, which constrains their design—human-comprehensible but suboptimal behaviors may be necessary in mixed human-machine systems. The group concluded that successful protocol design involves balancing centralization and decentralization pragmatically, and that apparent 'universal' coordination mechanisms often smuggle in culturally or contextually specific assumptions.
- Most protocols face fundamental decentralization and non-sequentiality challenges that traditional game theory frameworks struggle to express, making the Witsenhausen counterexample particularly relevant to protocol design.
- Protocols represent a fundamental compromise: a set of signals and responses enabling reliable outcomes when computing optimal solutions is impossible, subject to efficiency-thoroughness trade-offs that cap how well they can map to uneven problem spaces.
- Focal points and Schelling points require implicit agent symmetry and shared assumptions; achieving coordination without pre-negotiation necessitates sneaking in universal assumptions rather than discovering them organically.
- Protocol adherence requires visible signaling of compliance to maintain equilibria, favoring protocols that balance demonstration of protocol-following over pure work optimization, particularly in mixed human-machine systems.
- The tension between decentralization and functionality suggests an iterative principle: 'decentralize till it hurts, re-centralize till it works.'
View discussion in Discord →Links discussed -
August 8, 2025Calculus of Communicating Systems (CCS) as foundational formalism for concurrent processesRelationship between linear logic, typed pi calculus, and resource-sensitive communicationInteraction nets and bigraphical reactive systems as graphical formalisms for process modelingHandwashing and handshakes as minimal examples for testing protocol theoryExpressivity, primitives, and syntax sugar in formalizing protocols
Participants: _vgr, ediblebadger, simpalaxy, timber1997, giovanni.merlino, plague_year, sachbenny, stevebeans., nattfrosten
The SIGFPT group studied process calculi as formal tools for protocol theory, focusing on the Calculus of Communicating Systems (CCS) by Mantis Cheng as the primary reading. The discussion connected CCS to lambda calculus as the concurrent analogue, explored how linear logic's resource-sensitive semantics map onto typed pi calculus communication primitives, and examined more expressive formalisms like interaction nets and bigraphs that enable channel sharing and protocol evolution. Members worked through handwashing and handshakes as minimal model systems to test their formalization approaches, discovering a tension between modeling low-level automata versus capturing the higher-level protocol structure involving resource exhaustion and causality ordering.
Key tensions emerged around expressivity versus tractability: while CCS is limited, adding features like channel sharing enables richer protocols but requires substantial syntactic sugar (analogous to how Haskell is built on lambda calculus). The group questioned whether handwashing definitions should be necessary-and-sufficient or merely sufficient (like a family of equivalent paths in homotopy theory), and recognized that their current CCS models were capturing mimicked actions rather than the essential protocol semantics of state transitions and resource constraints. The conversation highlighted the need for multiple future sessions to fully grasp the material and develop more sophisticated formalizations incorporating temporal/causal ordering.
- Pi calculus relates to concurrent systems as lambda calculus relates to sequential computation; linearly typed pi calculus enforces one-to-one channel communication as a resource restriction.
- Linear logic's negative/positive formula distinction maps directly onto pi calculus send/receive primitives, enabling both server and client perspectives with different notions of choice and control.
- CCS provides a limited but tractable foundation; more expressive formalisms (pi calculus with channel sharing, interaction nets, bigraphs) enable protocol evolution but require syntactic sugar for practical use.
- Handwashing protocols are best modeled as families of behavioral paths rather than necessary-and-sufficient definitions, similar to homotopy equivalence classes of solutions to reaching the same goal state.
- The distinction between modeling automata that mimic actions versus capturing the essential resource-sensitive and causality-ordered aspects of protocolization remains a key open question.
View discussion in Discord →Links discussed -
July 25, 2025Fermi estimation and back-of-envelope calculation techniques for protocol designDimensionless quantities as fundamental design parameters (Reynolds number, Mach number analogs)Self-driving car intersection management as a protocol design case studyPhase transitions and regime shifts in protocol behavior (El Farol bar problem, congestion pricing)Attack surface scaling and equilibrium dynamics in protocol security
Participants: _vgr, plague_year, timber1997, ediblebadger, mtraven, stevebeans., ananth9921
The SIGFPT group convened to explore how paper-napkin protocol mathematics—grounded in Fermi estimation and dimensional analysis—can inform formal protocol theory. After reading Venkat Rao's essay on Fermi estimates and Dyson designs, participants worked through a warmup exercise on self-driving car intersection protocols, exploring state-space reduction through symmetry and safety constraints. The discussion evolved toward identifying dimensionless quantities as the key lever for protocol design: just as aerospace engineers use thrust-to-weight ratios and fluid dynamicists use Reynolds numbers to characterize regimes, protocol designers should seek analogous dimensionless parameters that reveal design constraints and phase transitions.
Participants drew connections between various protocol phenomena and phase-shift models like the El Farol bar problem, noting that congestion pricing, Ethereum gas markets, and TCP/IP all operate within regime-dependent equilibria. A central tension emerged: successful protocols deform their operational domains and shift equilibria in ways the original design didn't anticipate, but this very scaling generates attack surface area that eventually outpaces defensive investment. The group concluded that foundations work should focus on discovering these critical dimensionless parameters and understanding how protocols can be nudged across regime boundaries—maintaining empirical grounding while avoiding abstract mathematical detachment.
- Dimensionless parameters (like thrust-to-weight ratio in aerospace) are crucial for identifying design constraints and determining how to shift systems from unfavorable to favorable regimes.
- Many protocol problems exhibit phase transitions similar to fluid dynamics (Reynolds, Mach numbers) or game-theoretic models (El Farol bar), where identifying the critical dimensionless parameter enables systematic design intervention.
- As protocols scale, attack surface area grows faster than defensive capabilities, creating an equilibrium problem where the protocol must continuously deform its operating domain to avoid becoming indefensible.
- Keeping analysis empirically grounded through Fermi-style estimation prevents abstract mathematical spiraling while maintaining connection to testable predictions and real-world constraints.
View discussion in Discord →Links discussed -
July 11, 2025Notation design principles and suggestivity in formal systemsIverson paper review on mathematical notationPetri nets and knot theory applications to protocol notationCollaborative notation scheme for handshakes and handwashing protocolsSymbol design constraints: balancing axioms with expressivityHistorical connections between notation systems and mechanical/computational processes
Participants: _vgr, ediblebadger, akkartik, benzucker., timber1997, arseniy.eth, rafa_0x, brtrx_
The SIGFPT group convened to discuss notation systems for formal protocols, with particular focus on Kenneth Iverson's work on mathematical notation and the concept of 'suggestivity'—how notation can intuitively convey meaning. After reviewing the Iverson paper, participants shared favorite notation systems and then engaged in a collaborative brainstorming exercise to design a formal notation for handshakes and handwashing protocols. Rafa_0x generated a comprehensive symbol scheme using specialized characters (⊃, ⊂, ■, ✚, ∩, ×, ⇄, etc.) to represent hand positions, orientations, contact types, and actions, created with assistance from an LLM (o3) and refined through axiom-based constraints. The group recognized that without clear axioms governing symbol usage, notation rapidly becomes intractable. The discussion also connected notation design to broader historical themes: the relationship between weaving machines and computing, the application of knot theory to protocol representation, and Petri nets as alternative formal systems for capturing protocol behavior.
- Notation design must be constrained by a mix of axioms and expressivity emphasis on particular concepts to avoid intractable complexity.
- Axioms function as symbol usage constraints that prevent notational systems from becoming messy or undefined.
- Suggestivity in notation (as Iverson describes it) is essential for effective formal systems, exemplified by 3Blue1Brown's Triangle of Power video.
- There are deep historical parallels between notation systems, weaving machines (Jacquard looms), and early computing, suggesting notation itself is a form of protocol.
View discussion in Discord →Links discussed -
June 27, 2025Observability frameworks and methodologies across domains (software, cloud, AI)Climate and environmental protocol observability challengesLow-cost and alternative sensing approaches (computer vision, citizen science, remote sensing)Randomization and adversarial resistance in monitoring systemsMulti-layered imperfect observations as practical alternatives to perfect measurement systems
Participants: _vgr, plague_year, ediblebadger, thewanderingeditor, timber1997, .unipuff, stevebeans.
The SIGFPT group convened to explore observability principles for protocols, drawing parallels from software engineering, cloud systems, and AI monitoring. The discussion ranged across environmental and climate applications, with members sharing concrete examples like Landsat satellite imagery for solar development tracking, methane remote sensing, and citizen science approaches to waste composition estimation. A central theme emerged around the tension between engineering ideals of comprehensive perfect observation and practical realities: multiple overlapping imperfect observations, combined with randomized monitoring (preventing gaming through unpredictability), may be more effective and cost-efficient than attempting to achieve complete measurement coverage.
Participants highlighted how primitive random variables (initial conditions, disturbances, and model parameters) serve as diagnostic anchors for observability design. Inspiration was drawn from polycentric governance models like California's groundwater adjudication, which manages through patchwork jurisdictions rather than centralized perfect control. The group also discussed technical challenges, such as rapidly processing voluminous documents for state observers, and broader feedback loops where climate events influence public opinion and policy. The conversation suggested that protocol observability design requires balancing measurement precision, cost, political feasibility, and adversarial robustness.
- Computer vision and low-cost sensing methods (cameras on wheels, analogue meter imaging) offer alternatives to specialized sensors for observability, though real-world deployment remains challenging.
- Perfect observability systems are often impractical; multiple overlapping imperfect observations with randomized inspection protocols (inspired by polycentric governance models) may be more effective for climate and environmental protocols.
- Randomization is a key design principle to prevent actors from gaming monitoring systems, successfully implemented in blockchain data availability sampling and unannounced inspection regimes.
- The cost of observability itself is a critical practical constraint in domains like climate protocols, requiring interdisciplinary thinking between engineering precision and political/financial feasibility.
- Key system diagnostics involve identifying primitive random variables (initial conditions, external disturbances, and model parameters) that must be estimated through observations.
View discussion in Discord →Links discussed -
June 13, 2025Formal mathematical modeling of simple micro-protocols (handshakes and handwashing)State machine and Markov chain approaches to protocol representationProtocol failures and incompatibility ('protocol miss' scenarios)Asymmetric vs. symmetric greeting protocols across culturesDiscretizing continuous motions into formal state spacesObservability and measurement costs in system modeling
Participants: _vgr, amitashu, timber1997, jdbb, plague_year, stevebeans., ediblebadger, bah.eth
The SIGFPT group held its soft launch meeting to introduce members and explore formal modeling of two simple micro-protocols: handshakes and handwashing. Participants introduced varied mathematical backgrounds and brainstormed paper-napkin approaches. Key frameworks emerged: viewing handwashing as a probabilistic execution protocol with time-dependent compliance (modeled via Markov chains), and handshakes as synchronization events between agents. Several participants proposed representing humans as agents and bacteria as environment, with protocols either crossing or establishing boundaries. The group discussed protocol failures extensively, introducing the concept of 'protocol miss' for incompatible simultaneous initiations and noting the variety of deflection responses (bows, namaste, stop gestures).
Participants identified complementary protocols worth studying (military salutes, emoji-based handshakes, secret handshakes) and noted potential for horizontal generalization toward standardized representations. A key tension emerged between maintaining modeling simplicity and ensuring completeness, with modern tools like game engines potentially enabling greater complexity. The discussion included practical considerations about discretizing continuous motions into state machines using stable states defined by hand geometry and biomechanics, and whether information-theoretic frameworks might better capture handshake asymmetries and social meaning.
- Protocols can be modeled by representing the negative event they prevent: handshakes prevent violence while handwashing prevents disease, with protocol execution reducing the probability of that undesired outcome.
- The choice between viewing a protocol as synchronization (handshake) versus execution (handwash) fundamentally influences the entire modeling approach and complexity.
- Protocol failures ('protocol misses') create rich modeling space with multiple deflection types and refusal states that go beyond binary success/failure, including bows, namaste, and stop gestures.
- Continuous physical interactions like handwashing can be discretized into stable states defined by hand orientation, surface contact area, symmetry, and biomechanical transitions rather than attempting to model continuous motion directly.
- Information-theoretic constraints may be more appropriate for modeling handshakes than state machines, particularly when analyzing how asymmetric gestures convey shared social understanding.
View discussion in Discord →Links discussed -
February 6, 2025
Participants: timber1997
This transcript represents a meeting announcement for the Protocol Institute's SIGFPT (Formal Protocol Theory) group Week 8 discussion session. The meeting was scheduled for Thursday, February 6, 2025, from 1:00-2:00 PM EST with a Google Meet video call link provided. No substantive discussion content or topic details are present in the transcript provided.
View discussion in Discord → -
Week 6 Discussion Thread - SIGFPT
Participants: timber1997, valentingolev
This meeting thread shows minimal substantive content. The thread was activated by timber1997 on January 21, 2025, with a calendar invite link provided for participants. Valentingolev's only contribution was a GIF from The Simpsons on January 23, 2025, which appears to be a humorous response rather than substantive discussion content. No formal protocol theory topics were discussed or documented in the visible transcript.
View discussion in Discord → -
Week 5 Discussion Thread - SIGFPT Formal Protocol TheoryCalendar coordination for group meetingsThread protocol activation procedures
Participants: timber1997, valentingolev
This brief discussion thread from the Protocol Institute's SIGFPT group focuses on organizing meeting logistics for Week 5. The thread was initiated by timber1997 on January 13, 2025, with a thread protocol activation. Two days later, valentingolev requested a calendar link for the meeting. timber1997 responded promptly by sharing a Google Calendar link to facilitate scheduling and attendance coordination.
- The group uses thread protocols to structure asynchronous discussions within the SIGFPT working group.
- Calendar sharing via Google Calendar is the standard method for coordinating meeting logistics among participants.
-
Week 7 Discussion: Legal Frameworks and Dispute Resolution Mechanisms in Trade ProtocolsNAFTA legal framework and structural designDispute resolution mechanisms in trade protocolsPrevention of unilateral action in international agreementsCourt systems within trade protocolsProtocol enforcement mechanisms
Participants: timber1997
The Week 7 SIGFPT discussion focused on examining the legal and institutional framework underlying NAFTA as a case study in formal protocol design. A participant shared a Paul Krugman article discussing how trade protocols establish mechanisms—particularly court systems and dispute resolution procedures—to prevent unilateral action by member states. This discussion connected practical examples from real-world trade agreements to broader theoretical concerns within formal protocol theory about how protocols constrain behavior and maintain compliance through institutional design.
- Trade protocols like NAFTA incorporate formal legal frameworks and court systems designed to prevent participating nations from taking unilateral action.
- The structural mechanisms within trade agreements serve as critical constraints on individual state behavior and enforce compliance through institutionalized dispute resolution.
- Understanding the legal architecture of protocols is essential to formal protocol theory, as these systems embody practical implementations of constraint-based governance.
View discussion in Discord →Links discussed
Interested in joining? Join the Discord community →