2020 Crypto Valley Conference on Blockchain Technology (CVCBT) 2020
DOI: 10.1109/cvcbt50464.2020.00011
|View full text |Cite
|
Sign up to set email alerts
|

Prism Removes Consensus Bottleneck for Smart Contracts

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 13 publications
(8 citation statements)
references
References 10 publications
0
8
0
Order By: Relevance
“…Smart contracts are not suitable for computationally intensive problems because the execution cost of transactions is proportional to their processing complexity [27,28].…”
Section: On-chain-based Solution For a 3-bus Network Using Dc-opf App...mentioning
confidence: 99%
“…Smart contracts are not suitable for computationally intensive problems because the execution cost of transactions is proportional to their processing complexity [27,28].…”
Section: On-chain-based Solution For a 3-bus Network Using Dc-opf App...mentioning
confidence: 99%
“…This is no suprise given that each shard runs on separate machines and use distinct resources. Although sharding makes the implementation of cross-shard transactions quite complex, we could offer cross-shard transactions by decoupling these transactions into separate withdrawals an credits, as was previously suggested in Prism [85], for applications where the atomicity of transactions is not a requirement.…”
Section: G Linear Speedup With Shardingmentioning
confidence: 99%
“…PRISM [86] is a proof-of-work blockchain that shards the blockchain into m voter chains and exploits three types of blocks in a block tree. The voter blocks are used to vote for proposer blocks grouped per level in the block tree.…”
Section: Related Workmentioning
confidence: 99%
“…In comparison, future blockchains are likely to experience other bottlenecks such as verifying cryptographic signatures over transactions and executing transactions before Strokkur's computational cost becomes the bottleneck. For example, a deployed implementation of the Ethereum transaction logic is computationally-bounded at 10,000 tps when executing simple payments [40]; a highlyoptimized implementation of the Bitcoin transaction logic is IO-bounded at 80,000 tps [41]. As we have demonstrated, Strokkur can support such a throughput using less than one CPU core on a commodity laptop.…”
Section: Computational Costmentioning
confidence: 99%