Block #2,140,564

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/1/2017, 2:20:49 PM · Difficulty 10.8757 · 4,700,859 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7811a638bac60422e296722841eeec1938aedd7064dbcba0ac76ab760245525b

Height

#2,140,564

Difficulty

10.875691

Transactions

6

Size

2.18 KB

Version

2

Bits

0ae02d41

Nonce

1,358,594,878

Timestamp

6/1/2017, 2:20:49 PM

Confirmations

4,700,859

Merkle Root

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

5.548 × 10⁹³(94-digit number)
55481753963454505071…19207388224448369339
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
5.548 × 10⁹³(94-digit number)
55481753963454505071…19207388224448369339
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.109 × 10⁹⁴(95-digit number)
11096350792690901014…38414776448896738679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.219 × 10⁹⁴(95-digit number)
22192701585381802028…76829552897793477359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.438 × 10⁹⁴(95-digit number)
44385403170763604057…53659105795586954719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.877 × 10⁹⁴(95-digit number)
88770806341527208114…07318211591173909439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.775 × 10⁹⁵(96-digit number)
17754161268305441622…14636423182347818879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.550 × 10⁹⁵(96-digit number)
35508322536610883245…29272846364695637759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.101 × 10⁹⁵(96-digit number)
71016645073221766491…58545692729391275519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.420 × 10⁹⁶(97-digit number)
14203329014644353298…17091385458782551039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.840 × 10⁹⁶(97-digit number)
28406658029288706596…34182770917565102079
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,975,760 XPM·at block #6,841,422 · 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