Block #503,120

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/20/2014, 9:22:25 PM · Difficulty 10.8081 · 6,314,706 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fd4eca6045ceb2d500468abff1eae0260aad879d3b3ae773a7cb8979f6e54bd5

Height

#503,120

Difficulty

10.808132

Transactions

11

Size

2.55 KB

Version

2

Bits

0acee1b6

Nonce

567,106,612

Timestamp

4/20/2014, 9:22:25 PM

Confirmations

6,314,706

Merkle Root

d98bf614e4892bbb7c8515f5d3439989a42101efdb20a3a8e5101f6933be1c94
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.759 × 10⁹⁸(99-digit number)
27592909988560018569…07200118351168751201
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.759 × 10⁹⁸(99-digit number)
27592909988560018569…07200118351168751201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.518 × 10⁹⁸(99-digit number)
55185819977120037139…14400236702337502401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.103 × 10⁹⁹(100-digit number)
11037163995424007427…28800473404675004801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.207 × 10⁹⁹(100-digit number)
22074327990848014855…57600946809350009601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.414 × 10⁹⁹(100-digit number)
44148655981696029711…15201893618700019201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.829 × 10⁹⁹(100-digit number)
88297311963392059423…30403787237400038401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.765 × 10¹⁰⁰(101-digit number)
17659462392678411884…60807574474800076801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.531 × 10¹⁰⁰(101-digit number)
35318924785356823769…21615148949600153601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.063 × 10¹⁰⁰(101-digit number)
70637849570713647538…43230297899200307201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.412 × 10¹⁰¹(102-digit number)
14127569914142729507…86460595798400614401
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,786,672 XPM·at block #6,817,825 · 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