Block #2,271,805

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/28/2017, 11:43:29 AM · Difficulty 10.9540 · 4,554,995 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
dacc521d0539b15e89570d1582d6ed0669c44eb50f618cd62ce33f3c2f505e75

Height

#2,271,805

Difficulty

10.953995

Transactions

2

Size

723 B

Version

2

Bits

0af43900

Nonce

82,457,587

Timestamp

8/28/2017, 11:43:29 AM

Confirmations

4,554,995

Merkle Root

3559c27fb8e8c88a193d9113da7bd51ae8117170b4b3fe2a2774a8ed2aa1c47b
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.

7.095 × 10⁹⁴(95-digit number)
70959662267483456196…52411269450694350401
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
7.095 × 10⁹⁴(95-digit number)
70959662267483456196…52411269450694350401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.419 × 10⁹⁵(96-digit number)
14191932453496691239…04822538901388700801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.838 × 10⁹⁵(96-digit number)
28383864906993382478…09645077802777401601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.676 × 10⁹⁵(96-digit number)
56767729813986764957…19290155605554803201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.135 × 10⁹⁶(97-digit number)
11353545962797352991…38580311211109606401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.270 × 10⁹⁶(97-digit number)
22707091925594705982…77160622422219212801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.541 × 10⁹⁶(97-digit number)
45414183851189411965…54321244844438425601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.082 × 10⁹⁶(97-digit number)
90828367702378823931…08642489688876851201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.816 × 10⁹⁷(98-digit number)
18165673540475764786…17284979377753702401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.633 × 10⁹⁷(98-digit number)
36331347080951529572…34569958755507404801
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,858,563 XPM·at block #6,826,799 · 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