Block #2,929,780

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 11/19/2018, 9:17:25 AM · Difficulty 11.3854 · 3,897,129 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c0d216fc222c624a8dad1f5e9c81804562c817b5f6854613b17243f3fbe14c27

Height

#2,929,780

Difficulty

11.385383

Transactions

2

Size

1.42 KB

Version

2

Bits

0b62a874

Nonce

124,669,860

Timestamp

11/19/2018, 9:17:25 AM

Confirmations

3,897,129

Merkle Root

c5988caecc082bdcc2e4581f9efdd6cd6524713bc0ea9923fc36571c01f9aeea
Transactions (2)
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.

9.331 × 10⁹²(93-digit number)
93310135160111441154…39448193398857259521
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
9.331 × 10⁹²(93-digit number)
93310135160111441154…39448193398857259521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.866 × 10⁹³(94-digit number)
18662027032022288230…78896386797714519041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.732 × 10⁹³(94-digit number)
37324054064044576461…57792773595429038081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.464 × 10⁹³(94-digit number)
74648108128089152923…15585547190858076161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.492 × 10⁹⁴(95-digit number)
14929621625617830584…31171094381716152321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.985 × 10⁹⁴(95-digit number)
29859243251235661169…62342188763432304641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.971 × 10⁹⁴(95-digit number)
59718486502471322338…24684377526864609281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.194 × 10⁹⁵(96-digit number)
11943697300494264467…49368755053729218561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.388 × 10⁹⁵(96-digit number)
23887394600988528935…98737510107458437121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.777 × 10⁹⁵(96-digit number)
47774789201977057870…97475020214916874241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
9.554 × 10⁹⁵(96-digit number)
95549578403954115741…94950040429833748481
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,859,440 XPM·at block #6,826,908 · 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