Block #529,714

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/7/2014, 10:22:11 AM · Difficulty 10.8905 · 6,278,502 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b322d82ff5d4abf5b92ccec95ee2b65d06bcf2dc3eecbd3750d32f471fa78670

Height

#529,714

Difficulty

10.890453

Transactions

3

Size

658 B

Version

2

Bits

0ae3f4b2

Nonce

69,757,990

Timestamp

5/7/2014, 10:22:11 AM

Confirmations

6,278,502

Merkle Root

7c56b218ed2bb756e93e18577eaf2ac3e1cadee4a7008dddef5ec4f8f3c3b9c1
Transactions (3)
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.574 × 10⁹⁸(99-digit number)
15746762807349285904…58030589099003276641
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.574 × 10⁹⁸(99-digit number)
15746762807349285904…58030589099003276641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.149 × 10⁹⁸(99-digit number)
31493525614698571808…16061178198006553281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.298 × 10⁹⁸(99-digit number)
62987051229397143616…32122356396013106561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.259 × 10⁹⁹(100-digit number)
12597410245879428723…64244712792026213121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.519 × 10⁹⁹(100-digit number)
25194820491758857446…28489425584052426241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.038 × 10⁹⁹(100-digit number)
50389640983517714893…56978851168104852481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.007 × 10¹⁰⁰(101-digit number)
10077928196703542978…13957702336209704961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.015 × 10¹⁰⁰(101-digit number)
20155856393407085957…27915404672419409921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.031 × 10¹⁰⁰(101-digit number)
40311712786814171914…55830809344838819841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.062 × 10¹⁰⁰(101-digit number)
80623425573628343829…11661618689677639681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.612 × 10¹⁰¹(102-digit number)
16124685114725668765…23323237379355279361
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,709,780 XPM·at block #6,808,215 · 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