Block #2,311,536

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/27/2017, 3:27:15 PM · Difficulty 10.9064 · 4,526,148 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1ccd363a4d4ff29ca6e727a2b7f1c99148025ffee9be46a0dd81bdc5e8c65b74

Height

#2,311,536

Difficulty

10.906440

Transactions

2

Size

9.23 KB

Version

2

Bits

0ae80c7b

Nonce

109,878,070

Timestamp

9/27/2017, 3:27:15 PM

Confirmations

4,526,148

Merkle Root

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

9.440 × 10⁹¹(92-digit number)
94408546513307189637…12108567477845293199
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
9.440 × 10⁹¹(92-digit number)
94408546513307189637…12108567477845293199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.888 × 10⁹²(93-digit number)
18881709302661437927…24217134955690586399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.776 × 10⁹²(93-digit number)
37763418605322875855…48434269911381172799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.552 × 10⁹²(93-digit number)
75526837210645751710…96868539822762345599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.510 × 10⁹³(94-digit number)
15105367442129150342…93737079645524691199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.021 × 10⁹³(94-digit number)
30210734884258300684…87474159291049382399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.042 × 10⁹³(94-digit number)
60421469768516601368…74948318582098764799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.208 × 10⁹⁴(95-digit number)
12084293953703320273…49896637164197529599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.416 × 10⁹⁴(95-digit number)
24168587907406640547…99793274328395059199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.833 × 10⁹⁴(95-digit number)
48337175814813281094…99586548656790118399
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,945,798 XPM·at block #6,837,683 · 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