P2P Zero-Knowledge-Proof based Opensource Social Network - HexHoot

I find that the domain name that I purchased on an impulse, hexhoot.com, would be the ideal name for the p2p social network; both of which I described in some of my previous posts. I have been working on it during my pasttime for about a month now, and I decided to make it opensource. You can have a look at the project using the following link: https://github.com/zenineasa/hexhoot I have attempted to follow all the best development practices as much as I can. I have written tests, and, enabled continuous integration feature in GitHub to run all the tests, lint and copyright checks for the code changes that is being made. I also have captured all the foreseeable tasks in a Trello dashboard. This helps me keep track of all the bugs that I have detected and all the important tasks that need to be completed. There are quite a lot of tasks left to make this bug-free and feature-rich. I hope I will find enough time and motivation to do the same in the coming days.

Estimating the value of Pi using Monte Carlo Method

The very first moment I was shown this, I was amazed. Estimating something using random events is pretty amazing. The first time I did this in MATLAB, but now, I think I will attempt to do the same in JavaScript.

The undelying concept of Monte Carlo Method is to use randomness to determine the value. The method is often used to solve problems that are hard to determine exactly, when there is enough statistical data available.

Let us define a square centered at the origin with side of length 2. A circle centered at the origin is inscribed in this square.


The assumption that we are using in this method is that if we randomly take a few points within the square, the ratio of the number of points that falls within the circle to the total points taken is equal to that of the area of the square and the circle. That is,

Area of square / area of circle = totalRandomSamples / totalPointsInCircle
Let us write a JavaScript program that could do perform this with a huge number of random sample points generated on the go. To check if the generated point lies within the circle or not, we use pythogoras theorem to calculate the distance from the center.

var squareSide = 2;
var circleRadius = squareSide/2; 
var totalRandomSamples = 100000;
var totalPointsInCircle = 0; 
for(var i = 0; i < totalRandomSamples; i++){
    // A random point contained within the square
    var newX = Math.random() * squareSide - squareSide/2;
    var newY = Math.random() * squareSide - squareSide/2;
    // Check if the new coordinate is inside or outside the circle
    if(Math.sqrt(newX * newX + newY * newY) < circleRadius){
        totalPointsInCircle++;
    }
// Area of square / area of circle = totalRandomSamples / totalPointsInCircle
// (squareSide * squareSide) / (pi * circleRadius * circleRadius) = totalRandomSamples / totalPointsInCircle
var pi = squareSide * squareSide * totalPointsInCircle / (circleRadius * circleRadius * totalRandomSamples); 
console.log(pi);

The value of 𝜋 calculated using the method may vary everytime one runs the code. If you wish to improve the accurace, you can increase the number of Random Samples being used. Also, a better algorithm for generating random points may also be used.

I find that the value calculated is usually within 1% accuracy. The fact that this method simply uses cartesian coordinates to calculate 𝜋 is something that blew my mind.

Comments

Popular posts from this blog

Regarding a Covid-19 related project that I worked on a few months ago

Went into the University for the first time

P2P Zero-Knowledge-Proof based Opensource Social Network - HexHoot