Block #2,177,349

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/25/2017, 12:38:34 PM · Difficulty 10.9225 · 4,665,632 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ab3e9fabfbe9009c101f84b409a5abc2c8a860439efc6a2a82644cd8aed059c4

Height

#2,177,349

Difficulty

10.922510

Transactions

1

Size

199 B

Version

2

Bits

0aec29a0

Nonce

314,590,872

Timestamp

6/25/2017, 12:38:34 PM

Confirmations

4,665,632

Merkle Root

372b81e9cba4bdab50f05a14f4efe3c47320a2fdd9a8b40e32b66f5cb96c5ab4
Transactions (1)
1 in → 1 out8.3700 XPM110 B
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.195 × 10⁹²(93-digit number)
21951043968225064951…24126183038500326239
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.195 × 10⁹²(93-digit number)
21951043968225064951…24126183038500326239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.390 × 10⁹²(93-digit number)
43902087936450129903…48252366077000652479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.780 × 10⁹²(93-digit number)
87804175872900259806…96504732154001304959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.756 × 10⁹³(94-digit number)
17560835174580051961…93009464308002609919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.512 × 10⁹³(94-digit number)
35121670349160103922…86018928616005219839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.024 × 10⁹³(94-digit number)
70243340698320207845…72037857232010439679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.404 × 10⁹⁴(95-digit number)
14048668139664041569…44075714464020879359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.809 × 10⁹⁴(95-digit number)
28097336279328083138…88151428928041758719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.619 × 10⁹⁴(95-digit number)
56194672558656166276…76302857856083517439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.123 × 10⁹⁵(96-digit number)
11238934511731233255…52605715712167034879
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