Block #172,325

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/20/2013, 4:04:55 AM · Difficulty 9.8626 · 6,652,173 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
04ee9df5396e6fd529249b07e2557ca62a23cf7f2ce2f2800269ca0880039f1c

Height

#172,325

Difficulty

9.862578

Transactions

2

Size

356 B

Version

2

Bits

09dcd1e3

Nonce

529,247

Timestamp

9/20/2013, 4:04:55 AM

Confirmations

6,652,173

Merkle Root

e7436cc6395dcc6ac80c13a6672fb4d1710188c1db4739e81c6ac78bdd4d59be
Transactions (2)
1 in → 1 out10.2800 XPM109 B
1 in → 1 out10.2600 XPM158 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.632 × 10⁹¹(92-digit number)
26325845414817260984…31990044862256686719
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.632 × 10⁹¹(92-digit number)
26325845414817260984…31990044862256686719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.265 × 10⁹¹(92-digit number)
52651690829634521968…63980089724513373439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.053 × 10⁹²(93-digit number)
10530338165926904393…27960179449026746879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.106 × 10⁹²(93-digit number)
21060676331853808787…55920358898053493759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.212 × 10⁹²(93-digit number)
42121352663707617575…11840717796106987519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.424 × 10⁹²(93-digit number)
84242705327415235150…23681435592213975039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.684 × 10⁹³(94-digit number)
16848541065483047030…47362871184427950079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.369 × 10⁹³(94-digit number)
33697082130966094060…94725742368855900159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.739 × 10⁹³(94-digit number)
67394164261932188120…89451484737711800319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.347 × 10⁹⁴(95-digit number)
13478832852386437624…78902969475423600639
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,840,057 XPM·at block #6,824,497 · 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