Block #2,862,622

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 10/1/2018, 11:49:10 AM · Difficulty 11.6756 · 3,981,353 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4ecadaf625d91df921500712eb32bb210b0b0234bb53307d221b3212a37b9b4e

Height

#2,862,622

Difficulty

11.675591

Transactions

4

Size

1.67 KB

Version

2

Bits

0bacf38c

Nonce

252,788,132

Timestamp

10/1/2018, 11:49:10 AM

Confirmations

3,981,353

Merkle Root

3d1e8e4a5e004e5cd49af08e481ae7f3a0ae2049e6fca1e7314489e712ddb13a
Transactions (4)
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.033 × 10⁹³(94-digit number)
10336857914343101232…60316786691130591219
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.033 × 10⁹³(94-digit number)
10336857914343101232…60316786691130591219
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.067 × 10⁹³(94-digit number)
20673715828686202464…20633573382261182439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.134 × 10⁹³(94-digit number)
41347431657372404929…41267146764522364879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.269 × 10⁹³(94-digit number)
82694863314744809859…82534293529044729759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.653 × 10⁹⁴(95-digit number)
16538972662948961971…65068587058089459519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.307 × 10⁹⁴(95-digit number)
33077945325897923943…30137174116178919039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.615 × 10⁹⁴(95-digit number)
66155890651795847887…60274348232357838079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.323 × 10⁹⁵(96-digit number)
13231178130359169577…20548696464715676159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.646 × 10⁹⁵(96-digit number)
26462356260718339155…41097392929431352319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.292 × 10⁹⁵(96-digit number)
52924712521436678310…82194785858862704639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.058 × 10⁹⁶(97-digit number)
10584942504287335662…64389571717725409279
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,996,179 XPM·at block #6,843,974 · 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