Block #2,236,885

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/4/2017, 4:49:18 PM · Difficulty 10.9464 · 4,602,989 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
778fe1a564753e6c52e709791bc3aca944d8e1f4aec0b889001e3541eaddae4a

Height

#2,236,885

Difficulty

10.946377

Transactions

4

Size

1.43 KB

Version

2

Bits

0af245c1

Nonce

230,042,115

Timestamp

8/4/2017, 4:49:18 PM

Confirmations

4,602,989

Merkle Root

5df03af94c426c03db6cb48a0af4968142c6c950e1962d019b7dedf9d3b5f50d
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.

7.361 × 10⁹³(94-digit number)
73615348466718311267…92065473609921586509
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
7.361 × 10⁹³(94-digit number)
73615348466718311267…92065473609921586509
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.472 × 10⁹⁴(95-digit number)
14723069693343662253…84130947219843173019
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.944 × 10⁹⁴(95-digit number)
29446139386687324507…68261894439686346039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.889 × 10⁹⁴(95-digit number)
58892278773374649014…36523788879372692079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.177 × 10⁹⁵(96-digit number)
11778455754674929802…73047577758745384159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.355 × 10⁹⁵(96-digit number)
23556911509349859605…46095155517490768319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.711 × 10⁹⁵(96-digit number)
47113823018699719211…92190311034981536639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.422 × 10⁹⁵(96-digit number)
94227646037399438422…84380622069963073279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.884 × 10⁹⁶(97-digit number)
18845529207479887684…68761244139926146559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.769 × 10⁹⁶(97-digit number)
37691058414959775369…37522488279852293119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.538 × 10⁹⁶(97-digit number)
75382116829919550738…75044976559704586239
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,963,293 XPM·at block #6,839,873 · 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