Block #2,272,129

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/28/2017, 5:00:50 PM · Difficulty 10.9541 · 4,558,915 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
dd58e6aabfef0361f3a1f40e395b6693bf3ba936db7ad8b1c9c6cff1c278bb1c

Height

#2,272,129

Difficulty

10.954059

Transactions

10

Size

9.04 KB

Version

2

Bits

0af43d2e

Nonce

635,480,084

Timestamp

8/28/2017, 5:00:50 PM

Confirmations

4,558,915

Merkle Root

e7f4d4a3e756bee2c0294af9269fd72156f49d2ab71d3129d5a23d269dc94b1b
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.200 × 10⁹⁶(97-digit number)
12002322801237869998…64312339317815040001
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.200 × 10⁹⁶(97-digit number)
12002322801237869998…64312339317815040001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.400 × 10⁹⁶(97-digit number)
24004645602475739996…28624678635630080001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.800 × 10⁹⁶(97-digit number)
48009291204951479993…57249357271260160001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.601 × 10⁹⁶(97-digit number)
96018582409902959986…14498714542520320001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.920 × 10⁹⁷(98-digit number)
19203716481980591997…28997429085040640001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.840 × 10⁹⁷(98-digit number)
38407432963961183994…57994858170081280001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.681 × 10⁹⁷(98-digit number)
76814865927922367989…15989716340162560001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.536 × 10⁹⁸(99-digit number)
15362973185584473597…31979432680325120001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.072 × 10⁹⁸(99-digit number)
30725946371168947195…63958865360650240001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.145 × 10⁹⁸(99-digit number)
61451892742337894391…27917730721300480001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.229 × 10⁹⁹(100-digit number)
12290378548467578878…55835461442600960001
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,892,489 XPM·at block #6,831,043 · 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