Block #2,647,145

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/3/2018, 6:47:09 PM · Difficulty 11.7557 · 4,185,767 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7a23dadaa55c5b365442c363c002521bc218db3be4dc1e330808cc3bdd9cd525

Height

#2,647,145

Difficulty

11.755704

Transactions

2

Size

870 B

Version

2

Bits

0bc175c9

Nonce

855,385,883

Timestamp

5/3/2018, 6:47:09 PM

Confirmations

4,185,767

Merkle Root

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

3.518 × 10⁹²(93-digit number)
35184973482276092424…62928443979000476999
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
3.518 × 10⁹²(93-digit number)
35184973482276092424…62928443979000476999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.036 × 10⁹²(93-digit number)
70369946964552184848…25856887958000953999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.407 × 10⁹³(94-digit number)
14073989392910436969…51713775916001907999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.814 × 10⁹³(94-digit number)
28147978785820873939…03427551832003815999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.629 × 10⁹³(94-digit number)
56295957571641747879…06855103664007631999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.125 × 10⁹⁴(95-digit number)
11259191514328349575…13710207328015263999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.251 × 10⁹⁴(95-digit number)
22518383028656699151…27420414656030527999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.503 × 10⁹⁴(95-digit number)
45036766057313398303…54840829312061055999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.007 × 10⁹⁴(95-digit number)
90073532114626796606…09681658624122111999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.801 × 10⁹⁵(96-digit number)
18014706422925359321…19363317248244223999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.602 × 10⁹⁵(96-digit number)
36029412845850718642…38726634496488447999
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,907,468 XPM·at block #6,832,911 · 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