2022-05-19 19:56:03 +00:00
|
|
|
## Nim-Codex
|
2021-02-26 00:23:22 +00:00
|
|
|
## Copyright (c) 2021 Status Research & Development GmbH
|
|
|
|
## Licensed under either of
|
|
|
|
## * Apache License, version 2.0, ([LICENSE-APACHE](LICENSE-APACHE))
|
|
|
|
## * MIT license ([LICENSE-MIT](LICENSE-MIT))
|
|
|
|
## at your option.
|
|
|
|
## This file may not be copied, modified, or distributed except according to
|
|
|
|
## those terms.
|
|
|
|
|
2022-04-05 00:46:13 +00:00
|
|
|
import std/tables
|
2023-11-14 12:02:17 +00:00
|
|
|
import std/sugar
|
2022-04-05 00:46:13 +00:00
|
|
|
export tables
|
|
|
|
|
2022-03-18 22:17:51 +00:00
|
|
|
import pkg/upraises
|
|
|
|
|
|
|
|
push: {.upraises: [].}
|
2021-02-26 00:23:22 +00:00
|
|
|
|
2023-11-14 12:02:17 +00:00
|
|
|
import pkg/libp2p/[cid, multicodec, multihash]
|
2021-08-30 19:25:20 +00:00
|
|
|
import pkg/stew/byteutils
|
2022-01-11 02:25:13 +00:00
|
|
|
import pkg/questionable
|
|
|
|
import pkg/questionable/results
|
|
|
|
|
2023-07-06 23:23:27 +00:00
|
|
|
import ./units
|
|
|
|
import ./utils
|
2022-01-11 02:25:13 +00:00
|
|
|
import ./errors
|
2023-12-19 22:12:47 +00:00
|
|
|
import ./logutils
|
|
|
|
import ./utils/json
|
2021-02-26 00:23:22 +00:00
|
|
|
|
2023-12-19 22:12:47 +00:00
|
|
|
export errors, logutils, units
|
2022-10-27 13:41:34 +00:00
|
|
|
|
2022-07-28 00:39:17 +00:00
|
|
|
const
|
2022-10-06 20:01:25 +00:00
|
|
|
# Size of blocks for storage / network exchange,
|
|
|
|
# should be divisible by 31 for PoR and by 64 for Leopard ECC
|
2023-07-06 23:23:27 +00:00
|
|
|
DefaultBlockSize* = NBytes 31 * 64 * 33
|
2022-07-28 00:39:17 +00:00
|
|
|
|
|
|
|
type
|
|
|
|
Block* = ref object of RootObj
|
|
|
|
cid*: Cid
|
|
|
|
data*: seq[byte]
|
|
|
|
|
2023-11-14 12:02:17 +00:00
|
|
|
BlockAddress* = object
|
|
|
|
case leaf*: bool
|
|
|
|
of true:
|
2023-12-19 22:12:47 +00:00
|
|
|
treeCid* {.serialize.}: Cid
|
|
|
|
index* {.serialize.}: Natural
|
2023-11-14 12:02:17 +00:00
|
|
|
else:
|
2023-12-19 22:12:47 +00:00
|
|
|
cid* {.serialize.}: Cid
|
2023-11-14 12:02:17 +00:00
|
|
|
|
2023-12-19 22:12:47 +00:00
|
|
|
logutils.formatIt(LogFormat.textLines, BlockAddress):
|
|
|
|
if it.leaf:
|
|
|
|
"treeCid: " & shortLog($it.treeCid) & ", index: " & $it.index
|
|
|
|
else:
|
|
|
|
"cid: " & shortLog($it.cid)
|
|
|
|
|
|
|
|
logutils.formatIt(LogFormat.json, BlockAddress): %it
|
2023-11-14 12:02:17 +00:00
|
|
|
|
|
|
|
proc `==`*(a, b: BlockAddress): bool =
|
|
|
|
a.leaf == b.leaf and
|
|
|
|
(
|
|
|
|
if a.leaf:
|
|
|
|
a.treeCid == b.treeCid and a.index == b.index
|
|
|
|
else:
|
|
|
|
a.cid == b.cid
|
|
|
|
)
|
|
|
|
|
|
|
|
proc `$`*(a: BlockAddress): string =
|
|
|
|
if a.leaf:
|
|
|
|
"treeCid: " & $a.treeCid & ", index: " & $a.index
|
|
|
|
else:
|
|
|
|
"cid: " & $a.cid
|
|
|
|
|
|
|
|
proc cidOrTreeCid*(a: BlockAddress): Cid =
|
|
|
|
if a.leaf:
|
|
|
|
a.treeCid
|
|
|
|
else:
|
|
|
|
a.cid
|
|
|
|
|
|
|
|
proc address*(b: Block): BlockAddress =
|
|
|
|
BlockAddress(leaf: false, cid: b.cid)
|
|
|
|
|
|
|
|
proc init*(_: type BlockAddress, cid: Cid): BlockAddress =
|
|
|
|
BlockAddress(leaf: false, cid: cid)
|
|
|
|
|
|
|
|
proc init*(_: type BlockAddress, treeCid: Cid, index: Natural): BlockAddress =
|
|
|
|
BlockAddress(leaf: true, treeCid: treeCid, index: index)
|
2022-04-05 00:46:13 +00:00
|
|
|
|
2021-02-26 00:23:22 +00:00
|
|
|
proc `$`*(b: Block): string =
|
|
|
|
result &= "cid: " & $b.cid
|
|
|
|
result &= "\ndata: " & string.fromBytes(b.data)
|
|
|
|
|
2022-03-18 19:50:53 +00:00
|
|
|
func new*(
|
2023-06-22 15:11:18 +00:00
|
|
|
T: type Block,
|
|
|
|
data: openArray[byte] = [],
|
|
|
|
version = CIDv1,
|
|
|
|
mcodec = multiCodec("sha2-256"),
|
|
|
|
codec = multiCodec("raw")
|
|
|
|
): ?!Block =
|
|
|
|
## creates a new block for both storage and network IO
|
2023-11-14 17:52:27 +00:00
|
|
|
##
|
2022-01-11 02:25:13 +00:00
|
|
|
|
|
|
|
let
|
|
|
|
hash = ? MultiHash.digest($mcodec, data).mapFailure
|
|
|
|
cid = ? Cid.init(version, codec, hash).mapFailure
|
|
|
|
|
2022-03-15 18:47:31 +00:00
|
|
|
# TODO: If the hash is `>=` to the data,
|
|
|
|
# use the Cid as a container!
|
|
|
|
Block(
|
2022-01-11 02:25:13 +00:00
|
|
|
cid: cid,
|
2022-03-15 18:47:31 +00:00
|
|
|
data: @data).success
|
2021-08-30 19:25:20 +00:00
|
|
|
|
2022-03-18 19:50:53 +00:00
|
|
|
func new*(
|
2023-06-22 15:11:18 +00:00
|
|
|
T: type Block,
|
|
|
|
cid: Cid,
|
|
|
|
data: openArray[byte],
|
|
|
|
verify: bool = true
|
|
|
|
): ?!Block =
|
|
|
|
## creates a new block for both storage and network IO
|
2023-11-14 12:02:17 +00:00
|
|
|
##
|
|
|
|
|
|
|
|
if verify:
|
|
|
|
let
|
|
|
|
mhash = ? cid.mhash.mapFailure
|
|
|
|
computedMhash = ? MultiHash.digest($mhash.mcodec, data).mapFailure
|
|
|
|
computedCid = ? Cid.init(cid.cidver, cid.mcodec, computedMhash).mapFailure
|
|
|
|
if computedCid != cid:
|
|
|
|
return "Cid doesn't match the data".failure
|
|
|
|
|
|
|
|
return Block(
|
|
|
|
cid: cid,
|
|
|
|
data: @data
|
|
|
|
).success
|
|
|
|
|
|
|
|
proc emptyCid*(version: CidVersion, hcodec: MultiCodec, dcodec: MultiCodec): ?!Cid =
|
|
|
|
## Returns cid representing empty content, given cid version, hash codec and data codec
|
2023-11-14 17:52:27 +00:00
|
|
|
##
|
2022-01-11 02:25:13 +00:00
|
|
|
|
2023-11-14 12:02:17 +00:00
|
|
|
const
|
|
|
|
Sha256 = multiCodec("sha2-256")
|
|
|
|
Raw = multiCodec("raw")
|
|
|
|
DagPB = multiCodec("dag-pb")
|
|
|
|
DagJson = multiCodec("dag-json")
|
|
|
|
|
|
|
|
var index {.global, threadvar.}: Table[(CidVersion, MultiCodec, MultiCodec), Cid]
|
|
|
|
once:
|
|
|
|
index = {
|
|
|
|
# source https://ipld.io/specs/codecs/dag-pb/fixtures/cross-codec/#dagpb_empty
|
|
|
|
(CIDv0, Sha256, DagPB): ? Cid.init("QmdfTbBqBPQ7VNxZEYEj14VmRuZBkqFbiwReogJgS1zR1n").mapFailure,
|
|
|
|
(CIDv1, Sha256, DagPB): ? Cid.init("zdj7Wkkhxcu2rsiN6GUyHCLsSLL47kdUNfjbFqBUUhMFTZKBi").mapFailure, # base36: bafybeihdwdcefgh4dqkjv67uzcmw7ojee6xedzdetojuzjevtenxquvyku
|
|
|
|
(CIDv1, Sha256, DagJson): ? Cid.init("z4EBG9jGUWMVxX9deANWX7iPyExLswe2akyF7xkNAaYgugvnhmP").mapFailure, # base36: baguqeera6mfu3g6n722vx7dbitpnbiyqnwah4ddy4b5c3rwzxc5pntqcupta
|
|
|
|
(CIDv1, Sha256, Raw): ? Cid.init("zb2rhmy65F3REf8SZp7De11gxtECBGgUKaLdiDj7MCGCHxbDW").mapFailure,
|
|
|
|
}.toTable
|
|
|
|
|
|
|
|
index[(version, hcodec, dcodec)].catch
|
2022-01-11 02:25:13 +00:00
|
|
|
|
2023-11-14 12:02:17 +00:00
|
|
|
proc emptyDigest*(version: CidVersion, hcodec: MultiCodec, dcodec: MultiCodec): ?!MultiHash =
|
|
|
|
emptyCid(version, hcodec, dcodec)
|
|
|
|
.flatMap((cid: Cid) => cid.mhash.mapFailure)
|
2022-01-11 02:25:13 +00:00
|
|
|
|
2023-11-14 12:02:17 +00:00
|
|
|
proc emptyBlock*(version: CidVersion, hcodec: MultiCodec): ?!Block =
|
|
|
|
emptyCid(version, hcodec, multiCodec("raw"))
|
|
|
|
.flatMap((cid: Cid) => Block.new(cid = cid, data = @[]))
|
|
|
|
|
|
|
|
proc emptyBlock*(cid: Cid): ?!Block =
|
2023-11-14 17:52:27 +00:00
|
|
|
cid.mhash.mapFailure.flatMap((mhash: MultiHash) =>
|
2023-11-14 12:02:17 +00:00
|
|
|
emptyBlock(cid.cidver, mhash.mcodec))
|
|
|
|
|
|
|
|
proc isEmpty*(cid: Cid): bool =
|
2023-11-14 17:52:27 +00:00
|
|
|
success(cid) == cid.mhash.mapFailure.flatMap((mhash: MultiHash) =>
|
2023-11-14 12:02:17 +00:00
|
|
|
emptyCid(cid.cidver, mhash.mcodec, cid.mcodec))
|
|
|
|
|
|
|
|
proc isEmpty*(blk: Block): bool =
|
|
|
|
blk.cid.isEmpty
|