Block #1,693,244

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 7/28/2016, 11:22:37 PM · Difficulty 10.6800 · 5,120,879 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ca04397ce110dcee2324b292e006c394d5c3174182684e9f259313ee7e4bfed3

Height

#1,693,244

Difficulty

10.680041

Transactions

2

Size

540 B

Version

2

Bits

0aae172d

Nonce

63,136,494

Timestamp

7/28/2016, 11:22:37 PM

Confirmations

5,120,879

Merkle Root

4fbd6b5bda794144dcbee40e40b97c63f081b85189b87672b6ac43aadfabeba3
Transactions (2)
1 in → 1 out8.7600 XPM109 B
2 in → 1 out139.9900 XPM340 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.

3.596 × 10⁹⁶(97-digit number)
35967914267750785905…87913431222680586239
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
3.596 × 10⁹⁶(97-digit number)
35967914267750785905…87913431222680586239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.193 × 10⁹⁶(97-digit number)
71935828535501571810…75826862445361172479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.438 × 10⁹⁷(98-digit number)
14387165707100314362…51653724890722344959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.877 × 10⁹⁷(98-digit number)
28774331414200628724…03307449781444689919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.754 × 10⁹⁷(98-digit number)
57548662828401257448…06614899562889379839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.150 × 10⁹⁸(99-digit number)
11509732565680251489…13229799125778759679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.301 × 10⁹⁸(99-digit number)
23019465131360502979…26459598251557519359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.603 × 10⁹⁸(99-digit number)
46038930262721005958…52919196503115038719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.207 × 10⁹⁸(99-digit number)
92077860525442011917…05838393006230077439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.841 × 10⁹⁹(100-digit number)
18415572105088402383…11676786012460154879
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,757,068 XPM·at block #6,814,122 · 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