Block #555,117

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/21/2014, 8:30:51 AM · Difficulty 10.9627 · 6,251,322 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e8ed06352a1a575efb4feaec3f3e7c22b726033c8b477ebdd25800e9a8f43244

Height

#555,117

Difficulty

10.962714

Transactions

4

Size

885 B

Version

2

Bits

0af67471

Nonce

1,731,085,070

Timestamp

5/21/2014, 8:30:51 AM

Confirmations

6,251,322

Merkle Root

958ab3cb09b04bce52d1bc8bb60816ff53f9029725b9ffa1e5aef7a81a029025
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.120 × 10¹⁰⁰(101-digit number)
11202906800815798638…33152835927137939201
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.120 × 10¹⁰⁰(101-digit number)
11202906800815798638…33152835927137939201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.240 × 10¹⁰⁰(101-digit number)
22405813601631597277…66305671854275878401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.481 × 10¹⁰⁰(101-digit number)
44811627203263194555…32611343708551756801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.962 × 10¹⁰⁰(101-digit number)
89623254406526389110…65222687417103513601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.792 × 10¹⁰¹(102-digit number)
17924650881305277822…30445374834207027201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.584 × 10¹⁰¹(102-digit number)
35849301762610555644…60890749668414054401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.169 × 10¹⁰¹(102-digit number)
71698603525221111288…21781499336828108801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.433 × 10¹⁰²(103-digit number)
14339720705044222257…43562998673656217601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.867 × 10¹⁰²(103-digit number)
28679441410088444515…87125997347312435201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.735 × 10¹⁰²(103-digit number)
57358882820176889030…74251994694624870401
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,695,600 XPM·at block #6,806,438 · 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