Blog

What "Parameterless" Means in DAGKnight, Explained Simply

DAGKnight is often described with one word that sounds more complicated than it is: parameterless. It is the main idea that separates DAGKnight from GHOSTDAG, the consensus protocol Kaspa runs today. This guide explains what it means, why it matters, and where its limits are.

Published 14 November 2026

GHOSTDAG uses a fixed k set in advance, while DAGKnight reads the blockDAG, where honest blocks are tightly connected and a secret attacker chain is poorly connected.

The problem: a fixed setting chosen in advance

Kaspa produces 10 blocks per second. At that speed, many blocks are mined at almost the same moment, before miners have seen each other's work. Kaspa keeps those blocks in a blockDAG instead of throwing them away, and a consensus protocol decides how to order them.

GHOSTDAG does this with a fixed number called k. Roughly, k says how many blocks can be created "in parallel" by honest miners, given the slowest network delay the protocol is designed to tolerate. That delay bound is chosen ahead of time and built into the protocol.

A useful comparison is a speed limit set before anyone has seen the road:

GHOSTDAG is secure as long as real network delay stays inside the bound it was designed for. The cost is that confirmation times are paced by the worst case, not by how the network is actually behaving.

What DAGKnight does instead

DAGKnight removes that hard-coded bound. Rather than being told k, it works k out from the DAG itself. In simplified terms, it looks for the smallest k at which blocks backed by a majority of the mining work form a well-connected cluster.

That works because of how honest and attacking blocks look in the DAG:

When the network is healthy, the honest cluster is tight and a small k is enough. When the network slows down, the honest cluster spreads out and DAGKnight finds a larger k. Either way, the setting reflects current conditions rather than a guess made years earlier.

Why "parameterless" matters

The DAGKnight paper, by Michael Sutton and Yonatan Sompolinsky (2022), describes it as the first permissionless protocol with no built-in bound on network latency. The practical benefits it points to are:

The fine print

"Parameterless" doesn't mean there are no assumptions anywhere. The paper notes that, because of a known impossibility result in distributed systems, a client (for example, a wallet or exchange deciding when a payment is final) still has to choose a local bound on recent attacker latency. The difference is that this choice sits with the user rather than being fixed for the whole network.

It's also worth being clear about what DAGKnight is not:

Frequently asked questions

Is DAGKnight just GHOSTDAG with a bigger k?

No. GHOSTDAG uses one fixed k for everyone. DAGKnight searches for the right k based on what the DAG shows, so the value can change with network conditions.

Will parameterless consensus make Kaspa faster?

Its main benefit is faster, adaptive confirmation on normal days. The number of blocks per second is a separate setting. You can estimate today's confirmation times with our confirmation time calculator.

Who designed DAGKnight?

Yonatan Sompolinsky and Michael Sutton. Sompolinsky also co-authored GHOSTDAG and the original GHOST protocol.

Not financial advice. This article is for education only. dagknight.com is a community project and is not affiliated with the Kaspa Foundation.

Sources