Block #1,145,736

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 7/9/2015, 12:10:56 AM · Difficulty 10.9316 · 5,670,532 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
714c435f1321b637f282dedb848153f8c4886927d133de506acb67c9a8fe1122

Height

#1,145,736

Difficulty

10.931578

Transactions

2

Size

1.86 KB

Version

2

Bits

0aee7beb

Nonce

85,654,779

Timestamp

7/9/2015, 12:10:56 AM

Confirmations

5,670,532

Merkle Root

20c4e556aba9a1c1e9809a118f3c1d682ce18c2e09d6d0ca845e73dd7a221995
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.

1.148 × 10⁹⁶(97-digit number)
11485724087558508579…25134316706685689599
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.148 × 10⁹⁶(97-digit number)
11485724087558508579…25134316706685689599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.297 × 10⁹⁶(97-digit number)
22971448175117017159…50268633413371379199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.594 × 10⁹⁶(97-digit number)
45942896350234034318…00537266826742758399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.188 × 10⁹⁶(97-digit number)
91885792700468068636…01074533653485516799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.837 × 10⁹⁷(98-digit number)
18377158540093613727…02149067306971033599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.675 × 10⁹⁷(98-digit number)
36754317080187227454…04298134613942067199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.350 × 10⁹⁷(98-digit number)
73508634160374454909…08596269227884134399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.470 × 10⁹⁸(99-digit number)
14701726832074890981…17192538455768268799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.940 × 10⁹⁸(99-digit number)
29403453664149781963…34385076911536537599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.880 × 10⁹⁸(99-digit number)
58806907328299563927…68770153823073075199
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,774,258 XPM·at block #6,816,267 · 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