Block #559,079

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/23/2014, 11:19:58 PM · Difficulty 10.9643 · 6,257,729 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
65096007ef1959e99c9892a5966c6ccd909872ac01efe4fc35f32e1deca3b7e3

Height

#559,079

Difficulty

10.964263

Transactions

4

Size

1.44 KB

Version

2

Bits

0af6d9ed

Nonce

143,499,161

Timestamp

5/23/2014, 11:19:58 PM

Confirmations

6,257,729

Merkle Root

76c1720b7ae7f5b8d602e2d3b11d8950d6cefef148083f301192d2ffe66cb02b
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.248 × 10⁹⁹(100-digit number)
12485240231597116304…83197660964537548801
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.248 × 10⁹⁹(100-digit number)
12485240231597116304…83197660964537548801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.497 × 10⁹⁹(100-digit number)
24970480463194232608…66395321929075097601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.994 × 10⁹⁹(100-digit number)
49940960926388465216…32790643858150195201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.988 × 10⁹⁹(100-digit number)
99881921852776930433…65581287716300390401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.997 × 10¹⁰⁰(101-digit number)
19976384370555386086…31162575432600780801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.995 × 10¹⁰⁰(101-digit number)
39952768741110772173…62325150865201561601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.990 × 10¹⁰⁰(101-digit number)
79905537482221544346…24650301730403123201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.598 × 10¹⁰¹(102-digit number)
15981107496444308869…49300603460806246401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.196 × 10¹⁰¹(102-digit number)
31962214992888617738…98601206921612492801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.392 × 10¹⁰¹(102-digit number)
63924429985777235477…97202413843224985601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.278 × 10¹⁰²(103-digit number)
12784885997155447095…94404827686449971201
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,778,501 XPM·at block #6,816,807 · 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