Show HN: Impatience – measure event latency on peers using synchronised clocks
Impatience is a Rust library designed for measuring event latency across networked peers with synchronized clocks. It is I/O-agnostic and allows users to implement their own UDP sockets and event loops. The library includes example CLI programs to demonstrate its functionality in real-world scenarios.
- ▪Impatience provides automatic clock synchronization for measuring event-to-event latency.
- ▪The library is I/O-agnostic and has no dependencies on standard networking or threading libraries.
- ▪It includes example programs for debugging clock synchronization and measuring end-to-end event latency.
Hacker News (Newest) files mainly under programming. We currently carry 5,306 of its stories.
Story provenance
Source · retrieval · rights · ranking — open for full record
inspect →
Story provenance
Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.
Record
| Original publisher | GitHub |
| Canonical URL | https://github.com/xfoa/Impatience |
| Publication time | Mon, 25 May 2026 16:55:54 +0000 |
| Retrieval time | 2026-05-25T17:07:38.860Z |
| Last seen | 2026-05-25T17:07:38.860Z |
| Headline source | Publisher (no WeSearch rewrite) |
| Excerpt source | publisher body |
| Excerpt method | First ~120 words (~800 chars) of extracted publisher body, fair-use limited. |
| Summary | WeSearch · cerebras-chat (WeSearch summarizer) |
| Summary source text | contentText |
| Citation coverage | Summary is a WeSearch-generated derivative; primary citation is the original publisher URL. |
| Cluster | jBkF6hE6DlcR |
| Cluster logic | Grouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison. |
| Ranking reason | Story pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking. |
| Publisher visit | Yes — open original |
| Substitutes article? | No — link-out required for full text |
Rights status (four layers)
WeSearch handling by dimension
| Indexing | May the item be indexed (stored, ranked, made findable)? | Allowed |
| Snippet | May a short excerpt of the publisher's text be shown? | Allowed |
| AI summary | May WeSearch generate its own short summary of the article? | Limited |
| Retrieval / RAG | May the content be exposed for third-party retrieval-augmented generation? | Not asserted |
| Model training | May the content be used to train AI models? | Not asserted |
| Commercial reuse | May the content be reused commercially? | Not permitted |
Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.
Opening excerpt (first ~120 words) tap to expand
Impatience A Rust library for measuring event-to-event latency across networked peers with automatic clock synchronisation. The library is I/O-agnostic: it has zero dependencies on std::net or threading. Bring your own UDP socket and event loop. Two example CLI programs (sync-test and latency-demo) are included to demonstrate real-world usage. Features Four abstraction levels from high-level instrumentation down to the raw synchronisation algorithm UDP-based clock sync using a windowed-minimum one-way-delay estimator with 24-bit truncated timestamps Zero-copy serialisation of packet types via rkyv Non-blocking handshake (Initiator / Responder) for establishing peer clocks no_std support at the timesync algorithm layer Optional features: serde, uncertainty, svg (see below) Quick Start use…
Excerpt limited to ~120 words for fair-use compliance. The full article is at GitHub.