Block #2,170,544

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/21/2017, 1:50:59 PM · Difficulty 10.9031 · 4,672,437 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c9782a843e8e248da2f51562c539d6dfde6cf3e01d328b3ce4d9a8a5ea4f2e9f

Height

#2,170,544

Difficulty

10.903060

Transactions

2

Size

426 B

Version

2

Bits

0ae72ef7

Nonce

1,547,172,991

Timestamp

6/21/2017, 1:50:59 PM

Confirmations

4,672,437

Merkle Root

658ac742e69a156ac0891ef5a0d1bc665cbc88002b1197bc815d25d64f8ee8fc
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.

2.413 × 10⁹⁵(96-digit number)
24138453384159708794…89471474457464617599
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
2.413 × 10⁹⁵(96-digit number)
24138453384159708794…89471474457464617599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.827 × 10⁹⁵(96-digit number)
48276906768319417589…78942948914929235199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.655 × 10⁹⁵(96-digit number)
96553813536638835179…57885897829858470399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.931 × 10⁹⁶(97-digit number)
19310762707327767035…15771795659716940799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.862 × 10⁹⁶(97-digit number)
38621525414655534071…31543591319433881599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.724 × 10⁹⁶(97-digit number)
77243050829311068143…63087182638867763199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.544 × 10⁹⁷(98-digit number)
15448610165862213628…26174365277735526399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.089 × 10⁹⁷(98-digit number)
30897220331724427257…52348730555471052799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.179 × 10⁹⁷(98-digit number)
61794440663448854515…04697461110942105599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.235 × 10⁹⁸(99-digit number)
12358888132689770903…09394922221884211199
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,988,202 XPM·at block #6,842,980 · 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