Block #537,583

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/11/2014, 11:07:03 PM · Difficulty 10.9164 · 6,273,353 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
902f16bfee9b2c768a8577fc7c8315319d94700af3607046dc6b3b65ca91192d

Height

#537,583

Difficulty

10.916387

Transactions

4

Size

5.38 KB

Version

2

Bits

0aea9854

Nonce

72,964,636

Timestamp

5/11/2014, 11:07:03 PM

Confirmations

6,273,353

Merkle Root

3dbf798372f9482d8d341be111d941f0a1660f5b44466ad97ceab124a981cfa8
Transactions (4)
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.

1.442 × 10⁹⁶(97-digit number)
14425969906192409591…27214607971376403749
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
1.442 × 10⁹⁶(97-digit number)
14425969906192409591…27214607971376403749
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.885 × 10⁹⁶(97-digit number)
28851939812384819182…54429215942752807499
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.770 × 10⁹⁶(97-digit number)
57703879624769638364…08858431885505614999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.154 × 10⁹⁷(98-digit number)
11540775924953927672…17716863771011229999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.308 × 10⁹⁷(98-digit number)
23081551849907855345…35433727542022459999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.616 × 10⁹⁷(98-digit number)
46163103699815710691…70867455084044919999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.232 × 10⁹⁷(98-digit number)
92326207399631421383…41734910168089839999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.846 × 10⁹⁸(99-digit number)
18465241479926284276…83469820336179679999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.693 × 10⁹⁸(99-digit number)
36930482959852568553…66939640672359359999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.386 × 10⁹⁸(99-digit number)
73860965919705137106…33879281344718719999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.477 × 10⁹⁹(100-digit number)
14772193183941027421…67758562689437439999
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,731,592 XPM·at block #6,810,935 · 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