Block #590,197

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/16/2014, 2:59:00 AM · Difficulty 10.9459 · 6,227,291 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
90b95c43d259d7d5bc4178a968508445da3e9071aef214dd7a1ed7f4647137a4

Height

#590,197

Difficulty

10.945919

Transactions

5

Size

1.23 KB

Version

2

Bits

0af227c0

Nonce

23,294,769

Timestamp

6/16/2014, 2:59:00 AM

Confirmations

6,227,291

Merkle Root

0ab62998927b7c12a1a757a1f8df87d2d5a7cfa688c014fff599b228c7242f05
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.

7.786 × 10⁹⁶(97-digit number)
77864711794014907560…00908908407501733351
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
7.786 × 10⁹⁶(97-digit number)
77864711794014907560…00908908407501733351
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.557 × 10⁹⁷(98-digit number)
15572942358802981512…01817816815003466701
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.114 × 10⁹⁷(98-digit number)
31145884717605963024…03635633630006933401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.229 × 10⁹⁷(98-digit number)
62291769435211926048…07271267260013866801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.245 × 10⁹⁸(99-digit number)
12458353887042385209…14542534520027733601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.491 × 10⁹⁸(99-digit number)
24916707774084770419…29085069040055467201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.983 × 10⁹⁸(99-digit number)
49833415548169540838…58170138080110934401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.966 × 10⁹⁸(99-digit number)
99666831096339081676…16340276160221868801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.993 × 10⁹⁹(100-digit number)
19933366219267816335…32680552320443737601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.986 × 10⁹⁹(100-digit number)
39866732438535632670…65361104640887475201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.973 × 10⁹⁹(100-digit number)
79733464877071265341…30722209281774950401
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,783,959 XPM·at block #6,817,487 · 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