{"id":{"repo_id":"middlesex","oai_identifier":"oai:repository.mdx.ac.uk:8q394"},"canonical_url":"https://search.dev.ndltd.org/etd/middlesex/oai:repository.mdx.ac.uk:8q394","repository":{"repo_id":"middlesex","name":"Middlesex University","base_url":"https://repository.mdx.ac.uk/oai2"},"display":{"title":"CAGE - Consensus Algorithm Genetically Encouraged","abstract":"Blockchain Technology has gone beyond just cryptocurrency. There is a growing need not only for development in blockchain technology to support the needs of Web 3.0, but also a need for research into Blockchain Technology. One of the fundamental components of Blockchain Technology is the consensus algorithms used to i) select a node in the network responsible for providing a block added to the blockchain; and, ii) verify that block and ensure trust between the nodes within the system. This research proposes a newly developed consensus algorithm for Blockchain Technology. This research draws on inspiration from nature and the field of evolutionary computation, and selection methods in particular. The selection method is a mixture of Darwinianism and Fatigue-based systems, used in many evolutionary algorithms. This selection method is applied successfully as a consensus algorithm in a Blockchain Technology Systems. The proposed consensus algorithm is called Consensus Algorithm Genetically Encouraged, or CAGE for short. An experimental framework was developed in which to test CAGE fairly. In this experimental framework CAGE was then tested and compared to another similar consensus algorithm, Proof-of-Elapsed-Time (PoET), many times. Results and analysis show that as the number of nodes in a blochchain technology increase, CAGE becomes more efficient in latency and throughput of block production. Analysis showed that the node distribution of CAGE was not as even as PoET. Some modifications to the algorithm were made and the tests re-run. This proved more successful and improved the distribution of node selection whilst having no effect on throughput and latency. There are some reasons why CAGE outperforms PoET, which are mentioned in the analysis and results chapters. In summary, this research developed a newly proposed consensus algorithm, CAGE, inspired by the selection methods used in evolutionary computation. CAGE was then tested many times and results show that as the number of nodes in the blockchain technology system increases CAGE outperforms PoET in terms of latency and throughput.","abstract_html":"Blockchain Technology has gone beyond just cryptocurrency. There is a growing need not only for development in blockchain technology to support the needs of Web 3.0, but also a need for research into Blockchain Technology. One of the fundamental components of Blockchain Technology is the consensus algorithms used to i) select a node in the network responsible for providing a block added to the blockchain; and, ii) verify that block and ensure trust between the nodes within the system. This research proposes a newly developed consensus algorithm for Blockchain Technology. This research draws on inspiration from nature and the field of evolutionary computation, and selection methods in particular. The selection method is a mixture of Darwinianism and Fatigue-based systems, used in many evolutionary algorithms. This selection method is applied successfully as a consensus algorithm in a Blockchain Technology Systems. The proposed consensus algorithm is called Consensus Algorithm Genetically Encouraged, or CAGE for short. An experimental framework was developed in which to test CAGE fairly. In this experimental framework CAGE was then tested and compared to another similar consensus algorithm, Proof-of-Elapsed-Time (PoET), many times. Results and analysis show that as the number of nodes in a blochchain technology increase, CAGE becomes more efficient in latency and throughput of block production. Analysis showed that the node distribution of CAGE was not as even as PoET. Some modifications to the algorithm were made and the tests re-run. This proved more successful and improved the distribution of node selection whilst having no effect on throughput and latency. There are some reasons why CAGE outperforms PoET, which are mentioned in the analysis and results chapters. In summary, this research developed a newly proposed consensus algorithm, CAGE, inspired by the selection methods used in evolutionary computation. CAGE was then tested many times and results show that as the number of nodes in the blockchain technology system increases CAGE outperforms PoET in terms of latency and throughput.","abstract_has_math":false,"creators":["Maka, K."],"institution":"Middlesex University","degree_name":null,"degree_level":"Masters thesis","degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2022,"date_issued":"2022","date_published":"2022","updated_at":"2026-07-24T03:03:59Z","subjects":[],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["oai:repository.mdx.ac.uk:8q394"],"render_values":[{"text":"oai:repository.mdx.ac.uk:8q394","href":null,"code":true}]}]},"links":{"outbound_url":null,"outbound_label":null,"outbound_source":null},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Maka, K."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2022"]},{"key":"dc:date.issued","label":"Date","values":["2022"]},{"key":"dc:publisher.department","label":"Dc Publisher Department","values":["Computer Science"]},{"key":"dc:publisher.institution","label":"Dc Publisher Institution","values":["Middlesex University"]},{"key":"dc:relation","label":"Dc Relation","values":["https://repository.mdx.ac.uk/item/8q394"]},{"key":"dc:relation.isreferencedby","label":"Dc Relation Isreferencedby","values":["https://repository.mdx.ac.uk/item/8q394"]},{"key":"dc:type","label":"Dc Type","values":["Thesis or dissertation"]},{"key":"dc:type.qualificationlevel","label":"Dc Type Qualificationlevel","values":["Masters thesis"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["oai:repository.mdx.ac.uk:8q394"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://repository.mdx.ac.uk/download/10ce3bd3e46f8b9c1ae7fce864d9967da794cf69a193d2b5d95e9fb5c16324e7/649738/KMaka%20thesis.pdf"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Blockchain Technology has gone beyond just cryptocurrency. There is a growing need not only for development in blockchain technology to support the needs of Web 3.0, but also a need for research into Blockchain Technology. One of the fundamental components of Blockchain Technology is the consensus algorithms used to i) select a node in the network responsible for providing a block added to the blockchain; and, ii) verify that block and ensure trust between the nodes within the system. This research proposes a newly developed consensus algorithm for Blockchain Technology. This research draws on inspiration from nature and the field of evolutionary computation, and selection methods in particular. The selection method is a mixture of Darwinianism and Fatigue-based systems, used in many evolutionary algorithms. This selection method is applied successfully as a consensus algorithm in a Blockchain Technology Systems. The proposed consensus algorithm is called Consensus Algorithm Genetically Encouraged, or CAGE for short. An experimental framework was developed in which to test CAGE fairly. In this experimental framework CAGE was then tested and compared to another similar consensus algorithm, Proof-of-Elapsed-Time (PoET), many times. Results and analysis show that as the number of nodes in a blochchain technology increase, CAGE becomes more efficient in latency and throughput of block production. Analysis showed that the node distribution of CAGE was not as even as PoET. Some modifications to the algorithm were made and the tests re-run. This proved more successful and improved the distribution of node selection whilst having no effect on throughput and latency. There are some reasons why CAGE outperforms PoET, which are mentioned in the analysis and results chapters. In summary, this research developed a newly proposed consensus algorithm, CAGE, inspired by the selection methods used in evolutionary computation. CAGE was then tested many times and results show that as the number of nodes in the blockchain technology system increases CAGE outperforms PoET in terms of latency and throughput."]},{"key":"dc:description.abstract","label":"Abstract","values":["Blockchain Technology has gone beyond just cryptocurrency. There is a growing need not only for development in blockchain technology to support the needs of Web 3.0, but also a need for research into Blockchain Technology. One of the fundamental components of Blockchain Technology is the consensus algorithms used to i) select a node in the network responsible for providing a block added to the blockchain; and, ii) verify that block and ensure trust between the nodes within the system. This research proposes a newly developed consensus algorithm for Blockchain Technology. This research draws on inspiration from nature and the field of evolutionary computation, and selection methods in particular. The selection method is a mixture of Darwinianism and Fatigue-based systems, used in many evolutionary algorithms. This selection method is applied successfully as a consensus algorithm in a Blockchain Technology Systems. The proposed consensus algorithm is called Consensus Algorithm Genetically Encouraged, or CAGE for short. An experimental framework was developed in which to test CAGE fairly. In this experimental framework CAGE was then tested and compared to another similar consensus algorithm, Proof-of-Elapsed-Time (PoET), many times. Results and analysis show that as the number of nodes in a blochchain technology increase, CAGE becomes more efficient in latency and throughput of block production. Analysis showed that the node distribution of CAGE was not as even as PoET. Some modifications to the algorithm were made and the tests re-run. This proved more successful and improved the distribution of node selection whilst having no effect on throughput and latency. There are some reasons why CAGE outperforms PoET, which are mentioned in the analysis and results chapters. In summary, this research developed a newly proposed consensus algorithm, CAGE, inspired by the selection methods used in evolutionary computation. CAGE was then tested many times and results show that as the number of nodes in the blockchain technology system increases CAGE outperforms PoET in terms of latency and throughput."]},{"key":"dc:title","label":"Title","values":["CAGE - Consensus Algorithm Genetically Encouraged"]}]}],"canonical_facts":{"dc:creator":["Maka, K."],"dc:date":["2022"],"dc:date.issued":["2022"],"dc:description":["Blockchain Technology has gone beyond just cryptocurrency. There is a growing need not only for development in blockchain technology to support the needs of Web 3.0, but also a need for research into Blockchain Technology. One of the fundamental components of Blockchain Technology is the consensus algorithms used to i) select a node in the network responsible for providing a block added to the blockchain; and, ii) verify that block and ensure trust between the nodes within the system. This research proposes a newly developed consensus algorithm for Blockchain Technology. This research draws on inspiration from nature and the field of evolutionary computation, and selection methods in particular. The selection method is a mixture of Darwinianism and Fatigue-based systems, used in many evolutionary algorithms. This selection method is applied successfully as a consensus algorithm in a Blockchain Technology Systems. The proposed consensus algorithm is called Consensus Algorithm Genetically Encouraged, or CAGE for short. An experimental framework was developed in which to test CAGE fairly. In this experimental framework CAGE was then tested and compared to another similar consensus algorithm, Proof-of-Elapsed-Time (PoET), many times. Results and analysis show that as the number of nodes in a blochchain technology increase, CAGE becomes more efficient in latency and throughput of block production. Analysis showed that the node distribution of CAGE was not as even as PoET. Some modifications to the algorithm were made and the tests re-run. This proved more successful and improved the distribution of node selection whilst having no effect on throughput and latency. There are some reasons why CAGE outperforms PoET, which are mentioned in the analysis and results chapters. In summary, this research developed a newly proposed consensus algorithm, CAGE, inspired by the selection methods used in evolutionary computation. CAGE was then tested many times and results show that as the number of nodes in the blockchain technology system increases CAGE outperforms PoET in terms of latency and throughput."],"dc:description.abstract":["Blockchain Technology has gone beyond just cryptocurrency. There is a growing need not only for development in blockchain technology to support the needs of Web 3.0, but also a need for research into Blockchain Technology. One of the fundamental components of Blockchain Technology is the consensus algorithms used to i) select a node in the network responsible for providing a block added to the blockchain; and, ii) verify that block and ensure trust between the nodes within the system. This research proposes a newly developed consensus algorithm for Blockchain Technology. This research draws on inspiration from nature and the field of evolutionary computation, and selection methods in particular. The selection method is a mixture of Darwinianism and Fatigue-based systems, used in many evolutionary algorithms. This selection method is applied successfully as a consensus algorithm in a Blockchain Technology Systems. The proposed consensus algorithm is called Consensus Algorithm Genetically Encouraged, or CAGE for short. An experimental framework was developed in which to test CAGE fairly. In this experimental framework CAGE was then tested and compared to another similar consensus algorithm, Proof-of-Elapsed-Time (PoET), many times. Results and analysis show that as the number of nodes in a blochchain technology increase, CAGE becomes more efficient in latency and throughput of block production. Analysis showed that the node distribution of CAGE was not as even as PoET. Some modifications to the algorithm were made and the tests re-run. This proved more successful and improved the distribution of node selection whilst having no effect on throughput and latency. There are some reasons why CAGE outperforms PoET, which are mentioned in the analysis and results chapters. In summary, this research developed a newly proposed consensus algorithm, CAGE, inspired by the selection methods used in evolutionary computation. CAGE was then tested many times and results show that as the number of nodes in the blockchain technology system increases CAGE outperforms PoET in terms of latency and throughput."],"dc:identifier":["oai:repository.mdx.ac.uk:8q394"],"dc:identifier.uri":["https://repository.mdx.ac.uk/download/10ce3bd3e46f8b9c1ae7fce864d9967da794cf69a193d2b5d95e9fb5c16324e7/649738/KMaka%20thesis.pdf"],"dc:publisher.department":["Computer Science"],"dc:publisher.institution":["Middlesex University"],"dc:relation":["https://repository.mdx.ac.uk/item/8q394"],"dc:relation.isreferencedby":["https://repository.mdx.ac.uk/item/8q394"],"dc:title":["CAGE - Consensus Algorithm Genetically Encouraged"],"dc:type":["Thesis or dissertation"],"dc:type.qualificationlevel":["Masters thesis"]},"updated_at":"2026-07-24T03:03:59Z"}