Block #2,934,673

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 11/22/2018, 5:40:31 PM · Difficulty 11.3941 · 3,909,749 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5104a0876c1d6277a49c3dcac4ebcd389a351c4d55157fed90fe60ff7f5a157f

Height

#2,934,673

Difficulty

11.394121

Transactions

6

Size

1.82 KB

Version

2

Bits

0b64e519

Nonce

1,271,899,149

Timestamp

11/22/2018, 5:40:31 PM

Confirmations

3,909,749

Merkle Root

ba9733aa141eead13558d91e3c98bbbdaa25d5b492195d3db058c004904f4a6d
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.760 × 10⁹⁵(96-digit number)
27601434164657279551…66595629005849287679
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.760 × 10⁹⁵(96-digit number)
27601434164657279551…66595629005849287679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.520 × 10⁹⁵(96-digit number)
55202868329314559102…33191258011698575359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.104 × 10⁹⁶(97-digit number)
11040573665862911820…66382516023397150719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.208 × 10⁹⁶(97-digit number)
22081147331725823640…32765032046794301439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.416 × 10⁹⁶(97-digit number)
44162294663451647281…65530064093588602879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.832 × 10⁹⁶(97-digit number)
88324589326903294563…31060128187177205759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.766 × 10⁹⁷(98-digit number)
17664917865380658912…62120256374354411519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.532 × 10⁹⁷(98-digit number)
35329835730761317825…24240512748708823039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.065 × 10⁹⁷(98-digit number)
70659671461522635650…48481025497417646079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.413 × 10⁹⁸(99-digit number)
14131934292304527130…96962050994835292159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.826 × 10⁹⁸(99-digit number)
28263868584609054260…93924101989670584319
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,999,771 XPM·at block #6,844,421 · 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