Block #2,655,361

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/10/2018, 3:12:39 AM · Difficulty 11.7066 · 4,178,104 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
dd0eba9764a767ab9b69317ebab0438c486072f9dcdfa55bc1d717575a006e3c

Height

#2,655,361

Difficulty

11.706596

Transactions

2

Size

425 B

Version

2

Bits

0bb4e372

Nonce

965,526,550

Timestamp

5/10/2018, 3:12:39 AM

Confirmations

4,178,104

Merkle Root

a1288e300bf059cb1296d004e6387f992866415cbcd05d3325c0addddb4aff32
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.

4.852 × 10⁹⁴(95-digit number)
48525281025831968606…03583898941290617601
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.852 × 10⁹⁴(95-digit number)
48525281025831968606…03583898941290617601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.705 × 10⁹⁴(95-digit number)
97050562051663937213…07167797882581235201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.941 × 10⁹⁵(96-digit number)
19410112410332787442…14335595765162470401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.882 × 10⁹⁵(96-digit number)
38820224820665574885…28671191530324940801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.764 × 10⁹⁵(96-digit number)
77640449641331149770…57342383060649881601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.552 × 10⁹⁶(97-digit number)
15528089928266229954…14684766121299763201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.105 × 10⁹⁶(97-digit number)
31056179856532459908…29369532242599526401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.211 × 10⁹⁶(97-digit number)
62112359713064919816…58739064485199052801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.242 × 10⁹⁷(98-digit number)
12422471942612983963…17478128970398105601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.484 × 10⁹⁷(98-digit number)
24844943885225967926…34956257940796211201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.968 × 10⁹⁷(98-digit number)
49689887770451935853…69912515881592422401
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,911,921 XPM·at block #6,833,464 · 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