Commit Graph

192 Commits

Author SHA1 Message Date
Markus Teich
e66cbbe44f move ecdlogctx passing to _join()/_new() functions 2016-12-02 12:53:54 +01:00
Markus Teich
64689a9083 add error log msg 2016-12-02 12:53:19 +01:00
Markus Teich
178ca8ba98 fix 2016-12-02 12:49:39 +01:00
Markus Teich
f92e8c1d0c abort instead of assert 2016-12-02 12:23:10 +01:00
Markus Teich
2eb3cbaa3a make byte plural consistent 2016-12-02 12:18:35 +01:00
Markus Teich
ec0e5f0189 fix doc in brandt.h 2016-12-02 11:45:19 +01:00
Markus Teich
0ba8f80bc1 unify msg delivery callback 2016-12-02 11:45:05 +01:00
Markus Teich
1bf5fbff77 style 2016-12-02 11:40:10 +01:00
Markus Teich
fa086e2d4f cleanup todos in brandt.h 2016-12-02 11:04:45 +01:00
Markus Teich
209f0162fc use new GNUNET_assert_from() 2016-12-02 10:45:11 +01:00
Markus Teich
50c476877e migrate to GNUNET_assert 2016-12-02 09:43:04 +01:00
Markus Teich
56b43dab7f migrate to GNUNET_log 2016-12-02 09:34:25 +01:00
Markus Teich
aee7167739 use GNUNET_log in test_brandt 2016-11-29 14:44:54 +01:00
Markus Teich
df34510466 coding style 2016-11-29 14:43:08 +01:00
Markus Teich
d775547d04 doc two missing parameters 2016-11-23 23:44:28 +01:00
Markus Teich
f4932d94c0 remove unnecessary description handling and hashing.
The hash is not needed since the sellers application is required to sign the
description and the bidders application is required to check the signature.
Since the arbitrary description used by the application was only used inside
this hash, it can be removed as well.
2016-11-23 23:26:01 +01:00
Markus Teich
b0042a588a add doc for test-case function 2016-11-23 23:14:48 +01:00
Markus Teich
ad20666c33 fix memleak 2016-11-23 18:27:57 +01:00
Markus Teich
5706e91058 add m+1st price auctions with public outcome 2016-11-22 03:17:01 +01:00
Markus Teich
a74e150375 abort() on OOM 2016-11-22 03:11:24 +01:00
Markus Teich
e9d1c7ba00 BRANDT_new() returns NULL on parameter failure 2016-11-22 00:29:27 +01:00
Markus Teich
1e83436746 clarify BRANDT_new doc 2016-11-04 16:42:59 +01:00
Markus Teich
aa83eda9e9 clarify BRANDT_CbStart doc 2016-11-04 16:41:14 +01:00
Markus Teich
44079d5cbb handle n <= m case in m+1st price auctions
The lowest possible price from the price map will be the price each bidder has
to pay. Since the seller can define the price map, he can set the lowest price
to the lowest he is willing to sell one item at.
2016-11-01 13:16:41 +01:00
Markus Teich
e98bb69ce2 add todo entry 2016-11-01 13:12:53 +01:00
Markus Teich
257d5b72b0 test for no bidders 2016-11-01 12:16:12 +01:00
Markus Teich
37ac9545eb fix alignment 2016-10-31 15:16:07 +01:00
Markus Teich
45db43a688 remove debug output 2016-10-15 21:07:10 +02:00
Markus Teich
5ce71329cf add M+1st price private outcome implementation 2016-10-15 20:33:21 +02:00
Markus Teich
5d028cc81e math.tex: fix M+1st private outcome function 2016-10-15 20:31:37 +02:00
Markus Teich
ca00e6ba8e fixup test_brandt 2016-10-15 20:30:46 +02:00
Markus Teich
da43b9311a fix preparation for M+1st price auctions 2016-10-14 23:57:15 +02:00
Markus Teich
fc9fdd313b make test_brandt ready for M+1st price auctions 2016-10-14 05:50:27 +02:00
Markus Teich
e333dd0183 rework test_brandt 2016-10-14 04:55:53 +02:00
Markus Teich
45b930823c clarify docstring 2016-10-13 23:39:52 +02:00
Markus Teich
79d4275619 blow up k on M+1st price auctions 2016-10-13 23:39:17 +02:00
Markus Teich
a4c883147d remove test.h dependency from test_brandt.c 2016-10-13 23:38:18 +02:00
Markus Teich
b4694f8d06 simplify encrypt_bid 2016-10-12 19:19:45 +02:00
Markus Teich
6654fc3c01 typo 2016-10-12 19:18:14 +02:00
Markus Teich
eddab76982 math.tex: add first price public outcome protocol and description for M+1st price private outcome protocol 2016-10-12 14:21:16 +02:00
Markus Teich
7e4d82b58b simplify check 2016-10-12 14:08:50 +02:00
Markus Teich
9070e0fa9f math.tex: fix M+1st price outcome determination formula 2016-10-09 14:47:09 +02:00
Markus Teich
ac5050919f math.tex: fix index for additional ZKP on M+1st price auctions 2016-10-09 14:34:15 +02:00
Markus Teich
ebd955858f add additional proof on encrypt_bid for M+1st price auctions
This is needed to ensure bidders are only chosing bids from the subset which is
allowed to them. This prevents ties and keeps the protocol way more simple for
M+1st price auctions.
2016-10-09 14:16:53 +02:00
Markus Teich
d4932019ad math.tex: add m+1st price auction private outcome protocol 2016-10-08 16:59:01 +02:00
Markus Teich
233f955928 gp script formatting 2016-10-08 16:58:25 +02:00
Markus Teich
3940092e24 doc fix 2016-10-08 14:39:57 +02:00
Markus Teich
8ea21d9732 split different auction format algorithms into separate files 2016-09-29 18:22:21 +02:00
Markus Teich
656aa46553 Revert "union"
This reverts commit 20714489cf.
2016-09-29 10:22:00 +02:00
Markus Teich
e52b751b87 remove unneeded array tests
These are tested in libgnunetutil now.
2016-09-29 10:21:26 +02:00