Block #2,853,627

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/24/2018, 7:17:48 PM · Difficulty 11.7138 · 3,978,293 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
df9d1782875e99159d73fe80e803cb4ef6883fafaf8b174261e0637ba71ed4e8

Height

#2,853,627

Difficulty

11.713841

Transactions

5

Size

1.52 KB

Version

2

Bits

0bb6be4a

Nonce

44,932,842

Timestamp

9/24/2018, 7:17:48 PM

Confirmations

3,978,293

Merkle Root

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

6.761 × 10⁹⁴(95-digit number)
67612118274938415374…18571443443195185279
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
6.761 × 10⁹⁴(95-digit number)
67612118274938415374…18571443443195185279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.352 × 10⁹⁵(96-digit number)
13522423654987683074…37142886886390370559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.704 × 10⁹⁵(96-digit number)
27044847309975366149…74285773772780741119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.408 × 10⁹⁵(96-digit number)
54089694619950732299…48571547545561482239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.081 × 10⁹⁶(97-digit number)
10817938923990146459…97143095091122964479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.163 × 10⁹⁶(97-digit number)
21635877847980292919…94286190182245928959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.327 × 10⁹⁶(97-digit number)
43271755695960585839…88572380364491857919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.654 × 10⁹⁶(97-digit number)
86543511391921171679…77144760728983715839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.730 × 10⁹⁷(98-digit number)
17308702278384234335…54289521457967431679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.461 × 10⁹⁷(98-digit number)
34617404556768468671…08579042915934863359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.923 × 10⁹⁷(98-digit number)
69234809113536937343…17158085831869726719
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,899,485 XPM·at block #6,831,919 · 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