Skip to main content

PeopleSearchRoundKey

The key of a round sent in PARTS — one request per network, in parallel, each answered as soon as its network is searched. The client mints one key per round (a UUID) and sends it with every part. Every part of one key is ONE round: the refinement cap and the rate limit count it once; it has one search_state and one set of stored panels. The first part of a key to reach the server fixes the round's query (fields, picks, questions asked, interests, typed line, seed origin; for /seed the card); a later part of the same key searches THAT query for its own networks, whatever its own body says. The round becomes the report's search (its search_state, the stored panels, the history row, a phone lookup's paywall) when the first of its networks answers. A round none of whose networks answered is given back exactly like a single round the search service failed: not counted, the report's previous search kept. A part of a round that has ended (all its networks answered, a newer round replaced it, it failed, or its time to resume — twice the search timeout — has passed) changes nothing and is answered superseded: true. LATE FILL (the lazy full wave): once a round is the report's search (one of its networks answered), a part for one of its networks that has not answered yet is admitted for longer — while the round is still the report's current one and within a limited time of its start (30 minutes). So a client may send a network's full part only when that network's tab is opened, or in the background while the search service has spare capacity (es_spare): it joins the round like any other part — no count, the round's fixed query. GET /people-search/state offers those networks as pending for as long.

stringPeopleSearchRoundKey (string)

The key of a round sent in PARTS — one request per network, in parallel, each answered as soon as its network is searched. The client mints one key per round (a UUID) and sends it with every part. Every part of one key is ONE round: the refinement cap and the rate limit count it once; it has one search_state and one set of stored panels. The first part of a key to reach the server fixes the round's query (fields, picks, questions asked, interests, typed line, seed origin; for /seed the card); a later part of the same key searches THAT query for its own networks, whatever its own body says. The round becomes the report's search (its search_state, the stored panels, the history row, a phone lookup's paywall) when the first of its networks answers. A round none of whose networks answered is given back exactly like a single round the search service failed: not counted, the report's previous search kept. A part of a round that has ended (all its networks answered, a newer round replaced it, it failed, or its time to resume — twice the search timeout — has passed) changes nothing and is answered superseded: true. LATE FILL (the lazy full wave): once a round is the report's search (one of its networks answered), a part for one of its networks that has not answered yet is admitted for longer — while the round is still the report's current one and within a limited time of its start (30 minutes). So a client may send a network's full part only when that network's tab is opened, or in the background while the search service has spare capacity (es_spare): it joins the round like any other part — no count, the round's fixed query. GET /people-search/state offers those networks as pending for as long.

Possible values: >= 8 characters and <= 64 characters, Value must match regular expression ^[A-Za-z0-9_-]{8,64}$

PeopleSearchRoundKey
"string"