The slim chain is proposed in this paper in an effort to address and resolve the scalability issue of blockchain-based crypto computing by managing the volume of the blockchain itself. An adequate balancing of computation across on/off-chain is expected to relieve the spatial and temporal overhead of managing the otherwise exponentially growing size of the blockchain by making the blockchain slimmer as much as the volume migrated and kept off-chain than the conventional, as referred to as a slim chain in this paper. As an initial design, a novel theoretical model is proposed to assure the efficacy of the proposed slim chain with specific respect to the dependability from a single transaction's standpoint in a stochastic manner. It is demonstrated that the dependability can be traced with respect to whether the transaction of concern is to write off the chain or read back from off the chain to on-chain, as the transactions writing off the chain are more dependable than reading from off the chain without loss of practicality, as well as the crypto rate and the IPFS rate as IPFS (Inter-Planetary File System) is an off-chain storage considered in this research.
This paper proposes a novel embedded Markovian queueing model of the , / /1 type in order to establish a theoretical foundation to design a blockchain-based system with specific interest in Ethereum. The model assumes variable bulk arrivals of transactions in Poisson distribution, i.e., , , where n the number of slots across all the mined transactions and static bulk service of transactions in exponential time, i.e., , for posting in the current block, namely, VBASBP. The primary performance measurements to be taken are the average number of slots no matter how many transactions are mined under the assumption of the maximum number of slots per block as specified by n; the average waiting time per slot; and the throughput in terms of the average number of slots to be processed per time. The variable bulk arrival rate is assumed to vary linearly proportional to the size of the transactions in a multiple of λ per slot, and the static bulk service is assumed to take place when the number of slots in the mined transactions reaches at n, i.e., a bulk processing of multiple transactions in multiple slots for posting in a block. Numerical simulations are conducted on Matlab to demonstrate the efficacy of the model.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.