Block #2,471,196

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/13/2018, 2:27:15 PM · Difficulty 10.9618 · 4,373,646 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
193506a56eb46a9da596f8620fce3bd24d557e0026d3c77323a3f6f93880a8d9

Height

#2,471,196

Difficulty

10.961760

Transactions

48

Size

15.57 KB

Version

2

Bits

0af635e8

Nonce

275,667,011

Timestamp

1/13/2018, 2:27:15 PM

Confirmations

4,373,646

Merkle Root

4b84cec52e4f09ffbc5bb6a5a14471e720a6fb6a7c5e6d690934feccc321c7a1
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.013 × 10⁹³(94-digit number)
10133801611278184307…43924005886754103199
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.013 × 10⁹³(94-digit number)
10133801611278184307…43924005886754103199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.026 × 10⁹³(94-digit number)
20267603222556368615…87848011773508206399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.053 × 10⁹³(94-digit number)
40535206445112737230…75696023547016412799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.107 × 10⁹³(94-digit number)
81070412890225474461…51392047094032825599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.621 × 10⁹⁴(95-digit number)
16214082578045094892…02784094188065651199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.242 × 10⁹⁴(95-digit number)
32428165156090189784…05568188376131302399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.485 × 10⁹⁴(95-digit number)
64856330312180379568…11136376752262604799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.297 × 10⁹⁵(96-digit number)
12971266062436075913…22272753504525209599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.594 × 10⁹⁵(96-digit number)
25942532124872151827…44545507009050419199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.188 × 10⁹⁵(96-digit number)
51885064249744303655…89091014018100838399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.037 × 10⁹⁶(97-digit number)
10377012849948860731…78182028036201676799
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:58,003,145 XPM·at block #6,844,841 · 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