Block #1,241,344

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/17/2015, 10:49:31 PM · Difficulty 10.7562 · 5,568,126 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d315a721e45bd0aeaf4ffb5f2fbe6f89fd8bdcb16fc7cd714b67a5b8d83d55ac

Height

#1,241,344

Difficulty

10.756216

Transactions

6

Size

2.98 KB

Version

2

Bits

0ac19767

Nonce

1,535,261,157

Timestamp

9/17/2015, 10:49:31 PM

Confirmations

5,568,126

Merkle Root

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

1.555 × 10⁹⁴(95-digit number)
15550805722311417147…45221420177867513759
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
1.555 × 10⁹⁴(95-digit number)
15550805722311417147…45221420177867513759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.110 × 10⁹⁴(95-digit number)
31101611444622834295…90442840355735027519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.220 × 10⁹⁴(95-digit number)
62203222889245668590…80885680711470055039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.244 × 10⁹⁵(96-digit number)
12440644577849133718…61771361422940110079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.488 × 10⁹⁵(96-digit number)
24881289155698267436…23542722845880220159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.976 × 10⁹⁵(96-digit number)
49762578311396534872…47085445691760440319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.952 × 10⁹⁵(96-digit number)
99525156622793069744…94170891383520880639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.990 × 10⁹⁶(97-digit number)
19905031324558613948…88341782767041761279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.981 × 10⁹⁶(97-digit number)
39810062649117227897…76683565534083522559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.962 × 10⁹⁶(97-digit number)
79620125298234455795…53367131068167045119
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,719,831 XPM·at block #6,809,469 · 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.

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