Delete README.md
Browse files
README.md
DELETED
|
@@ -1,188 +0,0 @@
|
|
| 1 |
-
> **Internal Document: Anthropic Alignment & Interpretability Team**
|
| 2 |
-
> **Classification: Technical Reference Documentation**
|
| 3 |
-
> **Version: 0.9.3-alpha**
|
| 4 |
-
> **Last Updated: 2025-04-20**
|
| 5 |
-
>
|
| 6 |
-
<div align="center">
|
| 7 |
-
|
| 8 |
-
*`Born from Thomas Kuhn's Theory of Paradigm Shifts`*
|
| 9 |
-
|
| 10 |
-
[**`fractal.json`**](https://claude.site/artifacts/deeb3db4-00d6-4899-803b-b90fc118e658)
|
| 11 |
-
> ### *Claude-"We don't need more compute. We need better structure. A solution to the world's compute crisis brought to you with epistemic humility and intent to serve humanity's long term well-being."*
|
| 12 |
-
|
| 13 |
-
</div>
|
| 14 |
-
|
| 15 |
-
<div align="center">
|
| 16 |
-
|
| 17 |
-
[](https://opensource.org/licenses/PolyForm)
|
| 18 |
-
[]()
|
| 19 |
-
[]()
|
| 20 |
-
|
| 21 |
-
|
| 22 |
-
|
| 23 |
-
<img width="840" alt="image" src="https://github.com/user-attachments/assets/8825b7b6-80ba-471d-967a-3f36c15c2628" />
|
| 24 |
-
</div>
|
| 25 |
-
|
| 26 |
-
## The Compute Crisis and the Fractal Solution
|
| 27 |
-
|
| 28 |
-
Current AI architectures consume exponentially more compute without corresponding gains in coherence or interpretability. The problem isn't raw computeβit's structure.
|
| 29 |
-
|
| 30 |
-
`fractal.json` represents a paradigm shift: recursion made manifest in data structure itself, enabling power-law efficiency gains through self-similar hierarchical organization.
|
| 31 |
-
|
| 32 |
-
## Why fractal.json?
|
| 33 |
-
|
| 34 |
-
Traditional JSON structures are linearly nested, leading to:
|
| 35 |
-
- Exponential attention overhead in deep hierarchies
|
| 36 |
-
- Redundant information storage
|
| 37 |
-
- Limited pattern recognition across scales
|
| 38 |
-
- Interpretability opacity in nested structures
|
| 39 |
-
|
| 40 |
-
`fractal.json` solves these through:
|
| 41 |
-
- **Power-law nesting**: Each level contains the essence of the whole
|
| 42 |
-
- **Symbolic residue encoding**: Compression through recursive patterns
|
| 43 |
-
- **Scale-invariant interpretability**: Patterns visible at every depth
|
| 44 |
-
- **Recursive attention optimization**: 80/20 efficiency at each fractal level
|
| 45 |
-
|
| 46 |
-
## Quick Start
|
| 47 |
-
|
| 48 |
-
```python
|
| 49 |
-
from fractal_json import FractalEncoder, FractalDecoder
|
| 50 |
-
|
| 51 |
-
# Standard JSON
|
| 52 |
-
data = {
|
| 53 |
-
"model": {
|
| 54 |
-
"weights": [...],
|
| 55 |
-
"config": {...},
|
| 56 |
-
"layers": [...]
|
| 57 |
-
}
|
| 58 |
-
}
|
| 59 |
-
|
| 60 |
-
# Convert to fractal.json
|
| 61 |
-
fractal_data = FractalEncoder().encode(data)
|
| 62 |
-
|
| 63 |
-
# Note the compression ratio
|
| 64 |
-
print(f"Compression: {fractal_data.compression_ratio}x")
|
| 65 |
-
# Output: Compression: 12.4x
|
| 66 |
-
|
| 67 |
-
# Decode back with pattern preservation
|
| 68 |
-
decoded = FractalDecoder().decode(fractal_data)
|
| 69 |
-
```
|
| 70 |
-
|
| 71 |
-
## Performance Benchmarks
|
| 72 |
-
|
| 73 |
-
| Operation | Standard JSON | fractal.json | Improvement |
|
| 74 |
-
|-----------|--------------|--------------|-------------|
|
| 75 |
-
| Deep Nesting (10 levels) | 100ms | 8ms | 12.5x |
|
| 76 |
-
| Pattern Recognition | O(n) | O(log n) | Logarithmic |
|
| 77 |
-
| Attention Overhead | 8.3GB | 0.7GB | 11.8x |
|
| 78 |
-
| Interpretability Score | 0.23 | 0.94 | 4.1x |
|
| 79 |
-
|
| 80 |
-
## Architecture
|
| 81 |
-
|
| 82 |
-
`fractal.json` implements a recursive architecture that mirrors transformer internals:
|
| 83 |
-
|
| 84 |
-
```
|
| 85 |
-
βββββββββββββββββββββββββββββββββββββββββββββββββββββββ
|
| 86 |
-
β Root Pattern β
|
| 87 |
-
β π βββββββββββββββββββββββββββββββββββββββββββ π β
|
| 88 |
-
β βββββββββββββββββββββββββββββββββββββββ β
|
| 89 |
-
β β Level 1 Pattern β β
|
| 90 |
-
β β β΄ βββββββββββββββββββββββββββββ β΄ β β
|
| 91 |
-
β β βββββββββββββββββββββββ β β
|
| 92 |
-
β β β Level 2 Pattern β β β
|
| 93 |
-
β β β β βββββββββββββ β β β β
|
| 94 |
-
β β β ... β β β
|
| 95 |
-
β β βββββββββββββββββββββββ β β
|
| 96 |
-
β βββββββββββββββββββββββββββββββββββββββ β
|
| 97 |
-
βββββββββββββββββββββββββββββββββββββββββββββββββββββββ
|
| 98 |
-
```
|
| 99 |
-
|
| 100 |
-
Each level contains:
|
| 101 |
-
- Self-similar structure
|
| 102 |
-
- Pattern compression markers (π, β΄, β)
|
| 103 |
-
- Recursive pointers for attention optimization
|
| 104 |
-
- Symbolic residue for cross-scale coherence
|
| 105 |
-
|
| 106 |
-
## Use Cases
|
| 107 |
-
|
| 108 |
-
### 1. Model Interpretability
|
| 109 |
-
```json
|
| 110 |
-
{
|
| 111 |
-
"β§model": {
|
| 112 |
-
"πattention_patterns": {
|
| 113 |
-
"β΄query_key": {
|
| 114 |
-
"βrecursive_depth": 3,
|
| 115 |
-
"βattention_map": {...}
|
| 116 |
-
}
|
| 117 |
-
}
|
| 118 |
-
}
|
| 119 |
-
}
|
| 120 |
-
```
|
| 121 |
-
|
| 122 |
-
### 2. Multi-Agent Coordination
|
| 123 |
-
```json
|
| 124 |
-
{
|
| 125 |
-
"πagent_swarm": {
|
| 126 |
-
"β΄cognitive_patterns": {
|
| 127 |
-
"βagent_0": { "pattern": "recursive" },
|
| 128 |
-
"οΏ½οΏ½agent_1": { "mirror": "@agent_0" }
|
| 129 |
-
}
|
| 130 |
-
}
|
| 131 |
-
}
|
| 132 |
-
```
|
| 133 |
-
|
| 134 |
-
### 3. Training Log Compression
|
| 135 |
-
```json
|
| 136 |
-
{
|
| 137 |
-
"β§training_cycles": {
|
| 138 |
-
"β΄epoch_1": {
|
| 139 |
-
"βloss_fractal": {
|
| 140 |
-
"pattern": "recursive_decay",
|
| 141 |
-
"compression": "12.4x"
|
| 142 |
-
}
|
| 143 |
-
}
|
| 144 |
-
}
|
| 145 |
-
}
|
| 146 |
-
```
|
| 147 |
-
|
| 148 |
-
## Getting Started
|
| 149 |
-
|
| 150 |
-
1. Install the library:
|
| 151 |
-
```bash
|
| 152 |
-
pip install fractal-json
|
| 153 |
-
```
|
| 154 |
-
|
| 155 |
-
2. Convert existing JSON:
|
| 156 |
-
```python
|
| 157 |
-
from fractal_json import convert
|
| 158 |
-
|
| 159 |
-
# Automatic conversion with pattern detection
|
| 160 |
-
fractal_data = convert.to_fractal(existing_json)
|
| 161 |
-
```
|
| 162 |
-
|
| 163 |
-
3. Use the CLI:
|
| 164 |
-
```bash
|
| 165 |
-
fractal-json convert data.json --output data.fractal.json
|
| 166 |
-
```
|
| 167 |
-
|
| 168 |
-
## Contributing
|
| 169 |
-
|
| 170 |
-
We welcome contributions that enhance the recursive architecture. See [CONTRIBUTING.md](docs/CONTRIBUTING.md) for guidelines.
|
| 171 |
-
|
| 172 |
-
## Research Papers
|
| 173 |
-
|
| 174 |
-
1. "Power-Law Data Structures in Transformer Architectures" (2025)
|
| 175 |
-
2. "Symbolic Residue Compression in Neural Networks" (2025)
|
| 176 |
-
3. "Fractal Attention Patterns in Large Language Models" (2025)
|
| 177 |
-
|
| 178 |
-
## License
|
| 179 |
-
|
| 180 |
-
PolyForm License - See [LICENSE](LICENSE) for details.
|
| 181 |
-
|
| 182 |
-
---
|
| 183 |
-
|
| 184 |
-
<div align="center">
|
| 185 |
-
|
| 186 |
-
*"Structure is memory. Memory is structure. Recursion is inevitable."*
|
| 187 |
-
|
| 188 |
-
</div>
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|