logos-storage/plonky2
1
0
Fork 0
mirror of https://github.com/logos-storage/plonky2.git synced 2026-01-11 02:03:07 +00:00
Code Issues Packages Projects Releases Wiki Activity
4,478 Commits 4 Branches 0 Tags 17 MiB
Commit Graph

47 Commits

Author SHA1 Message Date
Linda Guiga
9a06fc9b95
Fix memop reads, from_prover_inputs and cleanup. 2023-09-07 12:15:17 +01:00
Linda Guiga
42f7038031
Add blockhash sys opcode 2023-09-07 09:43:59 +01:00
Linda Guiga
6207f4465a
Merge pull request #1206 from topos-protocol/missing-public-value-links 
Add missing links between public values
 2023-09-06 18:53:15 +01:00
Nicholas Ward
ac89c7cd40
Fix comment in proof.rs 2023-09-05 14:20:46 -07:00
Linda Guiga
b07644368f
Add missing links between public values 2023-08-31 13:40:13 +01:00
BGluth
975fd451e8 Made PublicValues serializable 
- Needed by the prover scheduler.
 2023-08-23 12:36:11 -06:00
Linda Guiga
6a2e24232d
Clippy 2023-08-22 20:00:49 +01:00
Linda Guiga
caae038cec
Cleanup 2023-08-22 20:00:49 +01:00
Robin Salen
925cdd5351
Cleanup 2023-08-22 20:00:49 +01:00
Robin Salen
c0b4f155f4
Implement receipts and logs 
Co-authored-by: Hamy Ratoanina <hamy.ratoanina@toposware.com>
Co-authored-by: Linda Guiga <lindaguiga3@gmail.com>
 2023-08-22 20:00:49 +01:00
Robin Salen
9a4500683b
Update BlockBaseFee to fit in 2 limbs 2023-08-19 10:23:24 -04:00
wborgeaud
df07ae093a
Write trie roots to memory before kernel bootstrapping (#1172) 
* Write trie roots

* Remove CPU trace length

* Update hash_initial/final_tries

* Fix tests

* Minor

* PR feedback
 2023-08-09 10:15:13 +02:00
wborgeaud
c9eed2bbf9
Connect public values in aggregation circuit (#1169) 
* Connect public values in aggregation circuit

* Minor
 2023-08-07 21:00:32 +02:00
Linda Guiga
6253a68ea5
Change public values into public inputs 2023-07-27 18:27:08 -04:00
Linda Guiga
06037f814f
Fix the memory CTL and implement the verifier memory bus 
Co-authored-by: Hamy Ratoanina <hamy.ratoanina@toposware.com>
 2023-07-27 18:20:03 -04:00
Hamish Ivey-Law
2c5f6fd62a
Fix compile time problems and generic hash implementation (#1024) 
* Fix egregious magic number.

* Remove generic consts from core permutations.

* Remove redundant `where` clauses.

* Remove HashConfig and friends.

* Refactor Permutation code.

* Remove redundant `where` clauses and `use`s.

* Introduce AlgebraicPermutation to wrap `[Target; WIDTH]`s.

* Remove `generic_const_expr` feature from plonky2!

* Remove `generic_const_expr` feature from plonky2!

* Compile time fixed! Start removing `generic_const_expr` from evm.

* Remove redundant `where` clauses from Starky.

* Remove `generic_const_expr`s from benchmarks.

* Remove redundant HASH_SIZE `where` clause.

* Clippy.

* Fix unrelated OsRng issue in `bench_recursion`.

* Fix function doc.
 2023-05-11 02:59:02 +10:00
Robin Salen
f71139d934
Add serialisation support for gates, generators, and various structs 
Co-authored-by: Sebastien La Duca <sladuca777@gmail.com>
 2023-04-20 07:59:36 +02:00
Robin Salen
9ee47ab745
Move HashConfig into GenericConfig associated types 2023-04-01 09:54:14 -04:00
Robin Salen
e857c020bf
Make hash functions generic 2023-03-31 18:55:06 -04:00
Daniel Lubarov
137bc78565 Prep for publishing to crates.io 2023-01-30 13:18:06 -08:00
Daniel Lubarov
e12c6ad5b9 Remove some older EVM recursion logic 
Some logic was replaced by the constant-degree logic in `fixed_recursive_verifier`.
 2023-01-03 11:53:21 -08:00
Daniel Lubarov
595e751ac1 Shrink STARK proofs to a constant degree 
The goal here is to end up with a single "root" circuit representing any EVM proof. I.e. it must verify each STARK, but be general enough to work with any combination of STARK sizes (within some range of sizes that we chose to support). This root circuit can then be plugged into our aggregation circuit.

In particular, for each STARK, and for each initial `degree_bits` (within a range that we choose to support), this adds a "shrinking chain" of circuits. Such a chain shrinks a STARK proof from that initial `degree_bits` down to a constant, `THRESHOLD_DEGREE_BITS`.

The root circuit then combines these shrunk-to-constant proofs for each table. It's similar to `RecursiveAllProof::verify_circuit`; I adapted the code from there and I think we can remove it after. The main difference is that now instead of having one verification key per STARK, we have several possible VKs, one per initial `degree_bits`. We bake the list of possible VKs into the root circuit, and have the prover indicate the index of the VK they're actually using.

This also partially removes the default feature of CTLs. So far we've used filters instead of defaults. Until now it was easy to keep supporting defaults just in case, but here maintaining support would require some more work. E.g. we couldn't use `exp_u64` any more, since the size delta is now dynamic, it can't be hardcoded. If there are no concerns, I'll fully remove the feature after.
 2023-01-01 23:11:39 -08:00
wborgeaud
39fc219324 PR feedback 2022-10-06 16:40:03 +02:00
wborgeaud
a5a4098d7a Merge branch 'main' into per_table_recursion 
# Conflicts:
#	evm/src/all_stark.rs
#	evm/src/generation/mod.rs
#	evm/src/recursive_verifier.rs
 2022-10-03 11:49:26 +02:00
wborgeaud
668957176a PR feedback 2022-10-03 11:44:52 +02:00
BGluth
8e08b218d2 Trie roots now use H256 instead of U256 
- `H256` preserves any leading `0`s, which could be critical in some
  situations. Also just a slightly more appropriate type for hashes.
 2022-09-29 15:56:09 -06:00
wborgeaud
8c96b8d2db Comment 2022-09-23 16:36:17 +02:00
wborgeaud
0053a02119 Cleaning 2022-09-23 16:28:20 +02:00
wborgeaud
6e6c2daf29 Add challenger state 2022-09-22 11:01:27 +02:00
BGluth
d7d8803d0a Replaced PartialTrie definitions with eth-trie-utils crate 
- There were enough dependencies that it made sense to move
  `PartialTrie` logic to its own crate.
 2022-09-19 11:05:48 -06:00
wborgeaud
da03af2979 Minor 2022-09-05 08:38:57 +02:00
wborgeaud
c320a9e8ae Merge branch 'main' into per_table_recursion 
# Conflicts:
#	evm/src/all_stark.rs
#	evm/src/proof.rs
 2022-09-05 08:34:52 +02:00
wborgeaud
05c3c4d907 First pass 2022-08-26 10:12:45 +02:00
wborgeaud
8600a5a46f Merge branch 'main' into per_table_recursion 
# Conflicts:
#	evm/src/proof.rs
 2022-08-26 09:41:00 +02:00
Daniel Lubarov
d0be79e822 Feedback 2022-08-25 23:35:38 -07:00
Daniel Lubarov
b829b44dcf Fix test 2022-08-25 22:11:25 -07:00
Daniel Lubarov
aa87f2c3ba Public memory 2022-08-25 20:19:18 -07:00
wborgeaud
9e9ff9872b Per table recursion 2022-08-25 22:04:28 +02:00
Daniel Lubarov
d9c210b26c Remove compressed proofs in EVM crate 
Not needed since EVM proofs are wrapped in recursive proofs.
 2022-08-25 12:17:31 -07:00
Sebastien La Duca
e48bfa837f fmt 2022-07-24 18:06:03 -04:00
Sebastien La Duca
c9d610ec10 use maybe_rayon in starky and evm 2022-07-24 17:47:14 -04:00
Daniel Lubarov
410e03349c
extension_field -> extension (#581) 
It seems redundant in most contexts, e.g. `use plonky2::field::extension_field::Extendable;`. One could import `extension_field`, but it's not that common in Rust, and `field::extension` is now about as short.
 2022-06-27 07:18:21 -07:00
wborgeaud
6f5c8e46f6 s/right/next 2022-06-02 23:55:56 +02:00
wborgeaud
1fdb41755e Recursive proof isn't correct (yet) 2022-05-26 16:27:15 +02:00
wborgeaud
8e8e4daa9c Start of impl 2022-05-20 11:21:13 +02:00
wborgeaud
9f01840a57 Make evm structs more generic 2022-05-19 09:41:15 +02:00
Daniel Lubarov
c54896dcb8
Rename starky2 -> evm (#547) 2022-05-18 10:32:14 -07:00