Block #2,822,483

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/3/2018, 7:03:04 AM · Difficulty 11.7028 · 4,020,302 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
146b99871d2369120939dc686fcd9b0bcd34d5d301a21fa9ed42dae57909706b

Height

#2,822,483

Difficulty

11.702841

Transactions

3

Size

950 B

Version

2

Bits

0bb3ed5f

Nonce

399,329,542

Timestamp

9/3/2018, 7:03:04 AM

Confirmations

4,020,302

Merkle Root

3cdc44eda28c433817bcd806b7883ee54f5a0559ddbf6c41f595ac178850dfe0
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.571 × 10⁹⁵(96-digit number)
15718947570705615874…36443723904054438409
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.571 × 10⁹⁵(96-digit number)
15718947570705615874…36443723904054438409
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.143 × 10⁹⁵(96-digit number)
31437895141411231749…72887447808108876819
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.287 × 10⁹⁵(96-digit number)
62875790282822463498…45774895616217753639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.257 × 10⁹⁶(97-digit number)
12575158056564492699…91549791232435507279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.515 × 10⁹⁶(97-digit number)
25150316113128985399…83099582464871014559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.030 × 10⁹⁶(97-digit number)
50300632226257970798…66199164929742029119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.006 × 10⁹⁷(98-digit number)
10060126445251594159…32398329859484058239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.012 × 10⁹⁷(98-digit number)
20120252890503188319…64796659718968116479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.024 × 10⁹⁷(98-digit number)
40240505781006376638…29593319437936232959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.048 × 10⁹⁷(98-digit number)
80481011562012753277…59186638875872465919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.609 × 10⁹⁸(99-digit number)
16096202312402550655…18373277751744931839
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,986,620 XPM·at block #6,842,784 · 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