Table of content:
| Name | Description | Source | Args | Memory | Trace | Private Input | Public Input | Proof | Prover config | Prover Params |
|---|---|---|---|---|---|---|---|---|---|---|
| Basic | Linear function calculation | ● | ● | ● | ● | ● | ● | ● | ● | ● |
| Hash poseidon | Calculate Poseidon hash | ● | x | ● | ● | ● | ● | ● | ● | ● |
| Fibonacci | Fibonacci number calculation | ● | ● | ● | ● | ● | ● | ● | ● | ● |
| Ecdsa | ECDSA signature verification using STARK-curve | ● | ● | ● | ● | ● | ● | ● | ● | ● |
| Hash pedersen | Calculate Pedersen hash | ● | x | ● | ● | ● | ● | ● | ● | ● |
Basic
(src) (input arguments) (table of contents)
This program calculates value of a basic linear function using equation:
y = a*x + bwhere:
a = 12345678901234567890
b = 98765432109876543210Outputs Format:
[ y ] as Array<felt252>Memory Layout:
basicArguments Format: (arguments file)
[ x ] as Array<felt252>Execution traces:
Hash poseidon
(src)
This program calculates Poseidon hash of the struct. For the struct definition see below.
StructForHash { first: 0, second: 1, third: (1, 2), last: false };Outputs Format:
[ hashValue ] as Array<felt252>Memory Layout:
recursive_with_poseidonExecution traces:
Fibonacci
(src) (input arguments) (table of contents)
This program calculates Nth Fibonacci number using recursion.
Outputs Format:
[ nth_number ] as Array<felt252>Memory Layout:
smallArguments Format: (arguments file)
[ n ] as Array<felt252>Execution traces:
Ecdsa
(src) (input arguments) (table of contents)
This program calculates and checks the ECDSA signature using the STARK-curve. IMPORTANT: It's not safe! Some important checks are omitted. Check `check_ecdsa_signature`` function comment. Returns 1 if the signature is correct, 0 otherwise.
Outputs Format:
[ 0 or 1 ] as Array<felt252>Memory Layout:
all_cairoArguments Format: (arguments file)
[hash, public_key, r, s] as Array<felt252>Execution traces:
Hash pedersen
(src)
This program calculates Pedersen hash of the struct. For the struct definition see below.
StructForHash { first: 0, second: 1, third: (1, 2), last: false };Outputs Format:
[ hashValue ] as Array<felt252>Memory Layout:
recursive_large_outputExecution traces: