Block #1,414,427

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/15/2016, 2:54:46 PM · Difficulty 10.7974 · 5,416,693 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
57c943c28719148f25ded95afc15185210a120bc4c43e3c39bbcc9ad305ec0f2

Height

#1,414,427

Difficulty

10.797422

Transactions

2

Size

723 B

Version

2

Bits

0acc23da

Nonce

1,236,083,920

Timestamp

1/15/2016, 2:54:46 PM

Confirmations

5,416,693

Merkle Root

cd94ace620a4543790026a43594d00d97495d9e1dd91c652c6cf01a5ce74b6eb
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.

5.781 × 10⁹⁶(97-digit number)
57818467501418662749…29977440262179993601
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
5.781 × 10⁹⁶(97-digit number)
57818467501418662749…29977440262179993601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.156 × 10⁹⁷(98-digit number)
11563693500283732549…59954880524359987201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.312 × 10⁹⁷(98-digit number)
23127387000567465099…19909761048719974401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.625 × 10⁹⁷(98-digit number)
46254774001134930199…39819522097439948801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.250 × 10⁹⁷(98-digit number)
92509548002269860398…79639044194879897601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.850 × 10⁹⁸(99-digit number)
18501909600453972079…59278088389759795201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.700 × 10⁹⁸(99-digit number)
37003819200907944159…18556176779519590401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.400 × 10⁹⁸(99-digit number)
74007638401815888318…37112353559039180801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.480 × 10⁹⁹(100-digit number)
14801527680363177663…74224707118078361601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.960 × 10⁹⁹(100-digit number)
29603055360726355327…48449414236156723201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.920 × 10⁹⁹(100-digit number)
59206110721452710655…96898828472313446401
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,893,106 XPM·at block #6,831,119 · 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