<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://wiki.internetcomputer.org/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Vusirikala</id>
	<title>Internet Computer Wiki - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://wiki.internetcomputer.org/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Vusirikala"/>
	<link rel="alternate" type="text/html" href="https://wiki.internetcomputer.org/wiki/Special:Contributions/Vusirikala"/>
	<updated>2026-04-08T20:14:05Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.39.17</generator>
	<entry>
		<id>https://wiki.internetcomputer.org/w/index.php?title=Internet_Computer_wiki&amp;diff=3205</id>
		<title>Internet Computer wiki</title>
		<link rel="alternate" type="text/html" href="https://wiki.internetcomputer.org/w/index.php?title=Internet_Computer_wiki&amp;diff=3205"/>
		<updated>2022-10-17T21:11:08Z</updated>

		<summary type="html">&lt;p&gt;Vusirikala: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;==Welcome!==&lt;br /&gt;
&lt;br /&gt;
This is a general source of information about the &#039;&#039;&#039;Internet Computer (IC)&#039;&#039;&#039;, the world&#039;s fastest and most powerful blockchain network&amp;lt;ref&amp;gt;https://medium.com/dfinity/the-internet-computers-transaction-speed-and-finality-outpace-other-l1-blockchains-8e7d25e4b2ef&amp;lt;/ref&amp;gt;. Created for and by the IC community, topics vary from cryptography, network governance, user experience, tokenomics, developer tutorials and more.&lt;br /&gt;
&lt;br /&gt;
==Introduction to the Internet Computer==&lt;br /&gt;
The Internet Computer is a general-purpose blockchain that hosts [[canister smart contract]]s. It is designed to [[Replace traditional IT with a World Computer|provide a World Computer that can replace traditional IT]] and host a new generation of [[Web3:_The_bull_case_for_the_Internet_Computer|Web3]] services and applications that run solely from the blockchain, without the need for traditional IT. It can also play the role of Web3 orchestrator, by interacting with traditional blockchains.&lt;br /&gt;
&lt;br /&gt;
It has a completely unique design that reflects a ground-up rethink of blockchain architecture and the application of modern cryptography, [https://web.archive.org/web/20150914013643/http://dfinity.io/ which can be traced back to 2015]. It was built by the largest [https://dfinity.org/team ongoing R&amp;amp;D effort in crypto], which has employed many notable cryptographers, computer science researchers and engineers. The blockchain underwent genesis in May 2021 and became part of the public internet.&lt;br /&gt;
&lt;br /&gt;
The Internet Computer blockchain&#039;s protocols leverage novel [[chain key cryptography]] to combine multiple [[Limitless_Scaling#Subnet Architecture|subnet blockchains]] into a single blockchain. This allows it to [https://en.wikipedia.org/wiki/Scalability#Horizontal_(scale_out)_and_vertical_scaling_(scale_up) horizontally scale] the total volume of hosted [[canister smart contract]], and their computations and data, without limit. These smart contracts run at web speed, and with web-levels of efficiency, and uniquely, thanks to the blockchain architecture enabled by chain key crypto, can process HTTP requests and directly and securely serve interactive web experiences to the end-users of web3 services, without need for trusted intermediaries (whereas on other blockchains, the web experience users interact with is generally built on centralized, insecure and trusted servers or cloud computing services).&lt;br /&gt;
&lt;br /&gt;
Through these kinds of unique capabilities, the Internet Computer provides a platform that can be used to build mass market web3 services that run 100% on-chain, without any need for traditional IT, such as web servers and databases running on cloud computing services. The longer-term objective is that the Internet Computer will completely replace traditional IT, creating a &#039;&#039;blockchain singularity&#039;&#039;, in which everything runs fully on-chain in powerful new forms where it is unstoppable and cannot be hacked.&lt;br /&gt;
&lt;br /&gt;
The development of the Internet Computer has heralded numerous notable technological developments, such as [[chain key cryptography]] and programming languages such as [https://wiki.internetcomputer.org/wiki/Motoko Motoko]. In another notable advance, the Internet Computer hosts an advanced [https://en.wikipedia.org/wiki/Decentralized_autonomous_organization DAO] within its protocols, called the [[Network Nervous System]], which provides the community with direct control over network governance, and can upgrade the protocol running on its network nodes, without requiring the network to fork. The network&#039;s utility token is ICP (see [[Roles of the ICP utility token]]).&lt;br /&gt;
&lt;br /&gt;
A recent new technological advance has extended the Internet Computer&#039;s [[chain key cryptography]] protocols. This has enabled smart contracts hosted on the Internet Computer to directly interact with other blockchains, without need for dangerous centrally-controlled bridges or wrapping (see [[trustless multi-chain web3 using the IC]], and [[Extend Bitcoin, Ethereum and other blockchains|extending Bitcoin, Ethereum and other blockchains]]).&lt;br /&gt;
&lt;br /&gt;
For example, a canister smart contract hosted on the Internet Computer can create bitcoin addresses, and directly send and receive bitcoins on the Bitcoin ledger as though it were hosted by the Bitcoin network itself. This is possible because chain key crypto enables blockchains to create public &amp;quot;chain keys&amp;quot;, for which their nodes can create corresponding signatures. Recent work has now made it possible to create ECDSA chain keys. Since [https://en.wikipedia.org/wiki/Elliptic_Curve_Digital_Signature_Algorithm ECDSA] is the signature scheme used by most other blockchains, this means the Internet Computer can create TX on other blockchains.&lt;br /&gt;
&lt;br /&gt;
Future work will enable its smart contracts to directly interact with other important blockchains such as [https://ethereum.org/en/ Ethereum]. This also leverages other important features such as [[HTTPS outcalls]]. As a consequence, many believe that the Internet Computer will play the role of an orchestration layer that combines different blockchains in the web3 environment, and helps combine them with off-chain services and systems, such as Web 2.0 services and enterprise systems, in a trustless way.&lt;br /&gt;
&lt;br /&gt;
===Popular places to start===&lt;br /&gt;
* [https://www.youtube.com/watch?v=IfM3I8pudFs&amp;amp;t=327s Internet Computer overview video from 2022 IC hackathon]&lt;br /&gt;
* [https://www.youtube.com/watch?v=IfM3I8pudFs June 2022 IC hackathon, full launch video]&lt;br /&gt;
* [https://dfinity.org/icig.pdf Internet Computer Infographic (PDF)]&lt;br /&gt;
&amp;lt;!-- Link is going to nowhere. Should be updated if target is clear. Uncommented for now.&lt;br /&gt;
* [https://internetcomputer.org/education#online-courses/ Internet Computer: Online Courses]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
* [[Glossary]]&lt;br /&gt;
&lt;br /&gt;
===For a general audience===&lt;br /&gt;
* [[Internet Computer overview]]&lt;br /&gt;
* [[Internet Computer vision]]&lt;br /&gt;
* [https://dfinity.org/roadmap/ Internet Computer roadmap]&lt;br /&gt;
&lt;br /&gt;
===For a more technical audience===&lt;br /&gt;
* [https://eprint.iacr.org/2022/087 &amp;quot;Internet Computer for Geeks&amp;quot; paper]&lt;br /&gt;
* The [https://dfinity.org/howitworks &amp;quot;How it works&amp;quot; series] with videos and in-depth articles on various topics.&lt;br /&gt;
* [https://www.reddit.com/r/dfinity/comments/ozboyi/megathread_technical_amas/ Technical AMAs on Reddit by different IC and DFINITY teams]&lt;br /&gt;
&lt;br /&gt;
== Internet Identity Introduction == &lt;br /&gt;
One of the core benefits of building on the Internet Computer is that end users do not need to pay fees or use tokens to access and use dapps. As an alternative to authenticating from a wallet, users can authenticate with an Internet Identity. Learn more information about Internet Identity (II), a blockchain authentication framework supported by the Internet Computer:&lt;br /&gt;
&lt;br /&gt;
* [[What is Internet Identity]]&lt;br /&gt;
* [[How to create an Internet Identity]]&lt;br /&gt;
* [[Internet Identity technical overview]]&lt;br /&gt;
* [https://identity.ic0.app/ Internet Identity dapp]&lt;br /&gt;
&lt;br /&gt;
==IC for Dapp Users ==&lt;br /&gt;
&lt;br /&gt;
If you use or are interested in using dapps on the Internet Computer, this section will help you understand the user experience benefits of the IC, how to use Internet Identity, or find more IC dapps.&lt;br /&gt;
&lt;br /&gt;
Examples:&lt;br /&gt;
* [[Introduction to the Internet Computer for dapp users]]&lt;br /&gt;
* [[Index of dapps on the Internet Computer]]&lt;br /&gt;
&lt;br /&gt;
See more in [[Internet Computer for dapp users]]&lt;br /&gt;
&lt;br /&gt;
== IC for ICP Token-holders, Stakers, and Neuron Holders==&lt;br /&gt;
&lt;br /&gt;
The Internet Computer is governed by on-chain governance system called the Network Nervous System (NNS). To participate on governance, users need to stake ICP tokens. This section will explain how the NNS works, ICP tokens, staking, voting, rewards, and options for managing one&#039;s ICP.&lt;br /&gt;
&lt;br /&gt;
Examples:&lt;br /&gt;
* [[ICP token]]&lt;br /&gt;
* [[Tutorials for acquiring, managing, and staking ICP]]&lt;br /&gt;
* [[Staking, voting and rewards]]&lt;br /&gt;
* [[Governance of the Internet Computer]]&lt;br /&gt;
* [[Network Nervous System]]&lt;br /&gt;
* [[Total supply, circulating supply, and staked_ICP]]&lt;br /&gt;
* [[NNS neuron operations related to maturity]]&lt;br /&gt;
&lt;br /&gt;
See more in [[Internet_Computer_token-holders,_investors_and_neuron_holders|Internet Computer token-holders, investors, and neuron holders]].&lt;br /&gt;
&lt;br /&gt;
== IC for Smart Contract and Dapp Developers ==&lt;br /&gt;
&lt;br /&gt;
The Internet Computer (IC) is a new platform for executing smart contracts. This section contains information for developers, including links to documentation, developer forums, and relevant dashboards.&lt;br /&gt;
&lt;br /&gt;
Examples:&lt;br /&gt;
* [[Canisters (dapps/smart contracts)]]&lt;br /&gt;
* [https://smartcontracts.org/ Developer documentation on smartcontract.org]&lt;br /&gt;
* [https://forum.dfinity.org/ IC community developer forum]&lt;br /&gt;
&amp;lt;!--* [[Index of libraries for Internet Computer development]]--&amp;gt;&lt;br /&gt;
&amp;lt;!--* [[Best practices for a high traffic dapp launch]]--&amp;gt;&lt;br /&gt;
* [[Bitcoin integration]]&lt;br /&gt;
* [[SNS Tokenization Considerations]]&lt;br /&gt;
* [[Web Speed]]&lt;br /&gt;
* [[Web Serving]]&lt;br /&gt;
* [[Limitless Scaling]]&lt;br /&gt;
* [[Users interact with dapps without tokens]]&lt;br /&gt;
* [[Parallelism]]&lt;br /&gt;
* [[Proof of Personhood]]&lt;br /&gt;
&lt;br /&gt;
If you&#039;ve been programming smart contracts on Ethereum before, you should read [[The Internet Computer for Ethereum Developers]].&lt;br /&gt;
&lt;br /&gt;
See more in [[Internet Computer for smart contract and dapp developers]].&lt;br /&gt;
&lt;br /&gt;
== IC for the Curious, Researchers and Blockchain Enthusiasts ==&lt;br /&gt;
&lt;br /&gt;
This section is for those interested in how the Internet Computer works under the hood. It touches many different subject areas from cryptography, consensus protocols, virtual machines, operating systems, networking, distributed systems, etc.&lt;br /&gt;
&lt;br /&gt;
Examples:&lt;br /&gt;
* [https://dfinity.org/howitworks/ How the Internet Computer Works]&lt;br /&gt;
* [https://dashboard.internetcomputer.org/ Internet Computer dashboard] &lt;br /&gt;
* [[Internet Computer performance]]&lt;br /&gt;
* [[DFINITY Foundation]]&lt;br /&gt;
* [[Bitcoin integration]]&lt;br /&gt;
* [[Third-party security audits]]&lt;br /&gt;
* [[Networking]]&lt;br /&gt;
* [[ICP technical design documents]]&lt;br /&gt;
&lt;br /&gt;
== For Node Providers == &lt;br /&gt;
Node providers invest in and operate node hardware, which powers the Internet Computer with processing and storage capacity. Running these nodes in data centers provides the high performance and the cost-effectiveness of the Internet Computer. Every node provider is allowed a limited amount of nodes.&lt;br /&gt;
* [[Node Provider Onboarding]]&lt;br /&gt;
* [[IC OS Installation Runbook - Dell Poweredge]]&lt;br /&gt;
* [[IC OS Installation Runbook - Supermicro]]&lt;br /&gt;
* [[Storage Runbook]]&lt;br /&gt;
* [[Node rewards]]&lt;br /&gt;
&lt;br /&gt;
== Technical Working Groups == &lt;br /&gt;
* [[Identity &amp;amp; Authentication]]&lt;br /&gt;
* [[Developer Tooling]]&lt;br /&gt;
* [[Ledger &amp;amp; Tokenization]]&lt;br /&gt;
* [[Scalability &amp;amp; Performance]]&lt;br /&gt;
&lt;br /&gt;
== FAQs, Tutorials, and How-tos==&lt;br /&gt;
Tutorials are guided introductions to user stories, intended for first-time users and characterized by a shallow learning curve. How-Tos are step-by-step instructions for specific, narrow goals.&lt;br /&gt;
&lt;br /&gt;
===FAQs===&lt;br /&gt;
* [[FAQ]]&lt;br /&gt;
&lt;br /&gt;
===Best Practices===&lt;br /&gt;
Example:&lt;br /&gt;
* [[Managing ICP holdings]]&lt;br /&gt;
* [[Managing Internet Identity]]&lt;br /&gt;
* [[Maximizing Voting and NNS Rewards]] &lt;br /&gt;
See more in [[Best Practices]]&lt;br /&gt;
&lt;br /&gt;
=== Tutorials ===&lt;br /&gt;
Example:&lt;br /&gt;
* [[Tutorials for acquiring, managing, and staking ICP]]&lt;br /&gt;
* [[How-To: Claim neurons for seed participants]]&lt;br /&gt;
* [[How-To: Create an NNS motion proposal]]&lt;br /&gt;
* [[How-To: Set your neuron to follow another neuron]]&lt;br /&gt;
* [[How-To: Updating neuron following via quill]]&lt;br /&gt;
&lt;br /&gt;
See more in [[How-Tos]].&lt;br /&gt;
&lt;br /&gt;
==Contributing to the Wiki==&lt;br /&gt;
&lt;br /&gt;
=== How to contribute ===&lt;br /&gt;
Anyone can read the wiki. You can also edit pages, all you need to do is [https://wiki.internetcomputer.org/wiki/Special:CreateAccount create an account]. See more in [[Contributing to the wiki]].&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&lt;br /&gt;
test&lt;/div&gt;</summary>
		<author><name>Vusirikala</name></author>
	</entry>
	<entry>
		<id>https://wiki.internetcomputer.org/w/index.php?title=Proof_of_Personhood&amp;diff=3202</id>
		<title>Proof of Personhood</title>
		<link rel="alternate" type="text/html" href="https://wiki.internetcomputer.org/w/index.php?title=Proof_of_Personhood&amp;diff=3202"/>
		<updated>2022-10-12T19:27:31Z</updated>

		<summary type="html">&lt;p&gt;Vusirikala: Created page with &amp;quot;= This page is still work in progress =  == People Parties == People parties&amp;lt;ref&amp;gt;https://medium.com/dfinity/ultimate-decentralization-using-virtual-people-parties-that-deliver...&amp;quot;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;= This page is still work in progress =&lt;br /&gt;
&lt;br /&gt;
== People Parties ==&lt;br /&gt;
People parties&amp;lt;ref&amp;gt;https://medium.com/dfinity/ultimate-decentralization-using-virtual-people-parties-that-deliver-proof-of-personhood-at-de575522c80&amp;lt;/ref&amp;gt; are a mechanism for obtaining proof of personhood (also referred to as proof of humanity) built on and for the Internet Computer. &lt;br /&gt;
&lt;br /&gt;
Each people party takes place at one specific point in time. Prior to that time, each prospective participant commits to a location that they will visit for the time of the party. At the beginning of the party, participants are assigned to small, random subgroups, and meet in a real-time video call with other participants assigned to the same group. The video call, however, does not show the participants’ faces; instead, participants show their surroundings, proving that they are at the place they committed to. As locations chosen by different participants must have a certain minimum distance, and no participant can be physically present at two locations simultaneously, the proof of personhood even guarantees the uniqueness of the validated persons.&lt;br /&gt;
&lt;br /&gt;
The main purpose of people parties is democratization. Each validated participant can designate a neuron in the network nervous system that receives increased voting power; this improves the relative voting power of the “many” vs. the “heavy”. It also provides additional voting rewards to all validated participants, which further motivates people to participate in the parties. The validated personhood also benefits the Internet Computer ecosystem more broadly: Open Internet Systems, which are dapps that are controlled by a decentralized governance system, will be able to profit from the improved decentralization similarly to the Internet Computer itself. And any dapp will be able to use the validation information in order to, e.g., differentiate between bots and actual human users.&lt;br /&gt;
&lt;br /&gt;
== Party Flow == &lt;br /&gt;
&lt;br /&gt;
== Personhood Score ==&lt;br /&gt;
Each identity in the internet computer is assigned a personhood score. If an identity hasn’t participated in any people party, its personhood score is 0. As the identity participates in people parties, its personhood score increases. This personhood score can potentially be used to determine voting power of an identity in many elections/voting programs.&lt;br /&gt;
&lt;br /&gt;
===== Requirement #1 ===== &lt;br /&gt;
An Internet Computer user is naturally inclined to increase his voting power. He is therefore motivated to create many identities and attend a people party with each identity. This gives him control of many identities with a positive personhood score, and thereby a higher voting power. We would like to avoid this. We would like to design the personhood score in such a way that an IC user is motivated to attend each people party with the same identity rather than creating a new identity for each people party. &lt;br /&gt;
&lt;br /&gt;
===== Requirement #2 ===== &lt;br /&gt;
Suppose Alice attended many parties with her identity, and Bob attended only one recent party. Alice and Bob’s personhood scores should still be close. Alice should not have a significant advantage by attending many parties. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===== Failed Attempt #1 =====&lt;br /&gt;
Suppose personhood score of an identity = 1 if the identity is successfully validated in at least one party. This personhood score violates our Requirement #1. &lt;br /&gt;
&lt;br /&gt;
===== Failed Attempt #2 =====&lt;br /&gt;
Suppose personhood score of an identity = number of parties in which the identity is successfully validated. This personhood score violates our Requirement #2. &lt;br /&gt;
&lt;br /&gt;
===== Successful Attempt =====&lt;br /&gt;
After a party ends, the personhood score of an identity is composed of three components: &lt;br /&gt;
* Recent party result (RPR):   This value is 1 if the identity is accepted to be a person in the recent party. The value is 0 if the identity did not participate or is rejected in the recent party. &lt;br /&gt;
* Decay function of previous personhood score: The decay function is a monotonically non-increasing function. It is computed on the old personhood score (the score before the recent party started). The decay lets us give more weightage to the validation in the recent party over the previous parties. &lt;br /&gt;
* Bonus reward function: If the identity is accepted in the most recent party and is successfully accepted in some parties before, a bonus reward is given to the identity. This bonus component is added to incentivize IC users to participate in all the parties using the same identity rather than creating a different identity for each party. &lt;br /&gt;
&lt;br /&gt;
Suppose the personhood score of an identity is PS&amp;lt;sub&amp;gt;old&amp;lt;/sub&amp;gt; before a party starts. The trust score PS&amp;lt;sub&amp;gt;new&amp;lt;/sub&amp;gt;  of the identity after the party ends is calculated as follows. &lt;br /&gt;
&lt;br /&gt;
PS&amp;lt;sub&amp;gt;new&amp;lt;/sub&amp;gt; = RPR * (1 + bonus(PS&amp;lt;sub&amp;gt;old&amp;lt;/sub&amp;gt;))  +  decay(PS&amp;lt;sub&amp;gt;old&amp;lt;/sub&amp;gt;)&lt;br /&gt;
&lt;br /&gt;
Where Recent Party Result (RPR) is 1 iff the identity is accepted in the party.&lt;br /&gt;
&lt;br /&gt;
Through empirical evidence, we found that &lt;br /&gt;
* bonus(x) = log&amp;lt;sub&amp;gt;10&amp;lt;/sub&amp;gt;(1 + 0.25 * x) and &lt;br /&gt;
* decay(x) = log&amp;lt;sub&amp;gt;10&amp;lt;/sub&amp;gt;(1 + x) &lt;br /&gt;
work pretty well. That is, &lt;br /&gt;
&lt;br /&gt;
	PS&amp;lt;sub&amp;gt;new&amp;lt;/sub&amp;gt; = RPR * (1 + log&amp;lt;sub&amp;gt;10&amp;lt;/sub&amp;gt;(1 + 0.25 * PS&amp;lt;sub&amp;gt;old&amp;lt;/sub&amp;gt;))  +  log&amp;lt;sub&amp;gt;10&amp;lt;/sub&amp;gt;(1 + PS&amp;lt;sub&amp;gt;old&amp;lt;/sub&amp;gt;)&lt;br /&gt;
&lt;br /&gt;
===== Example =====&lt;br /&gt;
Consider 2 scenarios. &lt;br /&gt;
* Scenario A: The user enters each party with the same identity, and the user is accepted in each of the parties. &lt;br /&gt;
* Scenario B: The user enters each party with a new identity, and the user is accepted in each of the parties. &lt;br /&gt;
&lt;br /&gt;
Let us compare the personhood scores of the user in each of the scenarios. In Scenario B, we sum up the personhood scores of all the identities controlled by the user. &lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|+ Comparison of personhood scores of a user in Scenarios A &amp;amp; B&lt;br /&gt;
|-&lt;br /&gt;
!  !! Scenario A !! Scenario B&lt;br /&gt;
|-&lt;br /&gt;
| Initial Score || 0 || 0&lt;br /&gt;
|-&lt;br /&gt;
| After 1st party || 1 || 1&lt;br /&gt;
|-&lt;br /&gt;
| After 2nd party || 1.398 || 1.301&lt;br /&gt;
|-&lt;br /&gt;
| After 3rd party || 1.510 || 1.415&lt;br /&gt;
|-&lt;br /&gt;
| After 4th party || 1.539 || 1.462&lt;br /&gt;
|-&lt;br /&gt;
| After 5th party || 1.546 || 1.482&lt;br /&gt;
|-&lt;br /&gt;
| After 6th party || 1.548 || 1.491&lt;br /&gt;
|-&lt;br /&gt;
| After 7th party || 1.548 || 1.494&lt;br /&gt;
|-&lt;br /&gt;
| After 8th party || 1.548 || 1.496&lt;br /&gt;
|}&lt;/div&gt;</summary>
		<author><name>Vusirikala</name></author>
	</entry>
</feed>