Skip to content

Commit 2e076c3

Browse files
Adam GibsonAdam Gibson
Adam Gibson
authored and
Adam Gibson
committed
add proof size data to auditor docs
1 parent c4c2968 commit 2e076c3

File tree

2 files changed

+32
-2
lines changed

2 files changed

+32
-2
lines changed
Binary file not shown.

auditor-docs/privacy-preserving-proof-of-assets.tex

+32-2
Original file line numberDiff line numberDiff line change
@@ -82,7 +82,7 @@ \subsection{The 1000ft view}
8282

8383
\subsection{Earlier work on the problem}
8484

85-
The seminal work ``Provisions'' addresses the same ``proof of assets'' scenario, as well as ``proof of liabilities'' (specifically for asset custodians), but using only standard $\Sigma$-protocol techniques (including proof of commitment to bit representations). Thus it is the perhaps canonical example of category (1) in the list above. Hence it is probably impractical for very large anonymity sets. To quote the paper itself:
85+
The seminal work ``Provisions'' {[}\protect\hyperlink{anchor-1}{1}{]} addresses the same ``proof of assets'' scenario, as well as ``proof of liabilities'' (specifically for asset custodians), but using only standard $\Sigma$-protocol techniques (including proof of commitment to bit representations). Thus it is the perhaps canonical example of category (1) in the list above. Hence it is probably impractical for very large anonymity sets. To quote the paper itself:
8686

8787
\begin{quote}
8888
Provisions scales linearly in proof size, construction and verification time with respect to its inputs: the proof of assets scales with the size of the anonymity set $\ldots$
@@ -318,9 +318,39 @@ \section{Effective anonymity sets}
318318

319319
\section{Performance results}
320320

321-
TODO
321+
\subsection{Proof size}
322+
323+
The sample results in \ref{table:prfsize} do not include proof batching, hence the sizes vary with the size of the witness utxo set primarily. Note for example that the exponent, which is the value $n$ in the formula $k < \sum_i v_i > k + 2^n$, has either little, or no effect on the proof size which is helpful for proving larger integer ranges of satoshis.
324+
325+
\vspace{5 pt}
326+
327+
Note that it is specifically the curve tree proof that could be easily batched, and the range proof also with some work; the number of individual bulletproofs could be reduced from $3n$ to $2$ (in case of tree depth $2$, which isn't always optimal but usually close to optimal).
322328

329+
\vspace{5 pt}
323330

331+
Even without that optimization, the proof sizes are manageable for small numbers of utxos.
332+
333+
\begin{table}[ht]
334+
\caption{Audit proof sizes in bytes}
335+
\centering
336+
\begin{tabular}{c c c c}
337+
\hline\hline
338+
\# utxos & anon set size & range exponent & Bytes \\ [0.5ex]
339+
\hline
340+
2 & 100 & 12 & 6888 \\
341+
2 & 100 & 24 & 6954 \\
342+
2 & 100 & 36 & 7020 \\
343+
1 & 350K & 18 & 3915 \\
344+
3 & 350K & 18 & 9861 \\
345+
7 & 350K & 18 & 21753 \\
346+
7 & 350K & 24 & 21753 \\ [1ex] % [1ex] adds vertical space
347+
\hline
348+
\end{tabular}
349+
\label{table:prfsize}
350+
\end{table}
351+
352+
353+
\pagebreak
324354

325355
\hypertarget{references}{%
326356
\section[References]{\texorpdfstring{\protect\hypertarget{anchor-77}{}{}References}{References}}\label{references}}

0 commit comments

Comments
 (0)