Block #502,475

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/20/2014, 10:55:47 AM · Difficulty 10.8073 · 6,305,261 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a6148c24a8e37363a0f8c733343853fb43b041fa25ea65399f6d965b89355506

Height

#502,475

Difficulty

10.807309

Transactions

3

Size

807 B

Version

2

Bits

0aceabc6

Nonce

201,374,600

Timestamp

4/20/2014, 10:55:47 AM

Confirmations

6,305,261

Merkle Root

6b6c0fa30126e7ef8996e23cf6a21dea3f255b47fa49035606ac9f02584d92ae
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.156 × 10⁹⁸(99-digit number)
51567212187332668588…43567793866368257281
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.156 × 10⁹⁸(99-digit number)
51567212187332668588…43567793866368257281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.031 × 10⁹⁹(100-digit number)
10313442437466533717…87135587732736514561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.062 × 10⁹⁹(100-digit number)
20626884874933067435…74271175465473029121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.125 × 10⁹⁹(100-digit number)
41253769749866134870…48542350930946058241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.250 × 10⁹⁹(100-digit number)
82507539499732269741…97084701861892116481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.650 × 10¹⁰⁰(101-digit number)
16501507899946453948…94169403723784232961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.300 × 10¹⁰⁰(101-digit number)
33003015799892907896…88338807447568465921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.600 × 10¹⁰⁰(101-digit number)
66006031599785815793…76677614895136931841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.320 × 10¹⁰¹(102-digit number)
13201206319957163158…53355229790273863681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.640 × 10¹⁰¹(102-digit number)
26402412639914326317…06710459580547727361
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,705,923 XPM·at block #6,807,735 · 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