File:  [cvs.NetBSD.org] / pkgsrc / security / libmerkletree / Attic / distinfo
Revision 1.1.1.1 (vendor branch): download - view: text, annotated - select for diffs
Wed Mar 5 05:25:18 2014 UTC (11 years ago) by agc
Branches: TNF
CVS tags: pkgsrc-base, pkgsrc-2016Q4-base, pkgsrc-2016Q4, pkgsrc-2016Q3-base, pkgsrc-2016Q3, pkgsrc-2016Q2-base, pkgsrc-2016Q2, pkgsrc-2016Q1-base, pkgsrc-2016Q1, pkgsrc-2015Q4-base, pkgsrc-2015Q4, pkgsrc-2015Q3-base, pkgsrc-2015Q3, pkgsrc-2015Q2-base, pkgsrc-2015Q2, pkgsrc-2015Q1-base, pkgsrc-2015Q1, pkgsrc-2014Q4-base, pkgsrc-2014Q4, pkgsrc-2014Q3-base, pkgsrc-2014Q3, pkgsrc-2014Q2-base, pkgsrc-2014Q2, pkgsrc-2014Q1-base, pkgsrc-2014Q1

Initial import of libmerkletree-20140304 into the Packages Collection

	The libmerkletree library implements Merkle tree calculation, and also
	includes some higher-level functions to verify a file against a
	previously-generated Merkle tree.

	A Merkle tree is a hash tree calculated across blocks in data.  Any
	block size can be specified in this implementation.  A digest is
	calculated across each block in the data, and then a digest is
	calculated across blocks of the checksums, and this continues until
	only one block of digest exists.  The hierarchical nature of this
	allows individual blocks of a file to be verified, even if other parts
	of the file have been modified.  A degenerate case, in which the data
	is less than the blocksize, will mean that a single digest value for
	the block is calculated.  This will be the same as the digest
	algorithm applied to the whole file.

	The digest calculations themselves are done by the libmultigest(3)
	library, and allow concatenation of multiple digests to produce a
	single large digest value.

$NetBSD: distinfo,v 1.1.1.1 2014/03/05 05:25:18 agc Exp $