Re: [Sidrops] trying to limit RP processing variability

Jay Borkenhagen <> Wed, 15 April 2020 15:50 UTC

Return-Path: <>
Received: from localhost (localhost []) by (Postfix) with ESMTP id E093F3A0B1C for <>; Wed, 15 Apr 2020 08:50:26 -0700 (PDT)
X-Virus-Scanned: amavisd-new at
X-Spam-Flag: NO
X-Spam-Score: -1.65
X-Spam-Status: No, score=-1.65 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, HEADER_FROM_DIFFERENT_DOMAINS=0.248, SPF_HELO_NONE=0.001, SPF_NONE=0.001] autolearn=no autolearn_force=no
Received: from ([]) by localhost ( []) (amavisd-new, port 10024) with ESMTP id oTO_4dLRx_3K for <>; Wed, 15 Apr 2020 08:50:25 -0700 (PDT)
Received: from ( []) by (Postfix) with ESMTP id F15D43A0CFF for <>; Wed, 15 Apr 2020 08:49:57 -0700 (PDT)
Received: from ( []) by (Postfix) with ESMTP id 8E9FC31843 for <>; Wed, 15 Apr 2020 15:49:56 +0000 (UTC)
Received: by (Postfix, from userid 1000) id 67A14A408AC; Wed, 15 Apr 2020 11:49:56 -0400 (EDT)
X-Mailer: emacs 24.3.1 (via feedmail 11-beta-1 I); VM 8.2.0b under 24.3.1 (x86_64-pc-linux-gnu)
MIME-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Content-Transfer-Encoding: 7bit
Message-ID: <>
Date: Wed, 15 Apr 2020 11:49:55 -0400
From: Jay Borkenhagen <>
In-Reply-To: <>
References: <> <> <> <> <> <> <> <>
Reply-To: Jay Borkenhagen <>
X-GPG-Fingerprint: DDDB 542E D988 94D0 82D3 D198 7DED 6648 2308 D3C0
Archived-At: <>
Subject: Re: [Sidrops] trying to limit RP processing variability
X-Mailman-Version: 2.1.29
Precedence: list
List-Id: A list for the SIDR Operations WG <>
List-Unsubscribe: <>, <>
List-Archive: <>
List-Post: <>
List-Help: <>
List-Subscribe: <>, <>
X-List-Received-Date: Wed, 15 Apr 2020 15:50:27 -0000

Job Snijders writes:
 > On Wed, Apr 15, 2020, at 12:46, Martin Hoffmann wrote:
 > > An attacker who can delete files can as easily replace them with
 > > something else with the same result. So I am not sure the added code
 > > complexity is worth it.
 > Agreed. 
 > fwiw: rpki-client runs as "openrsync -rlt --delete rsync://xxx/repository xxx/repository"

I agree with this behavior as well.

Further, it leads me to make a new straw man proposal for our
pre-Interim/Virtual meeting discussion.

Earlier in a related thread I wrote "[...] in the context of the RPKI,
we need to reach a point where all RFC-compliant RPs will generate
identical sets of VRPs when presented with the same input."  That
statement did not generate any pushback (but feel free to disagree now
if you want). 

Now I would like to push to see if we can take it further.  Please
bash this proposed goal:

 Each validation run of each RFC-compliant RP will generate the same
 set of VRPs when presented with identical input, using unexpired
 records from previous retrievals to deal with only complete failure
 to retrieve from a PP.

This implies that the "cache" aspects of an RP serve two purposes: 

 (1) reducing the amount of data to be downloaded on subsequent runs


 (2) addressing the case of a PP that is temporarily completely
 unreachable, for only as long as those retrieved records have not

In other words, RPs should assume an empty cache, except in the case
where a previously-reached PP is now temporarily completely

Commence bashing. :)

						Jay B.