Block #504,035

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/21/2014, 12:45:37 PM · Difficulty 10.8078 · 6,305,733 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6656e920e3af4cd066942a28196b8f37facf5152d23cd7894177770d32217d0c

Height

#504,035

Difficulty

10.807806

Transactions

1

Size

768 B

Version

2

Bits

0acecc64

Nonce

36,874

Timestamp

4/21/2014, 12:45:37 PM

Confirmations

6,305,733

Merkle Root

cafed13acbb1c3a204e4a903a7a0e3f68ec9d4a8096cfd7a488dfe20fbd47f83
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.

6.071 × 10¹⁰²(103-digit number)
60716388389118899959…05045073556715130879
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
6.071 × 10¹⁰²(103-digit number)
60716388389118899959…05045073556715130879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.214 × 10¹⁰³(104-digit number)
12143277677823779991…10090147113430261759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.428 × 10¹⁰³(104-digit number)
24286555355647559983…20180294226860523519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.857 × 10¹⁰³(104-digit number)
48573110711295119967…40360588453721047039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.714 × 10¹⁰³(104-digit number)
97146221422590239934…80721176907442094079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.942 × 10¹⁰⁴(105-digit number)
19429244284518047986…61442353814884188159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.885 × 10¹⁰⁴(105-digit number)
38858488569036095973…22884707629768376319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.771 × 10¹⁰⁴(105-digit number)
77716977138072191947…45769415259536752639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.554 × 10¹⁰⁵(106-digit number)
15543395427614438389…91538830519073505279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.108 × 10¹⁰⁵(106-digit number)
31086790855228876779…83077661038147010559
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,722,231 XPM·at block #6,809,767 · 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