About

Table of contents

Setup

Linux/macOS

Windows

Usage

vc --help

usage: vc [-h] {fri,stark} ...verifiable computations (VC) experimentation programoptions:  -h, --help   show this help message and exitsubprograms:  choose one of the subprograms for running and experimenting with  corresponding protocols or primitives  {fri,stark}    fri        run FRI with specified parameters    stark      run STARK for one of preprogrammed tasks

FRI

vc fri --help

usage: vc fri [-h] [--ff NUMBER] [--ef NUMBER] [-f NUMBER] [--fd NUMBER]              [--id NUMBER] [--sl NUMBER] [-s NUMBER]subprogram for running FRI IOPP with specified parametersoptions:  -h, --help            show this help message and exit  --ff, --folding-factor-log NUMBER                        folding factor. default: 3  --ef, --expansion-factor-log NUMBER                        expansion factor. default: 3  -f, --field NUMBER    prime field size. default: 18446744069414584321  --fd, --final-degree-log NUMBER                        number of coefficients when to stop the protocol.                        default: 2  --id, --initial-degree-log NUMBER                        initial number of coefficients. default: 10  --sl, --security-level-bits NUMBER                        desired security level in bits. default: 5  -s, --seed NUMBER     randomness seed. default: 64 bit integer chosen at                        random

Example

vc fri --ff 3 --id 10 --fd 1 --sl 16 --ef 2

seed: 1434708073160630454fri parameters:    expansion factor = 4 (2^2)    folding factor = 8 (2^3)    initial coefficients length = 1024 (2^1)    final coefficients length = 2 (2^1)    initial evaluation domain length = 4096 (2^12)    security level = 16 bits    number of rounds = 2    number of query indices = 8prover time: 10.14 sproof:    final polynomial: 15241627350980849523x + 9569292054215004480    proof size: 8 KBverifier time: 21 msverification result: True

STARK

vc stark --help

usage: vc stark [-h] [-l] [-a {fibonacci,factorial,count}] [--ff NUMBER]                [--ef NUMBER] [--fd NUMBER] [--sl NUMBER] [-s NUMBER]                [air_arguments ...]subprogram for running STARK with specified parameters for proving the resultsof a specified taskpositional arguments:  air_arguments         arguments to pass to AIR generation, like "n" in                        fibonacci(n)options:  -h, --help            show this help message and exit  -l, --list            list available AIRs for experimanting with  -a, --air {fibonacci,factorial,count}                        chose the function STARK should prove the result for.                        default: fibonacci  --ff, --folding-factor-log NUMBER                        folding factor. default: 3  --ef, --expansion-factor-log NUMBER                        expansion factor. default: 3  --fd, --final-degree-log NUMBER                        number of coefficients when to stop the protocol.                        default: 2  --sl, --security-level-bits NUMBER                        desired security level in bits. default: 5  -s, --seed NUMBER     randomness seed. default: 64 bit integer chosen at                        random

Example

vc stark --air fibonacci --ff 2 --sl 64 90

proving that 90-th fibonacci number is 2880067194370816120AET shape: (90, 2)number of boundary constraints: 2number of transition constraints: 2fri parameters:     expansion factor = 8 (2^3)    folding factor = 4 (2^2)    initial coefficients length = 1024 (2^10)    final coefficients length = 4 (2^2)    initial evaluation domain length = 8192 (2^13)    security level = 64 bits    number of rounds = 3    number of query indices = 22prover time: 10.25 sproof size: 78 KBverifier time: 306 msverification result: True