Block #918,081

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 2/1/2015, 3:36:43 AM · Difficulty 10.9225 · 5,909,271 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
48f9be76dd1c2de93590f233fb9e30458492f803f06e6eb5d5ed3ad39c500235

Height

#918,081

Difficulty

10.922452

Transactions

16

Size

15.52 KB

Version

2

Bits

0aec25cc

Nonce

490,706,551

Timestamp

2/1/2015, 3:36:43 AM

Confirmations

5,909,271

Merkle Root

97a7abfb00b322dde998a69fa71f8565fb7cbedbf9138930091d6f87b18d872a
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.781 × 10⁹⁶(97-digit number)
57813476675773805560…35916405791877368959
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.781 × 10⁹⁶(97-digit number)
57813476675773805560…35916405791877368959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.156 × 10⁹⁷(98-digit number)
11562695335154761112…71832811583754737919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.312 × 10⁹⁷(98-digit number)
23125390670309522224…43665623167509475839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.625 × 10⁹⁷(98-digit number)
46250781340619044448…87331246335018951679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.250 × 10⁹⁷(98-digit number)
92501562681238088896…74662492670037903359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.850 × 10⁹⁸(99-digit number)
18500312536247617779…49324985340075806719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.700 × 10⁹⁸(99-digit number)
37000625072495235558…98649970680151613439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.400 × 10⁹⁸(99-digit number)
74001250144990471116…97299941360303226879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.480 × 10⁹⁹(100-digit number)
14800250028998094223…94599882720606453759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.960 × 10⁹⁹(100-digit number)
29600500057996188446…89199765441212907519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.920 × 10⁹⁹(100-digit number)
59201000115992376893…78399530882425815039
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,862,915 XPM·at block #6,827,351 · 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