Block #2,127,729

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/22/2017, 5:10:27 AM · Difficulty 10.9179 · 4,703,716 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2ba240272c9520b5b27bfd40f8b9c5f0718b5ae1be242477102e2b77a2256e1a

Height

#2,127,729

Difficulty

10.917936

Transactions

3

Size

654 B

Version

2

Bits

0aeafddd

Nonce

171,068,889

Timestamp

5/22/2017, 5:10:27 AM

Confirmations

4,703,716

Merkle Root

4d8856356470515424bab4992e4d7593d567490e2e63a51704d96945d6f76549
Transactions (3)
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.039 × 10⁹⁵(96-digit number)
10398320543322571997…41902331698465585919
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.039 × 10⁹⁵(96-digit number)
10398320543322571997…41902331698465585919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.079 × 10⁹⁵(96-digit number)
20796641086645143995…83804663396931171839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.159 × 10⁹⁵(96-digit number)
41593282173290287991…67609326793862343679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.318 × 10⁹⁵(96-digit number)
83186564346580575983…35218653587724687359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.663 × 10⁹⁶(97-digit number)
16637312869316115196…70437307175449374719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.327 × 10⁹⁶(97-digit number)
33274625738632230393…40874614350898749439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.654 × 10⁹⁶(97-digit number)
66549251477264460786…81749228701797498879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.330 × 10⁹⁷(98-digit number)
13309850295452892157…63498457403594997759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.661 × 10⁹⁷(98-digit number)
26619700590905784314…26996914807189995519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.323 × 10⁹⁷(98-digit number)
53239401181811568629…53993829614379991039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.064 × 10⁹⁸(99-digit number)
10647880236362313725…07987659228759982079
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,895,724 XPM·at block #6,831,444 · 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