Block #2,171,515

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/22/2017, 3:47:16 AM · Difficulty 10.9056 · 4,669,028 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c2e3f6863910183805945a33e6781616a17b59cafb20e8af22d9a1a75f5dedef

Height

#2,171,515

Difficulty

10.905636

Transactions

2

Size

1.14 KB

Version

2

Bits

0ae7d7c4

Nonce

553,834,692

Timestamp

6/22/2017, 3:47:16 AM

Confirmations

4,669,028

Merkle Root

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

1.273 × 10⁹⁵(96-digit number)
12739084479798050470…03059121501054300079
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.273 × 10⁹⁵(96-digit number)
12739084479798050470…03059121501054300079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.547 × 10⁹⁵(96-digit number)
25478168959596100941…06118243002108600159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.095 × 10⁹⁵(96-digit number)
50956337919192201882…12236486004217200319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.019 × 10⁹⁶(97-digit number)
10191267583838440376…24472972008434400639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.038 × 10⁹⁶(97-digit number)
20382535167676880753…48945944016868801279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.076 × 10⁹⁶(97-digit number)
40765070335353761506…97891888033737602559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.153 × 10⁹⁶(97-digit number)
81530140670707523012…95783776067475205119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.630 × 10⁹⁷(98-digit number)
16306028134141504602…91567552134950410239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.261 × 10⁹⁷(98-digit number)
32612056268283009204…83135104269900820479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.522 × 10⁹⁷(98-digit number)
65224112536566018409…66270208539801640959
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,968,676 XPM·at block #6,840,542 · 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