-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathindex.html
More file actions
94 lines (88 loc) · 4.55 KB
/
index.html
File metadata and controls
94 lines (88 loc) · 4.55 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8" />
<meta http-equiv="X-UA-Compatible" content="IE=edge" />
<meta name="viewport" content="width=device-width, initial-scale=1.0" />
<meta name="description" content="This website is about stock market" />
<meta property="og:image" content="logo.png" />
<meta property="og:title" content="Learn free investing tutorial" />
<meta property="og:description" content="Invest Wisely is a website about stock market" />
<link rel="icon" href="Web/fevicon3.png" />
<title>Basic Portfolia</title>
</head>
<body>
<!-- <h1>This is a demo Tag</h1>
<h2>This is a demo Tag</h2>
<h3>This is a demo Tag</h3>
<h4>This is a demo Tag</h4>
<h5>This is a demo Tag</h5>
<h6>This is a demo Tag</h6> -->
<!-- <p>This is a paragraph Tag</p>
<p>
Lorem Ipsum: Lorem ipsum dolor sit, amet consectetur adipisicing elit.
Commodi odio recusandae minus ullam sit asperiores, repudiandae rem minima
architecto iure explicabo accusantium sequi labore ex ea fugit error ipsum
inventore? Lorem ipsum dolor sit amet consectetur adipisicing elit.
Blanditiis labore sit in ex assumenda quas unde provident, consectetur
laboriosam libero eos consequatur? Quis ex fugiat rem, tempore, quidem,
eveniet quos enim maiores explicabo debitis nobis sint dolor quasi eius
ipsa voluptatem! Rerum enim dicta delectus dolores, ipsa sunt beatae
distinctio.
</p> -->
<h1>Blockchain</h1>
<hr />
<p>From Wikipedia , the <em>free</em> encyclopedia</p>
<p><i> For other uses, see Block chain (disambiguation). </i></p>
<img style="float: right" width="350" src="web/post-image-1.png" />
<p>
A <strong>Blockchain</strong> is a type of
<mark>distributed ledger technology (DLT)</mark> that
<del>consist</del> consists of growing list of records, called blocks,
that are securely linked together using cryptography.[1] [2] [3] [4] Each
block contains a <ins>cryptographic</ins> hash of the previous block, a
timestamp, and transaction data (generally represented as a Merkle tree,
where data nodes are represented by leaves). The
<ins>timestamp</ins> proves that the transaction data existed when the
block was created. Since each block contains information about the
previous block, they effectively form a chain (compare linked list data
structure), with each additional block linking to the ones before it.
Consequently, blockchain transactions are irreversible in that, once they
are recorded, the data in any given block cannot be altered retroactively
without altering all subsequent blocks. <br />
<b>Blockchains</b> are typically managed by a peer-to-peer (P2P) computer
network for use as a public distributed ledger, where nodes collectively
adhere to a consensus algorithm protocol to add and validate new
transaction blocks. Although blockchain records are not unalterable, since
blockchain forks are possible, blockchains may be considered secure by
design and exemplify a distributed computing system with high Byzantine
fault tolerance.[5]
</p>
<br />
<p>2H<sub>2</sub>+O<sub>2</sub> -> 2H2<sup>O</sup></p>
<h1 style="text-align: center">History</h1>
<hr />
<p>
Cryptographer David Chaum first proposed a blockchain-like protocol in his
1982 dissertation "Computer Systems Established, Maintained, and Trusted
by Mutually Suspicious Groups."[11] Further work on a cryptographically
secured chain of blocks was described in 1991 by Stuart Haber and W. Scott
Stornetta.[4][12] They wanted to implement a system wherein document
timestamps could not be tampered with. In 1992, Haber, Stornetta, and Dave
Bayer incorporated Merkle trees into the design, which improved its
efficiency by allowing several document certificates to be collected into
one block.[4][13] Under their company Surety, their document certificate
hashes have been published in The New York Times every week since
1995.[14]
</p>
<a href="blogging.html" target="_blank">Click here to visit Blogging</a>
<br />
<a href="school.html" target="_blank">Click here to visit School</a>
<br />
<a href="table.html" target="_blank">Click here to visit on Table</a> <br />
<a href="resume.html" target="_blank">Click here to visit on Resume</a><br />
<a href="contactDetails.html" target="_blank">Click here to visit on Contact Details</a>
<br />
<a target="_blank" href="aboutus.html">About Us</a>
</body>
</html>