Block #141,595

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/30/2013, 10:21:35 AM · Difficulty 9.8351 · 6,666,598 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
fd67bcff9cdbac766e615819c60ae2f7a80d9943f14db8e97bfe5b4dbea7df9a

Height

#141,595

Difficulty

9.835052

Transactions

2

Size

10.67 KB

Version

2

Bits

09d5c5fe

Nonce

268,454

Timestamp

8/30/2013, 10:21:35 AM

Confirmations

6,666,598

Merkle Root

6fff9771d15413c09b517fcdef5990f6bc323cb5879ec5a7b01a7cd4b7dec192
Transactions (2)
1 in → 1 out10.4400 XPM109 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.

9.726 × 10⁹⁰(91-digit number)
97262157324506238323…57555474247874601719
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.726 × 10⁹⁰(91-digit number)
97262157324506238323…57555474247874601719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.945 × 10⁹¹(92-digit number)
19452431464901247664…15110948495749203439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.890 × 10⁹¹(92-digit number)
38904862929802495329…30221896991498406879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.780 × 10⁹¹(92-digit number)
77809725859604990659…60443793982996813759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.556 × 10⁹²(93-digit number)
15561945171920998131…20887587965993627519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.112 × 10⁹²(93-digit number)
31123890343841996263…41775175931987255039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.224 × 10⁹²(93-digit number)
62247780687683992527…83550351863974510079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.244 × 10⁹³(94-digit number)
12449556137536798505…67100703727949020159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.489 × 10⁹³(94-digit number)
24899112275073597010…34201407455898040319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.979 × 10⁹³(94-digit number)
49798224550147194021…68402814911796080639
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,709,595 XPM·at block #6,808,192 · 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.

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