Repository logo
  • English
  • Deutsch
  • Español
  • Français
Log In
New user? Click here to register.Have you forgotten your password?
  1. Home
  2. ETD - Faculty of Informatics and Design
  3. Faculty of Informatics and Design - Department of Information Technology
  4. Information Technology - Master's Degree
  5. Programmable money for trustworthy currency transactions
 
Loading...
Thumbnail Image

Programmable money for trustworthy currency transactions

Author(s)
Ndaba, Ntethelelo Lungelo
Date Issued
2022
Type
Thesis
Publisher
Cape Peninsula University of Technology
DOI
https://doi.org/10.25381/cput.21436758.v1
Abstract
With 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.
Additional information
Thesis (MTech (Information Technology))--Cape Peninsula University of Technology, 2022
Subjects

Programmable money

Blockchains (Database...

Smart cards -- Progra...

Digital currency

File(s)
Loading...
Thumbnail Image
Name

Ndaba_Ntethelelo_211006777.pdf

Size

2.17 MB

Format

Adobe PDF

Checksum

(MD5):3bf85ccaeb86fc213dcd2310b5a7d3ec

  • Metrics
Get Involved!
  • Source Code
  • Documentation
  • Slack Channel
Make it your own

DSpace-CRIS can be extensively configured to meet your needs. Decide which information need to be collected and available with fine-grained security. Start updating the theme to match your Institution's web identity.

Need professional help?

The original creators of DSpace-CRIS at 4Science can take your project to the next level, get in touch!

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Privacy policy
  • End User Agreement
  • Send Feedback
Repository logo COAR Notify