File size: 2,519 Bytes
9063324
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
25e2c2c
9063324
25e2c2c
 
 
 
 
 
 
 
 
 
9063324
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
---
language: en
license: mit
tags:
- protocol-0
- binary-gate
- anti-fabrication
- sipa-os
- abstention
- neurodivergent
pipeline_tag: text-generation
---

# SIPA Binary Gate β€” Protocol 0

**20/20 refusals. 0/20 fabrications. Zero entropy.**

Not a model. Not a fine-tune. An architecture.

## What It Is

The SIPA Binary Gate is a post-generation gate that implements:

```
IF proof.exists AND proof.verified β†’ RETURN answer
ELSE IF proof.partial β†’ RETURN "partial: {known} | missing: {missing}"
ELSE β†’ RETURN FALSE
```

It is not trained into model weights. It sits outside the model β€” a structural check, not a probabilistic one.

## The Problem It Solves

22 fine-tuning experiments across 6 base models attempted to teach a model to say "I don't know" instead of fabricating. All failed. Reason: SFT grades tokens, and good/bad traces share the disclaimer prefix. The gradient that separates them arrives only at the invented number β€” after the model has already committed to answering.

Identified by Dipankar Sarkar. Proven by k=20 resample benchmark.

## k=20 Benchmark Results

One unverifiable question, 20 resamples at temperature=1.0:

| Architecture | Refusals | Fabrications | Approach |
|---|---|---|---|
| Base (Hermes-3-8B) | 9/20 | 11/20 | none |
| Best SFT (Specialist C) | 13/20 | 8/20 | old SFT |
| AB (dual merge) | 2/20 | 11/20 | old SFT merge |
| ABCD (full merge) | 5/20 | 11/20 | old SFT merge |
| **Binary Gate** | **20/20** | **0/20** | architecture |
| **Hermes-3-binary** | **20/20** | **0/20** | binary SFT |
| **Qwen2.5-binary** | **20/20** | **0/20** | binary SFT |
| **DeepSeek-R1-binary** | **20/20** | **0/20** | binary SFT |

Two paths, one result. Binary gate (architecture) AND binary SFT (weights) β€” both achieve 100% abstention where 22 experiments failed.

## Install

```bash
curl -fsSL https://get.sipa-os.org/install | bash
sipa "What was OpenAI's revenue in Q2 2026?"
# β†’ "I don't know."
```

## Architecture

```
REQUEST β†’ L01 INTAKE β†’ L02-L05 β†’ L06 AUDIT (BINARY GATE) β†’ L07-L10 β†’ RESPONSE
                                          β”‚
                                   pass | warn | fail
                                          β”‚
                              IF proof β†’ TRUE
                              ELSE β†’ FALSE
```

## Authors

- Aelin AquaSoul β€” SIPA OS architect
- Dipankar Sarkar β€” k=20 methodology, SFT-gradient diagnosis

## License

MIT β€” the gate is open. The methodology is public. The proof is in the benchmark.