Block #1,341,123

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/25/2015, 1:42:48 PM · Difficulty 10.8026 · 5,501,094 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6a0952fbad232de3d4199ed545a20b7a4f60e36f4e330f67fd5596cda180df8f

Height

#1,341,123

Difficulty

10.802619

Transactions

2

Size

1.75 KB

Version

2

Bits

0acd7868

Nonce

37,116,651

Timestamp

11/25/2015, 1:42:48 PM

Confirmations

5,501,094

Merkle Root

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

2.404 × 10⁹³(94-digit number)
24040914339978885386…55560131172388150079
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.404 × 10⁹³(94-digit number)
24040914339978885386…55560131172388150079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.808 × 10⁹³(94-digit number)
48081828679957770773…11120262344776300159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.616 × 10⁹³(94-digit number)
96163657359915541547…22240524689552600319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.923 × 10⁹⁴(95-digit number)
19232731471983108309…44481049379105200639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.846 × 10⁹⁴(95-digit number)
38465462943966216619…88962098758210401279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.693 × 10⁹⁴(95-digit number)
76930925887932433238…77924197516420802559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.538 × 10⁹⁵(96-digit number)
15386185177586486647…55848395032841605119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.077 × 10⁹⁵(96-digit number)
30772370355172973295…11696790065683210239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.154 × 10⁹⁵(96-digit number)
61544740710345946590…23393580131366420479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.230 × 10⁹⁶(97-digit number)
12308948142069189318…46787160262732840959
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,982,134 XPM·at block #6,842,216 · 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