Block #1,688,254

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/25/2016, 4:01:49 AM · Difficulty 10.7096 · 5,142,483 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e48cc3129e82932c0d8957ec17ca74076c20413b500b8cc9cc94a05dc3096a54

Height

#1,688,254

Difficulty

10.709565

Transactions

2

Size

721 B

Version

2

Bits

0ab5a614

Nonce

824,809,148

Timestamp

7/25/2016, 4:01:49 AM

Confirmations

5,142,483

Merkle Root

3dbb1a5e5399f5bfb047d26b71201ebc4f7ff85cd507939b03c393ffcfd2a08d
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.

1.089 × 10⁹³(94-digit number)
10891409041636219674…61840181259022710551
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.089 × 10⁹³(94-digit number)
10891409041636219674…61840181259022710551
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.178 × 10⁹³(94-digit number)
21782818083272439349…23680362518045421101
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.356 × 10⁹³(94-digit number)
43565636166544878699…47360725036090842201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.713 × 10⁹³(94-digit number)
87131272333089757398…94721450072181684401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.742 × 10⁹⁴(95-digit number)
17426254466617951479…89442900144363368801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.485 × 10⁹⁴(95-digit number)
34852508933235902959…78885800288726737601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.970 × 10⁹⁴(95-digit number)
69705017866471805918…57771600577453475201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.394 × 10⁹⁵(96-digit number)
13941003573294361183…15543201154906950401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.788 × 10⁹⁵(96-digit number)
27882007146588722367…31086402309813900801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.576 × 10⁹⁵(96-digit number)
55764014293177444735…62172804619627801601
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,890,033 XPM·at block #6,830,736 · 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