Block #1,073,696

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/24/2015, 1:48:38 PM · Difficulty 10.7404 · 5,734,216 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
912c3ed6113658dba9f175601037b1a42ccf330a43955522345844aa8cab7ca9

Height

#1,073,696

Difficulty

10.740447

Transactions

6

Size

44.40 KB

Version

2

Bits

0abd8df0

Nonce

573,138,423

Timestamp

5/24/2015, 1:48:38 PM

Confirmations

5,734,216

Merkle Root

93b2f04fb9abb25fde912f27291f511453004988ce92f78c016c8e31ae74d553
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.490 × 10⁹⁵(96-digit number)
14909045356480402981…21155984132616654801
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.490 × 10⁹⁵(96-digit number)
14909045356480402981…21155984132616654801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.981 × 10⁹⁵(96-digit number)
29818090712960805962…42311968265233309601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.963 × 10⁹⁵(96-digit number)
59636181425921611925…84623936530466619201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.192 × 10⁹⁶(97-digit number)
11927236285184322385…69247873060933238401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.385 × 10⁹⁶(97-digit number)
23854472570368644770…38495746121866476801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.770 × 10⁹⁶(97-digit number)
47708945140737289540…76991492243732953601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.541 × 10⁹⁶(97-digit number)
95417890281474579081…53982984487465907201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.908 × 10⁹⁷(98-digit number)
19083578056294915816…07965968974931814401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.816 × 10⁹⁷(98-digit number)
38167156112589831632…15931937949863628801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.633 × 10⁹⁷(98-digit number)
76334312225179663265…31863875899727257601
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,707,330 XPM·at block #6,807,911 · 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