Block #570,718

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/1/2014, 12:36:36 AM · Difficulty 10.9649 · 6,242,193 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
320c2e874733e06879404ddee222bcc13dbb0581eb8e1fb14d8a87ab2be062a4

Height

#570,718

Difficulty

10.964917

Transactions

8

Size

3.48 KB

Version

2

Bits

0af704d0

Nonce

23,009,833

Timestamp

6/1/2014, 12:36:36 AM

Confirmations

6,242,193

Merkle Root

6fc0aad32edf5061c17551522070e7ab0bb01a094d826d3e37fc89ef45238bf7
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.211 × 10⁹⁸(99-digit number)
22111621885666258785…92837611292780447681
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.211 × 10⁹⁸(99-digit number)
22111621885666258785…92837611292780447681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.422 × 10⁹⁸(99-digit number)
44223243771332517570…85675222585560895361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.844 × 10⁹⁸(99-digit number)
88446487542665035140…71350445171121790721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.768 × 10⁹⁹(100-digit number)
17689297508533007028…42700890342243581441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.537 × 10⁹⁹(100-digit number)
35378595017066014056…85401780684487162881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.075 × 10⁹⁹(100-digit number)
70757190034132028112…70803561368974325761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.415 × 10¹⁰⁰(101-digit number)
14151438006826405622…41607122737948651521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.830 × 10¹⁰⁰(101-digit number)
28302876013652811245…83214245475897303041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.660 × 10¹⁰⁰(101-digit number)
56605752027305622490…66428490951794606081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.132 × 10¹⁰¹(102-digit number)
11321150405461124498…32856981903589212161
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,747,322 XPM·at block #6,812,910 · 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