Hardik Gajera

Dato Kavazi, Victor Smirnov, Sasha Shilina et al.

The advent of blockchain technology has led to a massive wave of different decentralized ledger technology (DLT) solutions. Such projects as Bitcoin and Ethereum have shifted the paradigm of how to transact value in a decentralized manner, but their various core technologies have their own advantages and disadvantages. This paper aims to describe an alternative to modern decentralized financial networks by introducing the Humanode network. Humanode is a network safeguarded by cryptographically secure bio-authorized nodes. Users will be able to deploy nodes by staking their encrypted biometric data. This approach can potentially lead to the creation of a public, permissionless financial network based on consensus between equal human nodes with algorithm-based emission mechanisms targeting real value growth and proportional emission. Humanode combines different technological stacks to achieve a decentralized, secure, scalable, efficient, consistent, immutable, and sustainable financial network: 1) a bio-authorization module based on cryptographically secure neural networks for the private classification of 3D templates of users' faces 2) a private Liveness detection mechanism for identification of real human beings 3) a Substrate module as a blockchain layer 4) a cost-based fee system 5) a Vortex decentralized autonomous organization (DAO) governing system 6) a monetary policy and algorithm, Fath, where monetary supply reacts to real value growth and emission is proportional. All of these implemented technologies have nuances that are crucial for the integrity of the network. In this paper we address these details, describing problems that might occur and their possible solutions. The main goal of Humanode is to create a stable and just financial network that relies on the existence of human life.

Ansari Abdullah, Hardik Gajera, Ayan Mahalanobis

It is currently known from the work of Shoup and Nechaev that a generic algorithm to solve the discrete logarithm problem in a group of prime order must have complexity at least $k\sqrt{N}$ where $N$ is the order of the group. In many collision search algorithms this complexity is achieved. So with generic algorithms one can only hope to make the $k$ smaller. This $k$ depends on the complexity of the iterative step in the generic algorithms. The $\sqrt{N}$ comes from the fact there is about $\sqrt{N}$ iterations before a collision. So if we can find ways that can reduce the amount of work in one iteration then that is of great interest and probably the only possible modification of a generic algorithm. The modified $r$-adding walk allegedly does just that. It claims to reduce the amount of work done in one iteration of the original $r$-adding walk. In this paper we study this modified $r$-adding walk, we critically analyze it and we compare it with the original $r$-adding walk.