On Thu 05/Apr/2018 17:19:10 +0200 Kurt Andersen (b) wrote:
> On Thu, Apr 5, 2018 at 7:22 AM, Peter M. Goldstein wrote:
>
>>> Hi,
>>>
>>> These are both a species of the same problem, yes. The solution so
>>> far has been to say that you're supposed to match the longest of the
>>> candidate set...
>>
>>
>> Right. And the suggestion that Kurt made was to modify this to:
>>
>> 1. Check the domain itself
>> 2. Check the longest of the organizational domain candidate set
>> 3. Check the shortest of the organizational domain candidate set
>>
>
> Not quite. Steps 2 & 3 would be (adapted from the language of the DMARC
> spec itself):
>
> 2. (from 3.2 step 3) "search the PSL for the name that matches the largest
> number of labels found in the subject DNS domain. Let that number be "x". /
> (step 4) Construct a new DNS domain name using the name matched form the
> PSL and prefixing to it the "x+1"th label"...[this] is the org domain.
>
> 3. Check the name created from the "x" labels determined in step 2 (hence
> my designation as "org-1").
>
> These are not the same as "longest" and "shortest" names from the org
> domain candidate set unless the psl code follows that specified
> construction algorithm.
FWIW, here's the wording of the PSL(1) man page:
--print-unreg-domain
Returned data: the longest public suffix part for each domain.
--print-reg-domain
Returned data: the shortest private suffix part for each domain.
[...]
COPYRIGHT
libpsl and `psl' are copyright © 2014-2016 Tim Ruehsen under an MIT-
style License.
This documentation was written by Daniel Kahn Gillmor for the Debian
project, but may be used by others under the same license as libpsl
itself.
psl 0.13.0 July 2016 PSL(1)
--
_______________________________________________
dmarc mailing list
[email protected]
https://www.ietf.org/mailman/listinfo/dmarc
