From cad6e112e3ba9a75c4723f800c1f42abde7dd5f4 Mon Sep 17 00:00:00 2001 From: saymrwulf Date: Mon, 6 Jul 2026 19:17:58 +0200 Subject: [PATCH] Docs: fix remaining stale LOC claims in index.html manual + swe title The final stale-claim sweep caught index.html's embedded operations manual (intro paragraph + comparison table still said ~6,500 lines / no-RSA row missing) and the swe deck title. Update both, add the signatures/key-exchange row to the index comparison table, and re-sync the root standalone decks. Repo-wide sweep for stale claims is now clean. Co-Authored-By: Claude Fable 5 --- cmd/evote/web/index.html | 13 +++++++------ cmd/evote/web/swe.html | 4 ++-- presentation-swe.html | 4 ++-- 3 files changed, 11 insertions(+), 10 deletions(-) diff --git a/cmd/evote/web/index.html b/cmd/evote/web/index.html index c68d2ce..39cf368 100644 --- a/cmd/evote/web/index.html +++ b/cmd/evote/web/index.html @@ -231,7 +231,7 @@

1.1 Purpose of This Manual

This manual provides step-by-step operational procedures for all participants in the Swiss Post e-voting election ceremony, as implemented in the Go proof-of-concept (PoC) system evote.

-

The Go PoC reimplements the cryptographic core of the production Swiss Post e-voting system in approximately 6,500 lines of Go. It uses the same algorithms (ElGamal encryption, Schnorr proofs, Bayer-Groth verifiable shuffle) but operates as a single-machine, command-line tool rather than a distributed multi-server deployment.

+

The Go PoC reimplements the cryptographic core of the production Swiss Post e-voting system in roughly ten thousand lines of Go, plus a small Rust crate for transport security. It uses the same algorithms (ElGamal encryption, Schnorr proofs, Bayer-Groth verifiable shuffle), with two modes: a single-machine demo and a multi-party netdemo where each role is a separate endpoint communicating over an Ed25519-signed, X25519-encrypted transport.

Despite the simplified infrastructure, the Go PoC preserves the same role structure as the production system. Each role's responsibilities, trust boundaries, and ceremony steps are faithfully reproduced.

1.2 System Overview

@@ -636,17 +636,18 @@ make build # or: make rust && go build -o evote ./cmd/evote

Appendix C: Production vs. Go PoC

- + - - + + + - - + +
AspectProductionGo PoC
LanguageJava 21 + TS + C#Go
LanguageJava 21 + TS + C#Go + Rust (transport)
Prime size3072 bits256 bits (demo)
InfrastructureKubernetes + 4 bare-metal CCs + SDMSingle binary
NetworkingHTTPS, RSocket/CBOR, ActiveMQIn-memory
InfrastructureKubernetes + 4 bare-metal CCs + SDMSingle binary; netdemo splits parties in-process
NetworkingHTTPS, RSocket/CBOR, ActiveMQIn-process signed bus (netdemo); no external network
Signatures / key exchangeRSASSA-PSS, RSA channels, RSA X.509Ed25519 + X25519, Ed25519 X.509 (Rust); no RSA
PersistencePostgreSQLIn-memory
Voter PortalAngular SPA, 4 languagesSimulated in CLI
ElGamalIdentical algorithmIdentical algorithm
Schnorr proofsIdentical algorithmIdentical algorithm
Bayer-GrothIdentical algorithmIdentical algorithm
Source code~500K lines, 14 repos~6,500 lines, 1 module
DependenciesBouncyCastle, Spring, Angular, ...Cobra + x/crypto
Source code~500K lines, 14 repos~10.5K lines Go + Rust crate, 1 module
DependenciesBouncyCastle, Spring, Angular, ...Cobra + x/crypto; ed25519/x25519-dalek (Rust)
diff --git a/cmd/evote/web/swe.html b/cmd/evote/web/swe.html index a6a4a7c..baf4331 100644 --- a/cmd/evote/web/swe.html +++ b/cmd/evote/web/swe.html @@ -188,7 +188,7 @@ const S = [
🏗️

Building a Government Election System

-

in 6,500 Lines of Go

+

in ~10,000 Lines of Go (and a little Rust)

A software engineering lecture
@@ -249,7 +249,7 @@ const S = [ Tally: 5 Bayer-Groth verifiable shuffles Verify: 4 key proofs PASS, 5 shuffle proofs PASS Result: Alice 4, Bob 3, Carol 3
-
You don't need 500K lines to implement a complex protocol. You need the right 6,500 lines. Knowing what to leave out is as important as knowing what to put in.
+
You don't need 500K lines to implement a complex protocol. The cryptographic core here is only a few thousand lines — the right few thousand. Knowing what to leave out is as important as knowing what to put in.
` }, diff --git a/presentation-swe.html b/presentation-swe.html index a6a4a7c..baf4331 100644 --- a/presentation-swe.html +++ b/presentation-swe.html @@ -188,7 +188,7 @@ const S = [
🏗️

Building a Government Election System

-

in 6,500 Lines of Go

+

in ~10,000 Lines of Go (and a little Rust)

A software engineering lecture
@@ -249,7 +249,7 @@ const S = [ Tally: 5 Bayer-Groth verifiable shuffles Verify: 4 key proofs PASS, 5 shuffle proofs PASS Result: Alice 4, Bob 3, Carol 3
-
You don't need 500K lines to implement a complex protocol. You need the right 6,500 lines. Knowing what to leave out is as important as knowing what to put in.
+
You don't need 500K lines to implement a complex protocol. The cryptographic core here is only a few thousand lines — the right few thousand. Knowing what to leave out is as important as knowing what to put in.
` },