Steve is a hard working and self-motivated individual. He enjoys problem solving, as well as design and development of new and existing applications. Versed in most standard programming languages, Steve is comfortable in heterogeneous environments from large scale distributed systems to mobile applications. Steve`s current area of expertise is with blockchain enabled distributed storage systems. Recent Projects: • Architected two Distributed Storage System prototypes built on a network of 15 Raspberry Pi-3 nodes and 3 Ubuntu servers. Automated installers/updaters were created for both Storj and IPFS private networks. (For Storj, centralized Bridge and Complex services were also created.) IPFS won-out as a final solution due to requirements for a robust CDN with DRM (i.e. Widevine). • Developed two MEAN stack applications (using Knockout vs Angular). One for a blockchain integrated video streaming application. (For Storj, this involved registering Bridge users and creating buckets via the Storj API.) The other application was for a multi-tiered ICO fund raising platform. • Developed two blockchains based on PoST and PoWT. The binary-chain solution allowed for IPFS nodes to mine on the PoWT chain and exchange mined coins for PoST coins. (The IPFS miner is still a WIP, as we made a shift to Ethereum ERC20 tokens to accommodate the ICO, and will have to implement ERC20 on the miner, as well.) ©

Computer science student from India doing post graduation in India. ©

Eu amo pão! ©

The idea of mathematics was always that with simple principles complex things could be explained. This idea has somewhat lost in logic, you need a very complex system to explain something simple. I am developing a very simple logic, that consists only of context free PI2 sentences. Every theorem is a comparison of two non-deterministic Turing equivalent expressions. I show that is possible to directly reason with such system and that it can be understood by everyone that can program a little bit. It is not possible to directly reason (without additional logic) about Halting problems. The leap between two Halting problems is too big. It is also not possible to reason about comparison of two deterministic programs. The leap between two theorems is still too big. However, with comparison of two non-deterministic programs, things become possible. ©

Sysadmin/DevOps/fix it! ©

Freelancing developer for Front End`s based on PHP, Java or Javascript. On smaller projects scope: Fullstack WordPress or static websites development. ©