Engineering @ JioCinema

Mohit Pal Singh  • Peerlist

A distributed filesystem that never goes down.

A server can locally save a file with hashed filename with decrypted file content. As soon as the save is successful, it encryptes the content of the file with a private key and broadcast it too all the peers in the network which will save it with hashed filename and encrypted file content. The server can get the file on a GET request from it's local storage but in case of data deletion, the server will ask from all the peers in the network for the same file and then locally save it again and serve to the user.

Description:
P2P library: The p2p library has all the methods that are needed for communication to be done between two nodes on the network, this includes messaging, encoding/decoding and transport interface.

Cryptography: each message file is encrypted using a randomly generated 32-bit key. AES-32 is used to encypt the file content while MD5 is used to hash the file name.

Store: Store has all the methods that are required to read and write to the disk. It also provides functionality for writing a stream and copying while encrypting/decrypting from some source to some destination.

Server: Server runs in a go routine which allows saving and fetching of a file, along which it opens a port for accepting remote procedure calls from fellow nodes which can command the same, storing or fetching of a file.

toxicVault

A small Git implementation that's capable of initializing a repository, creating objects in /.git (blobs, trees) and creating commits

Commands:
1. init (- to initialize a leGit repo)
2. cat-file <blob_sha1> (- to read a blob object from it's sha1 hash)
3. hash-object -w (- to create a blob object of the file)
4. ls-tree <tree_sha1> (- to read all contents of leGit tree object (type of object, name, sha1 hash))
5. ls-tree --name-only <tree_sha1> (- to read all the files' names of a leGit tree object)
6. write-tree (- to make a tree object from the files that exists in current directory)
7. commit-tree <tree_object_sha1> -p <parent_commit_sha1> -m <commit_message> (- to write a commit based on the passed tree object with parent commit reference, author's creds and an optional commit message)

leGit

LayDB is a lightweight in-memory key-value database developed in the Go programming language. It is designed to provide fast and efficient storage and retrieval of key-value pairs entirely in memory, catering to the needs of modern, high-performance applications.

Key Features:
1. High Performance: LayDB offers ultra-fast read and write operations by storing all data in memory, eliminating the need for disk I/O.
2. Concurrency: Leveraging Go's powerful concurrency model, LayDB handles multiple concurrent read and write requests with ease, ensuring optimal performance under heavy loads.
3. Scalability: LayDB is designed to scale effortlessly with the growth of your application, accommodating large volumes of data and high throughput.
4. Persistence : LayDB provides an optional persistence layer, allowing data to be saved to disk for durability, ensuring data integrity even in the event of system failure.
5. Simple API: LayDB offers a simple and intuitive API for storing, retrieving, and deleting key-value pairs, making it easy to integrate with existing applications.

Project Goals:
1. Develop a robust and performant in-memory key-value database entirely in Go.
2. Optimize memory usage and performance to ensure efficient operation, even under heavy workloads.
3. Implement comprehensive testing to validate functionality and reliability, ensuring a stable and dependable database.
4. Replace native hashmap with B+ tree implementation.

LayDB

an interactive shell that allows access to a transactional in-memory key/value store.

SlashDB

A simple insurance management application backend using micro-services architecture.

Functional Requirements:
1. Users can view all insurances.
2. Users can view all customers.
3. Users can view all receipts.
4. Users can view all finance team members.
5. Users can add a new insurance.

Non Functional Requirements:
1. customer should not be added to the db until the new insurance is added in the sales_db.
2. receipt should not be generated until the customer is added to customer_db.
3. Upon a sucessful receipt generation, the finance team should immediately get alert via PUB-SUB.

NodeJs microservices demo

Wrote Bookstore management CRUD(Create, Read, Update, Delete) APIs.
Used MYSQL as the database to save and fetch book information.
Used GO for coding and POSTMAN for testing.

Bookstore Management System

This is my first classic ML project. I got inspired from seeing this problem on Kaggle and I decided to work on it. It basically tells the approximate ticket price from the user's  input such as day of arrival, day of departure, source city

Flight Price Prediction -  ML project from Kaggle

This is my first DAPP project. I have chosen the mostly-first-for-everyone TODO-APP and made a Responsive Decentralised Application out of it.
I have used JavaScript with Truffle Framework which provides a suite of tools for developing Ethe

eth_todo_list - Blockchain Todo App Powered by Ethereum Smart Contracts

This is my first project on Genetic Algorithms. I have picked the ever-famous TRAVELLING SALESPERSON PROBLEM that we have all been doing and made a GENETIC ALGORITHM to solve it for me with the help of evolution.
There are several modules t

GENETIC ALGORITHM- design and demonstration

F.R.I.E.N.D.S is an app where BEST FRIENDS can chat individually and in group as well.
*It's just UI/UX*

features-
1) Chat page with 6 tabs to select the chat area among - group and other 5 friends.
2) Bio page with profile picture and con

F.R.I.E.N.D.S ( chat app- just for friends) (UI/UX)

Its a full-fledge web app along with its Electron wrapper and it will soon be getting a makeover with flutter.
From encrypted credentials, auth service, enhanced search results to transaction management. It is as easy as using any big E-com