Block #2,169,933

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/21/2017, 5:32:22 AM · Difficulty 10.9008 · 4,647,912 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
13cba9656ccce992c15eacebcabaa5668afe7973460cad6a253d748722d2141b

Height

#2,169,933

Difficulty

10.900836

Transactions

2

Size

1.28 KB

Version

2

Bits

0ae69d2f

Nonce

80,318,543

Timestamp

6/21/2017, 5:32:22 AM

Confirmations

4,647,912

Merkle Root

5e122a3092a35c55139f2396ac6c0c31a6ffda4460e7772a382032837a0f1b97
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.

9.523 × 10⁹⁴(95-digit number)
95230668388078701811…21927888498882660721
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
9.523 × 10⁹⁴(95-digit number)
95230668388078701811…21927888498882660721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.904 × 10⁹⁵(96-digit number)
19046133677615740362…43855776997765321441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.809 × 10⁹⁵(96-digit number)
38092267355231480724…87711553995530642881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.618 × 10⁹⁵(96-digit number)
76184534710462961449…75423107991061285761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.523 × 10⁹⁶(97-digit number)
15236906942092592289…50846215982122571521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.047 × 10⁹⁶(97-digit number)
30473813884185184579…01692431964245143041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.094 × 10⁹⁶(97-digit number)
60947627768370369159…03384863928490286081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.218 × 10⁹⁷(98-digit number)
12189525553674073831…06769727856980572161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.437 × 10⁹⁷(98-digit number)
24379051107348147663…13539455713961144321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.875 × 10⁹⁷(98-digit number)
48758102214696295327…27078911427922288641
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,786,825 XPM·at block #6,817,844 · 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