-
Notifications
You must be signed in to change notification settings - Fork 78
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
feat: account impersonating improvements and eth_sendTransaction #137
Conversation
/// | ||
#[rpc] | ||
pub trait EthTestNodeNamespaceT { | ||
#[rpc(name = "eth_sendTransaction")] |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Now that this is implemented, can you enable the following e2e test? xdescribe
-> describe
describe("hardhat_impersonateAccount & hardhat_stopImpersonatingAccount" ...
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Where I can find this test?
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
At the bottom of the following file e2e-tests/test/hardhat-api.tests.ts
You can also search for the describe(...)
I posted above in the repo and it'll show up
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I see it, looks like my branch is outdated
/// # Returns | ||
/// | ||
/// A future that resolves to the hash of the transaction if successful, or an error if the transaction is invalid or execution fails. | ||
fn send_transaction( |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Please add unit tests for send_transaction
Just as a general heads up, there's an open PR updating the meaning of I'm guessing they'll be done first, but this will have slight conflicts with your changes (not much) |
}; | ||
|
||
l2_tx.set_input(bytes, hash); | ||
if hash != l2_tx.hash() { |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
can you add a comment on when does this happen?
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I think never, this code was stolen from the send_raw_transaction method. Maybe I will remove it
if !reader | ||
.impersonated_accounts | ||
.contains(&l2_tx.common_data.initiator_address) | ||
{ |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
can we also print a clear error message, that this method is ONLY for impersonated accounts.
(and mention the initiator_address, and how many entries we have in impersonated_accounts list).
(as I'm worried that people will try using this method without knowing this)
); | ||
// Using the eth call here to avoid all the account checks | ||
// TODO: think about fictive blocks in case of impersonating via eth call | ||
TxExecutionMode::EthCall |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
the alternative, is to use the other DefaultAccount implementation in such case.
(as EthCall is in theory not supposed to be used for blocks that we commit)
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Yes, but then the bootloader will do a check that the sender is an account and it's not in the kernel space
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
ah right, you actually want to have even more permissions...
The cool thing, is that we have a local copy of bootloader, so we can add some additional modes to do exactly that - and we can be explicit about it (instead of depending on a lucky side effect of EthCall..)
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Agreed, I was planning to do that with preprocessing, but for now that's just a quick solution
|
||
// If it was not eth call, we increase the batch by 1, but miniblock (and timestamp) by 2. | ||
// You can look at insert_fictive_l2_block function in VM to see how this fake block is inserted. | ||
if let TxExecutionMode::VerifyExecute = execution_mode { |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
uh, let's avoid this... I'm worried that we'll get bootloader in a bad spot.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
What exactly? Do you mean a missing fictive block?
}; | ||
// v = 27 corresponds to 0 | ||
let bytes = tx_req.get_signed_bytes( | ||
&PackedEthSignature::from_rsv(&H256::default(), &H256::default(), 0), |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
could we use PackedEthSignature::default?
@MexicanAce these changes were implemented in the |
@AntonD3 I think we're okay to wait for the |
* Initial new implementation * Fix compilation error * Implementation of add operation for big integers (matter-labs#136) * Implement Big UInt Left Shift (matter-labs#139) * Add `bigUIntShl` implementation * Add constants * Fix compilation * Implement Big UInt Right Shift (matter-labs#137) * Add `bigUIntShr` implementation * Add constants * Implement Big UInt Bitwise Or for modexp (matter-labs#135) * Implement bigUIntBitOr * Fix bigUIntBitOr * Fix bigUIntBitOr Co-authored-by: Ivan Litteri <[email protected]> * Fix missing closing brackets --------- Co-authored-by: Ivan Litteri <[email protected]> * Implement big uint conditional select for modexp (matter-labs#148) * Implement bigUIntCondSelect * Fix missing curly braces Co-authored-by: Ivan Litteri <[email protected]> * Implement Big UInt Right Shift (matter-labs#137) * Add `bigUIntShr` implementation * Add constants * Implement Big UInt Bitwise Or for modexp (matter-labs#135) * Implement bigUIntBitOr * Fix bigUIntBitOr * Fix bigUIntBitOr Co-authored-by: Ivan Litteri <[email protected]> * Fix missing closing brackets --------- Co-authored-by: Ivan Litteri <[email protected]> --------- Co-authored-by: Ivan Litteri <[email protected]> * Implement mul operation for big UInts (matter-labs#151) * First implementation of mul operation for bigints * Fix multiplication for big integers * Fix some merge issues * Improve comments and function docs * Delete whitespaces * Substraction with borrow (matter-labs#149) * First substraction draft * Fix compile problems * Working implementation * Updated code * Updated code * Update subtract implementation * Remove console_log * Add docs for function * Update function docs * Remove tests from from ModExp.yul * Fix typo * Restore horrible whitespaces to avoid an ugly merge conflict * Update precompiles/Modexp.yul Co-authored-by: Ivan Litteri <[email protected]> * Revert "Update precompiles/Modexp.yul" This reverts commit 582bc41a0bb7fb02a1a68717fdf83c6fe432d422. --------- Co-authored-by: Joaquín P. Centeno <[email protected]> Co-authored-by: Ivan Litteri <[email protected]> * Refactor `modexp` reimplementation (matter-labs#156) * Make Big UInt API functions naming consistent * Refactor `bigUIntAdd` variable names * Refactor `bigUIntMul` variable names * Refactor `subLimbsWithBorrow` * Refactor `bigUintSubtractionWithBorrow` * Refactor `bigUIntAdd` * Fix `bigUIntSubWithBorrow` * Format `storeLimbValueAtOffset` * Refactor `bigUIntBitOr` Made it consistent with the rest of the code convention and naming * Refactor `bigUIntCondSelect` Made it consistent with the rest of the code convention and naming * Reorder `overflowingSubWithBorrow` * Move comment to modexp API Docs section * Biguint division (matter-labs#159) * Division draft * Non working draft * Fix compile errors * Use proper pointers for quotient and remainder * Add fix note, some more changes * Add comment * Implement `big_uint_bit_size` * Increase pointer to prevent it from steping over console_log * WIP divrem * Fix loop and zero initializer * Push test cases * Add other test case * Add docs and tests for `big_uint_inplace_or_1` * Fix bug related to bit shifting * Fix borrow return in big uint sub function * Delete playground file used for debugging * Fix sub with borrow function * Add playground again to check more big integer division tests * Remove playground used for testing * Write documentation for new shift functions * Improve naming and documentation for new helper functions * Rename bigUIntOrWith1 to bigUintInPlaceOrWith1 * Add tmp buffer parameters to bigUIntDivRem. Improve docs. * Simplify subLimbsWithBorrow Co-authored-by: Ivan Litteri <[email protected]> * Remove `mul` call from `bigUIntInPlaceOrWith1` Co-authored-by: Ivan Litteri <[email protected]> * Remove multiplications from copyBigUint Co-authored-by: Ivan Litteri <[email protected]> * Optimize bigUIntBitSize loop Co-authored-by: Ivan Litteri <[email protected]> * Simplify zeroWithLimbSizeAt --------- Co-authored-by: Francisco Krause Arnim <[email protected]> Co-authored-by: IAvecilla <[email protected]> Co-authored-by: Ivan Litteri <[email protected]> * Implement mul mod operation for big UInts (matter-labs#161) * Division draft * Non working draft * Fix compile errors * Use proper pointers for quotient and remainder * Add fix note, some more changes * Add comment * Implement `big_uint_bit_size` * Increase pointer to prevent it from steping over console_log * WIP divrem * Fix loop and zero initializer * Push test cases * Add other test case * Add docs and tests for `big_uint_inplace_or_1` * Fix bug related to bit shifting * Fix borrow return in big uint sub function * Delete playground file used for debugging * Fix sub with borrow function * Add playground again to check more big integer division tests * Remove playground used for testing * Write documentation for new shift functions * Improve naming and documentation for new helper functions * Rename bigUIntOrWith1 to bigUintInPlaceOrWith1 * Add tmp buffer parameters to bigUIntDivRem. Improve docs. * Add big uint mul mod skeleton * Remove wrong comment * Update algorithm comment * Add limb size doubling and divide by two for mul mod operation * Functions to duplicate and halve limb size work in place * Use camelCase * Remove console_log * Add docs * Update doc --------- Co-authored-by: Francisco Krause Arnim <[email protected]> Co-authored-by: Joaquín P. Centeno <[email protected]> * Add parseCallData function * Add function to left-pad big uints * Remove console log function * Change left padding functions for big uints to not work in place * Add `parseCalldata` function (matter-labs#168) * Remove redundant parse call data declaration * Free memory pointer (matter-labs#169) * Add free memory pointer function * Update precompiles/Modexp.yul Co-authored-by: Ivan Litteri <[email protected]> * Update precompiles/Modexp.yul Co-authored-by: Ivan Litteri <[email protected]> --------- Co-authored-by: Ivan Litteri <[email protected]> * Start parsing the input calldata * Correctly parse call data * Add left pad steps for modexp inputs * Add pad if needed function * Modexp for big UInts skeleton (matter-labs#164) * WIP: modexp skeleton * Use of mul mod function for big integers * imlement aux function to check if big uint is larger than 1 * minor fix * Restore modexp from target branch * Fix mul mod * Finish modexp implementation * Remove playground used for debugging * Update modexp with final state of modular exponentiation function * Fix merge issue * Change all names to camel case * fix typo Co-authored-by: Francisco Krause Arnim <[email protected]> --------- Co-authored-by: IAvecilla <[email protected]> Co-authored-by: Ivan Litteri <[email protected]> Co-authored-by: Francisco Krause Arnim <[email protected]> * Add simple integration * Fix calldata buffer in zero check * Uncomment checks for base cases * Fix result length to match with mod length * Fix condition in parse call data * Update test assertions with new test node updates * Add comment for tests with a temp patch * Fix modexp result length * Fix limb amount for modexp operands * Clean sratch buffers in each iteration * Clean sratch buffers for every operation * Remove unused functions * Delete free memory pointer usage and calculate pointers manually * Replace all mul operations for shifts to improve gas usage * Include basic optimizations * Add optimizations for reminder calculations * Add small improvement for main loop in modular exp * Add temporary fix for modexp test * Add modex reference script * Remove unnecesary memory stores * Reduce iterations in rem function * Compilation fix * Print gas used on tests * Add build script to create gas reports * Save gas used for each test of the precompiles * Add aux functions to write lines in each report * Merge main * Fix tests lint * Fix lint in test utils * Change L1 url --------- Co-authored-by: Nacho Avecilla <[email protected]> Co-authored-by: Joaquín Centeno <[email protected]> Co-authored-by: Francisco Krause Arnim <[email protected]> Co-authored-by: Francisco Krause Arnim <[email protected]> Co-authored-by: IAvecilla <[email protected]> Co-authored-by: Javier Chatruc <[email protected]>
What 💻
Why ✋
Evidence 📷