Mining with zero knowledge proof

3.

1. League of heroes

League of heroes, also known as lol, China's LPL has won the championship of the world finals for two consecutive years, which makes the players who love League of heroes start a new journey again, which makes the popularity of lol in China set off a wave of upsurge. Although lol has been 10 years, the popularity is not as good as before, but it is not comparable to the popularity of other networks

2, ngeons and warriors

the game of ngeons and warriors is called DNF for short. DNF has been tested for 11 years since 2008. The unique abyss mode in the game is not found in other online games. It is also a time when the public players are excited to brush the abyss, but now DNF graates have many activities and awards, So many players have abandoned DNF one by one, but there are still a lot of civilian players, the heat is also leverage drop

3, fortress night

fortress night is a third person shooting game, which has landed on the host platform, PC platform, mobile game platform and NS platform. So the platform has this game, the heat is incomparable to other design games. Chicken eating mode in the game is also very popular

4, crossing the line of fire

crossing the line of fire is also known as cf. in 2007, the game was tested internally in China, but the popularity was very hot when it was just launched. At that time, no game known as 300 million mouse could catch up with CF, but CF has experienced more than ten years. Since the introction of heroic weapons, the popularity has slowly started to decline, It takes 888 yuan to get a hero weapon, which makes many civilian players stop. Moreover, the performance difference between civilian weapons and hero weapons is too big, which makes many players retreat

5. World of Warcraft (including nostalgic clothes)

world of Warcraft is the oldest game. Warcraft also launched the nostalgic clothes in August of 19. The popularity of the nostalgic clothes just launched in this game has exceeded its own popularity several times. All servers of the nostalgic clothes need to queue up to enter the game on weekends, That is to say, how many new players and old players come back to experience the past

6, survival of the Jedi

survival of the Jedi game was only tested in March of 17. Survival of the Jedi game has experienced steam's weekly sales champion, the champion of 55 consecutive weeks. You know, there are 52 consecutive weeks in a year, that is to say, survival of the Jedi has been the champion of sales for one consecutive year, and no game of steam's weekly sales champion can be more than four consecutive weeks, And the Jedi survival game has this amazing history

7, ff14

Final Fantasy 14 this game was officially tested in China in 2014. This game has experienced the best new MMO Game Award, the most popular MMORPG award, the best picture award, the best sound effect award and the must play game award. Can be said to be a very powerful online game

8. Anti terrorism Elite: Global offensive

a first person shooting game jointly developed by valve and hidden path entertainment was officially launched in Europe and the United States on August 21, 2012, and the national service press conference was held in Beijing on April 11, 2017. The game is the fourth work of the anti terrorist Elite Series (excluding Neo, online and other derivative works)

9, legend of hearthstone

Legend of hearthstone is a set exchange card game. The game background is set to 9 different hero classes in Blizzard's Warcraft series. What the players need to do is to form a strong card group to defeat the opponent's card group

10, watch vanguard

watch vanguard is a first person shooting game developed by blizzard. Every hero in the game is his own weapon and skill, and the innovative shooting game has attracted many Blizzard players, especially the painting style in the game

4. It depends on what kind of entity you are. Many blockchain combined with entity instry can apply several characteristics of blockchain. Decentralization, traceability, openness, fairness, permanence, irreversibility and security can be used by instry. Blockchain + entity application development (e-micro) 138

5. In the early 1980s, Goldwasser and others proposed the concept of zero knowledge proof. Essentially, zero knowledge proof is a protocol. The so-called protocol is a series of steps taken by two or more participants to complete a specific task, including the following three characteristics: 1. Protocol is an orderly process from beginning to end, and each step must be executed in turn, 2. The protocol needs at least two participants. One person can complete a task by executing a series of steps, but it does not constitute an agreement. 3. A task must be completed by executing the protocol. Zero knowledge proof must include two aspects, one is the prover, the other is the prover, The other party is the verifier. The verifier tries to prove to the verifier that an assertion is correct, or the verifier has some knowledge, but does not disclose any useful information to the verifier. Zero knowledge proof has been widely used in cryptography, especially in authentication protocol and digital signature, People use digital signature to design a large number of excellent algorithms. A story about the cave is used to explain zero knowledge. There is a secret in the cave. People who know the spell can open the secret door between C and D. for others, both channels are dead ends. Peggy knows the secret of the cave. She wants to prove this to victor, Here's how she got Victor to believe it: (1) Victor stood at point A. (2) Peggy walked all the way into the cave to point C or D. (3) after Peggy disappeared in the cave, Victor walked to point B. (4) Victor called to Peggy to come out from the left passage or from the right passage. (5) Peggy agreed, Peggy and Victor repeat steps (1) to (5) n times. Suppose Victor has a camera that can record what he sees. He records Peggy disappearing in the cave and the time when he shouts Peggy to come out of his chosen place, Record Peggy coming out. He records all n experiments. If he shows these records to Carol, will she believe that Peggy knows the spell to open the secret door? Without knowing the spell, what if Peggy and Victor agreed in advance what Victor would shout? Peggy will be sure to go into the path where Victor told her to come out, and then she can come out on the path where Victor asked her to come out without knowing the spell. Maybe they don't do that. Peggy goes into one of the channels, and Victor sends out a random request. If Victor guesses right, great. If he guesses wrong, they will delete the experiment from the video, Victor can get a record, which accurately shows the same sequence of events as the actual proof that Peggy knows the spell. This shows two things. One is that Victor can't make the third party believe the validity of the proof; Second, it proves that the protocol is zero knowledge. In the case that Peggy doesn't know the mantra, Victor obviously can't get any information from the record. However, because he can't distinguish between a real record and a forged record, Victor can't get any information from the actual proof - it must be zero knowledge, Peggy does not reveal any secret knowledge in the process of proving to victor, which is called zero knowledge

6. In the absence of sufficient (or even no) basis, the calculation method of guessing an event (password reverse translation) is a guess without any basis, but the calculation method of guessing is proved to be correct, which is zero knowledge proof
in Goldwasser's zero knowledge proof, there must be interaction between the prover and the verifier, which is called "interactive zero knowledge proof". In the late 1980s, Blum and others further proposed the concept of "non interactive zero knowledge proof", using a short random string instead of the interactive process and realizing zero knowledge proof. One of the important applications of non interactive zero knowledge proof is the large-scale network which needs to execute a large number of cryptographic protocols
in zero knowledge proof, a person (or device) can prove that he knows the secret without revealing any secret.. if zero knowledge proof can be used for verification, Will be able to effectively solve many problems..

proof materials
with relevant zero knowledge proof materials:
zero knowledge proof is not proof in terms of mathematical feeling, because there is a fixed possibility P in any zero knowledge proof Peggy can provide the right response to the challenge, that is, she does not know the key. However, if the test is repeated N, timing fraud is reced, and the probability of Peggy fraud is reced to an arbitrary level by increasing the number of test winners

example strategy
Peggy's public key is a large chart, which we will call G. Peggy was organized by G some time ago, and widely then published it. Because she specifically made it for the purpose, Peggy knew about a Hamilton cycle. Peggy will prove her identity to the winner and she knows a Hamilton cycle in G. Even if G is public information, no one can do it, because no one knows a Hamiltonian cycle of G, and it is a difficult problem to find Hamiltonian cycle in graph (see NP completeness)
however, Peggy can't simply tell the winner Hamilton's cycle, because then the winner (or eavesdropper) can pretend to be Peggy. Peggy can't reveal any information in any period, because eavesdroppers may be able to collect information in several different occasions and integrate it, so that eavesdroppers have enough information to play the role of Peggy
to prove her identity, Peggy and the winner play several circles in the following competitions:
Peggy marks the G endpoint with a random number. The edges may then be represented as a pair of these numbers. She lists g edges, and encrypts each edge with an additional key. She then sends the coded edge to the winner
the winner flips the coin
* if the coin comes over the head, Peggy surrenders the key to the random number and maps from the endpoint. The winner decodes the edge and then verifies that the encrypted edge is sent in step 1 to actually do graph. G and no other graph
* if the coin comes over the tail, Peggy surrenders the key only for actually forming the edge of Hamilton's cycle. Winners decode these edges and verify that they do form the right length of cycle
the impostor; Pamela ') Be able to manage to play Peggy, and have a 50% chance of successfully bluffing the winner in any particular round. There are two possible play strategies. Pamela can send Peggy's graph. G to code. In this case, she escaped detection if the winner threw his head; She revealed that it was coded, and the winner verified that the chart was indeed G. But if the winner throws his tail, Pamela is caught. The set of keys she was asked to reveal constituted a Hamilton cycle g edge, and she could not do that because she did not know one
another strategy Pamela can follow is to prepare some other chart. She knows that the h of a Hamilton cycle is coded. She is safe in this case if the winner throws his tail; She reveals the cycle, and, because the winner never looks at the margin of the remainder, he never learns that the chart is h and not g. But if the winner throws the head, Pamela is asked to reveal the whole chart, and the winner sees that this is not g
by playing this game for 20 rounds, the winner can rece the possibility of being fooled by Pamela to only 1 / 2. By playing more circles, the winner can rece the possibility of craving
information revealed by Peggy provides winner any information in all not g's Hamilton cycles. Look at this, notice that the winner can make transcripts of the game without talking to Peggy at all. He was able to select the sequence head and tail, and then prepare the hypothetical reply from Peggy, who had never known Hamilton's cycle, by engaging the appropriate impostor strategy in each circle. Transcripts, and it doesn't contain, cable legitimate information about Peggy's identity. Peggy proved her identity not because she could base her answer on the right one, but because she could base her answer on the right one, she didn't know what the problem would be
the so-called zero knowledge proof refers to a method that the demonstrator does not disclose any information when proving his own identity, and the verifier can not get any private information of the demonstrator, but can effectively prove the identity of the other party. It seems a bit awkward. I'll give you two examples to understand
several examples of zero knowledge proof [original]

proof examples
1) a wants to prove to B that he has the key of a room, assuming that the room can only be opened with the key, but no other method can. At this time, there are two methods:
① a shows B the key, and B uses the key to open the lock of the room, so as to prove that a has the correct key of the room
② B confirms that there is an object in the room. A opens the door of the room with his own key, and then shows the object to B, so as to prove that he really has the key of the room
the following method belongs to zero knowledge proof. The advantage is that in the whole process of proof, B can't see the appearance of the key, so as to avoid the leakage of the key
2) a owns B's public key. A has never seen B, but B has seen a picture of A. one day, two people meet and B recognizes a, but a is not sure whether the person in front of him is B. at this time, B has two ways to prove to a that he is B
① B gives its private key to a. a encrypts some data with the private key, and then decrypts it with B's public key. If it is correct, it proves that the other party is B
② a gives a random value, B encrypts it with its own private key, and then gives the encrypted data to a, a decrypts it with B's public key, and if the original random value can be obtained, it proves that the other party is B
the latter method belongs to zero knowledge proof
3) there is a ring-shaped corridor with a gap. The exit and entrance are very close (within the eye distance), but there is a door in the middle of the corridor that can only be opened with a key. A has to prove to B that he has the key to the door. Using zero knowledge proof, B watches a enter the corridor from the entrance, and then walk out of the corridor from the exit. At this time, B does not get any information about the key, but it can prove that a has the key.

7. Zero knowledge proof was proposed by Goldwasser and others in the early 1980s. It means that the verifier can make the verifier believe that a certain conclusion is correct without providing any useful information to the verifier. Zero knowledge proof is essentially an agreement involving two or more parties, that is, a series of steps that two or more parties need to take to complete a task. The prover proves to the verifier and makes him believe that he knows or owns a message, but the prover can't disclose any information about the message to the verifier. Lots of facts have proved that zero knowledge proof is very useful in cryptography. If zero knowledge proof can be used for verification, many problems can be solved effectively

8. In cryptography, zero knowledge proof is used to prove a thing without letting the other party know any information. The example is identification. Or we can use evolutionary computation to generate a program to judge the end game of chess. The "proct" of evolutionary computation is usually a program (algorithm) that can't be understood by human beings. If we can know through experiments and probability analysis that this program can completely answer the end game with a very low probability (probably lower than the meteorite hitting your home), Then we can really believe that this program has the ability to judge the end game, and can use it when we can't understand but trust it

according to my personal understanding and popular point (personal statement):
in the case of insufficient (or even no) basis, the calculation method of guessing an event (password reverse translation) is a guess without any basis, but the calculation method of guessing is proved to be correct, which is zero knowledge proof.

9. " Zero knowledge proof & quot- Zero knowledge proof was proposed by S. Goldwasser, S. Micali and C. rackoff in the early 1980s. It means that the verifier can make the verifier believe that a certain conclusion is correct without providing any useful information to the verifier. Zero knowledge proof is essentially an agreement involving two or more parties, that is, a series of steps that two or more parties need to take to complete a task. The prover proves to the verifier and makes him believe that he knows or owns a message, but the prover can't disclose any information about the message to the verifier. Lots of facts have proved that zero knowledge proof is very useful in cryptography. If zero knowledge proof can be used for verification, many problems can be solved effectively.