BRAID (Bounded Reasoning for Autonomous Inference and Decisions) integration for DSPy framework
Project description
BRAID-DSPy Integration
A Python library that integrates BRAID (Bounded Reasoning for Autonomous Inference and Decisions) architecture into the DSPy framework, enabling structured reasoning through Guided Reasoning Diagrams (GRD) in Mermaid format.
Overview
BRAID-DSPy brings structured reasoning capabilities to DSPy by requiring models to first generate a machine-readable flowchart (GRD) before executing the solution. This separation of planning and execution significantly improves reliability and reduces hallucinations.
Motivation
This project began when I first encountered the BRAID architecture during one of Armağan Amcalar's live streams. The two-phase reasoning approach — planning first, then execution — and the idea of representing this planning in a visualizable format (Mermaid diagrams) immediately captured my interest.
After the stream, I delved into OpenServ's articles and technical details about BRAID. The approach of having the model first generate a flowchart (Guided Reasoning Diagram - GRD) and then execute the solution step-by-step according to this schema seemed like a significant step forward for reliability and transparency in AI systems. I realized that integrating this architecture with the DSPy framework would need to work seamlessly with existing DSPy modules and optimizers, which led me to develop this library to make that integration a reality.
Much of the development process involved "vibe coding" — following intuition and iterating based on what felt right rather than strictly following a predefined plan. This organic approach allowed the library to evolve naturally as I explored the integration between BRAID and DSPy.
Key Features
Core Capabilities
- Guided Reasoning Diagrams (GRD): Generate Mermaid-format flowcharts that map solution steps
- Two-Phase Reasoning: Separate planning and execution phases for better reliability
- DSPy Integration: Seamlessly integrates with existing DSPy modules and optimizers
- Auditable Reasoning: Visualize and debug reasoning processes through GRD diagrams
- Optimization Support: BRAID-aware optimizers for improving GRD quality
BRAID Protocol Features (v0.2.0+)
- Numerical Masking: Prevent answer leakage by masking computed values in GRDs
- Node Atomicity: Validate and enforce ≤15 tokens per node for optimal performance
- Procedural Scaffolding: Ensure GRDs describe HOW to solve, not WHAT the answer is
- Stateful Execution: Dynamic GRD traversal with conditional branching and cycle support
- Critic Feedback Loops: Self-verification with retry mechanisms
- PPD Metrics: Performance-per-Dollar analysis for cost optimization
- Training Utilities: Generate synthetic data for fine-tuning Architect models
Installation
pip install braid-dspy
Quick Start
Basic Usage
import dspy
from braid import BraidReasoning
# Configure DSPy
lm = dspy.OpenAI(model="gpt-4")
dspy.configure(lm=lm)
# Create a BRAID reasoning module
braid = BraidReasoning()
# Use it in your pipeline
result = braid(problem="Solve: If a train travels 120 km in 2 hours, what is its speed?")
print(result.answer)
print(result.grd) # View the reasoning diagram
BRAID Protocol Features
Numerical Masking (Prevent Answer Leakage)
from braid import NumericalMasker
masker = NumericalMasker()
# Mask computed values in GRD to prevent answer leakage
grd = "Calculate[Speed = 60 km/h] --> Answer[Result = 60]"
result = masker.mask(grd)
print(result.masked) # "Calculate[Speed = {{VALUE_2}}] --> Answer[Result = {{VALUE_1}}]"
print(result.value_mapping) # {'{{VALUE_1}}': '60', '{{VALUE_2}}': '60 km/h'}
# Detect potential answer leakage
leaks = masker.detect_leakage(grd)
print(f"Found {len(leaks)} potential leaks")
GRD Validation (Atomicity & Scaffolding)
from braid import GRDValidator, MermaidParser
parser = MermaidParser()
validator = GRDValidator(max_tokens_per_node=15)
grd_code = '''flowchart TD
Start[Analyze the problem] --> Extract[Extract given values]
Extract --> Calculate[Apply the formula]
Calculate --> Answer[State the result]
'''
parsed = parser.parse(grd_code)
result = validator.validate(parsed)
print(f"Valid: {result.valid}")
print(f"Score: {result.score:.2f}")
print(f"Issues: {len(result.issues)}")
PPD Metrics (Cost Analysis)
from braid import PPDAnalyzer, TokenUsage
# Track costs for BRAID execution
analyzer = PPDAnalyzer(
architect_model="gpt-4",
solver_model="gpt-3.5-turbo"
)
# Track usage
analyzer.track_usage(TokenUsage(500, 200), "planning")
analyzer.track_usage(TokenUsage(100, 50), "execution")
analyzer.track_usage(TokenUsage(100, 50), "execution")
# Generate report
print(analyzer.generate_report(accuracy=0.95, format="markdown"))
# Compare with baseline
report = analyzer.compare_with_baseline(accuracy=0.95, baseline_model="gpt-4")
print(f"Efficiency vs GPT-4: {report.efficiency_multiplier:.2f}x")
Training Data Generation
from braid import SyntheticDataGenerator, ArchitectTrainer
# Generate synthetic training data
trainer = ArchitectTrainer()
samples = trainer.generate_training_dataset(
size=100,
output_path="training_data.jsonl",
format="jsonl"
)
# Prepare OpenAI fine-tuning dataset
finetune_data = trainer.prepare_openai_finetune_dataset(samples)
Architecture
BRAID-DSPy implements a three-phase reasoning architecture that expands on the original BRAID paper by adding numerical masking, protocol validation, and stateful execution.
High-Level Architecture
flowchart TD
subgraph Planning["Phase 1: Planning"]
A[Problem Input] --> B[GRD Generation]
B --> C[Numerical Masking]
C --> D[Protocol Validation]
end
subgraph Execution["Phase 2: Execution"]
D --> E[Stateful Engine]
E --> F{Conditional Branching}
F -->|Step| G[Model Call]
G --> H{Critic Review}
H -->|Retry| E
H -->|Success| F
F -->|Done| I[Final Answer]
end
subgraph Analysis["Phase 3: Analysis"]
I --> J[PPD Metrics]
J --> K[Efficiency Report]
end
classDef planningPhase fill:#e1f5ff,stroke:#01579b,stroke-width:2px
classDef executionPhase fill:#e8f5e9,stroke:#1b5e20,stroke-width:2px
classDef analysisPhase fill:#fff4e1,stroke:#e65100,stroke-width:2px
class Planning,A,B,C,D planningPhase
class Execution,E,F,G,H,I executionPhase
class Analysis,J,K analysisPhase
Component Architecture
graph TB
subgraph CORE["Core Modules"]
A["BraidReasoning<br/>Main Module"]
B["GRDGenerator<br/>Planning"]
C["MermaidParser<br/>Parsing"]
end
subgraph PROTOCOL["BRAID Protocol"]
D["NumericalMasker<br/>Anti-Leakage"]
E["GRDValidator<br/>Atomicity & Scaffolding"]
F["PPDAnalyzer<br/>Cost & Metrics"]
end
subgraph ENGINE["Execution Engine"]
G["StatefulExecutionEngine<br/>Branching & Cycles"]
H["CriticExecutor<br/>Self-Verification"]
end
subgraph TRAINING["Training Utilities"]
I["SyntheticDataGenerator"]
J["ArchitectTrainer"]
end
A --> B
A --> C
A --> G
B --> D
C --> E
G --> H
H --> G
classDef main fill:#4a90e2,stroke:#01579b,stroke-width:3px,color:#fff
classDef protocol fill:#fff4e1,stroke:#e65100,stroke-width:2px
classDef engine fill:#e8f5e9,stroke:#1b5e20,stroke-width:2px
classDef training fill:#f3e5f5,stroke:#7b1fa2,stroke-width:2px
class A main
class D,E,F protocol
class G,H engine
class I,J training
Key Components
-
BraidReasoning: Main module that orchestrates the entire lifecycle.
- Orchestrates planning, execution, and validation phases.
- Accumulates execution context and extracts final answers.
-
BRAID Protocol Implementation:
- NumericalMasker: Prevents answer leakage by masking values in GRDs using regex-based placeholders.
- Validators: Enforce ≤15 token node atomicity and procedural scaffolding standards.
- PPDAnalyzer: Tracks token usage and calculates Performance-per-Dollar efficiency.
-
Stateful Execution Engine:
- Supports dynamic traversal of GRDs with conditional logic and cycles.
- Manages Critic Feedback Loops for self-verification and automatic retries.
- Detects and manages execution cycles to prevent infinite loops.
-
Training Utilities:
- SyntheticDataGenerator: Creates BRAID-compliant reasoning samples for math, logic, and general reasoning.
- ArchitectTrainer: Prepares datasets for fine-tuning Architect models in OpenAI chat format.
Execution Flow Example
For a problem like "If a train travels 120 km in 2 hours, what is its speed?":
sequenceDiagram
participant User
participant BraidReasoning
participant GRDGenerator
participant MermaidParser
participant LLM
User->>BraidReasoning: problem="..."
BraidReasoning->>GRDGenerator: generate(problem)
GRDGenerator->>LLM: Generate GRD with examples
LLM-->>GRDGenerator: Mermaid diagram
GRDGenerator-->>BraidReasoning: GRD string
BraidReasoning->>MermaidParser: parse(grd)
MermaidParser->>MermaidParser: Validate syntax
MermaidParser->>MermaidParser: Extract nodes & edges
MermaidParser->>MermaidParser: Determine execution order
MermaidParser-->>BraidReasoning: GRDStructure
loop For each step in execution order
BraidReasoning->>BraidReasoning: Build context
BraidReasoning->>LLM: Execute step
LLM-->>BraidReasoning: Step result
BraidReasoning->>BraidReasoning: Store result
end
BraidReasoning->>BraidReasoning: Extract final answer
BraidReasoning-->>User: BraidResult(answer, grd, steps)
Benefits of This Architecture
- Reliability: Planning phase ensures structured approach before execution
- Transparency: GRD diagrams provide visual reasoning trace
- Debuggability: Each step is isolated and traceable
- Optimization: Both phases can be optimized independently
- Flexibility: Supports pre-generated GRDs or dynamic generation
Documentation
📚 Full documentation is available on Read the Docs
Local documentation:
To build documentation locally:
pip install -e ".[docs]"
cd docs
make html
Examples
Check out the examples directory for:
- Basic usage examples
- GSM8K benchmark integration
- Optimization workflows
Contributing
Contributions are welcome! Please read our Contributing Guide for details on our code of conduct and the process for submitting pull requests.
Changelog
See CHANGELOG.md for a list of changes and version history.
License
MIT License - see LICENSE file for details.
References
Project details
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
Filter files by name, interpreter, ABI, and platform.
If you're not sure about the file name format, learn more about wheel file names.
Copy a direct link to the current filters
File details
Details for the file braid_dspy-0.2.1.tar.gz.
File metadata
- Download URL: braid_dspy-0.2.1.tar.gz
- Upload date:
- Size: 64.5 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/6.2.0 CPython/3.11.14
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 |
451ed91484ecb63d2397f8fc477c429ffdd7a6b0c74c4984e8479287a5a005f4
|
|
| MD5 |
0d5b0b653e78b969fdf3073758c19f84
|
|
| BLAKE2b-256 |
3c12f7fa245a115b1dffa7000f2d75e5da18a90641c874721e575ac53348375c
|
File details
Details for the file braid_dspy-0.2.1-py3-none-any.whl.
File metadata
- Download URL: braid_dspy-0.2.1-py3-none-any.whl
- Upload date:
- Size: 52.3 kB
- Tags: Python 3
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/6.2.0 CPython/3.11.14
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 |
1426fa707e47bcea9259002ed675a39026f176c7c35c7aeb78d02d22d9cd3e05
|
|
| MD5 |
29e7494d728c66a9648eedf436fa4384
|
|
| BLAKE2b-256 |
67b521f1a9ce2a393b01b882db05e99bb3ddff4d226bf2156cea4fed772a898a
|