Skip to content
This repository has been archived by the owner on Feb 28, 2021. It is now read-only.

Reduce linear time complexity of transactions #474

Open
geigerzaehler opened this issue May 27, 2020 · 0 comments
Open

Reduce linear time complexity of transactions #474

geigerzaehler opened this issue May 27, 2020 · 0 comments

Comments

@geigerzaehler
Copy link

The number of storage reads for the handler of the RegisterUser message is linear in the number of users. Similarly the number of reads for the UnregisterUser message is linear in the number of orgs and requires a number of comparisons linear in the size of all members of orgs.

These complexity characteristics may have a drastic effect on the incentives and prices in the network and may open the door for DoS attacks. Moreover fixing this will likely be very invasive. (For example it may require additional on-chain or off-chain storage.) This means that this problem needs to be solved earlier than later.

The first step would be to come up with potential solutions using on-chain and off-chain storage that reduce the complexity to sub-linear.

Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant