Block #1,938,838

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/14/2017, 11:30:19 AM · Difficulty 10.7710 · 4,878,765 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3434593439555d84048a9cd2851bb669932537978cba711f5fc3e3ee62dca260

Height

#1,938,838

Difficulty

10.771019

Transactions

20

Size

8.43 KB

Version

2

Bits

0ac56179

Nonce

238,181,521

Timestamp

1/14/2017, 11:30:19 AM

Confirmations

4,878,765

Merkle Root

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

3.919 × 10⁹⁶(97-digit number)
39194365428847856714…71385959785244334079
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
3.919 × 10⁹⁶(97-digit number)
39194365428847856714…71385959785244334079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.838 × 10⁹⁶(97-digit number)
78388730857695713429…42771919570488668159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.567 × 10⁹⁷(98-digit number)
15677746171539142685…85543839140977336319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.135 × 10⁹⁷(98-digit number)
31355492343078285371…71087678281954672639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.271 × 10⁹⁷(98-digit number)
62710984686156570743…42175356563909345279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.254 × 10⁹⁸(99-digit number)
12542196937231314148…84350713127818690559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.508 × 10⁹⁸(99-digit number)
25084393874462628297…68701426255637381119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.016 × 10⁹⁸(99-digit number)
50168787748925256594…37402852511274762239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.003 × 10⁹⁹(100-digit number)
10033757549785051318…74805705022549524479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.006 × 10⁹⁹(100-digit number)
20067515099570102637…49611410045099048959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.013 × 10⁹⁹(100-digit number)
40135030199140205275…99222820090198097919
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,784,878 XPM·at block #6,817,602 · 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