Block #1,692,308

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 7/28/2016, 6:42:44 AM · Difficulty 10.6839 · 5,138,153 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1cc04967818a850b2cf5a105f351c024791334a3ae408314249bd24b425e935e

Height

#1,692,308

Difficulty

10.683944

Transactions

2

Size

1.14 KB

Version

2

Bits

0aaf16ed

Nonce

751,673,274

Timestamp

7/28/2016, 6:42:44 AM

Confirmations

5,138,153

Merkle Root

21adc9e5a3efa41e551c09653d4384b61f6701f2bd78574af39bf304b4876d35
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.

2.405 × 10⁹⁴(95-digit number)
24050559490984662670…60200741046862501759
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
2.405 × 10⁹⁴(95-digit number)
24050559490984662670…60200741046862501759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.810 × 10⁹⁴(95-digit number)
48101118981969325340…20401482093725003519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.620 × 10⁹⁴(95-digit number)
96202237963938650681…40802964187450007039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.924 × 10⁹⁵(96-digit number)
19240447592787730136…81605928374900014079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.848 × 10⁹⁵(96-digit number)
38480895185575460272…63211856749800028159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.696 × 10⁹⁵(96-digit number)
76961790371150920545…26423713499600056319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.539 × 10⁹⁶(97-digit number)
15392358074230184109…52847426999200112639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.078 × 10⁹⁶(97-digit number)
30784716148460368218…05694853998400225279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.156 × 10⁹⁶(97-digit number)
61569432296920736436…11389707996800450559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.231 × 10⁹⁷(98-digit number)
12313886459384147287…22779415993600901119
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,887,935 XPM·at block #6,830,460 · 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