Block #503,345

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/21/2014, 12:58:02 AM · Difficulty 10.8085 · 6,304,641 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d61b92e42bbb9c621b1c473398551da6b984034a2afda3c30de7bef98ab33878

Height

#503,345

Difficulty

10.808456

Transactions

12

Size

2.80 KB

Version

2

Bits

0acef6f5

Nonce

1,895,377,836

Timestamp

4/21/2014, 12:58:02 AM

Confirmations

6,304,641

Merkle Root

367d18804ca8dd446ac6c686922b3dc5d3e9ac37bfa79a3ef9db55c3b9ee8a77
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.240 × 10⁹⁴(95-digit number)
12403550305400496340…23793363887477631719
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.240 × 10⁹⁴(95-digit number)
12403550305400496340…23793363887477631719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.480 × 10⁹⁴(95-digit number)
24807100610800992680…47586727774955263439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.961 × 10⁹⁴(95-digit number)
49614201221601985360…95173455549910526879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.922 × 10⁹⁴(95-digit number)
99228402443203970720…90346911099821053759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.984 × 10⁹⁵(96-digit number)
19845680488640794144…80693822199642107519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.969 × 10⁹⁵(96-digit number)
39691360977281588288…61387644399284215039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.938 × 10⁹⁵(96-digit number)
79382721954563176576…22775288798568430079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.587 × 10⁹⁶(97-digit number)
15876544390912635315…45550577597136860159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.175 × 10⁹⁶(97-digit number)
31753088781825270630…91101155194273720319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.350 × 10⁹⁶(97-digit number)
63506177563650541261…82202310388547440639
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,707,934 XPM·at block #6,807,985 · 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