Main

processing priority

3

site type

0 (generic, awaiting analysis)

review version

11

html import

20 (imported)

Events

first seen date

2023-12-20 08:33:15

expired found date

-

created at

2024-06-08 07:07:49

updated at

2026-01-01 05:14:20

Domain name statistics

length

6

crc

52047

tld

124

nm parts

0

nm random digits

0

nm rare letters

0

Connections

is subdomain of id

-

previous id

0

replaced with id

0

related id

-

dns primary id

173561409

dns alternative id

0

lifecycle status

0 (unclassified, or currently active)

Subdomains and pages

deleted subdomains

0

page imported products

0

page imported random

0

page imported parking

0

Error counters

count skipped due to recent timeouts on the same server IP

0

count content received but rejected due to 11-799

0

count dns errors

0

count cert errors

0

count timeouts

0

count http 429

0

count http 404

0

count http 403

0

count http 5xx

0

next operation date

-

Server

server bits

server ip

-

Mainpage statistics

mp import status

20

mp rejected date

-

mp saved date

-

mp size orig

22546

mp size raw text

14034

mp inner links count

3

mp inner links status

20 (imported)

Open Graph

title

description

Paul Khuong's personal blog. Some Lisp, some optimisation, mathematical or computer.

image

site name

author

Paul Khuong

updated

2025-12-20 12:11:10

raw text

Paul Khuong: some Lisp Paul Khuong: some Lisp Blog Archives RSS Fixing the hashing in "Hashing modulo α-equivalence" Dec 29th, 2022 | Comments Per Vognsen sent me a link to Maziarz et al’s Hashing Modulo Alpha-Equivalence because its Lemma 6.6 claims to solve a thorny problem we have both encountered several times. Essentially, the lemma says that computing the natural recursive combination of hash values over \(2^b\) bits for two distinct trees (ADT instances) \(a\) and \(b\) yields a collision probability at most \(\frac{|a| + |b|}{2^b}\) if we use a random hash function (sure), and Section 6.2 claims without proof that the result can be safely extended to the unspecified “seeded” hash function they use. That’s a minor result, and the paper’s most interesting contribution (to me) is an algorithmically efficient alternative to the locally nameless representation : rather than representing bindings with simple binders and complex references, as in de Bruijn i...

Text analysis

redirect type

0 (-)

block type

0 (no issues)

detected language

1 (English)

category id

Porno i podobne (232)

index version

2025110801

spam phrases

1

Text statistics

text nonlatin

1

text cyrillic

0

text characters

10459

text words

2288

text unique words

755

text lines

333

text sentences

68

text paragraphs

44

text words per sentence

33

text matched phrases

1

text matched dictionaries

2

RSS

rss path

rss status

1 (priority 1 already searched, no matches found)

rss found date

-

rss size orig

0

rss items

0

rss spam phrases

0

rss detected language

0 (awaiting analysis)

inbefore feed id

-

inbefore status

0 (new)

Sitemap

sitemap path

sitemap status

1 (priority 1 already searched, no matches found)

sitemap review version

1

sitemap urls count

0

sitemap urls adult

0

sitemap filtered products

0

sitemap filtered videos

0

sitemap found date

-

sitemap process date

-

sitemap first import date

-

sitemap last import date

-