kpriv/pkgsrc
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity
pkgsrc/security/p5-Digest-Hashcash/patches/patch-aa

23 lines
504 B
Text
Raw Normal View History

Updated to version 0.03. Pkgsrc changes: - Rewrote patch-aa to be specific to NetBSD. Changes since version 0.02: =========================== - generate more efficient code with gcc-3.4 and later.
2006-03-10 21:29:46 +01:00
$NetBSD: patch-aa,v 1.2 2006/03/10 20:29:46 heinz Exp $
Initial import of the Digest::Hashcash Perl module. The Digest::Hashcash Perl module calculates n-bit partial hash collisions on chosen texts. The idea of using partial hashes is that they can be made arbitrarily expensive to compute (by choosing the desired number of bits of collision), and yet can be verified instantly. This can be used as the basis for an e-cash system measured in burnt CPU cycles. Such cash systems can be used to throttle systematic abuses of un-metered internet resources.
2003-12-28 02:07:58 +01:00
Updated to version 0.03. Pkgsrc changes: - Rewrote patch-aa to be specific to NetBSD. Changes since version 0.02: =========================== - generate more efficient code with gcc-3.4 and later.
2006-03-10 21:29:46 +01:00
--- Hashcash.xs.orig 2005-03-03 17:56:51.000000000 +0100
Initial import of the Digest::Hashcash Perl module. The Digest::Hashcash Perl module calculates n-bit partial hash collisions on chosen texts. The idea of using partial hashes is that they can be made arbitrarily expensive to compute (by choosing the desired number of bits of collision), and yet can be verified instantly. This can be used as the basis for an e-cash system measured in burnt CPU cycles. Such cash systems can be used to throttle systematic abuses of un-metered internet resources.
2003-12-28 02:07:58 +01:00
+++ Hashcash.xs
Updated to version 0.03. Pkgsrc changes: - Rewrote patch-aa to be specific to NetBSD. Changes since version 0.02: =========================== - generate more efficient code with gcc-3.4 and later.
2006-03-10 21:29:46 +01:00
@@ -4,7 +4,17 @@
Initial import of the Digest::Hashcash Perl module. The Digest::Hashcash Perl module calculates n-bit partial hash collisions on chosen texts. The idea of using partial hashes is that they can be made arbitrarily expensive to compute (by choosing the desired number of bits of collision), and yet can be verified instantly. This can be used as the basis for an e-cash system measured in burnt CPU cycles. Such cash systems can be used to throttle systematic abuses of un-metered internet resources.
2003-12-28 02:07:58 +01:00
#include <time.h>
#include <stdlib.h>
Updated to version 0.03. Pkgsrc changes: - Rewrote patch-aa to be specific to NetBSD. Changes since version 0.02: =========================== - generate more efficient code with gcc-3.4 and later.
2006-03-10 21:29:46 +01:00
+#if defined(__NetBSD__)
+#include <sys/param.h>
+#if __NetBSD_Version__ < 105160000
Initial import of the Digest::Hashcash Perl module. The Digest::Hashcash Perl module calculates n-bit partial hash collisions on chosen texts. The idea of using partial hashes is that they can be made arbitrarily expensive to compute (by choosing the desired number of bits of collision), and yet can be verified instantly. This can be used as the basis for an e-cash system measured in burnt CPU cycles. Such cash systems can be used to throttle systematic abuses of un-metered internet resources.
2003-12-28 02:07:58 +01:00
+#include <inttypes.h>
Updated to version 0.03. Pkgsrc changes: - Rewrote patch-aa to be specific to NetBSD. Changes since version 0.02: =========================== - generate more efficient code with gcc-3.4 and later.
2006-03-10 21:29:46 +01:00
+typedef uint32_t uint_fast32_t;
+#else
#include <stdint.h>
+#endif
+#else
+#include <stdint.h>
+#endif
Initial import of the Digest::Hashcash Perl module. The Digest::Hashcash Perl module calculates n-bit partial hash collisions on chosen texts. The idea of using partial hashes is that they can be made arbitrarily expensive to compute (by choosing the desired number of bits of collision), and yet can be verified instantly. This can be used as the basis for an e-cash system measured in burnt CPU cycles. Such cash systems can be used to throttle systematic abuses of un-metered internet resources.
2003-12-28 02:07:58 +01:00
/* NIST Secure Hash Algorithm */
/* heavily modified by Uwe Hollerbach <uh@alumni.caltech edu> */
Reference in a new issue Copy permalink