Block #2,862,244

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 10/1/2018, 6:08:15 AM · Difficulty 11.6733 · 3,947,819 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
45ba22757c95376883ae36bb4e04fe8a26daaabe4d6726b891ea04e81bb5c355

Height

#2,862,244

Difficulty

11.673254

Transactions

3

Size

36.02 KB

Version

2

Bits

0bac5a67

Nonce

52,236,605

Timestamp

10/1/2018, 6:08:15 AM

Confirmations

3,947,819

Merkle Root

c233392df171a793adca0d5072d04870e27174f7c973ecd1c9ab225e265b5a25
Transactions (3)
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.

2.179 × 10⁹³(94-digit number)
21794920229284165846…31739868086048323839
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
2.179 × 10⁹³(94-digit number)
21794920229284165846…31739868086048323839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.358 × 10⁹³(94-digit number)
43589840458568331692…63479736172096647679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.717 × 10⁹³(94-digit number)
87179680917136663384…26959472344193295359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.743 × 10⁹⁴(95-digit number)
17435936183427332676…53918944688386590719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.487 × 10⁹⁴(95-digit number)
34871872366854665353…07837889376773181439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.974 × 10⁹⁴(95-digit number)
69743744733709330707…15675778753546362879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.394 × 10⁹⁵(96-digit number)
13948748946741866141…31351557507092725759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.789 × 10⁹⁵(96-digit number)
27897497893483732283…62703115014185451519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.579 × 10⁹⁵(96-digit number)
55794995786967464566…25406230028370903039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.115 × 10⁹⁶(97-digit number)
11158999157393492913…50812460056741806079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.231 × 10⁹⁶(97-digit number)
22317998314786985826…01624920113483612159
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,724,578 XPM·at block #6,810,062 · 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.

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