"Reaching Agreement in the Presence of Faults"
E105801
"Reaching Agreement in the Presence of Faults" is a seminal paper in distributed computing that introduced the Byzantine Generals Problem and laid the foundations for understanding consensus in unreliable, fault-prone systems.
All labels observed (1)
| Label | Occurrences |
|---|---|
| "Reaching Agreement in the Presence of Faults" canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T886672 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: "Reaching Agreement in the Presence of Faults" Context triple: [Leslie Lamport, notableWork, "Reaching Agreement in the Presence of Faults"]
-
A.
Paxos
Paxos is a small Greek island in the Ionian Sea, known for its clear turquoise waters, olive groves, and tranquil, less-touristed atmosphere.
-
B.
Secrecy, Authentication, and Public Key Systems
"Secrecy, Authentication, and Public Key Systems" is Ralph Merkle's influential doctoral thesis that helped lay the foundations of modern public-key cryptography and secure communication protocols.
-
C.
Merkle puzzles
Merkle puzzles are an early cryptographic protocol that introduced the concept of public-key exchange by allowing two parties to establish a shared secret over an insecure channel using computationally asymmetric “puzzle” problems.
-
D.
Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing
Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing is a 1985 ACM conference volume collecting influential research papers in theoretical computer science, including foundational work on topics such as interactive proof systems and computational complexity.
-
E.
IEEE Computer Society Technical Committee on Distributed Processing
The IEEE Computer Society Technical Committee on Distributed Processing is a professional body within the IEEE Computer Society that focuses on advancing research, standards, and community activities in distributed computing systems and related technologies.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: "Reaching Agreement in the Presence of Faults" Target entity description: "Reaching Agreement in the Presence of Faults" is a seminal paper in distributed computing that introduced the Byzantine Generals Problem and laid the foundations for understanding consensus in unreliable, fault-prone systems.
-
A.
Paxos
Paxos is a small Greek island in the Ionian Sea, known for its clear turquoise waters, olive groves, and tranquil, less-touristed atmosphere.
-
B.
Secrecy, Authentication, and Public Key Systems
"Secrecy, Authentication, and Public Key Systems" is Ralph Merkle's influential doctoral thesis that helped lay the foundations of modern public-key cryptography and secure communication protocols.
-
C.
Merkle puzzles
Merkle puzzles are an early cryptographic protocol that introduced the concept of public-key exchange by allowing two parties to establish a shared secret over an insecure channel using computationally asymmetric “puzzle” problems.
-
D.
Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing
Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing is a 1985 ACM conference volume collecting influential research papers in theoretical computer science, including foundational work on topics such as interactive proof systems and computational complexity.
-
E.
IEEE Computer Society Technical Committee on Distributed Processing
The IEEE Computer Society Technical Committee on Distributed Processing is a professional body within the IEEE Computer Society that focuses on advancing research, standards, and community activities in distributed computing systems and related technologies.
- F. None of above. chosen
Statements (42)
| Predicate | Object |
|---|---|
| instanceOf |
computer science paper
ⓘ
distributed computing paper ⓘ scientific paper ⓘ |
| addressesProblem |
consensus in the presence of malicious or faulty components
ⓘ
how to reach agreement when some processes may behave arbitrarily ⓘ |
| analyzes |
conditions for correctness of agreement protocols
ⓘ
tolerance bounds on the number of faulty processes ⓘ |
| citationType | highly cited paper in distributed computing ⓘ |
| contribution |
algorithms for reaching agreement with faulty components
ⓘ
definition of conditions for reaching agreement with faulty processes ⓘ formalization of consensus in unreliable distributed systems ⓘ proof of impossibility results for certain fault thresholds ⓘ |
| field |
computer science
ⓘ
distributed computing ⓘ fault-tolerant distributed systems ⓘ |
| hasImpact |
foundational work in distributed computing theory
ⓘ
seminal paper on consensus in the presence of faults ⓘ |
| influenced |
blockchain consensus research
ⓘ
design of fault-tolerant distributed protocols ⓘ Practical Byzantine Fault Tolerance ⓘ
surface form:
practical Byzantine fault tolerance (PBFT)
research on Byzantine fault-tolerant consensus algorithms ⓘ theory of reliable broadcast and agreement ⓘ |
| introducedConcept |
Byzantine Generals Problem
ⓘ
Byzantine Generals Problem ⓘ
surface form:
Byzantine agreement
Byzantine failures ⓘ |
| knownAs | seminal Byzantine agreement paper ⓘ |
| mainTopic |
Byzantine fault tolerance
ⓘ
agreement in the presence of faults ⓘ distributed consensus ⓘ fault models in distributed systems ⓘ reliable broadcast ⓘ |
| recognizedAs |
classic in distributed algorithms literature
ⓘ
foundational reference for Byzantine fault tolerance ⓘ |
| relatedTo |
Byzantine Generals Problem
ⓘ
Byzantine Generals Problem ⓘ
surface form:
Byzantine agreement problem
agreement protocols in the presence of arbitrary faults ⓘ fault-tolerant consensus ⓘ reliable distributed computation ⓘ |
| studiedIn |
courses on distributed algorithms
ⓘ
graduate courses on distributed systems ⓘ |
| usesModel |
message-passing distributed system
ⓘ
synchronous communication model ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: "Reaching Agreement in the Presence of Faults" Description of subject: "Reaching Agreement in the Presence of Faults" is a seminal paper in distributed computing that introduced the Byzantine Generals Problem and laid the foundations for understanding consensus in unreliable, fault-prone systems.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.