Block #2,137,507

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/30/2017, 2:40:03 AM · Difficulty 10.8879 · 4,671,057 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d786b3d19ad88f726743401a977840b509e267537c80d5783747028d3b81dab2

Height

#2,137,507

Difficulty

10.887855

Transactions

6

Size

5.13 KB

Version

2

Bits

0ae34a7c

Nonce

953,790,924

Timestamp

5/30/2017, 2:40:03 AM

Confirmations

4,671,057

Merkle Root

27a644d3c03af70176524e59f88b006dea6ed8a8fe177991adf5191d537b4d1e
Transactions (6)
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.429 × 10⁹³(94-digit number)
14292473427810037828…25129014941326757279
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.429 × 10⁹³(94-digit number)
14292473427810037828…25129014941326757279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.858 × 10⁹³(94-digit number)
28584946855620075657…50258029882653514559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.716 × 10⁹³(94-digit number)
57169893711240151314…00516059765307029119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.143 × 10⁹⁴(95-digit number)
11433978742248030262…01032119530614058239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.286 × 10⁹⁴(95-digit number)
22867957484496060525…02064239061228116479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.573 × 10⁹⁴(95-digit number)
45735914968992121051…04128478122456232959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.147 × 10⁹⁴(95-digit number)
91471829937984242102…08256956244912465919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.829 × 10⁹⁵(96-digit number)
18294365987596848420…16513912489824931839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.658 × 10⁹⁵(96-digit number)
36588731975193696841…33027824979649863679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.317 × 10⁹⁵(96-digit number)
73177463950387393682…66055649959299727359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.463 × 10⁹⁶(97-digit number)
14635492790077478736…32111299918599454719
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,712,570 XPM·at block #6,808,563 · 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.

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