Deterministic compartment preview
- 01
PROTECT
Run the same detection, minimization, policy, and transformation layers used by a normal protect request.
- 02
GROUP
Classify paragraphs into bounded purpose categories with deterministic rules.
- 03
CAP
Return between two and eight shards, constrained by max_shards.
- 04
ROUTE
Give each destination only its required protected_text. Provider fan-out is application work in the current alpha.
- 05
SYNTHESIZE
Combine protected outputs locally or in another deliberately scoped stage.
Create bounded shards
CURLbash
curl http://127.0.0.1:8787/v1/shard \
-H "Authorization: Bearer $SHREDDAR_API_KEY" \
-H "Content-Type: application/json" \
-d '{
"text": "authorized multi-section source",
"task": "separate commercial, security, and legal review",
"policy_id": "strict-v1",
"privacy_mode": "strict",
"max_shards": 4
}'What sharding does not solve
- A provider may infer relationships from a small distinctive fact set.
- Colluding destinations can recombine separate shards.
- Repeated requests can create longitudinal linkability.
- A bad task definition can place too much context into every compartment.
- Sharding does not protect data once an authorized destination receives it.