Block #1,065,003

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/18/2015, 3:34:31 PM · Difficulty 10.7318 · 5,752,270 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d1a53c470bb7a3de6c836b6d4aedf09be896348c52998bd2a46aa6a6bc13ac26

Height

#1,065,003

Difficulty

10.731794

Transactions

5

Size

33.69 KB

Version

2

Bits

0abb56d3

Nonce

659,498,768

Timestamp

5/18/2015, 3:34:31 PM

Confirmations

5,752,270

Merkle Root

8f995c2beee02954676468905d1f12a1ccf4a74c3b34b08f79241e09d2557490
Transactions (5)
1 in → 1 out9.0400 XPM116 B
76 in → 1 out1499.9900 XPM11.03 KB
34 in → 1 out661.3902 XPM4.96 KB
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.

7.500 × 10⁹⁷(98-digit number)
75009578998917284759…88680015631716270081
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
7.500 × 10⁹⁷(98-digit number)
75009578998917284759…88680015631716270081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.500 × 10⁹⁸(99-digit number)
15001915799783456951…77360031263432540161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.000 × 10⁹⁸(99-digit number)
30003831599566913903…54720062526865080321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.000 × 10⁹⁸(99-digit number)
60007663199133827807…09440125053730160641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.200 × 10⁹⁹(100-digit number)
12001532639826765561…18880250107460321281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.400 × 10⁹⁹(100-digit number)
24003065279653531122…37760500214920642561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.800 × 10⁹⁹(100-digit number)
48006130559307062245…75521000429841285121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.601 × 10⁹⁹(100-digit number)
96012261118614124491…51042000859682570241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.920 × 10¹⁰⁰(101-digit number)
19202452223722824898…02084001719365140481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.840 × 10¹⁰⁰(101-digit number)
38404904447445649796…04168003438730280961
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,782,222 XPM·at block #6,817,272 · 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