Block #2,271,634

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/28/2017, 9:11:17 AM · Difficulty 10.9538 · 4,555,444 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
da2f712aba208f8365636df48f1b972dcb76abbbf4e4a5ef644e3120c2de0fa1

Height

#2,271,634

Difficulty

10.953824

Transactions

3

Size

799 B

Version

2

Bits

0af42dcc

Nonce

352,792,582

Timestamp

8/28/2017, 9:11:17 AM

Confirmations

4,555,444

Merkle Root

77f3bc99110869815f32adef8b07306e6ea88d801ab704a9a5b30141bf220e6b
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.

5.747 × 10⁹⁴(95-digit number)
57470747499313206506…33630556836944248201
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.747 × 10⁹⁴(95-digit number)
57470747499313206506…33630556836944248201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.149 × 10⁹⁵(96-digit number)
11494149499862641301…67261113673888496401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.298 × 10⁹⁵(96-digit number)
22988298999725282602…34522227347776992801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.597 × 10⁹⁵(96-digit number)
45976597999450565204…69044454695553985601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.195 × 10⁹⁵(96-digit number)
91953195998901130409…38088909391107971201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.839 × 10⁹⁶(97-digit number)
18390639199780226081…76177818782215942401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.678 × 10⁹⁶(97-digit number)
36781278399560452163…52355637564431884801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.356 × 10⁹⁶(97-digit number)
73562556799120904327…04711275128863769601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.471 × 10⁹⁷(98-digit number)
14712511359824180865…09422550257727539201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.942 × 10⁹⁷(98-digit number)
29425022719648361731…18845100515455078401
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,860,808 XPM·at block #6,827,077 · 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