We are evaluating the scalability of a resource's field that might get big occasionally and would like to confirm how transaction cost is calculated in order to make sure we can continue to execute transactions that interact with that resource (but doesn't access the field that might get big). It seems transaction cost should depend only on the size of the fields that are actually accessed based on the documentation, is that correct?
1
There are 1 best solutions below
Related Questions in ONFLOW-CADENCE
- Best way of converting a UInt256 into a UFix64 in Cadence without losing precision
- Failed to parse URL from cadence-parser.wasm
- Is it possible to specify the type of a Capability that has been stored as a generic Capability?
- I'm having trouble receiving these values with a script
- Problem with onflow nft-catalog Example 5
- Flow account creation throws excepcion "duplicated signature for key"
- Flow Blockchain - Single Smart Contract to manage multiple template-based Smart Contracts
- Retrieve user's current delegation and rewards in Flow programmatically using user_id
- What is the idiomatic way to represent restrictions on the transfer of NonFungible resources on Flow?
- Is it possible to iterate over dictionary keys?
- Error: value of type &NftMarketPlace.saleCollection{NftMarketPlace.saleCollectionPublic}? has no member purchase
- Does gas cost depend on the overall size of a resource that's moved/for which we access fields or only on the size of the fields actually accessed?
- Do attachments have the same storage and transaction cost rules as resources themselves?
- How can I retrieve a value from a resource in a resource rather than the uuid?
- Can't find a way to write a transaction to add items in my Grocery resource
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular # Hahtags
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
Accessing composite (struct/resource) fields, dictionary keys, array elements, etc. only loads what is necessary, so e.g. other fields, dictionary keys, and array elements are not loaded.
Transaction cost depends on computation usage. Computation usage for such accesses is not constant, but depends on the size of the accessed value.
This is because these data structures are implemented as trees, which means that the larger the value gets, the deeper the tree gets. On access, more and more non-leaf tree nodes have to be accessed to arrive at the leaf-node.