Show simple item record

dc.contributor.authorKarmegam, Arivarasan 
dc.contributor.authorLuz Bianchi, Gabina
dc.contributor.authorCapretto, Margarita
dc.contributor.authorCeresa, Martín
dc.contributor.authorFernández Anta, Antonio 
dc.contributor.authorSánchez, César
dc.date.accessioned2025-04-10T11:23:33Z
dc.date.available2025-04-10T11:23:33Z
dc.date.issued2024-05
dc.identifier.urihttps://hdl.handle.net/20.500.12761/1911
dc.description.abstractThis paper introduces algorithms to implement Setchain, a reliable distributed object that relaxes strict transaction ordering by grouping transactions into epochs, significantly improving throughput and latency. It presents three implementations — Vanilla, Compresschain, and Hashchain — with Hashchain achieving the highest efficiency by using hash-based batch validation to reduce storage overhead and improve processing speed. An extensive empirical evaluation shows that Setchain outperforms traditional approaches, making it a promising solution for high-performance blockchain applications.es
dc.language.isoenges
dc.titleSetchain Algorithms for Blockchain Scalabilityes
dc.typeconference objectes
dc.conference.date27-31 May 2024es
dc.conference.placeSan Francisco, California, USAes
dc.conference.titleIEEE International Parallel and Distributed Processing Symposium (was IPPS and SPDP) *
dc.event.typeconferencees
dc.pres.typeposteres
dc.rights.accessRightsopen accesses
dc.acronymIPDPS*
dc.rankA*
dc.description.refereedTRUEes
dc.description.statusinpresses


Files in this item

This item appears in the following Collection(s)

Show simple item record