Block #2,141,313

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/2/2017, 3:45:39 AM · Difficulty 10.8743 · 4,698,601 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a8bc3e223309ccbe5afe4560ba32f5787edf23b211faa931cd192714d0c85726

Height

#2,141,313

Difficulty

10.874265

Transactions

21

Size

10.00 KB

Version

2

Bits

0adfcfd9

Nonce

1,524,456,769

Timestamp

6/2/2017, 3:45:39 AM

Confirmations

4,698,601

Merkle Root

9340bd0c3b22467121ccd5b698a2fa44fbd67a34157e139c37cfc1eec9bf3b7c
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.

8.302 × 10⁹³(94-digit number)
83028263777402050209…52408186926930149759
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
8.302 × 10⁹³(94-digit number)
83028263777402050209…52408186926930149759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.660 × 10⁹⁴(95-digit number)
16605652755480410041…04816373853860299519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.321 × 10⁹⁴(95-digit number)
33211305510960820083…09632747707720599039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.642 × 10⁹⁴(95-digit number)
66422611021921640167…19265495415441198079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.328 × 10⁹⁵(96-digit number)
13284522204384328033…38530990830882396159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.656 × 10⁹⁵(96-digit number)
26569044408768656067…77061981661764792319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.313 × 10⁹⁵(96-digit number)
53138088817537312134…54123963323529584639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.062 × 10⁹⁶(97-digit number)
10627617763507462426…08247926647059169279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.125 × 10⁹⁶(97-digit number)
21255235527014924853…16495853294118338559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.251 × 10⁹⁶(97-digit number)
42510471054029849707…32991706588236677119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
8.502 × 10⁹⁶(97-digit number)
85020942108059699414…65983413176473354239
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,963,612 XPM·at block #6,839,913 · 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