Block #2,177,976

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/25/2017, 8:53:26 PM · Difficulty 10.9246 · 4,664,751 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
204beb0e4414eaddbc5c6ebb76fe469529cd7d1ee56bf410fcf9c162784e1e88

Height

#2,177,976

Difficulty

10.924560

Transactions

5

Size

1.26 KB

Version

2

Bits

0aecaff0

Nonce

462,003,336

Timestamp

6/25/2017, 8:53:26 PM

Confirmations

4,664,751

Merkle Root

7b21aab592261cdade82e1586bf947f19797b65e871d67acb81febdd9ec33006
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.776 × 10⁹⁵(96-digit number)
47761041443476546892…88717970603325357119
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.776 × 10⁹⁵(96-digit number)
47761041443476546892…88717970603325357119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.552 × 10⁹⁵(96-digit number)
95522082886953093784…77435941206650714239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.910 × 10⁹⁶(97-digit number)
19104416577390618756…54871882413301428479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.820 × 10⁹⁶(97-digit number)
38208833154781237513…09743764826602856959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.641 × 10⁹⁶(97-digit number)
76417666309562475027…19487529653205713919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.528 × 10⁹⁷(98-digit number)
15283533261912495005…38975059306411427839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.056 × 10⁹⁷(98-digit number)
30567066523824990011…77950118612822855679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.113 × 10⁹⁷(98-digit number)
61134133047649980022…55900237225645711359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.222 × 10⁹⁸(99-digit number)
12226826609529996004…11800474451291422719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.445 × 10⁹⁸(99-digit number)
24453653219059992008…23600948902582845439
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,986,155 XPM·at block #6,842,726 · 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