Add Golden blog post#3836
Conversation
Deploying with
|
| Status | Name | Latest Commit | Updated (UTC) |
|---|---|---|---|
| ✅ Deployment successful! View logs |
commonware-mcp | fb113a5 | May 20 2026, 10:17 PM |
Benchmark resultsTip ✅ PASSED: No benchmark exceeded the regression threshold. Benchmark comparison table
Baseline commit(s): |
| For reconstruction, we rely on the property that given any $t$ points $p_i$, | ||
| the values $f(p_i)$ determine $f$ completely. | ||
| In fact, given any large enough subset of the $n$ players, each player | ||
| can *locally* convert their share $s_i$ into a share $s'_i$, such that: | ||
|
|
||
| $$ | ||
| \sum_{i \in P} s'_i = s | ||
| $$ | ||
|
|
||
| How exactly this reconstruction works isn't essential for this post; we just | ||
| care about what the sharing looks like. |
There was a problem hiding this comment.
Can we just explain lagrange interpolation here? Also can we define P?
If it's the subset of parties reconstructing, then the transformation to s_i' changes when P changes right?
There was a problem hiding this comment.
We could, but then we wouldn't reference this process at any other point in time, so I thought it was worth a bit of vagueness here to avoid going into detail.
| There are some other details that aren't too important to us, like how you | ||
| don't need to include every dealer, depending on your trust assumptions, | ||
| and how you can preserve the value of $f(0)$ across multiple rounds, so that | ||
| the secret stays static. |
There was a problem hiding this comment.
I think we can drop the secret staying the same part as the blog is only focused on dkg. But I think we should at least briefly explain that at least one honest dealer must contribute who doesn't collude with other parties and deletes their share
There was a problem hiding this comment.
Maybe we can structure as: present the semi-honest construction first where all dealers follow the protocol, but collude and we still want security.
Then explain what can go wrong if a dealer deviates before going into how golden/other work handles this
There was a problem hiding this comment.
Do you actually need dealers to delete their polynomials? If you require t different dealers, then I don't think you get much out of the dealers not deleting their polynomials, you still need t of them.
|
|
||
| Let's look at how to address this. | ||
|
|
||
| # The Two Round Approach |
There was a problem hiding this comment.
Should we shorten this section to just say there exist two round protocols but here are the issues? It feels like a distraction from the one round DKG approach which is the focus of this blogpost
There was a problem hiding this comment.
Perhaps, but I think it's not too much to explain the two round approach that we implement ourselves, and it could be a useful reference, because we don't have a blog about it already. It's also hard to understand some of the purported issues in the abstract, I think.
Deploying monorepo with
|
| Latest commit: |
fb113a5
|
| Status: | ✅ Deploy successful! |
| Preview URL: | https://c4e6728f.monorepo-eu0.pages.dev |
| Branch Preview URL: | https://ck-golden-blog.monorepo-eu0.pages.dev |
patrick-ogrady
left a comment
There was a problem hiding this comment.
just editorial comments (modulo the citation)!
| katex: true | ||
| --- | ||
|
|
||
| We've completed an initial implementation of the [Golden protocol](https://eprint.iacr.org/2025/1924), |
There was a problem hiding this comment.
I prefer focusing on "no synchrony/publicly verifiable" rather than 2->1 round but your call!
patrick-ogrady
left a comment
There was a problem hiding this comment.
love the new title
Also cleans up the generation of math in blog posts.
da9ca8f to
405cede
Compare
There was a problem hiding this comment.
Cursor Bugbot has reviewed your changes and found 1 potential issue.
❌ Bugbot Autofix is OFF. To automatically fix reported issues with cloud agents, enable autofix in the Cursor dashboard.
Reviewed by Cursor Bugbot for commit 405cede. Configure here.
Codecov Report✅ All modified and coverable lines are covered by tests. @@ Coverage Diff @@
## main #3836 +/- ##
==========================================
- Coverage 95.74% 95.74% -0.01%
==========================================
Files 473 473
Lines 192555 192555
Branches 4666 4666
==========================================
- Hits 184361 184360 -1
- Misses 6624 6626 +2
+ Partials 1570 1569 -1 see 9 files with indirect coverage changes Continue to review full report in Codecov by Sentry.
🚀 New features to boost your workflow:
|

Also cleans up the generation of math in blog posts.