-
Notifications
You must be signed in to change notification settings - Fork 5.4k
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
Bitwise shifting instructions in EVM #215
Merged
Merged
Changes from 5 commits
Commits
Show all changes
12 commits
Select commit
Hold shift + click to select a range
4bab879
Draft of bitwise shifting opcodes
axic a63aef3
Remove ROR/ROL
axic 0b34616
Add link to client support (cpp-ethereum)
axic 7bc4477
Swap shift operands (value is the top item)
axic 27847a8
Rename to EIP145
axic d4f5382
Clarify shift amount (arg2)
axic e5ca919
Use floor and not udiv/sdiv
axic 4218665
Explain sign of arg1/arg2
axic 0b08d11
Add comparison with current opcodes
axic 9464fa7
Clarify text (user -> use)
axic d01c9af
Swapp operand order for bitwise shifting
axic 74d9a17
Clarify wording about arg1/arg2
axic File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,86 @@ | ||
## Preamble | ||
|
||
EIP: 145 | ||
Title: Bitwise shifting instructions in EVM | ||
Author: Alex Beregszaszi, Paweł Bylica | ||
Type: Standard Track | ||
Category Core | ||
Status: Draft | ||
Created: 2017-02-13 | ||
|
||
|
||
## Simple Summary | ||
|
||
To provide native bitwise shifting with cost on par with other arithmetic operations. | ||
|
||
## Abstract | ||
|
||
Native bitwise shifting instructions are introduced, which are more efficient processing wise on the host and are cheaper to user by a contract. | ||
|
||
## Motivation | ||
|
||
EVM is lacking bitwise shifting operators, but supports other logical and arithmetic operators. Shift operations can be implemented via arithmetic operators, but that has a higher cost and requires more processing time from the host. Implementing `SHL` and `SHR` using arithmetics cost each 35 gas, while the proposed instructions take 3 gas. | ||
|
||
## Specification | ||
|
||
The following instructions are introduced: | ||
|
||
### `0x1b`: `SHL` (shift left) | ||
|
||
The `SHL` instruction (shift left) pops 2 values from the stack, `arg1` and `arg2`, and pushes on the stack the first popped value `arg1` shifted to the left by the number of bits in the second popped value `arg2`. The result is equal to | ||
|
||
``` | ||
(arg1 * 2^arg2) mod 2^256 | ||
``` | ||
|
||
Notes: | ||
- If the shift amount is greater or equal 256 the result is 0. | ||
|
||
### `0x1c`: `SHR` (logical shift right) | ||
|
||
The `SHR` instruction (logical shift right) pops 2 values from the stack, `arg1` and `arg2`, and pushes on the stack the first popped value `arg1` shifted to the right by the number of bits in the second popped value `arg2` with zero fill. The result is equal to | ||
|
||
``` | ||
arg1 udiv 2^arg2 | ||
``` | ||
|
||
Notes: | ||
- If the shift amount is greater or equal 256 the result is 0. | ||
|
||
### `0x1d`: `SAR` (arithmetic shift right) | ||
|
||
The `SAR` instruction (arithmetic shift right) pops 2 values from the stack, `arg1` and `arg2`, and pushes on the stack the first popped value `arg1` shifted to the right by the number of bits in the second popped value `arg2` with sign extension. The result is equal to | ||
|
||
``` | ||
arg1 sdiv 2^arg2 | ||
``` | ||
|
||
Notes: | ||
- `arg2` is interpreted as unsigned number. | ||
- If the shift amount (`arg2`) is greater or equal 256 the result is 0 if `arg1` is non-negative or -1 if `arg1` is negative. | ||
|
||
The cost of the shift instructions is set at `verylow` tier (3 gas). | ||
|
||
## Rationale | ||
|
||
Instruction operands were chosen to match the other logical and arithmetic instructions. | ||
|
||
## Backwards Compatibility | ||
|
||
The newly introduced instructions have no effect on bytecode created in the past. | ||
|
||
## Test Cases | ||
|
||
TBA | ||
|
||
## Implementation | ||
|
||
Client support: | ||
- cpp-ethereum: https://github.com/ethereum/cpp-ethereum/pull/4054 | ||
|
||
Compiler support: | ||
- Solidity: https://github.com/ethereum/solidity/tree/asm-bitshift | ||
|
||
## Copyright | ||
|
||
Copyright and related rights waived via [CC0](https://creativecommons.org/publicdomain/zero/1.0/). |
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
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.
This is the case for all shifts, so let's move it somewhere up into any generic description.