Block #529,009

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/7/2014, 12:07:33 AM · Difficulty 10.8885 · 6,298,333 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
48ec088f4c305188671d699159af550d729de92ec6abcfc6340bd6e0669b4f0c

Height

#529,009

Difficulty

10.888500

Transactions

1

Size

799 B

Version

2

Bits

0ae374bc

Nonce

260,932

Timestamp

5/7/2014, 12:07:33 AM

Confirmations

6,298,333

Merkle Root

547391f34c9afcb0dd2d93e0872318da780dd41a4ed0ae45643aed8456dc4f3c
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.681 × 10⁹⁵(96-digit number)
76819196201029016896…26239490473074705921
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.681 × 10⁹⁵(96-digit number)
76819196201029016896…26239490473074705921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.536 × 10⁹⁶(97-digit number)
15363839240205803379…52478980946149411841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.072 × 10⁹⁶(97-digit number)
30727678480411606758…04957961892298823681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.145 × 10⁹⁶(97-digit number)
61455356960823213516…09915923784597647361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.229 × 10⁹⁷(98-digit number)
12291071392164642703…19831847569195294721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.458 × 10⁹⁷(98-digit number)
24582142784329285406…39663695138390589441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.916 × 10⁹⁷(98-digit number)
49164285568658570813…79327390276781178881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.832 × 10⁹⁷(98-digit number)
98328571137317141627…58654780553562357761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.966 × 10⁹⁸(99-digit number)
19665714227463428325…17309561107124715521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.933 × 10⁹⁸(99-digit number)
39331428454926856650…34619122214249431041
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,862,844 XPM·at block #6,827,341 · 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