36 lines
1.2 KiB
Nix
36 lines
1.2 KiB
Nix
{ lib, mkCoqDerivation, coq, mathcomp-ssreflect, mathcomp-algebra, mathcomp-fingroup, paramcoq
|
|
, version ? null }:
|
|
with lib;
|
|
|
|
mkCoqDerivation {
|
|
pname = "addition-chains";
|
|
repo = "hydra-battles";
|
|
|
|
release."0.4".sha256 = "1f7pc4w3kir4c9p0fjx5l77401bx12y72nmqxrqs3qqd3iynvqlp";
|
|
release."0.5".sha256 = "121pcbn6v59l0c165ha9n00whbddpy11npx2y9cn7g879sfk2nqk";
|
|
release."0.6".sha256 = "1dri4sisa7mhclf8w4kw7ixs5zxm8xyjr034r1377p96rdk3jj0j";
|
|
releaseRev = (v: "v${v}");
|
|
|
|
inherit version;
|
|
defaultVersion = with versions; switch coq.coq-version [
|
|
{ case = range "8.13" "8.16"; out = "0.6"; }
|
|
{ case = range "8.11" "8.12"; out = "0.4"; }
|
|
] null;
|
|
|
|
propagatedBuildInputs = [ mathcomp-ssreflect mathcomp-algebra mathcomp-fingroup paramcoq ];
|
|
|
|
useDune = true;
|
|
|
|
meta = {
|
|
description = "Exponentiation algorithms following addition chains";
|
|
longDescription = ''
|
|
Addition chains are algorithms for computations of the p-th
|
|
power of some x, with the least number of multiplication as
|
|
possible. We present a few implementations of addition chains,
|
|
with proofs of their correctness.
|
|
'';
|
|
maintainers = with maintainers; [ Zimmi48 ];
|
|
license = licenses.mit;
|
|
platforms = platforms.unix;
|
|
};
|
|
}
|