Main

related bits

0

processing priority

3

site type

5 (wiki-type site, growing by topic rather than chronologically)

review version

11

html import

20 (imported)

Thumbnail
ricsonc.github.io
Events

first seen date

2024-03-22 14:32:13

expired found date

-

created at

2024-06-18 02:25:26

updated at

2026-01-03 23:24:41

Domain name statistics

length

17

crc

24443

tld

86

nm parts

0

nm random digits

0

nm rare letters

0

Connections

is subdomain of id

87719371 (github.io)

previous id

0

replaced with id

0

related id

-

dns primary id

0

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

8735

mp size raw text

3419

mp inner links count

3

mp inner links status

20 (imported)

Open Graph

title

description

image

site name

author

updated

2025-12-28 05:10:09

raw text

Ricson Cheng dark Ricson Cheng Personal Projects (code) Torch-&#923CDM Simulations of the universe at the largest scales, such as the "Millenium Run" consume centuries of CPU-time in the name of advancing cosmology. But can we carry out similar experiments on a commodity GPU by leveraging the power of pytorch? I was able to generate a web structure of "filaments" in a system consisting of 4 million particles in under an hour, although I suspect my initial conditions are slightly off. (code) Blindfold Computer Chess A single character of english text contains roughly 1 bit of shannon entropy . What about a single move in a game of chess? Blindfold chess is difficult for humans, but trivial for computers, which have really good memory. But neural networks are often forgetful. Can we use this to make blindfold chess difficult for computers? Answer: About 2 bits, and Yes. (code) More Pixels, Less Noise A modern phone i...

Text analysis

redirect type

0 (-)

block type

0 (no issues)

detected language

1 (English)

category id

AI [en] (229)

index version

2025123101

spam phrases

0

Text statistics

text nonlatin

0

text cyrillic

0

text characters

2595

text words

507

text unique words

284

text lines

65

text sentences

75

text paragraphs

14

text words per sentence

6

text matched phrases

2

text matched dictionaries

6

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

2024-07-01 15:36:47

sitemap first import date

-

sitemap last import date

-