Block #538,981

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/12/2014, 1:20:29 PM · Difficulty 10.9250 · 6,270,646 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e2ce54940e1a8927be66ce6b98a3eba06f2411a78e88f5bc6089b1409674c081

Height

#538,981

Difficulty

10.924988

Transactions

2

Size

394 B

Version

2

Bits

0aeccbfd

Nonce

5,922,384

Timestamp

5/12/2014, 1:20:29 PM

Confirmations

6,270,646

Merkle Root

e206a252ca745b71f8d24336e7f2485621edc595be9ed0107e553b8247c77353
Transactions (2)
1 in → 1 out8.3700 XPM110 B
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.328 × 10⁹⁸(99-digit number)
23282998644713107576…55885805906588477441
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.328 × 10⁹⁸(99-digit number)
23282998644713107576…55885805906588477441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.656 × 10⁹⁸(99-digit number)
46565997289426215152…11771611813176954881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.313 × 10⁹⁸(99-digit number)
93131994578852430305…23543223626353909761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.862 × 10⁹⁹(100-digit number)
18626398915770486061…47086447252707819521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.725 × 10⁹⁹(100-digit number)
37252797831540972122…94172894505415639041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.450 × 10⁹⁹(100-digit number)
74505595663081944244…88345789010831278081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.490 × 10¹⁰⁰(101-digit number)
14901119132616388848…76691578021662556161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.980 × 10¹⁰⁰(101-digit number)
29802238265232777697…53383156043325112321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.960 × 10¹⁰⁰(101-digit number)
59604476530465555395…06766312086650224641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.192 × 10¹⁰¹(102-digit number)
11920895306093111079…13532624173300449281
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,721,093 XPM·at block #6,809,626 · 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