Block #2,789,931

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/12/2018, 12:36:54 AM · Difficulty 11.6718 · 4,051,734 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
bf93cb9d44dc965c21ec416875f7983757b3da6acf404667b69a1061152b83ab

Height

#2,789,931

Difficulty

11.671764

Transactions

5

Size

1.60 KB

Version

2

Bits

0babf8b2

Nonce

299,318,530

Timestamp

8/12/2018, 12:36:54 AM

Confirmations

4,051,734

Merkle Root

36f69474666a4c11d8d77552741d06a7421e18529f87c4586df565e346375324
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.348 × 10⁹⁶(97-digit number)
13485507661091222795…08027591581309350401
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.348 × 10⁹⁶(97-digit number)
13485507661091222795…08027591581309350401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.697 × 10⁹⁶(97-digit number)
26971015322182445590…16055183162618700801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.394 × 10⁹⁶(97-digit number)
53942030644364891181…32110366325237401601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.078 × 10⁹⁷(98-digit number)
10788406128872978236…64220732650474803201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.157 × 10⁹⁷(98-digit number)
21576812257745956472…28441465300949606401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.315 × 10⁹⁷(98-digit number)
43153624515491912945…56882930601899212801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.630 × 10⁹⁷(98-digit number)
86307249030983825891…13765861203798425601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.726 × 10⁹⁸(99-digit number)
17261449806196765178…27531722407596851201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.452 × 10⁹⁸(99-digit number)
34522899612393530356…55063444815193702401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.904 × 10⁹⁸(99-digit number)
69045799224787060712…10126889630387404801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.380 × 10⁹⁹(100-digit number)
13809159844957412142…20253779260774809601
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,977,709 XPM·at block #6,841,664 · 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