On Wed, 2009-01-28 at 16:55 -0500, Bowie Bailey wrote:
> Yet Another Ninja wrote:
> > On 1/28/2009 10:22 PM, Bowie Bailey wrote:

> > > > 90_2tld.cf.sare.sa-update.dostech.net (from SARE)
> > > 
> > > I haven't seen this rule set before.  Is there any information out
> > > there about it?  There doesn't seem to be anything on the SARE
> > > rules page. 
> > 
> > http://www.rulesemporium.com/rules/90_2tld.cf
> 
> Yes, I found the file itself, but it doesn't give much information about
> it.
> 
> What is it for?

It lists free and abused sub-domain hosters.

The reason is, that because e.g. blogspot.com itself will never be
listed by BLs, the network tests instead will be done for the second
level TLD domain:  spammer-abused.blogspot.com

This is useful with blacklists actually listing those domains by using
the 2nd level TLD as registrar boundaries -- currently that's URIBL only
for the stuff you find in that file.

It is used by other BLs for "real" 2nd level TLDs, like co.uk, which are
defined in SA.


> What is "the RegistrarBoundaries code" and why should I update it?

$ locate RegistrarBoundaries

You don't update the code. ;)


> This file doesn't have any actual rules in it.  Do these settings affect
> the standard rules or do I need something else?

They are settings, not rules.
  http://spamassassin.apache.org/full/3.2.x/doc/Mail_SpamAssassin_Conf.html

They do affect some URIs to check against BLs. See above. It's a self
contained cf file (actually, an entire sa-update channel has been
mentioned), so you do not need anything -- other than SA >= 3.2.4. ;)


> Any possibilities of false positives or negatives here?

Possibility? Yes, just like with any other BL match. Though IMHO, the
odds are about zero for FPs.

Unless another BL righfully blacklists an entire domain listed in that
file, there is no possibility for FNs.

  guenther


-- 
char *t="\10pse\0r\0dtu...@ghno\x4e\xc8\x79\xf4\xab\x51\x8a\x10\xf4\xf4\xc4";
main(){ char h,m=h=*t++,*x=t+2*h,c,i,l=*x,s=0; for (i=0;i<l;i++){ i%8? c<<=1:
(c=*++x); c&128 && (s+=h); if (!(h>>=1)||!t[s+h]){ putchar(t[s]);h=m;s=0; }}}

Reply via email to