Block #1,729,089

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/22/2016, 12:28:26 PM · Difficulty 10.7114 · 5,083,600 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2606ea799af47fe794a24b8cae42ee7f136fbaaa981e7cd4b04105b71af30f67

Height

#1,729,089

Difficulty

10.711354

Transactions

2

Size

5.76 KB

Version

2

Bits

0ab61b50

Nonce

1,140,051,269

Timestamp

8/22/2016, 12:28:26 PM

Confirmations

5,083,600

Merkle Root

fc87530bff970263644b65caaf6ef16f23ff762144ea2bae5f358cbbf4b3b947
Transactions (2)
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.098 × 10⁹³(94-digit number)
10986274260453681468…18552638184604291841
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.098 × 10⁹³(94-digit number)
10986274260453681468…18552638184604291841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.197 × 10⁹³(94-digit number)
21972548520907362937…37105276369208583681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.394 × 10⁹³(94-digit number)
43945097041814725874…74210552738417167361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.789 × 10⁹³(94-digit number)
87890194083629451749…48421105476834334721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.757 × 10⁹⁴(95-digit number)
17578038816725890349…96842210953668669441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.515 × 10⁹⁴(95-digit number)
35156077633451780699…93684421907337338881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.031 × 10⁹⁴(95-digit number)
70312155266903561399…87368843814674677761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.406 × 10⁹⁵(96-digit number)
14062431053380712279…74737687629349355521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.812 × 10⁹⁵(96-digit number)
28124862106761424559…49475375258698711041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.624 × 10⁹⁵(96-digit number)
56249724213522849119…98950750517397422081
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,745,547 XPM·at block #6,812,688 · 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