Block #411,965

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 2/20/2014, 5:07:28 AM · Difficulty 10.4162 · 6,413,591 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
53d0a91743eca76d61d5f8c96f7092702aaa3f2ffc08862e248ce93f07a1003b

Height

#411,965

Difficulty

10.416182

Transactions

2

Size

576 B

Version

2

Bits

0a6a8aee

Nonce

11,536

Timestamp

2/20/2014, 5:07:28 AM

Confirmations

6,413,591

Merkle Root

aa33a8f8997e8cd2a269a5aa2c3b3b88694c88094b3cd624d8a8e52ff618c6f7
Transactions (2)
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.564 × 10¹⁰⁰(101-digit number)
15641095044475395080…96457131848945891521
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.564 × 10¹⁰⁰(101-digit number)
15641095044475395080…96457131848945891521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.128 × 10¹⁰⁰(101-digit number)
31282190088950790160…92914263697891783041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.256 × 10¹⁰⁰(101-digit number)
62564380177901580320…85828527395783566081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.251 × 10¹⁰¹(102-digit number)
12512876035580316064…71657054791567132161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.502 × 10¹⁰¹(102-digit number)
25025752071160632128…43314109583134264321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.005 × 10¹⁰¹(102-digit number)
50051504142321264256…86628219166268528641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.001 × 10¹⁰²(103-digit number)
10010300828464252851…73256438332537057281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.002 × 10¹⁰²(103-digit number)
20020601656928505702…46512876665074114561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.004 × 10¹⁰²(103-digit number)
40041203313857011404…93025753330148229121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.008 × 10¹⁰²(103-digit number)
80082406627714022809…86051506660296458241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.601 × 10¹⁰³(104-digit number)
16016481325542804561…72103013320592916481
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,848,548 XPM·at block #6,825,555 · 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.
Privacy Policy·

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