diff options
author | Alex Beregszaszi <alex@rtfs.hu> | 2016-10-14 02:00:57 +0800 |
---|---|---|
committer | Alex Beregszaszi <alex@rtfs.hu> | 2016-10-14 02:00:57 +0800 |
commit | 9521188bde4385e5131446b3e3eb7a9bdda37504 (patch) | |
tree | da0222b96a8e215ef9a4a086de8406551e33bbea /docs | |
parent | 66c6c746998b853cde52225ce73818b5496c79c5 (diff) | |
download | dexon-solidity-9521188bde4385e5131446b3e3eb7a9bdda37504.tar dexon-solidity-9521188bde4385e5131446b3e3eb7a9bdda37504.tar.gz dexon-solidity-9521188bde4385e5131446b3e3eb7a9bdda37504.tar.bz2 dexon-solidity-9521188bde4385e5131446b3e3eb7a9bdda37504.tar.lz dexon-solidity-9521188bde4385e5131446b3e3eb7a9bdda37504.tar.xz dexon-solidity-9521188bde4385e5131446b3e3eb7a9bdda37504.tar.zst dexon-solidity-9521188bde4385e5131446b3e3eb7a9bdda37504.zip |
Mention that memory is organised as 256-bit words
Diffstat (limited to 'docs')
-rw-r--r-- | docs/introduction-to-smart-contracts.rst | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/docs/introduction-to-smart-contracts.rst b/docs/introduction-to-smart-contracts.rst index bfc342d9..ad0a9650 100644 --- a/docs/introduction-to-smart-contracts.rst +++ b/docs/introduction-to-smart-contracts.rst @@ -350,10 +350,10 @@ from its own. The second memory area is called **memory**, of which a contract obtains a freshly cleared instance for each message call. Memory is linear and can be addressed at byte level, but reads are limited to a width of 256 bits, while writes -can be either 8 bits or 256 bits wide. Memory is expanded by accessing (either -reading or writing) a previously untouched memory offset. At the time of expansion, -the cost in gas must be paid. Memory is more costly the larger it grows (it scales -quadratically). +can be either 8 bits or 256 bits wide. Memory is expanded by a word (256-bit), when +accessing (either reading or writing) a previously untouched memory word (ie. any offset +within a word). At the time of expansion, the cost in gas must be paid. Memory is more +costly the larger it grows (it scales quadratically). The EVM is not a register machine but a stack machine, so all computations are performed on an area called the **stack**. It has a maximum size of |