/*
This file is part of GNUnet.
- (C) 2009, 2010, 2011, 2012 Christian Grothoff (and other contributing authors)
+ (C) 2009, 2010, 2011, 2012, 2013 Christian Grothoff (and other contributing authors)
GNUnet is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published
#include "gnunet_core_service.h"
#include "gnunet_nse_service.h"
#include "nse.h"
+#include <gcrypt.h>
+
/**
* Should messages be delayed randomly? This option should be set to
}
+/**
+ * Calculate the 'proof-of-work' hash (an expensive hash).
+ *
+ * @param buf data to hash
+ * @param buf_len number of bytes in 'buf'
+ * @param result where to write the resulting hash
+ */
+static void
+pow_hash (const void *buf,
+ size_t buf_len,
+ struct GNUNET_HashCode *result)
+{
+ GNUNET_break (0 ==
+ gcry_kdf_derive (buf, buf_len,
+ GCRY_KDF_PBKDF2 /* FIX: use SCRYPT! */,
+ 1 /* subalgo */,
+ "gnunet-proof-of-work", strlen ("gnunet-proof-of-work"),
+ 2 /* iterations; keep cost of individual op small */,
+ sizeof (struct GNUNET_HashCode), result));
+}
+
+
/**
* Get the number of matching bits that the given timestamp has to the given peer ID.
*
memcpy (buf, &val, sizeof (val));
memcpy (&buf[sizeof (val)], pkey,
sizeof (struct GNUNET_CRYPTO_EccPublicKeyBinaryEncoded));
- GNUNET_CRYPTO_hash (buf, sizeof (buf), &result);
+ pow_hash (buf, sizeof (buf), &result);
return (count_leading_zeroes (&result) >=
nse_work_required) ? GNUNET_YES : GNUNET_NO;
}
while ((counter != UINT64_MAX) && (i < ROUND_SIZE))
{
memcpy (buf, &counter, sizeof (uint64_t));
- GNUNET_CRYPTO_hash (buf, sizeof (buf), &result);
+ pow_hash (buf, sizeof (buf), &result);
if (nse_work_required <= count_leading_zeroes (&result))
{
my_proof = counter;
--- /dev/null
+/*
+ This file is part of GNUnet.
+ (C) 2002, 2003, 2004, 2006, 2013 Christian Grothoff (and other contributing authors)
+
+ GNUnet is free software; you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published
+ by the Free Software Foundation; either version 2, or (at your
+ option) any later version.
+
+ GNUnet is distributed in the hope that it will be useful, but
+ WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+ General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with GNUnet; see the file COPYING. If not, write to the
+ Free Software Foundation, Inc., 59 Temple Place - Suite 330,
+ Boston, MA 02111-1307, USA.
+*/
+
+/**
+ * @author Christian Grothoff
+ * @file nse/perf_kdf.c
+ * @brief measure performance of KDF hash function
+ */
+#include "platform.h"
+#include "gnunet_common.h"
+#include "gnunet_util_lib.h"
+#include <gcrypt.h>
+#include <gauger.h>
+
+
+
+/**
+ * Calculate the 'proof-of-work' hash (an expensive hash).
+ *
+ * @param buf data to hash
+ * @param buf_len number of bytes in 'buf'
+ * @param result where to write the resulting hash
+ */
+static void
+pow_hash (const void *buf,
+ size_t buf_len,
+ struct GNUNET_HashCode *result)
+{
+ GNUNET_break (0 ==
+ gcry_kdf_derive (buf, buf_len,
+ GCRY_KDF_PBKDF2 /* FIX: use SCRYPT! */,
+ 1 /* subalgo */,
+ "gnunet-proof-of-work", strlen ("gnunet-proof-of-work"),
+ 2 /* iterations; keep cost of individual op small */,
+ sizeof (struct GNUNET_HashCode), result));
+}
+
+
+static void
+perfHash ()
+{
+ struct GNUNET_HashCode hc;
+ unsigned int i;
+ char buf[64];
+
+ memset (buf, 1, sizeof (buf));
+ for (i = 0; i < 1024; i++)
+ pow_hash (buf, sizeof (buf), &hc);
+}
+
+
+int
+main (int argc, char *argv[])
+{
+ struct GNUNET_TIME_Absolute start;
+
+ start = GNUNET_TIME_absolute_get ();
+ perfHash ();
+ printf ("Hash perf took %s\n",
+ GNUNET_STRINGS_relative_time_to_string (GNUNET_TIME_absolute_get_duration (start),
+ GNUNET_YES));
+ GAUGER ("NSE", "Proof-of-work hashing",
+ 1024 / (1 +
+ GNUNET_TIME_absolute_get_duration
+ (start).rel_value), "hashes/s");
+ return 0;
+}
+
+/* end of perf_kdf.c */