21 Nov
2025
21 Nov
'25
1:15 a.m.
Hello,
you can find the meeting minutes of our annual board and council
election meeting here:
https://wiki.xmpp.org/web/Meeting-Minutes-2025-11-20
All Council candidates were accepted. The following individuals will
form the XSF council for the 2025/2026 term:
* Dan Caseley
* Daniel Gultsch
* Jérôme Poisson
* Stephen Paul Weber
* Marvin Wißfeld
For the board candidates we have a tie on the 5th position between
Adrien and Arne. Our bylaws state that the fifth candidate will be
chosen with:
RFC 3797: Publicly Verifiable Nominations Committee (NomCom) Random
Selection
The currently elected individuals for position 1-4 are:
* Guus der Kinderen
* Mickaël Rémond
* Ralph Meijer
* Florian Schmaus
I am suggesting that we use similar procedure to what we used in 2017
when we had our last tie. The solution was proposed by Dave Cridland.
Its compliant with our bylaws.
The proposal is the following:
1) As random input source, I propose using the "Main Numbers" from the
Euro Millions draw of next Tuesday (2025-11-25), as announced here:
https://www.euro-millions.com/results
2) Each number will be arranged in ascending order, separated by dots,
and terminated by "./".
3) The resultant string will be hashed according to SHA-256.
4) The tied candidates will be arranged into alphabetic order (note,
in this case this may be by first or last name, it makes no
difference), to produce:
* Adrien Bourmault
* Arne-Bruen Vogelsang
5) These will be numbered from 0. Adrien is 0, and Arne by 1.
6) The decimal representation of the last byte in the hash, modulo the
number of candidates will then be used to select the candidate.
As example, if we take these numbers:
02 - 10 - 14 - 28 - 31
We'd form the string with the numbers ordered of "02.10.14.28.31./"
Which we can hash with:
sha256('02.10.14.28.31./').hexdigest()
Producing a hash (in hex) of
'ad2edee63a88d7b4b6109944b5222a6cce1c3719ac4d41acd0dbf8287465ace0'
The last byte in the hash 'e0' is 224 in dec.
224 mod 2 = 0
This would result in candidate 0 being selected (Adrien).
I have created a small script to create the results with this algo.
It is on GitHub here:
https://gist.github.com/agnauck/8996415c1a91e5b6e1d27cad0367c85b
and you can run it online here:
https://sharplab.io/#gist:8996415c1a91e5b6e1d27cad0367c85b
Alex
21 Nov
21 Nov
8:28 a.m.
Thanks, Alex. That proposal worked fine last time, and seems reasonable and fair. Please
proceed.
--
ralphm
On 21 November 2025 01:15:11 CET, Alexander Gnauck <gnauck(a)gmail.com> wrote:
Hello,
you can find the meeting minutes of our annual board and council election meeting here:
https://wiki.xmpp.org/web/Meeting-Minutes-2025-11-20
All Council candidates were accepted. The following individuals will form the XSF council
for the 2025/2026 term:
* Dan Caseley
* Daniel Gultsch
* Jérôme Poisson
* Stephen Paul Weber
* Marvin Wißfeld
For the board candidates we have a tie on the 5th position between Adrien and Arne. Our
bylaws state that the fifth candidate will be chosen with:
RFC 3797: Publicly Verifiable Nominations Committee (NomCom) Random Selection
The currently elected individuals for position 1-4 are:
* Guus der Kinderen
* Mickaël Rémond
* Ralph Meijer
* Florian Schmaus
I am suggesting that we use similar procedure to what we used in 2017 when we had our last
tie. The solution was proposed by Dave Cridland. Its compliant with our bylaws.
The proposal is the following:
1) As random input source, I propose using the "Main Numbers" from the
Euro Millions draw of next Tuesday (2025-11-25), as announced here:
https://www.euro-millions.com/results
2) Each number will be arranged in ascending order, separated by dots,
and terminated by "./".
3) The resultant string will be hashed according to SHA-256.
4) The tied candidates will be arranged into alphabetic order (note,
in this case this may be by first or last name, it makes no
difference), to produce:
* Adrien Bourmault
* Arne-Bruen Vogelsang
5) These will be numbered from 0. Adrien is 0, and Arne by 1.
6) The decimal representation of the last byte in the hash, modulo the number of
candidates will then be used to select the candidate.
As example, if we take these numbers:
02 - 10 - 14 - 28 - 31
We'd form the string with the numbers ordered of "02.10.14.28.31./"
Which we can hash with:
sha256('02.10.14.28.31./').hexdigest()
Producing a hash (in hex) of
'ad2edee63a88d7b4b6109944b5222a6cce1c3719ac4d41acd0dbf8287465ace0'
The last byte in the hash 'e0' is 224 in dec.
224 mod 2 = 0
This would result in candidate 0 being selected (Adrien).
I have created a small script to create the results with this algo.
It is on GitHub here:
https://gist.github.com/agnauck/8996415c1a91e5b6e1d27cad0367c85b
and you can run it online here:
https://sharplab.io/#gist:8996415c1a91e5b6e1d27cad0367c85b
Alex
9:41 a.m.
Hey all,
Thanks Alex for writing this up.
Using the same tie-break method that we used back in 2017 makes sense to
me. It matches what the bylaws ask for, it is easy for everyone to verify,
and there is a clear precedent. I am happy for us to go ahead with this
approach.
Thanks everyone for helping wrap this up.
Kind regards,
Guus
On Fri, Nov 21, 2025 at 1:15 AM Alexander Gnauck <gnauck(a)gmail.com> wrote:
Hello,
you can find the meeting minutes of our annual board and council
election meeting here:
https://wiki.xmpp.org/web/Meeting-Minutes-2025-11-20
All Council candidates were accepted. The following individuals will
form the XSF council for the 2025/2026 term:
* Dan Caseley
* Daniel Gultsch
* Jérôme Poisson
* Stephen Paul Weber
* Marvin Wißfeld
For the board candidates we have a tie on the 5th position between
Adrien and Arne. Our bylaws state that the fifth candidate will be
chosen with:
RFC 3797: Publicly Verifiable Nominations Committee (NomCom) Random
Selection
The currently elected individuals for position 1-4 are:
* Guus der Kinderen
* Mickaël Rémond
* Ralph Meijer
* Florian Schmaus
I am suggesting that we use similar procedure to what we used in 2017
when we had our last tie. The solution was proposed by Dave Cridland.
Its compliant with our bylaws.
The proposal is the following:
1) As random input source, I propose using the "Main Numbers" from the
Euro Millions draw of next Tuesday (2025-11-25), as announced here:
https://www.euro-millions.com/results
2) Each number will be arranged in ascending order, separated by dots,
and terminated by "./".
3) The resultant string will be hashed according to SHA-256.
4) The tied candidates will be arranged into alphabetic order (note,
in this case this may be by first or last name, it makes no
difference), to produce:
* Adrien Bourmault
* Arne-Bruen Vogelsang
5) These will be numbered from 0. Adrien is 0, and Arne by 1.
6) The decimal representation of the last byte in the hash, modulo the
number of candidates will then be used to select the candidate.
As example, if we take these numbers:
02 - 10 - 14 - 28 - 31
We'd form the string with the numbers ordered of "02.10.14.28.31./"
Which we can hash with:
sha256('02.10.14.28.31./').hexdigest()
Producing a hash (in hex) of
'ad2edee63a88d7b4b6109944b5222a6cce1c3719ac4d41acd0dbf8287465ace0'
The last byte in the hash 'e0' is 224 in dec.
224 mod 2 = 0
This would result in candidate 0 being selected (Adrien).
I have created a small script to create the results with this algo.
It is on GitHub here:
https://gist.github.com/agnauck/8996415c1a91e5b6e1d27cad0367c85b
and you can run it online here:
https://sharplab.io/#gist:8996415c1a91e5b6e1d27cad0367c85b
Alex
11:34 a.m.
Hi Alex and thanks for taking care of this.
As I said during the meeting on the XSF room, I think this is fair and
reasonable as it matches the bylaws and is easy to reproduce. There is
a precedent in 2017 using this method, so please proceed! 😊️
Thanks a lot and have a nice day,
--
Adrien Bourmault (neox)
7:20 p.m.
Absolutely love it. made my friday evening!!! you are the best!!!
Sent on the fly from mobile running on solarenergy from http://Watt-s.com
Den fre 21 nov. 2025 11:34Adrien 'neox' Bourmault <neox(a)a-lec.org> skrev:
Hi Alex and thanks for taking care of this.
As I said during the meeting on the XSF room, I think this is fair and
reasonable as it matches the bylaws and is easy to reproduce. There is
a precedent in 2017 using this method, so please proceed! 😊️
Thanks a lot and have a nice day,
--
Adrien Bourmault (neox)
22 Nov
22 Nov
10:50 p.m.
Hi Alex,
As I said in the meeting I see no reason to do some complicated procedure including a hash
before doing 'mod 2' and picking the winner when we could just do 'mod 2'
on the value of the first ball for a fair tie break.
The only reason anyone brought up so far is "we made this mistake in the past
already" which seems like a bad reason to do it again.
Thanks,
Travis
On November 20, 2025 7:15:11 PM EST, Alexander Gnauck <gnauck(a)gmail.com> wrote:
Hello,
you can find the meeting minutes of our annual board and council election meeting here:
https://wiki.xmpp.org/web/Meeting-Minutes-2025-11-20
All Council candidates were accepted. The following individuals will form the XSF council
for the 2025/2026 term:
* Dan Caseley
* Daniel Gultsch
* Jérôme Poisson
* Stephen Paul Weber
* Marvin Wißfeld
For the board candidates we have a tie on the 5th position between Adrien and Arne. Our
bylaws state that the fifth candidate will be chosen with:
RFC 3797: Publicly Verifiable Nominations Committee (NomCom) Random Selection
The currently elected individuals for position 1-4 are:
* Guus der Kinderen
* Mickaël Rémond
* Ralph Meijer
* Florian Schmaus
I am suggesting that we use similar procedure to what we used in 2017 when we had our last
tie. The solution was proposed by Dave Cridland. Its compliant with our bylaws.
The proposal is the following:
1) As random input source, I propose using the "Main Numbers" from the
Euro Millions draw of next Tuesday (2025-11-25), as announced here:
https://www.euro-millions.com/results
2) Each number will be arranged in ascending order, separated by dots,
and terminated by "./".
3) The resultant string will be hashed according to SHA-256.
4) The tied candidates will be arranged into alphabetic order (note,
in this case this may be by first or last name, it makes no
difference), to produce:
* Adrien Bourmault
* Arne-Bruen Vogelsang
5) These will be numbered from 0. Adrien is 0, and Arne by 1.
6) The decimal representation of the last byte in the hash, modulo the number of
candidates will then be used to select the candidate.
As example, if we take these numbers:
02 - 10 - 14 - 28 - 31
We'd form the string with the numbers ordered of "02.10.14.28.31./"
Which we can hash with:
sha256('02.10.14.28.31./').hexdigest()
Producing a hash (in hex) of
'ad2edee63a88d7b4b6109944b5222a6cce1c3719ac4d41acd0dbf8287465ace0'
The last byte in the hash 'e0' is 224 in dec.
224 mod 2 = 0
This would result in candidate 0 being selected (Adrien).
I have created a small script to create the results with this algo.
It is on GitHub here:
https://gist.github.com/agnauck/8996415c1a91e5b6e1d27cad0367c85b
and you can run it online here:
https://sharplab.io/#gist:8996415c1a91e5b6e1d27cad0367c85b
Alex
11:35 p.m.
I think this is a misunderstanding. The way I read the RFC, you need to pick a hash
function as was suggested by Alex. The use of the RFC is mandated by our bylaws, I
disagree it is complex, and so far you are the only one arguing against it, without any
clear benefit to your alternative suggestion. This resulted in holding up the completion
of the election, as your concerns prevented us from concluding a procedure in the meeting,
and using the Friday draw.
In the interest of completion I'd take rough consensus as our guideline, as is our
usual approach. Also note that both candidates expressed being fine with the proposal. So
unless I see anyone else arguing against Alex' proposal, I think Alex should just go
ahead as proposed, and prevent further bikeshedding.
--
ralphm
On 22 November 2025 22:50:24 CET, Travis Burtrum <travis(a)burtrum.org> wrote:
Hi Alex,
As I said in the meeting I see no reason to do some complicated procedure including a hash
before doing 'mod 2' and picking the winner when we could just do 'mod 2'
on the value of the first ball for a fair tie break.
The only reason anyone brought up so far is "we made this mistake in the past
already" which seems like a bad reason to do it again.
Thanks,
Travis
On November 20, 2025 7:15:11 PM EST, Alexander Gnauck <gnauck(a)gmail.com> wrote:
>Hello,
>
>you can find the meeting minutes of our annual board and council election meeting
here:
>https://wiki.xmpp.org/web/Meeting-Minutes-2025-11-20
>
>All Council candidates were accepted. The following individuals will form the XSF
council for the 2025/2026 term:
>
>* Dan Caseley
>* Daniel Gultsch
>* Jérôme Poisson
>* Stephen Paul Weber
>* Marvin Wißfeld
>
>For the board candidates we have a tie on the 5th position between Adrien and Arne.
Our bylaws state that the fifth candidate will be chosen with:
>
>RFC 3797: Publicly Verifiable Nominations Committee (NomCom) Random Selection
>
>The currently elected individuals for position 1-4 are:
>
>* Guus der Kinderen
>* Mickaël Rémond
>* Ralph Meijer
>* Florian Schmaus
>
>I am suggesting that we use similar procedure to what we used in 2017 when we had our
last tie. The solution was proposed by Dave Cridland. Its compliant with our bylaws.
>
>The proposal is the following:
>
>1) As random input source, I propose using the "Main Numbers" from the
>Euro Millions draw of next Tuesday (2025-11-25), as announced here:
>https://www.euro-millions.com/results
>
>2) Each number will be arranged in ascending order, separated by dots,
>and terminated by "./".
>
>3) The resultant string will be hashed according to SHA-256.
>
>4) The tied candidates will be arranged into alphabetic order (note,
>in this case this may be by first or last name, it makes no
>difference), to produce:
>
>* Adrien Bourmault
>* Arne-Bruen Vogelsang
>
>5) These will be numbered from 0. Adrien is 0, and Arne by 1.
>
>6) The decimal representation of the last byte in the hash, modulo the number of
candidates will then be used to select the candidate.
>
>As example, if we take these numbers:
>
>02 - 10 - 14 - 28 - 31
>
>We'd form the string with the numbers ordered of "02.10.14.28.31./"
>Which we can hash with:
>
>sha256('02.10.14.28.31./').hexdigest()
>
>Producing a hash (in hex) of
>'ad2edee63a88d7b4b6109944b5222a6cce1c3719ac4d41acd0dbf8287465ace0'
>
>The last byte in the hash 'e0' is 224 in dec.
>224 mod 2 = 0
>
>This would result in candidate 0 being selected (Adrien).
>
>I have created a small script to create the results with this algo.
>
>It is on GitHub here:
>https://gist.github.com/agnauck/8996415c1a91e5b6e1d27cad0367c85b
>
>and you can run it online here:
>https://sharplab.io/#gist:8996415c1a91e5b6e1d27cad0367c85b
>
>Alex
24 Nov
24 Nov
11:57 a.m.
As I said in the meeting I see no reason to do some
complicated
procedure including a hash before doing 'mod 2' and picking the winner
when we could just do 'mod 2' on the value of the first ball for a fair
tie break.> The only reason anyone brought up so far is "we made this mistake in
the
past already" which seems like a bad reason to do it again.
it sounds overkill for a tie of 2. But this solution can be easily
extended in cases where we have a tie of more than 2 applicants, or more
than 1 seat. The hash has enough bytes to resolve multiple. I will
document this on our Wiki soon as well.
Alex
26 Nov
26 Nov
12:36 p.m.
Hello,
we have the results of the random election
The following numbers were drawn last night:
6 - 11 - 17 - 35 - 44
Which results in the following string:
06.11.17.35.44./
and sha256 hex hash:
44dd25ac935469ff77bcab62e6aeaa2b2b8e727c93085cf93d385c1f7d35e853
and a result after the mod of:
1
The fifth board seat goes to Arne.
I have updated our minutes here:
https://wiki.xmpp.org/web/Meeting-Minutes-2025-11-20
Thanks again to all applicants and also previous board and council
members for volunteering and the work they have done.
Thanks,
Alex
Am 21.11.25 um 01:15 schrieb Alexander Gnauck:
Hello,
you can find the meeting minutes of our annual board and council
election meeting here:
https://wiki.xmpp.org/web/Meeting-Minutes-2025-11-20
All Council candidates were accepted. The following individuals will
form the XSF council for the 2025/2026 term:
* Dan Caseley
* Daniel Gultsch
* Jérôme Poisson
* Stephen Paul Weber
* Marvin Wißfeld
For the board candidates we have a tie on the 5th position between
Adrien and Arne. Our bylaws state that the fifth candidate will be
chosen with:
RFC 3797: Publicly Verifiable Nominations Committee (NomCom) Random
Selection
The currently elected individuals for position 1-4 are:
* Guus der Kinderen
* Mickaël Rémond
* Ralph Meijer
* Florian Schmaus
I am suggesting that we use similar procedure to what we used in 2017
when we had our last tie. The solution was proposed by Dave Cridland.
Its compliant with our bylaws.
The proposal is the following:
1) As random input source, I propose using the "Main Numbers" from the
Euro Millions draw of next Tuesday (2025-11-25), as announced here:
https://www.euro-millions.com/results
2) Each number will be arranged in ascending order, separated by dots,
and terminated by "./".
3) The resultant string will be hashed according to SHA-256.
4) The tied candidates will be arranged into alphabetic order (note,
in this case this may be by first or last name, it makes no
difference), to produce:
* Adrien Bourmault
* Arne-Bruen Vogelsang
5) These will be numbered from 0. Adrien is 0, and Arne by 1.
6) The decimal representation of the last byte in the hash, modulo the
number of candidates will then be used to select the candidate.
As example, if we take these numbers:
02 - 10 - 14 - 28 - 31
We'd form the string with the numbers ordered of "02.10.14.28.31./"
Which we can hash with:
sha256('02.10.14.28.31./').hexdigest()
Producing a hash (in hex) of
'ad2edee63a88d7b4b6109944b5222a6cce1c3719ac4d41acd0dbf8287465ace0'
The last byte in the hash 'e0' is 224 in dec.
224 mod 2 = 0
This would result in candidate 0 being selected (Adrien).
I have created a small script to create the results with this algo.
It is on GitHub here:
https://gist.github.com/agnauck/8996415c1a91e5b6e1d27cad0367c85b
and you can run it online here:
https://sharplab.io/#gist:8996415c1a91e5b6e1d27cad0367c85b
Alex
1:36 p.m.
Thank you Alex and welcome Arne!
26 nov 2025 12:36:57 Alexander Gnauck <gnauck(a)gmail.com>om>:
Hello,
we have the results of the random election
The following numbers were drawn last night:
6 - 11 - 17 - 35 - 44
Which results in the following string:
06.11.17.35.44./
and sha256 hex hash:
44dd25ac935469ff77bcab62e6aeaa2b2b8e727c93085cf93d385c1f7d35e853
and a result after the mod of:
1
The fifth board seat goes to Arne.
I have updated our minutes here:
https://wiki.xmpp.org/web/Meeting-Minutes-2025-11-20
Thanks again to all applicants and also previous board and council members for
volunteering and the work they have done.
Thanks,
Alex
Am 21.11.25 um 01:15 schrieb Alexander Gnauck:
> Hello,
> you can find the meeting minutes of our annual board and council election meeting
here:
> https://wiki.xmpp.org/web/Meeting-Minutes-2025-11-20
> All Council candidates were accepted. The following individuals will form the XSF
council for the 2025/2026 term:
> * Dan Caseley
> * Daniel Gultsch
> * Jérôme Poisson
> * Stephen Paul Weber
> * Marvin Wißfeld
> For the board candidates we have a tie on the 5th position between Adrien and Arne.
Our bylaws state that the fifth candidate will be chosen with:
> RFC 3797: Publicly Verifiable Nominations Committee (NomCom) Random Selection
> The currently elected individuals for position 1-4 are:
> * Guus der Kinderen
> * Mickaël Rémond
> * Ralph Meijer
> * Florian Schmaus
> I am suggesting that we use similar procedure to what we used in 2017 when we had our
last tie. The solution was proposed by Dave Cridland. Its compliant with our bylaws.
> The proposal is the following:
> 1) As random input source, I propose using the "Main Numbers" from the
> Euro Millions draw of next Tuesday (2025-11-25), as announced here:
> https://www.euro-millions.com/results
> 2) Each number will be arranged in ascending order, separated by dots,
> and terminated by "./".
> 3) The resultant string will be hashed according to SHA-256.
> 4) The tied candidates will be arranged into alphabetic order (note,
> in this case this may be by first or last name, it makes no
> difference), to produce:
> * Adrien Bourmault
> * Arne-Bruen Vogelsang
> 5) These will be numbered from 0. Adrien is 0, and Arne by 1.
> 6) The decimal representation of the last byte in the hash, modulo the number of
candidates will then be used to select the candidate.
> As example, if we take these numbers:
> 02 - 10 - 14 - 28 - 31
> We'd form the string with the numbers ordered of "02.10.14.28.31./"
> Which we can hash with:
> sha256('02.10.14.28.31./').hexdigest()
> Producing a hash (in hex) of
> 'ad2edee63a88d7b4b6109944b5222a6cce1c3719ac4d41acd0dbf8287465ace0'
> The last byte in the hash 'e0' is 224 in dec.
> 224 mod 2 = 0
> This would result in candidate 0 being selected (Adrien).
> I have created a small script to create the results with this algo.
> It is on GitHub here:
> https://gist.github.com/agnauck/8996415c1a91e5b6e1d27cad0367c85b
> and you can run it online here:
> https://sharplab.io/#gist:8996415c1a91e5b6e1d27cad0367c85b
> Alex
>
1:38 p.m.
Thank you Alex and Emus!
Am 26. November 2025 13:36:55 MEZ schrieb "E.M." <emus(a)mailbox.org>rg>:
Thank you Alex and welcome Arne!
26 nov 2025 12:36:57 Alexander Gnauck <gnauck(a)gmail.com>om>:
> Hello,
>
> we have the results of the random election
>
> The following numbers were drawn last night:
> 6 - 11 - 17 - 35 - 44
>
> Which results in the following string:
> 06.11.17.35.44./
>
> and sha256 hex hash:
> 44dd25ac935469ff77bcab62e6aeaa2b2b8e727c93085cf93d385c1f7d35e853
>
> and a result after the mod of:
> 1
>
> The fifth board seat goes to Arne.
>
> I have updated our minutes here:
> https://wiki.xmpp.org/web/Meeting-Minutes-2025-11-20
>
> Thanks again to all applicants and also previous board and council members for
volunteering and the work they have done.
>
> Thanks,
> Alex
>
>
> Am 21.11.25 um 01:15 schrieb Alexander Gnauck:
>> Hello,
>> you can find the meeting minutes of our annual board and council election meeting
here:
>> https://wiki.xmpp.org/web/Meeting-Minutes-2025-11-20
>> All Council candidates were accepted. The following individuals will form the XSF
council for the 2025/2026 term:
>> * Dan Caseley
>> * Daniel Gultsch
>> * Jérôme Poisson
>> * Stephen Paul Weber
>> * Marvin Wißfeld
>> For the board candidates we have a tie on the 5th position between Adrien and
Arne. Our bylaws state that the fifth candidate will be chosen with:
>> RFC 3797: Publicly Verifiable Nominations Committee (NomCom) Random Selection
>> The currently elected individuals for position 1-4 are:
>> * Guus der Kinderen
>> * Mickaël Rémond
>> * Ralph Meijer
>> * Florian Schmaus
>> I am suggesting that we use similar procedure to what we used in 2017 when we had
our last tie. The solution was proposed by Dave Cridland. Its compliant with our bylaws.
>> The proposal is the following:
>> 1) As random input source, I propose using the "Main Numbers" from the
>> Euro Millions draw of next Tuesday (2025-11-25), as announced here:
>> https://www.euro-millions.com/results
>> 2) Each number will be arranged in ascending order, separated by dots,
>> and terminated by "./".
>> 3) The resultant string will be hashed according to SHA-256.
>> 4) The tied candidates will be arranged into alphabetic order (note,
>> in this case this may be by first or last name, it makes no
>> difference), to produce:
>> * Adrien Bourmault
>> * Arne-Bruen Vogelsang
>> 5) These will be numbered from 0. Adrien is 0, and Arne by 1.
>> 6) The decimal representation of the last byte in the hash, modulo the number of
candidates will then be used to select the candidate.
>> As example, if we take these numbers:
>> 02 - 10 - 14 - 28 - 31
>> We'd form the string with the numbers ordered of
"02.10.14.28.31./"
>> Which we can hash with:
>> sha256('02.10.14.28.31./').hexdigest()
>> Producing a hash (in hex) of
>> 'ad2edee63a88d7b4b6109944b5222a6cce1c3719ac4d41acd0dbf8287465ace0'
>> The last byte in the hash 'e0' is 224 in dec.
>> 224 mod 2 = 0
>> This would result in candidate 0 being selected (Adrien).
>> I have created a small script to create the results with this algo.
>> It is on GitHub here:
>> https://gist.github.com/agnauck/8996415c1a91e5b6e1d27cad0367c85b
>> and you can run it online here:
>> https://sharplab.io/#gist:8996415c1a91e5b6e1d27cad0367c85b
>> Alex
>>
11:48 p.m.
Alex,
Thanks for doing this once again, and in particular this time with the tie.
Apologies for my part in making it so complicated (but those of us who
recall the first time a tie occurred will probably think it was less
complicated than the solution we ended up with that time!)
I am both delighted that Arne has a seat, and disappointed that Adrien does
not - but this was always going to be an extremely strong Board no matter
who was voted in given the candidates, and I'm very sure that this year
will see great things. Good luck to them all, though I'm quite sure they
don't need it.
Dave.
On Wed, 26 Nov 2025 at 11:36, Alexander Gnauck <gnauck(a)gmail.com> wrote:
Hello,
we have the results of the random election
The following numbers were drawn last night:
6 - 11 - 17 - 35 - 44
Which results in the following string:
06.11.17.35.44./
and sha256 hex hash:
44dd25ac935469ff77bcab62e6aeaa2b2b8e727c93085cf93d385c1f7d35e853
and a result after the mod of:
1
The fifth board seat goes to Arne.
I have updated our minutes here:
https://wiki.xmpp.org/web/Meeting-Minutes-2025-11-20
Thanks again to all applicants and also previous board and council
members for volunteering and the work they have done.
Thanks,
Alex
Am 21.11.25 um 01:15 schrieb Alexander Gnauck:
Hello,
you can find the meeting minutes of our annual board and council
election meeting here:
https://wiki.xmpp.org/web/Meeting-Minutes-2025-11-20
All Council candidates were accepted. The following individuals will
form the XSF council for the 2025/2026 term:
* Dan Caseley
* Daniel Gultsch
* Jérôme Poisson
* Stephen Paul Weber
* Marvin Wißfeld
For the board candidates we have a tie on the 5th position between
Adrien and Arne. Our bylaws state that the fifth candidate will be
chosen with:
RFC 3797: Publicly Verifiable Nominations Committee (NomCom) Random
Selection
The currently elected individuals for position 1-4 are:
* Guus der Kinderen
* Mickaël Rémond
* Ralph Meijer
* Florian Schmaus
I am suggesting that we use similar procedure to what we used in 2017
when we had our last tie. The solution was proposed by Dave Cridland.
Its compliant with our bylaws.
The proposal is the following:
1) As random input source, I propose using the "Main Numbers" from the
Euro Millions draw of next Tuesday (2025-11-25), as announced here:
https://www.euro-millions.com/results
2) Each number will be arranged in ascending order, separated by dots,
and terminated by "./".
3) The resultant string will be hashed according to SHA-256.
4) The tied candidates will be arranged into alphabetic order (note,
in this case this may be by first or last name, it makes no
difference), to produce:
* Adrien Bourmault
* Arne-Bruen Vogelsang
5) These will be numbered from 0. Adrien is 0, and Arne by 1.
6) The decimal representation of the last byte in the hash, modulo the
number of candidates will then be used to select the candidate.
As example, if we take these numbers:
02 - 10 - 14 - 28 - 31
We'd form the string with the numbers ordered of "02.10.14.28.31./"
Which we can hash with:
sha256('02.10.14.28.31./').hexdigest()
Producing a hash (in hex) of
'ad2edee63a88d7b4b6109944b5222a6cce1c3719ac4d41acd0dbf8287465ace0'
The last byte in the hash 'e0' is 224 in dec.
224 mod 2 = 0
This would result in candidate 0 being selected (Adrien).
I have created a small script to create the results with this algo.
It is on GitHub here:
https://gist.github.com/agnauck/8996415c1a91e5b6e1d27cad0367c85b
and you can run it online here:
https://sharplab.io/#gist:8996415c1a91e5b6e1d27cad0367c85b
Alex
15
days inactive
20
days old
11 comments
9 participants
participants (9)
-
Adrien 'neox' Bourmault -
Alexander Gnauck -
Arne-Brün -
Dave Cridland -
E.M. -
Guus der Kinderen -
Joachim Lindborg -
Ralph Meijer -
Travis Burtrum