Witness Chain
  • Introduction to Witness Chain
  • Infinity Watch
    • Proof of Location (Mainnet)
      • Introduction
      • Process flow
      • Architecture
      • Run a watchtower!
        • For Partner node runners
          • Running on Akash Cloud
          • Running on SuperNoderz
        • EigenLayer operators
          • Running a PoL Watchtower
          • Witness Chain AVS opt-in guide
        • At-home watchtowers
        • For DePIN/Validator Node provider
      • Demos
      • PoL Research
    • APIs
      • Campaign APIs
        • Key Terminologies
        • Authentication
        • Create Campaign
        • Edit campaign
        • Get Photo feed from campaign
        • Get Campaigns
      • Challenge APIs
        • Overview
        • Getting Started
  • Resources
    • Blogs
      • How Proof of Location Works
      • Redefining Geolocation Compliance: Witness Chain & Predicate
    • 🗞️Research
    • 🎙️Talks and Podcasts
    • 🤝Community
    • ⚖️Smart Contracts
    • File a bug
  • Archive
    • Introduction
    • Proof of Diligence Watchtower Protocol
      • How it works
      • Diligence Watchtower Roadmap
      • Watchtower Architecture
      • Chains watched
      • Smart Contracts
      • Quick Links
      • FAQs
    • For the node operators
      • Node requirements
      • Watchtower setup
        • [ARCHIVE] Mainnet Setup
          • L2 Archive Node Setup guide
        • Holesky Setup
          • L2 Archive Node Setup guide
        • Migration from archive to full node
      • Monitoring
    • Research
    • Keys Management
    • Proof of Bandwidth
      • Introduction
      • Architecture
      • For the node operators
        • Running a PoB Challenger Client
        • Running a PoB Prover Client
      • Demos
      • Research
    • 🤝Watchtower Protocol (Architecture v1)
      • đź—ĽHow it works
      • đź“…Watchtower Roadmap
      • 🏦Watchtower Architecture
      • đź”—Chains supported
Powered by GitBook
On this page
  • The Core Mechanism: Network Latency as a Distance Proxy
  • Scientific Calibration: Building Reliable Delay-Distance Models
  • Geometric Verification: The Intersection of Probability Circles
  • Strategic Challenger Selection: A 360° Perspective
  • Practical Applications and Future Directions
  • References
  1. Resources
  2. Blogs

How Proof of Location Works

Explanation of how 360-degree challenger selection improves accuracy

PreviousBlogsNextRedefining Geolocation Compliance: Witness Chain & Predicate

Last updated 2 months ago

Location verification is a critical component in many modern applications, from supply chain tracking to decentralized finance. Traditional methods often rely on trusted hardware or centralized authorities, creating single points of failure. Witness Chain's innovative Proof of Location protocol takes a fundamentally different approach, leveraging network physics to provide robust location verification without specialized hardware.

The Core Mechanism: Network Latency as a Distance Proxy

At the heart of Witness Chain's system is a remarkably elegant concept: internet delay can serve as a reliable proxy for physical distance. The protocol works through these key steps:

  1. A network of geographically distributed challengers send signed UDP packets to a prover claiming to be at a specific location

  2. Both parties cryptographically sign these packets, creating an immutable record of the interaction

  3. The measured network delay is converted to an estimated physical distance

  4. By combining measurements from multiple challengers, the system triangulates the prover's actual location

This approach provides strong guarantees against manipulation while requiring no specialized hardware on the prover's side.

Scientific Calibration: Building Reliable Delay-Distance Models

The critical innovation in Witness Chain's approach is how challengers are calibrated. Rather than using theoretical models, each challenger builds an empirical delay-distance curve based on real-world measurements with other known challengers to ensure guarantees against Byzantine behaviour by the prover.

What makes this approach particularly powerful is the use of monotone curves - as network delay increases, the estimated distance never decreases. This mathematical property enables the system to provide concrete location guarantees even when facing adversarial provers attempting to manipulate the system.

For calibration, each challenger measures Internet delays with respect to other challengers whose locations are known. Thus a challenger has a series of delay-distance points as shown in Fig. 1 from its measurements. From these measurements a challenger computes a monotone curve shown by the solid line in Fig. 1. The monotone curve has the property that with increasing delay the distance is non-decreasing. This monotone curve enables us to offer location guarantees in case of byzantine prover as illustrated in [1].

Geometric Verification: The Intersection of Probability Circles

tl;dr

Once each challenger has estimated the prover's distance, Witness Chain employs geometric principles to verify location claims:

  1. Each challenger creates a probability circle with radius equal to its estimated distance

  2. The prover must be located within the intersection of all these circles

  3. The "Location Uncertainty" is defined as the maximum possible distance between the claimed location and the edge of this intersection area

This approach provides a mathematically rigorous bound on location accuracy rather than just a best guess.

Detailed Explanation

After each challenger estimates a distance for the delay measured to the prover, we can compute the final location of the prover as follows. As we use a monotone delay-distance curve for the challenger, the prover will be within the circle of radius equal to estimated distance of the challenger centred at the location of the challenger as shown in Fig. 2.

Accordingly, if we aggregate across the multiple challengers, the prover will be within the intersection of all the circles from all the challengers. Thus the farthest distance the prover can be from its claimed location is maximum distance between the prover and the periphery of the intersection area, marked as “Location Uncertainty” in Fig. 2. This location uncertainty is the guarantee of our proof of location protocol. For more technical details refer [1].

Strategic Challenger Selection: A 360° Perspective

Witness Chain's global network of challengers enables a powerful optimization: strategic challenger selection. By choosing challengers distributed in a 360-degree pattern around the prover's claimed location, the system dramatically reduces the size of the intersection area and consequently the location uncertainty.

This strategic selection represents a significant improvement over random challenger assignment, substantially enhancing location verification accuracy without requiring additional infrastructure, as explained in Fig 3

Practical Applications and Future Directions

This technology has far-reaching implications for applications requiring trustworthy location verification:

  • Decentralized finance protocols with location-dependent features

  • Proof of presence for events or activities / geo-fenced marketing campaigns.

  • Geographic access control for sensitive services

As Witness Chain's challenger network continues to expand globally, the protocol's accuracy and resilience will only improve, opening new possibilities for location-verified applications across industries.

References

BFT-PoLoc: A Byzantine Fortified Trigonometric Proof of Location Protocol using Internet Delays
Fig. 1 Delay-Distance calibration curve for a challenger
Fig. 2 Location estimation of the prover
Fig. 3 Location Uncertainty for spread out challengers