Block #502,828

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/20/2014, 4:35:59 PM · Difficulty 10.8079 · 6,307,639 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3c3b46c1f93c0ee104c01c57a42f4b658ef120635415988a12fc6f07d45c55c0

Height

#502,828

Difficulty

10.807877

Transactions

1

Size

631 B

Version

2

Bits

0aced105

Nonce

82,287,640

Timestamp

4/20/2014, 4:35:59 PM

Confirmations

6,307,639

Merkle Root

969811319f0ae34eed7ba3015e36eb225a34321003678f515e214479fe1fa9d5
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.

8.311 × 10⁹⁸(99-digit number)
83115058103742116869…40699787692769804801
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
8.311 × 10⁹⁸(99-digit number)
83115058103742116869…40699787692769804801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.662 × 10⁹⁹(100-digit number)
16623011620748423373…81399575385539609601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.324 × 10⁹⁹(100-digit number)
33246023241496846747…62799150771079219201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.649 × 10⁹⁹(100-digit number)
66492046482993693495…25598301542158438401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.329 × 10¹⁰⁰(101-digit number)
13298409296598738699…51196603084316876801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.659 × 10¹⁰⁰(101-digit number)
26596818593197477398…02393206168633753601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.319 × 10¹⁰⁰(101-digit number)
53193637186394954796…04786412337267507201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.063 × 10¹⁰¹(102-digit number)
10638727437278990959…09572824674535014401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.127 × 10¹⁰¹(102-digit number)
21277454874557981918…19145649349070028801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.255 × 10¹⁰¹(102-digit number)
42554909749115963837…38291298698140057601
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,727,822 XPM·at block #6,810,466 · 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