Block #706,701

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/4/2014, 9:05:28 AM · Difficulty 10.9587 · 6,107,656 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
70e89ea21d2117592950ce4b439be625ea62f15dc676a53152d42c0b177b0f9f

Height

#706,701

Difficulty

10.958668

Transactions

6

Size

2.13 KB

Version

2

Bits

0af56b40

Nonce

95,676,474

Timestamp

9/4/2014, 9:05:28 AM

Confirmations

6,107,656

Merkle Root

2cf12083d06b1a370cb97e26a45726411b779dbb8bb8cb4ece533a0012117e54
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.

6.122 × 10⁹⁷(98-digit number)
61224333761381783026…17157908457853337599
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
6.122 × 10⁹⁷(98-digit number)
61224333761381783026…17157908457853337599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.224 × 10⁹⁸(99-digit number)
12244866752276356605…34315816915706675199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.448 × 10⁹⁸(99-digit number)
24489733504552713210…68631633831413350399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.897 × 10⁹⁸(99-digit number)
48979467009105426421…37263267662826700799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.795 × 10⁹⁸(99-digit number)
97958934018210852842…74526535325653401599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.959 × 10⁹⁹(100-digit number)
19591786803642170568…49053070651306803199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.918 × 10⁹⁹(100-digit number)
39183573607284341136…98106141302613606399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.836 × 10⁹⁹(100-digit number)
78367147214568682273…96212282605227212799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.567 × 10¹⁰⁰(101-digit number)
15673429442913736454…92424565210454425599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.134 × 10¹⁰⁰(101-digit number)
31346858885827472909…84849130420908851199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.269 × 10¹⁰⁰(101-digit number)
62693717771654945819…69698260841817702399
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,758,922 XPM·at block #6,814,356 · 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