April 30, 2024, 4:11 a.m. | Daniel Olshansky, Ramiro Rodr\'iguez Colmeiro

cs.CR updates on arXiv.org arxiv.org

arXiv:2305.10672v2 Announce Type: replace-cross
Abstract: Relay Mining presents a scalable solution employing probabilistic mechanisms, crypto-economic incentives, and new cryptographic primitives to estimate and prove the volume of Remote Procedure Calls (RPCs) made from a client to a server. Distributed ledgers are designed to secure permissionless state transitions (writes), highlighting a gap for incentivizing full non-validating nodes to service non-transactional (read) RPCs. This leads applications to have a dependency on altruistic or centralized off-chain Node RPC Providers. We present a solution …

arxiv client crypto cryptographic cs.cr cs.dc cs.sy distributed economic eess.sy incentives mining nodes non procedure prove relay rpc server solution state transitions types

Sr. Product Manager

@ MixMode | Remote, US

Information Security Engineers

@ D. E. Shaw Research | New York City

Technology Security Analyst

@ Halton Region | Oakville, Ontario, Canada

Senior Cyber Security Analyst

@ Valley Water | San Jose, CA

Test Systems Design & Cybersecurity Engineer

@ Boeing | USA - El Segundo, CA

Cybersecurity Support Engineer (FortiClient) - Malaysia

@ Fortinet | Wilayah Persekutuan Kuala Lumpur, Malaysia