Block #532,842

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/9/2014, 8:16:13 AM · Difficulty 10.8985 · 6,294,279 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b8311bbe01b98a2d83f7fb87be87aba0f668f29e87b77410d1c0bb70e06f3743

Height

#532,842

Difficulty

10.898482

Transactions

9

Size

3.12 KB

Version

2

Bits

0ae602f0

Nonce

2,040,951,864

Timestamp

5/9/2014, 8:16:13 AM

Confirmations

6,294,279

Merkle Root

f2f5b2ecff050c6ddf91dc80c8f81e947bda4da759e7750f5c3ba67de115f0e9
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.429 × 10⁸⁹(90-digit number)
24296691017347832100…40431084498476255701
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.429 × 10⁸⁹(90-digit number)
24296691017347832100…40431084498476255701
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.859 × 10⁸⁹(90-digit number)
48593382034695664200…80862168996952511401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.718 × 10⁸⁹(90-digit number)
97186764069391328400…61724337993905022801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.943 × 10⁹⁰(91-digit number)
19437352813878265680…23448675987810045601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.887 × 10⁹⁰(91-digit number)
38874705627756531360…46897351975620091201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.774 × 10⁹⁰(91-digit number)
77749411255513062720…93794703951240182401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.554 × 10⁹¹(92-digit number)
15549882251102612544…87589407902480364801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.109 × 10⁹¹(92-digit number)
31099764502205225088…75178815804960729601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.219 × 10⁹¹(92-digit number)
62199529004410450176…50357631609921459201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.243 × 10⁹²(93-digit number)
12439905800882090035…00715263219842918401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.487 × 10⁹²(93-digit number)
24879811601764180070…01430526439685836801
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,149 XPM·at block #6,827,120 · 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