Skip to content

The World’s First Decentralised Neuromorphic Supercomputing Platform

Dynex is a next-generation platform for neuromorphic computing based on a groundbreaking flexible blockchain protocol. It consists of participating PoUW miners that constitute a decentralised neuromorphic supercomputing network which is capable of performing computations at unprecedented speed and efficiency – even exceeding quantum computing. By transforming traditional inefficient computers into neuromorphic chips, we will finally be able to create new discoveries. Dynex’ proprietary Proof-of-Useful-Work (PoUW) algorithm DynexSolve enables each miner to perform Dynex Chip computations. As a community and with collaborative effort we can take the next step towards sustainability and efficacy. Transform your computer or your dormant GPU mining equipment into neuromorphic machines, earn money and generate wealth: let’s solve problems together.

5.094,03 kH
281,66 DNX
36.163.771 DNX

DynexSolve: Proof-of-Useful-Work (PoUW)

Our proprietary Dynex Chip design is built based on ideal memristors. Memristors are two-terminal resistive devices with memory. In general, their nonlinear dynamic behaviour is mathematically modeled by means of a differential algebraic equation (DAE) set, in which an ordinary differential equation (ODE) governs the time evolution of the memory state, while an algebraic relation captures the state- and input-dependent Ohm law. The memristor, an acronym for memory resistor, was theoretically introduced in 1971 by L.O. Chua. Introduced in the 1971 pioneering paper, presently referred to as ideal memristor, is the fourth fundamental two-terminal circuit element, the other three being the resistor, the capacitor, and the inductor. Since then, the interest on memristors and their applications has been growing exponentially, with both academia and industry deploying a huge amount of funds and personnel to fabricate, model, and explore the full potential of these devices in electronics applications. The DynexSolve PoUW algorithm utilises the unprecedented performance of such memristors and performs ODE integration (simulations) of our Dynex Chips. By utilising the massive parallelism of all participating Graphic Processing Units (GPUs), we can achieve close to realtime performance of the original chip design. This allows computations of constraint satisfaction problems, mixed integer linear programming, quadratic unconstraint binary optimisation, maximum satisfiability problem, federated machine learning, efficient pre-training of restricted boltzmann machines and deep neural networks, subset sum problems or integer factorisation.


BARTHEL Problem (Statistical Mechanics) | SOLVED
Description:The design of the hardest problem instances is based on the existence of a first order ferromagnetic phase transition and the glassy nature of excited states.
File:computation file
Descrete time:7.3125s
Wall time:11.7439s
Reference solvers:Unsolved
BARTHEL Problem (Statistical Mechanics) | SOLVED
Description:The design of the hardest problem instances is based on the existence of a first order ferromagnetic phase transition and the glassy nature of excited states.
File:computation file
Descrete time:58.4625s
Wall time:547.251s
Reference solvers:Unsolved
Electric Vehicle Routing | SOLVED
Description:optimal routing strategy with minimal travel time cost and energy cost as well as number of EVs dispatched
File:computation file
Descrete time:432,944.0332s
Wall time:1,555,200.2312s
Reference solvers:Unsolved
Twitter Data Analytics | QUEUED
Description:Behavioral Twitter data analytics problem
File:computation files
Descrete time:N/A
Wall time:N/A
Reference solvers:Unsolved
Logistics and Storage of Radioactive Waste Packages
Description:Mathematically optimised logistics and storage of radioactive waste packages
Source:Nuclear Energy Agency of the OECD (NEA)
File:computation file
Descrete time:N/A
Wall time:N/A
Reference solvers:Unsolved
141.032.927.511 kFLOPS

A fair start

When Dynex started on September 16th, 2022, there was no initial coin offering (ICO), no pre-mining and no pre-allocation of tokens to any team members or investors. A truly fair launch – unparalleled in any other token platform.

100.00% public allocation

Neuromorphic computing

Dynex serves as the foundation for applications and algorithms built on top of it. It consists of participating miners that together constitute one enormous neuromorphic computing network – a highly efficient next generation computing system.

Decentralised Neuromorphic Computing

Energy efficient

In light of the growing threat of climate change to our environment and our future, it is imperative that we take every measure necessary to reduce global energy consumption. An accelerated adoption of neuromorphic computing will therefore benefit our entire society since it uses orders of magnitude less energy compared to traditional computing systems.

Green & sustainable

Long-term perspective

In order to ensure the long-term success of Dynex, all aspects of development should be viewed from a long-term perspective. The Dynex project should be able to survive for centuries without any hard forks, hardware or software improvements, or any other unpredictable changes. Due to the fact that Dynex is designed as a platform, it should also be possible for applications and algorithms built on top of Dynex to survive over the long term. Due to Dynex’s resiliency and long-term survivability, it may also have the potential to serve as a good store of value.

Untraceable transactions

Dynex employs a scheme of fully anonymous transactions satisfying both untraceability and unlinkability conditions. The sender is not required to cooperate with other users or a trusted third party to make his transactions.

A new level of privacy

Open and permissionless

Dynex neuromorphic chips and Dynex protocol do not restrict or limit any categories of usage. A user should be able to join the network and participate in the protocol without taking any preliminary steps. Dynex does not allow discrimination or limited access at the core level, as is the case with traditional supercomputer systems. In contrast, application developers are free to implement any logic they like, as long as they are responsible for the ethical and legal implications of their work.


Our algorithm is a memory-bound algorithm for the proof-of-work pricing function. It relies on random access to a slow memory and emphasises latency dependence and requires significantly less memory to verify a solution than to discover it. As a result, we close the gap between CPU/GPU and ASIC miners.

Unlinkable payments

The Dynex protocol allows a user to publish a single address and receive unconditional unlinkable payments. The destination of each output (by default) is a public key, derived from recipient’s address and sender’s random data. Every destination key unlinkable for a spectator.

One-time ring signatures

One-time ring signatures allows users to achieve unconditional unlinkability: a user produces a signature which can be checked by a set of public keys rather than a unique public key. The identity of the signer is indistinguishable from the other users whose public keys are in the set until the owner produces a second signature using the same keypair.

Transform your computer into a neuromorphic machine

Recent Editorial Articles