Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Distributed Loads: Problem Solving

Distributed Loads: Problem Solving

Beams are structural elements commonly employed in engineering applications requiring different load-carrying capacities. The first step in analyzing a beam under a distributed load is to simplify the problem by dividing the load into smaller regions, which allows one to consider each region separately and calculate the magnitude of the equivalent resultant load acting on each portion of the beam. The magnitude of the equivalent resultant load for each region can be determined by calculating...

Distribution Reliability and Automation

Distribution Reliability and Automation

Distribution reliability in electrical power systems is critical for ensuring an uninterrupted power supply to consumers at minimal cost. According to IEEE Standard Terms, reliability is the probability that a device will function without failure over a specified time period or amount of usage. For electric power distribution, this translates to maintaining continuous power supply and addressing customer concerns over power outages. Several indices, as defined by IEEE Standard 1366-2012, are...

Distributed Loads

Distributed Loads

Distributed loads are a common type of load that engineers and scientists encounter in various practical situations. Distributed loads often refer to a type of load spread over a surface or a structure and can be modeled as continuous force per unit area.
For example, consider a bookshelf filled with books stacked vertically adjacent to each other. The weight of the books is evenly distributed over the length of the shelf. As a result, the pressure at different locations on the surface of the...

Restarting Stalled Replication Forks

Restarting Stalled Replication Forks

DNA replication is initiated at sites containing predefined DNA sequences known as origins of replication. DNA is unwound at these sites by the minichromosome maintenance (MCM) helicase and other factors such as Cdc45 and the associated GINS complex.The unwound single strands are protected by replication protein A (RPA) until DNA polymerase starts synthesizing DNA at the 5’ end of the strand in the same direction as the replication fork. To prevent the replication fork from falling apart,...

Propagation of Uncertainty from Random Error

Propagation of Uncertainty from Random Error

An experiment often consists of more than a single step. In this case, measurements at each step give rise to uncertainty. Because the measurements occur in successive steps, the uncertainty in one step necessarily contributes to that in the subsequent step. As we perform statistical analysis on these types of experiments, we must learn to account for the propagation of uncertainty from one step to the next. The propagation of uncertainty depends on the type of arithmetic operation performed on...

Second Uniqueness Theorem

Second Uniqueness Theorem

Consider a region consisting of several individual conductors with a definite charge density in the region between these conductors. The second uniqueness theorem states that if the total charge on each conductor and the charge density in the in-between region are known, then the electric field can be uniquely determined.
In contrast, consider that the electric field is non-unique and apply Gauss's law in divergence form in the region between the conductors and the integral form to the...

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by

Same author

Improved distributed <math></math> -coloring.

Distributed computing·2021

Same journal

A topological characterization of stabilizing consensus.

Distributed computing·2026

Same journal

Connectivity Labeling in Faulty Colored Graphs.

Distributed computing·2026

Same journal

Optimal message-passing with noisy beeps.

Distributed computing·2025

Same journal

Asymmetric distributed trust.

Distributed computing·2024

Same journal

Near-optimal distributed dominating set in bounded arboricity graphs.

Distributed computing·2024

Same journal

Component stability in low-space massively parallel computation.

Distributed computing·2024

See all related articles

Search research articles

Related Experiment Video

Updated: Oct 14, 2025

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

Redundancy in distributed proofs.

Laurent Feuilloley¹, Pierre Fraigniaud², Juho Hirvonen³

¹Universidad de Chile, Santiago, Chile.

Distributed Computing

|November 1, 2021

Summary

This summary is machine-generated.

Distributed proofs use certificates and verifiers for network checks. Researchers found high redundancy allows perfect tradeoffs between certificate size and verification rounds.

Keywords:

Distributed graph algorithms Distributed verification Nondeterminism Proof-labeling schemes Space-time tradeoffs

More Related Videos

The Collective Trust Game: An Online Group Adaptation of the Trust Game Based on the HoneyComb Paradigm

The Collective Trust Game: An Online Group Adaptation of the Trust Game Based on the HoneyComb Paradigm

Published on: October 20, 2022

Experimental Investigation of the Hierarchical Control in DC Microgrids Using a Real-time Simulator

Experimental Investigation of the Hierarchical Control in DC Microgrids Using a Real-time Simulator

Published on: February 14, 2025

Related Experiment Videos

Last Updated: Oct 14, 2025

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

The Collective Trust Game: An Online Group Adaptation of the Trust Game Based on the HoneyComb Paradigm

The Collective Trust Game: An Online Group Adaptation of the Trust Game Based on the HoneyComb Paradigm

Published on: October 20, 2022

Experimental Investigation of the Hierarchical Control in DC Microgrids Using a Real-time Simulator

Experimental Investigation of the Hierarchical Control in DC Microgrids Using a Real-time Simulator

Published on: February 14, 2025

Area of Science:

Computer Science
Distributed Computing
Network Science

Background:

Distributed proofs verify network properties using node-assigned certificates and verification algorithms.
Existing mechanisms involve a prover assigning certificates and a verifier checking them.

Purpose of the Study:

To analyze the redundancy in distributed proofs for network predicates.
To establish tradeoffs between certificate size and verification rounds.

Main Methods:

Investigated well-known distributed proof mechanisms.
Analyzed the redundancy inherent in distributed proofs for various network predicates.
Developed a framework to demonstrate tradeoffs between certificate size and verification rounds.

Main Results:

Demonstrated that many network predicates possess distributed proofs with significant redundancy.
Established perfect tradeoffs between the size of node-stored certificates and the number of verification rounds.
Quantified the relationship between proof redundancy and protocol efficiency.

Conclusions:

The high redundancy in distributed proofs is a key property that enables efficient verification.
Optimal tradeoffs can be achieved between certificate storage and communication complexity in distributed verification protocols.