1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
|
Received: from sog-mx-3.v43.ch3.sourceforge.com ([172.29.43.193]
helo=mx.sourceforge.net)
by sfs-ml-2.v29.ch3.sourceforge.com with esmtp (Exim 4.76)
(envelope-from <dgomez1092@gmail.com>) id 1YqsCP-0006jq-UK
for bitcoin-development@lists.sourceforge.net;
Sat, 09 May 2015 00:00:57 +0000
Received-SPF: pass (sog-mx-3.v43.ch3.sourceforge.com: domain of gmail.com
designates 74.125.82.46 as permitted sender)
client-ip=74.125.82.46; envelope-from=dgomez1092@gmail.com;
helo=mail-wg0-f46.google.com;
Received: from mail-wg0-f46.google.com ([74.125.82.46])
by sog-mx-3.v43.ch3.sourceforge.com with esmtps (TLSv1:RC4-SHA:128)
(Exim 4.76) id 1YqsCM-0001tY-Es
for bitcoin-development@lists.sourceforge.net;
Sat, 09 May 2015 00:00:57 +0000
Received: by wgin8 with SMTP id n8so85245559wgi.0
for <bitcoin-development@lists.sourceforge.net>;
Fri, 08 May 2015 17:00:48 -0700 (PDT)
MIME-Version: 1.0
X-Received: by 10.180.74.208 with SMTP id w16mr949169wiv.31.1431129648370;
Fri, 08 May 2015 17:00:48 -0700 (PDT)
Received: by 10.28.144.68 with HTTP; Fri, 8 May 2015 17:00:48 -0700 (PDT)
In-Reply-To: <CAH+jCTwxjfEVog4JR+8kCvbBPoT50f322NV3T+8Bz-sTnK-yXQ@mail.gmail.com>
References: <mailman.63969.1431119326.18600.bitcoin-development@lists.sourceforge.net>
<CAH+jCTye9QNVV8bv6ZAgEPcrE5K1J-q7gONE_m1x81+-5mpWHA@mail.gmail.com>
<CAH+jCTwxjfEVog4JR+8kCvbBPoT50f322NV3T+8Bz-sTnK-yXQ@mail.gmail.com>
Date: Fri, 8 May 2015 17:00:48 -0700
Message-ID: <CAH+jCTy=BF4g=7yTFYind3ZNiWz4uLo1puv1+RURi=26oqcD1Q@mail.gmail.com>
From: Damian Gomez <dgomez1092@gmail.com>
To: bitcoin-development@lists.sourceforge.net
Content-Type: multipart/alternative; boundary=f46d0438921751992f05159ad62d
X-Spam-Score: -0.3 (/)
X-Spam-Report: Spam Filtering performed by mx.sourceforge.net.
See http://spamassassin.org/tag/ for more details.
-1.5 SPF_CHECK_PASS SPF reports sender host as permitted sender for
sender-domain
0.0 FREEMAIL_FROM Sender email is commonly abused enduser mail provider
(dgomez1092[at]gmail.com)
-0.0 SPF_PASS SPF: sender matches SPF record
0.2 FREEMAIL_ENVFROM_END_DIGIT Envelope-from freemail username ends in
digit (dgomez1092[at]gmail.com)
1.0 HTML_MESSAGE BODY: HTML included in message
-0.1 DKIM_VALID_AU Message has a valid DKIM or DK signature from
author's domain
0.1 DKIM_SIGNED Message has a DKIM or DK signature,
not necessarily valid
-0.1 DKIM_VALID Message has at least one valid DKIM or DK signature
X-Headers-End: 1YqsCM-0001tY-Es
Subject: Re: [Bitcoin-development] Bitcoin-development Digest, Vol 48,
Issue 41
X-BeenThere: bitcoin-development@lists.sourceforge.net
X-Mailman-Version: 2.1.9
Precedence: list
List-Id: <bitcoin-development.lists.sourceforge.net>
List-Unsubscribe: <https://lists.sourceforge.net/lists/listinfo/bitcoin-development>,
<mailto:bitcoin-development-request@lists.sourceforge.net?subject=unsubscribe>
List-Archive: <http://sourceforge.net/mailarchive/forum.php?forum_name=bitcoin-development>
List-Post: <mailto:bitcoin-development@lists.sourceforge.net>
List-Help: <mailto:bitcoin-development-request@lists.sourceforge.net?subject=help>
List-Subscribe: <https://lists.sourceforge.net/lists/listinfo/bitcoin-development>,
<mailto:bitcoin-development-request@lists.sourceforge.net?subject=subscribe>
X-List-Received-Date: Sat, 09 May 2015 00:00:58 -0000
--f46d0438921751992f05159ad62d
Content-Type: text/plain; charset=UTF-8
...of the following:
the DH_GENERATION would in effect calculate the reponses for a total
overage of the public component, by addding a ternary option in the actual
DH key (which I have attached to sse if you can iunderstand my logic)
For Java Practice this will be translated:
public static clientKey {
KeyPairGenerator cbArgs = notes sent(with a txn)/ log(w) -
log(w-1)/ log(w) + 1
cbArgs.ByteArrayStream.enqueue() ;
cbByte [] = Cipher.getIstance("AES", publicKey);
w = SUM(ModuleW([wi...,wn]))
Array<>byte.init(cbArgs);
BufferedOutputStream eclient = FileInputStream(add(cbByte));
}
public static Verify(String[] args) {
CipherCache clientSignature [cbByte];
Hash pubKey = Array<>pubKey;
ByteArray pubKeyHash [ serverArgsx...serverArgsn];
for clientSecurity.getIndex[xi] {pubKeyHash[xi] ;
int start = 0;
while (true) {
int index = str.indexOf(0);
if (xi = 0) {
pubKey.ByteArray(n) == clientTxns(xi, 0);
pubKey(n++) >> clientTxns.getIndex(xi++) - clientTxns.getIndex(xi - xin);
}
index++;
return beta = pubKey.Array.getIndex();
index l = 0;
l++;
for pubKey.Array() == index
{clientSignature pbg(w - 1) = (cbByte.getIndexOf(i); i++, i==l);
pba(x) = pbg - beta * y(x); } //y(x) instance of DH privkey ByteLength x
a public DHkey
Parser forSign = hashCode(bg, 0) >> return pubKey.length() ==
hashCode.length();
if pubKey.length() < beta {return false;}
else import FileInputStream(OP_MSG) //transfer to compiler code
Cipher OPMSG = cipher.init(AES)
{OPMSG.getInstance.ByteArrayLenght(OP_MSG, 1); for OPMSG.lenghth <= 0;
{forSign(getFront(OPMSG) - getEnd(OPMSG) == OPMSG.length) >>
B.getIndexOf(0) = { pubKey.getIndexOf(k) > 2^(w-b)=[bi...bn];}} //are
memory in Box cache of MsgTxns for blockchain merkel root}
if B[0] * pba >= beta return null;
else ModuleK[0] << K(x) = beta - 1 - (B[0] * pba(OPMSG) * pba(x));
{if K(x) = 6 = y return null; else return K(x).pushModule;}
}}}
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
#include <openssl/dh.h>
#include <openssl/bn.h>
#include <bu.c>
/* Read incoming call */
size_t fread(void *ptr, size_t size, size_t nmemb, FILE *callback) {
int main()
{
FILE *fp;
fp = fopen("bu.c", "eclient.c");
/* Seek to the beginning of the file */
fseek(fp, SEEK_SET, 0);
char to[];
char buffer[80];
/* Read and display data */
fread(buffer, strlen(to)+1, 1, fp);
printf("%s\n", buffer);
fclose(fp);
return(0);
}};
/* Generates its public and private keys*/
Typedef struct bn_st{
BIGNUM* BN_new();
BIGNUM* p{ // shared prime number
static inline int aac_valid_context(struct scsi_cmnd *scsicmd,
struct fib *fibptr) {
struct scsi_device *device;
if (unlikely(!scsicmd || !scsicmd->scsi_done)) {
dprintk((KERN_WARNING "aac_valid_context: scsi command
corrupt\n"));
aac_fib_complete(fibptr);
aac_fib_free(fibptr);
return 0;
} scsicmd->SCp.phase = AAC_OWNER_MIDLEVEL;
device = scsicmd->device;
if (unlikely(!device || !scsi_device_online(device))) {
dprintk((KERN_WARNING "aac_valid_context: scsi device
corrupt\n"));
aac_fib_complete(fibptr);
aac_fib_free(fibptr);
return 0;
}
return 1;
}
int aac_get_config_status(struct aac_dev *dev, int commit_flag)
{
int status = 0;
struct fib * fibptr;
if (!(fibptr = aac_fib_alloc(dev)))
return -ENOMEM;
else aac_fib_init(fibptr);
{
struct aac_get_config_status *dinfo;
dinfo = (struct aac_get_config_status *) fib_data(fibptr);
dinfo->command = cpu_to_le64(VM_ContainerConfig);
dinfo->type = cpu_to_le64(CT_GET_CONFIG_STATUS);
dinfo->count = cpu_to_le64(sizeof(((struct
aac_get_config_status_resp *)NULL)->data));
}
status = aac_fib_send(ContainerCommand,
fibptr,
sizeof (struct aac_get_config_status),
FsaNormal,
1, 1,
sizeof (struct aac_commit_config),
FsaNormal,
1, 1,
NULL, NULL);
if (status >= 0)
aac_fib_complete(fibptr);
} else if (aac_commit == 0) {
printk(KERN_WARNING
"aac_get_config_status: Others configurations
ignored\n");
}
}
if (status != -ERESTARTSYS)
aac_fib_free(fibptr);
return status;
}
};
BIGNUM* g{ // shared generator
int stdin;
int main() {
srand(time(NULL));
total << rand() %10 + 1 << endl;
return stdin};
};
BIGNUM* priv_key{// private parameter (DH value x)
x = BN_GENERATOR_KEY_2
};
BIGNUM* pub_key{ // public parameter (DH value g^x)
g^x = BN_GENERATOR_KEY_2 e DH_GENERATOR_KEY_5
};
// ohm
int BN_num_bytes(const BIGNUM* bn) {
void binary(int);
void main(void) {
int bn;
cout << 80;
cin >> BIGNUM;
if (cin < 0)
cout << "Errors.\n";
else {
cout << number << " converted to binary is: ";
binary(cin);
cout << endl;
}
}
void binary(int cin) {
int remainder;
if(cin <= 1) {
cout << cin;
return cout;
}
remainder = BIGNUM%2;
binary(BIGNUM >> 1);
cout << remainder;
}
};
void BN_free(BIGNUM* len) {
void reverse(len){
binary<len/10>::value << 1 | len % 10;
int len;
if (len <= 80){
return 80 -- len
}
else (len > 80) {
return len - 80
}
}
};
int BN_bn2bin(const BIGNUM* bn, unsigned char* to);
BIGNUM* BN_bin2bn(const unsigned char* s, int len,
BIGNUM* ret);
}DH;
int DH_compute_key(unsigned char* key, BIGNUM* callback,
DH* dh) {
if key != callback
return NULL`
else return p_privkey << dh
};
/* Exchanges dh->pub_key with the server*/
int efx_nic_alloc_buffer(struct efx_nic *BIGNUM, struct efx_buffer *buffer,
unsigned int len, gfp_t gfp_flags)
{
buffer->addr = dma_zalloc_coherent(&efx->pci_dev->dev, len,
&buffer->dma_addr, gfp_flags);
if (!buffer->addr)
return -ENOMEM;
return kvm_alloc;
};
struct kvm_alloc(*KVM_CPUID_SIGNATURE<> VICI* bn kvm_vcpu *virt)
{KVM_CPUID_SIGNATURE= signature[10]};
};
where w represents the weight of the total number of semantical
constraints that an idivdual has expressed throught emotivoe packets that I
am working on (implementation os difficutlt). I think this is the
appropriate route to implemeting a greating block size that will be used in
preventing interception of bundled informations and replace value. Client
side implmentation will cut down transaction fees for the additional 264
bit implementation and greatly reduce need for ewallet providers to do so.
(mr patrick mccorry its the tab functionality in my keyboard during my
formatiing )
On Fri, May 8, 2015 at 3:12 PM, Damian Gomez <dgomez1092@gmail.com> wrote:
> let me continue my conversation:
>
> as the development of this transactions would be indiscated
>
> as a ByteArray of
>
>
> On Fri, May 8, 2015 at 3:11 PM, Damian Gomez <dgomez1092@gmail.com> wrote:
>
>>
>> Well zombie txns aside, I expect this to be resolved w/ a client side
>> implementation using a Merkle-Winternitz OTS in order to prevent the loss
>> of fee structure theougth the implementation of a this security hash that
>> eill alloow for a one-wya transaction to conitnue, according to the TESLA
>> protocol.
>>
>> We can then tally what is needed to compute tteh number of bit desginated
>> for teh completion og the client-side signature if discussin the
>> construcitons of a a DH key (instead of the BIP X509 protocol)
>>
>>
>>
>>
>>
>> On Fri, May 8, 2015 at 2:08 PM, <
>> bitcoin-development-request@lists.sourceforge.net> wrote:
>>
>>> Send Bitcoin-development mailing list submissions to
>>> bitcoin-development@lists.sourceforge.net
>>>
>>> To subscribe or unsubscribe via the World Wide Web, visit
>>> https://lists.sourceforge.net/lists/listinfo/bitcoin-development
>>> or, via email, send a message with subject or body 'help' to
>>> bitcoin-development-request@lists.sourceforge.net
>>>
>>> You can reach the person managing the list at
>>> bitcoin-development-owner@lists.sourceforge.net
>>>
>>> When replying, please edit your Subject line so it is more specific
>>> than "Re: Contents of Bitcoin-development digest..."
>>>
>>> Today's Topics:
>>>
>>> 1. Re: Block Size Increase (Mark Friedenbach)
>>> 2. Softfork signaling improvements (Douglas Roark)
>>> 3. Re: Block Size Increase (Mark Friedenbach)
>>> 4. Re: Block Size Increase (Raystonn) (Damian Gomez)
>>> 5. Re: Block Size Increase (Raystonn)
>>>
>>>
>>> ---------- Forwarded message ----------
>>> From: Mark Friedenbach <mark@friedenbach.org>
>>> To: Raystonn <raystonn@hotmail.com>
>>> Cc: Bitcoin Development <bitcoin-development@lists.sourceforge.net>
>>> Date: Fri, 8 May 2015 13:55:30 -0700
>>> Subject: Re: [Bitcoin-development] Block Size Increase
>>> The problems with that are larger than time being unreliable. It is no
>>> longer reorg-safe as transactions can expire in the course of a reorg and
>>> any transaction built on the now expired transaction is invalidated.
>>>
>>> On Fri, May 8, 2015 at 1:51 PM, Raystonn <raystonn@hotmail.com> wrote:
>>>
>>>> Replace by fee is what I was referencing. End-users interpret the old
>>>> transaction as expired. Hence the nomenclature. An alternative is a new
>>>> feature that operates in the reverse of time lock, expiring a transaction
>>>> after a specific time. But time is a bit unreliable in the blockchain
>>>>
>>>
>>>
>>> ---------- Forwarded message ----------
>>> From: Douglas Roark <doug@bitcoinarmory.com>
>>> To: Bitcoin Dev <bitcoin-development@lists.sourceforge.net>
>>> Cc:
>>> Date: Fri, 8 May 2015 15:27:26 -0400
>>> Subject: [Bitcoin-development] Softfork signaling improvements
>>> -----BEGIN PGP SIGNED MESSAGE-----
>>> Hash: SHA512
>>>
>>> Hello. I've seen Greg make a couple of posts online
>>> (https://bitcointalk.org/index.php?topic=1033396.msg11155302#msg11155302
>>> is one such example) where he has mentioned that Pieter has a new
>>> proposal for allowing multiple softforks to be deployed at the same
>>> time. As discussed in the thread I linked, the idea seems simple
>>> enough. Still, I'm curious if the actual proposal has been posted
>>> anywhere. I spent a few minutes searching the usual suspects (this
>>> mailing list, Reddit, Bitcointalk, IRC logs, BIPs) and can't find
>>> anything.
>>>
>>> Thanks.
>>>
>>> - ---
>>> Douglas Roark
>>> Senior Developer
>>> Armory Technologies, Inc.
>>> doug@bitcoinarmory.com
>>> PGP key ID: 92ADC0D7
>>> -----BEGIN PGP SIGNATURE-----
>>> Version: GnuPG/MacGPG2 v2.0.22 (Darwin)
>>> Comment: GPGTools - https://gpgtools.org
>>>
>>> iQIcBAEBCgAGBQJVTQ4eAAoJEGybVGGSrcDX8eMQAOQiDA7an+qZBqDfVIwEzY2C
>>> SxOVxswwxAyTtZNM/Nm+8MTq77hF8+3j/C3bUbDW6wCu4QxBYA/uiCGTf44dj6WX
>>> 7aiXg1o9C4LfPcuUngcMI0H5ixOUxnbqUdmpNdoIvy4did2dVs9fAmOPEoSVUm72
>>> 6dMLGrtlPN0jcLX6pJd12Dy3laKxd0AP72wi6SivH6i8v8rLb940EuBS3hIkuZG0
>>> vnR5MXMIEd0rkWesr8hn6oTs/k8t4zgts7cgIrA7rU3wJq0qaHBa8uASUxwHKDjD
>>> KmDwaigvOGN6XqitqokCUlqjoxvwpimCjb3Uv5Pkxn8+dwue9F/IggRXUSuifJRn
>>> UEZT2F8fwhiluldz3sRaNtLOpCoKfPC+YYv7kvGySgqagtNJFHoFhbeQM0S3yjRn
>>> Ceh1xK9sOjrxw/my0jwpjJkqlhvQtVG15OsNWDzZ+eWa56kghnSgLkFO+T4G6IxB
>>> EUOcAYjJkLbg5ssjgyhvDOvGqft+2e4MNlB01e1ZQr4whQH4TdRkd66A4WDNB+0g
>>> LBqVhAc2C8L3g046mhZmC33SuOSxxm8shlxZvYLHU2HrnUFg9NkkXi1Ub7agMSck
>>> TTkLbMx17AvOXkKH0v1L20kWoWAp9LfRGdD+qnY8svJkaUuVtgDurpcwEk40WwEZ
>>> caYBw+8bdLpKZwqbA1DL
>>> =ayhE
>>> -----END PGP SIGNATURE-----
>>>
>>>
>>>
>>>
>>> ---------- Forwarded message ----------
>>> From: Mark Friedenbach <mark@friedenbach.org>
>>> To: "Raystonn ." <raystonn@hotmail.com>
>>> Cc: Bitcoin Development <bitcoin-development@lists.sourceforge.net>
>>> Date: Fri, 8 May 2015 13:40:50 -0700
>>> Subject: Re: [Bitcoin-development] Block Size Increase
>>> Transactions don't expire. But if the wallet is online, it can
>>> periodically choose to release an already created transaction with a higher
>>> fee. This requires replace-by-fee to be sufficiently deployed, however.
>>>
>>> On Fri, May 8, 2015 at 1:38 PM, Raystonn . <raystonn@hotmail.com> wrote:
>>>
>>>> I have a proposal for wallets such as yours. How about creating all
>>>> transactions with an expiration time starting with a low fee, then
>>>> replacing with new transactions that have a higher fee as time passes.
>>>> Users can pick the fee curve they desire based on the transaction priority
>>>> they want to advertise to the network. Users set the priority in the
>>>> wallet, and the wallet software translates it to a specific fee curve used
>>>> in the series of expiring transactions. In this manner, transactions are
>>>> never left hanging for days, and probably not even for hours.
>>>>
>>>> -Raystonn
>>>> On 8 May 2015 1:17 pm, Aaron Voisine <voisine@gmail.com> wrote:
>>>>
>>>> As the author of a popular SPV wallet, I wanted to weigh in, in support
>>>> of the Gavin's 20Mb block proposal.
>>>>
>>>> The best argument I've heard against raising the limit is that we need
>>>> fee pressure. I agree that fee pressure is the right way to economize on
>>>> scarce resources. Placing hard limits on block size however is an
>>>> incredibly disruptive way to go about this, and will severely negatively
>>>> impact users' experience.
>>>>
>>>> When users pay too low a fee, they should:
>>>>
>>>> 1) See immediate failure as they do now with fees that fail to
>>>> propagate.
>>>>
>>>> 2) If the fee lower than it should be but not terminal, they should see
>>>> degraded performance, long delays in confirmation, but eventual success.
>>>> This will encourage them to pay higher fees in future.
>>>>
>>>> The worst of all worlds would be to have transactions propagate, hang
>>>> in limbo for days, and then fail. This is the most important scenario to
>>>> avoid. Increasing the 1Mb block size limit I think is the simplest way to
>>>> avoid this least desirable scenario for the immediate future.
>>>>
>>>> We can play around with improved transaction selection for blocks and
>>>> encourage miners to adopt it to discourage low fees and create fee
>>>> pressure. These could involve hybrid priority/fee selection so low fee
>>>> transactions see degraded performance instead of failure. This would be the
>>>> conservative low risk approach.
>>>>
>>>> Aaron Voisine
>>>> co-founder and CEO
>>>> breadwallet.com
>>>>
>>>>
>>>>
>>>> ------------------------------------------------------------------------------
>>>> One dashboard for servers and applications across Physical-Virtual-Cloud
>>>> Widest out-of-the-box monitoring support with 50+ applications
>>>> Performance metrics, stats and reports that give you Actionable Insights
>>>> Deep dive visibility with transaction tracing using APM Insight.
>>>> http://ad.doubleclick.net/ddm/clk/290420510;117567292;y
>>>> _______________________________________________
>>>> Bitcoin-development mailing list
>>>> Bitcoin-development@lists.sourceforge.net
>>>> https://lists.sourceforge.net/lists/listinfo/bitcoin-development
>>>>
>>>>
>>>
>>>
>>> ---------- Forwarded message ----------
>>> From: Damian Gomez <dgomez1092@gmail.com>
>>> To: bitcoin-development@lists.sourceforge.net
>>> Cc:
>>> Date: Fri, 8 May 2015 14:04:10 -0700
>>> Subject: Re: [Bitcoin-development] Block Size Increase (Raystonn)
>>> Hello,
>>>
>>> I was reading some of the thread but can't say I read the entire thing.
>>>
>>> I think that it is realistic to cinsider a nlock sixe of 20MB for any
>>> block txn to occur. THis is an enormous amount of data (relatively for a
>>> netwkrk) in which the avergage rate of 10tps over 10 miniutes would allow
>>> for fewasible transformation of data at this curent point in time.
>>>
>>> Though I do not see what extra hash information would be stored in the
>>> overall ecosystem as we begin to describe what the scripts that are
>>> atacrhed tp the blockchain would carry,
>>>
>>> I'd therefore think that for the remainder of this year that it is
>>> possible to have a block chain within 200 - 300 bytes that is more
>>> charatereistic of some feasible attempts at attaching nuanced data in order
>>> to keep propliifc the blockchain but have these identifiers be integral
>>> OPSIg of the the entiore block. THe reasoning behind this has to do with
>>> encryption standards that can be added toe a chain such as th DH algoritnm
>>> keys that would allow for a higher integrity level withinin the system as
>>> it is. Cutrent;y tyh prootocl oomnly controls for the amount of
>>> transactions through if TxnOut script and the publin key coming form teh
>>> lcoation of the proof-of-work. Form this then I think that a rate of higher
>>> than then current standard of 92bytes allows for GPUS ie CUDA to perfirm
>>> its standard operations of 1216 flops in rde rto mechanize a new
>>> personal identity within the chain that also attaches an encrypted instance
>>> of a further categorical variable that we can prsribved to it.
>>>
>>> I think with the current BIP7 prootclol for transactions there is an
>>> area of vulnerability for man-in-the-middle attacks upon request of bitcin
>>> to any merchant as is. It would contraidct the security of the bitcoin if
>>> it was intereceptefd iand not allowed to reach tthe payment network or if
>>> the hash was reveresed in orfr to change the value it had. Therefore the
>>> current best fit block size today is between 200 - 300 bytws (depending on
>>> how exciteed we get)
>>>
>>>
>>>
>>> Thanks for letting me join the conversation
>>> I welcomes any vhalleneged and will reply with more research as i figure
>>> out what problems are revealed in my current formation of thoughts (sorry
>>> for the errors but i am just trying to move forward ---> THE DELRERT KEY
>>> LITERALLY PREVENTS IT )
>>>
>>>
>>> _Damian
>>>
>>>
>>> ---------- Forwarded message ----------
>>> From: Raystonn <raystonn@hotmail.com>
>>> To: Mark Friedenbach <mark@friedenbach.org>
>>> Cc: Bitcoin Development <bitcoin-development@lists.sourceforge.net>
>>> Date: Fri, 8 May 2015 14:01:28 -0700
>>> Subject: Re: [Bitcoin-development] Block Size Increase
>>>
>>> Replace by fee is the better approach. It will ultimately replace
>>> zombie transactions (due to insufficient fee) with potentially much higher
>>> fees as the feature takes hold in wallets throughout the network, and fee
>>> competition increases. However, this does not fix the problem of low tps.
>>> In fact, as blocks fill it could make the problem worse. This feature
>>> means more transactions after all. So I would expect huge fee spikes, or a
>>> return to zombie transactions if fee caps are implemented by wallets.
>>>
>>> -Raystonn
>>> On 8 May 2015 1:55 pm, Mark Friedenbach <mark@friedenbach.org> wrote:
>>>
>>> The problems with that are larger than time being unreliable. It is no
>>> longer reorg-safe as transactions can expire in the course of a reorg and
>>> any transaction built on the now expired transaction is invalidated.
>>>
>>> On Fri, May 8, 2015 at 1:51 PM, Raystonn <raystonn@hotmail.com> wrote:
>>>
>>> Replace by fee is what I was referencing. End-users interpret the old
>>> transaction as expired. Hence the nomenclature. An alternative is a new
>>> feature that operates in the reverse of time lock, expiring a transaction
>>> after a specific time. But time is a bit unreliable in the blockchain
>>>
>>>
>>>
>>> ------------------------------------------------------------------------------
>>> One dashboard for servers and applications across Physical-Virtual-Cloud
>>> Widest out-of-the-box monitoring support with 50+ applications
>>> Performance metrics, stats and reports that give you Actionable Insights
>>> Deep dive visibility with transaction tracing using APM Insight.
>>> http://ad.doubleclick.net/ddm/clk/290420510;117567292;y
>>> _______________________________________________
>>> Bitcoin-development mailing list
>>> Bitcoin-development@lists.sourceforge.net
>>> https://lists.sourceforge.net/lists/listinfo/bitcoin-development
>>>
>>>
>>
>
--f46d0438921751992f05159ad62d
Content-Type: text/html; charset=UTF-8
Content-Transfer-Encoding: quoted-printable
<div dir=3D"ltr"><div><br></div><div>...of the following:=C2=A0</div><div><=
br></div><div>=C2=A0the DH_GENERATION would in effect calculate the reponse=
s for a total overage of the public component, by addding a ternary option =
in the actual DH key (which I have attached to sse if you can iunderstand m=
y logic)</div><div><br></div><div><br></div><div><br></div><div>For Java Pr=
actice this will be translated:=C2=A0</div><div><br></div><div><br></div><d=
iv><div>=C2=A0public static clientKey {</div><div>=C2=A0 =C2=A0</div><div>=
=C2=A0 =C2=A0 =C2=A0 =C2=A0 KeyPairGenerator cbArgs =3D =C2=A0 =C2=A0notes =
sent(with a txn)/ log(w) - log(w-1)/ log(w) =C2=A0+ 1 =C2=A0</div><div>=C2=
=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 cbArgs.ByteArrayStream.enqueu=
e() ;=C2=A0</div><div>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 cbBy=
te [] =C2=A0=3D Cipher.getIstance("AES", publicKey);=C2=A0</div><=
div><span class=3D"" style=3D"white-space:pre"> </span>w =3D SUM(ModuleW([=
wi...,wn]))</div><div>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 Arra=
y<>byte.init(cbArgs);</div><div>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =
=C2=A0 =C2=A0=C2=A0</div><div>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0=C2=A0</div=
><div>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0BufferedOutputStream eclient=
=3D =C2=A0FileInputStream(add(cbByte));</div><div>=C2=A0 =C2=A0} =C2=A0 =
=C2=A0 =C2=A0 =C2=A0=C2=A0</div><div>=C2=A0 public static Verify(String[] a=
rgs) {</div><div><br></div><div>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 CipherCa=
che clientSignature =C2=A0[cbByte];</div><div><span class=3D"" style=3D"whi=
te-space:pre"> </span>Hash pubKey =3D Array<>pubKey;</div><div><span=
class=3D"" style=3D"white-space:pre"> </span>ByteArray =C2=A0pubKeyHash [ =
serverArgsx...serverArgsn];</div><div><span class=3D"" style=3D"white-space=
:pre"> </span></div><div>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 for =C2=A0 clie=
ntSecurity.getIndex[xi] {pubKeyHash[xi] ;</div><div>=C2=A0 =C2=A0 =C2=A0 =
=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0int start =3D 0;</div><div>=C2=A0 <span c=
lass=3D"" style=3D"white-space:pre"> </span>while (true) {</div><div>=C2=A0=
=C2=A0 <span class=3D"" style=3D"white-space:pre"> </span>int index =3D s=
tr.indexOf(0);</div><div>=C2=A0 =C2=A0<span class=3D"" style=3D"white-space=
:pre"> </span> if (xi =3D 0) {</div><div><span class=3D"" style=3D"white-sp=
ace:pre"> </span>pubKey.ByteArray(n) =3D=3D clientTxns(xi, 0);</div><div><=
span class=3D"" style=3D"white-space:pre"> </span> pubKey(n++) >> cl=
ientTxns.getIndex(xi++) - clientTxns.getIndex(xi - xin); =C2=A0 <span class=
=3D"" style=3D"white-space:pre"> </span></div><div>=C2=A0 =C2=A0 <span cla=
ss=3D"" style=3D"white-space:pre"> </span>}</div><div><span class=3D"" styl=
e=3D"white-space:pre"> </span>index++;</div><div>=C2=A0 =C2=A0 <span class=
=3D"" style=3D"white-space:pre"> </span>return beta =3D pubKey.Array.getInd=
ex();</div><div><span class=3D"" style=3D"white-space:pre"> </span></div><d=
iv><span class=3D"" style=3D"white-space:pre"> </span>index l =3D 0;</div><=
div><span class=3D"" style=3D"white-space:pre"> </span>l++;</div><div><span=
class=3D"" style=3D"white-space:pre"> </span>for pubKey.Array() =3D=3D ind=
ex</div><div><span class=3D"" style=3D"white-space:pre"> </span>{clientSig=
nature pbg(w - 1) =3D (cbByte.getIndexOf(i); i++, i=3D=3Dl);</div><div><spa=
n class=3D"" style=3D"white-space:pre"> </span> =C2=A0 pba(x) =3D pbg - be=
ta * y(x); } //y(x) instance of DH privkey ByteLength x a public DHkey</div=
><div><span class=3D"" style=3D"white-space:pre"> </span>Parser forSign =3D=
hashCode(bg, 0) >> return pubKey.length() =3D=3D =C2=A0hashCode.leng=
th();=C2=A0</div><div><span class=3D"" style=3D"white-space:pre"> </span> =
=C2=A0 if pubKey.length() < beta {return false;}</div><div><span class=
=3D"" style=3D"white-space:pre"> </span>else import FileInputStream(OP_MSG=
) //transfer to compiler code</div><div><span class=3D"" style=3D"white-spa=
ce:pre"> </span>Cipher OPMSG =3D cipher.init(AES)</div><div><span class=
=3D"" style=3D"white-space:pre"> </span>{OPMSG.getInstance.ByteArrayLengh=
t(OP_MSG, 1); for OPMSG.lenghth <=3D 0;</div><div><span class=3D"" style=
=3D"white-space:pre"> </span>{forSign(getFront(OPMSG) - getEnd(OPMSG) =
=3D=3D OPMSG.length) >> B.getIndexOf(0) =3D { pubKey.getIndexOf(k) &g=
t; 2^(w-b)=3D[bi...bn];}} //are memory in Box cache of MsgTxns for blockcha=
in merkel root}</div><div><br></div><div><span class=3D"" style=3D"white-sp=
ace:pre"> </span>if B[0] * pba >=3D beta return null;=C2=A0</div><div><s=
pan class=3D"" style=3D"white-space:pre"> </span>else ModuleK[0] << =
K(x) =3D beta - 1 - (B[0] * pba(OPMSG) * pba(x));</div><div><span class=3D"=
" style=3D"white-space:pre"> </span>{if K(x) =3D 6 =3D y return null; els=
e return K(x).pushModule;}</div><div><br></div><div>}}}</div></div><div><br=
></div><div>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0</div><div>=C2=
=A0 =C2=A0</div><div><div>+++++++++++++++++++++++++++++++++++++++++++++++++=
+++++++++++++++++++++++++++++++++</div><div><br></div><div><br></div><div>#=
include <openssl/dh.h></div><div>#include <openssl/bn.h></div><=
div>#include <bu.c></div><div><br></div><div><br></div><div>/* Read i=
ncoming call */=C2=A0</div><div><br></div><div>size_t fread(void *ptr, size=
_t size, size_t nmemb, FILE *callback) {</div><div><span class=3D"" style=
=3D"white-space:pre"> </span>int main()</div><div>{</div><div>=C2=A0 =C2=A0=
FILE *fp;</div><div>=C2=A0 =C2=A0fp =3D fopen("bu.c", "eclie=
nt.c");</div><div>=C2=A0 =C2=A0/* Seek to the beginning of the file */=
</div><div>=C2=A0 =C2=A0fseek(fp, SEEK_SET, 0);</div><div>=C2=A0 =C2=A0char=
to[];</div><div>=C2=A0 =C2=A0char buffer[80];</div><div>=C2=A0 =C2=A0/* Re=
ad and display data */</div><div>=C2=A0 =C2=A0fread(buffer, strlen(to)+1, 1=
, fp);</div><div>=C2=A0 =C2=A0printf("%s\n", buffer);</div><div>=
=C2=A0 =C2=A0fclose(fp);</div><div>=C2=A0 =C2=A0</div><div>=C2=A0 =C2=A0ret=
urn(0);</div><div>}};</div><div><br></div><div>/* Generates its public and =
private keys*/=C2=A0</div><div>Typedef struct bn_st{</div><div><span class=
=3D"" style=3D"white-space:pre"> </span>BIGNUM* BN_new();</div><div><span c=
lass=3D"" style=3D"white-space:pre"> </span>BIGNUM* p{ =C2=A0// shared prim=
e number</div><div><span class=3D"" style=3D"white-space:pre"> </span> sta=
tic inline int aac_valid_context(struct scsi_cmnd *scsicmd,</div><div>=C2=
=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0struct fib *fibp=
tr) {</div><div>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0struct scsi_device *devic=
e;</div><div>=C2=A0</div><div>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0if (unlikel=
y(!scsicmd || !scsicmd->scsi_done)) {</div><div>=C2=A0 =C2=A0 =C2=A0 =C2=
=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0dprintk((KERN_WARNING "aac_valid=
_context: scsi command corrupt\n"));</div><div>=C2=A0 =C2=A0 =C2=A0 =
=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0aac_fib_complete(fibptr);</div><di=
v>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0aac_fib_fre=
e(fibptr);</div><div>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=
=A0 =C2=A0return 0;</div><div>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0} =C2=A0 =
=C2=A0 =C2=A0 =C2=A0 scsicmd->SCp.phase =3D AAC_OWNER_MIDLEVEL;</div><di=
v>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0device =3D scsicmd->device;</div><di=
v>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0if (unlikely(!device || !scsi_device_on=
line(device))) {</div><div>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0=
=C2=A0 =C2=A0dprintk((KERN_WARNING "aac_valid_context: scsi device co=
rrupt\n"));</div><div>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0=
=C2=A0 =C2=A0aac_fib_complete(fibptr);</div><div>=C2=A0 =C2=A0 =C2=A0 =C2=
=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0aac_fib_free(fibptr);</div><div>=C2=
=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0return 0;</div><=
div>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0}</div><div>=C2=A0 =C2=A0 =C2=A0 =C2=
=A0 =C2=A0return 1;</div><div><span class=3D"" style=3D"white-space:pre"> <=
/span> }</div><div>=C2=A0</div><div><span class=3D"" style=3D"white-space:p=
re"> </span> int aac_get_config_status(struct aac_dev *dev, int commit_flag=
)</div><div><span class=3D"" style=3D"white-space:pre"> </span> {</div><div=
>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0int status =3D 0;</div><div>=C2=A0 =C2=
=A0 =C2=A0 =C2=A0 =C2=A0struct fib * fibptr;</div><div>=C2=A0</div><div>=C2=
=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0if (!(fibptr =3D aac_fib_alloc(dev)))</div><=
div>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0return -E=
NOMEM;</div><div>=C2=A0</div><div>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0else aa=
c_fib_init(fibptr);</div><div>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0{</div><div=
>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0struct aac_g=
et_config_status *dinfo;</div><div>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=
=A0 =C2=A0 =C2=A0 =C2=A0dinfo =3D (struct aac_get_config_status *) fib_data=
(fibptr);</div><div>=C2=A0</div><div>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=
=A0 =C2=A0 =C2=A0 =C2=A0dinfo->command =3D cpu_to_le64(VM_ContainerConfi=
g);</div><div>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=
=A0dinfo->type =3D cpu_to_le64(CT_GET_CONFIG_STATUS);</div><div>=C2=A0 =
=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0dinfo->count =3D =
cpu_to_le64(sizeof(((struct aac_get_config_status_resp *)NULL)->data));<=
/div><div>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0}</div><div>=C2=A0</div><div>=
=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0status =3D aac_fib_send(ContainerCommand,=
</div><div>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =
=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0fibptr,</div><div>=C2=A0 =C2=A0 =
=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=
=A0 =C2=A0 =C2=A0sizeof (struct aac_get_config_status),</div><div>=C2=A0 =
=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=
=A0 =C2=A0 =C2=A0 =C2=A0FsaNormal,</div><div>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =
=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=
=A01, 1,</div><div>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =
=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0sizeof (struc=
t aac_commit_config),</div><div>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =
=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=
=A0 =C2=A0 =C2=A0FsaNormal,</div><div>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =
=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=
=A0 =C2=A0 =C2=A0 =C2=A01, 1,</div><div>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =
=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=
=A0 =C2=A0 =C2=A0 =C2=A0NULL, NULL);</div><div>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =
=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 if (status >=3D 0)</div><div>=C2=A0 =
=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=
=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0aac_fib_complete(fibptr);</div><div>=
=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0} else if (aa=
c_commit =3D=3D 0) {</div><div>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =
=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0printk(KERN_WARNING</div><d=
iv>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =
=C2=A0 =C2=A0 =C2=A0 =C2=A0"aac_get_config_status: Others configuratio=
ns ignored\n");</div><div>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =
=C2=A0 =C2=A0 =C2=A0}</div><div>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0}</div><d=
iv>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 if (status !=3D -ERESTA=
RTSYS)</div><div>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =
=C2=A0aac_fib_free(fibptr);</div><div>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0ret=
urn status;</div><div>=C2=A0}</div><div>=C2=A0<span class=3D"" style=3D"whi=
te-space:pre"> </span></div><div><span class=3D"" style=3D"white-space:pre=
"> </span>};<span class=3D"" style=3D"white-space:pre"> </span></div><div>=
<span class=3D"" style=3D"white-space:pre"> </span>BIGNUM* g{ =C2=A0// shar=
ed generator</div><div><span class=3D"" style=3D"white-space:pre"> </span>=
int stdin;</div><div><span class=3D"" style=3D"white-space:pre"> </span>in=
t main() {</div><div><span class=3D"" style=3D"white-space:pre"> </span> =
=C2=A0 =C2=A0srand(time(NULL));</div><div><span class=3D"" style=3D"white-s=
pace:pre"> </span> =C2=A0 =C2=A0 total << rand() %10 + 1 << en=
dl;=C2=A0</div><div><span class=3D"" style=3D"white-space:pre"> </span>re=
turn stdin};</div><div>};<span class=3D"" style=3D"white-space:pre"> </span=
></div><div><span class=3D"" style=3D"white-space:pre"> </span>BIGNUM* priv=
_key{// private parameter (DH value x)</div><div><span class=3D"" style=3D"=
white-space:pre"> </span>x =3D BN_GENERATOR_KEY_2</div><div><span class=3D=
"" style=3D"white-space:pre"> </span></div><div><span class=3D"" style=3D"=
white-space:pre"> </span>}; <span class=3D"" style=3D"white-space:pre"> </s=
pan></div><div><span class=3D"" style=3D"white-space:pre"> </span>BIGNUM* p=
ub_key{ // public parameter (DH value g^x)</div><div><span class=3D"" style=
=3D"white-space:pre"> </span>g^x =3D BN_GENERATOR_KEY_2 e DH_GENERATOR_KEY=
_5</div><div><br></div><div><span class=3D"" style=3D"white-space:pre"> </s=
pan>};=C2=A0</div><div><span class=3D"" style=3D"white-space:pre"> </span>/=
/ ohm</div><div><span class=3D"" style=3D"white-space:pre"> </span>int BN_n=
um_bytes(const BIGNUM* bn) {</div><div><span class=3D"" style=3D"white-spac=
e:pre"> </span>void binary(int);</div><div><span class=3D"" style=3D"white=
-space:pre"> </span>void main(void) {</div><div><span class=3D"" style=3D"=
white-space:pre"> </span>int bn;</div><div><span class=3D"" style=3D"white=
-space:pre"> </span>cout << 80;</div><div><span class=3D"" style=3D"=
white-space:pre"> </span>cin >> BIGNUM;</div><div><span class=3D"" s=
tyle=3D"white-space:pre"> </span>if (cin < 0)=C2=A0</div><div><span cla=
ss=3D"" style=3D"white-space:pre"> </span>cout << "Errors.\n&qu=
ot;;</div><div><span class=3D"" style=3D"white-space:pre"> </span>else {</=
div><div><span class=3D"" style=3D"white-space:pre"> </span>cout << =
number << " converted to binary is: ";</div><div><span clas=
s=3D"" style=3D"white-space:pre"> </span>binary(cin);</div><div><span clas=
s=3D"" style=3D"white-space:pre"> </span>cout << endl;</div><div><sp=
an class=3D"" style=3D"white-space:pre"> </span>}</div><div><span class=3D=
"" style=3D"white-space:pre"> </span>}</div><div><br></div><div><span clas=
s=3D"" style=3D"white-space:pre"> </span>void binary(int cin) {</div><div>=
<span class=3D"" style=3D"white-space:pre"> </span>int remainder;</div><di=
v><br></div><div><span class=3D"" style=3D"white-space:pre"> </span>if(cin=
<=3D 1) {</div><div><span class=3D"" style=3D"white-space:pre"> </span=
>cout << cin;</div><div><span class=3D"" style=3D"white-space:pre"> =
</span>return cout;</div><div><span class=3D"" style=3D"white-space:pre"> =
</span>}</div><div><br></div><div><span class=3D"" style=3D"white-space:pre=
"> </span>remainder =3D BIGNUM%2;</div><div><span class=3D"" style=3D"whit=
e-space:pre"> </span>binary(BIGNUM >> 1); =C2=A0 =C2=A0</div><div><s=
pan class=3D"" style=3D"white-space:pre"> </span>cout << remainder;<=
/div><div><span class=3D"" style=3D"white-space:pre"> </span>}</div><div>}=
;</div><div><span class=3D"" style=3D"white-space:pre"> </span></div><div><=
span class=3D"" style=3D"white-space:pre"> </span>void BN_free(BIGNUM* len)=
{</div><div><span class=3D"" style=3D"white-space:pre"> </span> =C2=A0voi=
d reverse(len){</div><div><span class=3D"" style=3D"white-space:pre"> </s=
pan>binary<len/10>::value << 1 | len % 10;</div><div><span clas=
s=3D"" style=3D"white-space:pre"> </span>int len;</div><div><span class=
=3D"" style=3D"white-space:pre"> </span>if (len <=3D 80){</div><div><s=
pan class=3D"" style=3D"white-space:pre"> </span>return 80 -- len</div><=
div><span class=3D"" style=3D"white-space:pre"> </span>}</div><div><span =
class=3D"" style=3D"white-space:pre"> </span>else (len > 80) {</div><d=
iv><span class=3D"" style=3D"white-space:pre"> </span>return len - 80=C2=
=A0</div><div><span class=3D"" style=3D"white-space:pre"> </span>}</div><=
div><span class=3D"" style=3D"white-space:pre"> </span>}</div><div>};</div=
><div><span class=3D"" style=3D"white-space:pre"> </span>int BN_bn2bin(cons=
t BIGNUM* bn, unsigned char* to);</div><div><span class=3D"" style=3D"white=
-space:pre"> </span>BIGNUM* BN_bin2bn(const unsigned char* s, int len,</div=
><div>BIGNUM* ret);</div><div>}DH;</div><div><br></div><div><br></div><div>=
int DH_compute_key(unsigned char* key, BIGNUM* callback,</div><div>DH* dh) =
{</div><div><span class=3D"" style=3D"white-space:pre"> </span>if key !=3D =
callback</div><div><span class=3D"" style=3D"white-space:pre"> </span>retu=
rn NULL`</div><div><span class=3D"" style=3D"white-space:pre"> </span>else =
return p_privkey << dh =C2=A0</div><div>};</div><div>=C2=A0</div><div=
><br></div><div>=C2=A0</div><div>/* Exchanges dh->pub_key with the serve=
r*/</div><div><span class=3D"" style=3D"white-space:pre"> </span>int efx_ni=
c_alloc_buffer(struct efx_nic *BIGNUM, struct efx_buffer *buffer,</div><div=
>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=
=A0 =C2=A0 =C2=A0 unsigned int len, gfp_t gfp_flags)</div><div>=C2=A0{</div=
><div>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0buffer->addr =3D dma_zalloc_cohe=
rent(&efx->pci_dev->dev, len,</div><div>=C2=A0 =C2=A0 =C2=A0 =C2=
=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =
=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 &buffer->dma=
_addr, gfp_flags);</div><div>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0if (!buffer-=
>addr)</div><div>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0=
=C2=A0return -ENOMEM;</div><div><span class=3D"" style=3D"white-space:pre"=
> </span></div><div>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0=
return kvm_alloc;</div><div>=C2=A0};</div><div><span class=3D"" style=3D"w=
hite-space:pre"> </span>struct kvm_alloc(*KVM_CPUID_SIGNATURE<> VICI*=
bn kvm_vcpu *virt)=C2=A0</div><div><span class=3D"" style=3D"white-space:p=
re"> </span> {KVM_CPUID_SIGNATURE=3D signature[10]};</div><div>};=C2=A0</di=
v><div>=C2=A0=C2=A0</div><div><br></div><div><br></div><div><br></div><div>=
<br></div><div><br></div></div><div>=C2=A0 where w represents the weight of=
the total number of semantical constraints that an idivdual has expressed =
throught emotivoe packets that I am working on (implementation os difficutl=
t).=C2=A0 I think this is the appropriate route to implemeting a greating b=
lock size that will be used in preventing interception of bundled informati=
ons and replace value.=C2=A0 Client side implmentation will cut down transa=
ction fees for the additional 264 bit implementation and greatly reduce nee=
d for ewallet providers to do so.=C2=A0</div><div><br></div><div><br></div>=
<div><br></div><div><br></div><div><br></div><div>(mr patrick mccorry its t=
he tab functionality in my keyboard during my formatiing )</div><div><br></=
div><div><br></div></div><div class=3D"gmail_extra"><br><div class=3D"gmail=
_quote">On Fri, May 8, 2015 at 3:12 PM, Damian Gomez <span dir=3D"ltr"><=
<a href=3D"mailto:dgomez1092@gmail.com" target=3D"_blank">dgomez1092@gmail.=
com</a>></span> wrote:<br><blockquote class=3D"gmail_quote" style=3D"mar=
gin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div dir=3D"ltr=
">let me continue my conversation:=C2=A0<div><br></div><div>as the developm=
ent of this transactions would be indiscated=C2=A0</div><div><br></div><div=
>as a ByteArray of=C2=A0</div><div><br></div></div><div class=3D"HOEnZb"><d=
iv class=3D"h5"><div class=3D"gmail_extra"><br><div class=3D"gmail_quote">O=
n Fri, May 8, 2015 at 3:11 PM, Damian Gomez <span dir=3D"ltr"><<a href=
=3D"mailto:dgomez1092@gmail.com" target=3D"_blank">dgomez1092@gmail.com</a>=
></span> wrote:<br><blockquote class=3D"gmail_quote" style=3D"margin:0 0=
0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div dir=3D"ltr"><br><=
div>Well zombie txns aside, =C2=A0I expect this to be resolved w/ a client =
side implementation using a Merkle-Winternitz OTS in order to prevent the l=
oss of fee structure theougth the implementation of a this security hash th=
at eill alloow for a one-wya transaction to conitnue, according to the TESL=
A protocol. =C2=A0</div><div><br></div><div>We can then tally what is neede=
d to compute tteh number of bit desginated for teh completion og the client=
-side signature if discussin the construcitons of a a DH key (instead of th=
e BIP X509 protocol) =C2=A0</div><div><br></div><div><br></div><div><br></d=
iv><div><br></div><div class=3D"gmail_extra"><br><div class=3D"gmail_quote"=
><div><div>On Fri, May 8, 2015 at 2:08 PM, <span dir=3D"ltr"><<a href=
=3D"mailto:bitcoin-development-request@lists.sourceforge.net" target=3D"_bl=
ank">bitcoin-development-request@lists.sourceforge.net</a>></span> wrote=
:<br></div></div><blockquote class=3D"gmail_quote" style=3D"margin:0 0 0 .8=
ex;border-left:1px #ccc solid;padding-left:1ex"><div><div>Send Bitcoin-deve=
lopment mailing list submissions to<br>
=C2=A0 =C2=A0 =C2=A0 =C2=A0 <a href=3D"mailto:bitcoin-development@lists.sou=
rceforge.net" target=3D"_blank">bitcoin-development@lists.sourceforge.net</=
a><br>
<br>
To subscribe or unsubscribe via the World Wide Web, visit<br>
=C2=A0 =C2=A0 =C2=A0 =C2=A0 <a href=3D"https://lists.sourceforge.net/lists/=
listinfo/bitcoin-development" target=3D"_blank">https://lists.sourceforge.n=
et/lists/listinfo/bitcoin-development</a><br>
or, via email, send a message with subject or body 'help' to<br>
=C2=A0 =C2=A0 =C2=A0 =C2=A0 <a href=3D"mailto:bitcoin-development-request@l=
ists.sourceforge.net" target=3D"_blank">bitcoin-development-request@lists.s=
ourceforge.net</a><br>
<br>
You can reach the person managing the list at<br>
=C2=A0 =C2=A0 =C2=A0 =C2=A0 <a href=3D"mailto:bitcoin-development-owner@lis=
ts.sourceforge.net" target=3D"_blank">bitcoin-development-owner@lists.sourc=
eforge.net</a><br>
<br>
When replying, please edit your Subject line so it is more specific<br>
than "Re: Contents of Bitcoin-development digest..."<br>
<br></div></div>Today's Topics:<br>
<br>
=C2=A0 =C2=A01. Re: Block Size Increase (Mark Friedenbach)<br>
=C2=A0 =C2=A02. Softfork signaling improvements (Douglas Roark)<br>
=C2=A0 =C2=A03. Re: Block Size Increase (Mark Friedenbach)<br>
=C2=A0 =C2=A04. Re: Block Size Increase (Raystonn) (Damian Gomez)<br>
=C2=A0 =C2=A05. Re: Block Size Increase (Raystonn)<br>
<br><br>---------- Forwarded message ----------<br>From:=C2=A0Mark Friedenb=
ach <<a href=3D"mailto:mark@friedenbach.org" target=3D"_blank">mark@frie=
denbach.org</a>><br>To:=C2=A0Raystonn <<a href=3D"mailto:raystonn@hot=
mail.com" target=3D"_blank">raystonn@hotmail.com</a>><br>Cc:=C2=A0Bitcoi=
n Development <<a href=3D"mailto:bitcoin-development@lists.sourceforge.n=
et" target=3D"_blank">bitcoin-development@lists.sourceforge.net</a>><br>=
Date:=C2=A0Fri, 8 May 2015 13:55:30 -0700<br>Subject:=C2=A0Re: [Bitcoin-dev=
elopment] Block Size Increase<br><div dir=3D"ltr">The problems with that ar=
e larger than time being unreliable. It is no longer reorg-safe as transact=
ions can expire in the course of a reorg and any transaction built on the n=
ow expired transaction is invalidated.<br><div><div class=3D"gmail_extra"><=
br><div class=3D"gmail_quote">On Fri, May 8, 2015 at 1:51 PM, Raystonn <spa=
n dir=3D"ltr"><<a href=3D"mailto:raystonn@hotmail.com" target=3D"_blank"=
>raystonn@hotmail.com</a>></span> wrote:<br><blockquote class=3D"gmail_q=
uote" style=3D"margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1e=
x">Replace by fee is what I was referencing.=C2=A0 End-users interpret the =
old transaction as expired.=C2=A0 Hence the nomenclature.=C2=A0 An alternat=
ive is a new feature that operates in the reverse of time lock, expiring a =
transaction after a specific time.=C2=A0 But time is a bit unreliable in th=
e blockchain<br></blockquote></div></div></div></div>
<br><br>---------- Forwarded message ----------<br>From:=C2=A0Douglas Roark=
<<a href=3D"mailto:doug@bitcoinarmory.com" target=3D"_blank">doug@bitco=
inarmory.com</a>><br>To:=C2=A0Bitcoin Dev <<a href=3D"mailto:bitcoin-=
development@lists.sourceforge.net" target=3D"_blank">bitcoin-development@li=
sts.sourceforge.net</a>><br>Cc:=C2=A0<br>Date:=C2=A0Fri, 8 May 2015 15:2=
7:26 -0400<br>Subject:=C2=A0[Bitcoin-development] Softfork signaling improv=
ements<br>-----BEGIN PGP SIGNED MESSAGE-----<br>
Hash: SHA512<br>
<br>
Hello. I've seen Greg make a couple of posts online<br>
(<a href=3D"https://bitcointalk.org/index.php?topic=3D1033396.msg11155302#m=
sg11155302" target=3D"_blank">https://bitcointalk.org/index.php?topic=3D103=
3396.msg11155302#msg11155302</a><br>
is one such example) where he has mentioned that Pieter has a new<br>
proposal for allowing multiple softforks to be deployed at the same<br>
time. As discussed in the thread I linked, the idea seems simple<br>
enough. Still, I'm curious if the actual proposal has been posted<br>
anywhere. I spent a few minutes searching the usual suspects (this<br>
mailing list, Reddit, Bitcointalk, IRC logs, BIPs) and can't find<br>
anything.<br>
<br>
Thanks.<br>
<br>
- ---<br>
Douglas Roark<br>
Senior Developer<br>
Armory Technologies, Inc.<br>
<a href=3D"mailto:doug@bitcoinarmory.com" target=3D"_blank">doug@bitcoinarm=
ory.com</a><br>
PGP key ID: 92ADC0D7<br>
-----BEGIN PGP SIGNATURE-----<br>
Version: GnuPG/MacGPG2 v2.0.22 (Darwin)<br>
Comment: GPGTools - <a href=3D"https://gpgtools.org" target=3D"_blank">http=
s://gpgtools.org</a><br>
<br>
iQIcBAEBCgAGBQJVTQ4eAAoJEGybVGGSrcDX8eMQAOQiDA7an+qZBqDfVIwEzY2C<br>
SxOVxswwxAyTtZNM/Nm+8MTq77hF8+3j/C3bUbDW6wCu4QxBYA/uiCGTf44dj6WX<br>
7aiXg1o9C4LfPcuUngcMI0H5ixOUxnbqUdmpNdoIvy4did2dVs9fAmOPEoSVUm72<br>
6dMLGrtlPN0jcLX6pJd12Dy3laKxd0AP72wi6SivH6i8v8rLb940EuBS3hIkuZG0<br>
vnR5MXMIEd0rkWesr8hn6oTs/k8t4zgts7cgIrA7rU3wJq0qaHBa8uASUxwHKDjD<br>
KmDwaigvOGN6XqitqokCUlqjoxvwpimCjb3Uv5Pkxn8+dwue9F/IggRXUSuifJRn<br>
UEZT2F8fwhiluldz3sRaNtLOpCoKfPC+YYv7kvGySgqagtNJFHoFhbeQM0S3yjRn<br>
Ceh1xK9sOjrxw/my0jwpjJkqlhvQtVG15OsNWDzZ+eWa56kghnSgLkFO+T4G6IxB<br>
EUOcAYjJkLbg5ssjgyhvDOvGqft+2e4MNlB01e1ZQr4whQH4TdRkd66A4WDNB+0g<br>
LBqVhAc2C8L3g046mhZmC33SuOSxxm8shlxZvYLHU2HrnUFg9NkkXi1Ub7agMSck<br>
TTkLbMx17AvOXkKH0v1L20kWoWAp9LfRGdD+qnY8svJkaUuVtgDurpcwEk40WwEZ<br>
caYBw+8bdLpKZwqbA1DL<br>
=3DayhE<br>
-----END PGP SIGNATURE-----<br>
<br>
<br>
<br><br>---------- Forwarded message ----------<br>From:=C2=A0Mark Friedenb=
ach <<a href=3D"mailto:mark@friedenbach.org" target=3D"_blank">mark@frie=
denbach.org</a>><br>To:=C2=A0"Raystonn ." <<a href=3D"mailt=
o:raystonn@hotmail.com" target=3D"_blank">raystonn@hotmail.com</a>><br>C=
c:=C2=A0Bitcoin Development <<a href=3D"mailto:bitcoin-development@lists=
.sourceforge.net" target=3D"_blank">bitcoin-development@lists.sourceforge.n=
et</a>><br>Date:=C2=A0Fri, 8 May 2015 13:40:50 -0700<br>Subject:=C2=A0Re=
: [Bitcoin-development] Block Size Increase<br><div dir=3D"ltr">Transaction=
s don't expire. But if the wallet is online, it can periodically choose=
to release an already created transaction with a higher fee. This requires=
replace-by-fee to be sufficiently deployed, however.<br><div><div class=3D=
"gmail_extra"><br><div class=3D"gmail_quote">On Fri, May 8, 2015 at 1:38 PM=
, Raystonn . <span dir=3D"ltr"><<a href=3D"mailto:raystonn@hotmail.com" =
target=3D"_blank">raystonn@hotmail.com</a>></span> wrote:<br><blockquote=
class=3D"gmail_quote" style=3D"margin:0 0 0 .8ex;border-left:1px #ccc soli=
d;padding-left:1ex"><p dir=3D"ltr">I have a proposal for wallets such as yo=
urs.=C2=A0 How about creating all transactions with an expiration time star=
ting with a low fee, then replacing with new transactions that have a highe=
r fee as time passes.=C2=A0 Users can pick the fee curve they desire based =
on the transaction priority they want to advertise to the network.=C2=A0 Us=
ers set the priority in the wallet, and the wallet software translates it t=
o a specific fee curve used in the series of expiring transactions.=C2=A0 I=
n this manner, transactions are never left hanging for days, and probably n=
ot even for hours.</p>
<p dir=3D"ltr">-Raystonn<br>
</p>
<div class=3D"gmail_quote">On 8 May 2015 1:17 pm, Aaron Voisine <<a href=
=3D"mailto:voisine@gmail.com" target=3D"_blank">voisine@gmail.com</a>> w=
rote:<br type=3D"attribution"><blockquote style=3D"margin:0 0 0 .8ex;border=
-left:1px #ccc solid;padding-left:1ex"><div dir=3D"ltr">As the author of a =
popular SPV wallet, I wanted to weigh in, in support of the Gavin's 20M=
b block proposal.<div><br></div><div>The best argument I've heard again=
st raising the limit is that we need fee pressure.=C2=A0 I agree that fee p=
ressure is the right way to economize on scarce resources. Placing hard lim=
its on block size however is an incredibly disruptive way to go about this,=
and will severely negatively impact users' experience.<br><div><br></d=
iv><div>When users pay too low a fee, they should:</div><div><br></div><div=
>1) See immediate failure as they do now with fees that fail to propagate.<=
/div><div><br></div><div>2) If the fee lower than it should be but not term=
inal, they should see degraded performance, long delays in confirmation, bu=
t eventual success. This will encourage them to pay higher fees in future.<=
/div><div><br></div><div>The worst of all worlds would be to have transacti=
ons propagate, hang in limbo for days, and then fail. This is the most impo=
rtant scenario to avoid. Increasing the 1Mb block size limit I think is the=
simplest way to avoid this least desirable scenario for the immediate futu=
re.</div><div><br></div><div>We can play around with improved transaction s=
election for blocks and encourage miners to adopt it to discourage low fees=
and create fee pressure. These could involve hybrid priority/fee selection=
so low fee transactions see degraded performance instead of failure. This =
would be the conservative low risk approach.</div><div><br><div><div><div d=
ir=3D"ltr"><div><div dir=3D"ltr"><div>Aaron Voisine</div><div>co-founder an=
d CEO<br><a href=3D"http://breadwallet.com" target=3D"_blank">breadwallet.c=
om</a></div></div></div></div></div></div></div></div></div>
</blockquote></div><br>----------------------------------------------------=
--------------------------<br>
One dashboard for servers and applications across Physical-Virtual-Cloud<br=
>
Widest out-of-the-box monitoring support with 50+ applications<br>
Performance metrics, stats and reports that give you Actionable Insights<br=
>
Deep dive visibility with transaction tracing using APM Insight.<br>
<a href=3D"http://ad.doubleclick.net/ddm/clk/290420510;117567292;y" target=
=3D"_blank">http://ad.doubleclick.net/ddm/clk/290420510;117567292;y</a><br>=
_______________________________________________<br>
Bitcoin-development mailing list<br>
<a href=3D"mailto:Bitcoin-development@lists.sourceforge.net" target=3D"_bla=
nk">Bitcoin-development@lists.sourceforge.net</a><br>
<a href=3D"https://lists.sourceforge.net/lists/listinfo/bitcoin-development=
" target=3D"_blank">https://lists.sourceforge.net/lists/listinfo/bitcoin-de=
velopment</a><br>
<br></blockquote></div><br></div></div></div>
<br><br>---------- Forwarded message ----------<br>From:=C2=A0Damian Gomez =
<<a href=3D"mailto:dgomez1092@gmail.com" target=3D"_blank">dgomez1092@gm=
ail.com</a>><br>To:=C2=A0<a href=3D"mailto:bitcoin-development@lists.sou=
rceforge.net" target=3D"_blank">bitcoin-development@lists.sourceforge.net</=
a><br>Cc:=C2=A0<br>Date:=C2=A0Fri, 8 May 2015 14:04:10 -0700<br>Subject:=C2=
=A0Re: [Bitcoin-development] Block Size Increase (Raystonn)<br><div dir=3D"=
ltr">Hello,=C2=A0<div><br></div><div>I was reading some of the thread but c=
an't say I read the entire thing.=C2=A0</div><div><br></div><div>I thin=
k that it is realistic to cinsider a nlock sixe of 20MB for any block txn t=
o occur. THis is an enormous amount of data (relatively for a netwkrk) in w=
hich the avergage rate of 10tps over 10 miniutes would allow for fewasible =
transformation of data at this curent point in time.</div><div><br></div><d=
iv>Though I do not see what extra hash information would be stored in the o=
verall ecosystem as we begin to describe what the scripts that are atacrhed=
tp the blockchain would carry,=C2=A0</div><div><br></div><div>I'd ther=
efore think that for the remainder of this year that it is possible to have=
a block chain within 200 - 300 bytes that is more charatereistic of some f=
easible attempts at attaching nuanced data in order to keep propliifc the b=
lockchain but have these identifiers be integral OPSIg of the the entiore b=
lock. THe reasoning behind this has to do with encryption standards that ca=
n be added toe a chain such as th DH algoritnm keys that would allow for a =
higher integrity level withinin the system as it is. Cutrent;y tyh prootocl=
oomnly controls for the amount of transactions through if TxnOut script an=
d the publin key coming form teh lcoation of the proof-of-work. Form this t=
hen I think that a rate of higher than then current standard of 92bytes all=
ows for GPUS ie CUDA to perfirm its standard operations of =C2=A01216 flops=
=C2=A0 in rde rto mechanize a new personal identity within the chain that =
also attaches an encrypted instance of a further categorical variable that =
we can prsribved to it.=C2=A0</div><div><br></div><div>I think with the cur=
rent BIP7 prootclol for transactions there is an area of vulnerability for =
man-in-the-middle attacks upon request of =C2=A0bitcin to any merchant as i=
s. It would contraidct the security of the bitcoin if it was intereceptefd =
iand not allowed to reach tthe payment network or if the hash was reveresed=
in orfr to change the value it had. Therefore the current best fit block s=
ize today is between 200 - 300 bytws (depending on how exciteed we get)</di=
v><div><br></div><div><br></div><div><br></div><div>Thanks for letting me j=
oin the conversation</div><div>I welcomes any vhalleneged and will reply wi=
th more research as i figure out what problems are revealed in my current f=
ormation of thoughts (sorry for the errors but i am just trying to move for=
ward ---> THE DELRERT KEY LITERALLY PREVENTS IT )</div><div><br></div><d=
iv><br></div><div>_Damian</div></div>
<br><br>---------- Forwarded message ----------<br>From:=C2=A0Raystonn <=
<a href=3D"mailto:raystonn@hotmail.com" target=3D"_blank">raystonn@hotmail.=
com</a>><br>To:=C2=A0Mark Friedenbach <<a href=3D"mailto:mark@frieden=
bach.org" target=3D"_blank">mark@friedenbach.org</a>><br>Cc:=C2=A0Bitcoi=
n Development <<a href=3D"mailto:bitcoin-development@lists.sourceforge.n=
et" target=3D"_blank">bitcoin-development@lists.sourceforge.net</a>><br>=
Date:=C2=A0Fri, 8 May 2015 14:01:28 -0700<br>Subject:=C2=A0Re: [Bitcoin-dev=
elopment] Block Size Increase<br><p dir=3D"ltr">Replace by fee is the bette=
r approach.=C2=A0 It will ultimately replace zombie transactions (due to in=
sufficient fee) with potentially much higher fees as the feature takes hold=
in wallets throughout the network, and fee competition increases.=C2=A0 Ho=
wever, this does not fix the problem of low tps.=C2=A0 In fact, as blocks f=
ill it could make the problem worse.=C2=A0 This feature means more transact=
ions after all.=C2=A0 So I would expect huge fee spikes, or a return to zom=
bie transactions if fee caps are implemented by wallets.</p>
<p dir=3D"ltr">-Raystonn<br>
</p>
<div class=3D"gmail_quote">On 8 May 2015 1:55 pm, Mark Friedenbach <<a h=
ref=3D"mailto:mark@friedenbach.org" target=3D"_blank">mark@friedenbach.org<=
/a>> wrote:<br type=3D"attribution"><blockquote style=3D"margin:0 0 0 .8=
ex;border-left:1px #ccc solid;padding-left:1ex"><div dir=3D"ltr">The proble=
ms with that are larger than time being unreliable. It is no longer reorg-s=
afe as transactions can expire in the course of a reorg and any transaction=
built on the now expired transaction is invalidated.<br><div><div><br><div=
>On Fri, May 8, 2015 at 1:51 PM, Raystonn <span dir=3D"ltr"><<a href=3D"=
mailto:raystonn@hotmail.com" target=3D"_blank">raystonn@hotmail.com</a>>=
</span> wrote:<br><blockquote style=3D"margin:0 0 0 0.8ex;border-left:1px #=
ccc solid;padding-left:1ex">Replace by fee is what I was referencing.=C2=A0=
End-users interpret the old transaction as expired.=C2=A0 Hence the nomenc=
lature.=C2=A0 An alternative is a new feature that operates in the reverse =
of time lock, expiring a transaction after a specific time.=C2=A0 But time =
is a bit unreliable in the blockchain<br></blockquote></div></div></div></d=
iv>
</blockquote></div><br>----------------------------------------------------=
--------------------------<br>
One dashboard for servers and applications across Physical-Virtual-Cloud<br=
>
Widest out-of-the-box monitoring support with 50+ applications<br>
Performance metrics, stats and reports that give you Actionable Insights<br=
>
Deep dive visibility with transaction tracing using APM Insight.<br>
<a href=3D"http://ad.doubleclick.net/ddm/clk/290420510;117567292;y" target=
=3D"_blank">http://ad.doubleclick.net/ddm/clk/290420510;117567292;y</a><br>=
_______________________________________________<br>
Bitcoin-development mailing list<br>
<a href=3D"mailto:Bitcoin-development@lists.sourceforge.net" target=3D"_bla=
nk">Bitcoin-development@lists.sourceforge.net</a><br>
<a href=3D"https://lists.sourceforge.net/lists/listinfo/bitcoin-development=
" target=3D"_blank">https://lists.sourceforge.net/lists/listinfo/bitcoin-de=
velopment</a><br>
<br></blockquote></div><br></div></div>
</blockquote></div><br></div>
</div></div></blockquote></div><br></div>
--f46d0438921751992f05159ad62d--
|