Block #505,438

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/22/2014, 10:50:30 AM · Difficulty 10.8110 · 6,333,264 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0f3ed6728c10e06f2f12a6525f39de5f9bb4d249df46d4c68fe4ccd5e8b66a4d

Height

#505,438

Difficulty

10.810954

Transactions

2

Size

1.29 KB

Version

2

Bits

0acf9aaf

Nonce

54,167,588

Timestamp

4/22/2014, 10:50:30 AM

Confirmations

6,333,264

Merkle Root

3191fdfe76b07a0ca60c5d27a60c1185b8295ce38b0b9ab31a9ad2b89c10b9f5
Transactions (2)
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.

3.291 × 10⁹⁸(99-digit number)
32910349917345758695…93360402258008999519
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
3.291 × 10⁹⁸(99-digit number)
32910349917345758695…93360402258008999519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.582 × 10⁹⁸(99-digit number)
65820699834691517390…86720804516017999039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.316 × 10⁹⁹(100-digit number)
13164139966938303478…73441609032035998079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.632 × 10⁹⁹(100-digit number)
26328279933876606956…46883218064071996159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.265 × 10⁹⁹(100-digit number)
52656559867753213912…93766436128143992319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.053 × 10¹⁰⁰(101-digit number)
10531311973550642782…87532872256287984639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.106 × 10¹⁰⁰(101-digit number)
21062623947101285565…75065744512575969279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.212 × 10¹⁰⁰(101-digit number)
42125247894202571130…50131489025151938559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.425 × 10¹⁰⁰(101-digit number)
84250495788405142260…00262978050303877119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.685 × 10¹⁰¹(102-digit number)
16850099157681028452…00525956100607754239
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,953,881 XPM·at block #6,838,701 · 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