Block #1,182,186

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/4/2015, 3:59:35 AM · Difficulty 10.9145 · 5,657,487 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
de0571c94f2ac639ed202cd6d0427c0bfe31b78ac9f325da466cbf3407855dda

Height

#1,182,186

Difficulty

10.914462

Transactions

2

Size

33.94 KB

Version

2

Bits

0aea1a34

Nonce

1,742,754,445

Timestamp

8/4/2015, 3:59:35 AM

Confirmations

5,657,487

Merkle Root

c9695b088d0144ac1b1fd0782109d01699d043e87d5dff46e26ce4788e5c33de
Transactions (2)
1 in → 1 out8.7400 XPM110 B
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.117 × 10⁹⁵(96-digit number)
91178573650712729252…58724640941048586239
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.117 × 10⁹⁵(96-digit number)
91178573650712729252…58724640941048586239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.823 × 10⁹⁶(97-digit number)
18235714730142545850…17449281882097172479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.647 × 10⁹⁶(97-digit number)
36471429460285091700…34898563764194344959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.294 × 10⁹⁶(97-digit number)
72942858920570183401…69797127528388689919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.458 × 10⁹⁷(98-digit number)
14588571784114036680…39594255056777379839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.917 × 10⁹⁷(98-digit number)
29177143568228073360…79188510113554759679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.835 × 10⁹⁷(98-digit number)
58354287136456146721…58377020227109519359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.167 × 10⁹⁸(99-digit number)
11670857427291229344…16754040454219038719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.334 × 10⁹⁸(99-digit number)
23341714854582458688…33508080908438077439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.668 × 10⁹⁸(99-digit number)
46683429709164917377…67016161816876154879
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,961,673 XPM·at block #6,839,672 · 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