Block #2,137,767

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/30/2017, 8:00:44 AM · Difficulty 10.8866 · 4,703,961 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
cc580b0aec3da797958e7f3d604e4e81306e349e453941405a628ac1602dc646

Height

#2,137,767

Difficulty

10.886574

Transactions

4

Size

1.88 KB

Version

2

Bits

0ae2f680

Nonce

396,717,389

Timestamp

5/30/2017, 8:00:44 AM

Confirmations

4,703,961

Merkle Root

822922ea685b3cc9683d80357a2e1329cc379419bc4aa4a10e40d17a0fce4a5a
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.349 × 10⁹⁴(95-digit number)
33496132079323573890…69206927279450455919
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.349 × 10⁹⁴(95-digit number)
33496132079323573890…69206927279450455919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.699 × 10⁹⁴(95-digit number)
66992264158647147780…38413854558900911839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.339 × 10⁹⁵(96-digit number)
13398452831729429556…76827709117801823679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.679 × 10⁹⁵(96-digit number)
26796905663458859112…53655418235603647359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.359 × 10⁹⁵(96-digit number)
53593811326917718224…07310836471207294719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.071 × 10⁹⁶(97-digit number)
10718762265383543644…14621672942414589439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.143 × 10⁹⁶(97-digit number)
21437524530767087289…29243345884829178879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.287 × 10⁹⁶(97-digit number)
42875049061534174579…58486691769658357759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.575 × 10⁹⁶(97-digit number)
85750098123068349158…16973383539316715519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.715 × 10⁹⁷(98-digit number)
17150019624613669831…33946767078633431039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.430 × 10⁹⁷(98-digit number)
34300039249227339663…67893534157266862079
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,978,205 XPM·at block #6,841,727 · 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