Block #1,570,819

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/4/2016, 2:09:04 AM · Difficulty 10.7463 · 5,256,492 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
11a4cb02d71428d2ac352e253d207009601c3edecbaa665f013ec22207463aa9

Height

#1,570,819

Difficulty

10.746322

Transactions

2

Size

800 B

Version

2

Bits

0abf0ef0

Nonce

636,444,201

Timestamp

5/4/2016, 2:09:04 AM

Confirmations

5,256,492

Merkle Root

71dfa881e2fc6a8c51bd2afb7f717faa03516b1edd9343307668c3b26b93da53
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.033 × 10⁹⁵(96-digit number)
10332343050763459050…76045849972870020241
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.033 × 10⁹⁵(96-digit number)
10332343050763459050…76045849972870020241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.066 × 10⁹⁵(96-digit number)
20664686101526918101…52091699945740040481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.132 × 10⁹⁵(96-digit number)
41329372203053836203…04183399891480080961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.265 × 10⁹⁵(96-digit number)
82658744406107672407…08366799782960161921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.653 × 10⁹⁶(97-digit number)
16531748881221534481…16733599565920323841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.306 × 10⁹⁶(97-digit number)
33063497762443068963…33467199131840647681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.612 × 10⁹⁶(97-digit number)
66126995524886137926…66934398263681295361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.322 × 10⁹⁷(98-digit number)
13225399104977227585…33868796527362590721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.645 × 10⁹⁷(98-digit number)
26450798209954455170…67737593054725181441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.290 × 10⁹⁷(98-digit number)
52901596419908910340…35475186109450362881
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,600 XPM·at block #6,827,310 · 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