Block #3,938,181

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 11/6/2020, 10:37:49 PM · Difficulty 10.8627 · 2,873,881 confirmations

1CC
Cunningham Chain of the First Kind

A sequence where each prime is double the previous prime plus one.

Block Header
Block Hash
d5405f425d7523e5eb4cc3c0279a605c0d4e8c9a60a9257c124bf22df881904b

Height

#3,938,181

Difficulty

10.862718

Transactions

3

Size

2.44 KB

Version

2

Bits

0adcdb19

Nonce

176,830,685

Timestamp

11/6/2020, 10:37:49 PM

Confirmations

2,873,881

Merkle Root

5c19bfa1f9b8ed196932decb7e0d30c64ff2c87628367441b64a603f7c592d70
Transactions (3)
Prime Chain Origin

This is the prime chain origin stored in the block header. It is a composite number (not prime itself) — it equals the first prime in the chain multiplied by a primorial. The origin anchors the entire chain to this specific block.

1.342 × 10⁹⁴(95-digit number)
13421091108815964438…48081109158794382399
Discovered Prime Numbers
p_k = 2^k × origin − 1

These are the actual prime numbers discovered by this block, computed using the verified Primecoin formula. Each number has been independently confirmed to pass the Fermat primality test. Use the FactorDB links to verify any number independently.

1
origin − 1
1.342 × 10⁹⁴(95-digit number)
13421091108815964438…48081109158794382399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.684 × 10⁹⁴(95-digit number)
26842182217631928876…96162218317588764799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.368 × 10⁹⁴(95-digit number)
53684364435263857753…92324436635177529599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.073 × 10⁹⁵(96-digit number)
10736872887052771550…84648873270355059199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.147 × 10⁹⁵(96-digit number)
21473745774105543101…69297746540710118399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.294 × 10⁹⁵(96-digit number)
42947491548211086202…38595493081420236799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.589 × 10⁹⁵(96-digit number)
85894983096422172405…77190986162840473599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.717 × 10⁹⁶(97-digit number)
17178996619284434481…54381972325680947199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.435 × 10⁹⁶(97-digit number)
34357993238568868962…08763944651361894399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.871 × 10⁹⁶(97-digit number)
68715986477137737924…17527889302723788799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.374 × 10⁹⁷(98-digit number)
13743197295427547584…35055778605447577599
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 consecutive prime numbers forming a Cunningham Chain of the First Kind. The prime chain origin — the large number shown above — anchors the chain and is divisible by a primorial (the product of small primes), cryptographically tying these prime numbers to this specific block.

★★★☆☆
Rarity
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

How Primecoin's Proof-of-Work Constructs These Primes

Primecoin stores a value called the prime chain origin in each block. The miner found a large integer such that when divided by a primorial (the product of small primes: 2 × 3 × 5 × 7 × …), the result is the first prime in the chain. The origin is deliberately divisible by this primorial — that divisibility is part of the proof.

Prime Chain Origin = First Prime × Primorial (2·3·5·7·11·…)
Source: Primecoin prime.cpp — CheckPrimeProofOfWork()

This is why the origin has many small prime factors — those factors are the primorial divisor. The chain then extends from the first prime using the 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,740,604 XPM·at block #6,812,061 · updates every 60s
xpmprime.info is a work in progress. If you enjoy using this service you can support this project with a Primecoin donation.

Cookie Preferences

We use cookies to enhance your experience. Some are essential for the site to function, while others help us understand how you use the site.

·Privacy Policy