Block #3,055,554

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 2/16/2019, 3:44:04 PM · Difficulty 11.0044 · 3,761,538 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f60f3cb7668f6b906a868daadf1164e45ce0483c7d9cb4a78c7a93a4d9af2081

Height

#3,055,554

Difficulty

11.004387

Transactions

11

Size

3.71 KB

Version

2

Bits

0b011f85

Nonce

1,620,787,373

Timestamp

2/16/2019, 3:44:04 PM

Confirmations

3,761,538

Merkle Root

120e996a3b4ca67d2f5c8a5549d0fc30a47126ba4192a8a8dfbb718fc4f88e35
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.312 × 10⁹⁴(95-digit number)
23128336120235699388…04730815844297078001
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.312 × 10⁹⁴(95-digit number)
23128336120235699388…04730815844297078001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.625 × 10⁹⁴(95-digit number)
46256672240471398776…09461631688594156001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.251 × 10⁹⁴(95-digit number)
92513344480942797552…18923263377188312001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.850 × 10⁹⁵(96-digit number)
18502668896188559510…37846526754376624001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.700 × 10⁹⁵(96-digit number)
37005337792377119020…75693053508753248001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.401 × 10⁹⁵(96-digit number)
74010675584754238041…51386107017506496001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.480 × 10⁹⁶(97-digit number)
14802135116950847608…02772214035012992001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.960 × 10⁹⁶(97-digit number)
29604270233901695216…05544428070025984001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.920 × 10⁹⁶(97-digit number)
59208540467803390433…11088856140051968001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.184 × 10⁹⁷(98-digit number)
11841708093560678086…22177712280103936001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.368 × 10⁹⁷(98-digit number)
23683416187121356173…44355424560207872001
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,780,773 XPM·at block #6,817,091 · 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