Block #1,534,589

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/10/2016, 8:32:44 AM · Difficulty 10.6171 · 5,282,345 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9242d1167be196e3a762de4e08e7e7705e89dc1834f8d68f19a7ec7954a3eaa7

Height

#1,534,589

Difficulty

10.617075

Transactions

3

Size

8.30 KB

Version

2

Bits

0a9df8a5

Nonce

147,664,880

Timestamp

4/10/2016, 8:32:44 AM

Confirmations

5,282,345

Merkle Root

fd83c9d7e04a3919884206e59ac244a62e60786f9be278bbfed50a856515bbdc
Transactions (3)
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.

4.880 × 10⁹⁷(98-digit number)
48802316339121281049…27242191520473994241
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
4.880 × 10⁹⁷(98-digit number)
48802316339121281049…27242191520473994241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.760 × 10⁹⁷(98-digit number)
97604632678242562099…54484383040947988481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.952 × 10⁹⁸(99-digit number)
19520926535648512419…08968766081895976961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.904 × 10⁹⁸(99-digit number)
39041853071297024839…17937532163791953921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.808 × 10⁹⁸(99-digit number)
78083706142594049679…35875064327583907841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.561 × 10⁹⁹(100-digit number)
15616741228518809935…71750128655167815681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.123 × 10⁹⁹(100-digit number)
31233482457037619871…43500257310335631361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.246 × 10⁹⁹(100-digit number)
62466964914075239743…87000514620671262721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.249 × 10¹⁰⁰(101-digit number)
12493392982815047948…74001029241342525441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.498 × 10¹⁰⁰(101-digit number)
24986785965630095897…48002058482685050881
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,779,514 XPM·at block #6,816,933 · 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