Block #919,121

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 2/1/2015, 10:16:59 PM · Difficulty 10.9212 · 5,887,843 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
bd5c1a01d611315f8ab3f29267c2793752e7b85ac703e04457d446446194e898

Height

#919,121

Difficulty

10.921230

Transactions

9

Size

2.26 KB

Version

2

Bits

0aebd5c3

Nonce

303,060,102

Timestamp

2/1/2015, 10:16:59 PM

Confirmations

5,887,843

Merkle Root

d1a916fb46641022e904f8e15938897d390af7c193dc28d051dc6c61d93c6dfe
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.336 × 10⁹⁷(98-digit number)
13365518211639531287…98368091259215593601
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.336 × 10⁹⁷(98-digit number)
13365518211639531287…98368091259215593601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.673 × 10⁹⁷(98-digit number)
26731036423279062574…96736182518431187201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.346 × 10⁹⁷(98-digit number)
53462072846558125149…93472365036862374401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.069 × 10⁹⁸(99-digit number)
10692414569311625029…86944730073724748801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.138 × 10⁹⁸(99-digit number)
21384829138623250059…73889460147449497601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.276 × 10⁹⁸(99-digit number)
42769658277246500119…47778920294898995201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.553 × 10⁹⁸(99-digit number)
85539316554493000238…95557840589797990401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.710 × 10⁹⁹(100-digit number)
17107863310898600047…91115681179595980801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.421 × 10⁹⁹(100-digit number)
34215726621797200095…82231362359191961601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.843 × 10⁹⁹(100-digit number)
68431453243594400191…64462724718383923201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.368 × 10¹⁰⁰(101-digit number)
13686290648718880038…28925449436767846401
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,699,811 XPM·at block #6,806,963 · 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