Block #503,595

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/21/2014, 5:02:50 AM · Difficulty 10.8087 · 6,309,355 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
dd8f96873f5ae9a1d518768daa0aa1fe800322575b490c4c112e31f919665243

Height

#503,595

Difficulty

10.808658

Transactions

1

Size

208 B

Version

2

Bits

0acf043d

Nonce

20,877,285

Timestamp

4/21/2014, 5:02:50 AM

Confirmations

6,309,355

Merkle Root

bcae4b26eacf90b338e9912660c20c0abdae90bb529df77ea892f75de4ef5f9f
Transactions (1)
1 in → 1 out8.5500 XPM116 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.

5.593 × 10⁹⁸(99-digit number)
55932704496027848777…83131728629480819839
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
5.593 × 10⁹⁸(99-digit number)
55932704496027848777…83131728629480819839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.118 × 10⁹⁹(100-digit number)
11186540899205569755…66263457258961639679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.237 × 10⁹⁹(100-digit number)
22373081798411139510…32526914517923279359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.474 × 10⁹⁹(100-digit number)
44746163596822279021…65053829035846558719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.949 × 10⁹⁹(100-digit number)
89492327193644558043…30107658071693117439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.789 × 10¹⁰⁰(101-digit number)
17898465438728911608…60215316143386234879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.579 × 10¹⁰⁰(101-digit number)
35796930877457823217…20430632286772469759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.159 × 10¹⁰⁰(101-digit number)
71593861754915646434…40861264573544939519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.431 × 10¹⁰¹(102-digit number)
14318772350983129286…81722529147089879039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.863 × 10¹⁰¹(102-digit number)
28637544701966258573…63445058294179758079
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,747,640 XPM·at block #6,812,949 · 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