mirrors/eclair
1
0
Fork 0
mirror of https://github.com/ACINQ/eclair.git synced 2025-02-24 06:47:46 +01:00
Code Issues Projects Releases Wiki Activity

shachain: track which hash index was inserted last

Browse source
This commit is contained in:
sstone 2016-06-24 17:49:33 +02:00
parent cb5e21959e
commit 207a2fb3b0
2 changed files with 29 additions and 9 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

35
eclair-demo/src/main/scala/fr/acinq/eclair/crypto/ShaChain.scala
View file

@ -4,6 +4,9 @@ import fr.acinq.bitcoin._
import scala.annotation.tailrec
/**
* see https://github.com/rustyrussell/lightning-rfc/blob/master/early-drafts/shachain.txt
*/
object ShaChain {
case class Node(value: BinaryData, height: Int, parent: Option[Node])
@ -43,30 +46,46 @@ object ShaChain {
@tailrec
def addHash(receiver: ShaChain, hash: BinaryData, index: Index): ShaChain = {
index.last match {
case true => ShaChain(receiver.nodes + (index -> hash))
case true => ShaChain(receiver.knownHashes + (index -> hash))
case false =>
val parentIndex = index.dropRight(1)
// hashes are supposed to be received in reverse order so we already have parent :+ true
// which we should be able to recompute (it's a left node so its hash is the same as its parent's hash)
assert(getHash(receiver, parentIndex :+ true) == Some(derive(Node(hash, parentIndex.length, None), true).value))
val nodes1 = receiver.nodes - (parentIndex :+ false) - (parentIndex :+ true)
addHash(ShaChain(nodes1), hash, parentIndex)
val nodes1 = receiver.knownHashes - (parentIndex :+ false) - (parentIndex :+ true)
addHash(receiver.copy(knownHashes = nodes1), hash, parentIndex)
}
}
def addHash(receiver: ShaChain, hash: BinaryData, index: Long): ShaChain = addHash(receiver, hash, moves(index))
def addHash(receiver: ShaChain, hash: BinaryData, index: Long): ShaChain = {
receiver.lastIndex.map(value => require(index == value - 1L))
addHash(receiver, hash, moves(index)).copy(lastIndex = Some(index))
}
def getHash(receiver: ShaChain, index: Index): Option[BinaryData] = {
receiver.nodes.keys.find(key => index.startsWith(key)).map(key => {
val root = Node(receiver.nodes(key), key.length, None)
receiver.knownHashes.keys.find(key => index.startsWith(key)).map(key => {
val root = Node(receiver.knownHashes(key), key.length, None)
derive(root, index.drop(key.length)).value
})
}
def getHash(receiver: ShaChain, index: Long): Option[BinaryData] = getHash(receiver, moves(index))
def getHash(receiver: ShaChain, index: Long): Option[BinaryData] = {
receiver.lastIndex match {
case None => None
case Some(value) if value > index => None
case _ => getHash(receiver, moves(index))
}
}
}
case class ShaChain(nodes: Map[Seq[Boolean], BinaryData]) {
/**
* Structure used to intelligently store unguessable hashes.
*
* @param knownHashes know hashes
* @param lastIndex index of the last known hash. Hashes are supposed to be added in reverse order i.e.
* from 0xFFFFFFFFFFFFFFFF down to 0
*/
case class ShaChain(knownHashes: Map[Seq[Boolean], BinaryData], lastIndex: Option[Long] = None) {
def addHash(hash: BinaryData, index: Long): ShaChain = ShaChain.addHash(this, hash, index)
def getHash(index: Long) = ShaChain.getHash(this, index)

3
eclair-demo/src/test/scala/fr/acinq/eclair/crypto/ShaChainSpec.scala
View file

@ -66,7 +66,7 @@ class ShaChainSpec extends FunSuite {
var receiver = ShaChain.empty
for (i <- 0 until 1000) {
receiver = receiver.addHash(ShaChain.shaChainFromSeed(seed, 0xFFFFFFFFFFFFFFFFL - i), 0xFFFFFFFFFFFFFFFFL - i)
assert(receiver.nodes.size <= 64)
assert(receiver.knownHashes.size <= 64)
var j: Long = 0xFFFFFFFFFFFFFFFFL - i
while (j != 0xFFFFFFFFFFFFFFFFL) {
val ho = receiver.getHash(j)
@ -75,6 +75,7 @@ class ShaChainSpec extends FunSuite {
if (k < 50) assert(ho == Some(expected(k)))
j = j + 1
}
assert(receiver.getHash(0xFFFFFFFFFFFFFFFFL - i - 1) == None)
}
}
}