Block #2,236,884

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/4/2017, 4:48:10 PM · Difficulty 10.9464 · 4,603,571 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d6c1e4f6ba084d327bfefc0e384dc9542401bf27d061359c8675a3a167108df6

Height

#2,236,884

Difficulty

10.946386

Transactions

8

Size

3.16 KB

Version

2

Bits

0af24655

Nonce

1,035,314,782

Timestamp

8/4/2017, 4:48:10 PM

Confirmations

4,603,571

Merkle Root

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

3.935 × 10⁹⁶(97-digit number)
39357055776391230827…94983966011216706559
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
3.935 × 10⁹⁶(97-digit number)
39357055776391230827…94983966011216706559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.871 × 10⁹⁶(97-digit number)
78714111552782461654…89967932022433413119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.574 × 10⁹⁷(98-digit number)
15742822310556492330…79935864044866826239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.148 × 10⁹⁷(98-digit number)
31485644621112984661…59871728089733652479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.297 × 10⁹⁷(98-digit number)
62971289242225969323…19743456179467304959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.259 × 10⁹⁸(99-digit number)
12594257848445193864…39486912358934609919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.518 × 10⁹⁸(99-digit number)
25188515696890387729…78973824717869219839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.037 × 10⁹⁸(99-digit number)
50377031393780775458…57947649435738439679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.007 × 10⁹⁹(100-digit number)
10075406278756155091…15895298871476879359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.015 × 10⁹⁹(100-digit number)
20150812557512310183…31790597742953758719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.030 × 10⁹⁹(100-digit number)
40301625115024620367…63581195485907517439
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,967,971 XPM·at block #6,840,454 · 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