Block #2,548,279

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 3/4/2018, 7:49:13 AM · Difficulty 10.9885 · 4,276,258 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
aeafdfefba1eec9f877d069404565bdadb7ffc18ffbdac54e1f656b30efbf24b

Height

#2,548,279

Difficulty

10.988523

Transactions

6

Size

1.56 KB

Version

2

Bits

0afd0fe0

Nonce

91,176,223

Timestamp

3/4/2018, 7:49:13 AM

Confirmations

4,276,258

Merkle Root

9f3e5327211940a710c8f11694964a1840e4d3b7534faa5515f9a47b241f1c00
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.339 × 10⁹⁶(97-digit number)
13394123784729440236…89638381852615370239
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.339 × 10⁹⁶(97-digit number)
13394123784729440236…89638381852615370239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.678 × 10⁹⁶(97-digit number)
26788247569458880472…79276763705230740479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.357 × 10⁹⁶(97-digit number)
53576495138917760944…58553527410461480959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.071 × 10⁹⁷(98-digit number)
10715299027783552188…17107054820922961919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.143 × 10⁹⁷(98-digit number)
21430598055567104377…34214109641845923839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.286 × 10⁹⁷(98-digit number)
42861196111134208755…68428219283691847679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.572 × 10⁹⁷(98-digit number)
85722392222268417511…36856438567383695359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.714 × 10⁹⁸(99-digit number)
17144478444453683502…73712877134767390719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.428 × 10⁹⁸(99-digit number)
34288956888907367004…47425754269534781439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.857 × 10⁹⁸(99-digit number)
68577913777814734009…94851508539069562879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.371 × 10⁹⁹(100-digit number)
13715582755562946801…89703017078139125759
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,840,358 XPM·at block #6,824,536 · 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