Professional Documents
Culture Documents
B C Assign 2
B C Assign 2
B C Assign 2
UNIVERSITY
Department of Computing (BSCS)
Submitted by
M Zunair Khan
SAP ID : 8644
Web 2.0 are websites and applications that make use of user-generated content for
end-users. Web 2.0 is characterized by greater user interactivity and collaboration,
more pervasive network connectivity and enhanced communication channels. Web
2.0 encouraged collaboration and interaction among users in P2P transactions,
thereby setting the stage for e-commerce and social media platforms.
Apart from the favorable implications of interoperability, interactivity, and
usability, web 2.0 also fosters interoperability across various services. Another
important highlight about Web 2.0 in the Web 2.0 and Web 3.0 differences would
refer to web browser technologies. AJAX and JavaScript have emerged as
formidable instruments for the creation of web 2.0 websites.
Web 3.0:
Web 3.0 is a Semantic Web. This means that rather than just searching for content
based on keywords or numbers, we can use AI to understand the semantics (i.e.
meaning) of the content on the web. This would allow machines to understand and
interpret information like humans (instead of like machines). The main purpose of
the Semantic Web is to enable users to find, share and combine information more
easily.
1. Ownership of Data. You will be able to pick what information you want to
share with businesses and advertising agencies, and you will be able to profit
from it.
2. Fewer intermediaries. There will be few, if any, central governments that
receive a portion of the profits generated by electronic transactions.
4. Efficient information access and connecting. The semantic web will aid
in the betterment of internet data connection.
6. Services that are not disrupted. Data will be saved on distributed nodes in
Web3.
Since PoA can be considered as the combination of proof of stack (PoS) and proof
of work (PoW), PoA modifies the solution for PoS. If any miner wants to commit
some transactions in a block as to mine a new block, then if that miner wants to
commit that mined block into the database, and then most of every node sign the
block for validation
Proof-of-Elapsed Time Consensus Algorithm :
(PoET) PoET algorithm suggests some common steps to select the miner that
which would mine a new block. Each miner that had mined the prior block had
waited for random time quantum to do so. Any miner which is proposing any new
block to mine should wait for the random moment of time, and it will be easy to
determine whether any miner which is proposed for the new block to mine has
waited for some time or not by making a determination that a miner has utilized a
special CPU instruction set
PBFT algorithm concerns when one or more node in any network becomes faulty
and behave maliciously that result in improper communication among all nodes
connected to that network. Such things result in a delay in functioning, whereas
time is a very serious concern as we already are working in an asynchronous
system where if at least one fault occurs, then it would be impossible to solve the
consensus problem. It will also generate discrimination in responses of various
nodes. PBFT works for the permissioned model.