Block #292,204

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/3/2013, 2:44:36 PM · Difficulty 9.9902 · 6,517,723 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8764e04ca125f9b8c19087833e53490140c5280897c7d81f0a844835b5a2093c

Height

#292,204

Difficulty

9.990193

Transactions

3

Size

3.61 KB

Version

2

Bits

09fd7d51

Nonce

93,015

Timestamp

12/3/2013, 2:44:36 PM

Confirmations

6,517,723

Merkle Root

34815e0634c7f1da196ac47253c8a20e2546489ff5978cfa5d1e82bd6fafc6e4
Transactions (3)
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.178 × 10⁹²(93-digit number)
21783672368118803470…07594429744773878999
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.178 × 10⁹²(93-digit number)
21783672368118803470…07594429744773878999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.356 × 10⁹²(93-digit number)
43567344736237606941…15188859489547757999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.713 × 10⁹²(93-digit number)
87134689472475213883…30377718979095515999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.742 × 10⁹³(94-digit number)
17426937894495042776…60755437958191031999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.485 × 10⁹³(94-digit number)
34853875788990085553…21510875916382063999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.970 × 10⁹³(94-digit number)
69707751577980171106…43021751832764127999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.394 × 10⁹⁴(95-digit number)
13941550315596034221…86043503665528255999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.788 × 10⁹⁴(95-digit number)
27883100631192068442…72087007331056511999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.576 × 10⁹⁴(95-digit number)
55766201262384136885…44174014662113023999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.115 × 10⁹⁵(96-digit number)
11153240252476827377…88348029324226047999
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,723,502 XPM·at block #6,809,926 · 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