{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/119766"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/119766","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Plutus : measuring message gossiping in P2P networks and providing incentives in cryptocurrencies","abstract":"In this thesis, we present Plutus, an efficient and game-theoretically proven incentive mechanism for Algorand, a proof-of-stake cryptocurrency. In order to operate, Algorand requires users to constantly propagate messages but has no mechanism to incentivize users to do so. Plutus solves this problem by keeping track of each message propagation path and rewarding the users who propagated messages using a lottery. We implemented a prototype of Plutus on top of Algorand to measure the performance and overhead of Plutus. Experimental results show that with Plutus, Algorand's block confirmation time increases by only 7% and that there is no penalty on Algorand's scalability.","abstract_html":"In this thesis, we present Plutus, an efficient and game-theoretically proven incentive mechanism for Algorand, a proof-of-stake cryptocurrency. In order to operate, Algorand requires users to constantly propagate messages but has no mechanism to incentivize users to do so. Plutus solves this problem by keeping track of each message propagation path and rewarding the users who propagated messages using a lottery. We implemented a prototype of Plutus on top of Algorand to measure the performance and overhead of Plutus. Experimental results show that with Plutus, Algorand's block confirmation time increases by only 7% and that there is no penalty on Algorand's scalability.","abstract_has_math":false,"creators":["Hemo, Rotem"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.","school":null,"contributors":[],"advisors":["Yossi Gilad and Nickolai Zeldovich."],"committee_chairs":[],"committee_members":[],"year":2018,"date_issued":"2018","date_published":"2018","updated_at":"2026-07-22T22:20:54Z","subjects":["Electrical Engineering and Computer Science."],"languages":["eng"],"rights":["MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/119766","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Yossi Gilad and Nickolai Zeldovich."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."]},{"key":"dc:creator","label":"Author","values":["Hemo, Rotem"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2018-12-18T19:49:07Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2018-12-18T19:49:07Z"]},{"key":"dc:date.issued","label":"Date","values":["2018"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Electrical Engineering and Computer Science."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1721.1/119766"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018.","This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.","Cataloged from student-submitted PDF version of thesis.","Includes bibliographical references (pages 47-48)."]},{"key":"dc:description.abstract","label":"Abstract","values":["In this thesis, we present Plutus, an efficient and game-theoretically proven incentive mechanism for Algorand, a proof-of-stake cryptocurrency. In order to operate, Algorand requires users to constantly propagate messages but has no mechanism to incentivize users to do so. Plutus solves this problem by keeping track of each message propagation path and rewarding the users who propagated messages using a lottery. We implemented a prototype of Plutus on top of Algorand to measure the performance and overhead of Plutus. Experimental results show that with Plutus, Algorand's block confirmation time increases by only 7% and that there is no penalty on Algorand's scalability."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["M. Eng."]},{"key":"dc:title","label":"Title","values":["Plutus : measuring message gossiping in P2P networks and providing incentives in cryptocurrencies"]}]}],"canonical_facts":{"dc:contributor.advisor":["Yossi Gilad and Nickolai Zeldovich."],"dc:contributor.department":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."],"dc:contributor.other":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."],"dc:creator":["Hemo, Rotem"],"dc:date.accessioned":["2018-12-18T19:49:07Z"],"dc:date.available":["2018-12-18T19:49:07Z"],"dc:date.issued":["2018"],"dc:description":["Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018.","This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.","Cataloged from student-submitted PDF version of thesis.","Includes bibliographical references (pages 47-48)."],"dc:description.abstract":["In this thesis, we present Plutus, an efficient and game-theoretically proven incentive mechanism for Algorand, a proof-of-stake cryptocurrency. In order to operate, Algorand requires users to constantly propagate messages but has no mechanism to incentivize users to do so. Plutus solves this problem by keeping track of each message propagation path and rewarding the users who propagated messages using a lottery. We implemented a prototype of Plutus on top of Algorand to measure the performance and overhead of Plutus. Experimental results show that with Plutus, Algorand's block confirmation time increases by only 7% and that there is no penalty on Algorand's scalability."],"dc:description.degree":["M. Eng."],"dc:identifier.uri":["http://hdl.handle.net/1721.1/119766"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Electrical Engineering and Computer Science."],"dc:title":["Plutus : measuring message gossiping in P2P networks and providing incentives in cryptocurrencies"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:20:54Z"}