Block #2,235,912

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/4/2017, 1:26:33 AM · Difficulty 10.9458 · 4,590,647 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1523e86ccddb30d6994bc3074a8efd82999ddbf4a9c7d0ee26e40e9a43fae7ff

Height

#2,235,912

Difficulty

10.945820

Transactions

3

Size

1.07 KB

Version

2

Bits

0af22145

Nonce

542,521,244

Timestamp

8/4/2017, 1:26:33 AM

Confirmations

4,590,647

Merkle Root

1532e43ca679bd367b321212006b23d4d90046419551bf0310ce4aae62ce04da
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.

2.343 × 10⁹⁴(95-digit number)
23430937304747682049…05876001488455791599
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
2.343 × 10⁹⁴(95-digit number)
23430937304747682049…05876001488455791599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.686 × 10⁹⁴(95-digit number)
46861874609495364099…11752002976911583199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.372 × 10⁹⁴(95-digit number)
93723749218990728198…23504005953823166399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.874 × 10⁹⁵(96-digit number)
18744749843798145639…47008011907646332799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.748 × 10⁹⁵(96-digit number)
37489499687596291279…94016023815292665599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.497 × 10⁹⁵(96-digit number)
74978999375192582558…88032047630585331199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.499 × 10⁹⁶(97-digit number)
14995799875038516511…76064095261170662399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.999 × 10⁹⁶(97-digit number)
29991599750077033023…52128190522341324799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.998 × 10⁹⁶(97-digit number)
59983199500154066046…04256381044682649599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.199 × 10⁹⁷(98-digit number)
11996639900030813209…08512762089365299199
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,856,623 XPM·at block #6,826,558 · 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