Host Candidate Proof
Definitions
Host Candidate Proof is a NAT Traversal and P2P Gaming term for host candidate proof work that shows why a multiplayer lobby, voice call, or real-time app can fail when address translation hides peers behind layers of private or shared network space. It helps people and agents name the signal, source, and safe next step without pretending an automation, campaign, DNS record, RFC, or network path did more than the evidence shows. Source context: RFC 6598 shared address space; RFC 8445 ICE; RFC 1918 private address space.
“The team used Host Candidate Proof after the TURN relay became the adult in the room, and the public-safe part stayed open and the protected part stayed locked.”
Related Terms
- 100.64/10NAT Traversal and P2P Gaming
100.64/10 is a NAT Traversal and P2P Gaming term for the shared IPv4 address block from 100.64.0.0 through 100.127.255.255, reserved for use between customer equipment and provider...
- 100.64/10 GuardNAT Traversal and P2P Gaming
100.64/10 Guard is a NAT Traversal and P2P Gaming term for 100.64/10 guard work that shows why a multiplayer lobby, voice call, or real-time app can fail when address translation h...
- Carrier Grade NATNAT Traversal and P2P Gaming
Carrier Grade NAT is a NAT Traversal and P2P Gaming term for the service-provider deployment pattern for large-scale NAT used during IPv4 exhaustion, commonly associated with share...
- CGNATNAT Traversal and P2P Gaming
CGNAT is a NAT Traversal and P2P Gaming term for Carrier-Grade NAT, where a service provider translates many customer connections behind shared public IPv4 addresses, often creatin...
- Connectivity CheckNAT Traversal and P2P Gaming
Connectivity Check is a NAT Traversal and P2P Gaming term for a STUN-based test used by ICE agents to verify whether a candidate pair can actually carry traffic between peers. It h...
- ICENAT Traversal and P2P Gaming
ICE is a NAT Traversal and P2P Gaming term for Interactive Connectivity Establishment, an IETF protocol for NAT traversal that tests possible network paths using candidates, STUN, ...