diff --git a/ergo-core/src/main/scala/org/ergoplatform/mining/ModQHash.scala b/ergo-core/src/main/scala/org/ergoplatform/mining/ModQHash.scala
index eae08089ff..1d4f360332 100644
--- a/ergo-core/src/main/scala/org/ergoplatform/mining/ModQHash.scala
+++ b/ergo-core/src/main/scala/org/ergoplatform/mining/ModQHash.scala
@@ -12,6 +12,8 @@ import scala.annotation.tailrec
   * in range from 0 to a maximum number divisible by q without remainder.
   * If yes, it returns the result mod q, otherwise make one more iteration using hash as an input.
   * This is done to ensure uniform distribution of the resulting numbers.
+  *
+  * Used in Autolykos v1 only!
   */
 class ModQHash(val q: BigInt) extends ScorexLogging with ScorexEncoding {
   assert(q.bigInteger.bitLength() <= 256, "We use 256 bit hash here")