Dmitry Vagner
e151be5522
ripemd storage
2022-09-19 12:09:57 -07:00
Dmitry Vagner
e1a1b05b13
update skeleton
2022-09-18 11:05:00 -07:00
Dmitry Vagner
ffbb6fc617
outer function
2022-09-18 10:20:25 -07:00
Daniel Lubarov
3fc7996d79
Merge pull request #683 from mir-protocol/call_common
...
Fill in call_common routine
2022-09-17 12:00:49 -07:00
Dmitry Vagner
fa69f2a7fb
remove jumpdests / add macro
2022-09-16 19:18:26 -07:00
Dmitry Vagner
5163968747
remove jumpdests / fix name
2022-09-16 10:31:30 -07:00
Dmitry Vagner
32cf13da61
update
2022-09-16 10:12:21 -07:00
Dmitry Vagner
145eb5865b
flip bytes of a u32 macro
2022-09-15 11:02:03 -07:00
Dmitry Vagner
f09aec1b6c
scale indices by 4
2022-09-15 09:27:51 -07:00
Dmitry Vagner
d8ac2ced74
diff name
2022-09-15 09:24:50 -07:00
Dmitry Vagner
8049a5dabb
consume offset
2022-09-15 09:22:22 -07:00
Dmitry Vagner
e86c7034bc
load little endian
2022-09-15 09:21:19 -07:00
Nicholas Ward
a5f34d9a2e
fix
2022-09-13 22:03:25 -07:00
Nicholas Ward
b25986ce57
parentheses change
2022-09-13 22:03:25 -07:00
Dmitry Vagner
b08a5772d3
allow offset variable
2022-09-13 14:32:41 -07:00
Dmitry Vagner
cf80668ce3
formatting
2022-09-09 17:42:49 -07:00
Dmitry Vagner
64e9f6f0fb
final error and formatting
2022-09-09 17:38:36 -07:00
Nicholas Ward
0b9881c5e3
blocks in stack manipulation
2022-09-09 12:05:58 -07:00
Dmitry Vagner
9561dceb39
fix
2022-09-08 20:16:51 -07:00
Dmitry Vagner
3bfb994cbd
fix errors
2022-09-08 19:35:37 -07:00
Dmitry Vagner
7ed78c22a3
minor errors
2022-09-08 15:47:18 -07:00
Daniel Lubarov
fdb6cafe18
Fill in call_common routine
2022-09-07 16:42:21 -07:00
Daniel Lubarov
9b259cb917
Feedback
2022-09-05 10:12:23 -07:00
Daniel Lubarov
aaf7ace396
Remove JUMPDESTs
2022-09-04 22:31:56 -07:00
Nicholas Ward
df15031145
clippy: remove unused 'peekable'
2022-09-02 15:40:24 -07:00
Jacqueline Nabaglo
4c52d37546
Save columns by verifying invalid opcodes in software ( #701 )
...
* Save columns by verifying invalid opcodes in software
* Autogenerate invalid opcode bitfield (Daniel comment)
* Remove unnecessary panic label
2022-08-30 13:06:03 -07:00
Daniel Lubarov
8505d64e37
Fill in keccakf_u32s
2022-08-30 12:28:08 -07:00
Daniel Lubarov
d0be79e822
Feedback
2022-08-25 23:35:38 -07:00
Daniel Lubarov
aa87f2c3ba
Public memory
2022-08-25 20:19:18 -07:00
Dmitry Vagner
e6e6099cec
finished hash loop
2022-08-25 16:18:45 -07:00
Dmitry Vagner
3e671155cb
all but blocks
2022-08-25 15:38:18 -07:00
Dmitry Vagner
ca23001029
add constants
2022-08-23 16:40:31 -07:00
Dmitry Vagner
03b4d0a9da
all but memory
2022-08-23 12:03:06 -07:00
Daniel Lubarov
ce456fb8ea
Merge pull request #665 from mir-protocol/trie_metadata
...
Trie related segments and metadata
2022-08-22 17:30:28 -07:00
Dmitry Vagner
dc2d4b893b
Merge branch 'main' of github.com:mir-protocol/plonky2 into ripeMD
2022-08-16 15:22:40 -07:00
Jacqueline Nabaglo
b98dd47820
Permission levels, jumps, traps ( #653 )
...
* Permission levels, jumps, traps
* Tests passing
* PR comments + documentation
* Docs + minor bugfixes
* Tests
* Use already-defined `stop` and `exception` (but renamed to `sys_stop`, `fault_exception`)
* Daniel comments
2022-08-16 09:46:10 -07:00
Daniel Lubarov
232303b9ec
Merge pull request #666 from mir-protocol/rlp_encode
...
RLP encoding functions
2022-08-15 12:19:04 -07:00
Daniel Lubarov
97b271bf69
Merge pull request #663 from mir-protocol/use_mstore_txn_field
...
Make use of `mstore_txn_field` in type 0 parsing
2022-08-15 11:41:18 -07:00
Daniel Lubarov
539152d767
RLP encoding functions
2022-08-14 11:41:53 -07:00
Daniel Lubarov
6a7e8d0fb0
Trie related segments and metadata
...
Summary of the design:
- Tries are stored as immutable, copy-on-write trees
- All trie data is stored in the `TrieData` segment. Since it's immutable, data is never modified/deleted, new versions are just appended at the end.
- In order to support reverts, each context stores a pointer to the initial state trie version, plus the initial version of each storage trie.
One variation which may be worth considering is storing the whole state trie as one big trie (with sub-tries for storage). Reverts would then be simpler - we'd replace a single pointer. I thought that approach might make hashing the trie a bit more complex, as the node associated with an account would be a special type of node, rather than just another leaf. Either approach seems reasonable though.
2022-08-13 13:24:58 -07:00
Daniel Lubarov
f52e005307
Add static
2022-08-13 12:17:19 -07:00
Daniel Lubarov
6ea801d960
TODOs
2022-08-13 10:23:29 -07:00
Daniel Lubarov
74b1fd25e6
TODOs
2022-08-12 17:37:00 -07:00
Daniel Lubarov
cc61c7211c
Core transaction processing logic
...
With lots of TODOs to fill in afterward; this is just a start.
2022-08-12 17:20:18 -07:00
Daniel Lubarov
1763b6bc37
Merge pull request #662 from mir-protocol/stack_pruning_opt_perms
...
For permutations, find the optimal sequence of swaps
2022-08-12 17:19:47 -07:00
Daniel Lubarov
288ff63945
Fix shift ordering
2022-08-10 21:47:37 -07:00
Daniel Lubarov
707e564934
Make use of mstore_txn_field in type 0 parsing
...
Some of the `%stack` operations are now trivial, but I kind of like keeping `%stack` since it serves as documentation as well, making comments about the stack unnecessary.
2022-08-09 18:44:41 -04:00
Dmitry Vagner
f9efc3aede
draft implementation
2022-08-09 15:11:18 -07:00
Dmitry Vagner
26574f8b1e
swap shift orders
2022-08-09 14:28:32 -07:00
Daniel Lubarov
763d63de08
For permutations, find the optimal sequence of swaps
...
Using a method Angus described. This is mainly his idea and code, I just ported it to Rust.
2022-08-09 16:33:02 -04:00
