Block #533,738

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/9/2014, 9:41:00 PM · Difficulty 10.9003 · 6,293,406 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
587f3d79f6a4d7379677b140f4ec5aae742a7712037196a98757c06982b18054

Height

#533,738

Difficulty

10.900275

Transactions

2

Size

15.16 KB

Version

2

Bits

0ae67865

Nonce

28,216,117

Timestamp

5/9/2014, 9:41:00 PM

Confirmations

6,293,406

Merkle Root

063c2cecf52d4e093dc30b2c60f47e36560515ba61c2077b274fab443f8e0796
Transactions (2)
1 in → 1 out8.5600 XPM116 B
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.426 × 10¹⁰⁰(101-digit number)
14262988903240764136…11086127232847843841
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.426 × 10¹⁰⁰(101-digit number)
14262988903240764136…11086127232847843841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.852 × 10¹⁰⁰(101-digit number)
28525977806481528272…22172254465695687681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.705 × 10¹⁰⁰(101-digit number)
57051955612963056545…44344508931391375361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.141 × 10¹⁰¹(102-digit number)
11410391122592611309…88689017862782750721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.282 × 10¹⁰¹(102-digit number)
22820782245185222618…77378035725565501441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.564 × 10¹⁰¹(102-digit number)
45641564490370445236…54756071451131002881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.128 × 10¹⁰¹(102-digit number)
91283128980740890473…09512142902262005761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.825 × 10¹⁰²(103-digit number)
18256625796148178094…19024285804524011521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.651 × 10¹⁰²(103-digit number)
36513251592296356189…38048571609048023041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.302 × 10¹⁰²(103-digit number)
73026503184592712378…76097143218096046081
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,861,334 XPM·at block #6,827,143 · 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