Block #494,548

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/16/2014, 5:40:32 AM · Difficulty 10.7206 · 6,313,584 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ce32e31cc496ab7a9f3067e23cbb9e32095482a00ade6c5ffd389495b62365e2

Height

#494,548

Difficulty

10.720590

Transactions

15

Size

3.58 KB

Version

2

Bits

0ab8789a

Nonce

288,286

Timestamp

4/16/2014, 5:40:32 AM

Confirmations

6,313,584

Merkle Root

ed128c80639157bf453090037d0a8aaa7494a1eac0f7fc7db1907d699ae44365
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.391 × 10⁹⁸(99-digit number)
13914889422217492154…15468314827623770751
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.391 × 10⁹⁸(99-digit number)
13914889422217492154…15468314827623770751
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.782 × 10⁹⁸(99-digit number)
27829778844434984309…30936629655247541501
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.565 × 10⁹⁸(99-digit number)
55659557688869968618…61873259310495083001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.113 × 10⁹⁹(100-digit number)
11131911537773993723…23746518620990166001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.226 × 10⁹⁹(100-digit number)
22263823075547987447…47493037241980332001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.452 × 10⁹⁹(100-digit number)
44527646151095974894…94986074483960664001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.905 × 10⁹⁹(100-digit number)
89055292302191949789…89972148967921328001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.781 × 10¹⁰⁰(101-digit number)
17811058460438389957…79944297935842656001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.562 × 10¹⁰⁰(101-digit number)
35622116920876779915…59888595871685312001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.124 × 10¹⁰⁰(101-digit number)
71244233841753559831…19777191743370624001
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,709,097 XPM·at block #6,808,131 · 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