Algorithm and computing power

1.

computing power is a measure of bitcoin network processing power. That is, the speed at which the computer calculates the output of the hash function. Bitcoin networks must perform intensive mathematical and encryption related operations for security purposes. For example, when the network reaches a hash rate of 10th / s, it can perform 10 trillion calculations per second

in the process of getting bitcoin through "mining", we need to find its corresponding solution M. for any 64 bit hash value, there is no fixed algorithm to find its solution M. we can only rely on computer random hash collisions. How many hash collisions can a mining machine do per second is the representative of its "computing power", and the unit is written as hash / s, This is called workload proof mechanism pow

< H2 > extended data

computing power provides a solid foundation for the development of big data, and the explosive growth of big data poses a huge challenge to the existing computing power. With the rapid accumulation of big data in the Internet era and the geometric growth of global data, the existing computing power can no longer meet the demand. According to IDC, 90% of the global information data is generated in recent years. And by 2020, about 40% of the information will be stored by cloud computing service providers, of which 1 / 3 of the data has value

therefore, the development of computing power is imminent, otherwise it will greatly restrict the development and application of artificial intelligence. There is a big gap between China and the advanced level of the world in terms of computing power and algorithm. The core of computing power is the chip. Therefore, it is necessary to increase R & D investment in the field of computing power to narrow or even catch up with the gap with the developed countries in the world

unit of force

1 KH / S = 1000 hashes per second

1 MH / S = 1000000 hashes per second

1 GH / S = 1000000000 hashes per second

1 th / S = 100000000000 hashes per second

1 pH / S = 100000000000 hashes per second

1 eh / S = 100000000000 hashes per second

2. Computing power refers to computing power. In the process of getting bitcoin through "mining", we need to find its corresponding solution M. for any 64 bit hash value, there is no fixed algorithm to find its solution M. we can only rely on computer random hash collisions. How many hash collisions can a mining machine do per second is the representative of its "computing power", Unit is written as hash / s, which is the so-called workload proof mechanism pow (proof
of
work)
What does 1p mean
first of all, 1p computing power is equivalent to about 1.05 million g, which means that if you have 1g computing power of the whole network, you can get almost 1.05 million of bitcoin output of the whole network. According to the output of 3800 bitcoins per day, we can see that the daily income of 1g of computing power has dropped to 0.0036 bitcoins, which is about 2.7 yuan according to the current market price. If the electricity cost and mining machinery hardware cost are included, the profit is almost gone
secondly, 1p's whole network computing power seems amazing, but in fact, in a year's time, you will think it's just a pediatrics, because cointera will launch 2p miner in December, and bitmine will launch 4P miner in March next year. If these companies are not put in biochemical weapons by Syria, it should be expected that bitcoin's whole network computing power will reach more than 10p in a year's time, By then, 1g of computing power will only be able to dig 0.00036 bitcoins a day.

3. Hello, you should be talking about the so-called computing power of some blockchain platforms. Now, the algorithms of these platforms are uneven. The real blockchain platform in China is actually zero. This computing power is calculated according to the user's activity and some other statistical rates.

4. Today's Park ton foreign exchange news you can refer to the regular website to query, here is not to find the answer.

5. Any stock involving digital currency is a fraud. Don't believe it. Remember, don't invest and manage money online.

6. cd2
fs2you://=

cd1:
fs2you://

7. In fact, any problem can be overcome.
I think you can find some problems.
it must be problems with complex process and complicated calculation (such as the last step of Mathematics)
it is best to provide reference answers, Then you work on the draft paper step by step
until you match the standard answer
make a plan for yourself
for example, do a question one night
secondly, I think you should be calm when doing the question
sometimes say to yourself
write down step by step
don't worry
try to write clearly on the draft paper
finally
you can also do it Think about the mistakes you made in the past.
to sum up,
at least pay attention to this in the future.
finally, I wish you success in the college entrance examination.
after all, I don't think you should be too nervous about the college entrance examination.
as long as you do it step by step,
no matter how simple or difficult the test paper is,
you should have a good attitude.
you will definitely have a good score uck

8.

The difference between algorithm and program is as follows:

(1) the two definitions are different. Algorithm is the description of solving steps of specific problems, it is a finite sequence of instructions. The program is a series of statements and instructions to achieve the desired purpose

to say that some popular algorithms are the ideas and proceres for solving a problem, and they are the specific and easy to write code for solving these problems. The algorithm has no language boundaries. He's just an idea. In order to implement the same algorithm, programs written in different languages will be different

(2) the writing rules of the two are different. The program must be written in the specified programming language, and the algorithm is very arbitrary. Algorithm is a series of clear instructions to solve the problem, that is to say, it can obtain the required output in a limited time for a certain standard input. Algorithms often contain repeated steps and some logical judgments

simple algorithm example: find 1 * 2 * 3 * 4 * 5

Step 1: find 1 * 2 first and get result 2

Step 2: multiply the proct 2 from step 1 by 3 to get the result 6

Step 3: multiply the proct 6 from step 2 by 4 to get the result of 24

Step 4: multiply the proct 24 from step 3 by 5 to get the final result of 120

The relationship between

algorithm and program:

algorithm and program are both finite sequences of instructions, but program is algorithm, and algorithm is not necessarily program. Program = data structure + algorithm. The main purpose of the algorithm is to provide people with the workflow and steps to read and understand. Data structure and algorithm can only be executed by computer system through the realization of program. It can be understood that data structures and algorithms form executable programs

extended data

elements of the algorithm:

I. operation and operation of data objects: the basic operations that a computer can perform are described in the form of instructions. The set of all instructions that a computer system can execute becomes the instruction system of the computer system. The basic operations and operations of a computer are as follows:

1, arithmetic operations: addition, subtraction, multiplication and division

Logic operation: or, and, not and so on

3. Relational operation: greater than, less than, equal to, not equal to, etc

Data transmission: input, output, assignment and other operations

Second, the control structure of an algorithm: the function structure of an algorithm depends not only on the selected operation, but also on the execution order of each operation