Diego Nehab

Diego Nehab

Auto-generated profile, based on publicly available information

Diego Nehab

Cartesi Research, Singapore, Singapore

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 January 2026 in Distributed Ledger Technologies: Research and Practice
Verified
Journal Article
Open access
DNDiego Nehab
Diego Nehab
GPGabriel Coutinho de Paula
Gabriel Coutinho de Paula
ATAugusto Teixeira
Augusto Teixeira
In this article, we introduce a new fraud-proof algorithm that offers an excellent balance between decentralization, security, and liveness. The resources that must be mobilized by an honest participant to defeat an adversary grow logarithmically relative to the adversary’s ultimate losses. Therefore, there is no need to introduce high bonds to prevent an adversary from creating too many Sybils. This design ensures broad accessibility, freeing participants from the need to pool resources among themselves to engage with the protocol. Additionally, the maximum delay to finalization grows only logarithmically with total adversarial expenditure. Moreover, the factor multiplying the logarithm is the smallest to date. In summary, the entire dispute completes within at most two to five challenge periods; the only way to break consensus is to censor the honest party for more than one challenge period, and the costs of engaging in the dispute are minimal.

25 July 2018 in Proceedings of the ACM on Computer Graphics and Interactive Techniques
Verified
Journal Article
Open access
PDF file
SHSongfang Han
Songfang Han
GCGe Chen
Ge Chen
DNDiego Nehab
Diego Nehab
PSPedro V. Sander
Pedro V. Sander
We present a new approach for rendering all triangles in a model in front-to-back order without the need for sorting at runtime. The method can be used for rendering order-dependent transparency effects, or to minimize overdraw, for example. The key distinguishing component in the approach is its negligible runtime cost and therefore the ease with which it can be incorporated into rendering engines. More specifically, given a viewpoint, the runtime simply selects a presorted triangle list, which we call in-depth buffers, to be rendered at full speed. These in-depth buffers are even optimized for post-transform vertex cache efficiency. The result is unmatched in front-to-back rendering performance. The difficulty is computing the smallest set of in-depth buffers required. This reduces to a graph problem that we prove to be NP-hard. Nevertheless, we have found an optimization heuristic that produces good results, particularly when visually imperceptible fragment ordering mistakes are allowed.