You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
We define $\Delta T$ as the difference in the two timestamps, the last and first block containing transactions, respectively. In other words, an average of the time it takes to have finalised all transactions onchain. TPS is transactions per seconds.
In the last row, with no delta, the submitter was never able to finish and left transactions pending in the mempool indefinitely.
Note: every case were run twice so if there is an interval, it is the two different data points. If there is no interval, the second observation was in line (up to two decimal points) with the first one.
Transactions
$\Delta T$
TPS
500
4
125
1,000
6
166.67
5,000
65 - 66
74.63 - 75.76
10,000
234 - 271
36.90 - 42.74
12,500
-
-
Future Work
These results are with a single shard group and the numbers will likely change when the chain supports pre-sharding with shard groups (see #1092).
Two possible optimisations to investigate further at some points would be:
How to support more transactions submitted through the transaction_submitter, i.e. how can we unlock support for 12,500 sequenced transactions and beyond?
How to increase throughput for the existing amount of transactions we support? It is possible to make the argument that it is fine to periodically send 1,000 or 5,000 transactions in separate bundles rather than one big one.
In addition, there are tweaks such as removing the pacemaker heartbeat which temporarily increased the 5,000 transaction throughput to 91 TPS but on the other hand fails to cope with 10,000 transactions, so is likely a regression.
The text was updated successfully, but these errors were encountered:
Background
This is a continuation of the issue reported in #723, with varying amounts of transactions submitted to the swarm node with five (5) node instances.
Replication Steps
Results
We define$\Delta T$ as the difference in the two timestamps, the last and first block containing transactions, respectively. In other words, an average of the time it takes to have finalised all transactions onchain.
TPS
is transactions per seconds.In the last row, with no delta, the submitter was never able to finish and left transactions pending in the mempool indefinitely.
Note: every case were run twice so if there is an interval, it is the two different data points. If there is no interval, the second observation was in line (up to two decimal points) with the first one.
Future Work
These results are with a single shard group and the numbers will likely change when the chain supports pre-sharding with shard groups (see #1092).
Two possible optimisations to investigate further at some points would be:
transaction_submitter
, i.e. how can we unlock support for12,500
sequenced transactions and beyond?1,000
or5,000
transactions in separate bundles rather than one big one.In addition, there are tweaks such as removing the pacemaker heartbeat which temporarily increased the
5,000
transaction throughput to91
TPS but on the other hand fails to cope with10,000
transactions, so is likely a regression.The text was updated successfully, but these errors were encountered: