Block #1,184,495

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/6/2015, 9:53:07 AM · Difficulty 10.8973 · 5,632,946 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
08b26d38ff5047d6e46b18b3c8964ed755f4f616d4c2fa78d0e2f7bbd8b55d0c

Height

#1,184,495

Difficulty

10.897308

Transactions

3

Size

1.94 KB

Version

2

Bits

0ae5b5f7

Nonce

185,278,550

Timestamp

8/6/2015, 9:53:07 AM

Confirmations

5,632,946

Merkle Root

14abc191a10e5300371f0aa6a83ec7bc05993d80b3e2db7af16846d1d53dda2b
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.

5.381 × 10⁹⁴(95-digit number)
53811603657430081396…78493032747426576149
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
5.381 × 10⁹⁴(95-digit number)
53811603657430081396…78493032747426576149
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.076 × 10⁹⁵(96-digit number)
10762320731486016279…56986065494853152299
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.152 × 10⁹⁵(96-digit number)
21524641462972032558…13972130989706304599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.304 × 10⁹⁵(96-digit number)
43049282925944065117…27944261979412609199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.609 × 10⁹⁵(96-digit number)
86098565851888130234…55888523958825218399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.721 × 10⁹⁶(97-digit number)
17219713170377626046…11777047917650436799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.443 × 10⁹⁶(97-digit number)
34439426340755252093…23554095835300873599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.887 × 10⁹⁶(97-digit number)
68878852681510504187…47108191670601747199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.377 × 10⁹⁷(98-digit number)
13775770536302100837…94216383341203494399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.755 × 10⁹⁷(98-digit number)
27551541072604201674…88432766682406988799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.510 × 10⁹⁷(98-digit number)
55103082145208403349…76865533364813977599
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,783,575 XPM·at block #6,817,440 · 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