Block #574,934

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/3/2014, 3:41:23 PM · Difficulty 10.9679 · 6,252,301 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e5020c6e5b8b9a18dae239aae5f42f7849144de5b4b780ef20709e0480a26556

Height

#574,934

Difficulty

10.967926

Transactions

15

Size

4.73 KB

Version

2

Bits

0af7ca05

Nonce

205,491,883

Timestamp

6/3/2014, 3:41:23 PM

Confirmations

6,252,301

Merkle Root

0b9d54834c27b08eaf135b7465e10bf3fda833fdc62d90dd582950f99f5ba1d1
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.911 × 10⁹⁸(99-digit number)
19111054416809657303…08187333962739134721
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.911 × 10⁹⁸(99-digit number)
19111054416809657303…08187333962739134721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.822 × 10⁹⁸(99-digit number)
38222108833619314607…16374667925478269441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.644 × 10⁹⁸(99-digit number)
76444217667238629215…32749335850956538881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.528 × 10⁹⁹(100-digit number)
15288843533447725843…65498671701913077761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.057 × 10⁹⁹(100-digit number)
30577687066895451686…30997343403826155521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.115 × 10⁹⁹(100-digit number)
61155374133790903372…61994686807652311041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.223 × 10¹⁰⁰(101-digit number)
12231074826758180674…23989373615304622081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.446 × 10¹⁰⁰(101-digit number)
24462149653516361349…47978747230609244161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.892 × 10¹⁰⁰(101-digit number)
48924299307032722698…95957494461218488321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.784 × 10¹⁰⁰(101-digit number)
97848598614065445396…91914988922436976641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.956 × 10¹⁰¹(102-digit number)
19569719722813089079…83829977844873953281
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,861,980 XPM·at block #6,827,234 · 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