What does it take to nurture trust among folks for a new highly innovative system?

The answer is “A fair and transparent system certified by global leaders of the industry”

Welcome to the THEDRAWZONE , the platform for drawing true random numbers. Developed and designed by the R&D team of Betmacan Limited, the RNG module of THEDRAWZONE is certified by the none other than Itech Labs, Australia. The proven authenticity of randomly generated number is instrumental in building trust for gamers.

What did Itech Labs certify?

Itech Labs carried out rigorous testing and analyzed large data samples to confirm the accuracy and authenticity of the RNG module of MLP. Then they certified that the number drawn online is generated by RNG algorithm which is fair and truly random.

THEDRAWZONE uses this number to serve gaming application like MLP where players put stakes on their lucky numbers. The wins and losses are decided on the basis of what Random number is generated on THEDRAWZONE 's website.

Betmacan innovates to develop a cutting edge technology to create a customer centric system. We aim to make THEDRAWZONE the largest independent RNG platform which offers fair and trusted RNG, fan engagement and many more features in the roadmap.

The website THEDRAWZONE declares a random number every hour as its result. the gaming applications subscribed to it get the outcome in their website/application for the subscribed Drawevents.

THEDRAWZONE draws 24 DrawEvent outcomes as specified below:

How it happens?

Every hour the inbuilt system triggers process to run the RNG system to generate sets of true random numbers in three steps. The process takes place online and is available to everybody to see it happening live! It’s indeed an absolute transparent system par excellence!

Step 1: The draw system generates a set of two-digit random numbers. This set contains 10 unique numbers.
Step 2: The system randomly selects 5 unique numbers out of the set of 10 numbers.
Step 3: In the final step the system randomly selects the winning number of the drawevent. The winning number is randomly picked by the system from the set of 5 numbers.

Each number is displayed in 2-digit format. The right-side digit (indicated as “R”) and the left-side digit (indicated as “L”). For example in the number 52, “5” is L and “2” is R.

The speed and timing of displaying draw results may slightly vary on different devices and internet speeds.
The last event and the upcoming event are displayed on the THEDRAWZONE website. There is countdown to the next drawevent to keep users informed all the time.
An online report of earlier drawevents is available on the website. One can see the respective results with respective to GMT as well as according to desired country’s time zone.

Tech aspect explained:

TheDrawZone has been tested by the best in the industry. After passing a number of tests over millions of data THEDRAWZONE  has earned a reliability standard. THEDRAWZONE  has accomplished a benchmark which speaks of undisputed fairness. The benchmark has been achieved after successfully passing a series of rigorous testing algorithms. THEDRAWZONE  has employed two level testing. 1^st level testing has been done by the R&D team of Betmacan Limited. The second level of testing has been done by the Itech Labs Australia.

A brief glimpse of the technical tests results has been mentioned below to get an overview of level of tests carried out to make THEDRAWZONE  what it is now.

Chi square test: For testing goodness of fit is used to decide whether there is any difference between the observed (experimental) value and the expected (theoretical) value.

Die-Hard Tests: Quality of a Random Number Generator is measured by a series of Statistical tests known as DieHard Tests. The battery of tests is listed as below:

Birthday spacings: Random points are chosen on a large interval. The spacings between the points should be asymptotically exponentially distributed. The name of this test is based on the birthday paradox.

RESULTS OF BIRTHDAY SPACINGS TEST FOR randomdata2.bin

---

BIRTHDAY SPACINGS TEST : Combined p-values for 9 p-values observed :

Overlapping permutations : This is the OPERM5 test. The sequences of five consecutive random numbers are analysed. There are 120 possible orderings and they should occur with statistically equal probability.

It looks at a sequence of one million 32-bit random integers. Each set of five consecutive integers can be in one of 120 states, for the 5! possible orderings of five numbers. Thus the 5th, 6th, 7th,...numbers each provide a state. As many thousands of state transitions are observed, cumulative counts are made of the number of occurences of each state. Then the quadratic form in the weak inverse of the 120x120 covariance matrix yields a test equivalent to the likelihood ratio test that the 120 cell counts came from the specified (asymptotically) normal distribution with the specified 120x120 covariance matrix (with rank 99). This version uses 1,000,000 integers, twice.

OPERM5 test for file randomdata2.bin

(For samples of 1,000,000 consecutive 5-tuples)

Sample 1

chisquare=103.550925 with df=99; p-value= 0.357251

Sample 2

chisquare=94.200095 with df=99; p-value= 0.617604

---

Ranks of matrices: Form a matrix of over {0,1} from some selected numbers form bits of random number groups. The ranks of matrices are determined and then they are counted.

This is the BINARY RANK TEST for 31x31 matrices. The leftmost 31 bits of 31 random integers from the test sequence are used |to form a 31x31 binary matrix over the field {0,1}. The rank is determined. That rank can be from 0 to 31, but ranks< 28 are rare, and their counts are pooled with those for rank 28.Ranks are found for 40,000 such random matrices and a chisquare test is performed on counts for ranks 31,30,28 and <=28.

This is the BINARY RANK TEST for 32x32 matrices. A random 32x32 binary matrix is formed, each row a 32-bit random integer.The rank is determined. That rank can be from 0 to 32, ranks less than 29 are rare, and their counts are pooled with those for rank 29. Ranks are found for 40,000 such random matrices and a chisquare test is performed on counts for ranks 32,31,30 and <=29.

This is the BINARY RANK TEST for 6x8 matrices. From each of six random 32-bit integers from the generator under test, a specified byte is chosen, and the resulting six bytes form a 6x8 binary matrix whose rank is determined. That rank can be from 0 to 6, but ranks 0,1,2,3 are rare; their counts are pooled with those for rank 4. Ranks are found for 100,000 random matrices, and a chi-square test is performed on counts for ranks 6,5 and (0,...,4) (pooled together).

TEST SUMMARY, 25 tests on 100,000 random 6x8 matrices

These should be 25 uniform [0,1] random variates:

BINARY RANK - 6X8 TEST : Combined p-values for 25 p-values observed :

The OPSO, OQSO and DNA Tests:

• OPSO means overlapping-pairs-sparse-occupancy.
• QQSO means overlapping-quadruples-sparse-occupancy.
• The DNA test considers an alphabet of 4 letters C,G,A,T, determined by two designated bits in the sequence of random integers being tested.

The OPSO test considers 2-letter words from an alphabet of 1024 letters. Each letter is determined by a specified ten bits from a 32-bit integer in the sequence to be tested. OPSO generates 2^21 (overlapping) 2-letter words (from 2^21+1 "keystrokes") and counts the number of missing words---that is 2-letter words which do not appear in the entire sequence.That count should be very close to normally distributed with |mean 141,909, sigma 290. Thus (missingwrds-141909)/290 should be a standard normal variable. The OPSO test takes 32 bits at a time from the test file and uses a designated set of ten consecutive bits. It then restarts the file for the next designated 10 bits, and so on.

OQSO : Overlapping-Quadruples-Sparse-Occupancy

The test OQSO is similar, except that it considers 4-letter words from an alphabet of 32 letters, each letter determined by a designated string of 5 consecutive bits from the test file, elements of which are assumed 32-bit random integers. The mean number of missing words in a sequence of 2^21 four- letter words, (2^21+3 "keystrokes"), is again 141909, with sigma = 295. The mean is based on theory; sigma comes from extensive simulation.

The DNA test considers an alphabet of 4 letters: C,G,A,T,determined by two designated bits in the sequence of random integers being tested. It considers 10-letter words, so that as in OPSO and OQSO, there are 2^20 possible words, and the mean number of missing words from a string of 2^21 (over-lapping) 10-letter words (2^21+9 "keystrokes") is 141909. The standard deviation sigma=339 was determined as for OQSO by simulation. (Sigma for OPSO, 290, is the true value (to three places), not determined by simulation.

---

Count the 1s: 1 bits in each of either successive or chosen bytes are counted. Then the counts are converted to "letters". Now count the occurrences of five-letter "words". This is the COUNT-THE-1''s TEST on a stream of bytes.

Consider the file under test as a stream of bytes (fouper 32 bit integer). Each byte can contain from 0 to 8 1''s, with probabilities 1,8,28,56,70,56,28,8,1 over 256. Now let the stream of bytes provide a string of overlapping 5-letter words, each "letter" taking values A,B,C,D,E. The letters are determined by the number of 1''s in a byte: 0,1,or 2 yield A,3 yields B, 4 yields C, 5 yields D and 6,7 or 8 yield E. Thus we have a monkey at a typewriter hitting five keys with various probabilities (37,56,70,56,37 over 256). There are 5^5 possible 5-letter words, and from a string of 256,000 (over-lapping) 5-letter words, counts are made on the frequencies for each word. The quadratic form in the weak inverse of the covariance matrix of the cell counts provides a chisquare test: Q5-Q4, the difference of the naive Pearson sums of (OBS-EXP)^2/EXP on counts for 5- and 4-letter cell counts.

---

This is the COUNT-THE-1''s TEST for specific bytes.

Consider the file under test as a stream of 32-bit integers.From each integer, a specific byte is chosen , say the left- most: bits 1 to 8. Each byte can contain from 0 to 8 1''s, with probabilitie 1,8,28,56,70,56,28,8,1 over 256. Now let the specified bytes from successive integers provide a string of (overlapping) 5-letter words, each "letter" taking values A,B,C,D,E. The letters are determined by the number of 1''s,in that byte: 0,1,or 2 ---> A, 3 ---> B, 4 ---> C, 5 ---> D, and 6,7 or 8 ---> E. Thus we have a monkey at a typewriter hitting five keys with with various probabilities: 37,56,70, 56,37 over 256. There are 5^5 possible 5-letter words, and from a string of 256,000 (overlapping) 5-letter words, counts are made on the frequencies for each word. The quadratic form in the weak inverse of the covariance matrix of the cell counts provides a chisquare test: Q5-Q4, the difference of the naive Pearson sums of (OBS-EXP)^2/EXP on counts for 5- letter and 4-letter cell counts.

---

Parking lot test: Randomly place unit circles in a 100×100 square. A circle is successfully parked if it does not overlap an existing successfully parked one. After 12,000 tries, the number of successfully parked circles should follow a certain normal distribution. The normal distribution is a probability function that describes how the values of a variable are distributed. It is a symmetric distribution where most of the observations cluster around the central peak and the probabilities for values further away from the mean taper off equally in both directions.

THIS IS A PARKING LOT TEST

In a square of side 100, randomly "park" a car---a circle of radius 1. Then try to park a 2nd, a 3rd, and so on, each time parking "by ear". That is, if an attempt to park a car causes a crash with one already parked, try again at a new random location. (To avoid path problems, consider parking helicopters rather than cars.) Each attempt leads to either a crash or a success, the latter followed by an increment to the list of cars already parked. If we plot n: the number of attempts, versus k: the number successfully parked, we get a curve that should be similar to those provided by a perfect random number generator. Theory for the behavior of such a random curve seems beyond reach, and as graphics displays are not available for this battery of tests, a simple characterization of the random experiment is used: k, the number of cars successfully parked after n=12,000 attempts. Simulation shows that k should average 3523 with sigma 21.9 and is very close to normally distributed. Thus (k-3523)/21.9 should be a standard normal variable, which, converted to a uniform variable, provides input to a KSTEST based on a sample of 10.

PARKING LOT TEST : Combined p-values for 10 p-values observed :

Minimum distance test : Place 8000 points randomly in a 10000×10000 square, then find the minimum distance between the pairs. The square of this distance should be exponentially distributed with a certain mean. In probability theory and statistics, the exponential distribution is the probability distribution that describes the time between events in a Poisson point process, i.e., a process in which events occur continuously and independently at a constant average rate. It is a particular case of the gamma distribution.

THE MINIMUM DISTANCE TEST

It does this 100 times: choose n=8000 random points in a square of side 10000. Find d, the minimum distance between the (n^2-n)/2 pairs of points. If the points are truly independent uniform, then d^2, the square of the minimum distance|should be (very close to) exponentially distributed with mean .995 . Thus 1-exp(-d^2/.995) should be uniform on [0,1) and a KSTEST on the resulting 100 values serves as a test of uniformity for random points in the square. Test numbers=0 mod 5 are printed but the KSTEST is based on the full set of 100 random choices of 8000 points in the 10000x10000 square.

MINIMUM DISTANCE TEST : Combined p-values for 100 p-values observed :

Random spheres test : Select 4000 points randomly in a cube of edge 1000. Center a sphere on each point, whose radius is the minimum distance to another point. The smallest sphere's volume should be exponentially distributed with a certain mean.

THE 3DSPHERES TEST

Choose 4000 random points in a cube of edge 1000. At each point, center a sphere large enough to reach the next closest point. Then the volume of the smallest such sphere is (very close to) exponentially distributed with mean 120pi/3. Thus the radius cubed is exponential with mean 30. (The mean is obtained by extensive simulation). The 3DSPHERES test generates 4000 such spheres 20 times. Each min radius cubed leads to a uniform variable by means of 1-exp(-r^3/30.), then a KSTEST is done on the 20 p-values.

3D SPHERES TEST : Combined p-values for 20 p-values observed :

The squeeze test: Multiply 2³¹ by random floats on (0,1) until 1 is reached. Repeat this 100000 times. The number of floats needed to reach 1 should follow a certain distribution.

This is the SQUEEZE test

Random integers are floated to get uniforms on [0,1). Starting with k=2^31=2147483647, the test finds j, the number of iterations necessary to reduce k to 1, using the reduction | k=ceiling(k*U), with U provided by floating integers from the file being tested. Such j''s are found 100,000 times, then counts for the number of times j was <=6,7,...,47,>=48 are used to provide a chi-square test for cell frequencies.

Overlapping sums test : A long sequence of random floats are generated on (0,1). Add sequences of 100 consecutive floats. The sums obtained should be normally distributed with characteristic mean and variance.

The OVERLAPPING SUMS test

Integers are floated to get a sequence U(1),U(2),... of uniform [0,1) variables. Then overlapping sums, S(1) = U(1) +...+ U(100), S2=U(2)+...+U(101),... are formed.

The S"s are virtually normal with a certain covariance matrix. A linear transformation of the S"s converts them to a sequence of independent standard normals, which are converted to uniform variables for a KSTEST.

OVERLAPPING SUM TEST : Combined p-values for 10 p-values observed :

Runs test: A long sequence of random floats on (0,1) are generated. Then Count ascending and descending runs. The counts should follow a certain distribution.

This is the RUNS test. It counts runs up, and runs down,in a sequence of uniform [0,1) variables, obtained by floating the 32-bit integers in the specified file. This example shows how runs are counted: .123,.357,.789,.425,.224,.416,.95 contains an up-run of length 3, a down-run of length 2 and an up-run of (at least) 2, depending on the next values. The covariance matrices for the runs-up and runs-down are well known, leading to chisquare tests for quadratic forms in the weak inverses of the covariance matrices. Runs are counted for sequences of length 10,000. This is done ten times. Then another three sets of ten.

The craps test: Play 200000 games of craps, counting the wins and the number of throws per game. Each count should follow a certain distribution.

The CRAPS TEST. It plays 200,000 games of craps, counts the number of wins and the number of throws necessary to end each game. The number of wins should be (very close to) a normal with mean 200000p and variance 200000p(1-p), and p=244/495. Throws necessary to complete the game can vary from 1 to infinity, but counts for all>21 are lumped with 21.A chi-square test is made on the no.-of-throws cell counts. Each 32-bit integer from the test file provides the value for the throw of a die, by floating to [0,1), multiplying by 6 and taking 1 plus the integer part of the result.

RESULTS OF CRAPS TEST against Random data

No. of wins : Observed Expected

98532 : 98585.858586

z-score=-0.241, pvalue=0.59518

All Tests : Combined p-value of 313 individual p-values :