Block #735,234

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/22/2014, 11:46:51 AM · Difficulty 10.9752 · 6,089,900 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9d824d18ffdaa23b497a330dc4b8902b14f7e641833e65b59af08ee4b6239308

Height

#735,234

Difficulty

10.975159

Transactions

7

Size

28.26 KB

Version

2

Bits

0af9a405

Nonce

120,937,473

Timestamp

9/22/2014, 11:46:51 AM

Confirmations

6,089,900

Merkle Root

617cf4d752b791c0d264a5379d4e778c8fdb33406c9cb40df07b0e4b7e82091d
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.

1.043 × 10⁹⁶(97-digit number)
10430671183229111786…65899989157013975719
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
1.043 × 10⁹⁶(97-digit number)
10430671183229111786…65899989157013975719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.086 × 10⁹⁶(97-digit number)
20861342366458223572…31799978314027951439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.172 × 10⁹⁶(97-digit number)
41722684732916447144…63599956628055902879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.344 × 10⁹⁶(97-digit number)
83445369465832894289…27199913256111805759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.668 × 10⁹⁷(98-digit number)
16689073893166578857…54399826512223611519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.337 × 10⁹⁷(98-digit number)
33378147786333157715…08799653024447223039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.675 × 10⁹⁷(98-digit number)
66756295572666315431…17599306048894446079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.335 × 10⁹⁸(99-digit number)
13351259114533263086…35198612097788892159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.670 × 10⁹⁸(99-digit number)
26702518229066526172…70397224195577784319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.340 × 10⁹⁸(99-digit number)
53405036458133052345…40794448391155568639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.068 × 10⁹⁹(100-digit number)
10681007291626610469…81588896782311137279
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,845,157 XPM·at block #6,825,133 · 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