Block #3,056,856

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 2/17/2019, 12:54:38 PM · Difficulty 11.0108 · 3,768,767 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c20ebec49761de0c748e44d976b8f46d0d0b60c95a82c600dd1a6978da4fca51

Height

#3,056,856

Difficulty

11.010753

Transactions

10

Size

3.41 KB

Version

2

Bits

0b02c0ba

Nonce

71,904,690

Timestamp

2/17/2019, 12:54:38 PM

Confirmations

3,768,767

Merkle Root

1aab7c75b8b4a03ca3f302386ac9d4fdd1b4bbcba8533ed4854d65baa56ef302
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.929 × 10⁹²(93-digit number)
19297603808053686253…71324289609828275679
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.929 × 10⁹²(93-digit number)
19297603808053686253…71324289609828275679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.859 × 10⁹²(93-digit number)
38595207616107372506…42648579219656551359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.719 × 10⁹²(93-digit number)
77190415232214745012…85297158439313102719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.543 × 10⁹³(94-digit number)
15438083046442949002…70594316878626205439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.087 × 10⁹³(94-digit number)
30876166092885898004…41188633757252410879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.175 × 10⁹³(94-digit number)
61752332185771796009…82377267514504821759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.235 × 10⁹⁴(95-digit number)
12350466437154359201…64754535029009643519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.470 × 10⁹⁴(95-digit number)
24700932874308718403…29509070058019287039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.940 × 10⁹⁴(95-digit number)
49401865748617436807…59018140116038574079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.880 × 10⁹⁴(95-digit number)
98803731497234873615…18036280232077148159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.976 × 10⁹⁵(96-digit number)
19760746299446974723…36072560464154296319
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,849,086 XPM·at block #6,825,622 · 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