Thanks to visit codestin.com
Credit goes to github.com

Skip to content

Commit ff9eeef

Browse files
committed
warn
1 parent 81c37ca commit ff9eeef

File tree

2 files changed

+8
-3
lines changed

2 files changed

+8
-3
lines changed

_posts/2025-10-29-groth16-and-aptos-keyless.md

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -39,10 +39,10 @@ Recall the goals discussed [before](/keyless#what-is-the-ideal-zksnark-scheme-fo
3939
+ or at least, minimize costs of running a prover service
4040
1. small proof sizes (1.5 KiB?)
4141

42-
If we were to prioritize the problem we'd like solved first / pain points:
42+
If we were to prioritize the problem we'd like solved first (our pain points) while accounting for likelihood of solving things:
4343

44+
1. Remove circuit-specific trusted setup (**tame complexity**)
4445
1. Implement keyless relation safely in Rust, not as a circuit (**security**) $\Rightarrow$ zkVMs
45-
1. Remove circuit-specific trusted setup (**tame complexity**) $\Rightarrow$ WHIR, Spartan, [Hyper]PLONK
4646
1. Remove proving service (**tame complexity**, **reduce costs**)
4747
1. Prove obliviously via wrapping (**privacy**) $\Rightarrow$ Spartan, wrapped WHIR, [wrapped] HyperPLONK
4848

@@ -157,7 +157,7 @@ Jolt, Ligero could be viable options very soon.
157157

158158
## Engineering roadmap
159159

160-
There's several things that, if we, spend effort on they are likely to be fruitful no matter what research direction we take:
160+
There's several things that, if we spend effort on, they are likely to be fruitful no matter what research direction we take:
161161

162162
1. Reducing circuit size from 1.5M to 1M
163163
1. Registration-based, monetarily-incentivized, curve-agnostic, on-chain powers-of-$\tau$ and Groth16 setups

_posts/2025-11-03-pedersen-commitments.md

Lines changed: 5 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -50,6 +50,11 @@ Commit:
5050
C \gets m G + rH
5151
\end{align}
5252

53+
{: .warning}
54+
The randomness $r$ must be picked freshly for every $m$!
55+
Committing to different messages $m_1$ and $m_2$ using the same randomness $r$ would leak!
56+
i.e., Given a commitment $m_1 G + rH$ and another commitment $m_2 G + rH$ with the same randomness, one can subtract and obtain $(m_1 - m_2)G$ which leaks the difference!
57+
5358
## Security
5459

5560
### Binding

0 commit comments

Comments
 (0)