Block #503,423

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/21/2014, 2:18:19 AM · Difficulty 10.8084 · 6,314,598 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
049ae7c51a907ea7a6c6b380ce2c1a394dc18310687f324eb799727654f4af3e

Height

#503,423

Difficulty

10.808377

Transactions

2

Size

1.61 KB

Version

2

Bits

0acef1c9

Nonce

45,817,520

Timestamp

4/21/2014, 2:18:19 AM

Confirmations

6,314,598

Merkle Root

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

2.474 × 10⁹⁹(100-digit number)
24744493818863669254…10946574021314222079
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
2.474 × 10⁹⁹(100-digit number)
24744493818863669254…10946574021314222079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.948 × 10⁹⁹(100-digit number)
49488987637727338509…21893148042628444159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.897 × 10⁹⁹(100-digit number)
98977975275454677019…43786296085256888319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.979 × 10¹⁰⁰(101-digit number)
19795595055090935403…87572592170513776639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.959 × 10¹⁰⁰(101-digit number)
39591190110181870807…75145184341027553279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.918 × 10¹⁰⁰(101-digit number)
79182380220363741615…50290368682055106559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.583 × 10¹⁰¹(102-digit number)
15836476044072748323…00580737364110213119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.167 × 10¹⁰¹(102-digit number)
31672952088145496646…01161474728220426239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.334 × 10¹⁰¹(102-digit number)
63345904176290993292…02322949456440852479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.266 × 10¹⁰²(103-digit number)
12669180835258198658…04645898912881704959
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,788,235 XPM·at block #6,818,020 · 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