Please use this identifier to cite or link to this item: https://etd.cput.ac.za/handle/20.500.11838/3831
DC FieldValueLanguage
dc.contributor.advisorKabaso, Bonifaceen_US
dc.contributor.authorNdaba, Ntethelelo Lungeloen_US
dc.date.accessioned2023-05-19T10:10:42Z-
dc.date.available2023-05-19T10:10:42Z-
dc.date.issued2022-
dc.identifier.urihttps://etd.cput.ac.za/handle/20.500.11838/3831-
dc.descriptionThesis (MTech (Information Technology))--Cape Peninsula University of Technology, 2022en_US
dc.description.abstractWith bitcoin being the first blockchain success story, followed by other cryptocurrencies such as Ethereum, there has been a keen interest in potential technologies on the blockchain platform from different sectors, including finance, education, and supply chain. Conditional payments are an example of potential solutions being investigated. Programmable money, a new trustworthy virtual currency, provides for conditional payments. It is a scenario where the behaviour is removed from the human and embedded in the money using attaching contracts to the currency itself. This research follows the design science research (DSR) methodology to develop and evaluate programmable money by pivoting the capabilities of smart contract technology. Using a simulation, the artefact is subjected to realistic conditions to determine the feasibility of the programmable money concept in terms of functional and non-functional performance. Quantitative data generated during the observation of the simulation was used to obtain the findings. The findings show a strong performance in the functional test where the evaluation criteria focused on how the artefact addresses contract breaches attempted by simulation users. The non-functional tests were centred around performance under stress to gauge how the artefact would perform when processing a) many requests while the number of concurrent users remained constant and b) many requests caused by the periodically increased number of concurrent users. In the concurrency simulation, the findings show a quadratic time complexity T(n)= O(n2) compared to a linear time complexity function of T(n)= O(n) observed where the concurrency level remained the constant.en_US
dc.language.isoenen_US
dc.publisherCape Peninsula University of Technologyen_US
dc.subjectProgrammable moneyen_US
dc.subjectBlockchains (Databases)en_US
dc.subjectSmart cards -- Programmingen_US
dc.subjectDigital currencyen_US
dc.titleProgrammable money for trustworthy currency transactionsen_US
dc.typeThesisen_US
dc.identifier.doihttps://doi.org/10.25381/cput.21436758.v1-
Appears in Collections:Information Technology - Master's Degree
Files in This Item:
File Description SizeFormat 
Ndaba_Ntethelelo_211006777.pdf2.22 MBAdobe PDFView/Open
Show simple item record

Page view(s)

132
Last Week
0
Last month
7
checked on Nov 17, 2024

Download(s)

128
checked on Nov 17, 2024

Google ScholarTM

Check

Altmetric


Items in Digital Knowledge are protected by copyright, with all rights reserved, unless otherwise indicated.