Block #2,725,029

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/28/2018, 10:37:34 AM · Difficulty 11.6202 · 4,114,583 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5f8134ead6b3d4c538982389167b4dfa1e9ff2586a3cb444a520e6f2dde6003d

Height

#2,725,029

Difficulty

11.620215

Transactions

17

Size

4.68 KB

Version

2

Bits

0b9ec667

Nonce

534,297,197

Timestamp

6/28/2018, 10:37:34 AM

Confirmations

4,114,583

Merkle Root

6d66b48e0f8cd0dd2109f31630253c586011f4b9096e6a45d207208b28013746
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.054 × 10⁹⁴(95-digit number)
50544141551917958500…01193623224014129039
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.054 × 10⁹⁴(95-digit number)
50544141551917958500…01193623224014129039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.010 × 10⁹⁵(96-digit number)
10108828310383591700…02387246448028258079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.021 × 10⁹⁵(96-digit number)
20217656620767183400…04774492896056516159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.043 × 10⁹⁵(96-digit number)
40435313241534366800…09548985792113032319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.087 × 10⁹⁵(96-digit number)
80870626483068733600…19097971584226064639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.617 × 10⁹⁶(97-digit number)
16174125296613746720…38195943168452129279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.234 × 10⁹⁶(97-digit number)
32348250593227493440…76391886336904258559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.469 × 10⁹⁶(97-digit number)
64696501186454986880…52783772673808517119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.293 × 10⁹⁷(98-digit number)
12939300237290997376…05567545347617034239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.587 × 10⁹⁷(98-digit number)
25878600474581994752…11135090695234068479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.175 × 10⁹⁷(98-digit number)
51757200949163989504…22270181390468136959
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,961,186 XPM·at block #6,839,611 · 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