-
Notifications
You must be signed in to change notification settings - Fork 2
/
P2PEG.php
1983 lines (1748 loc) · 62.9 KB
/
P2PEG.php
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
<?php
/*!
* Peer to Peer Entropy Generator
* or Random numbers generator with p2p seeding
*
* This class uses a combination of system data, client supplied data,
* some PRNGs available to PHP and timing to generate unpredictable
* entropy data.
* *
* Each pear adds to the entropy, by suppling variable data with the request (in purpos or not)
* and by the fact of connecting to the server (the exact request time is also accounted).
* *
* For connecting pears there is no way to know about internal server state.
* *
* For anyone trying to compute the state of the entropy data at a given point in time,
* or trying to guess
*
* @TODO
*
* 1. To improve the entropy unpredictability, I intend to create system
* where multiple machines periodically exchange entropy.
* Each pear gets entropy and gives entropy at the same time
* with a simple GET request like this one:
*
* curl https://DUzun.Me/entropy/<hash(random_func().$secret)>
*
*
* 2. Seed /dev/random and update entropy count, to improve system performance
*
*
* 3. Count the amount of entropy generated
*
*
* @version 0.6.6
* @author Dumitru Uzun (DUzun.Me)
*
*/
define('P2PEG_INT16_MASK', -1 << 16 ^ -1);
define('P2PEG_INT32_MASK', -1 << 32 ^ -1);
define('P2PEG_SIGN_BIT', -1<<(PHP_INT_SIZE<<3)-1);
class P2PEG {
public static $version = '0.6.6';
// First start timestamp
public static $start_ts;
// Singleton instance
protected static $instance;
/// Path to a file where to store state data
public $state_file;
public $debug = false;
/// Use first available hash alg from the list
public $hash = array('sha512', 'sha256', 'sha128', 'sha1', 'md5', 'ripemd128', 'ripemd160');
// Padding for HMAC-HASH
private $_opad, $_ipad;
// If true, call seedRandomDev() on __destruct
public $seedSys = true;
// Seed for rand32(), rand64() and other PRNGs
public $rs = array();
// State values
private $_state;
protected $_state_mtime;
protected $_clientEntropy;
protected $_serverEntropy;
protected $_serverEEntropy;
protected $_filesystemEntropy;
// internal buffer
private $_b = ''; // data
private $_l = 0; // available (unused) length
// How many degimal digits fit in one int
protected static $int_len;
// -------------------------------------------------
/// Get the singleton instance
public static function instance($secret=NULL) {
if(!isset(self::$instance)) {
self::$instance = new self($secret);
}
return self::$instance;
}
// -------------------------------------------------
/// @param (string)$secret - A secred string, should be unique on each installation (: http://xkcd.com/221/ :)
public function __construct($secret=NULL) {
// parent::__construct();
isset(self::$start_ts) or self::$start_ts = microtime(true);
isset(self::$int_len) or self::$int_len = round(PHP_INT_SIZE * log10(256));
$this->seedSys = !$this->isWindows();
// No secred key? Generate one!
if ( !isset($secret) ) {
$secret = $this->packFloat(self::$start_ts) . 'H{tCAD;](WS[v|\\0}0cgd/(*;1NUd_5trdB:Qmn8s5%,FK*Civ(&' . self::$version;
}
$this->setSecret($secret);
}
public function __destruct() {
// parent::__destruct();
// Save state to a file
$this->saveState();
// Influence /dev/urandom and /dev/random
if($this->seedSys) $this->seedRandomDev(__METHOD__);
}
// -------------------------------------------------
public function saveState($sf=NULL) {
if(!$this->_state) return false; // Nothing to save
if(!$sf) $sf = $this->state_file;
if(!$sf) return false; // No where to save
static $oldPHP;
isset($oldPHP) or $oldPHP = version_compare(PHP_VERSION, '5.3.0') < 0;
// If meanwhile state file changed, don't loose that entropy
$oldPHP ? clearstatcache() : clearstatcache(true, $sf);
$flags = 1;
if(@filemtime($sf) != $this->_state_mtime) {
$flags |= FILE_APPEND;
}
// @TODO: Watch for state_file size if the server is very busy
return @$this->flock_put_contents($sf, $this->_state, $flags);
}
// -------------------------------------------------
public function warmup($secret=NULL) {
isset($secret) and $this->setSecret($secret);
$this->state();
// $this->serverEntropy();
// $this->clientEntropy();
}
// -------------------------------------------------
/**
* Seed P2PEG with some entropy.
*/
public function seed($seed=NULL) {
$ret = $this->state()
. $seed
. $this->dynEntropy()
;
$ret = $this->hash($ret);
$this->_state ^= $ret;
$this->_b = $ret;
$this->_l = strlen($ret);
return $ret;
}
// -------------------------------------------------
/**
* Return a random binary string of specified length.
*/
public function str($len=NULL) {
// If buffer is empty, fill it
if(!($l = $this->_l)) {
$this->seed($len);
$l = $this->_l;
}
// If we have to return exactly what is in the buffer, return quickly
if(!isset($len) || $len == $l) {
// remove used data from buffer to avoid reusing it
$ret = $l < strlen($this->_b) ? substr($this->_b, 0, $l) : $this->_b;
// empty the buffer
$this->_b = '';
$this->_l = 0;
return $ret;
}
$ret = '';
// If we need more data than we have in the buffer, generate some more
if($l < $len) {
// remove used data from buffer to avoid reusing it
if($l < strlen($this->_b)) $this->_b = substr($this->_b, 0, $l);
do {
$ret .= $this->_b; // save what is in the buffer
$this->seed($l); // fill it again
$l += $this->_l; // the sum of what we have saved in $ret and what is in the buffer
} while($l < $len);
}
// If buffer has more data then we need
if($len < $l) {
// how much data we don't need from buffer ?
$this->_l = $l - $len;
// get only that much we need from buffer and leave the rest for others
$ret .= substr($this->_b, $this->_l, $len);
}
// else buffer has exactly how much data we need - grab it all
else {
$ret .= $this->_b;
// empty the buffer
$this->_b = '';
$this->_l = 0;
}
return $ret;
}
/**
* Hex encoded string
*/
public function hex($len=NULL) {
$l = isset($len) ? ($len+1) >> 1 : $len;
$ret = $this->str($l);
$ret = bin2hex($ret);
return !isset($len) || strlen($ret) == $len
? $ret
: substr($ret, 0, $len)
;
}
/**
* Base64 encoded text (for URL) or text based on the supplied alphabet
*
* @param int $len Length of the generated text
* @param string $alphabet Pattern or just a string - OPTIONAL. If missing, base64 encoded
* @return string
*/
public function text($len=NULL, $alphabet=NULL) {
if ( !empty($alphabet) ) return $this->alpha($alphabet, $len);
$l = isset($len) ? ceil((float)$len * 3.0 / 4.0) : NULL;
$ret = $this->bin2text($this->str($l));
if(isset($len) && strlen($ret) > $len) $ret = substr($ret, 0, $len);
return $ret;
}
/**
* Generate text with a given alphabet.
*
* @param string $alphabet Pattern or just a string
* @param int $len Length of the generated string
* @return string
*/
public function alpha($alphabet, $len=NULL) {
$alphabet = self::expand_alpha($alphabet);
$alpha_len = strlen($alphabet);
$bit_size = ceil(log($alpha_len, 2));
$s = $this->str(isset($len) ? ceil((float)$len * $bit_size / 8) : NULL);
$l = strlen($s);
$r = '';
$b = 0;
$c = 0;
$m = -1 << $bit_size ^ -1;
for($i=0; $i<$l; $i++) {
$b = ($b << 8) | ord(substr($s, $i, 1));
$c += 8;
while($c >= $bit_size) {
if ( isset($len) && strlen($r) >= $len ) break 2;
$r .= $alphabet[($b & $m) % $alpha_len];
$c -= $bit_size;
$b >>= $bit_size;
}
}
return $r;
}
/**
* Expand alphanumeric paterns
*
* @param string $a First char of the expansion or a patern like "a-z0-9_!"
* @param string $z Last char or the expansion
* @return string A string of all letter between $a and $z (including) or the expanded pattern of $a
*/
public static function expand_alpha($a, $z=NULL) {
if ( !isset($z) ) {
$i = 1;
$l = strlen($a);
$r = '';
while( $i < $l and $p = strpos($a, '-', $i) and $p+1 < $l ) {
$z = self::expand_alpha(substr($a, $p-1), substr($a, $p+1));
$a = substr($a, 0, $p-1) . $z . substr($a, $p+2);
$l += strlen($z) - 3;
$i = $p + strlen($z);
}
return $a;
}
$b = ord($a);
$e = ord($z);
if ( $b > $e ) {
$t = $b; $b = $e; $e = $t;
}
$ret = array();
for(; $b <= $e; $b++) {
$ret[] = chr($b);
}
return implode('', $ret);
}
/**
* Return a random 16 bit integer.
*
* @return (int)random
*/
public function int16() {
$r = unpack('s', $this->str(2));
return reset($r);
}
/**
* Return a random 32 bit integer.
*
* @return (int)random
*/
public function int32() {
$r = unpack('l', $this->str(4));
return reset($r);
}
/**
* Return a random integer.
*
* @param (int)$size - number of bytes used to generate the integer [1..PHP_INT_SIZE].
* Defaults to PHP_INT_SIZE (4 or 8, depending on system)
* Ex. If $size == 1, the result is a number from interval [0..255].
* If $size == 3, the result is a number from interval [0..16777215].
*
* @return (int)random
*
*/
public function int($size=NULL) {
$s = isset($size) ? $size : PHP_INT_SIZE;
$src = $this->str($s);
$r = 0;
for(;$s--;) $r = ($r << 8) | ord(substr($src, $s, 1));
return $r;
}
// -------------------------------------------------
/**
* Equivalent of PHP's rand(), only using our entropy.
*
* @param int $min The lowest value to return (default: 0)
* @param int $max The highest value to return (default: PHP_INT_MAX)
* @param string $algo Name of a P2PEG method that returns an integer
* @param int $max_size The highest value $this->$algo() could return
* @return int An integer between [$min..$max]
*/
public function rand($min=0, $max=NULL, $algo="int", $max_size=PHP_INT_MAX, $arg=NULL) {
isset($max) or $max = $max_size;
$num = $this->$algo($arg);
// if ( abs($num) > $max_size ) {
// $num &= $max_size; // not 100% correct, but in some cases might help
// }
return $min + ((1 + $num / ($max_size + 1)) * ($max - $min + 1) >> 1);
}
// -------------------------------------------------
/**
* How many bytes are required to represent this integer?
*
* @param int $int An integer
* @return int Number of not 0 bytes of $int
*/
public static function sizeOfInt($int) {
$m = -1 << ((PHP_INT_SIZE-1)<<3);
$c = PHP_INT_SIZE;
while(!($b = $int & $m) || $b == 0xFF and $c) {
--$c;
$m >>= 8;
}
return $c;
}
/* --- PRNGs ---------------------------------------------------------------- */
public function _init_rs32($len) {
$count = count($this->rs);
while($count < $len) $this->rs[$count++] = $this->int32();
return $this->rs;
}
public function _init_rs($len) {
$count = count($this->rs);
while($count < $len) $this->rs[$count++] = $this->int();
return $this->rs;
}
// -------------------------------------------------
/**
* Pseudo-random 32bit integer numbers generator.
*
* This algorithm is a linear congruential pseudo-random number generator.
*
* This function produces same result as $this->int32(),
* but is much faster at generating long strings of random numbers,
* and uses less entropy as well.
*
* @source http://en.wikipedia.org/wiki/Random_number_generation
*
* @return (int)random
*/
public function rand32($strict=true) {
$rs00 = @$this->rs[0];
$rs10 = @$this->rs[1];
// Seed if necessary
while(!$rs10 || $rs10 == 0x464fffff) {
/* must not be zero, nor 0x464fffff */
$rs10 = $this->int32() ^ $this->int32();
}
while(!$rs00 || $rs00 == 0x9068ffff) {
/* must not be zero, nor 0x9068ffff */
$rs00 = $this->int32() ^ $this->int32();
}
$rs00 = 0x9069 * ($rs00 & P2PEG_INT16_MASK) + ($rs00 >> 16);
$rs10 = 0x4650 * ($rs10 & P2PEG_INT16_MASK) + ($rs10 >> 16);
$ret = ($rs00 << 16) + $rs10; /* 32-bit result */
$this->rs[0] = $rs00;
$this->rs[1] = $rs10;
$m = $strict ? P2PEG_INT32_MASK : -1;
// handle overflow:
// in PHP at overflow (int) -> (float)
return $ret & $m;
}
// -------------------------------------------------
/**
* Pseudo-random 64bit integer numbers generator (xorshift family).
*
* @source http://vigna.di.unimi.it/ftp/papers/xorshiftplus.pdf
*
* @return (int)random
*/
public function rand64() {
$rs = $this->rs;
count($rs) < 4 and $rs = $this->_init_rs32(4);
$s10 = $rs[0];
$s11 = $rs[1];
$s00 = $rs[2];
$s01 = $rs[3];
$m = P2PEG_INT32_MASK;
// Seed if necessary
while(!$s10 || !$s11) {
$s10 = $this->int32();
$s11 = $this->int32();
}
while(!$s00 || !$s01) {
$s00 = $this->int32();
$s01 = $this->int32();
}
$rs[0] = $s00;
$rs[1] = $s01;
// $s1 ^= $s1 << 23;
$s11 ^= ($s11 << 23) & $m | ($s10 >> 9);
$s10 ^= ($s10 << 23) & $m;
// $s1 ^= $s1 >> 17;
$s10 ^= ($s11 << 15) & $m | ($s10 >> 17);
$s11 ^= $s11 >> 17;
// $s1 ^= $s0;
$s10 ^= $s00;
$s11 ^= $s01;
// $s1 ^= $s0 >> 26;
$s10 ^= ($s01 << 8) & $m | ($s00 >> 26);
$s11 ^= $s01 >> 26;
$rs[2] = $s10;
$rs[3] = $s11;
$this->rs = $rs;
return (($rs[1] + $rs[3]) << 32) | ($rs[0] + $rs[2]);
}
/**
* Algorithm "xor" from p. 4 of Marsaglia, "Xorshift RNGs"
*
* @return int32
*/
public function xorShift32($strict=true) {
$x = @$this->rs[0];
// Seed if necessary
while(!$x) {
$x = $this->int32();
}
$x ^= $x << 13; // 19
$strict and $x &= P2PEG_INT32_MASK;
$x ^= $x >> 17; // 15
$x ^= $x << 5; // 27
$strict and $x &= P2PEG_INT32_MASK;
return $this->rs[0] = $x;
}
/**
* Algorithm "xor128" from p. 5 of Marsaglia, "Xorshift RNGs"
*
* @return int32
*/
public function xorShift128($strict=true) {
count($this->rs) < 4 and $this->_init_rs32(4);
$t = array_splice($this->rs, 3, 1);
$s = $this->rs[0];
$t ^= $t[0] << 11; // 21
if ( $strict ) {
$t ^= ($t >> 8) & (-1 << 24 ^ -1);
$t ^= $s;
$t ^= ($s >> 19) & (-1 << 13 ^ -1);
$t &= P2PEG_INT32_MASK;
}
else {
$t ^= $t >> 8; // 24
$t ^= $s;
$t ^= $s >> 19; // 13
}
array_unshift($this->rs, $t);
return $t;
}
/**
* Algorithm "xorwow" from p. 5 of Marsaglia, "Xorshift RNGs"
*
* @note This generator is the default in Nvidia's CUDA toolkit.
*
* @period 2^160−2^32
*
* @return int32
*/
public function xorwow($strict=true) {
if ( count($this->rs) < 4 ) {
$this->_init_rs32(4);
}
$t = array_splice($this->rs, 3, 1);
$s = $this->rs[0];
$m = $strict ? P2PEG_INT32_MASK : -1;
$t ^= $strict ? (($t[0]&$m) >> 2) & (-1 << 30 ^ -1) : $t[0] >> 2;
$t ^= $t << 1;
$t ^= $s;
$t ^= $s << 4;
array_unshift($this->rs, $t &= $m);
if ( $strict ) {
$this->rs[4] = (@$this->rs[4] + 0x587c5) & $m;
return ($t + $this->rs[4]) & $m;
}
else {
$this->rs[4] = self::add64(@$this->rs[4], 0x587c5);
return self::add64($t, $this->rs[4]);
}
}
// -------------------------------------------------
/**
* This is a fixed-increment version of Java 8's SplittableRandom generator
*
* See http://dx.doi.org/10.1145/2714064.2660195 and
* http://docs.oracle.com/javase/8/docs/api/java/util/SplittableRandom.html
*
* passes BigCrush
*
* @return int64
*/
public function splitMix64() {
list($z) = $this->_init_rs(1);
$this->rs[0] =
$z = self::add64($z, 0x9E3779B97F4A7C15);
$z ^= ($z >> 30) & (-1 << 34 ^ -1);
$z = self::mul64($z, 0xBF58476D1CE4E5B9);
$z ^= ($z >> 27) & (-1 << 37 ^ -1);
$z = self::mul64($z, 0x94D049BB133111EB);
return $z ^= ($z >> 31) & (-1 << 33 ^ -1);
$m = P2PEG_INT32_MASK;
list($x, $y) = $this->_init_rs32(2);
$y += 0x7F4A7C15;
$x += 0x9E3779B9 + (($y >> 32) & $m);
$x &= $m; $y &= $m;
$this->rs[0] = $x;
$this->rs[1] = $y;
$y ^= (($x << 2) & ~3) | (($y >> 30) & 3);
$x ^= ($x >> 30) & 3;
$ah = 0xBF58476D;
$al = 0x1CE4E5B9;
$x &= $m; $y &= $m;
$x = $x * $al + $y * $ah;
$y = $y * $al;
$x += ($y >> 32) & $m;
$y ^= (($x << 5) & ~0x1F) | (($y >> 27) & 0x1F);
$x ^= ($x >> 27) & 0x1F;
$ah = 0x94D049BB;
$al = 0x133111EB;
$x &= $m; $y &= $m;
$x = $x * $al + $y * $ah;
$y = $y * $al;
$x += ($y >> 32) & $m;
$y ^= (($x << 1) & ~1) | (($y >> 31) & 1);
$x ^= ($x >> 31) & 1;
return ($x << 32) | ($y & $m);
}
// -------------------------------------------------
/**
* @period 2^1024 − 1
* passes BigCrush
*
* @return int64
*/
public function xorShift1024Star() {
static $p = 0;
$this->_init_rs(16);
$s0 = $this->rs[$p++];
$s1 = $this->rs[$p &= 15];
// There is no UInt64 in PHP, only Int64 on x64 platform, and Int32 on x86,
// thus, we have to make an unsigned right shift somehow.
// Main idea is: $x >>> $n === ($x >> $n) & (-1 << (64-$n) ^ -1)
$s1 ^= $s1 << 31;
$s1 = $s1 ^ $s0 ^ ($s1 << 31) ^ (($s1 >> 11) & (-1 << 53 ^ -1)) ^ (($s0 >> 30) & 3);
$this->rs[$p] = $s1;
// In PHP, we can't just multiply int64 * int64 and get an int64. See mul64()
return self::mul64($s1, 0x106689D45497FDB5);
// return ($s1 * 0x106689D45497FDB5); // this is a float in PHP :-(
}
/**
* @period 2^128-1
*
* @return int64
*/
public function xorShift128Plus() {
list($x, $y) = $this->_init_rs(2);
$this->rs[0] = $y;
// There is no UInt64 in PHP, only Int64 on x64 platform, and Int32 on x86,
// thus, we have to make an unsigned right shift somehow.
// Main idea is: $x >>> $n === ($x >> $n) & (-1 << (64-$n) ^ -1)
$x ^= $x << 23;
$x ^= $y ^ (($x >> 17) & (-1 << 47 ^ -1)) ^ (($y >> 26) & (-1 << 38 ^ -1));
// $x ^= $y ^ ($x >> 17) ^ ($y >> 26);
$this->rs[1] = $x;
return self::add64($x, $y);
// return ($x + $y); // this is a float in PHP :-(
}
// -------------------------------------------------
/**
* WARNING! This is a very bad RNG! Here just as an example.
* See https://www.wikiwand.com/en/RANDU
*
* The only good part about this implementation is that the seed is random.
*/
public function RANDU() {
$s = $this->_init_rs32(1);
$s = $s[0];
// return $this->rs[0] = ($s * 0x10003) & 0x7FFFFFFF;
return $this->rs[0] = (($s << 16) + ($s << 1) + $s) & 0x7FFFFFFF;
}
/**
* RANDU Deskewed a little bit, but still...
*/
public function RANDU_Deskewed() {
return $this->Deskew_uniform_distribution('RANDU');
}
// -------------------------------------------------
/**
* De-sckew method to nomalize distribution of 0s and 1s.
*
* @param string $method A P2PEG method that produces (pseudo) random data
* @return int|string same type as $method
*/
public function Deskew_uniform_distribution($method) {
$g = $this->call($method);
if ( $g === false ) return $g;
if ( is_int($g) ) {
$r = 0;
for($b = $c = self::sizeOfInt($g) << 3; $c; $g = $this->call($method)) {
for($i=$b >> 1; $i-- && $c; ) {
$x = $g & 3;
$g >>= 2;
switch($x) {
case 1: // 0
$r <<= 1;
--$c;
break;
case 2: // 1
$r <<= 1;
$r |= 1;
--$c;
break;
}
}
}
return $r;
}
else {
$s = '';
$b = strlen($g);
for($c = $b << 3, $r = 0; $c; $g = $this->call($method), $b = strlen($g)) {
for($l=0; $l < $b && $c; $l++) {
$f = ord(substr($g, $l, 1));
for($i=4; $i-- && $c; ) {
$x = $f & 3;
$f >>= 2;
switch($x) {
case 2: // 1
$r |= 1;
case 1: // 0
--$c;
if ( ($c & 7) == 0 ) {
$s .= chr($r);
$r = 0;
}
$r <<= 1;
break;
}
}
}
}
return $s;
}
}
// -------------------------------------------------
/**
* Generate and serve to client a random bitmap image.
*
* This method helps to visually inspect a random number generator (RNG).
* It is not enough to know how good the RNG is,
* but if you see any pattern, the RNG is bad or something is wrong.
*
* @param (int)$width of the image
* @param (int)$height of the image
* @param (str)$meth - a method of this class to generate data
* @param (int)$wordSize in bits - size of each number or char generated by $meth.
* Defaults to 8 for string and min 32 for int (autodetect from first sample).
*
* @note Requires the GD Library
*
* Inspired by https://boallen.com/random-numbers.html
*
*/
public function servImg($width=64, $height=64, $meth='rand32', $wordSize=NULL, $bitMix=false) {
$totalSize = $width * $height;
$g = NULL;
if ( is_array($bitMix) ) {
$g = $bitMix;
$bitMix = false;
}
elseif( is_string($bitMix) ) {
$g = $bitMix;
$bitMix = true;
}
if ( isset($g) ) {
is_array($meth) or $meth = array($meth);
}
else {
is_array($meth) and count($meth) == 1 and $meth = reset($meth);
}
if ( !is_array($meth) ) {
$m = is_int($meth) || is_numeric($meth) || strncmp($meth, '0', 1) == 0 ? $meth : array($this, $meth);
$g = self::callable2string($m, $totalSize, $wordSize, false);
if ( $g === false ) return $g;
}
else {
foreach($meth as $m) {
$c = is_int($m) || is_numeric($m) || strncmp($m, '0', 1) == 0 ? $m : array($this, $m);
// 0 is a special method which just enables $bitMix
if ( $c === 0 || $c === '0' ) {
$r = '';
$c = 0;
}
else {
$r = self::callable2string($c, $totalSize, $wordSize, $bitMix);
if ( $r === false ) return $r;
}
// As long as there are only arrays of items, mix at item/word level,
if ( !$bitMix ) {
// but with first string, make everything string and mix at bit level.
if ( is_string($r) ) {
$bitMix = true;
if ( is_array($g) ) {
$g = self::arrayOfInt2String($g, $wordSize ? $wordSize >> 3 : $wordSize);
}
}
}
if ( $c !== 0 ) {
$g = self::mixor($g, $r, $wordSize ? $wordSize >> 3 : $wordSize);
}
}
unset($r); // free mem
// Because we have converted everything to char string, max wordSize is 8
if ( $bitMix ) {
$wordSize = min($wordSize, 8);
}
}
header('X-Rand-Meth: ' . implode(', ', (array)$meth));
self::servStringImg($g, $wordSize, $width, $height);
}
// -------------------------------------------------
public function servImgDyn($width=64, $height=64, $meth='rand32', $wordSize=NULL) {
$g = $this->call($meth);
$samples = 1;
if ( $g === false ) {
trigger_error(__METHOD__ . ': Wrong method called. '.implode(', ', (array)$meth));
echo 'Error';
return false;
}
header("Content-type: image/png");
$im = imagecreatetruecolor($width, $height) or die("Cannot Initialize new GD image stream");
$white = imagecolorallocate($im, 255, 255, 255);
$iss = is_string($g); // string or int32
if($iss) {
$p = strlen($g);
$r = ord(substr($g, --$p, 1));
$bitSize = empty($wordSize) ? 8 : $wordSize; // 1 bytes == 8 bits
}
else {
$r = $g;
$bitSize = empty($wordSize) ? max(32, self::sizeOfInt($g) << 3) : $wordSize; // 4 bytes == 32 bits
}
$i = $bitSize;
header('X-Rand-Meth: ' . implode(', ', (array)$meth));
header('X-Word-Size: ' . $bitSize);
for($y = 0; $y < $height; $y++) {
for($x = 0; $x < $width; $x++) {
if($i == 0) {
if($iss) {
if(!$p) {
$g = $this->call($meth);
$p = strlen($g);
++$samples;
}
$r = ord(substr($g, --$p, 1));
}
else {
$r = $this->call($meth);
++$samples;
}
$i = $bitSize;
}
if($r & 1) {
imagesetpixel($im, $x, $y, $white);
}
$r >>= 1;
// sign bit should be 0 after first shift
if ( $r < 0 ) {
$r ^= P2PEG_SIGN_BIT;
}
--$i;
}
}
header('X-Samples: ' . $samples);
imagepng($im);
imagedestroy($im);
}
public static function servStringImg($str, $wordSize=NULL, $width=NULL, $height=NULL) {
$im = self::string2bitImg($str, $wordSize, $width, $height);
header("Content-type: image/png");
header('X-Word-Size: ' . $im['bitSize']);
header('X-Img-Size: ' . $im['width'] . 'x' . $im['height']);
header('X-Count: ' . (is_string($str) ? strlen($str) : count($str)));
imagepng($im['img']);
imagedestroy($im['img']);
return $im;
}
// -------------------------------------------------
/**
* Obtain a string of words/chars for a given $callable, with the size $totalBitSize.
*
* @param callable|number $callable A callable that produces int of string.
* If this is a number (0xHEC, 0b10, 1052 etc),
* then it is considered as $callable's return
* @param int $totalBitSize The desired length of the resulting string in bits
* @param int $wordSize Number of bits to take from each word. OPTIONAL
* @param boolean $returnString If true, convert the result to string of char
* @return string|array Depending on $returnString and $callable's output
*/
public static function callable2string($callable, $totalBitSize, $wordSize=NULL, $returnString=true) {
if ( is_int($g = self::text2int($callable)) ) {
$bitSize = empty($wordSize) ? self::sizeOfInt($g) : $wordSize; // 1 bytes == 8 bits
$g = array_fill(0, ceil($totalBitSize / $bitSize), $g);
}
else {
if ( is_array($callable) && count($callable) > 2 ) {
$args = array_slice($callable, 2);
$callable = array_slice($callable, 0, 2);
}
else {
$args = array();
}
$g = call_user_func_array($callable, $args);
if( is_string($g) ) {
$bitSize = empty($wordSize) ? 8 : $wordSize; // 1 bytes == 8 bits
$p = strlen($g);
while(strlen($g) * $bitSize < $totalBitSize) {
$g .= call_user_func_array($callable, $args);
}
}
elseif( is_int($g) ) {
if ( empty($wordSize) ) {
$bitSize = self::sizeOfInt($g) << 3;
}
else {
$bitSize = $wordSize; // 4 bytes == 32 bits
}
$g = array($g);
$v = 0;
while(count($g) * $bitSize < $totalBitSize) {
$g[] = $r = call_user_func_array($callable, $args);
if ( empty($wordSize) ) {
$i = self::sizeOfInt($r);
$b = $i << 3;
if ( $b > $bitSize ) {
$bitSize = $b;
$v = 0;
if ( $i == PHP_INT_SIZE ) {
$wordSize = $bitSize;
}
}
elseif ( ++$v > 16 ) {
$wordSize = $bitSize;
}
}