Green Baneling
Green Baneling
When we request transactions for the block, each transaction requires a separate lookup, which is very expensive, considering that transactions are randomly distributed throughout the database(because of randomness of `TxId`).
All sequential opcodes return an error when touching the last storage key because we increase the key after that: If the user wants to update only the last storage key,...
The TxPool supports the feature that allows chain transactions and the use of uncommitted UTXOs. We allow chaining up to `max_depth` dependent transactions. But we don't limit the width of...
When we request transactions from the source, we need to take into account the current number of transactions in the block.
Our code adds the transactions to the block first, and after, we could face an error that will skip the transaction. We need to go over the codebase and update...
Increasing the processing for the nodes that have the graphQL instance is possible by playing by content length and then sending byte per byte continually is able to elevate the...
I haven't measured the performance of this change, so it is hard to say how useful it is. If, during the execution, we touched the same data, it could definitely...
We have many cases when we need to iterate only over keys of the specific table/column. The current iteration logic loads both key and values into memory and later discards...
If the requested storage view doesn't exist, we need to create it and cache it. In the case when someone requests the view at exactly the same height, it should...