Block #2,820,743

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/2/2018, 2:49:49 AM · Difficulty 11.7001 · 4,018,929 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
dea131ae334ec85e9247170a46d2807076b634802ee7d2186f8fd4494731a7aa

Height

#2,820,743

Difficulty

11.700089

Transactions

29

Size

6.97 KB

Version

2

Bits

0bb3390f

Nonce

60,246,713

Timestamp

9/2/2018, 2:49:49 AM

Confirmations

4,018,929

Merkle Root

5f2c9ae4174e4bc852fbe4920b9ba60657b83bb20969e6dbbf47ccd7801ab4d4
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.040 × 10⁹⁷(98-digit number)
10403089475639660865…35353829505087467519
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.040 × 10⁹⁷(98-digit number)
10403089475639660865…35353829505087467519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.080 × 10⁹⁷(98-digit number)
20806178951279321731…70707659010174935039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.161 × 10⁹⁷(98-digit number)
41612357902558643463…41415318020349870079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.322 × 10⁹⁷(98-digit number)
83224715805117286926…82830636040699740159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.664 × 10⁹⁸(99-digit number)
16644943161023457385…65661272081399480319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.328 × 10⁹⁸(99-digit number)
33289886322046914770…31322544162798960639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.657 × 10⁹⁸(99-digit number)
66579772644093829541…62645088325597921279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.331 × 10⁹⁹(100-digit number)
13315954528818765908…25290176651195842559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.663 × 10⁹⁹(100-digit number)
26631909057637531816…50580353302391685119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.326 × 10⁹⁹(100-digit number)
53263818115275063633…01160706604783370239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.065 × 10¹⁰⁰(101-digit number)
10652763623055012726…02321413209566740479
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,961,674 XPM·at block #6,839,671 · 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