Block #2,130,194

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/24/2017, 6:43:38 AM · Difficulty 10.9093 · 4,707,535 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
877fb5ae556595cb435c8f65404f1c452338bf3679b3f2c8c49e1b0741b4f1cb

Height

#2,130,194

Difficulty

10.909330

Transactions

2

Size

425 B

Version

2

Bits

0ae8c9db

Nonce

1,798,583,793

Timestamp

5/24/2017, 6:43:38 AM

Confirmations

4,707,535

Merkle Root

e07f2404e48a47c23ba543a3a81d5bef72390a4449281a09c22ef50f37d7703e
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.

4.865 × 10⁹⁴(95-digit number)
48656092084500053467…29215403326379656219
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
4.865 × 10⁹⁴(95-digit number)
48656092084500053467…29215403326379656219
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.731 × 10⁹⁴(95-digit number)
97312184169000106935…58430806652759312439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.946 × 10⁹⁵(96-digit number)
19462436833800021387…16861613305518624879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.892 × 10⁹⁵(96-digit number)
38924873667600042774…33723226611037249759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.784 × 10⁹⁵(96-digit number)
77849747335200085548…67446453222074499519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.556 × 10⁹⁶(97-digit number)
15569949467040017109…34892906444148999039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.113 × 10⁹⁶(97-digit number)
31139898934080034219…69785812888297998079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.227 × 10⁹⁶(97-digit number)
62279797868160068438…39571625776595996159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.245 × 10⁹⁷(98-digit number)
12455959573632013687…79143251553191992319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.491 × 10⁹⁷(98-digit number)
24911919147264027375…58286503106383984639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.982 × 10⁹⁷(98-digit number)
49823838294528054750…16573006212767969279
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,946,163 XPM·at block #6,837,728 · 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