Free browser tool · zero cloud lock-in

Contradiction Map Builder

Construct dialectical contradiction graphs distinguishing explicit literature disputes from researcher inferences.

Runs 100% locally in your browser. Model academic disputes and theoretical tensions. Explicit published refutations and researcher inferences are strictly kept distinct.

Load Contradiction Preset:

Step 1: Literature Domain & Epistemic Grounding

⚖️ Epistemic Grounding Guard
🔴 2 Explicit Dispute(s)🟡 1 Inferred Tension(s)

Graph edges must strictly distinguish published refutations from researcher inferences. Solid edges indicate explicit peer-reviewed citations where authors directly contest prior work; dotted edges represent your own subjective synthesis hypotheses.

Step 2: Scholarly Claims Inventory

5 claims registered
Claim IDAuthor & YearClaim TypeAsserted Statement & Primary Citation
claim-flp-1985Fischer et al.(1985)theoretical-assertion

No completely asynchronous consensus protocol can guarantee both safety and liveness in the presence of even a single unannounced crash failure.

Fischer, Lynch, & Paterson (1985). Impossibility of Distributed Consensus with One Faulty Process. JACM 32(2).
claim-dls-1988Dwork et al.(1988)theoretical-assertion

Consensus is solvable deterministically in partially synchronous networks where message delay upper bounds hold after an unknown Global Stabilization Time (GST).

Dwork, Lynch, & Stockmeyer (1988). Consensus in the Presence of Partial Synchrony. JACM 35(2).
claim-paxos-1998Lamport(1998)theoretical-assertion

Multi-Paxos guarantees safety under fully asynchronous networks and achieves progress whenever a majority of processes remain non-faulty and election settles.

Lamport, L. (1998). The Part-Time Parliament. ACM TOCS 16(2).
claim-raft-2014Ongaro & Ousterhout(2014)empirical-finding

Raft achieves equivalent fault-tolerance and performance to Multi-Paxos while significantly improving human understandability and operational debuggability.

Ongaro & Ousterhout (2014). In Search of an Understandable Consensus Algorithm. USENIX ATC 14.
claim-howard-2020Howard & Mortier(2020)empirical-finding

Leader-driven understandability in Raft is an operational liability; Paxos decoupled quorums permit greater throughput and reconfigurability under partial partitions.

Howard & Mortier (2020). Paxos vs Raft: Have we reached consensus on distributed consensus? ACM SIGOPS.

Step 3: Contradiction Relationships & Dialectical Ledger

3 contradiction edges
Conflict IDConflicting ClaimsEpistemic GroundingConflict NatureJustification & Dialectical Hypothesis
conflict-flp-vs-dls
Fischer et al. (1985)⚡ conflicts withDwork et al. (1988)
🔴 Explicit RefutationBoundary Condition Divergence

Dwork et al. explicitly cite Fischer et al. (1985) and demonstrate that weakening pure asynchrony to partial synchrony circumvents the FLP impossibility barrier.

Hypothesized Resolution: Boundary condition reconciliation: FLP applies to strictly unbounded asynchronous networks; DLS operates after GST.
conflict-raft-vs-howard
Ongaro & Ousterhout (2014)⚡ conflicts withHoward & Mortier (2020)
🔴 Explicit RefutationDirect Mutual Exclusion

Howard & Mortier (2020) directly benchmark and contest Ongaro & Ousterhout’s claim of Raft equivalence, demonstrating asymmetric leader bottleneck bottlenecks under packet loss.

Hypothesized Resolution: Trade-off recognition: Raft optimizes for straightforward state-machine mental models; generalized Paxos quorums optimize for asymmetric network topologies.
conflict-paxos-vs-flp
Lamport (1998)⚡ conflicts withFischer et al. (1985)
🟡 Inferred TensionBoundary Condition Divergence

Lamport (1998) does not explicitly frame Multi-Paxos as an FLP circumvention in the narrative allegory, but the researcher infers tension: Paxos accepts liveness suspension during leader duels to preserve FLP-mandated safety.

Hypothesized Resolution: Epistemic clarification: Paxos trades off guaranteed termination under adversarial timing to maintain absolute state consistency.

Step 4: Dialectical Contradiction Graph (Mermaid)

Solid red (==>) = Explicit; Dotted amber (-.->) = Inferred
Mermaid Diagram Syntax
graph TD
  %% Node Definitions
  claim-flp-1985["<b>Fischer et al. '1985'</b><br/>No completely asynchronous consensus protocol can guarantee both safety and live"]
  claim-dls-1988["<b>Dwork et al. '1988'</b><br/>Consensus is solvable deterministically in partially synchronous networks where "]
  claim-paxos-1998["<b>Lamport '1998'</b><br/>Multi-Paxos guarantees safety under fully asynchronous networks and achieves pro"]
  claim-raft-2014["<b>Ongaro & Ousterhout '2014'</b><br/>Raft achieves equivalent fault-tolerance and performance to Multi-Paxos while si"]
  claim-howard-2020["<b>Howard & Mortier '2020'</b><br/>Leader-driven understandability in Raft is an operational liability; Paxos decou"]

  %% Contradiction Edges (Strict Epistemic Grounding)
  claim-flp-1985 ==>|"[EXPLICIT DISPUTE] Boundary Condition Divergence"| claim-dls-1988
  claim-raft-2014 ==>|"[EXPLICIT DISPUTE] Direct Mutual Exclusion"| claim-howard-2020
  claim-paxos-1998 -.->|"[INFERRED TENSION] Boundary Condition Divergence"| claim-flp-1985

  %% Style Classes
  classDef explicitConflict stroke:#dc2626,stroke-width:3px;
  classDef inferredConflict stroke:#d97706,stroke-dasharray: 5 5;

Step 5: Obsidian Dialectical Note Export

Complete note with YAML frontmatter and dialectical table
Obsidian Markdown Preview
---
title: "Distributed State Machine Replication & Consensus Contradiction Map"
domain: "Fault-tolerant consensus scalability and asynchronous network limits"
claims_count: 5
explicit_conflicts: 2
inferred_conflicts: 1
tags:
  - literature-review
  - contradiction-map
  - dialectical-synthesis
---

# Distributed State Machine Replication & Consensus Contradiction Map

**Domain / Problem Area:** Fault-tolerant consensus scalability and asynchronous network limits

> [!NOTE] Epistemic Grounding Guard
> - **Explicit Literature Disputes:** 2 (Authors directly cite and refute each other).
> - **Researcher Inferred Tensions:** 1 (Subjective synthesis judgments by reader; not cited in primary texts).

## Dialectical Contradiction Graph
```mermaid
graph TD
  %% Node Definitions
  claim-flp-1985["<b>Fischer et al. '1985'</b><br/>No completely asynchronous consensus protocol can guarantee both safety and live"]
  claim-dls-1988["<b>Dwork et al. '1988'</b><br/>Consensus is solvable deterministically in partially synchronous networks where "]
  claim-paxos-1998["<b>Lamport '1998'</b><br/>Multi-Paxos guarantees safety under fully asynchronous networks and achieves pro"]
  claim-raft-2014["<b>Ongaro & Ousterhout '2014'</b><br/>Raft achieves equivalent fault-tolerance and performance to Multi-Paxos while si"]
  claim-howard-2020["<b>Howard & Mortier '2020'</b><br/>Leader-driven understandability in Raft is an operational liability; Paxos decou"]

  %% Contradiction Edges (Strict Epistemic Grounding)
  claim-flp-1985 ==>|"[EXPLICIT DISPUTE] Boundary Condition Divergence"| claim-dls-1988
  claim-raft-2014 ==>|"[EXPLICIT DISPUTE] Direct Mutual Exclusion"| claim-howard-2020
  claim-paxos-1998 -.->|"[INFERRED TENSION] Boundary Condition Divergence"| claim-flp-1985

  %% Style Classes
  classDef explicitConflict stroke:#dc2626,stroke-width:3px;
  classDef inferredConflict stroke:#d97706,stroke-dasharray: 5 5;
```

## Contradiction Ledger & Reconciliations
| Conflict ID | Claim A (Source) | Claim B (Source) | Epistemic Grounding | Conflict Nature | Justification & Dialectical Hypothesis |
| --- | --- | --- | --- | --- | --- |
| conflict-flp-vs-dls | **Fischer et al. (1985):** "No completely asynchronous consensus protocol can guarantee both safety and liveness in the presence of even a single unannounced crash failure." | **Dwork et al. (1988):** "Consensus is solvable deterministically in partially synchronous networks where message delay upper bounds hold after an unknown Global Stabilization Time (GST)." | 🔴 **Explicit Source Refutation** | Boundary Condition Divergence | Dwork et al. explicitly cite Fischer et al. (1985) and demonstrate that weakening pure asynchrony to partial synchrony circumvents the FLP impossibility barrier.<br/>*Resolution:* Boundary condition reconciliation: FLP applies to strictly unbounded asynchronous networks; DLS operates after GST. |
| conflict-raft-vs-howard | **Ongaro & Ousterhout (2014):** "Raft achieves equivalent fault-tolerance and performance to Multi-Paxos while significantly improving human understandability and operational debuggability." | **Howard & Mortier (2020):** "Leader-driven understandability in Raft is an operational liability; Paxos decoupled quorums permit greater throughput and reconfigurability under partial partitions." | 🔴 **Explicit Source Refutation** | Direct Mutual Exclusion | Howard & Mortier (2020) directly benchmark and contest Ongaro & Ousterhout’s claim of Raft equivalence, demonstrating asymmetric leader bottleneck bottlenecks under packet loss.<br/>*Resolution:* Trade-off recognition: Raft optimizes for straightforward state-machine mental models; generalized Paxos quorums optimize for asymmetric network topologies. |
| conflict-paxos-vs-flp | **Lamport (1998):** "Multi-Paxos guarantees safety under fully asynchronous networks and achieves progress whenever a majority of processes remain non-faulty and election settles." | **Fischer et al. (1985):** "No completely asynchronous consensus protocol can guarantee both safety and liveness in the presence of even a single unannounced crash failure." | 🟡 _Researcher Inferred Tension_ | Boundary Condition Divergence | Lamport (1998) does not explicitly frame Multi-Paxos as an FLP circumvention in the narrative allegory, but the researcher infers tension: Paxos accepts liveness suspension during leader duels to preserve FLP-mandated safety.<br/>*Resolution:* Epistemic clarification: Paxos trades off guaranteed termination under adversarial timing to maintain absolute state consistency. |

## Methodological Resolution Hypotheses
- **Parameter Isolation:** Check whether divergent findings stem from distinct sample populations or network models.
- **Operationalization Differences:** Verify whether contradictory metrics measure identical underlying constructs.

Dialectical Synthesis and the Peril of False Equivalence

Scholarly literature is rarely a monolithic consensus; it progresses through dialectical tension, disputed empirical findings, and contested models. However, when academic writers construct literature reviews, they frequently collapse into two opposing methodological errors:

  1. Conflating Inferences with Primary Disputes: Treating a subjective tension observed by the reader as if the original authors explicitly attacked one another. If Author A wrote in 1985 and Author B wrote in 2020 in a separate subfield without reading Author A, their tension is a researcher-generated hypothesis, not a published historical dispute.
  2. False Binary Polarization: Treating divergent findings as absolute contradictions when they actually diverge due to differing boundary conditions, distinct operational definitions, or incompatible measurement apparatuses.

The Epistemic Grounding Guard

The Contradiction Map Builder enforces transparent epistemic provenance on every relationship:

  • 🔴 Explicit Source Refutations (Solid Edges): Used strictly when paper B explicitly cites paper A and contests its findings, proofs, or conclusions. Visualized as thick, solid connections (==>) in Mermaid knowledge graphs.
  • 🟡 Researcher Inferred Tensions (Dotted Edges): Used when you as the literature reviewer identify an unaddressed friction between independent papers. Visualized as dotted lines (-.->) to make subjectivity transparent to thesis advisors and peer reviewers.
  • Dialectical Reconciliation Prompts: Encourages articulating whether a conflict can be resolved through parameter boundary isolation, construct operationalization differences, or trade-off modeling.

Frequently Asked Questions

Clear guidance on contradiction mapping, dialectical synthesis, and Obsidian export.

Questions

What is a literature contradiction map?

A contradiction map is a dialectical graph and matrix that charts conflicting claims, theoretical disputes, and divergent empirical findings across academic literature. It moves beyond linear bibliographies by illuminating exactly where, why, and under what conditions published studies disagree.

Why does this tool strictly distinguish explicit source refutations from researcher inferences?

In scholarship, an explicit refutation occurs when an author directly cites and contests another work (e.g., publishing a formal counter-proof or replication failure). A researcher-inferred tension is a subjective hypothesis formulated by the reader connecting separate silos. Conflating the two creates false epistemic authority, misrepresenting personal speculation as established literature consensus.

What are the four conflict taxonomies used to classify contradictions?

The engine categorizes contradictions into: (1) Direct Mutual Exclusion (both claims cannot be true under identical conditions), (2) Parameter Boundary Divergence (claims hold under different environmental thresholds or models), (3) Methodological Artifact (discrepancy stems from differing instruments or sampling protocols), and (4) Semantic Ambiguity (authors use identical terms with conflicting operational definitions).

How does Mermaid visualize the difference between explicit and inferred conflicts?

Explicit published disputes are rendered as bold solid lines (==>) tagged with [EXPLICIT DISPUTE], indicating primary-source refutations. Inferred tensions are rendered as dotted lines (-.->) tagged with [INFERRED TENSION], ensuring visual honesty in knowledge graphs and Obsidian canvas diagrams.

Can I export the contradiction map into Obsidian and spreadsheet tools?

Yes. You can export complete Obsidian Markdown notes featuring YAML metadata, embedded Mermaid diagrams, and dialectical synthesis tables, or download formula-guarded CSV ledgers for systematic review evidence management.

Does this tool transmit my research notes, hypotheses, or claims across the network?

No. All graph generation, epistemic validation, and Markdown note formatting run 100% locally in your browser memory. Zero data is sent to external servers or cloud analytics.

Organize and resolve literature contradictions in your vault

Keep your claims, citations, and dialectical synthesis notes connected in a local-first, privacy-respecting Markdown vault.

contradiction map builder downloadDownload for Mac

No account needed. Intel Mac build