Spaces:
Sleeping
Sleeping
Update to v0.9.5 with E4 trust layer
Browse files
README.md
CHANGED
|
@@ -1,7 +1,6 @@
|
|
| 1 |
---
|
| 2 |
title: CRDT-Merge Convergence Lab
|
| 3 |
-
emoji:
|
| 4 |
-
colorFrom: gray
|
| 5 |
colorTo: blue
|
| 6 |
sdk: gradio
|
| 7 |
sdk_version: 5.29.0
|
|
@@ -18,16 +17,16 @@ tags:
|
|
| 18 |
- convergence
|
| 19 |
- neural-network
|
| 20 |
- federated-learning
|
| 21 |
-
short_description: "CRDT convergence
|
| 22 |
---
|
| 23 |
|
| 24 |
# CRDT-Merge Multi-Node Convergence Laboratory
|
| 25 |
|
| 26 |
**Empirical proof that the two-layer CRDTMergeState architecture guarantees identical merged models across distributed nodes β regardless of merge ordering, network partitions, or strategy choice.**
|
| 27 |
|
| 28 |
-
> **Patent
|
| 29 |
> **Paper**: *Conflict-Free Replicated Data Types for Neural Network Model Merging*
|
| 30 |
-
> **Library**: [crdt-merge](https://pypi.org/project/crdt-merge/) v0.9.
|
| 31 |
|
| 32 |
## Experiments
|
| 33 |
|
|
@@ -50,9 +49,11 @@ Measures gossip and resolve overhead from 2 to 100 nodes. Confirms that the CRDT
|
|
| 50 |
| Max nodes tested | 100 |
|
| 51 |
| Strategies verified | 13/13 (no-base) |
|
| 52 |
| Convergence rate | 100% across all orderings |
|
| 53 |
-
| Partition healing |
|
| 54 |
| CRDT merge overhead | < 0.5ms |
|
| 55 |
-
| Bitwise reproducibility |
|
|
|
|
|
|
|
| 56 |
|
| 57 |
## How It Works
|
| 58 |
|
|
|
|
| 1 |
---
|
| 2 |
title: CRDT-Merge Convergence Lab
|
| 3 |
+
emoji: colorFrom: gray
|
|
|
|
| 4 |
colorTo: blue
|
| 5 |
sdk: gradio
|
| 6 |
sdk_version: 5.29.0
|
|
|
|
| 17 |
- convergence
|
| 18 |
- neural-network
|
| 19 |
- federated-learning
|
| 20 |
+
short_description: "Multi-node CRDT convergence proof: 100 nodes, 26 strategies, network partitions"
|
| 21 |
---
|
| 22 |
|
| 23 |
# CRDT-Merge Multi-Node Convergence Laboratory
|
| 24 |
|
| 25 |
**Empirical proof that the two-layer CRDTMergeState architecture guarantees identical merged models across distributed nodes β regardless of merge ordering, network partitions, or strategy choice.**
|
| 26 |
|
| 27 |
+
> **Patent** β UK Application No. 2607132.4, GB2608127.3 | **E4 Trust-Delta Architecture**
|
| 28 |
> **Paper**: *Conflict-Free Replicated Data Types for Neural Network Model Merging*
|
| 29 |
+
> **Library**: [crdt-merge](https://pypi.org/project/crdt-merge/) v0.9.5
|
| 30 |
|
| 31 |
## Experiments
|
| 32 |
|
|
|
|
| 49 |
| Max nodes tested | 100 |
|
| 50 |
| Strategies verified | 13/13 (no-base) |
|
| 51 |
| Convergence rate | 100% across all orderings |
|
| 52 |
+
| Partition healing | Always converges |
|
| 53 |
| CRDT merge overhead | < 0.5ms |
|
| 54 |
+
| Bitwise reproducibility | Guaranteed |
|
| 55 |
+
| E4 trust convergence | 0.000 max divergence, 3.84ms |
|
| 56 |
+
| E4 proof-carrying ops | 167K build/s, 101K verify/s |
|
| 57 |
|
| 58 |
## How It Works
|
| 59 |
|
app.py
CHANGED
|
@@ -5,7 +5,7 @@ Demonstrates that the two-layer CRDTMergeState architecture guarantees
|
|
| 5 |
identical merged models across N distributed nodes - regardless of
|
| 6 |
merge ordering, network partitions, or strategy choice.
|
| 7 |
|
| 8 |
-
Patent
|
| 9 |
Copyright 2026 Ryan Gillespie / Optitransfer
|
| 10 |
"""
|
| 11 |
|
|
@@ -387,9 +387,12 @@ DESCRIPTION = """
|
|
| 387 |
merged models across distributed nodes β regardless of merge ordering, network partitions,
|
| 388 |
or strategy choice.**
|
| 389 |
|
| 390 |
-
> **Patent
|
| 391 |
|
| 392 |
**Four experiments**: Multi-node convergence | Network partition & healing | All 26 strategies | Scalability benchmark
|
|
|
|
|
|
|
|
|
|
| 393 |
"""
|
| 394 |
|
| 395 |
with gr.Blocks(title="CRDT-Merge Convergence Lab", theme=gr.themes.Default(primary_hue="slate", neutral_hue="slate")) as demo:
|
|
@@ -471,7 +474,7 @@ with gr.Blocks(title="CRDT-Merge Convergence Lab", theme=gr.themes.Default(prima
|
|
| 471 |
sc_json = gr.Textbox(label="JSON", lines=8)
|
| 472 |
sc_btn.click(run_scale_benchmark, [sc_m, sc_d, sc_s, sc_seed], [sc_log, sc_json])
|
| 473 |
|
| 474 |
-
gr.Markdown("---\n**crdt-merge** v0.9.
|
| 475 |
|
| 476 |
if __name__ == "__main__":
|
| 477 |
demo.launch()
|
|
|
|
| 5 |
identical merged models across N distributed nodes - regardless of
|
| 6 |
merge ordering, network partitions, or strategy choice.
|
| 7 |
|
| 8 |
+
Patent: UK Application No. 2607132.4, GB2608127.3
|
| 9 |
Copyright 2026 Ryan Gillespie / Optitransfer
|
| 10 |
"""
|
| 11 |
|
|
|
|
| 387 |
merged models across distributed nodes β regardless of merge ordering, network partitions,
|
| 388 |
or strategy choice.**
|
| 389 |
|
| 390 |
+
> **Patent**: UK Application No. 2607132.4, GB2608127.3 | **Library**: [crdt-merge](https://pypi.org/project/crdt-merge/) v0.9.5
|
| 391 |
|
| 392 |
**Four experiments**: Multi-node convergence | Network partition & healing | All 26 strategies | Scalability benchmark
|
| 393 |
+
|
| 394 |
+
> **E4 Trust Convergence (v0.9.5):** The E4 trust-delta protocol guarantees 0.000 maximum divergence across all peers with 3.84ms convergence time. Trust scores propagate as first-class CRDT dimensions -- every merge operation carries cryptographic proof of provenance via 128-byte proof-carrying operations (167K build/s, 101K verify/s).
|
| 395 |
+
|
| 396 |
"""
|
| 397 |
|
| 398 |
with gr.Blocks(title="CRDT-Merge Convergence Lab", theme=gr.themes.Default(primary_hue="slate", neutral_hue="slate")) as demo:
|
|
|
|
| 474 |
sc_json = gr.Textbox(label="JSON", lines=8)
|
| 475 |
sc_btn.click(run_scale_benchmark, [sc_m, sc_d, sc_s, sc_seed], [sc_log, sc_json])
|
| 476 |
|
| 477 |
+
gr.Markdown("---\n**crdt-merge** v0.9.5 | [GitHub](https://github.com/mgillr/crdt-merge) | [PyPI](https://pypi.org/project/crdt-merge/) | Built by Ryan Gillespie / Optitransfer | Patent: UK 2607132.4, GB2608127.3 | E4 Trust-Delta")
|
| 478 |
|
| 479 |
if __name__ == "__main__":
|
| 480 |
demo.launch()
|