Block #2,136,373

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/29/2017, 2:34:04 AM · Difficulty 10.8945 · 4,707,196 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a85d6c393349ca3af7144b60c1c6b9e69884b99d42a66eeac32703f1c17fe22d

Height

#2,136,373

Difficulty

10.894517

Transactions

2

Size

720 B

Version

2

Bits

0ae4ff18

Nonce

1,009,511,363

Timestamp

5/29/2017, 2:34:04 AM

Confirmations

4,707,196

Merkle Root

82b501791deee48aabe23d3bf33afda9fefeb972bed8dbd03566663bddc22c00
Transactions (2)
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.

7.161 × 10⁹³(94-digit number)
71612532803680444953…12235440166387574409
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
7.161 × 10⁹³(94-digit number)
71612532803680444953…12235440166387574409
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.432 × 10⁹⁴(95-digit number)
14322506560736088990…24470880332775148819
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.864 × 10⁹⁴(95-digit number)
28645013121472177981…48941760665550297639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.729 × 10⁹⁴(95-digit number)
57290026242944355962…97883521331100595279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.145 × 10⁹⁵(96-digit number)
11458005248588871192…95767042662201190559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.291 × 10⁹⁵(96-digit number)
22916010497177742385…91534085324402381119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.583 × 10⁹⁵(96-digit number)
45832020994355484770…83068170648804762239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.166 × 10⁹⁵(96-digit number)
91664041988710969540…66136341297609524479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.833 × 10⁹⁶(97-digit number)
18332808397742193908…32272682595219048959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.666 × 10⁹⁶(97-digit number)
36665616795484387816…64545365190438097919
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,992,928 XPM·at block #6,843,568 · 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